claimroutineinferred_dep
Factorial decay of iteration differences
Gap is at most
quantitative convergence step fixing
Claim·§4.1 Correction with a fixed column multiplier·inside lemFixed point with factorial convergence
Statement (paper)
Let . Then , the row- support of is contained in , and for every and all , , which gives , so can be chosen as a fixed integer making this at most .
In plain English
The gap is nonnegative and supported within the row supports . It satisfies , so , and a fixed brings this below .
Why it's here
This is the quantitative convergence step of the parent lemma. It starts from the entry bound and uses the row-support size to get a factor per iteration with a binomial count , giving factorial decay. Since the decay is factorial and uniform in , a single fixed suffices.
Classified routine:
A direct quantitative consequence of the earlier entry bound and row-support claims. It uses the standard iteration-error estimate for a monotone fixed-point iteration together with the binomial bound , which gives factorial decay.
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §4.1 Correction with a fixed column multiplier
- Page
- —
- Label
—- Line
sections/hierarchy.tex:151
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Factorial decay of iteration differences" rests on claim-lem-hier-fixed-point-2
- infoinferred_depoutline: "Factorial decay of iteration differences" rests on claim-lem-hier-fixed-point-3