claimroutine
Persistent derivatives force large local length
Lower-bounds local length by on a slice
lower bound on intersection multiplicity
Claim·§2.1 A local multiplicity comparison·inside lemLocal multiplicity comparison of weights and costs
Statement (paper)
Let be the affine coordinate slice through the chosen smooth point of , obtained by fixing the coordinates outside . Then the zero set of the restricted equations is isolated at , and the local quotient of the analytic local ring of at by the ideal generated by the restricted equations has length at least , for every .
In plain English
On the coordinate slice through a smooth point of (fixing coordinates outside ), the restricted equations have an isolated zero at . The local quotient ring of at by these equations has length at least , which is at least for every .
Why it's here
This gives the lower bound on local intersection multiplicity in the proof of the multiplicity comparison. The vanishing of the derivatives on for small cost puts many monomials in the -field normal coordinates into the quotient, so it must be large. The next claim pairs this with a weighted Bezout upper bound, and the two bounds together give the comparison of with .
Classified routine:
This adapts the standard local-algebra argument that vanishing derivatives leave corresponding monomial classes independent in the local quotient. The numerical bound is an elementary lattice-point estimate.
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §2.1 A local multiplicity comparison
- Page
- —
- Label
—- Line
sections/interpolation.tex:100
Leannot aligned
Phase 2 aligns this node to a Lean declaration.