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

1 topic

2 results

Clear filters
Project-declaredLean 4.33.0-rc1

Rdist of sums ge

rdist_of_sums_ge'

Plain-language statement

A Ruzsa-distance lower bound for sums of independent copies. Let X1,X2X_1',X_2' be independent copies of the τ\tau-minimizers X1,X2X_1,X_2, and set k=d[X1;X2]k=d[X_1;X_2]. Then d[X1+X1;X2+X2]kη2(d[X1;X1]+d[X2;X2]).d[X_1+X_1';X_2+X_2']\ge k-\frac{\eta}{2}\bigl(d[X_1;X_1]+d[X_2;X_2]\bigr).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Second estimate

second_estimate

Plain-language statement

The second information estimate for τ\tau-minimizers. 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], I1=I[X1+X2:X1+X2X1+X2+X1+X2]I_1=I[X_1+X_2:X_1'+X_2\mid X_1+X_2+X_1'+X_2'], and I2=I[X1+X2:X1+X1X1+X2+X1+X2]I_2=I[X_1+X_2:X_1'+X_1\mid X_1+X_2+X_1'+X_2']. Then I22ηk+2η(2ηkI1)1ηI_2\le2\eta k+\dfrac{2\eta(2\eta k-I_1)}{1-\eta}.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record