Resolvent cubic

From testwiki
Jump to navigation Jump to search

Template:Short description

Graph of the polynomial function Template:Math (in green) together with the graph of its resolvent cubic Template:Math (in red). The roots of both polynomials are visible too.

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

P(x)=x4+a3x3+a2x2+a1x+a0.

In each case:

  • The coefficients of the resolvent cubic can be obtained from the coefficients of Template:Math using only sums, subtractions and multiplications.
  • Knowing the roots of the resolvent cubic of Template:Math is useful for finding the roots of Template:Math itself. Hence the name “resolvent cubic”.
  • The polynomial Template:Math has a multiple root if and only if its resolvent cubic has a multiple root.

Definitions

Suppose that the coefficients of Template:Math belong to a field Template:Math whose characteristic is different from Template:Math. In other words, we are working in a field in which Template:Math. Whenever roots of Template:Math are mentioned, they belong to some extension Template:Math of Template:Math such that Template:Math factors into linear factors in Template:Math. If Template:Math is the field Template:Math of rational numbers, then Template:Mvar can be the field Template:Math of complex numbers or the field Template:Overline of algebraic numbers.

In some cases, the concept of resolvent cubic is defined only when Template:Math is a quartic in depressed form—that is, when Template:Math.

Note that the fourth and fifth definitions below also make sense and that the relationship between these resolvent cubics and Template:Math are still valid if the characteristic of Template:Mvar is equal to Template:Math.

First definition

Suppose that Template:Math is a depressed quartic—that is, that Template:Math. A possible definition of the resolvent cubic of Template:Math is:[1]

R1(y)=8y3+8a2y2+(2a228a0)ya12.

The origin of this definition lies in applying Ferrari's method to find the roots of Template:Math. To be more precise:

P(x)=0x4+a2x2=a1xa0(x2+a22)2=a1xa0+a224.

Add a new unknown, Template:Mvar, to Template:Math. Now you have:

(x2+a22+y)2=a1xa0+a224+2x2y+a2y+y2=2yx2a1xa0+a224+a2y+y2.

If this expression is a square, it can only be the square of

2yxa122y.

But the equality

(2yxa122y)2=2yx2a1xa0+a224+a2y+y2

is equivalent to

a128y=a0+a224+a2y+y2,

and this is the same thing as the assertion that Template:Math = 0.

If Template:Math is a root of Template:Math, then it is a consequence of the computations made above that the roots of Template:Math are the roots of the polynomial

x22y0x+a22+y0+a122y0

together with the roots of the polynomial

x2+2y0x+a22+y0a122y0.

Of course, this makes no sense if Template:Math, but since the constant term of Template:Math is Template:Math, Template:Math is a root of Template:Math if and only if Template:Math, and in this case the roots of Template:Math can be found using the quadratic formula.

Second definition

Another possible definition[1] (still supposing that Template:Math is a depressed quartic) is

R2(y)=8y34a2y28a0y+4a2a0a12

The origin of this definition is similar to the previous one. This time, we start by doing:

P(x)=0x4=a2x2a1xa0(x2+y)2=a2x2a1xa0+2yx2+y2

and a computation similar to the previous one shows that this last expression is a square if and only if

8y34a2y28a0y+4a2a0a12=0.

A simple computation shows that

R2(y+a22)=R1(y).

Third definition

Another possible definition[2][3] (again, supposing that Template:Math is a depressed quartic) is

R3(y)=y3+2a2y2+(a224a0)ya12.

The origin of this definition lies in another method of solving quartic equations, namely Descartes' method. If you try to find the roots of Template:Math by expressing it as a product of two monic quadratic polynomials Template:Math and Template:Math, then

