Sharp Hermite interpolation for elliptic-extension chart jets
ProvedWeierstrassEllipticZeta.elliptic_extension_bounded_hermite_interpolationFor complex parameters , consider the two polynomial derivations on four-variable polynomial rings over :
in variables , and
in variables .
Write for the independent time coordinate, so that in either chart. Fix complex parameters , either chart, a finite set , and nonnegative integers for . Assume the first-coordinate map is injective on . Set .
For every assignment of complex scalar jets , with and , there is a unique univariate polynomial such that
Here is the four-variable polynomial obtained by substituting for . Thus all contact data can be interpolated using only the time coordinate, with the sharp degree bound when . Uniqueness is among time polynomials with degree below .
The proof identifies the displayed jets with ordinary derivatives of at the distinct scalars . Taylor expansion characterizes order- vanishing by divisibility by . The Chinese remainder theorem supplies a simultaneous interpolant, and its remainder modulo has degree below . Any two such remainders differ by a multiple of that monic degree- polynomial and hence are equal.
Formalization Note The polynomial degree in this statement is Lean's Polynomial.degree, valued in the natural numbers with a bottom element, so the zero polynomial has degree minus infinity. In particular, empty and zero orders are included: when , the unique polynomial is zero. Distinct first coordinates are essential to this time-only assertion. No chart-cubic equation, nonzero denominator or nonsingularity condition is required. Lean chart indices 0 and 1 select homogeneous-coordinate charts 0 and 2.
import Definitions.Def_WeierstrassEllipticZeta_ProjectiveChartCalculus import Mathlib.Algebra.Polynomial.AlgebraMap import Mathlib.Algebra.Polynomial.Degree.Defs open WeierstrassEllipticZeta
theorem WeierstrassEllipticZeta.elliptic_extension_bounded_hermite_interpolation (g₂ g₃ : ℂ) :
∀ (c : Fin 2) (V : Finset (Fin 4 → ℂ)) (n : V → ℕ),
Function.Injective (fun v : V => v.val 0) →
∀ a : (v : V) → Fin (n v) → ℂ, ∃! p : Polynomial ℂ,
p.degree < (∑ v : V, n v : ℕ) ∧
∀ (v : V) (k : Fin (n v)),
MvPolynomial.eval v.val ((extensionChartDerivation g₂ g₃ c)^[k.val]
(Polynomial.aeval (MvPolynomial.X (0 : Fin 4)) p)) = a v k := by sorry