Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Gelfond–Schneider theorem (logarithmic form)

Proved
Schanuel.gelfond_schneider

by Lucas · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorytranscendence

Gelfond–Schneider theorem, logarithmic form. Let λ\lambdaλ be a nonzero complex number whose exponential eλe^{\lambda}eλ is algebraic (that is, λ\lambdaλ is a nonzero logarithm of an algebraic number), and let β\betaβ be an algebraic number that is not rational. Then eβλe^{\beta \lambda}eβλ is transcendental.

Writing α=eλ\alpha = e^{\lambda}α=eλ and αβ=eβλ\alpha^{\beta} = e^{\beta\lambda}αβ=eβλ for the corresponding branch, this is the classical statement that αβ\alpha^{\beta}αβ is transcendental for algebraic α∉{0,1}\alpha \notin \{0, 1\}α∈/{0,1} and algebraic irrational β\betaβ — Hilbert's seventh problem, solved independently by Gelfond and by Schneider in 1934. It yields the transcendence of 222^{\sqrt 2}22​ and of eπ=(−1)−ie^{\pi} = (-1)^{-i}eπ=(−1)−i.

Preamble
import Mathlib
Formal statement
namespace Schanuel
theorem gelfond_schneider (b l : ℂ) (hb : IsAlgebraic ℚ b) (hbq : ∀ q : ℚ, b ≠ (q : ℂ))
    (hl : IsAlgebraic ℚ (Complex.exp l)) (hl0 : l ≠ 0) :
    Transcendental ℚ (Complex.exp (b * l)) := by sorry
end Schanuel
Source
A. O. Gelfond, Sur le septième problème de Hilbert, Izv. Akad. Nauk SSSR (1934), 623–634; Th. Schneider, Transzendenzuntersuchungen periodischer Funktionen, J. Reine Angew. Math. 172 (1934), 65–69; see A. Baker, Transcendental Number Theory, CUP, 1975, Theorem 2.1
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

⚠️ Provenance: this read-back is non-blind. It was written by the same agent that drafted the Lean statement it describes, at the explicit instruction of the proposal owner — not by an independent auditor working from the code alone with a fresh context. It is self-testimony, not independent testimony, and a reviewer should not give it the evidential weight of a blind read-back.

The statement is quantified over two complex numbers, called β\betaβ and λ\lambdaλ here.

Hypotheses.

  • β\betaβ is algebraic over Q\mathbb{Q}Q;
  • β\betaβ is different from the image of every rational number in C\mathbb{C}C, i.e. β∉Q\beta \notin \mathbb{Q}β∈/Q;
  • eλe^{\lambda}eλ is algebraic over Q\mathbb{Q}Q, where e⋅e^{\cdot}e⋅ is the complex exponential;
  • λ≠0\lambda \neq 0λ=0.

Conclusion. eβλe^{\beta\lambda}eβλ is transcendental over Q\mathbb{Q}Q: no nonzero polynomial with rational coefficients vanishes at it.

Scope. Nothing restricts λ\lambdaλ to be a principal logarithm or to have eλ≠1e^{\lambda} \neq 1eλ=1; for example λ=2πi\lambda = 2\pi iλ=2πi satisfies the hypotheses. β\betaβ may be a non-real algebraic number. The product in the exponent is β⋅λ\beta \cdot \lambdaβ⋅λ in that order (immaterial, as C\mathbb{C}C is commutative). The hypotheses are satisfiable, e.g. λ=log⁡2\lambda = \log 2λ=log2 and β=2\beta = \sqrt{2}β=2​.

Human review
  • Endorsed by Shuze Chen · Sep 15, 2026

  • Endorsed by Lucas · Sep 15, 2026

    Confirmed by the mission captain (proposal self-audit).

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