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 261 to 280 of 350 declarations.
lemma
Let m be a positive integer. Suppose one has a sequence
G_m → G_{m - 1} → ... → G_1 → G_0 = {0} of homomorphisms between abelian groups G_0, ...,G_m,
and for each d=0, ...,m, let π_d : G_m → G_d be the homomorphism from G_m to G_d arising
from this sequence by composition
(so for instance π_m is the identity homomorphism and π_0 is the zero homomorphism).
Let X_[m] = (X_1, ..., X_m) be a jointly independent tuple of G_m-valued random variables.
Then D[X_[m]] = ∑ d, D[π_d(X_[m]) ,| , π_(d-1)(X_[m])]
+ ∑_{d=1}^{m - 1}, I[∑ i, X_i : π_d(X_[m]) | π_d(∑ i, X_i), π_(d-1})(X_[m])].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2016
lemma
Under the preceding hypotheses,
D[X_[m]] ≥ ∑ d, D[π_d(X_[m])| π_(d-1})(X_[m])] + I[∑ i, X_i : π_1(X_[m]) | π_1(∑ i, X_i)].
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2063
theorem
Open the record for the exact Lean statement and complete source.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2117
theorem
Open the record for the exact Lean statement and complete source.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2164
lemma
Open the record for the exact Lean statement and complete source.
PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2193
lemma
If is finite, then is continuous.
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:96
lemma
If is finite, then a -minimizer exists.
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:121
lemma
If is finite, then a -minimizer exists.
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:141
lemma
If is a -minimizer, then .
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:162
lemma
If is a -minimizer, and , then for any other tuple , one has
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:203
lemma
Open the record for the exact Lean statement and complete source.
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:225
lemma
If is a -minimizer, and , then for any other tuples and with the G$-valued, one has
\leq \eta \sum_{i=1}^m d[X_i; X'_i|Y_i].$$PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:260
lemma
With the notation of the previous lemma, we have \begin{equation}\label{5.3-conv} k - D[ X'{[m]} | Y{[m]} ] \leq \eta \sum_{i=1}^m d[X_{\sigma(i)};X'_i|Y_i] \end{equation} for any permutation .
PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:342
lemma
Open the record for the exact Lean statement and complete source.
PFR.RhoFunctional · PFR/RhoFunctional.lean:37
lemma
Open the record for the exact Lean statement and complete source.
PFR.RhoFunctional · PFR/RhoFunctional.lean:56
lemma
Open the record for the exact Lean statement and complete source.
PFR.RhoFunctional · PFR/RhoFunctional.lean:76
lemma
Open the record for the exact Lean statement and complete source.
PFR.RhoFunctional · PFR/RhoFunctional.lean:106
lemma
Open the record for the exact Lean statement and complete source.
PFR.RhoFunctional · PFR/RhoFunctional.lean:439
lemma
If is a finite subgroup of , then .
PFR.RhoFunctional · PFR/RhoFunctional.lean:631
lemma
We have .
PFR.RhoFunctional · PFR/RhoFunctional.lean:665
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.