Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

DALAG Cor. 11.15 for (ℚ, ℚ + ℒ): if V ⊆ ℂᵈ meets ℚᵈ only in 0, then dim_ℚ(V ∩ (ℚ + ℒ)ᵈ) ≤ Ψ(dim V, dₘᵢₙ), with DALAG's table Ψ and dₘᵢₙ the least dimension of a rational S ⊇ V

Proved
DiazModulus.dalag_cor_11_15_rat

by carlok · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Here L\mathcal LL is the set of logarithms of algebraic numbers (z∈Cz \in \mathbb Cz∈C with eze^zez algebraic). Write Q+L\mathbb Q + \mathcal LQ+L for the Q\mathbb QQ-vector space spanned by 111 and L\mathcal LL; it consists of the numbers q+λq + \lambdaq+λ with q∈Qq \in \mathbb Qq∈Q and λ∈L\lambda \in \mathcal Lλ∈L. A vector of Cd\mathbb C^dCd is rational if its coordinates are rational numbers, and a subspace S⊆CdS \subseteq \mathbb C^dS⊆Cd is rational over Q\mathbb QQ if it is spanned by its rational vectors.

DALAG's function Ψ\PsiΨ is given by a table (DALAG, §11.5, p. 394). Here, for natural numbers a,ba, ba,b, Ψ(a,b)\Psi(a, b)Ψ(a,b) is defined by the following cases, taken in this order: Ψ(a,b)=0\Psi(a, b) = 0Ψ(a,b)=0 if a=0a = 0a=0; else Ψ(a,b)=1\Psi(a, b) = 1Ψ(a,b)=1 if a=1a = 1a=1 and b≥3b \ge 3b≥3; else a(a−1)+1a(a - 1) + 1a(a−1)+1 if a≥2a \ge 2a≥2 and a+3≤ba + 3 \le ba+3≤b; else a(a−1)+2a(a - 1) + 2a(a−1)+2 if a≥2a \ge 2a≥2 and a+2=ba + 2 = ba+2=b; else a(a+1)a(a + 1)a(a+1) if a+1=ba + 1 = ba+1=b; and 000 in every remaining case (these are a≥1a \ge 1a≥1 with b≤ab \le ab≤a, outside the table). For 0<a<b0 < a < b0<a<b the four middle cases are the four rows of the printed table, and Ψ(0,b)=0\Psi(0, b) = 0Ψ(0,b)=0 for every bbb.

Let V⊆CdV \subseteq \mathbb C^dV⊆Cd be a subspace that contains no non-zero rational vector, and let S0⊇VS_0 \supseteq VS0​⊇V be a subspace rational over Q\mathbb QQ of least dimension among the subspaces rational over Q\mathbb QQ that contain VVV; write dmin⁡=dim⁡S0d_{\min} = \dim S_0dmin​=dimS0​. Then: if dim⁡V>0\dim V > 0dimV>0, then dim⁡V<dmin⁡\dim V < d_{\min}dimV<dmin​; V∩(Q+L)dV \cap (\mathbb Q + \mathcal L)^dV∩(Q+L)d is a finite-dimensional Q\mathbb QQ-vector space; and

dim⁡Q(V∩(Q+L)d)≤Ψ(dim⁡V,dmin⁡).\dim_{\mathbb Q}\big(V \cap (\mathbb Q + \mathcal L)^d\big) \le \Psi(\dim V, d_{\min}).dimQ​(V∩(Q+L)d)≤Ψ(dimV,dmin​).

For dim⁡V=0\dim V = 0dimV=0 the bound is Ψ(0,dmin⁡)=0\Psi(0, d_{\min}) = 0Ψ(0,dmin​)=0.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem dalag_cor_11_15_rat {d : ℕ} (V S₀ : Submodule ℂ (Fin d → ℂ))
    (hVQ : ∀ v ∈ V, (∀ i, ∃ q : ℚ, v i = (q : ℂ)) → v = 0)
    (hS₀ : Submodule.span ℂ {v : Fin d → ℂ | v ∈ S₀ ∧ ∀ i, ∃ q : ℚ, v i = (q : ℂ)} = S₀)
    (hVS₀ : V ≤ S₀)
    (hmin : ∀ T : Submodule ℂ (Fin d → ℂ),
      Submodule.span ℂ {v : Fin d → ℂ | v ∈ T ∧ ∀ i, ∃ q : ℚ, v i = (q : ℂ)} = T → V ≤ T →
        Module.finrank ℂ ↥S₀ ≤ Module.finrank ℂ ↥T) :
    let Ψ : ℕ → ℕ → ℕ := fun a b =>
      if a = 0 then 0
      else if a = 1 ∧ 3 ≤ b then 1
      else if 2 ≤ a ∧ a + 3 ≤ b then a * (a - 1) + 1
      else if 2 ≤ a ∧ a + 2 = b then a * (a - 1) + 2
      else if a + 1 = b then a * (a + 1)
      else 0
    (0 < Module.finrank ℂ ↥V → Module.finrank ℂ ↥V < Module.finrank ℂ ↥S₀) ∧
    FiniteDimensional ℚ ↥(V.restrictScalars ℚ ⊓
        Submodule.pi Set.univ (fun _ : Fin d => Submodule.span ℚ (insert (1 : ℂ) LogAlg))) ∧
    Module.finrank ℚ ↥(V.restrictScalars ℚ ⊓
        Submodule.pi Set.univ (fun _ : Fin d => Submodule.span ℚ (insert (1 : ℂ) LogAlg))) ≤
      Ψ (Module.finrank ℂ ↥V) (Module.finrank ℂ ↥S₀) := by
  sorry

end DiazModulus
Source
M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, Cor. 11.15 (p. 398), for (K, L) = (ℚ, ℚ + ℒ), with DALAG's bound Ψ(dim V, d_min), and Ψ(0, b) = 0 for every b as in DiazModulus.dalag_cor_11_15_psi. The proof follows Roy's route over ℚ: D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Th. 5 (p. 39) with his Remark (i) (p. 37), here DiazModulus.roy_rat_theorem_five, and Roy's Lemma (p. 40) through DiazModulus.dalag_psi_floor_roy_phi. DALAG proves the corollary (p. 403) from Prop. 11.19 (p. 402), whose printed proof has a gap in this case (Th. 11.5 (3′) need not select the trivial subgroup); Prop. 11.19 is not used here. Formal proof: Diaz modulus mission, 14 November 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