Th. 11.21 Step 4: an L×L minor of the interpolation matrix is at most exp(−(Θₙ(L) − L·N₀) + C·L·Ξ), n = dim V, by Lemma 9.2 and Schwarz
ProvedDiazModulus.interp_det_upperPoints 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 (). Then there is such that, for all and , and for every choice of row data , one for each column , with and , the determinant of the matrix satisfies , with and is the least value of over the injective maps , with the total degree of a multi-index ( if there is no such map).
Proof. Fix a basis of and let be the coordinate map. Each column gives the entire function , , and each row the point and the directions . By DiazModulus.iteratedFDeriv_expMono_eq_op the entries of are the polynomial parts at times , so up to transposition. DiazModulus.interpolation_det_order (DALAG Lemma 9.2) gives , and DiazModulus.schwarz_order_at_zero (Schwarz) with gives . On each entry is at most , by DiazModulus.op_monomial_eval_norm_le for the polynomial part and , so ; finally is elementary.
Novelty. Classical; routine formalisation. Step 4 of the proof of DALAG Th. 11.21: the analytic upper bound.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem interp_det_upper {ι₀ ι₁ κ₀ κ₁ : Type} [Fintype ι₀] [Fintype ι₁] [Fintype κ₀] [Fintype κ₁]
[DecidableEq ι₀] [DecidableEq ι₁]
(V : Submodule ℂ ((ι₀ → ℂ) × (ι₁ → ℂ))) (w : κ₀ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hwV : ∀ k, w k ∈ V)
(η : κ₁ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hηV : ∀ j, η j ∈ V) :
∃ C : ℝ, 0 < C ∧ ∀ T₀ T₁ N₀ N₁ : ℕ, 1 ≤ T₀ → 1 ≤ T₁ →
∀ (ro : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1)) → ℕ) (ka : (l : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1))) → Fin (ro l) → κ₀)
(sv : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1)) → κ₁ → ℤ), (∀ l, ro l ≤ N₀) → (∀ l j, |sv l j| ≤ (N₁ : ℤ)) →
‖(Matrix.of fun l l' : (ι₀ → Fin (T₀ + 1)) × (ι₁ → Fin (2 * T₁ + 1)) =>
MvPolynomial.eval (∑ j, (((sv l) j : ℤ) : ℂ) • (fun j => (η j).1) j)
((List.ofFn fun k : Fin (ro l) =>
((∑ h, (w ((ka l) k)).1 h • (MvPolynomial.pderiv h).toLinearMap
+ (∑ i, (w ((ka l) 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 ^ (sv l) j) ^ (((l'.2 i : ℕ) : ℤ) - T₁)).det‖
≤ Real.exp (-(((sInf {S | ∃ κ' : Fin ((T₀ + 1) ^ Fintype.card ι₀ * (2 * T₁ + 1) ^ Fintype.card ι₁) → (Fin (Module.finrank ℂ ↥V) → ℕ), Function.Injective κ' ∧ S = ∑ l, ∑ i, κ' l i} : ℕ) : ℝ)
- (((T₀ + 1) ^ Fintype.card ι₀ * (2 * T₁ + 1) ^ Fintype.card ι₁ : ℕ) : ℝ) * N₀)
+ C * (((T₀ + 1) ^ Fintype.card ι₀ * (2 * T₁ + 1) ^ Fintype.card ι₁ : ℕ) : ℝ) * ((N₀ : ℝ) * Real.log ((T₀ : ℝ) + T₁ + 2) + (T₀ : ℝ) * Real.log ((N₁ : ℝ) + 2)
+ (T₁ : ℝ) * ((N₁ : ℝ) + 1))) := by
sorry
end DiazModulus