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

All topics

45 results

Clear filters
Project-declaredLean 4.33.0-rc1

Rdist of indep eq sum fibre

rdist_of_indep_eq_sum_fibre

Plain-language statement

If Z1,Z2Z_1, Z_2 are independent, then d[Z1;Z2]d[Z_1; Z_2] is equal to d[π(Z1);π(Z2)]+d[Z1π(Z1);Z2π(Z2)] d[\pi(Z_1);\pi(Z_2)] + d[Z_1|\pi(Z_1); Z_2 |\pi(Z_2)] plus I(Z1Z2:(π(Z1),π(Z2))π(Z1Z2)).I( Z_1 - Z_2 : (\pi(Z_1), \pi(Z_2)) | \pi(Z_1 - Z_2) ).

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

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

Rho PFR conjecture

rho_PFR_conjecture

Plain-language statement

Fix a nonempty finite set AA in an elementary abelian 22-group. For any measurable random variables Y1,Y2Y_1,Y_2, there are a subspace HH and a random variable UU uniformly distributed on HH such that the source's ρ[#A]\rho[\,\cdot\,\#A] functional satisfies 2ρ[U#A]ρ[Y1#A]+ρ[Y2#A]+8d[Y1;Y2]2\rho[U\#A]\le\rho[Y_1\#A]+\rho[Y_2\#A]+8d[Y_1;Y_2].

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
Project-declaredLean 4.33.0-rc1

Sub cond Multi Distance le

sub_condMultiDistance_le

Project documentation

If (Xi)1im(X_i)_{1 \leq i \leq m} is a τ\tau-minimizer, and k:=D[(Xi)1im]k := D[(X_i)_{1 \leq i \leq m}], then for any other tuples (Xi)1im(X'_i)_{1 \leq i \leq m} and (Yi)1im(Y_i)_{1 \leq i \leq m} with the XiX'_i G$-valued, one has kD[(Xi)1im(Yi)1im]ηi=1md[Xi;XiYi]. k - D[(X'_i)_{1 \leq i \leq m} | (Y_i)_{1 \leq i \leq m}] \leq \eta \sum_{i=1}^m d[X_i; X'_i|Y_i].

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record