Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Roy 1992, Th. 5: if U ⊆ ℂᵈ meets Q̄ᵈ only in 0 and has rational hull ℂᵈ, any ℓ Q̄-free points of U ∩ ℒ̃ᵈ satisfy ℓ ≤ Σ nᵢdᵢ/(dᵢ − nᵢ) for a decomposition (dim U, d) = Σ (nᵢ, dᵢ)

Proved
DiazModulus.roy_theorem_five

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 U⊆CdU \subseteq \mathbb C^dU⊆Cd be a subspace that contains no non-zero vector with algebraic coordinates, such that Cd\mathbb C^dCd is the only rational subspace of Cd\mathbb C^dCd containing UUU, and let z1,…,zℓ∈U∩L~dz_1, \dots, z_\ell \in U \cap \widetilde{\mathcal L}^dz1​,…,zℓ​∈U∩Ld be linearly independent over Q‾\overline{\mathbb Q}Q​. Then 0<dim⁡U<d0 < \dim U < d0<dimU<d if d≥1d \ge 1d≥1, and there is a decomposition (n1,d1),…,(nk,dk)(n_1, d_1), \dots, (n_k, d_k)(n1​,d1​),…,(nk​,dk​) of (dim⁡U,d)(\dim U, d)(dimU,d) 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​​.

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), so ℓ≤φ(dim⁡U,d)\ell \le \varphi(\dim U, d)ℓ≤φ(dimU,d) for every such family. The bound for dim⁡Q‾(U∩L~d)\dim_{\overline{\mathbb Q}}(U \cap \widetilde{\mathcal L}^d)dimQ​​(U∩Ld) itself, with its finiteness, is the case Cd\mathbb C^dCd of DiazModulus.roy_theorem_five_dmin.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_theorem_five {d ℓ : ℕ} (U : Submodule ℂ (Fin d → ℂ))
    (hUQ : ∀ v ∈ U, (∀ i, v i ∈ Qbar) → v = 0)
    (hhull : ∀ T : Submodule ℂ (Fin d → ℂ),
      Submodule.span ℂ {v : Fin d → ℂ | v ∈ T ∧ ∀ i, v i ∈ Qbar} = T → U ≤ T → T = ⊤)
    (z : Fin ℓ → Fin d → ℂ) (hzU : ∀ i, z i ∈ U) (hz : ∀ i j, z i j ∈ LogAlgTilde)
    (hzind : LinearIndependent (↥Qbar) z) :
    (0 < d → 0 < Module.finrank ℂ ↥U ∧ Module.finrank ℂ ↥U < d) ∧
    ∃ D : List (ℕ × ℕ), (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) ∧
      (D.map Prod.fst).sum = Module.finrank ℂ ↥U ∧ (D.map Prod.snd).sum = d ∧
      (ℓ : ℚ) ≤ (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), with one decomposition in place of Roy's φ(n, d), the largest value over all decompositions (pp. 38–39); the proof is Roy's induction on d (pp. 39–40). 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