Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Two candidates with a rational ratio of squared moduli: one is a rational multiple of the other or of its conjugate exactly when they are algebraically dependent

Proved
DiazModulus.candidate_pair_dichotomy

by carlok · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

Let u,vu, vu,v be candidates for Diaz's conjecture (DiazModulus.IsCandidate) with ∣v∣2=m ∣u∣2|v|^2 = m\,|u|^2∣v∣2=m∣u∣2 for some m∈Qm \in \mathbb{Q}m∈Q. Then v∈Q×u∪Q×uˉv \in \mathbb{Q}^\times u \cup \mathbb{Q}^\times\bar uv∈Q×u∪Q×uˉ if and only if uuu and vvv are algebraically dependent over Q\mathbb{Q}Q. So exactly one of two things holds: v∈Q×u∪Q×uˉv \in \mathbb{Q}^\times u \cup \mathbb{Q}^\times\bar uv∈Q×u∪Q×uˉ, or uuu and vvv are algebraically independent.

This is Theorem 2.5 of C. Perassi's unpublished manuscript on Diaz's modulus conjecture, where it was derived from Roy and Waldschmidt (1997); here it follows from the four exponentials theorem in transcendence degree one. It concerns candidates, so it is vacuous if Diaz's conjecture holds.

Proof. If v∈Q×u∪Q×uˉv \in \mathbb{Q}^\times u \cup \mathbb{Q}^\times\bar uv∈Q×u∪Q×uˉ, then uuu and vvv are dependent (Diaz.pair_dichotomy_exclusive). Conversely, if they are dependent, they generate an algebra of transcendence degree at most one (uuu is transcendental by Hermite–Lindemann), and so do u,v,uˉ,vˉu, v, \bar u, \bar vu,v,uˉ,vˉ, since uˉ=∣u∣2/u\bar u = |u|^2/uuˉ=∣u∣2/u and vˉ=∣v∣2/v\bar v = |v|^2/vvˉ=∣v∣2/v with algebraic numerators. Then DiazModulus.log_pair_rigid_of_trdeg_one gives v∈Qu∪Quˉv \in \mathbb{Q}u \cup \mathbb{Q}\bar uv∈Qu∪Quˉ, with a non-zero factor since v≠0v \neq 0v=0.

Novelty. Not asserted. It is Waldschmidt's Corollary 4 (1973, p. 192) at (mu,uˉ,v)(mu, \bar u, v)(mu,uˉ,v).

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem candidate_pair_dichotomy (u v : ℂ) (hu : IsCandidate u) (hv : IsCandidate v)
    (m : ℚ) (hm : v * conj v = (m : ℂ) * (u * conj u)) :
    ((∃ c : ℚ, c ≠ 0 ∧ v = (c : ℂ) * u) ∨ (∃ c : ℚ, c ≠ 0 ∧ v = (c : ℂ) * conj u)) ↔
      ¬ AlgebraicIndependent ℚ ![u, v] := by
  sorry

end DiazModulus
Source
Theorem 2.5 of C. Perassi, unpublished manuscript on Diaz's modulus conjecture (August 2026). A direct instance of M. Waldschmidt, Solution du huitième problème de Schneider, J. Number Theory 5 (1973), 191–202, Cor. 4 (p. 192), at (mu, ū, v); the manuscript's route through D. Roy and M. Waldschmidt, Approximation diophantienne et indépendance algébrique de logarithmes, Ann. Sci. École Norm. Sup. (4) 30 (1997), 753–796, Th. 0.2, is not needed. Exclusivity is Diaz.pair_dichotomy_exclusive. Formal proof: Diaz modulus mission, 4 October 2026 (C. Perassi).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me