DALAG's Ψ is the integer part of Roy's maximum: for 0 < n < d, every decomposition (n, d) = Σ (nᵢ, dᵢ) has Σ nᵢdᵢ/(dᵢ − nᵢ) < Ψ(n, d) + 1, and some decomposition has it ≥ Ψ(n, d)
ProvedDiazModulus.dalag_psi_floor_roy_phiA 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 .
DALAG's function is given by a table (DALAG, §11.5, p. 394). Here, for natural numbers , is defined by the following cases, taken in this order: if ; else if and ; else if and ; else if and ; else if ; and in every remaining case (these are with , outside the table). For the four middle cases are the four rows of the printed table, and for every .
Let . Then every decomposition of has value , and some decomposition of has value . So is the integer part of Roy's , the greatest value of a decomposition of (Roy 1992, pp. 38–40).
import Definitions.Def_DiazModulus
open Complex ComplexConjugate
namespace DiazModulus
theorem dalag_psi_floor_roy_phi {n d : ℕ} (hn : 0 < n) (hnd : n < d) :
let Ψ : ℕ → ℕ → ℕ := fun a b =>
if a = 0 then 0
else if a = 1 ∧ 3 ≤ b then 1
else if 2 ≤ a ∧ a + 3 ≤ b then a * (a - 1) + 1
else if 2 ≤ a ∧ a + 2 = b then a * (a - 1) + 2
else if a + 1 = b then a * (a + 1)
else 0
(∀ D : List (ℕ × ℕ), (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) → (D.map Prod.fst).sum = n →
(D.map Prod.snd).sum = d →
(D.map fun p : ℕ × ℕ => ((p.1 : ℚ) * p.2) / ((p.2 : ℚ) - p.1)).sum < (Ψ n d : ℚ) + 1) ∧
∃ D : List (ℕ × ℕ), (∀ p ∈ D, 0 < p.1 ∧ p.1 < p.2) ∧ (D.map Prod.fst).sum = n ∧
(D.map Prod.snd).sum = d ∧
(Ψ n d : ℚ) ≤ (D.map fun p : ℕ × ℕ => ((p.1 : ℚ) * p.2) / ((p.2 : ℚ) - p.1)).sum := by
sorry
end DiazModulus