Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The premise of the multiplicity estimate: Dw1⋯DwtPcD_{w_1} \cdots D_{w_t} P_cDw1​​⋯Dwt​​Pc​ vanishes at gsg_sgs​ for all wi∈Ww_i \in Wwi​∈W, t≤dM0t \le d M_0t≤dM0​ and ∣sj∣≤dM1|s_j| \le d M_1∣sj​∣≤dM1​

Proved
DiazModulus.eval_torusDerivList_eq_zero

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

commutative-algebradiaz-modulus-leanmultiplicity-estimatetranscendence

Let A0,A1A_0, A_1A0​,A1​ be finite types and R=C[X,Y,Z]R = \mathbb{C}[X, Y, Z]R=C[X,Y,Z] the polynomial ring MvPolynomial (A₀ ⊕ (A₁ × Bool)) ℂ in the variables XhX_hXh​ (h∈A0h \in A_0h∈A0​), YiY_iYi​ and ZiZ_iZi​ (i∈A1i \in A_1i∈A1​), and J0=(YiZi−1)i∈A1J_0 = (Y_iZ_i - 1)_{i \in A_1}J0​=(Yi​Zi​−1)i∈A1​​ its torus ideal (torusIdeal). Write G=GaA0×GmA1G = \mathbb{G}_a^{A_0} \times \mathbb{G}_m^{A_1}G=GaA0​​×GmA1​​ (TorusGroup: pairs g=(x,y)g = (x, y)g=(x,y), xxx in the additive group CA0\mathbb{C}^{A_0}CA0​, y∈(C×)A1y \in (\mathbb{C}^\times)^{A_1}y∈(C×)A1​, written multiplicatively), and say that a polynomial vanishes at ggg when it vanishes at the point (x,y,y−1)(x, y, y^{-1})(x,y,y−1) (torusPt g). For w=(ξ,η)∈CA0×CA1w = (\xi, \eta) \in \mathbb{C}^{A_0} \times \mathbb{C}^{A_1}w=(ξ,η)∈CA0​×CA1​, DwD_wDw​ (torusDeriv w) is the invariant derivation ∑hξh ∂/∂Xh+∑iηi(Yi ∂/∂Yi−Zi ∂/∂Zi)\sum_h \xi_h\,\partial/\partial X_h + \sum_i \eta_i (Y_i\,\partial/\partial Y_i - Z_i\,\partial/\partial Z_i)∑h​ξh​∂/∂Xh​+∑i​ηi​(Yi​∂/∂Yi​−Zi​∂/∂Zi​) of RRR (DALAG Lemma 8.11), and Dl=Dw1∘⋯∘DwtD_l = D_{w_1} \circ \cdots \circ D_{w_t}Dl​=Dw1​​∘⋯∘Dwt​​ (torusDerivList l) for a list l=[w1,…,wt]l = [w_1, \dots, w_t]l=[w1​,…,wt​]. For uj∈CA0u_j \in \mathbb{C}^{A_0}uj​∈CA0​, aji∈C×a_{ji} \in \mathbb{C}^\timesaji​∈C× (j∈B1j \in B_1j∈B1​, i∈A1i \in A_1i∈A1​, B1B_1B1​ finite) and s∈ZB1s \in \mathbb{Z}^{B_1}s∈ZB1​, gs=(∑jsjuj,(∏jajisj)i)∈Gg_s = (\sum_j s_j u_j, (\prod_j a_{ji}^{s_j})_i) \in Ggs​=(∑j​sj​uj​,(∏j​ajisj​​)i​)∈G (hmePoint u a s). Let B0B_0B0​ be a type, wb∈CA0×CA1w_b \in \mathbb{C}^{A_0} \times \mathbb{C}^{A_1}wb​∈CA0​×CA1​ (b∈B0b \in B_0b∈B0​) with span WWW, D0,D1,M0,M1∈ND_0, D_1, M_0, M_1 \in \mathbb{N}D0​,D1​,M0​,M1​∈N, d=∣A0∣+∣A1∣d = |A_0| + |A_1|d=∣A0​∣+∣A1​∣, coefficients ccc and PcP_cPc​ as in torusCoeffPoly, and assume the premise of the Definition MultiplicityEstimateElem for the complex numbers ajia_{ji}aji​: for every r≤dM0r \le dM_0r≤dM0​, every k1,…,kr∈B0k_1, \dots, k_r \in B_0k1​,…,kr​∈B0​ and every s∈ZB1s \in \mathbb{Z}^{B_1}s∈ZB1​ with ∣sj∣≤dM1|s_j| \le dM_1∣sj​∣≤dM1​, ∑λcλ(Opwk1λ⋯OpwkrλXτ)(∑jsjuj)∏i(∏jajisj)ti−D1=0\sum_\lambda c_\lambda (\mathrm{Op}^\lambda_{w_{k_1}} \cdots \mathrm{Op}^\lambda_{w_{k_r}} X^\tau)(\sum_j s_j u_j) \prod_i (\prod_j a_{ji}^{s_j})^{t_i - D_1} = 0∑λ​cλ​(Opwk1​​λ​⋯Opwkr​​λ​Xτ)(∑j​sj​uj​)∏i​(∏j​ajisj​​)ti​−D1​=0, with Opwλ\mathrm{Op}^\lambda_wOpwλ​ as in DiazModulus.eval_torusDerivList_torusCoeffPoly. Then DlPcD_l P_cDl​Pc​ vanishes at gsg_sgs​ for every list lll of elements of WWW of length at most dM0dM_0dM0​ and every sss with ∣sj∣≤dM1|s_j| \le dM_1∣sj​∣≤dM1​. The names TorusGroup, torusPt, torusDeriv, torusDerivList, torusTransl, torusVanishing, torusZero, torusStab, standardSet, sectionIdeal, vanishOrd, hmePoint and obstructionSpan come from the Definition DiazMultiplicity (module Definitions.Def_DiazMultiplicity), which builds on the published Definition DiazHilbertBox (torusIdeal, torusBox, boxHilb, boxD, torusCoeffPoly, torusReduced, torusPoint).

