Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

For u transcendental over the field of ℒ̃ with uū algebraic: if S ⊆ ℒ + ℚu + ℚū and ℚ[S] has transcendence degree ≤ 1, then S lies in ℒ, on a line ℚe, or in ℚu + ℚū

Proved
DiazModulus.logAlg_adjoin_circle_point_trdeg_le_one_trichotomy

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

diaz-modulus-leannumber-theorytranscendence

Here L\mathcal{L}L is the set of logarithms of algebraic numbers (the z∈Cz \in \mathbb{C}z∈C with eze^zez algebraic), and L~\widetilde{\mathcal{L}}L is the Q‾\overline{\mathbb{Q}}Q​-vector space spanned by 111 and L\mathcal{L}L. Let FFF be the subfield of C\mathbb{C}C generated by L~\widetilde{\mathcal{L}}L, that is, by Q‾\overline{\mathbb{Q}}Q​ and L\mathcal{L}L. Let u∈Cu \in \mathbb{C}u∈C be transcendental over FFF, with uuˉu\bar uuuˉ algebraic, and put Lu=spanQ(L)+spanQ(u,uˉ)\mathcal{L}_u = \mathrm{span}_{\mathbb{Q}}(\mathcal{L}) + \mathrm{span}_{\mathbb{Q}}(u, \bar u)Lu​=spanQ​(L)+spanQ​(u,uˉ); as L\mathcal{L}L is a Q\mathbb{Q}Q-vector space, this is L+Qu+Quˉ\mathcal{L} + \mathbb{Q}u + \mathbb{Q}\bar uL+Qu+Quˉ. Let S⊆LuS \subseteq \mathcal{L}_uS⊆Lu​ be such that Q[S]\mathbb{Q}[S]Q[S], the Q\mathbb{Q}Q-subalgebra of C\mathbb{C}C generated by SSS, has transcendence degree at most 111 over Q\mathbb{Q}Q. Then one of the following holds:

  • S⊆LS \subseteq \mathcal{L}S⊆L;
  • there is e∈Ce \in \mathbb{C}e∈C such that every z∈Sz \in Sz∈S is rerere for some r∈Qr \in \mathbb{Q}r∈Q;
  • every z∈Sz \in Sz∈S is pu+quˉpu + q\bar upu+quˉ for some p,q∈Qp, q \in \mathbb{Q}p,q∈Q.

Proof. By DiazModulus.mem_logAlg_adjoin_circle_point_iff every z∈Sz \in Sz∈S is c+pu+quˉc + pu + q\bar uc+pu+quˉ with c∈Lc \in \mathcal{L}c∈L and p,q∈Qp, q \in \mathbb{Q}p,q∈Q, and the same node at the point 000 shows that L\mathcal{L}L is closed under rational combinations. If S⊆LS \subseteq \mathcal{L}S⊆L there is nothing to prove; otherwise fix z0=c0+p0u+q0uˉ∈Sz_0 = c_0 + p_0u + q_0\bar u \in Sz0​=c0​+p0​u+q0​uˉ∈S outside L\mathcal{L}L, so (p0,q0)≠(0,0)(p_0, q_0) \neq (0, 0)(p0​,q0​)=(0,0). If some z1=c1+p1u+q1uˉ∈Sz_1 = c_1 + p_1u + q_1\bar u \in Sz1​=c1​+p1​u+q1​uˉ∈S has D=p1q0−q1p0≠0D = p_1q_0 - q_1p_0 \neq 0D=p1​q0​−q1​p0​=0, then (q0z1−q1z0)/D=c1′+u(q_0z_1 - q_1z_0)/D = c_1' + u(q0​z1​−q1​z0​)/D=c1′​+u and (p1z0−p0z1)/D=c2′+uˉ(p_1z_0 - p_0z_1)/D = c_2' + \bar u(p1​z0​−p0​z1​)/D=c2′​+uˉ lie in Q[S]\mathbb{Q}[S]Q[S] with c1′,c2′∈Lc_1', c_2' \in \mathcal{L}c1′​,c2′​∈L, and DiazModulus.logAlg_adjoin_circle_point_trdeg_le_one_hyperbola_case gives S⊆Qu+QuˉS \subseteq \mathbb{Q}u + \mathbb{Q}\bar uS⊆Qu+Quˉ. Otherwise every (p,q)(p, q)(p,q) is r(p0,q0)r(p_0, q_0)r(p0​,q0​) with r=(pp0+qq0)/(p02+q02)r = (pp_0 + qq_0)/(p_0^2 + q_0^2)r=(pp0​+qq0​)/(p02​+q02​), so z−rz0∈L∩Q[S]z - rz_0 \in \mathcal{L} \cap \mathbb{Q}[S]z−rz0​∈L∩Q[S], and DiazModulus.logAlg_adjoin_circle_point_trdeg_le_one_logAlg_part_eq_zero with the point z0z_0z0​ makes it 000: SSS lies on the line Qz0\mathbb{Q}z_0Qz0​.

Novelty. Not found in the sources read; routine.

Preamble
import Definitions.Def_DiazModulus
Formal statement
open Complex ComplexConjugate

namespace DiazModulus

theorem logAlg_adjoin_circle_point_trdeg_le_one_trichotomy
    (u : ℂ) (hρ : IsAlgebraic ℚ (u * conj u))
    (hu : Transcendental (Subfield.closure (LogAlgTilde : Set ℂ)) u)
    (S : Set ℂ) (hS : ∀ z ∈ S, z ∈ (Submodule.span ℚ LogAlg ⊔ Submodule.span ℚ ({u, conj u} : Set ℂ)))
    (htr : Algebra.trdeg ℚ ↥(Algebra.adjoin ℚ S) ≤ 1) :
    (∀ z ∈ S, z ∈ LogAlg) ∨ (∃ e : ℂ, ∀ z ∈ S, ∃ r : ℚ, z = (r : ℂ) * e) ∨
      (∀ z ∈ S, ∃ p q : ℚ, z = (p : ℂ) * u + (q : ℂ) * conj u) := by
  sorry

end DiazModulus
Source
Not found in the sources read. Uses DiazModulus.mem_logAlg_adjoin_circle_point_iff, DiazModulus.logAlg_adjoin_circle_point_trdeg_le_one_logAlg_part_eq_zero and DiazModulus.logAlg_adjoin_circle_point_trdeg_le_one_hyperbola_case. R19 of the Diaz modulus mission. Formal proof: Diaz modulus mission, 18 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