claimroutineinferred_dep
Ideal order along a branch equals weighted contact
Shows has order along a branch , the weighted contact
links the jet ideal to the contact heights in the curve inequality
Claim·§2.3 From the curve inequality to all coefficient packets·inside thmInterpolation with separated weights
Statement (paper)
For a branch through a center, with and , the ideal satisfies . This uses that replacing by the Taylor polynomial preserves , and that , are regular local coordinates at .
In plain English
For a branch through a center, with local coordinates and , the ideal has order along equal to , which equals .
Why it's here
This claim translates the weighted-jet ideal into the branch-contact quantity , which is the quantity the curve inequality controls. The key points are that swapping for its Taylor polynomial does not change , and that and are regular local coordinates at . This lets later steps, such as the nefness of on the blow-up, be checked curve by curve.
Classified routine:
The order of an ideal along a branch is the minimum of the orders of its generators. Here the coordinate change is regular, and the Taylor-truncation error has sufficiently high order not to change the weighted contact, using the earlier separated-weight choice.
Uses
Used by
Sources
PaperOpen
- Section
- §2.3 From the curve inequality to all coefficient packets
- Page
- —
- Label
—- Line
sections/interpolation.tex:457
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Algebraic ideals encode weighted branch contact" rests on claim-geom-interpolation-1