claimroutineinferred_dep
Single-center zero-pole count contradicts excess
A zero-pole count for gives at one center
closes the contradiction in the single-center case
Statement (paper)
Suppose the prescribed points on reduce to the single point , and let be a coordinate nonconstant on . Then the nonzero rational function has total pole degree at most and order at least at each branch , so that , by the last inequality in ; this contradicts the assumption that fails.
In plain English
If all prescribed points on reduce to a single point , then the curve inequality cannot fail: a nonconstant coordinate gives a function whose zero and pole counts force .
Why it's here
This finishes the proof by contradiction in the single-center case reached by the previous claim. The nonzero function has at most poles but vanishes to order at least at each branch over , and comparing these counts together with the last inequality in the condition contradicts the assumed failure of the bound.Thus the curve inequality holds in this case.
Classified routine:
This follows by the standard zero–pole degree count for a nonzero rational function on a curve, applied to the coordinate function with the stated weighted-degree pole bound. The final contradiction uses the earlier single-center reduction and the inequality in .
Uses
Used by
Nothing in the paper
Sources
PaperOpen
- Section
- §2.2 The curve inequality
- Page
- —
- Label
—- Line
sections/interpolation.tex:414
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Single-center zero-pole count contradicts excess" rests on claim-geom-curve-inequality-6
- infoinferred_depoutline: "Single-center zero-pole count contradicts excess" rests on claim-geom-curve-inequality-1
- infoinferred_depoutline: "Single-center zero-pole count contradicts excess" rests on claim-geom-interpolation-1