Siegel's lemma

In mathematics, specifically in transcendental number theory and Diophantine approximation, Siegel's lemma refers to bounds on the solutions of linear equations obtained by the construction of auxiliary functions. The existence of these polynomials was proven by Axel Thue;

{{cite journal|last = Thue|first = Axel|authorlink = Axel Thue|title = Über Annäherungswerte algebraischer Zahlen|journal = J. Reine Angew. Math.|volume=1909|year = 1909|issue = 135|pages = 284–305|doi = 10.1515/crll.1909.135.284|s2cid = 125903243}} Thue's proof used what would be translated from German as Dirichlet's Drawers principle, which is widely known as the Pigeonhole principle. Carl Ludwig Siegel published his lemma in 1929.{{cite journal|last = Siegel|first = Carl Ludwig|authorlink = Carl Ludwig Siegel|title = Über einige Anwendungen diophantischer Approximationen|journal = Abh. Preuss. Akad. Wiss. Phys. Math. Kl.|year = 1929|pages = 41–69}}, reprinted in Gesammelte Abhandlungen, volume 1; the lemma is stated on page 213 It is a pure existence theorem for a system of linear equations.

Siegel's lemma has been refined in recent years to produce sharper bounds on the estimates given by the lemma.

{{cite journal|last = Bombieri|first = E.|authorlink = Enrico Bombieri|author2=Mueller, J. |title = On effective measures of irrationality for {\scriptscriptstyle\sqrt[r]{a/b}} and related numbers|journal = Journal für die reine und angewandte Mathematik|volume = 342|year = 1983|pages = 173–196}}

Statement

Suppose we are given a system of M linear equations in N unknowns such that N > M, say

:a_{11} X_1 + \cdots+ a_{1N} X_N = 0

:\cdots

:a_{M1} X_1 +\cdots+ a_{MN} X_N = 0

where the coefficients are integers, not all 0, and bounded by B. The system then has a solution

:(X_1, X_2, \dots, X_N)

with the Xs all integers, not all 0, and bounded by

:(NB)^{M/(N-M)}.{{harv|Hindry|Silverman|2000}} Lemma D.4.1, page 316.

{{harvtxt|Bombieri|Vaaler|1983}} gave the following sharper bound for the X's:

:\max|X_j| \,\le \left(D^{-1}\sqrt{\det(AA^T)}\right)^{\!1/(N-M)}

where D is the greatest common divisor of the M × M minors of the matrix A, and AT is its transpose. Their proof involved replacing the pigeonhole principle by techniques from the geometry of numbers.

See also

References

{{reflist|30em}}

  • {{Cite journal|last1 = Bombieri|first1 = E.|last2= Vaaler|first2= J.|title = On Siegel's lemma|journal = Inventiones Mathematicae|volume = 73|issue = 1|year=1983|pages = 11–32|doi = 10.1007/BF01393823|bibcode = 1983InMat..73...11B|s2cid = 121274024}}
  • {{Cite book | last1=Hindry | first1=Marc | author1-link=Marc Hindry | last2=Silverman | first2=Joseph H. | author2-link=Joseph H. Silverman | title=Diophantine geometry | publisher=Springer-Verlag | location=Berlin, New York | series=Graduate Texts in Mathematics | isbn=978-0-387-98981-5 | mr=1745599 | year=2000 | volume=201 }}
  • Wolfgang M. Schmidt. Diophantine approximation. Lecture Notes in Mathematics 785. Springer. (1980 [1996 with minor corrections]) (Pages 125-128 and 283–285)
  • Wolfgang M. Schmidt. "Chapter I: Siegel's Lemma and Heights" (pages 1–33). Diophantine approximations and Diophantine equations, Lecture Notes in Mathematics, Springer Verlag 2000.

Category:Lemmas

Category:Diophantine approximation

Category:Diophantine geometry