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

1 topic

3 results

Clear filters
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.33.0-rc1

I₃ eq

I₃_eq

Plain-language statement

A symmetry identity in the τ\tau-minimizer endgame. Let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2, and set U=X1+X2U=X_1+X_2, V=X1+X2V=X_1'+X_2, W=X1+X1W=X_1'+X_1, and S=X1+X2+X1+X2S=X_1+X_2+X_1'+X_2'. Then the conditional mutual informations agree: I[V:WS]=I[U:WS]I[V:W\mid S]=I[U:W\mid S].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

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