Galois group of a polynomial: Difference between revisions

From Groupprops
No edit summary
No edit summary
 
(3 intermediate revisions by the same user not shown)
Line 2: Line 2:


{{termrelatedto|Galois theory}}
{{termrelatedto|Galois theory}}
{{basicdef in|Galois theory}}


==Definition==
==Definition==
Line 10: Line 12:


==Examples==
==Examples==
===Particular examples===


* The polynomial <math>f(X) = (X^2-2)(X^2-3) \in \Q[X]</math> has splitting field <math>\Q(\sqrt{2}, \sqrt{3})</math> over <math>\Q</math>. It can be shown that this field extension has Galois group isomorphic to the [[Klein four-group]].
* The polynomial <math>f(X) = (X^2-2)(X^2-3) \in \Q[X]</math> has splitting field <math>\Q(\sqrt{2}, \sqrt{3})</math> over <math>\Q</math>. It can be shown that this field extension has Galois group isomorphic to the [[Klein four-group]].


* The polynomial <math>X^n-X-1 \in \Q[X]</math> has Galois group the [[symmetric group]] on <math>n</math> letters.
* The polynomial <math>X^n-X-1 \in \Q[X]</math> has Galois group the [[symmetric group]] on <math>n</math> letters.
===Over finite fields===


* Let <math>p</math> be a prime, and <math>\mathbb{F}_p</math> denote the [[finite field]] with <math>p</math> elements. Let <math>f \in \mathbb{F}_p[X]</math> be a separable polynomial that factors into irreducible factors of degrees <math>n_1, \dots n_r</math>, and denote the degree of <math>f</math> as <math>n := \sum_i n_i</math>. Then the Galois group of <math>f</math> over <math>\mathbb{F}_p</math> viewed as a subgroup of the symmetric group <math>S_n</math> is generated by a single permutation with cycle type <math>(n_1, \dots, n_r)</math>. Thus, it is [[cyclic group|cyclic]] of order <math>\mathrm{lcm}(n_1, \dots, n_r)</math>.
* Let <math>p</math> be a prime, and <math>\mathbb{F}_p</math> denote the [[finite field]] with <math>p</math> elements. Let <math>f \in \mathbb{F}_p[X]</math> be a separable polynomial that factors into irreducible factors of degrees <math>n_1, \dots n_r</math>, and denote the degree of <math>f</math> as <math>n := \sum_i n_i</math>. Then the Galois group of <math>f</math> over <math>\mathbb{F}_p</math> viewed as a subgroup of the symmetric group <math>S_n</math> is generated by a single permutation with cycle type <math>(n_1, \dots, n_r)</math>. Thus, it is [[cyclic group|cyclic]] of order <math>\mathrm{lcm}(n_1, \dots, n_r)</math>.
Line 19: Line 25:
{{fillin}}
{{fillin}}


==Applications and results==
==Results helping with the computation of a Galois group==
 
One has that a separable polynomial of degree <math>n</math> has its Galois group a subgroup of the [[symmetric group]] <math>S_n</math>.
 
* The Galois group of a polynomial is a [[Transitive subgroup of symmetric group|transitive subgroup]] of <math>S_n</math> if and only if the polynomial is irreducible.
 
* It is natural to ask whether or not the Galois group is a subgroup of the [[alternating group]] <math>A_n</math>, i.e. whether it contains an odd permutation or not. The following result turns out to hold: suppose <math>f</math> is a separable polynomial of degree <math>n</math> in a field <math>K</math>, with the characteristic of <math>K</math> not equal to <math>2</math>. Then <math>\mathrm{Gal}(f/K)</math> is a subgroup of <math>A_n</math> if and only if the discriminant of <math>f</math> is a square in <math>K</math>.
 
