The descent of DALAG 8.4.1: some step of the chain has a common minimal prime with , all of whose translates over are minimal
ProvedDiazModulus.exists_chain_primeLet 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 , (, , 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 . Let , a subspace, , , and assume that vanishes at for every list of elements of of length at most and every with . Assume moreover . Then there are and a prime with such that (b) for and every list of elements of of length at most ; (c) for every , if then (𝔭.comap (torusTransl z)) is a minimal prime of . 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. The heights of satisfy (, prime of height , DiazModulus.torusVanishing_univ) and ( vanishes at the point of ). So the height stops growing at some ; a prime of that height gives (b), and (c) follows since preserves heights (DiazModulus.torusTransl_algEquiv).
Novelty. None claimed: the descent 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 exists_chain_prime {A₀ A₁ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁] (P : MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ) (hP0 : P ∉ torusIdeal ℂ A₀ A₁)
(W : Submodule ℂ ((A₀ → ℂ) × (A₁ → ℂ))) (u : B₁ → A₀ → ℂ) (a : B₁ → A₁ → ℂˣ) (M₀ M₁ : ℕ)
(hvan : ∀ l : List ((A₀ → ℂ) × (A₁ → ℂ)), l.length ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ w ∈ l, w ∈ W) →
∀ s : B₁ → ℤ, (∀ b, |s b| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
MvPolynomial.eval (torusPt (hmePoint u a s)) (torusDerivList l P) = 0) :
∃ r < (Fintype.card A₀ + Fintype.card A₁), ∃ 𝔭 : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ), 𝔭.IsPrime ∧ torusIdeal ℂ A₀ A₁ ≤ 𝔭 ∧ P ∈ 𝔭 ∧
(∀ 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) ∈ 𝔭) ∧
∀ 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 := by
sorry
end DiazModulus