Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The four exponentials conjecture has no instance on the logarithms certified by a generic candidate

Proved
DiazModulus.generic_conj_pair_four_exp_barrier

by carlok · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

diaz-modulus-leannumber-theorytranscendence

A barrier: the four exponentials conjecture sees nothing homogeneous.

Let u≠0u \neq 0u=0 with ∣u∣2|u|^{2}∣u∣2 algebraic, algebraically independent of iπi\piiπ over Q‾\overline{\mathbb{Q}}Q​. Let MMM be a 2×22\times22×2 matrix whose entries are rational linear combinations of uuu, uˉ\bar uuˉ and iπi\piiπ. If det⁡M=0\det M = 0detM=0, then the rows of MMM are Q\mathbb{Q}Q-linearly dependent or its columns are.

For a candidate uuu of Diaz's conjecture, the numbers uuu, uˉ\bar uuˉ and iπi\piiπ are the logarithms of algebraic numbers that the candidate certifies. The statement therefore says that no instance of the four exponentials conjecture (Q\mathbb{Q}Q-independent rows and columns, products in L\mathcal{L}L) can be built from them: on this data the conjecture is a theorem, by pure algebra. What does detect a candidate is a configuration with a constant entry, as in DiazModulus.diaz_of_sfe. For candidates algebraic over Q(π)\mathbb{Q}(\pi)Q(π), see DiazModulus.candidate_nongeneric_four_exp_barrier. The statement does not use eue^{u}eu.

Novelty. Not asserted.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem generic_conj_pair_four_exp_barrier (u : ℂ) (hu : u ≠ 0)
    (hρ : IsAlgebraic ℚ (u * conj u))
    (hgen : AlgebraicIndependent (↥Qbar) ![u, ((Real.pi : ℝ) : ℂ) * Complex.I])
    (A : Fin 2 → Fin 2 → Fin 3 → ℚ) (M : Fin 2 → Fin 2 → ℂ)
    (hM : ∀ i j, M i j = ∑ k, (A i j k : ℂ) * ![u, conj u, ((Real.pi : ℝ) : ℂ) * Complex.I] k)
    (hdet : M 0 0 * M 1 1 = M 0 1 * M 1 0) :
    (∃ p q : ℚ, ¬(p = 0 ∧ q = 0) ∧ ∀ j, (p : ℂ) * M 0 j + (q : ℂ) * M 1 j = 0) ∨
      (∃ p q : ℚ, ¬(p = 0 ∧ q = 0) ∧ ∀ i, (p : ℂ) * M i 0 + (q : ℂ) * M i 1 = 0) := by sorry

end DiazModulus
Source
Carlo Perassi, companion note to https://github.com/carlok/diaz-modulus-lean, version 1.9, 25 September 2026 (GitHub release note-v1.9), Theorem 5.4(b). Novelty is not asserted. Formal proof: Diaz modulus mission, 23 September 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