claimroutineinferred_dep
Fresh test and fixed history
Claim·§3.1 The probability laws and the entropy comparison·inside lemPrefix history predicts test discrepancy
Statement (paper)
The average absolute discrepancy bound holds with the step test replaced by a fresh test drawn independently after the strict prefix , which is exactly . Consequently, averaging over strict prefixes, some fixed history , taking at most possible values, has average absolute discrepancy over the fresh test at most .
In plain English
The discrepancy bound also holds when the step test is replaced by a fresh test drawn independently after the prefix . Hence some fixed history , among at most possible values, has average absolute discrepancy over the fresh test at most this bound.
Why it's here
The previous claim bounds the discrepancy for the step test . Since is independent of the strict prefix and has the same law as a fresh , the two averages coincide, which gives . Averaging over prefixes then yields a single history that is at least as good as the average, and a history has at most values because it consists of codes in .
Classified routine:
Direct consequence of the previous claim: since T_J is independent of the strict prefix and has the same law as a fresh test, the two averages coincide. Choosing a history at least as good as the average is a standard averaging (pigeonhole) argument, and the count M^{K-1} comes from the history being K-1 codes in [M].
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.1 The probability laws and the entropy comparison
- Page
- —
- Label
—- Line
sections/02-prediction.tex:167
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Replace step test by fresh test; fix history" rests on claim-pred-device-3