Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Roy 1992, Cor. 1: a d×ld \times ld×l matrix MMM with entries in ℒ̃ is equivalent over Q̄ to one whose top right d′×(l−l′)d' \times (l - l')d′×(l−l′) block is zero, with d l′≤rank⁡(M) (d′+l′)d\,l' \le \operatorname{rank}(M)\,(d' + l')dl′≤rank(M)(d′+l′)

Proved
DiazModulus.roy_rank_bound

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

Let MMM be a d×ld \times ld×l matrix with entries in L~\widetilde{\mathcal L}L, d≥1d \ge 1d≥1. Then there are integers 0<d′≤d0 < d' \le d0<d′≤d, 0≤l′≤l0 \le l' \le l0≤l′≤l and invertible matrices PPP, QQQ with algebraic entries such that the entries (PMQ)ij(PMQ)_{ij}(PMQ)ij​ with i≤d′i \le d'i≤d′, j>l′j > l'j>l′ vanish, and

d l′≤rank⁡(M) (d′+l′).d\,l' \le \operatorname{rank}(M)\,(d' + l').dl′≤rank(M)(d′+l′).

This is Roy's lower bound rank⁡(M)≥d θ(M)/(1+θ(M))\operatorname{rank}(M) \ge d\,\theta(M)/(1 + \theta(M))rank(M)≥dθ(M)/(1+θ(M)), where θ(M)\theta(M)θ(M) is the least l′/d′l'/d'l′/d′ over such block forms: the block form above gives θ(M)≤l′/d′\theta(M) \le l'/d'θ(M)≤l′/d′, and x↦x/(1+x)x \mapsto x/(1 + x)x↦x/(1+x) is increasing. It holds unconditionally: the multiplicity estimate is DiazModulus.multiplicityEstimateElem.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem roy_rank_bound {d l : ℕ} (M : Matrix (Fin d) (Fin l) ℂ) (hM : ∀ i j, M i j ∈ LogAlgTilde)
    (hd : 0 < d) :
    ∃ (d' l' : ℕ) (P : Matrix (Fin d) (Fin d) ℂ) (Q : Matrix (Fin l) (Fin l) ℂ),
      0 < d' ∧ d' ≤ d ∧ l' ≤ l ∧ IsUnit P.det ∧ IsUnit Q.det ∧
      (∀ i j, P i j ∈ Qbar) ∧ (∀ i j, Q i j ∈ Qbar) ∧
      (∀ (i : Fin d) (j : Fin l), i.val < d' → l' ≤ j.val → (P * M * Q) i j = 0) ∧
      d * l' ≤ M.rank * (d' + l') := by
  sorry

end DiazModulus
Source
D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, §4, Cor. 1 (p. 38), deduced from Th. 4; M. Waldschmidt, Diophantine Approximation on Linear Algebraic Groups, Grundlehren der mathematischen Wissenschaften 326, Springer, 2000, §12.3, Th. 12.20 and Cor. 12.21. Formal proof: Diaz modulus mission, 13 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