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 161 to 180 of 350 declarations.

lemma

gen_ineq_aux1

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:36

lemma

gen_ineq_aux2

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:72

lemma

gen_ineq_01

Other version of gen_ineq_00, in which we switch to the complement in the second term.

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:209

lemma

gen_ineq_10

Other version of gen_ineq_00, in which we switch to the complement in the first term.

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:226

lemma

construct_good_prelim'

For any T1,T2,T3T_1, T_2, T_3 adding up to 00, then kk is at most δ+η(d[X10;T1T3]d[X10;X1])+η(d[X20;T2T3]d[X20;X2]) \delta + \eta (d[X^0_1;T_1|T_3]-d[X^0_1;X_1]) + \eta (d[X^0_2;T_2|T_3]-d[X^0_2;X_2]) where δ=I[T1:T2;μ]+I[T2:T3;μ]+I[T3:T1;μ]\delta = I[T₁ : T₂ ; μ] + I[T₂ : T₃ ; μ] + I[T₃ : T₁ ; μ].

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:323

lemma

construct_good_improved'

In fact kk is at most

(d[X^0_i;T_j|T_l] - d[X^0_i; X_i]).$$

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:378

lemma

averaged_construct_good

kk is at most

\sum_{i=1}^2 \sum_{A,B \in \{U,V,W\}: A \neq B} (d[X^0_i;A|B,S] - d[X^0_i; X_i]).$$

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:430

lemma

dist_diff_bound_1

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:468

lemma

dist_diff_bound_2

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:561

lemma

averaged_final

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:665

theorem

tau_strictly_decreases'

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:700

lemma

tau_minimizer_exists_rdist_eq_zero

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:730

theorem

entropic_PFR_conjecture_improv

entropic_PFR_conjecture_improv: 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]10d[X10;X20]d[X^0_1;U_H] + d[X^0_2;U_H] \le 10 d[X^0_1;X^0_2].

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:810

theorem

entropic_PFR_conjecture_improv'

entropic_PFR_conjecture_improv': 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]10d[X10;X20]d[X^0_1;U_H] + d[X^0_2;U_H] \le 10 d[X^0_1;X^0_2]., and d[X^0_1; U_H] and d[X^0_2; U_H] are at most 5/2 * d[X^0_1;X^0_2]

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:828

theorem

PFR_conjecture_improv

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:964

theorem

PFR_conjecture_improv'

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

PFR.ImprovedPFR · PFR/ImprovedPFR.lean:1030

lemma

KLDiv_nonneg

KL(X ‖ Y) ≥ 0.

PFR.Kullback · PFR/Kullback.lean:74

lemma

KLDiv_of_convex

If SS is a finite set, wsw_s is non-negative, and P(X=x)=sSwsP(Xs=x){\bf P}(X=x) = \sum_{s\in S} w_s {\bf P}(X_s=x), P(Y=x)=sSwsP(Ys=x){\bf P}(Y=x) = \sum_{s\in S} w_s {\bf P}(Y_s=x) for all xx, then DKL(XY)sSwsDKL(XsYs).D_{KL}(X\Vert Y) \le \sum_{s\in S} w_s D_{KL}(X_s\Vert Y_s).

PFR.Kullback · PFR/Kullback.lean:120

lemma

KLDiv_of_comp_inj

If f:GHf:G \to H is an injection, then DKL(f(X)f(Y))=DKL(XY)D_{KL}(f(X)\Vert f(Y)) = D_{KL}(X\Vert Y).

PFR.Kullback · PFR/Kullback.lean:153

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.