The premise of the multiplicity estimate: vanishes at for all , and
ProvedDiazModulus.eval_torusDerivList_eq_zeroLet be finite types and the polynomial ring MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ in the variables (), and (), and its torus ideal (torusIdeal). Write (TorusGroup: pairs , in the additive group , , written multiplicatively), and say that a polynomial vanishes at when it vanishes at the point (torusPt g). For , (torusDeriv w) is the invariant derivation of (DALAG Lemma 8.11), and (torusDerivList l) for a list . For , (, , finite) and , (hmePoint u a s). Let be a type, () with span , , , coefficients and as in torusCoeffPoly, and assume the premise of the Definition MultiplicityEstimateElem for the complex numbers : for every , every and every with , , with as in DiazModulus.eval_torusDerivList_torusCoeffPoly. Then vanishes at for every list of elements of of length at most and every with . 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. By DiazModulus.eval_torusDerivList_torusCoeffPoly the premise says that evaluation at kills for , hence the span of these. Since is linear, for , so .
Novelty. None claimed: the premise of Theorem 8.1, read on the invariant derivations of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.
import Definitions.Def_DiazMultiplicity
namespace DiazModulus
theorem eval_torusDerivList_eq_zero {A₀ A₁ B₀ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁]
[DecidableEq A₀] [DecidableEq A₁]
(wₑ : B₀ → (A₀ → ℂ) × (A₁ → ℂ)) (uₑ : B₁ → A₀ → ℂ) (aₑ : B₁ → A₁ → ℂ) (D₀ D₁ M₀ M₁ : ℕ)
(cₑ : (A₀ → Fin (D₀ + 1)) × (A₁ → Fin (2 * D₁ + 1)) → ℂ)
(a : B₁ → A₁ → ℂˣ) (ha : ∀ j i, (a j i : ℂ) = aₑ j i)
(hprem : (∀ (rₑ : ℕ) (kₑ : Fin rₑ → B₀) (sₑ : B₁ → ℤ), rₑ ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ j, |sₑ j| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
∑ l, cₑ l * (MvPolynomial.eval (∑ j, ((sₑ j : ℤ) : ℂ) • uₑ 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 : ℕ) : ℂ) - D₁)) • LinearMap.id :
Module.End ℂ (MvPolynomial A₀ ℂ)))).prod
(∏ h, MvPolynomial.X h ^ (l.1 h : ℕ)))
* ∏ i, (∏ j, aₑ j i ^ sₑ j) ^ (((l.2 i : ℕ) : ℤ) - D₁)) = 0)) :
∀ l : List ((A₀ → ℂ) × (A₁ → ℂ)), l.length ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ w ∈ l, w ∈ Submodule.span ℂ (Set.range wₑ)) →
∀ s : B₁ → ℤ, (∀ b, |s b| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
MvPolynomial.eval (torusPt (hmePoint uₑ a s)) (torusDerivList l (torusCoeffPoly D₀ D₁ cₑ)) = 0 := by
sorry
end DiazModulus