Head version
v4.33.0-rc1
a177b2e4abe4b31c8024b9afebe646bf6bb8f91b
- Toolchain
- leanprover/lean4:v4.33.0-rc1
- Revision date
- 16 Jul 2026
- Dependencies
- 11
- Versions
- 23
teorth/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.
Head version
a177b2e4abe4b31c8024b9afebe646bf6bb8f91b
External build observation
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
Showing 161 to 180 of 350 declarations.
lemma
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:36
lemma
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:72
lemma
Other version of gen_ineq_00, in which we switch to the complement in the second term.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:209
lemma
Other version of gen_ineq_00, in which we switch to the complement in the first term.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:226
lemma
For any adding up to , then is at most where .
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:323
lemma
In fact is at most
(d[X^0_i;T_j|T_l] - d[X^0_i; X_i]).$$PFR.ImprovedPFR · PFR/ImprovedPFR.lean:378
lemma
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
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:468
lemma
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:561
lemma
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:665
theorem
Open the record for the exact Lean statement and complete source.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:700
lemma
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: For two -valued random variables , there is
some subgroup such that .
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:810
theorem
entropic_PFR_conjecture_improv': For two -valued random variables , there is
some subgroup such that ., 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
The polynomial Freiman-Ruzsa (PFR) conjecture: if is a subset of an elementary abelian 2-group of doubling constant at most , then can be covered by at most 2K^{11} cosets of a subgroup of cardinality at most .
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:964
theorem
Corollary of PFR_conjecture_improv in which the ambient group is not required to be finite
(but) then and are finite.
PFR.ImprovedPFR · PFR/ImprovedPFR.lean:1030
lemma
KL(X ‖ Y) ≥ 0.
PFR.Kullback · PFR/Kullback.lean:74
lemma
KL(X ‖ Y) = 0 if and only if Y is a copy of X.
PFR.Kullback · PFR/Kullback.lean:93
lemma
If is a finite set, is non-negative, and , for all , then
PFR.Kullback · PFR/Kullback.lean:120
lemma
If is an injection, then .
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.