The height condition (H*): every prime over the ideal has height at least
ProvedDiazModulus.le_height_obstructionLet 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 , (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 . sectionIdeal ℓ ψ is the ideal of . Let , , 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 , , , . The forms are normalised off : and for , ; the rows are triangular off : and for , . If sectionIdeal ℓ ψ , then every prime has (truncated subtraction). 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.exists_le_translate_of_le_torusVanishing, sectionIdeal ℓ ψ lies in some , whose quotient has dimension at most (DiazModulus.ringKrullDim_quotient_sectionIdeal_le); DiazModulus.card_le_height_add_of_ringKrullDim_quotient_le gives , and keeps heights (DiazModulus.torusTransl_algEquiv).
Novelty. None claimed: the height condition 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 le_height_obstruction {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)
(H : Finset A₀) (J : Finset A₁) (ℓ : A₀ → A₀ → ℂ) (ψ : A₁ → A₁ → ℤ)
(hℓ : ∀ h ∉ H, ℓ h h = 1 ∧ ∀ h' ∉ H, h' ≠ h → ℓ h h' = 0) (hψ : ∀ i ∉ J, ψ i i ≠ 0 ∧ ∀ i' ∉ J, i' ≠ i → ψ i i' = 0)
(h𝔞 : sectionIdeal ℓ ψ ≤ torusVanishing (torusStab 𝔭)) :
∀ p : Ideal (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ), p.IsPrime → torusIdeal ℂ A₀ A₁ ⊔ Ideal.span (obstructionSpan P W u a (r * M₁) (r * M₀) (torusZero 𝔭) : Set (MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ)) ≤ p →
((Fintype.card A₁ + ((Fintype.card A₀ + Fintype.card A₁) - (H.card + J.card)) : ℕ) : ℕ∞) ≤ p.height := by
sorry
end DiazModulus