Source-pinned research

Research proof index

Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.

This index contains 45 research declarations. Search 10,000 more complete Mathlib declarations.

All topics

45 results

Clear filters
Project-declaredLean 4.33.0-rc1

Ent ofsum le

ent_ofsum_le

Plain-language statement

Let X1,X2X_1',X_2' be independent copies of the τ\tau-minimizers X1,X2X_1,X_2. Write k=d[X1;X2]k=d[X_1;X_2] and I1=I[X1+X2:X1+X2X1+X2+X1+X2]I_1=I[X_1+X_2:X_1'+X_2\mid X_1+X_2+X_1'+X_2']. Then the entropy of the four-variable sum obeys H[X1+X2+X1+X2]12H[X1]+12H[X2]+(2+η)kI1H[X_1+X_2+X_1'+X_2']\le\tfrac12H[X_1]+\tfrac12H[X_2]+(2+\eta)k-I_1.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Entropic PFR conjecture

entropic_PFR_conjecture

Plain-language statement

entropic_PFR_conjecture: For two GG-valued random variables X10,X20X^0_1, X^0_2, there is some subgroup HGH \leq G such that d[X10;UH]+d[X20;UH]11d[X10;X20]d[X^0_1;U_H] + d[X^0_2;U_H] \le 11 d[X^0_1;X^0_2].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Entropic PFR conjecture

entropic_PFR_conjecture'

Plain-language statement

In the project's entropic PFR package with parameter η=1/9\eta=1/9, there is a subspace HH and a random variable UU uniformly distributed on HH such that each reference variable is within six times their mutual Ruzsa distance of UU: d(X1,U),d(X2,U)6d(X1,X2)d(X_1,U),d(X_2,U)\le6d(X_1,X_2).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Exists is Uniform of rdist eq zero

exists_isUniform_of_rdist_eq_zero

Plain-language statement

If d[X1;X2]=0d[X_1;X_2]=0, then there exists a subgroup HGH \leq G such that d[X1;UH]=d[X2;UH]=0d[X_1;U_H] = d[X_2;U_H] = 0. Follows from the preceding claim by the triangle inequality.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Goursat

goursat

Project documentation

Let HH be a subgroup of G×GG \times G'. Then there exists a subgroup H0H_0 of GG, a subgroup H1H_1 of GG', and a homomorphism ϕ:GG\phi: G \to G' such that H:={(x,ϕ(x)+y):xH0,yH1}. H := \{ (x, \phi(x) + y): x \in H_0, y \in H_1 \}. In particular, H=H0H1|H| = |H_0| |H_1|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record