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 83 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic

83 results

Clear filters
Project-declaredLean 4.33.0-rc1

Tau minimizer exists rdist eq zero

tau_minimizer_exists_rdist_eq_zero

Plain-language statement

For p.η ≤ 1/8, there exist τ-minimizers X₁, X₂ at zero Rusza distance. For p.η < 1/8, all minimizers are fine, by tau_strictly_decreases'. For p.η = 1/8, we use a limit of minimizers for η < 1/8, which exists by compactness.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Tau strictly decreases

tau_strictly_decreases

Plain-language statement

If d[X1;X2]>0d[X_1;X_2] > 0 then there are GG-valued random variables X1,X2X'_1, X'_2 such that τ[X1;X2]<τ[X1;X2]\tau[X'_1;X'_2] < \tau[X_1;X_2]. Phrased in the contrapositive form for convenience of proof.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Three APFree w Inner one mu ddconv mu mu two smul mu

ThreeAPFree.wInner_one_mu_ddconv_mu_mu_two_smul_mu

Plain-language statement

For a finite group of odd order and a three-term-progression-free set ss, the normalized inner product between μsμs\mu_s*\mu_s and the uniform measure on 2s2s is exactly s2|s|^{-2}. The identity records the precise normalized count forced by the absence of nontrivial three-term progressions.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Torsion PFR

torsion_PFR

Project documentation

Polynomial Freiman-Ruzsa theorem for bounded-torsion groups. Let GG be a finite abelian group in which mx=0mx=0 for every xx, with m2m\ge2. If AGA\subseteq G is nonempty and A+AKA|A+A|\le K|A|, then there are a subgroup HGH\le G and a set cc such that Ac+HA\subseteq c+H, HA|H|\le|A|, and c<mK256m3+1|c|<mK^{256m^3+1}.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record