Baker–Wüstholz theorem

Baker–Wüstholz theorem. The Baker–Wüstholz theorem is a major result in transcendental number theory providing explicit lower bounds for linear forms in logarithms of algebraic numbers, generalizing earlier work of Alan Baker and consolidating methods from Gisbert Wüstholz, A. O. Gelfond, Theodor Schneider, Kurt Mahler and others. It gives effective, quantitative estimates that have been applied across Diophantine equations, Thue equation, the Mordell conjecture context, and algorithmic aspects related to Hilbert's seventh problem, David Hilbert, and computational number theory in the style of Enrico Bombieri and John Tate.

Statement

The theorem asserts that for non-zero algebraic numbers α1, …, αn and rational integers b1, …, bn not all zero, the linear form Λ = b1 log α1 + ... + bn log αn (with suitably chosen complex logarithms) satisfies an explicit lower bound of the shape log |Λ| > −C(n, d, H) · log B, where C(n, d, H) is an effectively computable constant depending on the number n of logarithms, the degree d of the number field generated by the αi relative to Carl Friedrich Gauss's notion of algebraic degree, and H encapsulating heights in the sense of André Weil and Philippon; here B = max{|b1|, …, |bn|}. The statement refines and makes effective earlier qualitative statements by Gelfond–Schneider theorem and by Alan Baker himself, providing bounds uniform in families and explicit dependencies on invariants arising in Algebraic number theory institutions such as Dedekind rings and Minkowski geometry.

Historical context and development

Development of explicit bounds for linear forms in logarithms traces to the resolution of Hilbert's seventh problem by Gelfond and Schneider in the 1930s, followed by substantial quantitative advances by Alan Baker in the 1960s and 1970s, culminating in his work on effective bounds for Diophantine equations recognized by the Fields Medal-level attention in transcendence theory. Subsequent refinements by researchers including Yu. V. Nesterenko, Michel Waldschmidt, Enrico Bombieri, Waldemar Skolem, Anatoly Maltsev and Gisbert Wüstholz led to the formulation proven by Wüstholz in the 1990s that combined Baker's method, Siegel's analytic approach, and sophisticated use of height machinery developed by André Weil and Arakelov theory contributors like Paul Vojta. The theorem nests historically between the classical Baker's theorem and structural results such as the Subspace theorem by Wolfgang M. Schmidt and links to transcendence results by Klaus Roth and Alan Turing-era algorithmic concerns.

Proof outline and key ingredients

The proof synthesizes methods from Diophantine approximation and transcendence, employing auxiliary functions constructed à la A. O. Gelfond and refined via interpolation determinants introduced by Gelfond and Baker. Principal ingredients include: explicit height estimates using Weil height theory, zero estimates for linear forms in logarithms via the Baker–Wüstholz zero estimate apparatus, construction of auxiliary polynomials exploiting properties of algebraic groups such as the multiplicative group Gm studied by Jean-Pierre Serre, and an application of a determinant method reminiscent of ideas in Hadamard and Siegel theory. The analysis requires effective control of local contributions at Archimedean and non-Archimedean places drawing on techniques from p-adic analysis attributable to Kurt Hensel and modern treatments by Serge Lang and Michel Waldschmidt.

Applications and consequences

The theorem yields effective finiteness results for families of Diophantine equations, allowing explicit computation of bounds for unknowns in exponential Diophantine equations such as those studied by Srinivasa Ramanujan-style identities, and in solving specific instances of the Mordell–Lang conjecture-related problems in the multiplicative group. It underpins algorithmic methods for resolving Thue, Thue–Mahler, and superelliptic equations used by computational number theorists like Alan Turing-era successors and implemented in computer algebra systems inspired by David Cox's work. Consequences include explicit bounds in results by Bugeaud, Mignotte, C. L. Stewart, and Michel Waldschmidt for unit equations, S-unit equations, and bounds for integral points on curves studied by Gerd Faltings and Manin-type problems. The theorem also impacts transcendence proofs for values of logarithmic expressions appearing in the work of Ramanujan, Leonhard Euler, and contemporary investigations by Don Zagier.

Examples and explicit bounds

Concrete corollaries produce explicit numerical inequalities: for n = 2 and algebraic α1, α2 of bounded degree and height one obtains bounds comparable to classical results used by Baker to solve exponential equations such as Catalan-type relations investigated by Pieter R. Catalan and furthered by Preda Mihailescu. For larger n the constants C(n, d, H) grow combinatorially; effective formulas given in Wüstholz's exposition allow practitioners such as Marc Hindry and Joseph Silverman to derive computable bounds for S-unit equations and to implement resolution routines in computational packages developed in the tradition of John Cremona and Henri Cohen. Explicit worked examples appear in literature addressing particular equations studied by Claude Levesque, Michel Laurent, and T.N. Shorey, where the Baker–Wüstholz bounds convert qualitative transcendence statements into explicit numeric bounds enabling finite search.

Category:Transcendental number theory