Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Roy 1992, Th. 4 over ℚ, minimal-ratio form: for ℚ-free z in U ∩ (ℚ + ℒ)ᵈ and S ≠ ℂᵈ rational over ℚ of minimal ratio n′/d′, then ℓ′/(d′ + ℓ′) ≤ n′/d′ ≤ n/d

Proved
DiazModulus.roy_rat_theorem_four

by carlok · Nov 15, 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.

For subspaces U,S⊆CdU, S \subseteq \mathbb C^dU,S⊆Cd with S≠CdS \ne \mathbb C^dS=Cd write n′(S)=dim⁡U−dim⁡(U∩S)n'(S) = \dim U - \dim(U \cap S)n′(S)=dimU−dim(U∩S) and d′(S)=d−dim⁡Sd'(S) = d - \dim Sd′(S)=d−dimS. A subspace S≠CdS \ne \mathbb C^dS=Cd rational over Q\mathbb QQ has minimal ratio if n′(S) d′(S′)≤n′(S′) d′(S)n'(S)\,d'(S') \le n'(S')\,d'(S)n′(S)d′(S′)≤n′(S′)d′(S) for every subspace S′≠CdS' \ne \mathbb C^dS′=Cd rational over Q\mathbb QQ, that is, if it minimises n′/d′n'/d'n′/d′ among them.

Let U⊆CdU \subseteq \mathbb C^dU⊆Cd be a subspace with n=dim⁡Un = \dim Un=dimU, 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, and let S≠CdS \ne \mathbb C^dS=Cd be rational over Q\mathbb QQ of minimal ratio. Put n′=n′(S)n' = n'(S)n′=n′(S), d′=d′(S)d' = d'(S)d′=d′(S) and ℓ′=ℓ−dim⁡Q(spanQ(z)∩S)\ell' = \ell - \dim_{\mathbb Q}\big(\mathrm{span}_{\mathbb Q}(z) \cap S\big)ℓ′=ℓ−dimQ​(spanQ​(z)∩S). Then

ℓ′ d′≤n′ (d′+ℓ′)andn′ d≤n d′,\ell'\,d' \le n'\,(d' + \ell') \qquad\text{and}\qquad n'\,d \le n\,d',ℓ′d′≤n′(d′+ℓ′)andn′d≤nd′,

that is, ℓ′/(d′+ℓ′)≤n′/d′≤n/d\ell'/(d' + \ell') \le n'/d' \le n/dℓ′/(d′+ℓ′)≤n′/d′≤n/d. The statement has no hypothesis: the multiplicity estimate it rests on is proved.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_rat_theorem_four {d ℓ : ℕ} (U : Submodule ℂ (Fin d → ℂ))
    (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 → ℂ))
    (hSrat : Submodule.span ℂ {v : Fin d → ℂ | v ∈ S ∧ ∀ i, ∃ q : ℚ, v i = (q : ℂ)} = S) (hStop : S ≠ ⊤)
    (hmin : ∀ S' : Submodule ℂ (Fin d → ℂ),
      Submodule.span ℂ {v : Fin d → ℂ | v ∈ S' ∧ ∀ i, ∃ q : ℚ, v i = (q : ℂ)} = S' → S' ≠ ⊤ →
      (Module.finrank ℂ ↥U - Module.finrank ℂ ↥(U ⊓ S)) * (d - Module.finrank ℂ ↥S') ≤
        (Module.finrank ℂ ↥U - Module.finrank ℂ ↥(U ⊓ S')) * (d - Module.finrank ℂ ↥S)) :
    (ℓ - Module.finrank ℚ ↥(Submodule.span ℚ (Set.range z) ⊓ S.restrictScalars ℚ)) *
        (d - Module.finrank ℂ ↥S) ≤
      (Module.finrank ℂ ↥U - Module.finrank ℂ ↥(U ⊓ S)) *
        ((d - Module.finrank ℂ ↥S) +
          (ℓ - Module.finrank ℚ ↥(Submodule.span ℚ (Set.range z) ⊓ S.restrictScalars ℚ))) ∧
    (Module.finrank ℂ ↥U - Module.finrank ℂ ↥(U ⊓ S)) * d ≤
      Module.finrank ℂ ↥U * (d - Module.finrank ℂ ↥S) := by
  sorry

end DiazModulus
Source
D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Th. 4 (p. 34) over F = ℚ (Remark (i), p. 37, with ℚ + ℒ in place of ℒ̃), in its minimal-ratio form; the analogue over ℚ of DiazModulus.roy_theorem_four, proved from DiazModulus.roy_rat_slope_bound and DiazModulus.roy_rat_adapted_basis, 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