Modulo the torus ideal , every polynomial in a per-coordinate box is congruent to a combination of reduced monomials in the same box
ProvedDiazModulus.torus_reduce_mem_restrictSupportLet 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 for every and every in the box there is a -linear combination of reduced monomials, also in the box , with . 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. The reduced form of replaces each pair by ; it is reduced, it is coordinatewise below the original exponent, so it stays in the box, and it does not change when and both go up by one. By strong induction on the degree every monomial is congruent to its reduced form modulo , since . Take for the image of under .
Novelty. Classical; routine formalisation.
import Definitions.Def_DiazHilbertBox
namespace DiazModulus
theorem torus_reduce_mem_restrictSupport {K A₀ A₁ : Type*} [Field K] (T : A₀ ⊕ A₁ → ℕ) (f : MvPolynomial (A₀ ⊕ (A₁ × Bool)) K)
(hf : f ∈ torusBox K A₀ A₁ T) :
∃ g ∈ torusBox K A₀ A₁ T ⊓ MvPolynomial.restrictSupport K (torusReduced A₀ A₁),
f - g ∈ torusIdeal K A₀ A₁ := by
sorry
end DiazModulus