First estimate
We continue the assumptions from the preceding section.
Let \(X_1, X_2, \tilde X_1, \tilde X_2\) be independent random variables, with \(X_1,\tilde X_1\) copies of \(X_1\) and \(X_2,\tilde X_2\) copies of \(X_2\). (This is possible thanks to Existence of independent copies.)
We also define the quantity
LemmaFibring identity for first estimate#
We have
Proof
Immediate from Specific fibring identity.
Lean
Formalized as rdist_add_rdist_add_condMutual_eq.
Sources
Uses 1 · Used by 4
LemmaLower bound on distances#
We have
Proof
Immediate from Distance lower bound.
Lean
Formalized as rdist_of_sums_ge.
Sources
Uses 1 · Used by 1
LemmaLower bound on conditional distances#
We have
Proof
Immediate from Conditional distance lower bound.
Lean
Formalized as condRuzsaDist_of_sums_ge.
Sources
Uses 1 · Used by 2
LemmaUpper bound on distance differences#
We have
Proof
Immediate from Comparison of Ruzsa distances, I (and recalling that \(k\) is defined to be \(d[X_1;X_2]\)).
Lean
Formalized as diff_rdist_le_1, diff_rdist_le_2, diff_rdist_le_3, diff_rdist_le_4.
Sources
Uses 1 · Used by 2
LemmaFirst estimate#
We have \(I_1 \leq 2 \eta k\).
Proof
Take a suitable linear combination of Fibring identity for first estimate, Lower bound on distances, Lower bound on conditional distances, and Upper bound on distance differences.
Lean
Formalized as first_estimate.
Sources
Uses 4 · Used by 1
One can also extract the following useful inequality from the proof of the above lemma.
LemmaEntropy bound on quadruple sum#
With the same notation, we have
Proof
Subtracting Lower bound on conditional distances from Fibring identity for first estimate, and combining the resulting inequality with Upper bound on distance differences gives the bound
and the claim follows from Ruzsa distance in independent case and the definition of \(k\).
Lean
Formalized as ent_ofsum_le.
Sources
Uses 4 · Used by 2
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.