Resolvent (Galois theory)

Last updated April 25, 2024

In Galois theory, a discipline within the field of abstract algebra, a resolvent for a permutation group G is a polynomial whose coefficients depend polynomially on the coefficients of a given polynomial p and has, roughly speaking, a rational root if and only if the Galois group of p is included in G. More exactly, if the Galois group is included in G, then the resolvent has a rational root, and the converse is true if the rational root is a simple root. Resolvents were introduced by Joseph Louis Lagrange and systematically used by Évariste Galois. Nowadays they are still a fundamental tool to compute Galois groups. The simplest examples of resolvents are

$X^{2}-\Delta$ where $\Delta$ is the discriminant, which is a resolvent for the alternating group. In the case of a cubic equation, this resolvent is sometimes called the quadratic resolvent; its roots appear explicitly in the formulas for the roots of a cubic equation.
The cubic resolvent of a quartic equation, which is a resolvent for the dihedral group of 8 elements.
The Cayley resolvent is a resolvent for the maximal resoluble Galois group in degree five. It is a polynomial of degree 6.

These three resolvents have the property of being always separable, which means that, if they have a multiple root, then the polynomial p is not irreducible. It is not known if there is an always separable resolvent for every group of permutations.

For every equation the roots may be expressed in terms of radicals and of a root of a resolvent for a resoluble group, because, the Galois group of the equation over the field generated by this root is resoluble.

Definition

Let $n$ be a positive integer, which will be the degree of the equation that we will consider, and $(X 1, ..., X n)$ an ordered list of indeterminates. According to Vieta's formulas this defines the generic monic polynomial of degree $n$

F(X)=X^{n}+\sum _{i=1}^{n}(-1)^{i}E_{i}X^{n-i}=\prod _{i=1}^{n}(X-X_{i}),

where $E i$ is the $i$ th elementary symmetric polynomial.

The symmetric group $S n$ acts on the $X i$ by permuting them, and this induces an action on the polynomials in the $X i$ . The stabilizer of a given polynomial under this action is generally trivial, but some polynomials have a bigger stabilizer. For example, the stabilizer of an elementary symmetric polynomial is the whole group $S n$ . If the stabilizer is non-trivial, the polynomial is fixed by some non-trivial subgroup $G$ ; it is said to be an invariant of $G$ . Conversely, given a subgroup $G$ of $S n$ , an invariant of $G$ is a resolvent invariant for $G$ if it is not an invariant of any bigger subgroup of $S n$ .^[1]

Finding invariants for a given subgroup $G$ of $S n$ is relatively easy; one can sum the orbit of a monomial under the action of $S n$ . However, it may occur that the resulting polynomial is an invariant for a larger group. For example, consider the case of the subgroup $G$ of $S 4$ of order 4, consisting of $(12)(34)$ , $(13)(24)$ , $(14)(23)$ and the identity (for the notation, see Permutation group). The monomial $X 1 X 2$ gives the invariant $2(X 1 X 2 + X 3 X 4)$ . It is not a resolvent invariant for $G$ , because being invariant by $(12)$ , it is in fact a resolvent invariant for the larger dihedral subgroup $D 4$ : $⟨(12), (1324)⟩$ , and is used to define the resolvent cubic of the quartic equation.

If $P$ is a resolvent invariant for a group $G$ of index $m$ inside $S n$ , then its orbit under $S n$ has order $m$ . Let $P 1, ..., P m$ be the elements of this orbit. Then the polynomial

R_{G}=\prod _{i=1}^{m}(Y-P_{i})

is invariant under $S n$ . Thus, when expanded, its coefficients are polynomials in the $X i$ that are invariant under the action of the symmetry group and thus may be expressed as polynomials in the elementary symmetric polynomials. In other words, $R G$ is an irreducible polynomial in $Y$ whose coefficients are polynomial in the coefficients of $F$ . Having the resolvent invariant as a root, it is called a resolvent (sometimes resolvent equation).

Consider now an irreducible polynomial

f(X)=X^{n}+\sum _{i=1}^{n}a_{i}X^{n-i}=\prod _{i=1}^{n}(X-x_{i}),

with coefficients in a given field $K$ (typically the field of rationals) and roots $x i$ in an algebraically closed field extension. Substituting the $X i$ by the $x i$ and the coefficients of $F$ by those of $f$ in the above, we get a polynomial $R_{G}^{(f)}(Y)$ , also called resolvent or specialized resolvent in case of ambiguity). If the Galois group of $f$ is contained in $G$ , the specialization of the resolvent invariant is invariant by $G$ and is thus a root of $R_{G}^{(f)}(Y)$ that belongs to $K$ (is rational on $K$ ). Conversely, if $R_{G}^{(f)}(Y)$ has a rational root, which is not a multiple root, the Galois group of $f$ is contained in $G$ .

Terminology

There are some variants in the terminology.

Depending on the authors or on the context, resolvent may refer to resolvent invariant instead of to resolvent equation.
A Galois resolvent is a resolvent such that the resolvent invariant is linear in the roots.
The Lagrange resolvent may refer to the linear polynomial $\sum _{i=0}^{n-1}X_{i}\omega ^{i}$ where $\omega$ is a primitive nth root of unity. It is the resolvent invariant of a Galois resolvent for the identity group.
A relative resolvent is defined similarly as a resolvent, but considering only the action of the elements of a given subgroup $H$ of $S n$ , having the property that, if a relative resolvent for a subgroup $G$ of $H$ has a rational simple root and the Galois group of $f$ is contained in $H$ , then the Galois group of $f$ is contained in $G$ . In this context, a usual resolvent is called an absolute resolvent.

