On a subgroup of with coordinate sections , , a reduced polynomial in vanishing on is zero
ProvedDiazModulus.linearIndependent_on_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). 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 . Let be reduced (no monomial of is divisible by any ; torusReduced), with every monomial in the variables (), , () only. If vanishes at every , then . 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. On , with distinct characters (). DiazModulus.eval_eq_zero_of_sum_mul_char gives on , DiazModulus.eval_eq_zero_on_span_of_addSubgroup on the span of the , and the section gives .
Novelty. None claimed: the independence used in the lower bound 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 linearIndependent_on_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)
(f : MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ) (hf : f ∈ MvPolynomial.restrictSupport ℂ (torusReduced A₀ A₁))
(hfH : ∀ m ∈ f.support, (∀ h ∉ H, m (Sum.inl h) = 0) ∧ ∀ i ∉ J, ∀ b, m (Sum.inr (i, b)) = 0)
(hΓ : ∀ g ∈ Γ, MvPolynomial.eval (torusPt g) f = 0) :
f = 0 := by
sorry
end DiazModulus