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
Contents
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 (X1, ..., Xn) an ordered list of indeterminates. This defines the generic polynomial of degree n
where Ei is the ith elementary symmetric polynomial.
The symmetric group Sn acts on the Xi by permuting them, and this induces an action on the polynomials in the Xi. 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 Sn. If the stabilizer is non-trivial, the polynomial is fixed by some non-trivial subgroup G; it is said an invariant of G. Conversely, given a subgroup G of Sn, an invariant of G is a resolvent invariant for G if it is not an invariant of any bigger subgroup of Sn.
Finding invariants for a given subgroup G of Sn is relatively easy; one can sum the orbit of a monomial under the action of Sn. However it may occur that the resulting polynomial is an invariant for a larger group. For example, let us consider the case of the subgroup G of S4 of order 4, consisting of (12)(34), (13)(24), (14)(23) and the identity (for the notation, see Permutation group). The monomial X1X2 gives the invariant 2(X1X2 + X3X4). It is not a resolvent invariant for G, as being invariant by (12), in fact, it is a resolvent invariant for the dihedral subgroup ⟨(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, then its orbit under Sn has order m. Let P1, ..., Pm be the elements of this orbit. Then the polynomial
is invariant under Sn. Thus, when expanded, its coefficients are polynomials in the Xi 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, RG 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).
Let us consider now an irreducible polynomial
with coefficients in a given field K (typically the field of rationals) and roots xi in an algebraically closed field extension. Substituting the Xi by the xi and the coefficients of F by those of f in what precedes, we get a polynomial
Terminology
There are some variants in the terminology.
Resolvent method
The Galois group of a polynomial of degree
Transitive subgroups of
One way is to begin from maximal (transitive) subgroups until the right one is found and then continue with maximal subgroups of that.