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

1 topic

4 results

Clear filters
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture

Plain-language statement

If AF2nA \subset {\bf F}_2^n is finite non-empty with A+AKA|A+A| \leq K|A|, then there exists a subgroup HH of F2n{\bf F}_2^n with HA|H| \leq |A| such that AA can be covered by at most 2K92K^9 translates of HH.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture'

Project documentation

Polynomial Freiman-Ruzsa theorem with exponent 99, without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K9|c|<2K^9, and HA|H|\le|A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Rho PFR conjecture

rho_PFR_conjecture

Plain-language statement

Fix a nonempty finite set AA in an elementary abelian 22-group. For any measurable random variables Y1,Y2Y_1,Y_2, there are a subspace HH and a random variable UU uniformly distributed on HH such that the source's ρ[#A]\rho[\,\cdot\,\#A] functional satisfies 2ρ[U#A]ρ[Y1#A]+ρ[Y2#A]+8d[Y1;Y2]2\rho[U\#A]\le\rho[Y_1\#A]+\rho[Y_2\#A]+8d[Y_1;Y_2].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record