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

1 topic

160 results

Clear filters
Project-declaredLean 4.33.0-rc1

Approx hom pfr

approx_hom_pfr

Project documentation

An approximate-homomorphism theorem for finite elementary abelian 22-groups. Let f:GGf:G\to G' and K>0K>0. If at least a proportion K1K^{-1} of pairs (x,y)G2(x,y)\in G^2 satisfy f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y), then there are an additive homomorphism φ:GG\varphi:G\to G' and a constant cGc\in G' such that f(x)=φ(x)+cf(x)=\varphi(x)+c for at least G/(2144K122)|G|/(2^{144}K^{122}) values of xx.

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

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

Card of dual constrained

card_of_dual_constrained

Plain-language statement

In the ambient finite F2\mathbb F_2-vector space, exactly half of the additive homomorphisms φ:GF2\varphi:G\to\mathbb F_2 take a fixed nonzero vector xx to 11: 2{φ:φ(x)=1}=G2\,|\{\varphi:\varphi(x)=1\}|=|G|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Card of slice

card_of_slice

Plain-language statement

For every set AA in the ambient finite F2\mathbb F_2-vector space, some linear functional φ:GF2\varphi:G\to\mathbb F_2 has at least (A1)/2(|A|-1)/2 elements of AA in its 11-fiber.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond multi Dist chain Rule

cond_multiDist_chainRule

Plain-language statement

A chain rule for conditional multidistance. Let π:GH\pi:G\to H be a homomorphism, and suppose the pairs (Xi,Yi)(X_i,Y_i) are independent across the finite index set. Then D[XY]=D[X(πX,Y)]+D[πXY]+I ⁣[iXi:(πXi)i|(π ⁣(iXi),(Yi)i)].D[X\mid Y]=D[X\mid(\pi X,Y)]+D[\pi X\mid Y]+I\!\left[\sum_iX_i:(\pi X_i)_i\,\middle|\,\left(\pi\!\left(\sum_iX_i\right),(Y_i)_i\right)\right]. The first term measures the remaining fiberwise multidistance after adjoining each image π(Xi)\pi(X_i) to its conditioning data.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record