Translation by is an automorphism of that preserves every per-coordinate box and the torus ideal
ProvedDiazModulus.exists_translation_algEquivLet 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). Let and . Then there is a -algebra automorphism of with , and , which maps every per-coordinate box onto itself and maps onto itself (). 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. Define on the variables and its inverse by , , . Each sends a monomial into the span of the monomials with exponent ; every box is a lower set of exponents, so it is mapped into itself by both, hence onto itself. Finally .
Novelty. Classical; routine formalisation.
import Definitions.Def_DiazHilbertBox
namespace DiazModulus
theorem exists_translation_algEquiv {K A₀ A₁ : Type*} [Field K] (x : A₀ → K) (y : A₁ → Kˣ) :
∃ e : MvPolynomial (A₀ ⊕ (A₁ × Bool)) K ≃ₐ[K] MvPolynomial (A₀ ⊕ (A₁ × Bool)) K,
(∀ v, e (MvPolynomial.X v) = Sum.elim (fun h => MvPolynomial.X (Sum.inl h) + MvPolynomial.C (x h))
(fun p : A₁ × Bool => MvPolynomial.C (torusPoint x y (Sum.inr p)) * MvPolynomial.X (Sum.inr p)) v) ∧
(∀ T : A₀ ⊕ A₁ → ℕ, (torusBox K A₀ A₁ T).map e.toLinearMap = torusBox K A₀ A₁ T) ∧
(torusIdeal K A₀ A₁).map e = torusIdeal K A₀ A₁ := by
sorry
end DiazModulus