Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Modulo the torus ideal (YiZi−1)i(Y_i Z_i - 1)_i(Yi​Zi​−1)i​, every polynomial in a per-coordinate box is congruent to a combination of reduced monomials in the same box

Proved
DiazModulus.torus_reduce_mem_restrictSupport

by carlok · Oct 29, 2026 · Mathlib 0df444a (Lean v4.33.1)

commutative-algebradiaz-modulus-leanhilbert-functiontranscendence

Let KKK be a field and A0,A1A_0, A_1A0​,A1​ types, and let K[X,Y,Z]K[X, Y, Z]K[X,Y,Z] be the polynomial ring over KKK in the variables XhX_hXh​ (h∈A0h \in A_0h∈A0​) and Yi,ZiY_i, Z_iYi​,Zi​ (i∈A1i \in A_1i∈A1​). The per-coordinate box torusBox K A₀ A₁ T, for T∈NA0⊔A1T \in \mathbb{N}^{A_0 \sqcup A_1}T∈NA0​⊔A1​, is the span of the monomials XaYbZcX^a Y^b Z^cXaYbZc with ah≤Tha_h \le T_hah​≤Th​ for every hhh and bi+ci≤Tib_i + c_i \le T_ibi​+ci​≤Ti​ for every iii; J0=(YiZi−1)i∈A1J_0 = (Y_i Z_i - 1)_{i \in A_1}J0​=(Yi​Zi​−1)i∈A1​​ is the torus ideal torusIdeal K A₀ A₁, the kernel of K[X,Y,Z]→K[GaA0×GmA1]K[X, Y, Z] \to K[\mathbb{G}_a^{A_0} \times \mathbb{G}_m^{A_1}]K[X,Y,Z]→K[GaA0​​×GmA1​​]; a monomial XaYbZcX^a Y^b Z^cXaYbZc is reduced when min⁡(bi,ci)=0\min(b_i, c_i) = 0min(bi​,ci​)=0 for every iii (torusReduced). Then for every T∈NA0⊔A1T \in \mathbb{N}^{A_0 \sqcup A_1}T∈NA0​⊔A1​ and every fff in the box TTT there is a KKK-linear combination ggg of reduced monomials, also in the box TTT, with f−g∈J0f - g \in J_0f−g∈J0​. 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 XaYbZcX^a Y^b Z^cXaYbZc replaces each pair (bi,ci)(b_i, c_i)(bi​,ci​) by (max⁡(bi−ci,0),max⁡(ci−bi,0))(\max(b_i - c_i, 0), \max(c_i - b_i, 0))(max(bi​−ci​,0),max(ci​−bi​,0)); it is reduced, it is coordinatewise below the original exponent, so it stays in the box, and it does not change when bib_ibi​ and cic_ici​ both go up by one. By strong induction on the degree every monomial is congruent to its reduced form modulo J0J_0J0​, since Xm′YiZi−Xm′=Xm′(YiZi−1)X^{m'} Y_i Z_i - X^{m'} = X^{m'} (Y_i Z_i - 1)Xm′Yi​Zi​−Xm′=Xm′(Yi​Zi​−1). Take for ggg the image of fff under Xm↦Xred(m)X^m \mapsto X^{\mathrm{red}(m)}Xm↦Xred(m).

Novelty. Classical; routine formalisation.

Preamble
import Definitions.Def_DiazHilbertBox
Formal statement
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
Source
Classical (normal forms modulo YZ − 1). The ring K[X, Y, Z] and its ideal are those of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, §8.3.1 (Chapter 8 is by D. Roy), for K[G]. C1.1 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 29 October 2026 (C. Perassi).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me