claimroutine
Precision choice beats coordinate factor N
Precision makes at the start
absorbs the conditioning factor into the precision
Claim·§12.2 A dyadic approximation at the specified start·inside thmDeterministic logspace approximation of acceptance probability
Statement (paper)
With and the fixed linear coefficient of chosen large enough that , one has ; in particular the bound in Equation is at most .
In plain English
With the linear coefficient of large enough that , the conditional probability that given is at most . The tail bound is at most .
Why it's here
This applies the conditional eighth-moment bound at the specified start with the error bound from the fixed-precision estimators. The conditioning cost, a factor that is exponential in , is absorbed by choosing the precision larger by an amount linear in . That makes the failure probability at at most , which the next claim uses to read off accurate dyadic digits of .
Classified routine:
Direct parameter bookkeeping: combines the conditional eighth-moment bound (lem-final-majority) with the estimator error bound (thm-fp-estimators) via Markov's inequality, absorbing the exponential-in-B conditioning factor by choosing the precision larger by an amount linear in B.
Uses
Used by
Sources
PaperOpen
- Section
- §12.2 A dyadic approximation at the specified start
- Page
- —
- Label
—- Line
sections/conclusion.tex:166
Leannot aligned
Phase 2 aligns this node to a Lean declaration.