claimroutine
Coefficient digits via integer arithmetic
Coefficient digits computed by query-free integer arithmetic after place
shows input queries stop at early places
Statement (paper)
The signed numerator of in units has bits and is formed by querying places and updating the integer prefix. Once this prefix is obtained, a coefficient digit of place is returned by integer computations (numerator squaring, integer division, and floors at places and , or the place-zero floor alone at ) that make no further operand queries and use only bits, with no clipping needed because the coefficients were normalized in advance.
In plain English
The signed numerator of in units has bits and comes from querying input places and updating an integer prefix. Given that prefix, the coefficient digit at place is computed by integer operations that make no further queries and use bits, with no clipping.
Why it's here
This claim bounds the cost of producing the reciprocal's coefficient digits. All input queries occur at places up to while the prefix is built, and the rest is query-free integer arithmetic (squaring, division, floors at places and ) in linear space. That is what the early-word payment claim uses to confine the -bit word to early input places. The residue-stream lemma then turns the approximate integers into exact digits.</br>
Classified routine:
Direct bookkeeping inside the reciprocal lemma: elementary integer arithmetic (squaring, division, floors) on an -bit prefix, combined with the earlier residue-stream lemma that turns approximate integers into exact signed digits.
Uses
Used by
Sources
PaperOpen
- Section
- §10.4 Reciprocals and the early-word convention
- Page
- —
- Label
—- Line
sections/arithmetic.tex:488
Leannot aligned
Phase 2 aligns this node to a Lean declaration.