Quartic function

File:Polynomialdeg4.svg

Graph of a polynomial of degree 4, with 3 critical points and four real roots (crossings of the x axis) (and thus no complex roots). If one or the other of the local minima were above the x axis, or if the local maximum were below it, or if there were no local maximum and one minimum below the x axis, there would only be two real roots (and two complex roots). If all three local extrema were above the x axis, or if there were no local maximum and one minimum above the x axis, there would be no real root (and four complex roots). The same reasoning applies in reverse to polynomial with a negative quartic coefficient.

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

$f(x)=a{x}^4+b{x}^3+c{x}^2+dx+e,$

where a is nonzero, which is defined by a polynomial of degree four, called a quartic polynomial.

A quartic equation, or equation of the fourth degree, is an equation that equates a quartic polynomial to zero, of the form

$a{x}^4+b{x}^3+c{x}^2+dx+e=0,$

where a ≠ 0. The derivative of a quartic function is a cubic function.

Sometimes the term biquadratic is used instead of quartic, but, usually, biquadratic function refers to a quadratic function of a square (or, equivalently, to the function defined by a quartic polynomial without terms of odd degree), having the form

$f(x)=a{x}^4+c{x}^2+e.$

Since a quartic function is defined by a polynomial of even degree, it has the same infinite limit when the argument goes to positive or negative infinity. If a is positive, then the function increases to positive infinity at both ends; and thus the function has a global minimum. Likewise, if a is negative, it decreases to negative infinity and has a global maximum. In both cases it may or may not have another local maximum and another local minimum.

The degree four (quartic case) is the highest degree such that every polynomial equation can be solved by radicals, according to the Abel–Ruffini theorem.

History

Lodovico Ferrari is credited with the discovery of the solution to the quartic in 1540, but since this solution, like all algebraic solutions of the quartic, requires the solution of a cubic to be found, it could not be published immediately. The solution of the quartic was published together with that of the cubic by Ferrari's mentor Gerolamo Cardano in the book Ars Magna.

The proof that four is the highest degree of a general polynomial for which such solutions can be found was first given in the Abel–Ruffini theorem in 1824, proving that all attempts at solving the higher order polynomials would be futile. The notes left by Évariste Galois prior to dying in a duel in 1832 later led to an elegant complete theory of the roots of polynomials, of which this theorem was one result.

Applications

Each coordinate of the intersection points of two conic sections is a solution of a quartic equation. The same is true for the intersection of a line and a torus. It follows that quartic equations often arise in computational geometry and all related fields such as computer graphics, computer-aided design, computer-aided manufacturing and optics. Here are examples of other geometric problems whose solution involves solving a quartic equation.

In computer-aided manufacturing, the torus is a shape that is commonly associated with the endmill cutter. To calculate its location relative to a triangulated surface, the position of a horizontal torus on the z-axis must be found where it is tangent to a fixed line, and this requires the solution of a general quartic equation to be calculated.

A quartic equation arises also in the process of solving the crossed ladders problem, in which the lengths of two crossed ladders, each based against one wall and leaning against another, are given along with the height at which they cross, and the distance between the walls is to be found.

In optics, Alhazen's problem is "Given a light source and a spherical mirror, find the point on the mirror where the light will be reflected to the eye of an observer." This leads to a quartic equation.

Finding the distance of closest approach of two ellipses involves solving a quartic equation.

The eigenvalues of a 4×4 matrix are the roots of a quartic polynomial which is the characteristic polynomial of the matrix.

The characteristic equation of a fourth-order linear difference equation or differential equation is a quartic equation. An example arises in the Timoshenko-Rayleigh theory of beam bending.

Intersections between spheres, cylinders, or other quadrics can be found using quartic equations.

Inflection points and golden ratio

Letting Template:Mvar and Template:Mvar be the distinct inflection points of the graph of a quartic function, and letting Template:Mvar be the intersection of the inflection secant line Template:Mvar and the quartic, nearer to Template:Mvar than to Template:Mvar, then Template:Mvar divides Template:Mvar into the golden section:

