claimroutineinferred_dep
Parameters computable and checkable in polylog time
Statement (paper)
Given the numerical values , the parameters of and the endpoints of can be computed exactly, and the numerical hypotheses of Lemma together with , and the tail bound can be checked exactly, in bit operations; for all sufficiently large all of these checks pass.
In plain English
From , the parameters and the endpoints of can be computed exactly, and the layout lemma's numerical hypotheses, , and the binomial tail bound can be verified exactly, using bit operations; all these checks pass for all sufficiently large .
Why it's here
This is the algorithmic half of the parent lemma: it shows the parameter choice is effective and that the checks can be done exactly in polylogarithmic time. Passing for large follows from the size bounds and the interval and tail estimates of the two earlier claims, so only finitely many can fail.
Classified routine:
Bookkeeping: exact arithmetic on O(log n)-bit numbers and evaluation of a binomial tail sum over polylogarithmically many terms, with eventual success following directly from the asymptotic bounds in the two earlier claims.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §4.7 Choosing the parameters
- Page
- —
- Label
—- Line
main_full_version.tex:2828
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Exact computation and checking of parameters" rests on claim-lem-incidence-parameters-1
- infoinferred_depoutline: "Exact computation and checking of parameters" rests on claim-lem-incidence-parameters-2