Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Hilbert function of the torus ideal on per-coordinate boxes: hJ0(T)=∏h(Th+1)⋅∏i(2Ti+1)h_{J_0}(T) = \prod_h (T_h + 1) \cdot \prod_i (2T_i + 1)hJ0​​(T)=∏h​(Th​+1)⋅∏i​(2Ti​+1)

Proved
DiazModulus.boxHilb_torusIdeal

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). Assume that A0A_0A0​ and A1A_1A1​ are finite. Then for every T∈NA0⊔A1T \in \mathbb{N}^{A_0 \sqcup A_1}T∈NA0​⊔A1​, hJ0(T)=∏h∈A0(Th+1)⋅∏i∈A1(2Ti+1)h_{J_0}(T) = \prod_{h \in A_0} (T_h + 1) \cdot \prod_{i \in A_1} (2T_i + 1)hJ0​​(T)=∏h∈A0​​(Th​+1)⋅∏i∈A1​​(2Ti​+1), where hJ0(T)h_{J_0}(T)hJ0​​(T) is boxHilb (torusBox K A₀ A₁) (torusIdeal K A₀ A₁) T, the dimension of the image of the box TTT in K[X,Y,Z]/J0K[X, Y, Z]/J_0K[X,Y,Z]/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. Let B\mathcal{B}B be the box (finite-dimensional by DiazModulus.restrictSupport_block_filtration) and RRR the span of the reduced monomials. By DiazModulus.torus_reduce_mem_restrictSupport, B=(B∩R)+(B∩J0)\mathcal{B} = (\mathcal{B} \cap R) + (\mathcal{B} \cap J_0)B=(B∩R)+(B∩J0​), and by DiazModulus.torus_reduced_inf_eq_bot the two pieces meet in 000; with DiazModulus.boxHilb_add_finrank_inf, hJ0(T)=dim⁡(B∩R)h_{J_0}(T) = \dim (\mathcal{B} \cap R)hJ0​​(T)=dim(B∩R), the number of reduced exponents in the box. These are XaYbZcX^a Y^b Z^cXaYbZc with ah≤Tha_h \le T_hah​≤Th​, bi+ci≤Tib_i + c_i \le T_ibi​+ci​≤Ti​ and min⁡(bi,ci)=0\min(b_i, c_i) = 0min(bi​,ci​)=0, and (bi,ci)↦Ti+bi−ci(b_i, c_i) \mapsto T_i + b_i - c_i(bi​,ci​)↦Ti​+bi​−ci​ is a bijection onto {0,…,2Ti}\{0, \dots, 2T_i\}{0,…,2Ti​}.

Novelty. Not found in the sources read in this form; routine. DALAG Prop. 5.7 gives the Hilbert function of G=Gad0×Gmd1G = \mathbb{G}_a^{d_0} \times \mathbb{G}_m^{d_1}G=Gad0​​×Gmd1​​ for the total degree in the XXX variables; here the box is per coordinate.

Preamble
import Definitions.Def_DiazHilbertBox
Formal statement
namespace DiazModulus

theorem boxHilb_torusIdeal {K A₀ A₁ : Type*} [Field K] [Fintype A₀] [Fintype A₁] (T : A₀ ⊕ A₁ → ℕ) :
    boxHilb (torusBox K A₀ A₁) (torusIdeal K A₀ A₁) T
      = (∏ h, (T (Sum.inl h) + 1)) * ∏ i, (2 * T (Sum.inr i) + 1) := by
  sorry

end DiazModulus
Source
Compare M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Prop. 5.7 (§5.3.1, p. 159; Chapter 5 is by D. Roy), the case G* = G, there with the total degree in the additive variables; the passage to K[X, Y, Z] is that of §8.3.1 (Chapter 8 is by D. Roy). Not found in the sources read in this form; routine. Uses DiazModulus.restrictSupport_block_filtration, DiazModulus.torus_reduce_mem_restrictSupport, DiazModulus.torus_reduced_inf_eq_bot and DiazModulus.boxHilb_add_finrank_inf. 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