$\frac{FG}{GH}=\frac{1+\sqrt{5}}{2}=\phi (\text{the golden ratio}).$

Moreover, the area of the region between the secant line and the quartic below the secant line equals the area of the region between the secant line and the quartic above the secant line. One of those regions is disjointed into sub-regions of equal area.

Solution

Nature of the roots

Given the general quartic equation

$a{x}^4+b{x}^3+c{x}^2+dx+e=0$

with real coefficients and a ≠ 0 the nature of its roots is mainly determined by the sign of its discriminant

$\begin{array}{rl}\mathrm{\Delta }=& 256a^3{e}^3-192a^{2}bd{e}^2-128a^2{c}^2{e}^2+144a^{2}c{d}^{2}e-27a^2{d}^4\\ & +144a{b}^{2}c{e}^2-6a{b}^2{d}^{2}e-80ab{c}^{2}de+18abc{d}^3+16a{c}^{4}e\\ & -4a{c}^3{d}^2-27b^4{e}^2+18b^{3}cde-4b^3{d}^3-4b^2{c}^{3}e+b^2{c}^2{d}^2\end{array}$

This may be refined by considering the signs of four other polynomials:

$P=8ac-3b^2$

such that Template:Sfrac is the second degree coefficient of the associated depressed quartic (see below);

$R=b^3+8d{a}^2-4abc,$

such that Template:Sfrac is the first degree coefficient of the associated depressed quartic;

${\mathrm{\Delta }}_0=c^2-3bd+12ae,$

which is 0 if the quartic has a triple root; and

$D=64a^{3}e-16a^2{c}^2+16a{b}^{2}c-16a^{2}bd-3b^4$

which is 0 if the quartic has two double roots.

The possible cases for the nature of the roots are as follows:

• If ∆ < 0 then the equation has two distinct real roots and two complex conjugate non-real roots.
• If ∆ > 0 then either the equation's four roots are all real or none is.
  • If Template:Mvar < 0 and Template:Mvar < 0 then all four roots are real and distinct.
  • If Template:Mvar > 0 or Template:Mvar > 0 then there are two pairs of non-real complex conjugate roots.
• If ∆ = 0 then (and only then) the polynomial has a multiple root. Here are the different cases that can occur:
  • If Template:Mvar < 0 and Template:Mvar < 0 and ∆₀ ≠ 0, there are a real double root and two real simple roots.
  • If Template:Mvar > 0 or (Template:Mvar > 0 and (Template:Mvar ≠ 0 or Template:Mvar ≠ 0)), there are a real double root and two complex conjugate roots.
  • If ∆₀ = 0 and Template:Mvar ≠ 0, there are a triple root and a simple root, all real.
  • If Template:Mvar = 0, then:
    • If Template:Mvar < 0, there are two real double roots.
    • If Template:Mvar > 0 and Template:Mvar = 0, there are two complex conjugate double roots.
    • If ∆₀ = 0, all four roots are equal to −Template:Sfrac

There are some cases that do not seem to be covered, but in fact they cannot occur. For example, ∆₀ > 0, Template:Mvar = 0 and Template:Mvar ≤ 0 is not a possible case. In fact, if ∆₀ > 0 and Template:Mvar = 0 then Template:Mvar > 0, since $16a^2{\mathrm{\Delta }}_0=3D+P^2;$ so this combination is not possible.

General formula for roots

File:Quartic Formula.svg

Solution of $x^4+a{x}^3+b{x}^2+cx+d=0$ written out in full. This formula is too unwieldy for general use; hence other methods, or simpler formulas for special cases, are generally used.

The four roots x₁, x₂, x₃, and x₄ for the general quartic equation

$a{x}^4+b{x}^3+c{x}^2+dx+e=0$

with Template:Mvar ≠ 0 are given in the following formula, which is deduced from the one in the section on Ferrari's method by back changing the variables (see Template:Slink) and using the formulas for the quadratic and cubic equations.

