Vanishing to order along relative to an ideal is an ideal, containing the torus ideal when does
ProvedDiazModulus.vanishOrd_idealLet be a field. Let be finite types and the polynomial ring MvPolynomial (A₀ ⊕ (A₁ × Bool)) K 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 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 ). Then vanishOrd J W t is the underlying set of an ideal of , and implies . 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. Each is linear. Stability under multiplication goes by induction on the length bound, writing a list as followed by and using Leibniz for . If , then is stable under every (DiazModulus.torusDeriv_mem_torusBox), hence under every .
Novelty. None claimed: the vanishing conditions of §8.4.1 of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.
import Definitions.Def_DiazMultiplicity
namespace DiazModulus
theorem vanishOrd_ideal {K A₀ A₁ : Type*} [Field K] (J : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) K))
(W : Submodule K ((A₀ → K) × (A₁ → K))) (t : ℕ) :
∃ I : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) K), (I : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) K)) = vanishOrd J W t ∧
(torusIdeal K A₀ A₁ ≤ J → torusIdeal K A₀ A₁ ≤ I) := by
sorry
end DiazModulus