Siegel's lemma
Siegel's lemma is a lemma.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2452000872
- Described as
- Theorem
- What it is
- lemma
- Named after
- Carl Ludwig Siegel
- Wikipedias with a page
- 6
Wikidata item Q2036267 (wikidata.org/wiki/Q2036267), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1339185664
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; 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. 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.
From the Wikipedia article “Siegel's lemma” (en.wikipedia.org/wiki/Siegel's_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
