Th. 11.21 Steps 3–5: if , the interpolation matrix has a nonzero kernel vector, i.e. the vanishing premise of the multiplicity estimate
ProvedDiazModulus.interp_kernelPoints are for finite index sets . For and a weight vector on , is the operator on polynomials in the (), and for vectors () and , (the factors commute). For the columns are the with and ; there are of them. Given and (, ), the entry at a row datum (, , ) and a column is . In the entries, and , for points . Let be a subspace of dimension containing every and every , and suppose the coordinates of the and of the are algebraic and every lies in . Then there is such that, for all and with , where , some non-zero vector on the columns satisfies for every , every and every with . This is the premise of the multiplicity estimate.
Proof. Index the rows by the finite set of row data with and . If some maximal minor were non-zero, DiazModulus.interp_det_liouville would give and DiazModulus.interp_det_upper , so . With , , and DiazModulus.thetaN_ge_mul_sub gives ; as and , the hypothesis with excludes this. So every maximal minor vanishes, and DiazModulus.exists_ne_zero_mulVec_eq_zero_of_minors gives the kernel vector.
Novelty. Classical; routine formalisation. Steps 3–5 of the proof of DALAG Th. 11.21 (the interpolation determinant).
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem interp_kernel {ι₀ ι₁ κ₀ κ₁ : Type} [Fintype ι₀] [Fintype ι₁] [Fintype κ₀] [Fintype κ₁]
[DecidableEq ι₀] [DecidableEq ι₁]
(V : Submodule ℂ ((ι₀ → ℂ) × (ι₁ → ℂ))) (hV : 1 ≤ Module.finrank ℂ ↥V)
(w : κ₀ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hwV : ∀ k, w k ∈ V) (hwalg : ∀ k, (∀ h, (w k).1 h ∈ Qbar) ∧ ∀ i, (w k).2 i ∈ Qbar)
(η : κ₁ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hηV : ∀ j, η j ∈ V) (hηalg : ∀ j, (∀ h, (η j).1 h ∈ Qbar) ∧ ∀ i, (η j).2 i ∈ LogAlg) :
∃ C : ℝ, 0 < C ∧ ∀ T₀ T₁ N₀ N₁ : ℕ, 1 ≤ T₀ → 1 ≤ T₁ →
C * ((N₀ : ℝ) * Real.log ((T₀ : ℝ) + T₁ + 2) + (T₀ : ℝ) * Real.log ((N₁ : ℝ) + 2)
+ (T₁ : ℝ) * ((N₁ : ℝ) + 1))
≤ (((T₀ + 1) ^ Fintype.card ι₀ * (2 * T₁ + 1) ^ Fintype.card ι₁ : ℕ) : ℝ) ^ ((1 : ℝ) / Module.finrank ℂ ↥V) →
∃ c : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1)) → ℂ, c ≠ 0 ∧
∀ (rₑ : ℕ) (kₑ : Fin rₑ → κ₀) (sₑ : κ₁ → ℤ), rₑ ≤ N₀ → (∀ j, |sₑ j| ≤ ((N₁ : ℕ) : ℤ)) →
∑ l, c l * (MvPolynomial.eval (∑ j, ((sₑ j : ℤ) : ℂ) • (fun j => (η j).1) j)
((List.ofFn fun k : Fin rₑ =>
((∑ h, (w (kₑ k)).1 h • (MvPolynomial.pderiv h).toLinearMap
+ (∑ i, (w (kₑ k)).2 i * (((l.2 i : ℕ) : ℂ) - T₁)) • LinearMap.id :
Module.End ℂ (MvPolynomial ι₀ ℂ)))).prod
(∏ h, MvPolynomial.X h ^ (l.1 h : ℕ)))
* ∏ i, (∏ j, (fun j i => Complex.exp ((η j).2 i)) j i ^ sₑ j) ^ (((l.2 i : ℕ) : ℤ) - T₁)) = 0 := by
sorry
end DiazModulus