DALAG Lemma 9.2: vanishes at to order at least
ProvedDiazModulus.interpolation_det_orderLet be entire functions on , and for let , and . Then vanishes at to order at least ; precisely, in . Here is the least value of over the injective maps , with the total degree of a multi-index ( if there is no such map).
Proof. is entire, so it suffices that when . By the Leibniz rule for determinants (DiazModulus.iteratedDeriv_det_eq_sum) is a combination of determinants whose column is differentiated times, , and by DiazModulus.iteratedDeriv_iteratedFDeriv_line each entry is at a tuple of vectors, with and . Expanding the vectors in the standard basis and using multilinearity, the determinant is a sum of determinants indexed by choices of basis vectors; for each choice let count how often each basis vector occurs in column , a multi-index of degree . If is injective then , which is excluded; otherwise two columns are equal, by the symmetry of iterated derivatives, and the determinant vanishes.
Novelty. Classical; routine formalisation. This is DALAG Lemma 9.2.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem interpolation_det_order {n L : ℕ} (f : Fin L → (Fin n → ℂ) → ℂ)
(hf : ∀ l, AnalyticOnNhd ℂ (f l) Set.univ) (ζ : Fin L → Fin n → ℂ) (σ : Fin L → ℕ)
(v : (μ : Fin L) → Fin (σ μ) → Fin n → ℂ) :
((sInf {S | ∃ κ' : Fin (L) → (Fin n → ℕ), Function.Injective κ' ∧ S = ∑ l, ∑ i, κ' l i} : ℕ) : ℕ∞) ≤
analyticOrderAt (fun z : ℂ =>
(Matrix.of fun l μ => iteratedFDeriv ℂ (σ μ) (f l) (z • ζ μ) (v μ)).det) 0
+ ∑ μ, (σ μ : ℕ∞) := by
sorry
end DiazModulus