Computing Galois Groups and Finite Fields
Handbook guide to computing galois groups and finite fields with core definitions, structural results, reasoning methods and verification checks.
How the topic fits together
Computing a Galois Group Directly
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Finite Fields
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Core definitions and structural results
The following cards retain the mathematical content of the source while condensing long proofs into verification strategies. Numerical examples are treated as examples, not universal requirements.
Definition
Suppose that E is a splitting field of the separable polynomial f over F. The Galois group of f is the Galois group of the extension E/F. (The extension is indeed Galois; see Problem 8.) Given f, how can we determine its Galois group?
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Example
Let d be a positive integer that is not a perfect cube, and let θ be the positive cube root of d. Let ω = ei2π/3 = −1 2 + i 1 2 √ 3, so that ω2 = e−i2π/3 = −1 2 −i 1 2 √ 3 = −(1+ ω). The minimal polynomial of θ over the rationals Q is f(X) = X3 −d, because if f were reducible then it would have a linear factor and d would be a perfect cube. The minimal polynomial of ω over Q is g(X) = X2 + X +1.
Proof / verification strategy: Treat this as an illustration of the surrounding definitions. Recompute the stated relations directly and keep the numerical or structural choices local to the example.
Proposition
Let E be a finite field of characteristic p. Then |E| = pn for some positive integer n. Moreover, E is a splitting field for the separable polynomial f(X) = Xpn −X over Fp, so that any finite field with pn elements is isomorphic to E. Not only is E generated by the roots of f, but in fact E coincides with the set of roots of f.
Proof / verification strategy: Construct the natural group homomorphism, identify its kernel and image, and then use quotient structure to prove the claimed isomorphism or correspondence.
Corollary
If E is a finite field of characteristic p, then E/Fp is a Galois extension. The Galois group is cyclic and is generated by the Frobenius automorphism σ(x) = xp, x ∈E.
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
Corollary
Let E/F be a finite extension of a finite field, with |E| = pn, |F| = pm. Then E/F is a Galois extension. Moreover, m divides n, and Gal(E/F) is cyclic and is generated by the automorphism τ(x) = xpm, x ∈E. Furthermore, F is the only subfield of E of size pm.
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
Theorem
The multiplicative group of a finite field is cyclic. More generally, if G is a finite subgroup of the multiplicative group of an arbitrary field, then G is cyclic.
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
Proposition GF(pm) is a subfield of E = GF (pn) if and only if m is a divisor of n.
GF(pm) is a subfield of E = GF (pn) if and only if m is a divisor of n.
Proof / verification strategy: Work directly from closure, inverses, subgroup tests and the defining action or presentation. Use a small cyclic or permutation model to verify the direction of the argument.
Theorem
Let p be a prime and n a positive integer. Then Xpn −X is the product of all monic irreducible polynomials over Fp whose degree divides n.
Proof / verification strategy: Work directly from closure, inverses, subgroup tests and the defining action or presentation. Use a small cyclic or permutation model to verify the direction of the argument.
The Explicit Construction of a Finite Field
The Explicit Construction of a Finite Field By (6.4.4), the multiplicative group E∗of a finite field E = GF(pn) is cyclic, so E∗can be generated by a single element α. Thus E = Fp(α) = Fp[α], so that α is a primitive element of E. The minimal polynomial of α over Fp is called a primitive polynomial. The key point is that the nonzero elements of E are not
Proof / verification strategy: Use subgroup generation, coset/orbit counting and divisibility of orders. For cyclic groups, reduce the claim to arithmetic on exponents modulo the group order.
Quick-reference relationships
Problem-solving workflow
Identify the ambient group
State the operation, identity, inverses and whether commutativity is available.
Locate the relevant subgroup structure
Check generated subgroups, normality, cosets, stabilisers or direct factors before applying a theorem.
Use the correct counting or mapping tool
Choose coset counting, orbit counting, a homomorphism, a quotient or a group action as appropriate.
Check hypotheses explicitly
Finite-order assumptions, normality, prime-power divisibility and coprimality conditions are not interchangeable.
Translate the result back to structure
Interpret the result as a statement about subgroup size, quotient structure, action, decomposition or presentation.
Verify with a small model
Use a cyclic, symmetric, dihedral or modular example to test the logic without treating the example as the theorem.
Worked-solution emphasis from the supplied source
The supplied worked solutions for this section repeatedly test order, subgroup, polynomial, root, degree, basis, field, automorphism. These checks are used here as verification themes rather than copied as answer text.
Common mistakes and boundary conditions
- Treating left and right cosets as identical without normality.
- Assuming the converse of a subgroup-order divisibility result.
- Confusing the order of a group with the order of one of its elements.
- Using quotient multiplication before checking that the subgroup is normal.
- Assuming an algebraic extension is automatically normal or separable.
- Confusing the degree of a polynomial with the degree of an extension when the polynomial is not minimal.
Verification checklist
- State the ambient algebraic structure and operation before applying a theorem.
- Record every hypothesis that controls the result: finiteness, commutativity, normality, primality, separability, exactness or other section-specific conditions.
- Distinguish a definition from a theorem that follows from it.
- Check whether a map is well-defined before using its kernel, image, inverse or induced map.
- Use a concrete example only as a check; do not promote an illustrative value or pattern to a universal rule.
- When a quotient, localisation or extension is constructed, identify the canonical map and what becomes equal, invertible or fixed.
Source coverage map
| Source section | Subject | PDF pages analysed |
|---|---|---|
| 6.3 | Computing a Galois Group Directly | 110–110 |
| 6.4 | Finite Fields | 111–112 |
Related Mathematics pages
Source note: synthesised from the supplied abstract-algebra PDF. The complete 298-page file, including diagrams and worked solutions, was reviewed. Source-identifying author and bibliographic personal details are intentionally omitted. Formal proofs are condensed; the page does not claim requirements or values not supported by the supplied mathematics.