Subfields of Finite Fields

Abstract Algebra · Axiom Academy

LESSON Subfields of Finite Fields The beautiful connection between divisibility and field structure: GF(p m ) ⊆ GF(p n ) if and only if m divides n This theorem completely characterizes the subfield structure of finite fields. The containment of fields corresponds precisely to the divisibility of their exponents over the same prime. The key insight comes from the multiplicative structure of finite fields. Every element α in GF(p n ) satisfies: If GF(p m ) ⊆ GF(p n ), then every element of GF(p m ) must also satisfy this equation. But elements of GF(p m ) satisfy α p m = α. For both to be true, we need p m - 1 to divide p n - 1, which happens precisely when m divides n. 3. Divisibility and Lattice Structure The subfield structure forms a lattice that mirrors the divisibility lattice of the exponent. Each divisor of n corresponds to exactly one subfield of GF(p n ). The lattice ordering is given by: F ≤ K means F is a subfield of K. This corresponds exactly to the divisibility ordering on exponents. 4. The Subfield Lattice of GF(64) Let's visualize the complete subfield structure of GF(64) = GF(2 6 ). Since 6 = 2 × 3, the divisors are 1, 2, 3, 6 , giving us four subfields with a diamond lattice structure.

This is the written version of the interactive lesson above. See the full Abstract Algebra course.