Endgame
Let \(X_1,X_2,\tilde X_1,\tilde X_2\) be as before, and introduce the random variables
and
LemmaSymmetry identity#
We have
Proof
This should follow from Copy preserves entropy, Alternate formula for conditional mutual information, and Chain rule.
Lean
Formalized as I₃_eq.
Sources
Uses 3 · Used by 1
LemmaBound on conditional mutual informations#
We have
Proof
From the definitions of \(I_1,I_2\) and Symmetry identity, we see that
Applying First estimate and Second estimate we have the inequalities
We conclude that
and the claim follows from some calculation.
Lean
Formalized as I₃_eq, sum_condMutual_le.
Sources
Uses 3 · Used by 2
LemmaBound on distance increments#
We have
Proof
By Comparison of Ruzsa distances, II (taking \(X = X_1^0\), \(Y = X_1\), \(Z = X_2\) and \(Z' = \tilde X_1 + \tilde X_2\), so that \(Y + Z = U\) and \(Y + Z + Z' = S\)) we have, noting that \(\mathbb{H}[Y+ Z] = \mathbb{H}[Z']\),
Further applications of Comparison of Ruzsa distances, II give
and
where \(W' := X_2 + \tilde X_2\). To treat \(d[X^0_2;W|S]\), first note that this equals \(d[X^0_2;W'|S]\), since for a fixed choice \(s\) of \(S\) we have \(W' = W + s\) (here we need some helper lemma about Ruzsa distance). Now we may apply Comparison of Ruzsa distances, II to obtain
Summing these six estimates and using Entropy bound on quadruple sum, we conclude that
as required.
Lean
Formalized as sum_dist_diff_le.
Sources
Uses 2 · Used by 1
LemmaKey identity#
We have \(U+V+W=0\).
Proof
Obvious because we are in characteristic two.
Lean
Formalized as sum_uvw_eq_zero.
Sources
Used by 2
For the next two lemmas, let \((T_1,T_2,T_3)\) be a \(G^3\)-valued random variable such that \(T_1+T_2+T_3=0\) holds identically. Set
LemmaConstructing good variables, I#
One has
Proof
We apply Balog-Szemerédi-Gowers with \((A,B) = (T_1, T_2)\) there. Since \(T_1 + T_2 = T_3\), the conclusion is that
The right-hand side in (2) can be rearranged as
using the fact (from Entropy and relabeling) that all three terms \(\mathbb{H}[T_i,T_j]\) are equal to \(\mathbb{H}[T_1,T_2,T_3]\) and hence to each other. We also have
by Upper bound on conditioned Ruzsa distance, and similarly
Putting the above observations together, we have
where we introduce the notation
On the other hand, from Distance lower bound we have \(k \leq \psi[Y_1;Y_2]\), and the claim follows.
Lean
Formalized as construct_good_prelim.
Sources
Uses 3 · Used by 1
(Note: in the paper, this lemma was phrased in a more intuitive formulation that is basically the contrapositive of the one here. Similarly for the next two lemmas.)
The proof of Constructing good variables, I is shown with its statement.
LemmaConstructing good variables, II#
One has
Proof
Average Constructing good variables, I over all six permutations of \(T_1,T_2,T_3\).
Lean
Formalized as construct_good.
Sources
Uses 1 · Used by 1
Theorem\(\tau\)-decrement#
Let \(X_1, X_2\) be tau-minimizers. Then \(d[X_1;X_2] = 0\).
Proof
Set \(k := d[X_1;X_2]\). Applying Constructing good variables, II with any random variables \((T_1,T_2,T_3)\) such that \(T_1+T_2+T_3=0\) holds identically, we deduce that
Note that \(\delta\) is still defined by (1) and thus depends on \(T_1,T_2,T_3\). In particular we may apply this for
for \(s\) in the range of \(S\) (which is a valid choice by Key identity) and then average over \(s\) with weights \(p_S(s)\), to obtain
where
Putting this together with Bound on conditional mutual informations and Bound on distance increments, we conclude that
since the quantity \(2 \eta k - I_1\) is non-negative (by First estimate), and its coefficient in the above expression is non-positive provided that \(\eta(2\eta + 17) \le 3\), which is certainly the case with Definition eta-def. Moreover, from Definition eta-def we have \(8 \eta + \eta^2 < 1\). It follows that \(k=0\), as desired.
Lean
Formalized as tau_strictly_decreases.
Sources
Uses 5 · Used by 1
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.