Wüstholz's inequality (8.20) at finite level: if vanishes to order along relative to , then
ProvedDiazModulus.wustholz_le_boxHilbLet be finite types and the polynomial ring MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ in the variables (), and (), and its torus ideal (torusIdeal). For , (torusDeriv w) is the invariant derivation of (DALAG Lemma 8.11), and (torusDerivList l) for a list . For , torusBox _ A₀ A₁ T is the span of the monomials of degree at most in and at most in the pair , and (boxHilb (torusBox ℂ A₀ A₁) I T) is the dimension of the image of that box in . For an ideal and a subspace , vanishOrd J W t is the set of with for every list of elements of of length at most (vanishing to order along relative to ). Let , be ideals of , a subspace of and with vanishOrd J W S₀; let and in a box with . Then for every . The names TorusGroup, torusPt, torusDeriv, torusDerivList, torusTransl, torusVanishing, torusZero, torusStab, standardSet, sectionIdeal, vanishOrd, hmePoint and obstructionSpan come from the Definition DiazMultiplicity (module Definitions.Def_DiazMultiplicity), which builds on the published Definition DiazHilbertBox (torusIdeal, torusBox, boxHilb, boxD, torusCoeffPoly, torusReduced, torusPoint).
Proof. With in the box independent modulo , (DiazModulus.exists_boxHilb_family), the products , (DiazModulus.card_multiIndex counts them), lie in the box and are independent modulo : applying to a relation and DiazModulus.derivation_pow_mul_mem isolate the coefficients of length , by induction on . DiazModulus.card_le_boxHilb_of_linearIndependent concludes.
Novelty. None claimed: Wüstholz's inequality (8.20) of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.
import Definitions.Def_DiazMultiplicity
namespace DiazModulus
theorem wustholz_le_boxHilb {A₀ A₁ : Type*} [Fintype A₀] [Fintype A₁] (J A : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ))
(W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ))) (S₀ n : ℕ) (hA : (A : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ⊆ vanishOrd J W S₀)
(w : Fin n → (A₀ → ℂ) × (A₁ → ℂ)) (hw : ∀ i, w i ∈ W) (Q : Fin n → (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (CQ : A₀ ⊕ A₁ → ℕ)
(hQbox : ∀ j, Q j ∈ torusBox ℂ A₀ A₁ CQ) (hQ : ∀ j, Q j ∈ J)
(hwQ : ∀ i j, torusDeriv (w i) (Q j) - (if i = j then 1 else 0) ∈ J) (T : A₀ ⊕ A₁ → ℕ) :
(S₀ + n).choose n * boxHilb (torusBox ℂ A₀ A₁) J T ≤ boxHilb (torusBox ℂ A₀ A₁) A (T + S₀ • CQ) := by
sorry
end DiazModulus