No nonzero combination of reduced monomials , with , lies in the torus ideal
ProvedDiazModulus.torus_reduced_inf_eq_botLet be a field and types, and let be the polynomial ring over in the variables () and (). The per-coordinate box torusBox K A₀ A₁ T, for , is the span of the monomials with for every and for every ; is the torus ideal torusIdeal K A₀ A₁, the kernel of ; a monomial is reduced when for every (torusReduced). Then the -span of the reduced monomials meets only in . No hypothesis on is needed. The names boxHilb, blockBox, torusBox, torusIdeal, torusList, torusReduced, boxD, torusCoeffPoly, torusPoint and UnmixedHeight are those of the published Definition DiazHilbertBox (module Definitions.Def_DiazHilbertBox).
Proof. Let be the -linear map , with the reduced form of the previous node. Since does not change when and both go up by one, for every , so vanishes on ; and is the identity on combinations of reduced monomials. So a reduced combination in equals its image under , which is .
Novelty. Classical; routine formalisation.
import Definitions.Def_DiazHilbertBox
namespace DiazModulus
theorem torus_reduced_inf_eq_bot {K A₀ A₁ : Type*} [Field K] :
MvPolynomial.restrictSupport K (torusReduced A₀ A₁)
⊓ Submodule.restrictScalars K (torusIdeal K A₀ A₁) = ⊥ := by
sorry
end DiazModulus