Roy 1992, Cor. 1: a matrix with entries in ℒ̃ is equivalent over Q̄ to one whose top right block is zero, with
ProvedDiazModulus.roy_rank_bounddiaz-modulus-leannumber-theorytranscendence
Here is the field of algebraic numbers, the set of logarithms of algebraic numbers ( with algebraic), and the -vector space spanned by and . A subspace is rational if it is spanned by vectors with algebraic coordinates.
Let be a matrix with entries in , . Then there are integers , and invertible matrices , with algebraic entries such that the entries with , vanish, and
This is Roy's lower bound , where is the least over such block forms: the block form above gives , and 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).