* '''"Reduction mod p":''' Suppose we want to find the Galois group of a polynomial <math>f \in \mathbb{Z}[X]</math> over <math>\mathbb{Q}</math>. For <math>p</math> a prime number, we may define <math>\overline{f} \in \mathbb{F}_p[X]</math> to be the polynomial in the finite field with <math>p</math> elements such that <math>f \equiv \overline{f}</math> modulo <math>p</math>. Then, it turns out that <math>\mathrm{Gal}(\overline{f}/\mathbb{F}_p) \leq \mathrm{Gal}(f/\mathbb{Q})</math>. This turns out to be quite helpful - [[Galois group of a polynomial#Over finite fields|as remarked in the examples section on this page]], the Galois group of a polynomial over the field <math>\mathbb{F}_p</math> has a particular structure (a cyclic group generated by a permutation with a cycle type corresponding to the irreducible factors' degrees) allowing for its computation. One may thus iterate through the primes to gain information on what cycle types are present in the Galois group over <math>\mathbb{Q}</math>, which may determine what the group is.
 
==Applications==


===Insolvability of the quintic===
===Insolvability of the quintic===

Latest revision as of 09:43, 12 June 2024

This article defines a natural context where a group occurs, or is associated, with another algebraic, topological, analytic or discrete structure
View other occurrences of groups

This term is related to: Galois theory
View other terms related to Galois theory | View facts related to Galois theory


This article gives a basic definition in the following area: Galois theory
View other basic definitions in Galois theory |View terms related to Galois theory |View facts related to Galois theory

Definition

For a field, let be a separable polynomial with coefficients in , and a splitting field for over . Then the Galois group (in the sense of field extensions) of over acting on the roots of determines an injective group homomorphism . (Here, is the symmetric group on letters).

Then the image of is a subgroup of , and is termed the Galois group of the polynomial .

Examples

Particular examples

  • The polynomial has splitting field over . It can be shown that this field extension has Galois group isomorphic to the Klein four-group.
  • The polynomial has Galois group the symmetric group on letters.

Over finite fields

  • Let be a prime, and denote the finite field with elements. Let be a separable polynomial that factors into irreducible factors of degrees , and denote the degree of as . Then the Galois group of over viewed as a subgroup of the symmetric group is generated by a single permutation with cycle type . Thus, it is cyclic of order .

PLACEHOLDER FOR INFORMATION TO BE FILLED IN: [SHOW MORE]

Results helping with the computation of a Galois group

One has that a separable polynomial of degree has its Galois group a subgroup of the symmetric group .

  • The Galois group of a polynomial is a transitive subgroup of if and only if the polynomial is irreducible.
  • It is natural to ask whether or not the Galois group is a subgroup of the alternating group , i.e. whether it contains an odd permutation or not. The following result turns out to hold: suppose is a separable polynomial of degree in a field , with the characteristic of not equal to . Then is a subgroup of if and only if the discriminant of is a square in .
  • "Reduction mod p": Suppose we want to find the Galois group of a polynomial over . For a prime number, we may define to be the polynomial in the finite field with elements such that modulo . Then, it turns out that . This turns out to be quite helpful - as remarked in the examples section on this page, the Galois group of a polynomial over the field has a particular structure (a cyclic group generated by a permutation with a cycle type corresponding to the irreducible factors' degrees) allowing for its computation. One may thus iterate through the primes to gain information on what cycle types are present in the Galois group over , which may determine what the group is.

Applications

Insolvability of the quintic

It can be shown that an irreducible polynomial is solvable in terms of radicals if and only if its Galois group is a solvable group. But there exist degree five polynomials with Galois group alternating group:A5 and symmetric group:S5, which are not solvable groups. Thus in general, the quintic is not solvable in radicals.

A particular polynomial over that is not solvable in terms of radicals is , which has Galois group symmetric group:S5.

Every subgroup of symmetric group:S4 is solvable, which tells us that the quadratic formula, the cubic formula and the quartic formula do indeed exist, i.e. such polynomials are always solvable in radicals.

See also