Conditional information under deterministic coordinate sweeps
Uniformly over deterministic starting decks and specified ordered lists of distinct labels, as : (1) at time , the images of any labels have total-variation distance from ; (2) at time , the images of any labels have total-variation distance at most for all sufficiently large ; and (3) the full permutation law satisfies , giving for all sufficiently large .
Parts 1 and 2 are fully proved within the manuscript. Part 3 is rigorously deduced from Part 1, provided the cited external Fourier transfer and reciprocal-degree results from [14] hold as stated.
“Theorem 1.1 (Fixed lists and a full-deck consequence). Uniformly over deterministic starting decks and specified ordered lists of distinct labels, the following hold as d → ∞: 1. At time 256d, the images of any k ≤ 7n/8 labels have total-variation distance o(1) from Unif(inj([k], V )). 2. At time 1024d, the images of any k ≤ 15n/16 labels have total-variation distance at most n−3/2, for all sufficiently large d. 3. The full permutation law satisfies ∥q∗(2048d) d − USn ∥TV → 0.” · Show in paper