Kaimanovich-Vershik-Madiman… to Comparison of Ruzsa distances…
LemmaKaimanovich-Vershik-Madiman inequality#
Suppose that \(X, Y, Z\) are independent \(G\)-valued random variables. Then
Proof
From Submodularity we have
However, using Lemmas Additivity of entropy, Entropy and relabeling repeatedly we have \(\mathbb{H}[X, X + Y+ Z] = \mathbb{H}[X, Y+ Z] = \mathbb{H}[X] + \mathbb{H}[Y+ Z]\), \(\mathbb{H}[Z, X + Y + Z] = \mathbb{H}[Z, X + Y] = \mathbb{H}[Z] + \mathbb{H}[X + Y]\) and \(\mathbb{H}[X, Z, X + Y+ Z] = \mathbb{H}[X, Y, Z] = \mathbb{H}[X] + \mathbb{H}[Y] + \mathbb{H}[Z]\). The claim then follows from a calculation.
Lean
Formalized as kaimanovich_vershik.
Sources
LemmaExistence of conditional independent trials#
For \(X,Y\) random variables, there exist random variables \(X_1,X_2,Y'\) on a common probability space with \((X_1, Y'), (X_2, Y')\) both having the distribution of \((X,Y)\), and \(X_1, X_2\) conditionally independent over \(Y'\) in the sense of Conditionally independent random variables.
Proof
Explicit construction.
Lean
Formalized as ProbabilityTheory.condIndep_copies.
Sources
Uses 1 · Used by 2
LemmaBalog-Szemerédi-Gowers#
Let \(A,B\) be \(G\)-valued random variables on \(\Omega\), and set \(Z := A+B\). Then
Proof
Let \((A_1, B_1)\) and \((A_2, B_2)\) (and \(Z'\), which by abuse of notation we call \(Z\)) be conditionally independent trials of \((A,B)\) relative to \(Z\) as produced by Existence of conditional independent trials, thus \((A_1,B_1)\) and \((A_2,B_2)\) are coupled through the random variable \(A_1 + B_1 = A_2 + B_2\), which by abuse of notation we shall also call \(Z\).
Observe from Ruzsa distance in independent case that the left-hand side of (2) is
since, crucially, \((A_1 | Z=z)\) and \((B_2 | Z=z)\) are independent for all \(z\).
Applying submodularity (Alternate form of submodularity) gives
We estimate the second, third and fourth terms appearing here. First note that, by Entropy of conditionally independent variables and Entropy and relabeling (noting that the tuple \((A_1 - B_2, A_1, B_1)\) determines the tuple \((A_1, A_2, B_1, B_2)\) since \(A_1+B_1=A_2+B_2\))
Next observe that
Finally, we have
Substituting (5), (6) and (7) into (4) yields
and so by Conditioning reduces entropy
Since
and similarly for \(\mathbb{H}[B_2 | Z]\), we see that (3) is bounded by \(3 \mathbb{I}[A:B] + 2\mathbb{H}[Z]-\mathbb{H}[A]-\mathbb{H}[B]\) as claimed.
Lean
Formalized as ent_bsg.
Sources
LemmaUpper bound on conditioned Ruzsa distance#
Suppose that \((X, Z)\) and \((Y, W)\) are random variables, where \(X, Y\) take values in an abelian group. Then
In particular,
Proof
Using Alternate form of distance and Existence of independent copies, if \((X',Z'), (Y',W')\) are independent copies of the variables \((X,Z)\), \((Y,W)\), we have
Here, in the middle step we used Conditioning reduces entropy, and in the last step we used Ruzsa distance and Mutual information.
Lean
Formalized as condRuzsaDist_le, condRuzsaDist_le'.
Sources
Uses 5 · Used by 4
LemmaComparison of Ruzsa distances, I#
Let \(X, Y, Z\) be random variables taking values in some abelian group of characteristic \(2\), and with \(Y, Z\) independent. Then we have
and
Proof
We first prove (8). We may assume (taking an independent copy, using Existence of independent copies and Copy preserves Ruzsa distance, Ruzsa distance in independent case) that \(X\) is independent of \(Y, Z\). Then we have
Combining this with Kaimanovich-Vershik-Madiman inequality gives the required bound. The second form of the result is immediate Ruzsa distance in independent case.
Turning to (9), we have from Mutual information and Entropy and relabeling
and so (9) is a consequence of Upper bound on conditioned Ruzsa distance. Once again the second form of the result is immediate from Ruzsa distance in independent case.
Lean
Formalized as condRuzsaDist_diff_le, condRuzsaDist_diff_le', condRuzsaDist_diff_le'''.
Sources
LemmaComparison of Ruzsa distances, II#
Let \(X, Y, Z, Z'\) be random variables taking values in some abelian group, and with \(Y, Z, Z'\) independent. Then we have
Proof
By Comparison of Ruzsa distances, I (with a change of variables) we have
Adding this to (8) gives the result.
Lean
Formalized as condRuzsaDist_diff_ofsum_le.
Sources
Uses 1 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.