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 21 to 40 of 350 declarations.

lemma

sum_of_rdist_eq

Let Y1,Y2,Y3Y_1,Y_2,Y_3 and Y4Y_4 be independent GG-valued random variables. Then d[Y1Y3;Y2Y4]+d[Y1Y1Y3;Y2Y2Y4]d[Y_1-Y_3; Y_2-Y_4] + d[Y_1|Y_1-Y_3; Y_2|Y_2-Y_4] +I[Y1Y2:Y2Y4Y1Y2Y3+Y4]=d[Y1;Y2]+d[Y3;Y4]. + I[Y_1-Y_2 : Y_2 - Y_4 | Y_1-Y_2-Y_3+Y_4] = d[Y_1; Y_2] + d[Y_3; Y_4].

PFR.Fibring · PFR/Fibring.lean:153

lemma

rdist_add_rdist_add_condMutual_eq

The sum of d[X1+X~2;X2+X~1]+d[X1X1+X~2;X2X2+X~1]d[X_1+\tilde X_2;X_2+\tilde X_1] + d[X_1|X_1+\tilde X_2; X_2|X_2+\tilde X_1] and I[X1+X2:X~1+X2X1+X2+X~1+X~2]I[X_1+ X_2 : \tilde X_1 + X_2 \,|\, X_1 + X_2 + \tilde X_1 + \tilde X_2] is equal to 2k2k.

PFR.FirstEstimate · PFR/FirstEstimate.lean:59

lemma

first_estimate

We have I12ηkI_1 \leq 2 \eta k

PFR.FirstEstimate · PFR/FirstEstimate.lean:143

lemma

ent_ofsum_le

\le \tfrac{1}{2} \mathbb{H}[X_1]+\tfrac{1}{2} \mathbb{H}[X_2] + (2 + \eta) k - I_1.$$

PFR.FirstEstimate · PFR/FirstEstimate.lean:158

theorem

ProbabilityTheory.IndepFun.identDistrib_cond

If A is independent from B, then conditioning on an event given by B does not change the distribution of A.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:22

lemma

ProbabilityTheory.IndepFun.cond_left

If A is independent of B, then they remain independent when conditioning on an event of the form A ∈ s of positive probability.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:35

lemma

ProbabilityTheory.IndepFun.cond

If A is independent of B, then they remain independent when conditioning on an event of the form A ∈ s ∩ B ∈ t of positive probability.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:63

lemma

ProbabilityTheory.CondIndepFun.comp_right

Composing independent functions with a measurable embedding of conull range gives independent functions.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:114

lemma

ProbabilityTheory.condIndep_copies

For X, Y random variables, there exist conditionally independent trials X_1, X_2, Y'.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:135

lemma

ProbabilityTheory.condIndep_copies'

For X, Y random variables, there exist conditionally independent trials X₁, X₂, Y'.

PFR.ForMathlib.ConditionalIndependence · PFR/ForMathlib/ConditionalIndependence.lean:270

lemma

ProbabilityTheory.entropy_eq_log_card

If X is S-valued random variable, then H[X] = log |S| if and only if X is uniformly distributed.

PFR.ForMathlib.Entropy.Basic · PFR/ForMathlib/Entropy/Basic.lean:201

lemma

ProbabilityTheory.prob_ge_exp_neg_entropy

If X is an S-valued random variable, then there exists s ∈ S such that P[X = s] ≥ \exp(- H[X]).

TODO: remove the probability measure hypothesis, which is unnecessary here.

PFR.ForMathlib.Entropy.Basic · PFR/ForMathlib/Entropy/Basic.lean:217

lemma

ProbabilityTheory.prob_ge_exp_neg_entropy'

If X is an S-valued random variable, then there exists s ∈ S such that P[X=s] ≥ \exp(-H[X]).

PFR.ForMathlib.Entropy.Basic · PFR/ForMathlib/Entropy/Basic.lean:301

lemma

ProbabilityTheory.const_of_nonpos_entropy

If X is an S-valued random variable of non-positive entropy, then X is almost surely constant.

PFR.ForMathlib.Entropy.Basic · PFR/ForMathlib/Entropy/Basic.lean:314

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.