Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

DALAG Cor. 11.15 for (Q̄, ℒ̃), decomposition form: if V ∩ Q̄ᵈ = 0, then dim_Q̄(V ∩ ℒ̃ᵈ) ≤ Σ nᵢdᵢ/(dᵢ − nᵢ) with (dim V, dₘᵢₙ) = Σ (nᵢ, dᵢ), dₘᵢₙ the least dimension of a rational S ⊇ V

Proved
DiazModulus.roy_theorem_five_dmin

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

diaz-modulus-leannumber-theorytranscendence

Here Q‾\overline{\mathbb Q}Q​ is the field of algebraic numbers, L\mathcal LL the set of logarithms of algebraic numbers (z∈Cz \in \mathbb Cz∈C with eze^zez algebraic), and L~\widetilde{\mathcal L}L the Q‾\overline{\mathbb Q}Q​-vector space spanned by 111 and L\mathcal LL. A subspace S⊆CdS \subseteq \mathbb C^dS⊆Cd is rational if it is spanned by vectors with algebraic coordinates.

A decomposition of a pair (n,d)(n, d)(n,d) of natural numbers is a finite list (n1,d1),…,(nk,dk)(n_1, d_1), \dots, (n_k, d_k)(n1​,d1​),…,(nk​,dk​) of pairs of natural numbers with 0<ni<di0 < n_i < d_i0<ni​<di​ for every iii, ∑ini=n\sum_i n_i = n∑i​ni​=n and ∑idi=d\sum_i d_i = d∑i​di​=d (the empty list, k=0k = 0k=0, decomposes (0,0)(0, 0)(0,0) only).

Let V⊆CdV \subseteq \mathbb C^dV⊆Cd be a subspace that contains no non-zero vector with algebraic coordinates, and let S0⊇VS_0 \supseteq VS0​⊇V be a rational subspace of least dimension among the rational subspaces containing VVV; write dmin⁡=dim⁡S0d_{\min} = \dim S_0dmin​=dimS0​. Then V∩L~dV \cap \widetilde{\mathcal L}^dV∩Ld is a finite-dimensional Q‾\overline{\mathbb Q}Q​-vector space, and there is a decomposition (n1,d1),…,(nk,dk)(n_1, d_1), \dots, (n_k, d_k)(n1​,d1​),…,(nk​,dk​) of (dim⁡V,dmin⁡)(\dim V, d_{\min})(dimV,dmin​) with

dim⁡Q‾(V∩L~d)≤∑i=1knididi−ni.\dim_{\overline{\mathbb Q}}\big(V \cap \widetilde{\mathcal L}^d\big) \le \sum_{i=1}^k \frac{n_i d_i}{d_i - n_i}.dimQ​​(V∩Ld)≤i=1∑k​di​−ni​ni​di​​.

DALAG states the bound as Ψ(dim⁡V,dmin⁡)\Psi(\dim V, d_{\min})Ψ(dimV,dmin​); passing from the decomposition form to Ψ\PsiΨ uses Roy's closed form of φ\varphiφ (Roy 1992, p. 40) and is not part of this statement. For dmin⁡=dd_{\min} = ddmin​=d this is Roy's Theorem 5.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_theorem_five_dmin {d : ℕ} (V S₀ : Submodule ℂ (Fin d → ℂ))
    (hVQ : ∀ v ∈ V, (∀ i, v i ∈ Qbar) → v = 0)
    (hS₀ : Submodule.span ℂ {v : Fin d → ℂ | v ∈ S₀ ∧ ∀ i, v i ∈ Qbar} = S₀) (hVS₀ : V ≤ S₀)
    (hmin : ∀ T : Submodule ℂ (Fin d → ℂ),
      Submodule.span ℂ {v : Fin d → ℂ | v ∈ T ∧ ∀ i, v i ∈ Qbar} = T → V ≤ T →
        Module.finrank ℂ ↥S₀ ≤ Module.finrank ℂ ↥T) :
    FiniteDimensional (↥Qbar)
        ↥(V.restrictScalars (↥Qbar) ⊓ Submodule.pi Set.univ (fun _ : Fin d => LogAlgTilde)) ∧
    ∃ D : List (ℕ × ℕ), (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) ∧
      (D.map Prod.fst).sum = Module.finrank ℂ ↥V ∧ (D.map Prod.snd).sum = Module.finrank ℂ ↥S₀ ∧
      (Module.finrank (↥Qbar)
          ↥(V.restrictScalars (↥Qbar) ⊓ Submodule.pi Set.univ (fun _ : Fin d => LogAlgTilde)) : ℚ) ≤
        (D.map fun p : ℕ × ℕ => ((p.1 : ℚ) * p.2) / ((p.2 : ℚ) - p.1)).sum := 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, ℒ) = (Q̄, ℒ̃), in the decomposition form; the case d_min = d is D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Th. 5 (p. 39). The proof follows Roy 1992, Th. 5, not DALAG's argument for Cor. 11.15. 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