Every prime over the ideal contains a translate of any ideal vanishing on the stabiliser of
ProvedDiazModulus.exists_le_translate_of_le_torusVanishingLet 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 . torusStab 𝔭 is the stabiliser . Let and a prime such that for every , if then (𝔭.comap (torusTransl z)) is a minimal prime of . For an ideal , = obstructionSpan P W u a (r M₁) (r M₀) (torusZero 𝔭) and . Let be an ideal and a prime. Then for some . 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. For , (DiazModulus.torusVanishing_torusZero, DiazModulus.torusTransl_algEquiv), one of the finitely many minimal primes of ; points giving the same prime differ by the stabiliser. So finitely many translates of have their intersection in , and prime avoidance picks one.
Novelty. None claimed: the finiteness of the cosets 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 exists_le_translate_of_le_torusVanishing {A₀ A₁ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁] (P : MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ) (W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ)))
(u : B₁ → A₀ → ℂ) (a : B₁ → A₁ → ℂˣ) (M₀ M₁ r : ℕ) (𝔭 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (h𝔭 : 𝔭.IsPrime)
(hJ𝔭 : torusIdeal ℂ A₀ A₁ ≤ 𝔭)
(hc : ∀ z : TorusGroup ℂ A₀ A₁, torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) {1} : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ≤ 𝔭.comap (torusTransl z) →
𝔭.comap (torusTransl z) ∈ (torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) {1} : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ))).minimalPrimes)
(𝔞 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (h𝔞 : 𝔞 ≤ torusVanishing (torusStab 𝔭)) (𝔮 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) (h𝔮 : 𝔮.IsPrime)
(hA𝔮 : torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ≤ 𝔮) :
∃ g : TorusGroup ℂ A₀ A₁, 𝔞 ≤ 𝔮.comap (torusTransl g) := by
sorry
end DiazModulus