corollaryroutineinferred_dep
Prefix history predicts acceptance failures
Corollary·
pred:acceptance·§3.2 Acceptance tests and the prediction couplingStatement (paper)
In the setting of , suppose each test specifies a set
of accepted codes for every .
Put
There is a fixed strict-prefix history , with at most
values, such that
The fresh test is independent of the fixed history construction.
In plain English
If each test accepts a set of codes for each , and is the average rate at which is rejected under , then a single history with at most values exists. Sampling from the predicted distribution instead of using the true code gives an average rejection rate of at most .
Why it's here
This turns the discrepancy bound of the prefix-history lemma into a statement about acceptance tests: a rejection indicator is a bounded inner-product test, so the history-based prediction fails at most slightly more often than the true code does. Later results use it to replace the true code by a predicted one from a bounded history while keeping the rejection rate under control, as in the quantization-test step and the bounded-alternative argument.
Classified routine:
Direct consequence of the prefix-history discrepancy lemma (pred-device), applied with the bounded test function given by the rejection indicator. Comparing against s_0 is bookkeeping plus the fact that some fixed history attains the expectation over the random history.
Uses
Used by
Sources
PaperOpen
- Section
- §3.2 Acceptance tests and the prediction coupling
- Page
- —
- Label
pred:acceptance- Line
sections/02-prediction.tex:185
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depcritique: Corollary pred:acceptance is stated "In the setting of " (02-prediction.tex:186) and its proof averages (line 208).