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

Cond Multi Dist of cast

condMultiDist_of_cast

Plain-language statement

Conditional multidistance is unchanged when both the random variables and their conditioning variables are reindexed along an equality m=mm'=m. As with ordinary multidistance, the value does not depend on the chosen equal presentation of the finite index type.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Cond Ruzsa Distance ge of min

condRuzsaDistance_ge_of_min

Plain-language statement

A lower bound forced by τ\tau-minimality. If (X1,X2)(X_1,X_2) minimizes the source's τ\tau functional, then for measurable X1,X2X_1',X_2' and conditioning variables Z,WZ,W, d[X1Z;X2W]d[X1;X2]η(d[X10;X1Z]d[X10;X1])η(d[X20;X2W]d[X20;X2]).d[X_1'\mid Z;X_2'\mid W]\ge d[X_1;X_2]-\eta\bigl(d[X_1^0;X_1'\mid Z]-d[X_1^0;X_1]\bigr)-\eta\bigl(d[X_2^0;X_2'\mid W]-d[X_2^0;X_2]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Construct good prelim

construct_good_prelim

Plain-language statement

A preliminary endgame bound. In the τ\tau-minimizer setup, let k=d[X1;X2]k=d[X_1;X_2] and let measurable T1,T2,T3T_1,T_2,T_3 satisfy T1+T2+T3=0T_1+T_2+T_3=0. Put δ=I[T1:T2]+I[T2:T3]+I[T3:T1]\delta=I[T_1:T_2]+I[T_2:T_3]+I[T_3:T_1] and c[T1#T2]=d[X10;T1]d[X10;X1]+d[X20;T2]d[X20;X2].c[T_1\#T_2]=d[X_1^0;T_1]-d[X_1^0;X_1]+d[X_2^0;T_2]-d[X_2^0;X_2]. Then kδ+ηc[T1#T2]+η2(I[T1:T3]+I[T2:T3]).k\le\delta+\eta c[T_1\#T_2]+\frac{\eta}{2}\bigl(I[T_1:T_3]+I[T_2:T_3]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Di in ff

di_in_ff

Project documentation

A finite-field density-increment lemma. If the normalized additive correlation of AA with a set CC of density at least γ\gamma differs from its random value by at least ε\varepsilon, then there is a subspace VV of explicitly bounded codimension. Averaging 1A1_A over VV raises its LL^\infty density to at least (1+ε/32)α(1+\varepsilon/32)\alpha, where α\alpha is the density of AA.

additive combinatoricsarithmetic progressionsFourier analysis

Source project: Arithmetic Progressions Almost Periodicity

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Dist of U add le

dist_of_U_add_le

Plain-language statement

Let T1,T2,T3T_1,T_2,T_3 be measurable random variables in a finite abelian group with T1+T2+T3=0T_1+T_2+T_3=0, and set δ=I[T1:T2]+I[T1:T3]+I[T2:T3]\delta=I[T_1:T_2]+I[T_1:T_3]+I[T_2:T_3]. For any measurable Y1,,YnY_1,\ldots,Y_n and any α>0\alpha>0, there is a measurable random variable UU such that d[U;U]+αi=1nd[Yi;U](2+αn2)δ+αi=1nd[Yi;T2].d[U;U]+\alpha\sum_{i=1}^n d[Y_i;U]\le\left(2+\frac{\alpha n}{2}\right)\delta+\alpha\sum_{i=1}^n d[Y_i;T_2].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record