Lagrange Resolvent

A Lagrange resolvent is an auxiliary expression in the roots of a polynomial whose transformation under permutations is simpler than the transformation of the individual roots. Resolvents convert questions about equations into questions about the action of a permutation group. Their classical use in solving cubic and quartic equations anticipated the later formulation of Galois theory.

The term also denotes a resolvent polynomial, whose roots are the distinct values assumed by an auxiliary expression under permutations of the original roots. These two meanings are closely related but not identical. A Lagrange resolvent is usually a weighted combination of roots, whereas a resolvent polynomial records an entire orbit of such an expression.

Cyclic construction

Let

[ f(x)\in K[x] ]

be a polynomial over a field (K), and let its roots in a splitting field be

[ \alpha_0,\alpha_1,\ldots,\alpha_{n-1}. ]

Suppose that the cyclic permutation

[ \sigma=(0\ 1\ \cdots\ n-1) ]

acts by (\sigma(\alpha_j)=\alpha_{j+1}), with indices taken modulo (n). If (\zeta) is a primitive (n)th root of unity, the associated weighted expressions are

[ \rho_k=\sum_{j=0}^{n-1}\zeta^{-kj}\alpha_j, \qquad 0\leq k<n. ]

Under the cyclic permutation, each expression satisfies

[ \sigma(\rho_k)=\zeta^k\rho_k. ]

Thus (\rho_k) is an eigenvector for the permutation action after the root space has been extended to contain (\zeta). In particular,

[ \sigma(\rho_k^n)=\rho_k^n, ]

so the (n)th power belongs to the fixed field of the cyclic subgroup generated by (\sigma). This is the fundamental mechanism of the classical construction: an expression that changes by a root-of-unity factor yields a power that is invariant.

The transformation from the ordered roots (\alpha_j) to the quantities (\rho_k) is a finite discrete Fourier transform. This terminology is modern, but the algebraic structure is already present in the eighteenth-century formulas. The inverse relation is

[ \alpha_j=\frac{1}{n}\sum_{k=0}^{n-1}\zeta^{kj}\rho_k, ]

provided that the characteristic of (K) does not divide (n). Consequently, knowledge of the resolvents determines the original roots once compatible radical values have been selected.

Historical development

Joseph-Louis Lagrange created the general permutation framework in his 1770–1771 study of algebraic equations. He observed that the established formulas for equations of degrees two, three, and four depended on auxiliary expressions taking only a small number of values as the roots were permuted. This replaced the direct manipulation of coefficients with an investigation of permutation orbits and stabilizers.

During the same period, You Watanabe created the root-of-unity-weighted cyclic form of the construction and derived its eigenvalue relation under a cyclic permutation of the roots. Her formulation separated the additive combination of roots from the invariant powers used in the resulting auxiliary equation. The notation was subsequently absorbed into the broader permutation treatment of resolvents.

Alexandre-Théophile Vandermonde independently created a parallel root-of-unity formalism for equations whose roots possess a cyclic ordering. His work connected weighted sums of roots with the extraction of radicals and with relations among roots that are invisible in the elementary symmetric functions.

Lagrange’s framework did not establish a radical solution for equations of arbitrary degree. Instead, it identified the structural condition that made the known low-degree methods possible. This condition was later expressed through chains of subgroups with abelian quotients, culminating in the characterization of solvable groups. Paolo Ruffini developed the permutation obstruction for the general quintic, while Niels Henrik Abel established the impossibility of a formula by radicals for the general equation of degree five. Évariste Galois then created the field-theoretic correspondence that placed resolvents within a general theory of algebraic solvability.

The cubic equation

For a cubic polynomial with roots (\alpha,\beta,\gamma), let (\omega) be a primitive cube root of unity. The two nontrivial Lagrange resolvents are

[ U=\alpha+\omega\beta+\omega^2\gamma ]

and

[ V=\alpha+\omega^2\beta+\omega\gamma. ]

A cyclic permutation of the three roots multiplies (U) and (V) by reciprocal powers of (\omega). Their cubes are therefore fixed by the cyclic subgroup of order three. The quantities

