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 1 to 20 of 350 declarations.

theorem

approx_hom_pfr

Let G,GG, G' be finite abelian 22-groups. Let f:GGf : G \to G' be a function, and suppose that there is a proportion of at least K1K^{-1} pairs (x,y)G2(x,y) \in G^2 such that f(x+y)=f(x)+f(y). f(x+y) = f(x) + f(y). Then there exists a homomorphism ϕ:GG\phi : G \to G' and a constant cGc \in G' such that f(x)=ϕ(x)+cf(x) = \phi(x)+c for at least G/(2144K122)|G| / (2 ^ {144} * K ^ {122}) values of xGx \in G.

PFR.ApproxHomPFR · PFR/ApproxHomPFR.lean:37

theorem

card_of_dual_constrained

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

PFR.ApproxHomPFR · PFR/ApproxHomPFR.lean:197

theorem

card_of_slice

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

PFR.ApproxHomPFR · PFR/ApproxHomPFR.lean:248

theorem

approx_hom_pfr'

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

PFR.ApproxHomPFR · PFR/ApproxHomPFR.lean:287

lemma

multiDist_of_cast

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

PFR.BoundingMutual · PFR/BoundingMutual.lean:16

lemma

condMultiDist_of_cast

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

PFR.BoundingMutual · PFR/BoundingMutual.lean:77

lemma

I₃_eq

The quantity I_3 = I[V:W|S] is equal to I_2.

PFR.Endgame · PFR/Endgame.lean:87

lemma

sum_condMutual_le

I[U : V | S] + I[V : W | S] + I[W : U | S] is less than or equal to 6 * η * k - (1 - 5 * η) / (1 - η) * (2 * η * k - I₁).

PFR.Endgame · PFR/Endgame.lean:136

lemma

sum_dist_diff_le

i=12A{U,V,W}(d[Xi0;AS]d[Xi0;Xi]) \sum_{i=1}^2 \sum_{A\in\{U,V,W\}} \big(d[X^0_i;A|S] - d[X^0_i;X_i]\big) is less than or equal to (63η)k+3(2ηkI1). \leq (6 - 3\eta) k + 3(2 \eta k - I_1).

PFR.Endgame · PFR/Endgame.lean:210

lemma

cond_c_eq_integral

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

PFR.Endgame · PFR/Endgame.lean:319

lemma

construct_good_prelim

If T1,T2,T3T_1, T_2, T_3 are GG-valued random variables with T1+T2+T3=0T_1+T_2+T_3=0 holds identically and δ:=1i<j3I[Ti;Tj] \delta := \sum_{1 \leq i < j \leq 3} I[T_i;T_j] Then there exist random variables T1,T2T'_1, T'_2 such that d[T1;T2]+η(d[X10;T1]d[X10;X1])+η(d[X20;T2]d[X20;X2])d[T'_1;T'_2] + \eta (d[X_1^0;T'_1] - d[X_1^0;X_1]) + \eta(d[X_2^0;T'_2] - d[X_2^0;X_2]) is at most δ+η(d[X10;T1]d[X10;X1])+η(d[X20;T2]d[X20;X2])\delta + \eta ( d[X^0_1;T_1]-d[X^0_1;X_1]) + \eta (d[X^0_2;T_2]-d[X^0_2;X_2]) +12ηI[T1:T3]+12ηI[T2:T3]. + \tfrac12 \eta I[T_1: T_3] + \tfrac12 \eta I[T_2: T_3].

PFR.Endgame · PFR/Endgame.lean:352

lemma

construct_good

If T1,T2,T3T_1, T_2, T_3 are GG-valued random variables with T1+T2+T3=0T_1+T_2+T_3=0 holds identically and

δ:=1i<j3I[Ti;Tj] \delta := \sum_{1 \leq i < j \leq 3} I[T_i;T_j]

Then there exist random variables T1,T2T'_1, T'_2 such that

d[T1;T2]+η(d[X10;T1]d[X10;X1])+η(d[X20;T2]d[X20;X2]) d[T'_1;T'_2] + \eta (d[X_1^0;T'_1] - d[X_1^0;X _1]) + \eta(d[X_2^0;T'_2] - d[X_2^0;X_2])

is at most

(d[X^0_i;T_j] - d[X^0_i; X_i]) \biggr).$$

PFR.Endgame · PFR/Endgame.lean:417

lemma

cond_construct_good

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

PFR.Endgame · PFR/Endgame.lean:444

theorem

tau_strictly_decreases

If d[X1;X2]>0d[X_1;X_2] > 0 then there are GG-valued random variables X1,X2X'_1, X'_2 such that τ[X1;X2]<τ[X1;X2]\tau[X'_1;X'_2] < \tau[X_1;X_2]. Phrased in the contrapositive form for convenience of proof.

PFR.EntropyPFR · PFR/EntropyPFR.lean:38

theorem

entropic_PFR_conjecture

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

PFR.EntropyPFR · PFR/EntropyPFR.lean:52

theorem

entropic_PFR_conjecture'

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

PFR.EntropyPFR · PFR/EntropyPFR.lean:69

lemma

rdist_of_indep_eq_sum_fibre

If Z1,Z2Z_1, Z_2 are independent, then d[Z1;Z2]d[Z_1; Z_2] is equal to d[π(Z1);π(Z2)]+d[Z1π(Z1);Z2π(Z2)] d[\pi(Z_1);\pi(Z_2)] + d[Z_1|\pi(Z_1); Z_2 |\pi(Z_2)] plus I(Z1Z2:(π(Z1),π(Z2))π(Z1Z2)).I( Z_1 - Z_2 : (\pi(Z_1), \pi(Z_2)) | \pi(Z_1 - Z_2) ).

PFR.Fibring · PFR/Fibring.lean:38

lemma

rdist_le_sum_fibre

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

PFR.Fibring · PFR/Fibring.lean:66

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.