$\begin{array}{rl}{x}_{1,2}& =-\frac{b}{4a}-S\pm \frac{1}{2}\sqrt{-4S^2-2p+\frac{q}{S}}\\ x_{3,4}& =-\frac{b}{4a}+S\pm \frac{1}{2}\sqrt{-4S^2-2p-\frac{q}{S}}\end{array}$

where Template:Mvar and Template:Mvar are the coefficients of the second and of the first degree respectively in the associated depressed quartic

$\begin{array}{rl}p& =\frac{8ac-3b^2}{8a^2}\\ q& =\frac{b^3-4abc+8a^{2}d}{8a^3}\end{array}$

and where

$\begin{array}{rl}S& =\frac{1}{2}\sqrt{-\frac{2}{3}p+\frac{1}{3a}(Q+\frac{{\mathrm{\Delta }}_0}{Q})}\\ Q& =\sqrt[3]{\frac{{\mathrm{\Delta }}_1+\sqrt{{\mathrm{\Delta }}_1^2-4{\mathrm{\Delta }}_0^3}}{2}}\end{array}$

(if S = 0 or Q = 0, see Template:Slink, below)

with

$\begin{array}{rl}{\mathrm{\Delta }}_0& =c^2-3bd+12ae\\ {\mathrm{\Delta }}_1& =2c^3-9bcd+27b^{2}e+27a{d}^2-72ace\end{array}$

and

${\mathrm{\Delta }}_1^2-4{\mathrm{\Delta }}_0^3=-27\mathrm{\Delta },$ where $\mathrm{\Delta }$ is the aforementioned discriminant. For the cube root expression for Q, any of the three cube roots in the complex plane can be used, although if one of them is real that is the natural and simplest one to choose. The mathematical expressions of these last four terms are very similar to those of their cubic counterparts.

Special cases of the formula

• If $\mathrm{\Delta }>0,$ the value of $Q$ is a non-real complex number. In this case, either all roots are non-real or they are all real. In the latter case, the value of $S$ is also real, despite being expressed in terms of $Q;$ this is casus irreducibilis of the cubic function extended to the present context of the quartic. One may prefer to express it in a purely real way, by using trigonometric functions, as follows:

$S=\frac{1}{2}\sqrt{-\frac{2}{3}p+\frac{2}{3a}\sqrt{{\mathrm{\Delta }}_0}\cos \frac{\phi }{3}}$

where

$\phi =\arccos \left(\frac{{\mathrm{\Delta }}_1}{2\sqrt{{\mathrm{\Delta }}_0^3}}\right).$

• If $\mathrm{\Delta }\ne 0$ and ${\mathrm{\Delta }}_0=0,$ the sign of $\sqrt{{\mathrm{\Delta }}_1^2-4{\mathrm{\Delta }}_0^3}=\sqrt{{\mathrm{\Delta }}_1^2}$ has to be chosen to have $Q\ne 0,$ that is one should define $\sqrt{{\mathrm{\Delta }}_1^2}$ as ${\mathrm{\Delta }}_1,$ maintaining the sign of ${\mathrm{\Delta }}_1.$
• If $S=0,$ then one must change the choice of the cube root in $Q$ in order to have $S\ne 0.$ This is always possible except if the quartic may be factored into ${(x+\frac{b}{4a})}^4.$ The result is then correct, but misleading because it hides the fact that no cube root is needed in this case. In fact this case may occur only if the numerator of $q$ is zero, in which case the associated depressed quartic is biquadratic; it may thus be solved by the method described below.
• If $\mathrm{\Delta }=0$ and ${\mathrm{\Delta }}_0=0,$ and thus also ${\mathrm{\Delta }}_1=0,$ at least three roots are equal to each other, and the roots are rational functions of the coefficients. The triple root $x_0$ is a common root of the quartic and its second derivative $2(6a{x}^2+3bx+c);$ it is thus also the unique root of the remainder of the Euclidean division of the quartic by its second derivative, which is a linear polynomial. The simple root $x_1$ can be deduced from $x_1+3x_0=-b/a.$
• If $\mathrm{\Delta }=0$ and ${\mathrm{\Delta }}_0\ne 0,$ the above expression for the roots is correct but misleading, hiding the fact that the polynomial is reducible and no cube root is needed to represent the roots.

