Math 2.0

Number theory Theorem

Skolem–Mahler–Lech theorem

Builds on Linear recurrence with constant coefficientsSolution of a linear recurrenceArithmetic progression

Statement

Let KK be a field of characteristic 00. Let (un)n≥0(u_n)_{n \ge 0} be a solution of a linear recurrence with constant coefficients over KK. Then the zero set Z={n∈ℕ:un=0}Z = \set{n \in \N : u_n = 0} is the union of a finite set and finitely many arithmetic progressions {a+bm:m∈ℕ}\set{a + b m : m \in \N} with a∈ℕa \in \N and b≥1b \ge 1.

Remarks

The standard proof is pp-adic. One reduces to a finitely generated subfield, which embeds into the pp-adic numbers ℚp\Q_p for a suitable prime pp with all relevant quantities pp-adic units. Then for a suitable period bb and each residue aa, the map m↦ua+bmm \mapsto u_{a + b m} extends to a pp-adic analytic function on ℤp\Z_p. Such a function either vanishes identically or has only finitely many zeros, which gives the progressions and the finite set. Example: un=1+(−1)nu_n = 1 + (-1)^n solves un+2=unu_{n+2} = u_n, and its zero set is the progression of odd numbers. The hypothesis of characteristic 00 is necessary. Over the field 𝔽p(t)\F_p(t), the sequence un=(1+t)n−tn−1u_n = (1 + t)^n - t^n - 1 solves a linear recurrence of order 33. Its terms vanish exactly when nn is a power of pp, 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 pp-adic analysis in number theory, by the same principle as Strassmann's theorem on the zeros of pp-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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Mathematical induction concept
  2. Recurrence relation definition
  3. Sum of the first n natural numbers statement
  4. Linear recurrence with constant coefficients definition
  5. Arithmetic progression example
  6. Solution of a linear recurrence definition
  7. Skolem–Mahler–Lech theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Skolem%E2%80%93Mahler%E2%80%93Lech_theorem
About this page
TagZQFPVWMY4M
URIm2://ZQFPVWMY4M
Kindstatement, theorem
WritingW0 stub
MSC11B37, 39A06
StatusThis copy of the site has no build data. Run m2 status ZQFPVWMY4M.
AboutSolution of a linear recurrence
UsesLinear 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.