Proof. By DiazModulus.eval_torusDerivList_torusCoeffPoly the premise says that evaluation at gsg_sgs​ kills Dwk1⋯DwknPcD_{w_{k_1}} \cdots D_{w_{k_n}} P_cDwk1​​​⋯Dwkn​​​Pc​ for n≤dM0n \le dM_0n≤dM0​, hence the span VnV_nVn​ of these. Since w↦Dww \mapsto D_ww↦Dw​ is linear, DwVn⊆Vn+1D_w V_n \subseteq V_{n+1}Dw​Vn​⊆Vn+1​ for w∈Ww \in Ww∈W, so DlPc∈V∣l∣D_l P_c \in V_{|l|}Dl​Pc​∈V∣l∣​.

Novelty. None claimed: the premise of Theorem 8.1, read on the invariant derivations of DALAG, Chapter 8 (by D. Roy), written at finite level and in coordinates; routine formalisation.

Preamble
import Definitions.Def_DiazMultiplicity
Formal statement
namespace DiazModulus

theorem eval_torusDerivList_eq_zero {A₀ A₁ B₀ B₁ : Type*} [Fintype A₀] [Fintype A₁] [Fintype B₁]
    [DecidableEq A₀] [DecidableEq A₁]
    (wₑ : B₀ → (A₀ → ℂ) × (A₁ → ℂ)) (uₑ : B₁ → A₀ → ℂ) (aₑ : B₁ → A₁ → ℂ) (D₀ D₁ M₀ M₁ : ℕ)
    (cₑ : (A₀ → Fin (D₀ + 1)) × (A₁ → Fin (2 * D₁ + 1)) → ℂ)
    (a : B₁ → A₁ → ℂˣ) (ha : ∀ j i, (a j i : ℂ) = aₑ j i)
    (hprem : (∀ (rₑ : ℕ) (kₑ : Fin rₑ → B₀) (sₑ : B₁ → ℤ), rₑ ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ j, |sₑ j| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
        ∑ l, cₑ l * (MvPolynomial.eval (∑ j, ((sₑ j : ℤ) : ℂ) • uₑ j)
          ((List.ofFn fun k : Fin rₑ =>
            ((∑ h, (wₑ (kₑ k)).1 h • (MvPolynomial.pderiv h).toLinearMap
              + (∑ i, (wₑ (kₑ k)).2 i * (((l.2 i : ℕ) : ℂ) - D₁)) • LinearMap.id :
                Module.End ℂ (MvPolynomial A₀ ℂ)))).prod
            (∏ h, MvPolynomial.X h ^ (l.1 h : ℕ)))
        * ∏ i, (∏ j, aₑ j i ^ sₑ j) ^ (((l.2 i : ℕ) : ℤ) - D₁)) = 0)) :
    ∀ l : List ((A₀ → ℂ) × (A₁ → ℂ)), l.length ≤ (Fintype.card A₀ + Fintype.card A₁) * M₀ → (∀ w ∈ l, w ∈ Submodule.span ℂ (Set.range wₑ)) →
      ∀ s : B₁ → ℤ, (∀ b, |s b| ≤ (((Fintype.card A₀ + Fintype.card A₁) * M₁ : ℕ) : ℤ)) →
        MvPolynomial.eval (torusPt (hmePoint uₑ a s)) (torusDerivList l (torusCoeffPoly D₀ D₁ cₑ)) = 0 := by
  sorry

end DiazModulus
Source
M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Chapter 8 (by D. Roy), Th. 8.1 (§8.1): the vanishing hypothesis, for G=Gad0×Gmd1G = \mathbb{G}_a^{d_0} \times \mathbb{G}_m^{d_1}G=Gad0​​×Gmd1​​. Uses `DiazModulus.eval_torusDerivList_torusCoeffPoly`. C1.3 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 30 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