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 241 to 260 of 350 declarations.
lemma
Let X,Y,X' be independent G-valued random variables, with X' a copy of X,
and let a be an integer. Then H[X - (a-1)Y] ≤ H[X - aY] + H[X - Y - X'] - H[X]
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:720
lemma
Let X,Y be independent G-valued random variables, and let a be an integer. Then
H[X - aY] - H[X] ≤ 4 |a| d[X ; Y].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:762
theorem
Move to Mathlib?
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:907
lemma
Open the record for the exact Lean statement and complete source.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:936
lemma
If φ : {1, ..., m} → {1, ...,m} is a bijection, then D[X_[m]] = D[(X_φ(1), ..., X_φ(m))].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:967
lemma
Open the record for the exact Lean statement and complete source.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1018
lemma
To prove multidist_ruzsa_I, we first establish a special case when the random variables are defined on the same space and are jointly independent.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1081
lemma
Let m ≥ 1, and let X_[m] be a tuple of G-valued random variables. Then
∑ (1 ≤ j, k ≤ m, j ≠ k), d[X_j; -X_k] ≤ m(m - 1) D[X_[m]].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1140
lemma
Let m ≥ 2, and let X_[m] be a tuple of G-valued random variables. Then
∑ j, d[X_j;X_j] ≤ 2 m D[X_[m]].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1157
lemma
A version of multidist_ruzsa_III assuming independence.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1184
lemma
Let I be an indexing set of size m ≥ 2, and let X_[m] be a tuple of G-valued random
variables. If the X_i all have the same distribution, then D[X_[m]] ≤ m d[X_i;X_i] for any
1 ≤ i ≤ m.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1265
lemma
Let m ≥ 2, and let X_[m] be a tuple of G-valued random
variables. Let W := ∑ X_i. Then d[W;-W] ≤ 2 D[X_i].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1288
lemma
If D[X_[m]]=0, then for each i ∈ I there is a finite subgroup H_i ≤ G such that
d[X_i; U_{H_i}] = 0.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1507
theorem
Conditional multidistance is unchanged if we apply an injection to the conditioned variables
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1543
theorem
Conditional multidistance against a constant is just multidistance
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1567
theorem
Conditional multidistance is nonnegative.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1591
lemma
If (X_i, Y_i), 1 ≤ i ≤ m are independent, then
D[X_[m] | Y_[m]] = H[∑ i, X_i | (Y_1, ..., Y_m)] - 1/m * ∑ i, H[X_i | Y_i]
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1670
lemma
If (X_i, Y_i), 1 ≤ i ≤ m are independent, then
D[X_[m] | Y_[m]] = ∑_{(y_i)_{1 ≤ i ≤ m}} P(Y_i=y_i ∀ i) D[(X_i | Y_i=y_i ∀ i)_{i=1}^m].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1756
lemma
Let π : G → H be a homomorphism of abelian groups and let X_[m] be a tuple of jointly
independent G-valued random variables. Then D[X_[m]] is equal to
D[X_[m] | π(X_[m])] + D[π(X_[m])] + I[∑ i, X_i : π(X_[m]) ; | ; π(∑ i, X_i)]
where π(X_[m]) := (π(X_1), ..., π(X_m)).
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1784
lemma
Let π : G → H be a homomorphism of abelian groups. Let I be a finite index set and let
X_[m] be a tuple of G-valued random variables. Let Y_[m] be another tuple of random variables
(not necessarily G-valued). Suppose that the pairs (X_i, Y_i) are jointly independent of one
another (but X_i need not be independent of Y_i). Then
D[X_[m] | Y_[m]] = D[X_[m] ,|, π(X_[m]), Y_[m]] + D[π(X_[m]) ,| , Y_[m]]
+ I[∑ i, X_i : π(X_[m]) ; | ; π(∑ i, X_i), Y_[m]].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:1854
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.