therefore
Sign up
Open navigation

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

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′,X2′X_1',X_2' and conditioning variables Z,WZ,W, d[X1′∣Z;X2′∣W]≥d[X1;X2]−η(d[X10;X1′∣Z]−d[X10;X1])−η(d[X20;X2′∣W]−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