claimroutineinferred_dep
Stated precisions recover F(0) mod 2^p
Statement (paper)
Reducing each quotient coefficient of modulo , that is, replacing it by an arbitrary lift of its residue modulo with , changes its contribution in by an element of . Consequently the reconstructed sum is integral and differs from by an element of , so modulo is recovered from the stated precisions.
In plain English
Reducing each quotient coefficient of modulo , with , changes the reconstructed sum for only by an element of . So the sum is integral and agrees with modulo .
Why it's here
This is the precision bookkeeping step that finishes the lemma's recovery claim. Division by loses no precision, and multiplying by loses at most bits of 2-adic precision, which the extra in covers. The remaining is the slack in that absorbs the other multipliers in the formula.
Classified routine:
Precision bookkeeping that combines the two earlier claims (division by E_t loses no 2-adic precision, and E_t(0) loses at most 6D_t h bits) with the slack 8M(a+1) built into p_t. It follows directly from the Hermite interpolation formula by a standard 2-adic valuation count.
Uses
Used by
Sources
PaperOpen
- Section
- §D.4.4 Tapered Hermite recovery
- Page
- —
- Label
—- Line
quantitative-contraction.tex:318
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Stated precisions recover F(0) mod 2^p" rests on claim-lem-tapered-hermite-2
- infoinferred_depoutline: "Stated precisions recover F(0) mod 2^p" rests on claim-lem-tapered-hermite-3