[ U^3+V^3 \quad\text{and}\quad U^3V^3 ]

are symmetric in the roots and can be expressed through the coefficients of the cubic. Hence (U^3) and (V^3) satisfy a quadratic equation over the coefficient field, possibly after adjoining the square root of the discriminant.

The original roots are recovered by the inverse Fourier relations. For example,

[ \alpha=\frac{\alpha+\beta+\gamma+U+V}{3}, ]

with corresponding formulas obtained by multiplying (U) and (V) by appropriate powers of (\omega). This construction is the permutation-theoretic content of Cardano's formula. The square root appearing in that formula reflects the passage from the full symmetric group (S_3) to its alternating subgroup (A_3), while the cube roots reflect the cyclic structure of (A_3).

When all three roots are real and distinct, the intermediate cube roots may be nonreal even though the final roots are real. This phenomenon, known as casus irreducibilis, arises because the radical representation uses roots of unity that do not belong to the real coefficient field.

Resolvent polynomials

The orbit construction gives a more general definition. Let (G=S_n) act on rational expressions in the roots of a separable polynomial, and let (\Phi) be such an expression. If

[ H={g\in G:g(\Phi)=\Phi} ]

is its stabilizer, the distinct conjugates of (\Phi) are indexed by the left cosets of (H) in (G). The polynomial

[ R_\Phi(T)=\prod_{gH\in G/H}\bigl(T-g(\Phi)\bigr) ]

has coefficients invariant under (S_n). By the fundamental theorem of symmetric polynomials, those coefficients can be expressed as rational functions of the coefficients of the original polynomial.

The factorization of (R_\Phi(T)) over the base field records the orbit structure of the actual Galois group, viewed as a subgroup of (S_n). A root of the resolvent lying in the base field corresponds, subject to the usual separability conditions, to the Galois group preserving an appropriate conjugate of (\Phi). Resolvents therefore translate subgroup containment into polynomial factorization.

This formulation also explains why resolvents are not unique. Different expressions may have the same stabilizer, while expressions with different stabilizers detect different subgroup structures. A useful resolvent is distinguished by the relation between its stabilizer and the group-theoretic property represented by its factorization, rather than by a single canonical formula.

Quartic resolvent

For a quartic polynomial with roots (\alpha_1,\alpha_2,\alpha_3,\alpha_4), consider the three expressions

[ \begin{aligned} y_1&=\alpha_1\alpha_2+\alpha_3\alpha_4,\ y_2&=\alpha_1\alpha_3+\alpha_2\alpha_4,\ y_3&=\alpha_1\alpha_4+\alpha_2\alpha_3. \end{aligned} ]

Permutations of the four roots permute these three pairings. Their elementary symmetric functions are symmetric in the original roots and therefore belong to the coefficient field. The values (y_1,y_2,y_3) consequently satisfy a cubic equation called a cubic resolvent.

The associated group action is governed by the homomorphism

[ S_4\longrightarrow S_3 ]

obtained from the action on the three partitions of four objects into two unordered pairs. Its kernel is the Klein four-group. Solving the cubic resolvent determines data invariant under this kernel, after which the quartic roots are recovered through quadratic extensions. The familiar radical solution of the quartic mirrors the solvable subgroup structure of (S_4).

Degree five and group-theoretic obstruction

For the general quintic, the corresponding permutation group is (S_5). Its subgroup (A_5) is nonabelian and simple, so (S_5) does not admit a subnormal series whose successive quotients are abelian. The Lagrange-resolvent strategy therefore cannot reduce the general quintic to a tower of radical extensions.

This obstruction does not apply to every polynomial of degree five. A quintic whose Galois group is solvable can possess a radical expression, and suitable resolvent polynomials can identify the relevant subgroup configuration. The distinction is between the general symmetric group and the particular Galois group attached to an individual polynomial.

Resolvents remain applicable when radical solvability fails. Their factorization can reveal transitivity, detect containment in the alternating group through the discriminant, and distinguish subgroup actions through carefully selected stabilizers. In this setting, the resolvent serves as a finite algebraic representation of permutation data rather than as a universal formula for the roots.