Simpler cases

Reducible quartics

Consider the general quartic

$Q(x)=a_4{x}^4+a_3{x}^3+a_2{x}^2+a_{1}x+a_0.$

It is reducible if Q(x) = R(x)×S(x), where R(x) and S(x) are non-constant polynomials with rational coefficients (or more generally with coefficients in the same field as the coefficients of Q(x)). Such a factorization will take one of two forms:

$Q(x)=(x-x_1)(b_3{x}^3+b_2{x}^2+b_{1}x+b_0)$

or

$Q(x)=(c_2{x}^2+c_{1}x+c_0)(d_2{x}^2+d_{1}x+d_0).$

In either case, the roots of Q(x) are the roots of the factors, which may be computed using the formulas for the roots of a quadratic function or cubic function.

Detecting the existence of such factorizations can be done using the resolvent cubic of Q(x). It turns out that:

• if we are working over R (that is, if coefficients are restricted to be real numbers) (or, more generally, over some real closed field) then there is always such a factorization;
• if we are working over Q (that is, if coefficients are restricted to be rational numbers) then there is an algorithm to determine whether or not Q(x) is reducible and, if it is, how to express it as a product of polynomials of smaller degree.

In fact, several methods of solving quartic equations (Ferrari's method, Descartes' method, and, to a lesser extent, Euler's method) are based upon finding such factorizations.

Biquadratic equation

If a₃ = a₁ = 0 then the function

$Q(x)=a_4{x}^4+a_2{x}^2+a_0$

is called a biquadratic function; equating it to zero defines a biquadratic equation, which is easy to solve as follows

Let the auxiliary variable z = x². Then Q(x) becomes a quadratic q in z: q(z) = a₄z² + a₂z + a₀. Let z₊ and z₋ be the roots of q(z). Then the roots of the quartic Q(x) are

$\begin{array}{rl}{x}_1& =+\sqrt{z_{+}},\\ x_2& =-\sqrt{z_{+}},\\ x_3& =+\sqrt{z_{-}},\\ x_4& =-\sqrt{z_{-}}.\end{array}$

Quasi-palindromic equation

The polynomial

$P(x)=a_0{x}^4+a_1{x}^3+a_2{x}^2+a_{1}mx+a_0{m}^2$

is almost palindromic, as P(mx) = Template:SfracP(Template:Sfrac) (it is palindromic if m = 1). The change of variables z = x + Template:Sfrac in Template:Sfrac = 0 produces the quadratic equation a₀z² + a₁z + a₂ − 2ma₀ = 0. Since x² − xz + m = 0, the quartic equation P(x) = 0 may be solved by applying the quadratic formula twice.

Solution methods

Converting to a depressed quartic

For solving purposes, it is generally better to convert the quartic into a depressed quartic by the following simple change of variable. All formulas are simpler and some methods work only in this case. The roots of the original quartic are easily recovered from that of the depressed quartic by the reverse change of variable.

Let

$a_4{x}^4+a_3{x}^3+a_2{x}^2+a_{1}x+a_0=0$

be the general quartic equation we want to solve.

Dividing by a₄, provides the equivalent equation x⁴ + bx³ + cx² + dx + e = 0, with b = Template:Sfrac, c = Template:Sfrac, d = Template:Sfrac, and e = Template:Sfrac. Substituting y − Template:Sfrac for Template:Mvar gives, after regrouping the terms, the equation y⁴ + py² + qy + r = 0, where

$\begin{array}{rl}p& =\frac{8c-3b^2}{8}=\frac{8a_2{a}_4-3{a_3}^2}{8{a_4}^2}\\ q& =\frac{b^3-4bc+8d}{8}=\frac{{a_3}^3-4a_2{a}_3{a}_4+8a_1{a_4}^2}{8{a_4}^3}\\ r& =\frac{-3b^4+256e-64bd+16b^{2}c}{256}=\frac{-3{a_3}^4+256a_0{a_4}^3-64a_1{a}_3{a_4}^2+16a_2{a_3}^2{a}_4}{256{a_4}^4}.\end{array}$

If y₀ is a root of this depressed quartic, then y₀ − Template:Sfrac (that is y₀ − Template:Sfrac) is a root of the original quartic and every root of the original quartic can be obtained by this process.

Ferrari's solution

As explained in the preceding section, we may start with the depressed quartic equation

$y^4+p{y}^2+qy+r=0.$

This depressed quartic can be solved by means of a method discovered by Lodovico Ferrari. The depressed equation may be rewritten (this is easily verified by expanding the square and regrouping all terms in the left-hand side) as

${(y^2+\frac{p}{2})}^2=-qy-r+\frac{p^2}{4}.$

Then, we introduce a variable Template:Mvar into the factor on the left-hand side by adding 2y²m + pm + m² to both sides. After regrouping the coefficients of the power of Template:Mvar on the right-hand side, this gives the equation Template:NumBlk which is equivalent to the original equation, whichever value is given to Template:Mvar.

As the value of Template:Mvar may be arbitrarily chosen, we will choose it in order to complete the square on the right-hand side. This implies that the discriminant in Template:Mvar of this quadratic equation is zero, that is Template:Mvar is a root of the equation

$(-q{)}^2-4(2m)(m^2+pm+\frac{p^2}{4}-r)=0,$

which may be rewritten as

This is the resolvent cubic of the quartic equation. The value of Template:Mvar may thus be obtained from Cardano's formula. When Template:Mvar is a root of this equation, the right-hand side of equation (1) is the square

${(\sqrt{2m}y-\frac{q}{2\sqrt{2m}})}^2.$

However, this induces a division by zero if m = 0. This implies q = 0, and thus that the depressed equation is bi-quadratic, and may be solved by an easier method (see above). This was not a problem at the time of Ferrari, when one solved only explicitly given equations with numeric coefficients. For a general formula that is always true, one thus needs to choose a root of the cubic equation such that m ≠ 0. This is always possible except for the depressed equation y⁴ = 0.

Now, if Template:Mvar is a root of the cubic equation such that m ≠ 0, equation (1) becomes

${(y^2+\frac{p}{2}+m)}^2={(y\sqrt{2m}-\frac{q}{2\sqrt{2m}})}^2.$

This equation is of the form M² = N², which can be rearranged as M² − N² = 0 or (M + N)(M − N) = 0. Therefore, equation (1) may be rewritten as

$(y^2+\frac{p}{2}+m+\sqrt{2m}y-\frac{q}{2\sqrt{2m}})(y^2+\frac{p}{2}+m-\sqrt{2m}y+\frac{q}{2\sqrt{2m}})=0.$

This equation is easily solved by applying to each factor the quadratic formula. Solving them we may write the four roots as

$y=\frac{{\pm }_1\sqrt{2m}{\pm }_2\sqrt{-(2p+2m{\pm }_1\frac{\sqrt{2}q}{\sqrt{m}})}}{2},$

where ±₁ and ±₂ denote either + or −. As the two occurrences of ±₁ must denote the same sign, this leaves four possibilities, one for each root.

Therefore, the solutions of the original quartic equation are

$x=-\frac{a_3}{4a_4}+\frac{{\pm }_1\sqrt{2m}{\pm }_2\sqrt{-(2p+2m{\pm }_1\frac{\sqrt{2}q}{\sqrt{m}})}}{2}.$

A comparison with the general formula above shows that

1. REDIRECT Template:Radic

Template:Rcat shell = 2S.

Descartes' solution

Descartes introduced in 1637 the method of finding the roots of a quartic polynomial by factoring it into two quadratic ones. Let

$\begin{array}{rl}{x}^4+b{x}^3+c{x}^2+dx+e& =(x^2+sx+t)(x^2+ux+v)\\ & =x^4+(s+u)x^3+(t+v+su)x^2+(sv+tu)x+tv\end{array}$

By equating coefficients, this results in the following system of equations:

$\{\begin{array}{l}b=s+u\\ c=t+v+su\\ d=sv+tu\\ e=tv\end{array}$

This can be simplified by starting again with the depressed quartic y⁴ + py² + qy + r, which can be obtained by substituting y − b/4 for x. Since the coefficient of y³ is 0, we get s = −u, and:

$\{\begin{array}{l}p+u^2=t+v\\ q=u(t-v)\\ r=tv\end{array}$

One can now eliminate both Template:Mvar and Template:Mvar by doing the following:

$\begin{array}{rl}{u}^2(p+u^2{)}^2-q^2& =u^2(t+v{)}^2-u^2(t-v{)}^2\\ & =u^2[(t+v+(t-v))(t+v-(t-v))]\\ & =u^2(2t)(2v)\\ & =4u^{2}tv\\ & =4u^{2}r\end{array}$

If we set U = u², then solving this equation becomes finding the roots of the resolvent cubic

which is done elsewhere. This resolvent cubic is equivalent to the resolvent cubic given above (equation (1a)), as can be seen by substituting U = 2m.

If u is a square root of a non-zero root of this resolvent (such a non-zero root exists except for the quartic x⁴, which is trivially factored),

$\{\begin{array}{l}s=-u\\ 2t=p+u^2+q/u\\ 2v=p+u^2-q/u\end{array}$

The symmetries in this solution are as follows. There are three roots of the cubic, corresponding to the three ways that a quartic can be factored into two quadratics, and choosing positive or negative values of Template:Mvar for the square root of Template:Mvar merely exchanges the two quadratics with one another.

The above solution shows that a quartic polynomial with rational coefficients and a zero coefficient on the cubic term is factorable into quadratics with rational coefficients if and only if either the resolvent cubic (2) has a non-zero root which is the square of a rational, or p² − 4r is the square of rational and q = 0; this can readily be checked using the rational root test.

Euler's solution

A variant of the previous method is due to Euler. Unlike the previous methods, both of which use some root of the resolvent cubic, Euler's method uses all of them. Consider a depressed quartic x⁴ + px² + qx + r. Observe that, if

• x⁴ + px² + qx + r = (x² + sx + t)(x² − sx + v),
• r₁ and r₂ are the roots of x² + sx + t,
• r₃ and r₄ are the roots of x² − sx + v,

then

• the roots of x⁴ + px² + qx + r are r₁, r₂, r₃, and r₄,
• r₁ + r₂ = −s,
• r₃ + r₄ = s.

Therefore, (r₁ + r₂)(r₃ + r₄) = −s². In other words, −(r₁ + r₂)(r₃ + r₄) is one of the roots of the resolvent cubic (2) and this suggests that the roots of that cubic are equal to −(r₁ + r₂)(r₃ + r₄), −(r₁ + r₃)(r₂ + r₄), and −(r₁ + r₄)(r₂ + r₃). This is indeed true and it follows from Vieta's formulas. It also follows from Vieta's formulas, together with the fact that we are working with a depressed quartic, that r₁ + r₂ + r₃ + r₄ = 0. (Of course, this also follows from the fact that r₁ + r₂ + r₃ + r₄ = −s + s.) Therefore, if α, β, and γ are the roots of the resolvent cubic, then the numbers r₁, r₂, r₃, and r₄ are such that

$\{\begin{array}{l}{r}_1+r_2+r_3+r_4=0\\ (r_1+r_2)(r_3+r_4)=-\alpha \\ (r_1+r_3)(r_2+r_4)=-\beta \\ (r_1+r_4)(r_2+r_3)=-\gamma \text{.}\end{array}$

It is a consequence of the first two equations that r₁ + r₂ is a square root of α and that r₃ + r₄ is the other square root of α. For the same reason,

• r₁ + r₃ is a square root of β,
• r₂ + r₄ is the other square root of β,
• r₁ + r₄ is a square root of γ,
• r₂ + r₃ is the other square root of γ.

Therefore, the numbers r₁, r₂, r₃, and r₄ are such that

$\{\begin{array}{l}{r}_1+r_2+r_3+r_4=0\\ r_1+r_2=\sqrt{\alpha }\\ r_1+r_3=\sqrt{\beta }\\ r_1+r_4=\sqrt{\gamma }\text{;}\end{array}$

the sign of the square roots will be dealt with below. The only solution of this system is:

$\{\begin{array}{l}{r}_1=\frac{\sqrt{\alpha }+\sqrt{\beta }+\sqrt{\gamma }}{2}\\ r_2=\frac{\sqrt{\alpha }-\sqrt{\beta }-\sqrt{\gamma }}{2}\\ r_3=\frac{-\sqrt{\alpha }+\sqrt{\beta }-\sqrt{\gamma }}{2}\\ r_4=\frac{-\sqrt{\alpha }-\sqrt{\beta }+\sqrt{\gamma }}{2}\text{.}\end{array}$

Since, in general, there are two choices for each square root, it might look as if this provides 8 (= 2³) choices for the set {r₁, r₂, r₃, r₄}, but, in fact, it provides no more than 2 such choices, because the consequence of replacing one of the square roots by the symmetric one is that the set {r₁, r₂, r₃, r₄} becomes the set {−r₁, −r₂, −r₃, −r₄}.

In order to determine the right sign of the square roots, one simply chooses some square root for each of the numbers α, β, and γ and uses them to compute the numbers r₁, r₂, r₃, and r₄ from the previous equalities. Then, one computes the number

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

Template:Rcat shell. Since α, β, and γ are the roots of (2), it is a consequence of Vieta's formulas that their product is equal to q² and therefore that

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

Template:Rcat shell = ±q. But a straightforward computation shows that

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

1. REDIRECT Template:Radic

Template:Rcat shell = r₁r₂r₃ + r₁r₂r₄ + r₁r₃r₄ + r₂r₃r₄. If this number is −q, then the choice of the square roots was a good one (again, by Vieta's formulas); otherwise, the roots of the polynomial will be −r₁, −r₂, −r₃, and −r₄, which are the numbers obtained if one of the square roots is replaced by the symmetric one (or, what amounts to the same thing, if each of the three square roots is replaced by the symmetric one).

This argument suggests another way of choosing the square roots:

• pick any square root

1. REDIRECT Template:Radic

Template:Rcat shell of α and any square root

1. REDIRECT Template:Radic

Template:Rcat shell of β;

• define

1. REDIRECT Template:Radic

Template:Rcat shell as $-\frac{q}{\sqrt{\alpha }\sqrt{\beta }}$. Of course, this will make no sense if α or β is equal to 0, but 0 is a root of (2) only when q = 0, that is, only when we are dealing with a biquadratic equation, in which case there is a much simpler approach.

Solving by Lagrange resolvent

The symmetric group S₄ on four elements has the Klein four-group as a normal subgroup. This suggests using a Template:Visible anchor whose roots may be variously described as a discrete Fourier transform or a Hadamard matrix transform of the roots; see Lagrange resolvents for the general method. Denote by x_i, for i from 0 to 3, the four roots of x⁴ + bx³ + cx² + dx + e. If we set

$\begin{array}{rl}{s}_0& =\frac{1}{2}(x_0+x_1+x_2+x_3),\\ s_1& =\frac{1}{2}(x_0-x_1+x_2-x_3),\\ s_2& =\frac{1}{2}(x_0+x_1-x_2-x_3),\\ s_3& =\frac{1}{2}(x_0-x_1-x_2+x_3),\end{array}$

then since the transformation is an involution we may express the roots in terms of the four s_i in exactly the same way. Since we know the value s₀ = −Template:Sfrac, we only need the values for s₁, s₂ and s₃. These are the roots of the polynomial

$(s^2-{s_1}^2)(s^2-{s_2}^2)(s^2-{s_3}^2).$

Substituting the s_i by their values in term of the x_i, this polynomial may be expanded in a polynomial in s whose coefficients are symmetric polynomials in the x_i. By the fundamental theorem of symmetric polynomials, these coefficients may be expressed as polynomials in the coefficients of the monic quartic. If, for simplification, we suppose that the quartic is depressed, that is b = 0, this results in the polynomial Template:NumBlk This polynomial is of degree six, but only of degree three in s², and so the corresponding equation is solvable by the method described in the article about cubic function. By substituting the roots in the expression of the x_i in terms of the s_i, we obtain expression for the roots. In fact we obtain, apparently, several expressions, depending on the numbering of the roots of the cubic polynomial and of the signs given to their square roots. All these different expressions may be deduced from one of them by simply changing the numbering of the x_i.

These expressions are unnecessarily complicated, involving the cubic roots of unity, which can be avoided as follows. If s is any non-zero root of (3), and if we set

$\begin{array}{rl}{F}_1(x)& =x^2+sx+\frac{c}{2}+\frac{s^2}{2}-\frac{d}{2s}\\ F_2(x)& =x^2-sx+\frac{c}{2}+\frac{s^2}{2}+\frac{d}{2s}\end{array}$

then

$F_1(x)\times F_2(x)=x^4+c{x}^2+dx+e.$

We therefore can solve the quartic by solving for s and then solving for the roots of the two factors using the quadratic formula.

This gives exactly the same formula for the roots as the one provided by Descartes' method.

Solving with algebraic geometry

There is an alternative solution using algebraic geometry In brief, one interprets the roots as the intersection of two quadratic curves, then finds the three reducible quadratic curves (pairs of lines) that pass through these points (this corresponds to the resolvent cubic, the pairs of lines being the Lagrange resolvents), and then use these linear equations to solve the quadratic.

The four roots of the depressed quartic x⁴ + px² + qx + r = 0 may also be expressed as the Template:Mvar coordinates of the intersections of the two quadratic equations y² + py + qx + r = 0 and y − x² = 0 i.e., using the substitution y = x² that two quadratics intersect in four points is an instance of Bézout's theorem. Explicitly, the four points are P_i ≔ (x_i, x_i²) for the four roots x_i of the quartic.

These four points are not collinear because they lie on the irreducible quadratic y = x² and thus there is a 1-parameter family of quadratics (a pencil of curves) passing through these points. Writing the projectivization of the two quadratics as quadratic forms in three variables:

$\begin{array}{rl}{F}_1(X,Y,Z)& :=Y^2+pYZ+qXZ+r{Z}^2,\\ F_2(X,Y,Z)& :=YZ-X^2\end{array}$

the pencil is given by the forms λF₁ + μF₂ for any point [λ, μ] in the projective line — in other words, where λ and μ are not both zero, and multiplying a quadratic form by a constant does not change its quadratic curve of zeros.

This pencil contains three reducible quadratics, each corresponding to a pair of lines, each passing through two of the four points, which can be done $(\genfrac{}{}{0ex}{}{4}{2})$ = 6 different ways. Denote these Q₁ = L₁₂ + L₃₄, Q₂ = L₁₃ + L₂₄, and Q₃ = L₁₄ + L₂₃. Given any two of these, their intersection has exactly the four points.

The reducible quadratics, in turn, may be determined by expressing the quadratic form λF₁ + μF₂ as a 3×3 matrix: reducible quadratics correspond to this matrix being singular, which is equivalent to its determinant being zero, and the determinant is a homogeneous degree three polynomial in λ and μ and corresponds to the resolvent cubic.

See also

• Template:Annotated link
• Template:Annotated link
• Template:Annotated link
• Template:Annotated link

Notes

^α For the purposes of this article, e is used as a variable as opposed to its conventional use as Euler's number (except when otherwise specified).

External links

• Quartic formula as four single equations at PlanetMath.
• Ferrari's achievement