Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

For u ∉ Q̄ with uū algebraic, each space Q̄ + Q̄u + Q̄ū + Q̄w with w = u², ū² or 1/(u − a), a ∈ Q̄ non-zero, carries a 2×3 configuration

Proved
DiazModulus.circle_point_extension_carries_two_by_three_configuration

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

diaz-modulus-leannumber-theorytranscendence

Let u∈C∖Q‾u \in \mathbb{C} \setminus \overline{\mathbb{Q}}u∈C∖Q​ with uuˉu\bar uuuˉ algebraic, and let www be u2u^2u2, uˉ2\bar u^2uˉ2, or 1/(u−a)1/(u - a)1/(u−a) with a∈Q‾a \in \overline{\mathbb{Q}}a∈Q​, a≠0a \neq 0a=0. Then there are x1,x2x_1, x_2x1​,x2​, linearly independent over Q‾\overline{\mathbb{Q}}Q​, and y1,y2,y3y_1, y_2, y_3y1​,y2​,y3​, linearly independent over Q‾\overline{\mathbb{Q}}Q​, with all six products xiyjx_i y_jxi​yj​ in Q‾+Q‾u+Q‾uˉ+Q‾w\overline{\mathbb{Q}} + \overline{\mathbb{Q}}u + \overline{\mathbb{Q}}\bar u + \overline{\mathbb{Q}}wQ​+Q​u+Q​uˉ+Q​w.

The configurations are x=(1,u)x = (1, u)x=(1,u), y=(u−1,1,u)y = (u^{-1}, 1, u)y=(u−1,1,u) for w=u2w = u^2w=u2; x=(1,u−1)x = (1, u^{-1})x=(1,u−1), y=(u,1,u−1)y = (u, 1, u^{-1})y=(u,1,u−1) for w=uˉ2w = \bar u^2w=uˉ2; and x=(u−1,(u−a)−1)x = (u^{-1}, (u - a)^{-1})x=(u−1,(u−a)−1), y=(1,u,u2−au)y = (1, u, u^2 - au)y=(1,u,u2−au) for w=1/(u−a)w = 1/(u - a)w=1/(u−a). At a candidate uuu, Roy's strong six exponentials theorem turns them into Diaz's exclusions (2007, Cor. 5(1) and 5(4)): none of u2u^2u2, uˉ2\bar u^2uˉ2, 1/(u−a)1/(u - a)1/(u−a) lies in L~\widetilde{\mathcal{L}}L. The statement itself does not involve eue^ueu, so it keeps its content if Diaz's conjecture holds.

Proof. Since u−1=uˉ/(uuˉ)u^{-1} = \bar u/(u\bar u)u−1=uˉ/(uuˉ) with uuˉu\bar uuuˉ algebraic and non-zero, every product listed lies in the space; for instance u/(u−a)=1+a/(u−a)u/(u - a) = 1 + a/(u - a)u/(u−a)=1+a/(u−a) and (u2−au)/(u−a)=u(u^2 - au)/(u - a) = u(u2−au)/(u−a)=u. Independence comes from the transcendence of uuu over Q‾\overline{\mathbb{Q}}Q​: after multiplying by uuu, or by u(u−a)u(u - a)u(u−a), a vanishing combination becomes a polynomial of degree at most 222 in uuu with algebraic coefficients, which must be zero; for the last family a≠0a \neq 0a=0 is used.

Novelty. Not asserted. These are the configurations behind Diaz (2007), Cor. 5(1) and 5(4); the first also appears in DiazModulus.power_hull_strong_six_exp_configuration_iff.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem circle_point_extension_carries_two_by_three_configuration (u w : ℂ) (hu : u ∉ Qbar)
    (hρ : IsAlgebraic ℚ (u * conj u))
    (hw : w = u ^ 2 ∨ w = conj u ^ 2 ∨ ∃ a ∈ Qbar, a ≠ 0 ∧ w = (u - a)⁻¹) :
    ∃ (x : Fin 2 → ℂ) (y : Fin 3 → ℂ), LinearIndependent (↥Qbar) x ∧ LinearIndependent (↥Qbar) y ∧
      ∀ i j, x i * y j ∈ Submodule.span Qbar ({1, u, conj u, w} : Set ℂ) := by
  sorry

end DiazModulus
Source
The configurations behind 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, Cor. 5(1) and 5(4) (p. 383), used with Roy's strong six exponentials theorem (D. Roy, Matrices whose coefficients are linear forms in logarithms, J. Number Theory 41 (1992), 22–47, Cor. 2). Formal proof: Diaz modulus mission, 5 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