Declaration search

Search projects and Mathlib in one place.

Find source-pinned declarations outside Mathlib by name or constant. The same query runs through Loogle for genuine elaborated structural search over Mathlib.

Standalone research projects

18 source-pinned matches

Therefore index
ap_in_ff

Arithmetic Progressions Almost Periodicity · APAP.FiniteField

Open proof record

Project documentation

A finite-field approximation lemma. If A1A_1 and A2A_2 each have density at least α\alpha, then for any test set SS and 0<ε10<\varepsilon\le1 there is a subspace VV of explicitly bounded codimension such that smoothing μA1μA2\mu_{A_1}*\mu_{A_2} by the uniform measure on VV changes its total mass on SS by at most ε\varepsilon.

better_PFR_conjecture

Polynomial Freiman-Ruzsa project · PFR.RhoFunctional

Open proof record

Plain-language statement

If AF2nA \subset {\bf F}_2^n is finite non-empty with A+AKA|A+A| \leq K|A|, then there exists a subgroup HH of F2n{\bf F}_2^n with HA|H| \leq |A| such that AA can be covered by at most 2K92K^9 translates of HH.

better_PFR_conjecture'

Polynomial Freiman-Ruzsa project · PFR.RhoFunctional

Open proof record

Project documentation

Polynomial Freiman-Ruzsa theorem with exponent 99, without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K9|c|<2K^9, and HA|H|\le|A|.

di_in_ff

Arithmetic Progressions Almost Periodicity · APAP.FiniteField

Open proof record

Project documentation

A finite-field density-increment lemma. If the normalized additive correlation of AA with a set CC of density at least γ\gamma differs from its random value by at least ε\varepsilon, then there is a subspace VV of explicitly bounded codimension. Averaging 1A1_A over VV raises its LL^\infty density to at least (1+ε/32)α(1+\varepsilon/32)\alpha, where α\alpha is the density of AA.

entropic_PFR_conjecture

Polynomial Freiman-Ruzsa project · PFR.EntropyPFR

Open proof record

Plain-language statement

entropic_PFR_conjecture: For two GG-valued random variables X10,X20X^0_1, X^0_2, there is some subgroup HGH \leq G such that d[X10;UH]+d[X20;UH]11d[X10;X20]d[X^0_1;U_H] + d[X^0_2;U_H] \le 11 d[X^0_1;X^0_2].

Mathlib

7730 elaborated matches

Open in Loogle
Submodule

(R : Type u) (M : Type v) [Semiring R] [AddCommMonoid M] [Module R M] : Type v

Mathlib.Algebra.Module.Submodule.Defs

A submodule of a module is one which is closed under vector operations. This is a sufficient condition for the subset of vectors in the submodule to themselves form a module.

Documentation
Submodule.decidableEq

{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : DecidableEq (Submodule R M)

Mathlib.Algebra.Module.Submodule.Defs

`Submodule R M` almost never has decidable equality. Given an element `m ≠ 0` in `M`, `Submodule R M` has decidable equality iff all propositions are decidable. We add a global instance that `Submodule R M` has decidable equality, coming from the choice axiom, so that we don't have to provide `[DecidableEq (Submodule R M)]` arguments in lemma statements.

Documentation
Submodule.setLike

{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] : SetLike (Submodule R M) M

Mathlib.Algebra.Module.Submodule.Defs

Documentation
Submodule.toAddSubmonoid

{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Module R M] (self : Submodule R M) : AddSubmonoid M

Mathlib.Algebra.Module.Submodule.Defs

Reinterpret a `Submodule` as an `AddSubmonoid`.

Documentation

Showing 5 of 7730. Open Loogle for the complete result window.

mentions Submodule