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 multi Dist chain Rule

cond_multiDist_chainRule

Plain-language statement

A chain rule for conditional multidistance. Let π:GH\pi:G\to H be a homomorphism, and suppose the pairs (Xi,Yi)(X_i,Y_i) are independent across the finite index set. Then D[XY]=D[X(πX,Y)]+D[πXY]+I ⁣[iXi:(πXi)i|(π ⁣(iXi),(Yi)i)].D[X\mid Y]=D[X\mid(\pi X,Y)]+D[\pi X\mid Y]+I\!\left[\sum_iX_i:(\pi X_i)_i\,\middle|\,\left(\pi\!\left(\sum_iX_i\right),(Y_i)_i\right)\right]. The first term measures the remaining fiberwise multidistance after adjoining each image π(Xi)\pi(X_i) to its conditioning data.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Multidist ruzsa IV

multidist_ruzsa_IV

Project documentation

Let m ≥ 2, and let X_[m] be a tuple of G-valued random variables. Let W := ∑ X_i. Then d[W;-W] ≤ 2 D[X_i].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record