Existence of the finite field with p^n elements
ProvedFamousTheorems.galois_field_exists_6bExistence of the finite field with elements. For every prime and every there is a field with exactly elements.
The field is the splitting field of over , and its elements are exactly the roots of that polynomial. Together with the fact that a finite field has prime power order, this classifies the orders of finite fields. The fields are used in coding theory, cryptography, combinatorial designs and the arithmetic of varieties over finite fields.
Formalization note. Mathlib's GaloisField.card, applied to GaloisField p n, the splitting field of over ZMod p. Nat.card K is the number of elements of .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem galois_field_exists_6b (p : ℕ) [Fact p.Prime] (n : ℕ) (hn : n ≠ 0) : ∃ (K : Type) (_ : Field K), Nat.card K = p ^ n := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `GaloisField.card`. Proof here reduces to that Mathlib result.