# Galois theory

In mathematics, **Galois theory**, originally introduced by Évariste Galois, provides a connection between field theory and group theory. This connection, the fundamental theorem of Galois theory, allows reducing certain problems in field theory to group theory, which makes them simpler and easier to understand.

Galois introduced the subject for studying roots of polynomials. This allowed him to characterize the polynomial equations that are **solvable by radicals** in terms of properties of the permutation group of their roots—an equation is *solvable by radicals* if its roots may be expressed by a formula involving only integers, nth roots, and the four basic arithmetic operations. This widely generalizes the Abel–Ruffini theorem, which asserts that a general polynomial of degree at least five cannot be solved by radicals.

Galois theory has been used to solve classic problems including showing that two problems of antiquity cannot be solved as they were stated (doubling the cube and trisecting the angle), and characterizing the regular polygons that are constructible (this characterization was previously given by Gauss, but all known proofs that this characterization is complete require Galois theory).

Galois' work was published by Joseph Liouville fourteen years after his death. The theory took longer to become popular among mathematicians and to be well understood.

Galois theory has been generalized to Galois connections and Grothendieck's Galois theory.

The birth and development of Galois theory was caused by the following question, which was one of the main open mathematical questions until the beginning of 19th century:

Does there exist a formula for the roots of a fifth (or higher) degree polynomial equation in terms of the coefficients of the polynomial, using only the usual algebraic operations (addition, subtraction, multiplication, division) and application of radicals (square roots, cube roots, etc)?

The Abel–Ruffini theorem provides a counterexample proving that there are polynomial equations for which such a formula cannot exist. Galois' theory provides a much more complete answer to this question, by explaining why it *is* possible to solve some equations, including all those of degree four or lower, in the above manner, and why it is not possible for most equations of degree five or higher. Furthermore, it provides a means of determining whether a particular equation can be solved that is both conceptually clear and easily expressed as an algorithm.

Galois' theory also gives a clear insight into questions concerning problems in compass and straightedge construction. It gives an elegant characterization of the ratios of lengths that can be constructed with this method. Using this, it becomes relatively easy to answer such classical problems of geometry as

Galois' theory originated in the study of symmetric functions – the coefficients of a monic polynomial are (up to sign) the elementary symmetric polynomials in the roots. For instance, (*x* – *a*)(*x* – *b*) = *x*^{2} – (*a* + *b*)*x* + *ab*, where 1, *a* + *b* and *ab* are the elementary polynomials of degree 0, 1 and 2 in two variables.

This was first formalized by the 16th-century French mathematician François Viète, in Viète's formulas, for the case of positive real roots. In the opinion of the 18th-century British mathematician Charles Hutton,^{[2]} the expression of coefficients of a polynomial in terms of the roots (not only for positive roots) was first understood by the 17th-century French mathematician Albert Girard; Hutton writes:

...[Girard was] the first person who understood the general doctrine of the formation of the coefficients of the powers from the sum of the roots and their products. He was the first who discovered the rules for summing the powers of the roots of any equation.

In this vein, the discriminant is a symmetric function in the roots that reflects properties of the roots – it is zero if and only if the polynomial has a multiple root, and for quadratic and cubic polynomials it is positive if and only if all roots are real and distinct, and negative if and only if there is a pair of distinct complex conjugate roots. See Discriminant:Nature of the roots for details.

The cubic was first partly solved by the 15–16th-century Italian mathematician Scipione del Ferro, who did not however publish his results; this method, though, only solved one type of cubic equation. This solution was then rediscovered independently in 1535 by Niccolò Fontana Tartaglia, who shared it with Gerolamo Cardano, asking him to not publish it. Cardano then extended this to numerous other cases, using similar arguments; see more details at Cardano's method. After the discovery of del Ferro's work, he felt that Tartaglia's method was no longer secret, and thus he published his solution in his 1545 *Ars Magna.*^{[3]} His student Lodovico Ferrari solved the quartic polynomial; his solution was also included in *Ars Magna.* In this book, however, Cardano did not provide a "general formula" for the solution of a cubic equation, as he had neither complex numbers at his disposal, nor the algebraic notation to be able to describe a general cubic equation. With the benefit of modern notation and complex numbers, the formulae in this book do work in the general case, but Cardano did not know this. It was Rafael Bombelli who managed to understand how to work with complex numbers in order to solve all forms of cubic equation.

