The generators of the ideal lie in the box , and vanishes to order along on for every stabilising
ProvedDiazModulus.obstructionSpan_vanishOrdLet 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 , (torusTransl g) is the algebra map , , , so that takes at the value of at . For , (torusVanishing S) is the ideal of the polynomials vanishing at every point of ; for an ideal , (torusZero 𝔟) is the set of at which every element of vanishes. For , (, , finite) and , (hmePoint u a s). For , a subspace , and , obstructionSpan P W u a m n S is the span of the with , and a list of elements of of length at most . Put . 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 ). for . Let , in the box boxD A₀ A₁ D₀ D₁ (degree at most in each and at most in each pair ), , and an ideal such that for and every list of elements of of length at most . Let with for , . For an ideal , = obstructionSpan P W u a (r M₁) (r M₀) (torusZero 𝔭) and . Then lies in that box and vanishOrd (I(Σ · S)) W M₀. 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. A generator stays in the box (DiazModulus.torusDeriv_mem_torusBox, DiazModulus.torusTransl_algEquiv). For a -list of length , (DiazModulus.torusDeriv_torusTransl), whose value at is that of at , i.e. ; DiazModulus.vanishOrd_ideal passes to the ideal.
Novelty. None claimed: the vanishing of the ideal in §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 obstructionSpan_vanishOrd {A₀ A₁ B₁ : Type*} [Fintype B₁] (D₀ D₁ : ℕ) (P : MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)
(hP : P ∈ torusBox ℂ A₀ A₁ (boxD A₀ A₁ D₀ D₁)) (W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ))) (u : B₁ → A₀ → ℂ)
(a : B₁ → A₁ → ℂˣ) (M₀ M₁ r : ℕ) (𝔭 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ))
(hb : ∀ s : B₁ → ℤ, (∀ b, |s b| ≤ (((r + 1) * M₁ : ℕ) : ℤ)) → ∀ l : List ((A₀ → ℂ) × (A₁ → ℂ)), l.length ≤ (r + 1) * M₀ →
(∀ w ∈ l, w ∈ W) → torusTransl (hmePoint u a s) (torusDerivList l P) ∈ 𝔭)
(S : Set (TorusGroup ℂ A₀ A₁)) (hS : ∀ v ∈ torusZero 𝔭, ∀ γ ∈ S, v * γ ∈ torusZero 𝔭) :
obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) ≤ torusBox ℂ A₀ A₁ (boxD A₀ A₁ D₀ D₁) ∧
((torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ⊆ vanishOrd (torusVanishing {z | ∃ s : B₁ → ℤ, (∀ b, |s b| ≤ (M₁ : ℤ)) ∧ ∃ γ ∈ S, z = hmePoint u a s * γ}) W M₀ := by
sorry
end DiazModulus