corollaryroutine
Cross-pair error bound for true states
Corollary·
pred:cross·§3.3 Equality of one coordinateStatement (paper)
Let be as above, let be integers, and
let be an independent random test giving the state maps just described.
Set
There exists a fixed history , with
, for which the laws of the true, unhashed
states
satisfy
The history is formed from earlier tests and does not use .
In plain English
With the average rate at which over and random test , there is a single history with at most values, chosen from earlier tests and independent of , such that .
Why it's here
This turns the abstract prefix-history bound of the device lemma into a statement about the true, unhashed states: the history-conditioned law of lands in with failure probability only slightly above the baseline . The extra and terms are the cost of hashing the states and of the history's imperfect prediction. The history has bounded size and does not depend on , so it can be fixed in advance.
Classified routine:
A direct corollary of the prefix-history device lemma (pred-device), obtained by hashing the states into L buckets (the 4/L term), averaging over the random step to fix one history, and converting the bounded discrepancy into a failure-probability estimate; this is bookkeeping on top of that lemma.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.3 Equality of one coordinate
- Page
- —
- Label
pred:cross- Line
sections/02-prediction.tex:280
Leannot aligned
Phase 2 aligns this node to a Lean declaration.