claimroutineinferred_dep
Coefficient bound and term count
Bounds each scalar by and counts ≤ terms
explicit estimates finishing the translation lemma
Statement (paper)
Every nonzero scalar occurring with index in satisfies , that is, (and the bound holds trivially for a zero scalar). Moreover each coordinate of and is at most and , so the number of terms is at most .
In plain English
Every scalar attached to an index in the row identity satisfies , where collects the , and contributions. Also, the coordinates of and are at most and , so there are at most terms.
Why it's here
This finishes the proof of the translation lemma by turning the exact row identity into explicit estimates. The tail-weight bound from the previous claim supplies the part of , and counting the admissible index ranges gives , so each row is a controlled sum of entire-function rows.
Classified routine:
This is bookkeeping from the exact row expansion in claim-det-translation-1 and the tail-weight estimate in claim-det-translation-2: bound the coefficients, collect their contributions into , and count the allowed index ranges.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §3.2 Translation to entire functions
- Page
- —
- Label
—- Line
sections/determinant.tex:232
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Approximation errors control coefficients and count" rests on claim-det-translation-1
- infoinferred_depoutline: "Approximation errors control coefficients and count" rests on claim-det-translation-2