theoremroutineinferred_depstructure_uncertainunresolved_ref
Interpolation with separated weights
Separated weights make the jet map at points surjective for large
lets the main argument prescribe jets at several approximations
Theorem·
geom:interpolation·§2 Interpolation with separated weightsStatement (paper)
Fix integers and positive rational numbers such
that and
There are successive lower thresholds for positive rational numbers
, depending only on these fixed data and the previously
chosen weights, with the following property. Put
For any points
whose coordinates are pairwise distinct for each
, the map
is surjective for all sufficiently large, sufficiently divisible integers .
The divisibility requirement can be chosen using only the weights. The
remaining lower threshold for may depend on the points.
In plain English
Fix and rationals with and . Then weights can be chosen successively, depending only on the fixed data and earlier weights, so that for any points with pairwise distinct coordinates in each position, the map sending a polynomial in to its jets in at the points along the curve is surjective for all large, sufficiently divisible .
Why it's here
This is the geometric interpolation result that lets the main argument prescribe jet data at several approximation points. It is proved by blowing up along the weighted-jet ideal and showing a suitable divisor is ample. Nefness comes from the curve inequality, which the separated weights make independent of the points and centers, and the resulting vanishing of gives surjectivity onto jets. Only the final threshold on depends on the points, so the weight thresholds can be fixed in advance.
Classified routine:
The surjectivity follows from the earlier curve inequality: separated weights give the needed positivity on the blow-up, and standard ampleness and cohomology-vanishing arguments then yield surjectivity onto jets.
Uses
Used by
Inside the proof
Sources
PaperOpen
- Section
- §2 Interpolation with separated weights
- Page
- —
- Label
geom:interpolation- Line
sections/interpolation.tex:24
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depcritique: The interpolation theorem’s blowup argument invokes the curve inequality to prove its nef bound (sections/interpolation.tex:499–517). An internal claim has this edge, but the theorem node does not.
- infostructure_uncertainIts proof has no proof environment: center-independent weights are constructed at interpolation.tex:180–214, and §2.3 completes the argument at lines 429–584.
- warnunresolved_refThe passage from curve positivity to jets invokes external blowup, ampleness, eventual Rees pushdown, and vanishing results.