claimroutineinferred_dep
Excess contact yields auxiliary polynomial
Failure of the curve inequality yields of -order ≥ at all points
builds the auxiliary polynomial for the contradiction
Statement (paper)
If fails, then for every sufficiently large integer there exists a nonzero polynomial of -degree at most whose expansions at all the prescribed points have -order at least .
In plain English
If the curve inequality fails, then for every sufficiently large there is a nonzero polynomial of -degree at most whose expansions at all prescribed points have -order at least .
Why it's here
This is the interpolation step of the proof by contradiction: a curve violating the bound has too little degree compared with its contact at the prescribed points, which leaves room to construct vanishing to high -order. The separated weights from the earlier claim make the count of conditions independent of the points and centers, and is the auxiliary polynomial used in the later claims, for example to show derivatives vanish along and to run the zero-pole count.
Classified routine:
This is an auxiliary-polynomial interpolation step: failure of the degree bound leaves more coefficients than vanishing conditions, so a nonzero polynomial exists by linear algebra. The earlier separated-weights claim supplies the point-independent condition count.
Uses
Used by
Sources
PaperOpen
- Section
- §2.2 The curve inequality
- Page
- —
- Label
—- Line
sections/interpolation.tex:251
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Excess contact produces auxiliary polynomial" rests on claim-geom-interpolation-1