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

1 topic

167 results

Clear filters
Project-declaredLean 4.33.0-rc1

Sum dist diff le

sum_dist_diff_le

Plain-language statement

In the τ\tau-minimizer endgame, let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2, set k=d[X1;X2]k=d[X_1;X_2], U=X1+X2U=X_1+X_2, V=X1+X2V=X_1'+X_2, W=X1+X1W=X_1'+X_1, S=X1+X2+X1+X2S=X_1+X_2+X_1'+X_2', and I1=I[U:VS]I_1=I[U:V\mid S]. If c[AS#AS]=i=12(d[Xi0;AS]d[Xi0;Xi])c[A\mid S\#A\mid S]=\sum_{i=1}^2\bigl(d[X_i^0;A\mid S]-d[X_i^0;X_i]\bigr), then c[US#US]+c[VS#VS]+c[WS#WS](63η)k+3(2ηkI1)c[U\mid S\#U\mid S]+c[V\mid S\#V\mid S]+c[W\mid S\#W\mid S]\le(6-3\eta)k+3(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

Sum of rdist eq

sum_of_rdist_eq

Plain-language statement

Let Y1,Y2,Y3Y_1,Y_2,Y_3 and Y4Y_4 be independent GG-valued random variables. Then d[Y1Y3;Y2Y4]+d[Y1Y1Y3;Y2Y2Y4]d[Y_1-Y_3; Y_2-Y_4] + d[Y_1|Y_1-Y_3; Y_2|Y_2-Y_4] +I[Y1Y2:Y2Y4Y1Y2Y3+Y4]=d[Y1;Y2]+d[Y3;Y4]. + I[Y_1-Y_2 : Y_2 - Y_4 | Y_1-Y_2-Y_3+Y_4] = d[Y_1; Y_2] + d[Y_3; Y_4].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Sum of rdist eq step cond Mutual Info

sum_of_rdist_eq_step_condMutualInfo

Plain-language statement

For four measurable random variables Y0,Y1,Y2,Y3Y_0,Y_1,Y_2,Y_3 in a finite abelian group, the conditional mutual-information term used in the fibring identity can be reduced to I ⁣[(Y0Y1,Y2Y3):(Y0Y2,Y1Y3)|Y0Y1Y2+Y3]=I[Y0Y1:Y1Y3Y0Y1Y2+Y3].I\!\left[(Y_0-Y_1,Y_2-Y_3):(Y_0-Y_2,Y_1-Y_3)\,\middle|\,Y_0-Y_1-Y_2+Y_3\right]=I[Y_0-Y_1:Y_1-Y_3\mid Y_0-Y_1-Y_2+Y_3].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
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