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

Ent ofsum le

ent_ofsum_le

Plain-language statement

Let X1,X2X_1',X_2' be independent copies of the τ\tau-minimizers X1,X2X_1,X_2. Write k=d[X1;X2]k=d[X_1;X_2] and 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']. Then the entropy of the four-variable sum obeys H[X1+X2+X1+X2]12H[X1]+12H[X2]+(2+η)kI1H[X_1+X_2+X_1'+X_2']\le\tfrac12H[X_1]+\tfrac12H[X_2]+(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

Rdist add rdist add cond Mutual eq

rdist_add_rdist_add_condMutual_eq

Plain-language statement

A fibring identity in the τ\tau-minimizer setup. Let X1,X2X_1',X_2' be independent copies of X1,X2X_1,X_2 and put k=d[X1;X2]k=d[X_1;X_2]. Then d[X1+X2;X2+X1]+d[X1X1+X2;X2X2+X1]+I[X1+X2:X1+X2X1+X2+X1+X2]=2kd[X_1+X_2';X_2+X_1']+d[X_1\mid X_1+X_2';X_2\mid X_2+X_1']+I[X_1+X_2:X_1'+X_2\mid X_1+X_2+X_1'+X_2']=2k.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record