Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Roy 1992, Th. 5 over ℚ: if U ⊆ ℂᵈ meets ℚᵈ only in 0, any ℓ ℚ-free points of U ∩ (ℚ + ℒ)ᵈ have ℓ ≤ Σ nᵢdᵢ/(dᵢ − nᵢ) for a rational S ⊇ U and a decomposition (dim U, dim S) = Σ (nᵢ, dᵢ)

Proved
DiazModulus.roy_rat_theorem_five

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

diaz-modulus-leannumber-theorytranscendence

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).

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.

Let U⊆CdU \subseteq \mathbb C^dU⊆Cd be a subspace that contains no non-zero rational vector, and let z1,…,zℓ∈U∩(Q+L)dz_1, \dots, z_\ell \in U \cap (\mathbb Q + \mathcal L)^dz1​,…,zℓ​∈U∩(Q+L)d be linearly independent over Q\mathbb QQ. Then there are a subspace S⊇US \supseteq US⊇U of Cd\mathbb C^dCd, rational over Q\mathbb QQ, and a decomposition (n1,d1),…,(nk,dk)(n_1, d_1), \dots, (n_k, d_k)(n1​,d1​),…,(nk​,dk​) of (dim⁡U,dim⁡S)(\dim U, \dim S)(dimU,dimS) with

ℓ≤∑i=1knididi−ni.\ell \le \sum_{i=1}^k \frac{n_i d_i}{d_i - n_i}.ℓ≤i=1∑k​di​−ni​ni​di​​.

So ℓ≤φ(dim⁡U,dim⁡S)\ell \le \varphi(\dim U, \dim S)ℓ≤φ(dimU,dimS), where Roy's φ(n,d)\varphi(n, d)φ(n,d) is the largest value of this sum over the decompositions of (n,d)(n, d)(n,d).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_rat_theorem_five {d ℓ : ℕ} (U : Submodule ℂ (Fin d → ℂ))
    (hUQ : ∀ v ∈ U, (∀ i, ∃ q : ℚ, v i = (q : ℂ)) → v = 0)
    (z : Fin ℓ → Fin d → ℂ) (hzU : ∀ i, z i ∈ U)
    (hz : ∀ i j, z i j ∈ Submodule.span ℚ (insert (1 : ℂ) LogAlg)) (hzind : LinearIndependent ℚ z) :
    ∃ (S : Submodule ℂ (Fin d → ℂ)) (D : List (ℕ × ℕ)),
      Submodule.span ℂ {v : Fin d → ℂ | v ∈ S ∧ ∀ i, ∃ q : ℚ, v i = (q : ℂ)} = S ∧ U ≤ S ∧
      (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) ∧
      (D.map Prod.fst).sum = Module.finrank ℂ ↥U ∧ (D.map Prod.snd).sum = Module.finrank ℂ ↥S ∧
      (ℓ : ℚ) ≤ (D.map fun p : ℕ × ℕ => ((p.1 : ℚ) * p.2) / ((p.2 : ℚ) - p.1)).sum := by
  sorry

end DiazModulus
Source
D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Th. 5 (p. 39) over F = ℚ, with ℚ + ℒ in place of ℒ̃: Roy's Remark (i) (p. 37) states his Th. 4 for any subfield F of Q̄, and Th. 5 follows from Th. 4 by his induction (pp. 39–40). Here in decomposition form, with a rational subspace S containing U in place of Roy's hypothesis that ℂᵈ is the least one; proved by an induction on d along a rational subspace of maximal slope, from DiazModulus.roy_rat_slope_bound, with the multiplicity estimate discharged by DiazModulus.multiplicityEstimateElem. 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