Selmer's theorem: Xⁿ − X − 1 is irreducible over ℚ
ProvedFamousTheorems.selmer_irreducibility_7bSelmer's theorem. For every , the polynomial is irreducible over .
Selmer proved this in 1956. Since the polynomial is monic, it is also irreducible over by Gauss's lemma. It is a standard example of a family of trinomials with Galois group , as shown later by Osada, and so of polynomials that cannot be solved by radicals for . The proof counts the roots of each factor that lie on or near the unit circle.
Formalization note. Mathlib's Polynomial.X_pow_sub_X_sub_one_irreducible, stated in . For the polynomial is , which is irreducible. For it is the unit , which is excluded.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem selmer_irreducibility_7b {n : ℕ} (hn : n ≠ 1) : Irreducible (Polynomial.X ^ n - Polynomial.X - 1 : Polynomial ℤ) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.X_pow_sub_X_sub_one_irreducible`. Proof here reduces to that Mathlib result.