One-minor lower bound: for a subgroup with coordinate sections , ,
ProvedDiazModulus.le_boxHilb_torusVanishing_subgroupLet 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 , (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 , torusBox _ A₀ A₁ T is the span of the monomials of degree at most in and at most in the pair , and (boxHilb (torusBox ℂ A₀ A₁) I T) is the dimension of the image of that box in . Let be a subgroup of . has coordinate sections , : every agrees on with some element of the complex span of , and the only vanishing off with for every is . Then for every . 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 monomials with and lie in the box and are linearly independent modulo by DiazModulus.linearIndependent_on_subgroup; DiazModulus.card_le_boxHilb_of_linearIndependent counts them.
Novelty. None claimed: the lower bound for the Hilbert function of the obstruction subgroup 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 le_boxHilb_torusVanishing_subgroup {A₀ A₁ : Type*} [Fintype A₀] [Fintype A₁] (Γ : Subgroup (TorusGroup ℂ A₀ A₁)) (H : Finset A₀)
(J : Finset A₁) (hH : ∀ x : A₀ → ℂ, ∃ v ∈ Submodule.span ℂ {v | ∃ g ∈ Γ, Multiplicative.toAdd g.1 = v}, ∀ h ∈ H, v h = x h)
(hJ : ∀ φ : A₁ → ℤ, (∀ i ∉ J, φ i = 0) → (∀ g ∈ Γ, ∏ i, g.2 i ^ φ i = 1) → φ = 0)
(T : A₀ ⊕ A₁ → ℕ) :
(∏ h ∈ H, (T (Sum.inl h) + 1)) * ∏ j ∈ J, (2 * T (Sum.inr j) + 1)
≤ boxHilb (torusBox ℂ A₀ A₁) (torusVanishing (Γ : Set (TorusGroup ℂ A₀ A₁))) T := by
sorry
end DiazModulus