Roy 1992, Lemma p. 40: for 0 < n < d, the maximum of Σ nᵢdᵢ/(dᵢ − nᵢ) over (n, d) = Σ (nᵢ, dᵢ) with 0 < nᵢ < dᵢ is nd/(d − n) if n = 1 or d − n = 1, else (d − n)/(d − n − 1) + (n − 1)n
ProvedDiazModulus.roy_lemma_phidiaz-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). The value of a decomposition is the rational number .
Let , and let if or , and otherwise. Then is the greatest value of a decomposition of : some decomposition of has value , and every decomposition of has value at most .
Roy's is this greatest value (Roy 1992, pp. 38–39). Roy's Lemma gives it as when and ; by the case or , and , so the two forms agree.
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
theorem roy_lemma_phi {n d : ℕ} (hn : 0 < n) (hnd : n < d) :
IsGreatest
{x : ℚ | ∃ D : List (ℕ × ℕ), (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) ∧
(D.map Prod.fst).sum = n ∧ (D.map Prod.snd).sum = d ∧
x = (D.map fun p : ℕ × ℕ => ((p.1 : ℚ) * p.2) / ((p.2 : ℚ) - p.1)).sum}
(if n = 1 ∨ d - n = 1 then ((n : ℚ) * d) / ((d : ℚ) - n)
else ((d : ℚ) - n) / ((d : ℚ) - n - 1) + ((n : ℚ) - 1) * n) := by
sorry
end DiazModulus
Source
D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Lemma (p. 40; proof pp. 40–41), with the second value in closed form: Roy writes it φ(1, d − n) + φ(n − 1, n), which is (d − n)/(d − n − 1) + (n − 1)n. Roy's printed proof of his Lemma (p. 41) concludes 'k = 2' without excluding several parts (1, 1). For example, the decomposition [(1, 2), (1, 1), (1, 1)] of (n, δ) = (3, 4), in Roy's pairs (nᵢ, δᵢ) with δᵢ = dᵢ − nᵢ, meets the conditions he states, with k = 3, and one more exchange repairs it: (a, 1), (1, b), (1, 1) → (a + 1, 1), (1, b + 1), for a, b ≥ 1, raises Σ nᵢ²/δᵢ. The Lean proof uses a different route: superadditivity of the closed form (DiazModulus.roy_phi_closed_form_superadd). Formal proof: Diaz modulus mission, 14 November 2026 (C. Perassi).