A further step was the 1770 paper *Réflexions sur la résolution algébrique des équations* by the French-Italian mathematician Joseph Louis Lagrange, in his method of Lagrange resolvents, where he analyzed Cardano's and Ferrari's solution of cubics and quartics by considering them in terms of *permutations* of the roots, which yielded an auxiliary polynomial of lower degree, providing a unified understanding of the solutions and laying the groundwork for group theory and Galois' theory. Crucially, however, he did not consider *composition* of permutations. Lagrange's method did not extend to quintic equations or higher, because the resolvent had higher degree.

The quintic was almost proven to have no general solutions by radicals by Paolo Ruffini in 1799, whose key insight was to use permutation *groups*, not just a single permutation. His solution contained a gap, which Cauchy considered minor, though this was not patched until the work of the Norwegian mathematician Niels Henrik Abel, who published a proof in 1824, thus establishing the Abel–Ruffini theorem.

While Ruffini and Abel established that the *general* quintic could not be solved, some *particular* quintics can be solved, such as *x*^{5} - 1 = 0, and the precise criterion by which a *given* quintic or higher polynomial could be determined to be solvable or not was given by Évariste Galois, who showed that whether a polynomial was solvable or not was equivalent to whether or not the permutation group of its roots – in modern terms, its Galois group – had a certain structure – in modern terms, whether or not it was a solvable group. This group was always solvable for polynomials of degree four or less, but not always so for polynomials of degree five and greater, which explains why there is no general solution in higher degrees.

In 1830 Galois (at the age of 18) submitted to the Paris Academy of Sciences a memoir on his theory of solvability by radicals; Galois' paper was ultimately rejected in 1831 as being too sketchy and for giving a condition in terms of the roots of the equation instead of its coefficients. Galois then died in a duel in 1832, and his paper, "*Mémoire sur les conditions de résolubilité des équations par radicaux*", remained unpublished until 1846 when it was published by Joseph Liouville accompanied by some of his own explanations.^{[4]} Prior to this publication, Liouville announced Galois' result to the Academy in a speech he gave on 4 July 1843.^{[5]} According to Allan Clark, Galois's characterization "dramatically supersedes the work of Abel and Ruffini."^{[6]}

Galois' theory was notoriously difficult for his contemporaries to understand, especially to the level where they could expand on it. For example, in his 1846 commentary, Liouville completely missed the group-theoretic core of Galois' method.^{[7]} Joseph Alfred Serret who attended some of Liouville's talks, included Galois' theory in his 1866 (third edition) of his textbook *Cours d'algèbre supérieure*. Serret's pupil, Camille Jordan, had an even better understanding reflected in his 1870 book *Traité des substitutions et des équations algébriques*. Outside France, Galois' theory remained more obscure for a longer period. In Britain, Cayley failed to grasp its depth and popular British algebra textbooks did not even mention Galois' theory until well after the turn of the century. In Germany, Kronecker's writings focused more on Abel's result. Dedekind wrote little about Galois' theory, but lectured on it at Göttingen in 1858, showing a very good understanding.^{[8]} Eugen Netto's books of the 1880s, based on Jordan's *Traité*, made Galois theory accessible to a wider German and American audience as did Heinrich Martin Weber's 1895 algebra textbook.^{[9]}

Given a polynomial, it may be that some of the roots are connected by various algebraic equations. For example, it may be that for two of the roots, say *A* and *B*, that *A*^{2} + 5*B*^{3} = 7. The central idea of Galois' theory is to consider permutations (or rearrangements) of the roots such that *any* algebraic equation satisfied by the roots is *still satisfied* after the roots have been permuted. Originally, the theory had been developed for algebraic equations whose coefficients are rational numbers. It extends naturally to equations with coefficients in any field, but this will not be considered in the simple examples below.

These permutations together form a permutation group, also called the Galois group of the polynomial, which is explicitly described in the following examples.

If we exchange *A* and *B* in either of the last two equations we obtain another true statement. For example, the equation *A* + *B* = 4 becomes *B* + *A* = 4. It is more generally true that this holds for *every* possible algebraic relation between *A* and *B* such that all coefficients are rational; that is, in any such relation, swapping *A* and *B* yields another true relation. This results from the theory of symmetric polynomials, which, in this case, may be replaced by formula manipulations involving the binomial theorem.

One might object that *A* and *B* are related by the algebraic equation *A* − *B* − 2√3 = 0, which does not remain true when *A* and *B* are exchanged. However, this relation is not considered here, because it has the coefficient −2√3 which is not rational.

