This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Siegel's theorem on integral points | |
|---|---|
| Name | Siegel's theorem on integral points |
| Mathematician | Carl Ludwig Siegel |
| Field | Number theory |
| Introduced | 1929 |
| Statement | Finiteness of integral points on affine algebraic curves of genus greater than zero or genus zero with ≥3 points at infinity |
Siegel's theorem on integral points describes finiteness properties of integral solutions to diophantine equations defined by algebraic curves. Formulated by Carl Ludwig Siegel in 1929, the theorem asserts that for a wide class of affine curves defined over number fields, only finitely many integral points exist; this result links the work of Pythagoras-era diophantine study with modern developments by Alexander Grothendieck, André Weil, and Gerd Faltings. The theorem motivates interactions among researchers at institutions such as Princeton University, University of Göttingen, and École Normale Supérieure and underpins later results by Paul Vojta and Enrico Bombieri.
Siegel proved that if C is a smooth projective algebraic curve defined over a number field K with genus g>=1, and A is the set of K-integral points on an affine model of C obtained by removing a finite nonempty set S of points at infinity (with |S|>=1), then A is finite. In the special case of genus g=0, finiteness holds provided the number of removed points satisfies |S|>=3. The theorem is stated for integral structures relative to the ring of S-integers of K and refines classical assertions about equations like those studied by Pierre de Fermat, Diophantus of Alexandria, and Fermat's Last Theorem researchers. Siegel's hypothesis requires neither a height bound as an input nor an effective bound on the number of solutions; later work by Alan Baker and G. Faltings addressed effectivity in related settings.
Siegel's work grew from attempts to generalize finiteness results for particular diophantine equations studied by Sophie Germain, Adrien-Marie Legendre, and Joseph-Louis Lagrange. Motivated by the arithmetic of elliptic curves developed by André Weil and the analytic techniques of Bernhard Riemann and Henri Poincaré, Siegel leveraged transcendence methods influenced by Carl Gustav Jacob Jacobi and Srinivasa Ramanujan. The theorem consolidated earlier case-based work on hyperelliptic equations pursued at University of Cambridge and University of Bonn and anticipated later breakthroughs such as Faltings's theorem (formerly the Mordell conjecture). The interplay with Baker's theory of linear forms in logarithms shows the historical dialogue between analytic and algebraic approaches in Great Britain, Germany, and France.
Siegel's proof combines diophantine approximation, complex analysis on Riemann surfaces, and the use of Jacobian varieties studied by Niels Henrik Abel and Jacques Hadamard. Key elements include construction of auxiliary functions via the method of Thue–Siegel, reduction to bounding valuations at places of a number field such as those classified by Kurt Hensel, and application of the theory of elliptic and Jacobian integrals central to Carl Gustav Jacobi and Niels Henrik Abel. Transcendence inputs echo techniques later systematized by Alan Baker; Arakelov-theoretic perspectives developed by Suren Arakelov and algebraic geometry frameworks of Alexander Grothendieck give modern reinterpretations. The argument is inherently ineffective: it shows existence of only finitely many integral points without providing a general algorithm to enumerate them.
Siegel's theorem has immediate impact on the solvability of exponential diophantine equations studied by Euler and on integral points on elliptic curves explored by Srinivasa Ramanujan-era investigators. It is a cornerstone for the proof strategies of finiteness statements in the work of Gerd Faltings on rational points, underpins explicit techniques used by Alan Baker in bounding sizes of solutions, and informs computational approaches employed at University of Tokyo and Massachusetts Institute of Technology. Consequences extend to the arithmetic of modular curves studied by John Tate and Barry Mazur, to unit equations linked to Leopold Kronecker-style reciprocity, and to implications in the theory of rational points on higher-dimensional varieties considered by Jean-Pierre Serre and Paul Vojta.
Classical examples encompassed by the theorem include the finiteness of integer solutions to hyperelliptic equations like y^2 = f(x) with deg f >=5 studied by Joseph Liouville-inspired methods, Mordell curves of the form y^2 = x^3 + k analyzed in early Louis Mordell research, and unit equations x + y = 1 over S-integers connected to Jakob Bernoulli-related exponential diophantine problems. For genus zero curves with three or more points removed, examples include the thrice-punctured line linked to Riemann-mapping phenomena and the classical Pell equation families tied to Pierre de Fermat-era investigations. Elliptic curve instances relate to work by André Weil and computational studies at Cremona's database-style projects.
Subsequent generalizations include effective bounds for integral points in special families via Alan Baker's theory, Vojta's conjectures that predict analogues of Siegel's finiteness across higher dimensions and value distribution theory influenced by Rolf Nevanlinna, and Faltings's finiteness theorems for rational points on higher-genus curves. Arakelov geometry and the work of Christophe Soulé and Shou-Wu Zhang provide refined height-theoretic frameworks. Related results include Runge's theorem from Carl Runge for effective finiteness under degree conditions, the Thue–Siegel–Roth theorem by Kurt Thue and Klaus Roth on diophantine approximation, and Mordell–Weil finiteness theorems developed by Louis Mordell and André Weil.