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 261 to 280 of 350 declarations.

lemma

iter_multiDist_chainRule

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

iter_multiDist_chainRule'

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

multiDist_of_hom'

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

PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2117

theorem

condMultiDist_of_hom

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

PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2164

lemma

cond_entropy_indep

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

PFR.MoreRuzsaDist · PFR/MoreRuzsaDist.lean:2193

lemma

multiTau_continuous

If GG is finite, then τ\tau is continuous.

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:96

lemma

multiTau_min_exists_measure

If GG is finite, then a τ\tau-minimizer exists.

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:121

lemma

multiTau_min_exists

If GG is finite, then a τ\tau-minimizer exists.

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:141

lemma

multiTau_min_sum_le

If (Xi)1im(X_i)_{1 \leq i \leq m} is a τ\tau-minimizer, then i=1md[Xi;X0]2mηd[X0;X0]\sum_{i=1}^m d[X_i; X^0] \leq \frac{2m}{\eta} d[X^0; X^0].

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:162

lemma

sub_multiDistance_le

If (Xi)1im(X_i)_{1 \leq i \leq m} is a τ\tau-minimizer, and k:=D[(Xi)1im]k := D[(X_i)_{1 \leq i \leq m}], then for any other tuple (Xi)1im(X'_i)_{1 \leq i \leq m}, one has kD[(Xi)1im]ηi=1md[Xi;Xi]. k - D[(X'_i)_{1 \leq i \leq m}] \leq \eta \sum_{i=1}^m d[X_i; X'_i].

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:203

lemma

sub_multiDistance_le'

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

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:225

lemma

sub_condMultiDistance_le

If (Xi)1im(X_i)_{1 \leq i \leq m} is a τ\tau-minimizer, and k:=D[(Xi)1im]k := D[(X_i)_{1 \leq i \leq m}], then for any other tuples (Xi)1im(X'_i)_{1 \leq i \leq m} and (Yi)1im(Y_i)_{1 \leq i \leq m} with the XiX'_i G$-valued, one has

\leq \eta \sum_{i=1}^m d[X_i; X'_i|Y_i].$$

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:260

lemma

sub_condMultiDistance_le'

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 σ:{1,,m}{1,,m}\sigma : \{1,\dots,m\} \rightarrow \{1,\dots,m\}.

PFR.MultiTauFunctional · PFR/MultiTauFunctional.lean:342

lemma

map_prod_uniformOn_ne_zero

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

PFR.RhoFunctional · PFR/RhoFunctional.lean:37

lemma

nonempty_rhoMinusSet

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

PFR.RhoFunctional · PFR/RhoFunctional.lean:56

lemma

rhoMinus_le

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

PFR.RhoFunctional · PFR/RhoFunctional.lean:106

lemma

exists_card_inter_add_eq_sSup

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

PFR.RhoFunctional · PFR/RhoFunctional.lean:439

lemma

rhoMinus_of_subgroup

If HH is a finite subgroup of GG, then ρ(UH)=logAlogmaxtA(H+t)\rho^-(U_H) = \log |A| - \log \max_t |A \cap (H+t)|.

PFR.RhoFunctional · PFR/RhoFunctional.lean:631

lemma

rho_of_uniform

We have ρ(UA)=0\rho(U_A) = 0.

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.