Skip to main content
All packages

teorth/PFR

PFR

Repository for formalization of the Polynomial Freiman Ruzsa conjecture (and related results)

Therefore indexed 350 complete source declarations from the exact package revision. Individual authorship and independent verification remain unset.

Research project222 GitHub starsApache-2.023 indexed versionsRepositoryFull history on Reservoir
mathadditive-combinatoricsinformation-theory

Head version

v4.33.0-rc1

a177b2e4abe4b31c8024b9afebe646bf6bb8f91b

Toolchain
leanprover/lean4:v4.33.0-rc1
Revision date
16 Jul 2026
Dependencies
11
Versions
23

External build observation

Exact head commit and toolchain

Reservoir recorded build status passed and test status not observed for commit a177b2e4abe4 with leanprover/lean4:v4.33.0-rc1 on 20 Jul 2026. Therefore did not run this build.

Pin this source in lakefile.lean

require PFR from git "https://github.com/teorth/pfr.git" @ "a177b2e4abe4b31c8024b9afebe646bf6bb8f91b"

Source declarations

350 indexed proofs

Package history

Showing 301 to 320 of 350 declarations.

lemma

dist_le_of_sum_zero'

If GG-valued random variables T1,T2,T3T_1,T_2,T_3 satisfy T1+T2+T3=0T_1+T_2+T_3=0, then

+ \frac{\eta}{3} \sum_{1 \leq i < j \leq 3} (\rho(T_i|T_j) + \rho(T_j|T_i) -\rho(X_1)-\rho(X_2))$$

PFR.RhoFunctional · PFR/RhoFunctional.lean:1532

lemma

dist_le_of_sum_zero_cond'

If GG-valued random variables T1,T2,T3T_1,T_2,T_3 satisfy T1+T2+T3=0T_1+T_2+T_3=0, then

+ \frac{\eta}{3} \sum_{1 \leq i < j \leq 3} (\rho(T_i|T_j) + \rho(T_j|T_i) -\rho(X_1)-\rho(X_2))$$

PFR.RhoFunctional · PFR/RhoFunctional.lean:1552

lemma

new_gen_ineq_aux1

Open the record for the exact Lean statement and complete source.

PFR.RhoFunctional · PFR/RhoFunctional.lean:1567

lemma

new_gen_ineq_aux2

Open the record for the exact Lean statement and complete source.

PFR.RhoFunctional · PFR/RhoFunctional.lean:1594

lemma

condRho_sum_le

For independent random variables Y1,Y2,Y3,Y4Y_1,Y_2,Y_3,Y_4 over GG, define S:=Y1+Y2+Y3+Y4S:=Y_1+Y_2+Y_3+Y_4, T1:=Y1+Y2T_1:=Y_1+Y_2, T2:=Y1+Y3T_2:=Y_1+Y_3. Then

\le \frac{1}{2}(d[Y_1;Y_2]+d[Y_3;Y_4]+d[Y_1;Y_3]+d[Y_2;Y_4]).$$

PFR.RhoFunctional · PFR/RhoFunctional.lean:1711

lemma

condRho_sum_le'

For independent random variables Y1,Y2,Y3,Y4Y_1,Y_2,Y_3,Y_4 over GG, define T1:=Y1+Y2,T2:=Y1+Y3,T3:=Y2+Y3T_1:=Y_1+Y_2, T_2:=Y_1+Y_3, T_3:=Y_2+Y_3 and S:=Y1+Y2+Y3+Y4S:=Y_1+Y_2+Y_3+Y_4. Then

- \frac{1}{2}\sum_{i} \rho(Y_i))\le \sum_{1\leq i < j \leq 4}d[Y_i;Y_j]$$

PFR.RhoFunctional · PFR/RhoFunctional.lean:1765

lemma

dist_of_min_eq_zero'

If X1,X2X_1, X_2 is a ϕ\phi-minimizer, then d[X1;X2]=0d[X_1;X_2] = 0.

PFR.RhoFunctional · PFR/RhoFunctional.lean:1792

theorem

dist_of_min_eq_zero

Open the record for the exact Lean statement and complete source.

PFR.RhoFunctional · PFR/RhoFunctional.lean:1857

lemma

phiMinimizer_exists_rdist_eq_zero

For η ≤ 1/8, there exist phi-minimizers X₁, X₂ at zero Rusza distance. For η < 1/8, all minimizers are fine, by dist_of_min_eq_zero. For η = 1/8, we use a limit of minimizers for η < 1/8, which exists by compactness.

PFR.RhoFunctional · PFR/RhoFunctional.lean:1873

theorem

rho_PFR_conjecture

For any random variables Y1,Y2Y_1,Y_2, there exist a subgroup HH such that 2ρ(UH)ρ(Y1)+ρ(Y2)+8d[Y1;Y2]. 2\rho(U_H) \leq \rho(Y_1) + \rho(Y_2) + 8 d[Y_1;Y_2].

PFR.RhoFunctional · PFR/RhoFunctional.lean:1933

lemma

better_PFR_conjecture_aux0

If A+AKA|A+A| \leq K|A|, then there exists a subgroup HH and tGt\in G such that A(H+t)K4AV|A \cap (H+t)| \geq K^{-4} \sqrt{|A||V|}, and H/A[K8,K8]|H|/|A|\in[K^{-8},K^8].

PFR.RhoFunctional · PFR/RhoFunctional.lean:1974

lemma

better_PFR_conjecture

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.

PFR.RhoFunctional · PFR/RhoFunctional.lean:2069

theorem

better_PFR_conjecture'

Corollary of better_PFR_conjecture in which the ambient group is not required to be finite (but) then HH and cc are finite.

PFR.RhoFunctional · PFR/RhoFunctional.lean:2134

lemma

rdist_of_sums_ge'

d[X1+X~1;X2+X~2]kη2(d[X1;X1]+d[X2;X2]). d[X_1+\tilde X_1; X_2+\tilde X_2] \geq k - \frac{\eta}{2} ( d[X_1; X_1] + d[X_2;X_2] ).

PFR.SecondEstimate · PFR/SecondEstimate.lean:62

lemma

second_estimate

I22ηk+2η(2ηkI1)1η. I_2 \leq 2 \eta k + \frac{2 \eta (2 \eta k - I_1)}{1 - \eta}.

PFR.SecondEstimate · PFR/SecondEstimate.lean:103

lemma

tau_min_exists_measure

A pair of measures minimizing τ\tau exists.

PFR.TauFunctional · PFR/TauFunctional.lean:126

lemma

tau_minimizer_exists

A pair of random variables minimizing ττ exists.

PFR.TauFunctional · PFR/TauFunctional.lean:147

lemma

is_tau_min

Open the record for the exact Lean statement and complete source.

PFR.TauFunctional · PFR/TauFunctional.lean:170

lemma

condRuzsaDistance_ge_of_min

For any GG-valued random variables X1,X2X'_1,X'_2 and random variables Z,WZ,W, one can lower bound d[X1Z;X2W]d[X'_1|Z;X'_2|W] by kη(d[X10;X1Z]d[X10;X1])η(d[X20;X2W]d[X20;X2]).k - \eta (d[X^0_1;X'_1|Z] - d[X^0_1;X_1] ) - \eta (d[X^0_2;X'_2|W] - d[X^0_2;X_2] ).

PFR.TauFunctional · PFR/TauFunctional.lean:212

Static source extraction only. Package code was not executed. Every result keeps its complete declaration, exact file and line range, commit, toolchain, license file, and content hash.