All projects

Standalone Lean project

Polynomial Freiman-Ruzsa project

A collaborative formalization of results around the Polynomial Freiman-Ruzsa conjecture in additive combinatorics.

45indexed declarationsLean 4.33.0-rc1mathlib@79d0395a1825commit a177b2e4abe4Apache-2.0Repository Versions and build evidence

Flagship declarations

Start with the mathematical results

Pinned project revision
Project-declaredLean 4.33.0-rc1

PFR conjecture

PFR_conjecture

Plain-language statement

The polynomial Freiman-Ruzsa (PFR) conjecture: if A is a subset of an elementary abelian 2-group of doubling constant at most K, then A can be covered by at most 2 * K ^ 12 cosets of a subgroup of cardinality at most |A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

PFR conjecture improv

PFR_conjecture_improv

Project documentation

Improved polynomial Freiman-Ruzsa theorem. Let AA be a nonempty subset of a finite elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a subspace HH and a set of representatives cc such that Ac+HA\subseteq c+H, c<2K11|c|<2K^{11}, and HA|H|\le|A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Rho PFR conjecture

rho_PFR_conjecture

Plain-language statement

Fix a nonempty finite set AA in an elementary abelian 22-group. For any measurable random variables Y1,Y2Y_1,Y_2, there are a subspace HH and a random variable UU uniformly distributed on HH such that the source's ρ[#A]\rho[\,\cdot\,\#A] functional satisfies 2ρ[U#A]ρ[Y1#A]+ρ[Y2#A]+8d[Y1;Y2]2\rho[U\#A]\le\rho[Y_1\#A]+\rho[Y_2\#A]+8d[Y_1;Y_2].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Entropic PFR conjecture

entropic_PFR_conjecture

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].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture

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.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record

Project index

More declarations

Search within this project

Showing 8 of 40 additional declarations. Use project search for the complete index.

Project-declaredLean 4.33.0-rc1

Approx hom pfr

approx_hom_pfr

Project documentation

An approximate-homomorphism theorem for finite elementary abelian 22-groups. Let f:GGf:G\to G' and K>0K>0. If at least a proportion K1K^{-1} of pairs (x,y)G2(x,y)\in G^2 satisfy f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y), then there are an additive homomorphism φ:GG\varphi:G\to G' and a constant cGc\in G' such that f(x)=φ(x)+cf(x)=\varphi(x)+c for at least G/(2144K122)|G|/(2^{144}K^{122}) values of xx.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture'

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|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Card of dual constrained

card_of_dual_constrained

Plain-language statement

In the ambient finite F2\mathbb F_2-vector space, exactly half of the additive homomorphisms φ:GF2\varphi:G\to\mathbb F_2 take a fixed nonzero vector xx to 11: 2{φ:φ(x)=1}=G2\,|\{\varphi:\varphi(x)=1\}|=|G|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Card of slice

card_of_slice

Plain-language statement

For every set AA in the ambient finite F2\mathbb F_2-vector space, some linear functional φ:GF2\varphi:G\to\mathbb F_2 has at least (A1)/2(|A|-1)/2 elements of AA in its 11-fiber.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond multi Dist chain Rule

cond_multiDist_chainRule

Plain-language statement

A chain rule for conditional multidistance. Let π:GH\pi:G\to H be a homomorphism, and suppose the pairs (Xi,Yi)(X_i,Y_i) are independent across the finite index set. Then D[XY]=D[X(πX,Y)]+D[πXY]+I ⁣[iXi:(πXi)i|(π ⁣(iXi),(Yi)i)].D[X\mid Y]=D[X\mid(\pi X,Y)]+D[\pi X\mid Y]+I\!\left[\sum_iX_i:(\pi X_i)_i\,\middle|\,\left(\pi\!\left(\sum_iX_i\right),(Y_i)_i\right)\right]. The first term measures the remaining fiberwise multidistance after adjoining each image π(Xi)\pi(X_i) to its conditioning data.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond KLDiv eq

condKLDiv_eq

Plain-language statement

If X,YX, Y are GG-valued random variables, and ZZ is another random variable defined on the same sample space as XX, then DKL((XZ)Y)=DKL(XY)+\bbH[X]\bbH[XZ].D_{KL}((X|Z)\Vert Y) = D_{KL}(X\Vert Y) + \bbH[X] - \bbH[X|Z].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond Multi Dist of cast

condMultiDist_of_cast

Plain-language statement

Conditional multidistance is unchanged when both the random variables and their conditioning variables are reindexed along an equality m=mm'=m. As with ordinary multidistance, the value does not depend on the chosen equal presentation of the finite index type.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond Ruzsa Distance ge of min

condRuzsaDistance_ge_of_min

Plain-language statement

A lower bound forced by τ\tau-minimality. If (X1,X2)(X_1,X_2) minimizes the source's τ\tau functional, then for measurable X1,X2X_1',X_2' and conditioning variables Z,WZ,W, d[X1Z;X2W]d[X1;X2]η(d[X10;X1Z]d[X10;X1])η(d[X20;X2W]d[X20;X2]).d[X_1'\mid Z;X_2'\mid W]\ge d[X_1;X_2]-\eta\bigl(d[X_1^0;X_1'\mid Z]-d[X_1^0;X_1]\bigr)-\eta\bigl(d[X_2^0;X_2'\mid W]-d[X_2^0;X_2]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record