Resolvent method

The Galois group of a polynomial of degree $n$ is $S_{n}$ or a proper subgroup of it. If a polynomial is separable and irreducible, then the corresponding Galois group is a transitive subgroup.

Transitive subgroups of $S_{n}$ form a directed graph: one group can be a subgroup of several groups. One resolvent can tell if the Galois group of a polynomial is a (not necessarily proper) subgroup of given group. The resolvent method is just a systematic way to check groups one by one until only one group is possible. This does not mean that every group must be checked: every resolvent can cancel out many possible groups. For example, for degree five polynomials there is never need for a resolvent of $D_{5}$ : resolvents for $A_{5}$ and $M_{20}$ give desired information.

One way is to begin from maximal (transitive) subgroups until the right one is found and then continue with maximal subgroups of that.

Related Research Articles

In mathematics, particularly in algebra, a field extension is a pair of fields $such that the operations of K are those of L restricted to K . In this case, L is an extension field of K and K is a subfield of L . For example, under the usual notions of addition and multiplication, the complex numbers are an extension field of the real numbers; the real numbers are a subfield of the complex numbers.$

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group $defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are such permutation operations, the order of the symmetric group is .$

In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry.

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.

In mathematics, the Abel–Ruffini theorem states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here, general means that the coefficients of the equation are viewed and manipulated as indeterminates.

<span class="mw-page-title-main">Cubic equation</span> Polynomial equation of degree 3

In algebra, a cubic equation in one variable is an equation of the form

In mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane curve can be completed in a projective algebraic plane curve by homogenizing its defining polynomial. Conversely, a projective algebraic plane curve of homogeneous equation $h (x, y, t) = 0$ can be restricted to the affine algebraic plane curve of equation $h (x, y, 1) = 0$ . These two operations are each inverse to the other; therefore, the phrase algebraic plane curve is often used without specifying explicitly whether it is the affine or the projective case that is considered.

In mathematics, a quintic function is a function of the form

<span class="mw-page-title-main">Quartic function</span> Polynomial function of degree four

In algebra, a quartic function is a function of the form

In mathematics, a polynomial P(X) over a given field K is separable if its roots are distinct in an algebraic closure of K, that is, the number of distinct roots is equal to the degree of the polynomial.

In field theory, a branch of algebra, an algebraic field extension $is called a separable extension if for every, the minimal polynomial of over F is a separable polynomial. There is also a more general definition that applies when E is not necessarily algebraic over F . An extension that is not separable is said to be inseparable .$

In mathematics, a Galois extension is an algebraic field extension E/F that is normal and separable; or equivalently, E/F is algebraic, and the field fixed by the automorphism group Aut(E/F) is precisely the base field F. The significance of being a Galois extension is that the extension has a Galois group and obeys the fundamental theorem of Galois theory.

<span class="mw-page-title-main">Tschirnhaus transformation</span> Mathematical term; type of polynomial transformation

In mathematics, a Tschirnhaus transformation, also known as Tschirnhausen transformation, is a type of mapping on polynomials developed by Ehrenfried Walther von Tschirnhaus in 1683.

In Galois theory, the inverse Galois problem concerns whether or not every finite group appears as the Galois group of some Galois extension of the rational numbers $. This problem, first posed in the early 19th century, is unsolved.$

In mathematics, an algebraic function is a function that can be defined as the root of an irreducible polynomial equation. Algebraic functions are often algebraic expressions using a finite number of terms, involving only the algebraic operations addition, subtraction, multiplication, division, and raising to a fractional power. Examples of such functions are:

<span class="mw-page-title-main">Symmetry in mathematics</span>

Symmetry occurs not only in geometry, but also in other branches of mathematics. Symmetry is a type of invariance: the property that a mathematical object remains unchanged under a set of operations or transformations.

In number theory, the classical modular curve is an irreducible plane algebraic curve given by an equation

<span class="mw-page-title-main">Elkies trinomial curves</span>

In number theory, the Elkies trinomial curves are certain hyperelliptic curves constructed by Noam Elkies which have the property that rational points on them correspond to trinomial polynomials giving an extension of Q with particular Galois groups.

<span class="mw-page-title-main">Resolvent cubic</span>

In algebra, a resolvent cubic is one of several distinct, although related, cubic polynomials defined from a monic polynomial of degree four:

In mathematics, Abel's irreducibility theorem, a field theory result described in 1829 by Niels Henrik Abel, asserts that if ƒ(x) is a polynomial over a field F that shares a root with a polynomial g(x) that is irreducible over F, then every root of g(x) is a root of ƒ(x). Equivalently, if ƒ(x) shares at least one root with g(x) then ƒ is divisible evenly by g(x), meaning that ƒ(x) can be factored as g(x)h(x) with h(x) also having coefficients in F.

References

↑ http://www.alexhealy.net/papers/math250a.pdf ^{[ bare URL PDF ]}

Dickson, Leonard E. (1959). Algebraic Theories. New York: Dover Publications Inc. p. ix+276. ISBN 0-486-49573-6.
Girstmair, K. (1983). "On the computation of resolvents and Galois groups". Manuscripta Mathematica. 43 (2–3): 289–307. doi:10.1007/BF01165834. S2CID 123752910.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] ttp://www.alexhealy.net/papers/math250a.pdf ^{[ bare URL PDF ]}

[1]