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ᵢ)
ProvedDiazModulus.roy_rat_theorem_fivediaz-modulus-leannumber-theorytranscendence
A decomposition of a pair of natural numbers is a finite list of pairs of natural numbers with for every , and (the empty list, , decomposes only).
Here is the set of logarithms of algebraic numbers ( with algebraic). Write for the -vector space spanned by and ; it consists of the numbers with and . A vector of is rational if its coordinates are rational numbers, and a subspace is rational over if it is spanned by its rational vectors.
Let be a subspace that contains no non-zero rational vector, and let be linearly independent over . Then there are a subspace of , rational over , and a decomposition of with
So , where Roy's is the largest value of this sum over the decompositions of .
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).