We conclude that the Galois group of the polynomial *x*^{2} − 4*x* + 1 consists of two permutations: the identity permutation which leaves *A* and *B* untouched, and the transposition permutation which exchanges *A* and *B*. It is a cyclic group of order two, and therefore isomorphic to **Z**/2**Z**.

A similar discussion applies to any quadratic polynomial *ax*^{2} + *bx* + *c*, where *a*, *b* and *c* are rational numbers.

We wish to describe the Galois group of this polynomial, again over the field of rational numbers. The polynomial has four roots:

There are 24 possible ways to permute these four roots, but not all of these permutations are members of the Galois group. The members of the Galois group must preserve any algebraic equation with rational coefficients involving *A*, *B*, *C* and *D*.

It follows that, if *φ* is a permutation that belongs to the Galois group, we must have:

This implies that the permutation is well defined by the image of *A*, and that the Galois group has 4 elements, which are:

This implies that the Galois group is isomorphic to the Klein four-group.

In the modern approach, one starts with a field extension *L*/*K* (read "*L* over *K*"), and examines the group of automorphisms of *L* that fix *K*. See the article on Galois groups for further explanation and examples.

The connection between the two approaches is as follows. The coefficients of the polynomial in question should be chosen from the base field *K*. The top field *L* should be the field obtained by adjoining the roots of the polynomial in question to the base field. Any permutation of the roots which respects algebraic equations as described above gives rise to an automorphism of *L*/*K*, and vice versa.

In the first example above, we were studying the extension **Q**(√3)/**Q**, where **Q** is the field of rational numbers, and **Q**(√3) is the field obtained from **Q** by adjoining √3. In the second example, we were studying the extension **Q**(*A*,*B*,*C*,*D*)/**Q**.

There are several advantages to the modern approach over the permutation group approach.

The notion of a solvable group in group theory allows one to determine whether a polynomial is solvable in radicals, depending on whether its Galois group has the property of solvability. In essence, each field extension *L*/*K* corresponds to a factor group in a composition series of the Galois group. If a factor group in the composition series is cyclic of order *n*, and if in the corresponding field extension *L*/*K* the field *K* already contains a primitive *n*th root of unity, then it is a radical extension and the elements of *L* can then be expressed using the *n*th root of some element of *K*.

If all the factor groups in its composition series are cyclic, the Galois group is called *solvable*, and all of the elements of the corresponding field can be found by repeatedly taking roots, products, and sums of elements from the base field (usually **Q**).

One of the great triumphs of Galois Theory was the proof that for every *n* > 4, there exist polynomials of degree *n* which are not solvable by radicals (this was proven independently, using a similar method, by Niels Henrik Abel a few years before, and is the Abel–Ruffini theorem), and a systematic way for testing whether a specific polynomial is solvable by radicals. The Abel–Ruffini theorem results from the fact that for *n* > 4 the symmetric group *S*_{n} contains a simple, noncyclic, normal subgroup, namely the alternating group *A*_{n}.

Van der Waerden^{[10]} cites the polynomial *f*(*x*) = *x*^{5} − *x* − 1. By the rational root theorem this has no rational zeroes. Neither does it have linear factors modulo 2 or 3.

The Galois group of *f*(*x*) modulo 2 is cyclic of order 6, because *f*(*x*) modulo 2 factors into polynomials of orders 2 and 3, (*x*^{2} + *x* + 1)(*x*^{3} + *x*^{2} + 1).

*f*(*x*) modulo 3 has no linear or quadratic factor, and hence is irreducible. Thus its modulo 3 Galois group contains an element of order 5.

It is known^{[11]} that a Galois group modulo a prime is isomorphic to a subgroup of the Galois group over the rationals. A permutation group on 5 objects with elements of orders 6 and 5 must be the symmetric group *S*_{5}, which is therefore the Galois group of *f*(*x*). This is one of the simplest examples of a non-solvable quintic polynomial. According to Serge Lang, Emil Artin was fond of this example.^{[12]}

The *inverse Galois problem* is to find a field extension with a given Galois group.

On the other hand, it is an open problem whether every finite group is the Galois group of a field extension of the field **Q** of the rational numbers. Igor Shafarevich proved that every solvable finite group is the Galois group of some extension of **Q**. Various people have solved the inverse Galois problem for selected non-Abelian simple groups. Existence of solutions has been shown for all but possibly one (Mathieu group *M*_{23}) of the 26 sporadic simple groups. There is even a polynomial with integral coefficients whose Galois group is the Monster group.