Th. 11.21 Step 5: a nonzero L×L minor of the interpolation matrix with algebraic data is at least exp(−C·L·Ξ) (Liouville)
ProvedDiazModulus.interp_det_liouvillePoints 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 . Suppose the coordinates of the and of the are algebraic and every lies in . 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 whenever , with .
Proof. All data are algebraic, so they lie in a number field , and is the image of the determinant of the same matrix over . DiazModulus.op_entry_denom_house gives and ; with a uniform exponent every entry of is integral of bounded house, so is a non-zero algebraic integer of house at most . Liouville's inequality (Transcendence.liouville_house) gives ; taking logarithms and using and elementary bounds gives .
Novelty. Classical; routine formalisation. Step 5 of the proof of DALAG Th. 11.21: Liouville's lower bound.
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem interp_det_liouville {ι₀ ι₁ κ₀ κ₁ : Type} [Fintype ι₀] [Fintype ι₁] [Fintype κ₀] [Fintype κ₁]
[DecidableEq ι₀] [DecidableEq ι₁]
(w : κ₀ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hwalg : ∀ k, (∀ h, (w k).1 h ∈ Qbar) ∧ ∀ i, (w k).2 i ∈ Qbar)
(η : κ₁ → (ι₀ → ℂ) × (ι₁ → ℂ)) (hηalg : ∀ j, (∀ h, (η j).1 h ∈ Qbar) ∧ ∀ i, (η j).2 i ∈ LogAlg) :
∃ 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 ≠ 0 →
-(C * (((T₀ + 1) ^ Fintype.card ι₀ * (2 * T₁ + 1) ^ Fintype.card ι₁ : ℕ) : ℝ) * ((N₀ : ℝ) * Real.log ((T₀ : ℝ) + T₁ + 2) + (T₀ : ℝ) * Real.log ((N₁ : ℝ) + 2)
+ (T₁ : ℝ) * ((N₁ : ℝ) + 1)))
≤ Real.log ‖(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‖ := by
sorry
end DiazModulus