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 321 to 340 of 350 declarations.
lemma
We have I[Z_1 : Z_2 | W], I[Z_2 : Z_3 | W], I[Z_1 : Z_3 | W] ≤ 4m^2 η k.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:70
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:103
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:167
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:226
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:251
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:276
lemma
We have .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:288
lemma
We have .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:330
lemma
We have .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:381
lemma
We have .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:423
lemma
Open the record for the exact Lean statement and complete source.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:493
lemma
Let be an abelian group, let be a -valued random variable such that holds identically, and write [ \delta := \bbI[T_1 : T_2] + \bbI[T_1 : T_3] + \bbI[T_2 : T_3]. ] Let be some further -valued random variables and let be a constant. Then there exists a random variable such that
\Bigl(2 + \frac{\alpha n}{2} \Bigr) \delta + \alpha \sum_{i=1}^n d[Y_i;T_2].$$PFR.TorsionEndgame · PFR/TorsionEndgame.lean:526
lemma
We have .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:621
lemma
Suppose that is a finite abelian group of torsion . Suppose that is a -valued random variable. Then there exists a subgroup such that [ d[X;U_H] \leq 64 m^3 d[X;X].].
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:710
theorem
A uniform distribution on a set with doubling constant K has self Rusza distance
at most log K.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:766
lemma
Every subgroup H of a finite m-torsion abelian group G contains a subgroup H' of order
between k and mk, if 0 < k < |H|.
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:918
theorem
Suppose that is a finite abelian group of torsion . If is non-empty and , then can be covered by most translates of a subspace of with .
PFR.TorsionEndgame · PFR/TorsionEndgame.lean:962
lemma
Without loss of generality, one can move (up to translation and embedding) any pair A, B of non-empty sets into a subgroup where they are not in a coset.
PFR.WeakPFR · PFR/WeakPFR.lean:49
lemma
If G is torsion-free and X, Y are G-valued random variables then d[X; 2Y] ≤ 5d[X; Y].
PFR.WeakPFR · PFR/WeakPFR.lean:92
lemma
Let and X, Y be G-valued random variables such that
[\mathbb{H}(X)+\mathbb{H}(Y)> (20/\alpha) d[X;Y],]
for some .
There is a non-trivial subgroup such that
[\log \lvert H\rvert <(1+\alpha)/2 (\mathbb{H}(X)+\mathbb{H}(Y))] and
[\mathbb{H}(\psi(X))+\mathbb{H}(\psi(Y))< \alpha (\mathbb{H}(X)+\mathbb{H}(Y))]
where is the natural projection homomorphism.
PFR.WeakPFR · PFR/WeakPFR.lean:241
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.