Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Translation by (x,y)∈KA0×(K×)A1(x, y) \in K^{A_0} \times (K^\times)^{A_1}(x,y)∈KA0​×(K×)A1​ is an automorphism of K[X,Y,Z]K[X, Y, Z]K[X,Y,Z] that preserves every per-coordinate box and the torus ideal

Proved
DiazModulus.exists_translation_algEquiv

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). Let x∈KA0x \in K^{A_0}x∈KA0​ and y∈(K×)A1y \in (K^\times)^{A_1}y∈(K×)A1​. Then there is a KKK-algebra automorphism eee of K[X,Y,Z]K[X, Y, Z]K[X,Y,Z] with e(Xh)=Xh+xhe(X_h) = X_h + x_he(Xh​)=Xh​+xh​, e(Yi)=yiYie(Y_i) = y_i Y_ie(Yi​)=yi​Yi​ and e(Zi)=yi−1Zie(Z_i) = y_i^{-1} Z_ie(Zi​)=yi−1​Zi​, which maps every per-coordinate box onto itself and maps J0J_0J0​ onto itself (e(J0)=J0e(J_0) = J_0e(J0​)=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. Define eee on the variables and its inverse by Xh↦Xh−xhX_h \mapsto X_h - x_hXh​↦Xh​−xh​, Yi↦yi−1YiY_i \mapsto y_i^{-1} Y_iYi​↦yi−1​Yi​, Zi↦yiZiZ_i \mapsto y_i Z_iZi​↦yi​Zi​. Each sends a monomial XmX^mXm into the span of the monomials with exponent ≤m\le m≤m; every box is a lower set of exponents, so it is mapped into itself by both, hence onto itself. Finally e(YiZi−1)=yiyi−1YiZi−1=YiZi−1e(Y_i Z_i - 1) = y_i y_i^{-1} Y_i Z_i - 1 = Y_i Z_i - 1e(Yi​Zi​−1)=yi​yi−1​Yi​Zi​−1=Yi​Zi​−1.

Novelty. Classical; routine formalisation.

Preamble
import Definitions.Def_DiazHilbertBox
Formal statement
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
Source
Classical. Translations of M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, §5.3.2 (Chapter 5 is by D. Roy), written on K[X, Y, Z] as in §8.3.1 (Chapter 8 is by D. Roy). 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