Skolem–Mahler–Lech theorem
Builds on Linear recurrence with constant coefficientsSolution of a linear recurrenceArithmetic progression
Statement
Let be a field of characteristic . Let be a solution of a linear recurrence with constant coefficients over . Then the zero set is the union of a finite set and finitely many arithmetic progressions with and .
Remarks
The standard proof is -adic. One reduces to a finitely generated subfield, which embeds into the -adic numbers for a suitable prime with all relevant quantities -adic units. Then for a suitable period and each residue , the map extends to a -adic analytic function on . Such a function either vanishes identically or has only finitely many zeros, which gives the progressions and the finite set. Example: solves , and its zero set is the progression of odd numbers. The hypothesis of characteristic is necessary. Over the field , the sequence solves a linear recurrence of order . Its terms vanish exactly when is a power of , and this infinite set contains no infinite arithmetic progression. The proof is not effective: it gives no algorithm to find the finite set. Whether one can decide if a given integer recurrence has a zero at all is the open Skolem problem.
Going deeper
For a student
The theorem is named after Thoralf Skolem, Kurt Mahler and Christer Lech, who proved it in more and more general fields. The periodic part can be computed, but the finite exceptional set is the hard part. The proof is a classic use of -adic analysis in number theory, by the same principle as Strassmann's theorem on the zeros of -adic power series. A recurrence is non-degenerate if no ratio of two distinct roots of its characteristic polynomial is a root of unity. A common corollary: a non-degenerate solution that is not identically zero has only finitely many zeros.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Mathematical induction concept
- Recurrence relation definition
- Sum of the first n natural numbers statement
- Linear recurrence with constant coefficients definition
- Arithmetic progression example
- Solution of a linear recurrence definition
- Skolem–Mahler–Lech theorem statement
Further reading
About this page
| Tag | ZQFPVWMY4M |
|---|---|
| URI | m2://ZQFPVWMY4M |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11B37, 39A06 |
| Status | This copy of the site has no build data. Run m2 status ZQFPVWMY4M. |
| About | Solution of a linear recurrence |
| Uses | Linear recurrence with constant coefficients, Solution of a linear recurrence, Arithmetic progression |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.