P(x)=(x2+αx+β)(x2αx+γ){β+γα2=a2α(β+γ)=a1βγ=a0.

If there is a solution of this system with Template:Math (note that if Template:Math, then this is automatically true for any solution), the previous system is equivalent to

{β+γ=a2+α2β+γ=a1αβγ=a0.

It is a consequence of the first two equations that then

β=12(a2+α2a1α)

and

γ=12(a2+α2+a1α).

After replacing, in the third equation, Template:Math and Template:Math by these values one gets that

(a2+α2)2a12α2=4a0,

and this is equivalent to the assertion that Template:Math is a root of Template:Math. So, again, knowing the roots of Template:Math helps to determine the roots of Template:Math.

Note that

R3(y)=R1(y2).

Fourth definition

Still another possible definition is[4]

R4(y)=y3a2y2+(a1a34a0)y+4a0a2a12a0a32.

In fact, if the roots of Template:Math are Template:Math, and Template:Math, then

R4(y)=(y(α1α2+α3α4))(y(α1α3+α2α4))(y(α1α4+α2α3)),

a fact the follows from Vieta's formulas. In other words, R4(y) is the monic polynomial whose roots are Template:Math, Template:Math, and Template:Math.

It is easy to see that

α1α2+α3α4(α1α3+α2α4)=(α1α4)(α2α3),
α1α3+α2α4(α1α4+α2α3)=(α1α2)(α3α4),
α1α2+α3α4(α1α4+α2α3)=(α1α3)(α2α4).

Therefore, Template:Math has a multiple root if and only if Template:Math has a multiple root. More precisely, Template:Math and Template:Math have the same discriminant.

One should note that if Template:Math is a depressed polynomial, then

R4(y)=y3a2y24a0y+4a0a2a12=R2(y2).

Fifth definition

Yet another definition is[5][6]

R5(y)=y32a2y2+(a22+a3a14a0)y+a12a3a2a1+a32a0.

If, as above, the roots of Template:Math are Template:Math, and Template:Math, then

R5(y)=(y(α1+α2)(α3+α4))(y(α1+α3)(α2+α4))(y(α1+α4)(α2+α3)),

again as a consequence of Vieta's formulas. In other words, Template:Math is the monic polynomial whose roots are Template:Math, Template:Math, and Template:Math.

It is easy to see that

(α1+α2)(α3+α4)(α1+α3)(α2+α4)=(α1α4)(α2α3),
(α1+α2)(α3+α4)(α1+α4)(α2+α3)=(α1α3)(α2α4),
(α1+α3)(α2+α4)(α1+α4)(α2+α3)=(α1α2)(α3α4).

Therefore, as it happens with Template:Math, Template:Math has a multiple root if and only if Template:Math has a multiple root. More precisely, Template:Math and Template:Math have the same discriminant. This is also a consequence of the fact that Template:Math = Template:Math.

Note that if Template:Math is a depressed polynomial, then

R5(y)=y32a2y2+(a224a0)y+a12=R3(y)=R1(y2).

Applications

Solving quartic equations

It was explained above how Template:Math, Template:Math, and Template:Math can be used to find the roots of Template:Math if this polynomial is depressed. In the general case, one simply has to find the roots of the depressed polynomial Template:Math. For each root Template:Math of this polynomial, Template:Math is a root of Template:Math.

Factoring quartic polynomials

If a quartic polynomial Template:Math is reducible in Template:Math, then it is the product of two quadratic polynomials or the product of a linear polynomial by a cubic polynomial. This second possibility occurs if and only if Template:Math has a root in Template:Math. In order to determine whether or not Template:Math can be expressed as the product of two quadratic polynomials, let us assume, for simplicity, that Template:Math is a depressed polynomial. Then it was seen above that if the resolvent cubic Template:Math has a non-null root of the form Template:Math, for some Template:Math, then such a decomposition exists.

This can be used to prove that, in Template:Math, every quartic polynomial without real roots can be expressed as the product of two quadratic polynomials. Let Template:Math be such a polynomial. We can assume without loss of generality that Template:Math is monic. We can also assume without loss of generality that it is a reduced polynomial, because Template:Math can be expressed as the product of two quadratic polynomials if and only if Template:Math can and this polynomial is a reduced one. Then Template:Math = Template:Math. There are two cases:

P(x)=(x2+a2+a224a02)(x2+a2a224a02).

More generally, if Template:Math is a real closed field, then every quartic polynomial without roots in Template:Math can be expressed as the product of two quadratic polynomials in Template:Math. Indeed, this statement can be expressed in first-order logic and any such statement that holds for Template:Math also holds for any real closed field.

A similar approach can be used to get an algorithm[2] to determine whether or not a quartic polynomial Template:Math is reducible and, if it is, how to express it as a product of polynomials of smaller degree. Again, we will suppose that Template:Math is monic and depressed. Then Template:Math is reducible if and only if at least one of the following conditions holds:

Indeed:

Galois groups of irreducible quartic polynomials

The resolvent cubic of an irreducible quartic polynomial Template:Math can be used to determine its Galois group Template:Math; that is, the Galois group of the splitting field of Template:Math. Let Template:Mvar be the degree over Template:Mvar of the splitting field of the resolvent cubic (it can be either Template:Math or Template:Math; they have the same splitting field). Then the group Template:Mvar is a subgroup of the symmetric group Template:Math. More precisely:[4]

See also

Template:Clear

References

Template:Reflist