Diaz 2007, Théorème 6: when (1, u, ū) is dependent, v, vu, vu² are not all in ℒ̃
ProvedDiazModulus.diaz_2007_th6diaz-modulus-leannumber-theorytranscendence
Here is the set of logarithms of algebraic numbers, and is the -vector space spanned by and . Roy's strong six exponentials theorem is carried as the hypothesis hSSE: if are -linearly independent and so are , then one of the six products is not in .
- Let with independent and dependent over . Then are not all in .
- Let and with independent and dependent. Then and are not both in .
- Let and with independent and dependent. Then and are not both in .
- Let with , independent and dependent. Then .
Part 2 generalises Proposition 3 of Diaz (1997), with in place of and in place of .
Proof. Part 1 applies the theorem to and : writing , the numbers and are combinations of , and their conjugates complete the six products. Parts 2–4 are part 1 at , and .
Novelty. None: this is Théorème 6 of Diaz (2007), p. 389, with his proof (pp. 389–390). The contribution of this node is the formal proof.
Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate
namespace DiazModulus
/-- **Diaz 2007, Théorème 6**, parts 1)–4), under Roy's strong six exponentials theorem `hSSE`. -/
theorem diaz_2007_th6
(hSSE : ∀ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ),
LinearIndependent (↥Qbar) x → LinearIndependent (↥Qbar) y →
¬ (∀ i j, x i * y j ∈ LogAlgTilde)) :
-- 1)
(∀ u v : ℂ, u ∉ Qbar → v ∉ Qbar →
(∀ a b : ℂ, a ∈ Qbar → b ∈ Qbar → a * v + b * conj v = 0 → a = 0 ∧ b = 0) →
(∃ a b c : ℂ, a ∈ Qbar ∧ b ∈ Qbar ∧ c ∈ Qbar ∧ ¬ (a = 0 ∧ b = 0 ∧ c = 0) ∧
a + b * u + c * conj u = 0) →
¬ (v ∈ LogAlgTilde ∧ v * u ∈ LogAlgTilde ∧ v * u ^ 2 ∈ LogAlgTilde)) ∧
-- 2)
(∀ l t : ℂ, l ∈ LogAlgTilde → t ∉ Qbar →
(∀ a b : ℂ, a ∈ Qbar → b ∈ Qbar → a * (l / t) + b * conj (l / t) = 0 → a = 0 ∧ b = 0) →
(∃ a b c : ℂ, a ∈ Qbar ∧ b ∈ Qbar ∧ c ∈ Qbar ∧ ¬ (a = 0 ∧ b = 0 ∧ c = 0) ∧
a + b * t + c * conj t = 0) →
¬ (t * l ∈ LogAlgTilde ∧ l / t ∈ LogAlgTilde)) ∧
-- 3)
(∀ l s : ℂ, l ∈ LogAlgTilde → s ∉ Qbar →
(∀ a b : ℂ, a ∈ Qbar → b ∈ Qbar → a * l + b * conj l = 0 → a = 0 ∧ b = 0) →
(∃ a b c : ℂ, a ∈ Qbar ∧ b ∈ Qbar ∧ c ∈ Qbar ∧ ¬ (a = 0 ∧ b = 0 ∧ c = 0) ∧
a + b * s + c * conj s = 0) →
¬ (s * l ∈ LogAlgTilde ∧ s ^ 2 * l ∈ LogAlgTilde)) ∧
-- 4)
(∀ l l₁ l₂ : ℂ, l ∈ LogAlgTilde → l₁ ∈ LogAlgTilde → l₂ ∈ LogAlgTilde →
l ≠ 0 → l₁ ≠ 0 → l₂ ≠ 0 → l₁ * l₂ = l ^ 2 →
(∀ a b : ℂ, a ∈ Qbar → b ∈ Qbar → a * l₁ + b * conj l₁ = 0 → a = 0 ∧ b = 0) →
(∃ a b c : ℂ, a ∈ Qbar ∧ b ∈ Qbar ∧ c ∈ Qbar ∧ ¬ (a = 0 ∧ b = 0 ∧ c = 0) ∧
a + b * (l / l₁) + c * conj (l / l₁) = 0) →
l / l₁ = l₂ / l ∧ l / l₁ ∈ Qbar) := by
sorry
end DiazModulus
Source
G. Diaz, Produits et quotients de combinaisons linéaires de logarithmes de nombres algébriques : conjectures et résultats partiels, J. Théor. Nombres Bordeaux 19 (2007), 373–391, Théorème 6, p. 389, proof pp. 389–390. Formal proof: Diaz modulus mission, 1 October 2026 (C. Perassi).