claimroutineinferred_dep
Truncation tails consume limited weight
Bounds tail weight: nonzero coefficients force
controls the scalars, giving the term in
Statement (paper)
If a coefficient occurring in is nonzero (with ), then .
In plain English
If a coefficient appearing in the row identity is nonzero with , then the total weight is at most , which is at most and strictly less than .
Why it's here
This bounds how much weight the tail factors can contribute in the exact expansion from the previous claim: a nonzero coefficient of with forces the tails' total order to be at most , and this converts into a weight bound. The following claim uses this to control the size of the scalars , which gives the term in .
Classified routine:
This is a direct consequence of the tail orders in claim-det-translation-1: a nonzero coefficient with k≤s requires ∑ᵢdᵢTᵢ≤s. The remaining inequalities follow from the parameter bounds on wᵢ and H.
Sources
PaperOpen
- Section
- §3.2 Translation to entire functions
- Page
- —
- Label
—- Line
sections/determinant.tex:224
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Truncation tails consume limited weight" rests on claim-det-translation-1