Galois Theory/Galois Groups of Polynomials

Lesson 11.41,404 words

Galois Groups of Polynomials

Ordering the roots of a separable polynomial embeds its Galois group in the symmetric group SnS_n, and the group is transitive exactly when the polynomial is irreducible. The discriminant decides membership in AnA_n; for cubics and quartics the resolvent cubic pins the group down; and reduction modulo a prime produces elements of prescribed cycle type, the standard tool for computing Galois groups over Q\mathbb{Q}.

╌╌╌╌

Galois's original object was the group of permutations of the roots of a polynomial. The Galois correspondence recovers that viewpoint concretely: label the roots of a separable polynomial, and each automorphism of the splitting field permutes them, embedding the Galois group as a subgroup of the symmetric group. Which subgroup it is can be read from two computable invariants — the discriminant and, for quartics, a resolvent cubic — and settled over by reducing modulo primes.

The Galois group as a permutation group

Let be separable of degree with distinct roots in its splitting field . An automorphism sends each root to another root, and since , the whole of is determined by the permutation it induces. Fixing an ordering of the roots gives an injective homomorphism .

Irreducibility corresponds to a group-theoretic property of the action.

If is irreducible, any two roots have the same minimal polynomial , so an isomorphism fixing extends to an automorphism of carrying to . Conversely a factorization of splits the roots into blocks no automorphism can cross.1

An automorphism of the splitting field permutes the roots; for an irreducible cubic the group acts transitively, and a generator can cycle the three roots .

Because the Galois group embeds in , its order divides , and transitivity forces to divide the order — a first constraint on which groups can occur. The extreme case is when nothing constrains the roots at all: over the field of rational functions in the coefficients, the group is the full symmetric group.

Over this is the typical case: most polynomials of degree have Galois group .2

The discriminant and the alternating group

The subgroup of even permutations is detected by a single element of the splitting field.

The number vanishes exactly when two roots coincide, so is separability. The quantity is the same object used to define the sign homomorphism: a permutation fixes it precisely when it is even. This gives the discriminant test.

Since always lies in the splitting field, is the fixed field of — the unique quadratic subextension detecting parity.

For an irreducible polynomial the discriminant splits the possibilities: a square discriminant forces the group into , a non-square keeps a transposition in it. For an irreducible cubic this is the whole classification.

Cubics

A cubic becomes the depressed form after , with the same splitting field and discriminant. Its discriminant is

The classification is complete once irreducibility and the square-class of are known.

  • Reducible. A linear-times-quadratic factorization gives group or ; three linear factors give the trivial group.
  • Irreducible, a square. The splitting field has degree ; the group is , and adjoining a single root already splits .
  • Irreducible, not a square. The splitting field has degree ; the group is , and the splitting field is for any root .

Cardano's explicit root formulas are the computational face of this solvability — see solvability by radicals.

Quartics and the resolvent cubic

A quartic depresses to . Its Galois group is one of the five transitive subgroups of , since transitivity is forced by irreducibility.

The five transitive subgroups of that can occur as the Galois group of an irreducible quartic, ordered by containment: and at the top, the Sylow -subgroup , the cyclic , and the normal Klein four-group .

To distinguish them, form the three elements , , . The symmetric group only permutes these three among themselves, so their elementary symmetric functions lie in : they are the roots of the resolvent cubic.

Reading the group off combines its factorization with the square-class of .

The resolvent cubic decides the quartic Galois group: its factorization type plus whether the discriminant is a square selects among , , , , .

The last case is resolved by one more factorization: when exactly one lies in , the group is or , and is the fixed field of . Since is transitive on the roots while is not, the group is exactly when the quartic stays irreducible over .3

Resolvent cubic Discriminant Galois group
irreduciblenot a square
irreduciblea square
splits completelya square
one root in not a square or

Worked example: over

Computing Galois groups by reduction modulo

For an integer polynomial, reducing modulo a prime turns a Galois-group computation into polynomial factorization over a finite field. Take separable, with nonzero discriminant . For any prime , the reduction is separable, and its Galois group over is cyclic, generated by the Frobenius. The cycle type of that generator is dictated by the factorization of .

The Frobenius acts transitively on the roots of each irreducible factor , so it contributes a cycle of length ; assembling the factors gives the full cycle type. Different primes populate the Galois group with different cycle types, and once enough cycle types are collected, the group is often forced.4

For example, has discriminant , so any prime other than is usable.

  • Mod : , giving a cycle. Its cube is a transposition.
  • Mod : is irreducible, giving a -cycle. This also proves irreducible over .

Since a transitive subgroup of containing a transposition and a -cycle is all of , the Galois group of over is . The same method builds polynomials with as Galois group for every , by prescribing factorization types modulo , , that force a transposition and an -cycle.

The fundamental theorem of algebra, group-theoretically

The permutation viewpoint yields a proof that is algebraically closed from two analytic facts: every odd-degree real polynomial has a real root (intermediate value theorem), and every complex number has a complex square root. Given , let be the splitting field of over adjoined with , a Galois extension with group . A Sylow -subgroup has odd index, so its fixed field has odd degree over ; the odd-degree fact forces that fixed field to be , so is a -group. Then is also a -group, and a -group with a nontrivial part would have a subgroup of index , producing a quadratic extension of — impossible. Hence .5 This argument of Artin reduces a theorem of analysis to the structure of -groups, using analysis only for the two starting facts.

Footnotes

  1. Dummit & Foote, Abstract Algebra, §14.6 — the Galois group of a separable polynomial embeds in by its action on the roots, and acts transitively iff the polynomial is irreducible.
  2. Dummit & Foote, Abstract Algebra, §14.6, Theorem 32 — the general polynomial over has Galois group ; over the generic polynomial of degree realizes .
  3. Dummit & Foote, Abstract Algebra, §14.6, Propositions 33–34 and the quartic classification — the discriminant test for , the resolvent cubic , and the case analysis distinguishing .
  4. Dummit & Foote, Abstract Algebra, §14.8, Corollary 41 — for not dividing the discriminant, the Galois group over contains an element with cycle type equal to the degrees of the irreducible factors of ; the worked example has group .
  5. Dummit & Foote, Abstract Algebra, §14.6, Theorem 35 (Fundamental Theorem of Algebra) — Artin's proof via a Sylow -subgroup of the Galois group, using only the intermediate value theorem and complex square roots.

╌╌ END ╌╌