A coefficient vector on the box gives in that box, outside the torus ideal if , with
ProvedDiazModulus.torus_coeff_polyLet 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). Assume that and are finite, let , and let be a family of elements of indexed by the pairs with and . Let be torusCoeffPoly D₀ D₁ c, that is , with the positive part. Then (i) lies in the box boxD A₀ A₁ D₀ D₁ (-degree at most , at most ); (ii) if then ; (iii) for every and , the value of at the point torusPoint x y is , with the integer exponents . 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. (i) Each monomial of has -degree and -degree . (ii) The monomials of are reduced, since one of the two positive parts vanishes, and distinct give distinct monomials, since ; so if , DiazModulus.torus_reduced_inf_eq_bot gives and every , a coefficient of , is . (iii) Evaluation is a ring map, and .
Novelty. Not found in the sources read in this form; routine. Bookkeeping that puts a coefficient vector on the box of the multiplicity estimate into the model.
import Definitions.Def_DiazHilbertBox
namespace DiazModulus
theorem torus_coeff_poly {K A₀ A₁ : Type*} [Field K] [Fintype A₀] [Fintype A₁]
[DecidableEq A₀] [DecidableEq A₁] (D₀ D₁ : ℕ) (c : (A₀ → Fin (D₀ + 1)) × (A₁ → Fin (2 * D₁ + 1)) → K) :
torusCoeffPoly D₀ D₁ c ∈ torusBox K A₀ A₁ (boxD A₀ A₁ D₀ D₁) ∧
(c ≠ 0 → torusCoeffPoly D₀ D₁ c ∉ torusIdeal K A₀ A₁) ∧
∀ (x : A₀ → K) (y : A₁ → Kˣ), MvPolynomial.eval (torusPoint x y) (torusCoeffPoly D₀ D₁ c)
= ∑ l, c l * ((∏ h, x h ^ (l.1 h : ℕ)) * ∏ i, (y i : K) ^ (((l.2 i : ℕ) : ℤ) - D₁)) := by
sorry
end DiazModulus