English

A formalization of the Gelfond-Schneider theorem

Logic in Computer Science 2026-03-27 v1

Abstract

We formalize Hilbert's Seventh Problem and its solution, the Gelfond-Schneider theorem, in the Lean 4 proof assistant. The theorem states that if α\alpha and β\beta are algebraic numbers with α0,1\alpha \neq 0,1 and β\beta irrational, then αβ\alpha^\beta is transcendental. Originally proven independently by Gelfond and Schneider in 1934, this result is a cornerstone of transcendental number theory, bridging algebraic number theory and complex analysis.

Keywords

Cite

@article{arxiv.2603.24823,
  title  = {A formalization of the Gelfond-Schneider theorem},
  author = {Michail Karatarakis and Freek Wiedijk},
  journal= {arXiv preprint arXiv:2603.24823},
  year   = {2026}
}