claimroutineinferred_dep
Conditional agreement bounded by repeated game
Given , agreement is at most the -fold repeated game value
applies parallel repetition to the clean coordinates
Claim·§6.2 Vanishing advice on clean coordinates·inside lemAdvice agreement decays with clean coordinates
Statement (paper)
For every value of the conditioning randomness (with clean index set ), , where the right-hand side is interpreted as one when .
In plain English
Conditioned on any value of the recorded randomness , with clean index set , the probability that the strategies' outputs agree, , is at most the value of the -fold repetition of the game , which is at most (taken as one if is empty).
Why it's here
Given , the previous claim makes each side's advice input a function of and its own question, so the two local strategies become a strategy for the repeated game on the independent clean coordinates. Since gives a constant gap, the parallel repetition theorem yields the exponential decay in , and the next claim averages this bound over the random size of (binomial).
Classified routine:
Follows directly from the previous claim (advice is determined by r and each side's own question) by viewing the local strategies as a strategy for the repeated game, then applying the parallel repetition bound for projection games with gap 1/5, since (1/5)^2/16 = 1/400 and 1/400 ≥ 1/3600.
Uses
Used by
Sources
PaperOpen
- Section
- §6.2 Vanishing advice on clean coordinates
- Page
- —
- Label
—- Line
sections/05-clean.tex:202
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Conditional agreement bounded by repeated game" rests on claim-lem-clean-4