Quartic function
In mathematics, a quartic function, is a function of the form
where a is nonzero, which is defined by a polynomial of degree four, called quartic polynomial.
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
A quartic equation, or equation of the fourth degree, is an equation consisting in equating to zero a quartic polynomial, of the form
where a ≠ 0.
The derivative of a quartic function is a cubic function.
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 sides; 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 have, but not always, 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.
Contents
|
History [edit]
Lodovico Ferrari is attributed 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 couldn't be published immediately.[1] The solution of the quartic was published together with that of the cubic by Ferrari's mentor Gerolamo Cardano in the book Ars Magna (1545).
It is reported that even earlier, in 1486, Spanish mathematician Paolo Valmes was burned at the stake for claiming to have solved the quartic equation. Inquisitor General Tomás de Torquemada allegedly told him that it was the will of God that such a solution be inaccessible to human understanding.[2] However, attempts to find corroborating evidence for this story, or for the existence of Paolo Valmes, have not succeeded.[3]
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.[4]
Applications [edit]
Polynomials of high degrees often appear in problems involving optimization, and sometimes these polynomials happen to be quartics, but this is a coincidence.
Quartics often arise in computer graphics and during ray-tracing against surfaces such as quadric or tori surfaces, which are the next level beyond the sphere and developable surfaces.
Another frequent generator of quartics is the intersection of two ellipses.
In computer-aided manufacturing, the torus is a common shape 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. Over 10% of the computational time in a CAM system can be consumed simply calculating the solution to millions of quartic equations.
Solving a quartic equation [edit]
Nature of the roots [edit]
The discriminant of the quartic
is
There are three possible cases:
-
- If
the equation's four roots are either all real or all complex. - If
then either the polynomial has a multiple rational root, or it is the square of a quadratic polynomial. - If
the equation has two real roots and two complex roots.
- If
General formula for roots [edit]
The four roots (
) for the general quartic equation
with
are equal to those of the corresponding monic polynomial
where
The roots in terms of these four coefficients are given by:
where
and where
(see below)
with
and
where
is the aforementioned discriminant. The mathematical expressions of these last four terms are almost identical with those of their cubic counterparts.
Special cases [edit]
If
and
, the sign of
has to be chosen to have
, that is one should define
as
, maintaining the sign of
.
If
and
, at least three roots are equal, and the roots are rational functions of the coefficients
If
and
, the above expression for the roots is correct but misleading, hiding the fact that the polynomial is reducible and no cubic root is needed to represent the roots.
Reducible quartics [edit]
Consider the general quartic
It is irreducible if Q=RS, where R and S are non-constant polynomials with rational coefficients (or more generally with coefficients in the same field as the coefficients of Q). There are two ways to write such a factorization: Either
or
In either case, the roots of Q are the roots of the factors, which may be computed by solving quadric or cubic equations.
Detecting such factorizations can be done by using the factor function of every computer algebra system. But, in many cases, it may be done by hand-written computation. In the preceding section, we have already seen that the polynomial is always reducible if its discriminant
is zero (this is true for polynomials of every degree).
A very special case of the first case of factorization is when a0=0. This implies that x1=0 is a first root, b3=a4, b2=a3, b1=a2, b0=a1, and the other roots may be computed by solving a cubic equation.
If
then
and we have a factorization of the first kind with x1=1. Similarly, if
then
and we have a factorization of the first kind with x1=-1.
Once a root x1 is known, the second factor of the factorization of the first kind is the quotient of the Euclidean division of Q by x-x1. It is
If
are small integers a factorization of the first kind is easy to detect: if
with p and q coprime integers, then q divides evenly a4, and p divides evenly a0. Thus, computing
for every possible values of p and q allows to find the rational roots, if any.
In the case of two quadratic factors or of large integer coefficients, the factorization is harder to compute, and, in general, it is better to use the factor function of a computer algebra system (see polynomial factorization for a description of the algorithms that are involved).
Biquadratic equations [edit]
If
then the biquadratic function
defines a biquadratic equation, which is easy to solve.
Let
Then Q becomes a quadratic q in 
Let
and
be the roots of q. Then the roots of our quartic Q are
Quasi-symmetric equations [edit]
Steps:
- Divide by x 2.
- Use variable change z = x + m/x.
Converting to a depressed quartic [edit]
For solving purpose, it is generally better to convert the quartic into 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 recoverd from that of the depressed quartic by the reverse change of variable.
Let
be the general quartic equation we want to solve.
Dividing by a4, and substituting x by
gives, after a simple term regrouping, the equation
where
If y1, y2, y3, y4 are the root of this depressed quartic, then the roots of the original quartic are 
The general case, along Ferrari's lines [edit]
As explained in the preceding section, we may start with a depressed quartic equation
Ferrari's solution [edit]
The depressed quartic can be solved by means of a method discovered by Lodovico Ferrari. Once the depressed quartic has been obtained, the next step is to add the valid identity
to equation (1), yielding
The effect has been to fold up the u4 term into a perfect square: (u2 + α)2. The second term, αu2 did not disappear, but its sign has changed and it has been moved to the right side.
The next step is to insert a variable y into the perfect square on the left side of equation (2), and a corresponding 2y into the coefficient of u2 in the right side. To accomplish these insertions, the following valid formulas will be added to equation (2),
and
These two formulas, added together, produce
which added to equation (2) produces
This is equivalent to
The objective now is to choose a value for y such that the right side of equation (3) becomes a perfect square. This can be done by letting the discriminant of the quadratic function become zero. To explain this, first expand a perfect square so that it equals a quadratic function:
The quadratic function on the right side has three coefficients. It can be verified that squaring the second coefficient and then subtracting four times the product of the first and third coefficients yields zero:
Therefore to make the right side of equation (3) into a perfect square, the following equation must be solved:
Multiply the binomial with the polynomial,
Divide both sides by −4, and move the −β2/4 to the right,
This is a cubic equation for y. Divide both sides by 2,
Conversion of the nested cubic into a depressed cubic [edit]
Equation (4) is a cubic equation nested within the quartic equation. It must be solved to solve the quartic. To solve the cubic, first transform it into a depressed cubic by means of the substitution
Equation (4) becomes
Expand the powers of the binomials,
Distribute, collect like powers of v, and cancel out the pair of v2 terms,
This is a depressed cubic equation.
Relabel its coefficients,
The depressed cubic now is
Solving the nested depressed cubic [edit]
The solutions (any solution will do, so pick any of the three complex roots) of equation (5) are computed as (see Cubic equation)
where
and V is computed according to the two defining equations
and
, so
Folding the second perfect square [edit]
With the value for y given by equation (6), it is now known that the right side of equation (3) is a perfect square of the form
![(s^2)u^2+(2st)u+(t^2) = (s^2)\left(u - {-(2st) \over 2(s^2)}\right)^2=\left[\sqrt{(s^2)}\left(u - {-(2st) \over 2(s^2)}\right)\right]^2,](//upload.wikimedia.org/math/2/f/8/2f87c090a98031bbc2aa251c3d0a30fd.png)
- (This is correct for both signs of square root, as long as the same sign is taken for both square roots. A ± is redundant, as it would be absorbed by another ± a few equations further down this page.)
so that it can be folded:
.
- Note: If β ≠ 0 then α + 2y ≠ 0. If β = 0 then this would be a biquadratic equation, which we solved earlier.
Therefore equation (3) becomes
.
Equation (7) has a pair of folded perfect squares, one on each side of the equation. The two perfect squares balance each other.
If two squares are equal, then the sides of the two squares are also equal, as shown by:
.
Collecting like powers of u produces
.
- Note: The subscript s of
and
is to note that they are dependent.
- Note: The subscript s of
Equation (8) is a quadratic equation for u. Its solution is
Simplifying, one gets
This is the solution of the depressed quartic, therefore the solutions of the original quartic equation are
- Remember: The two
come from the same place in equation (7'), and should both have the same sign, while the sign of
is independent.
- Remember: The two
Summary of Ferrari's method [edit]
Given the quartic equation
its solution can be found by means of the following calculations:
If
then
Otherwise, continue with
(either sign of the square root will do)
(there are 3 complex roots, any one of them will do)
As stated above, Cardano credited Ferrari as the first to discover one of these labyrinthine solutions. The equation he solved was:
which was already in depressed form. It has a pair of solutions that can be found with the set of formulas shown above.
Ferrari's solution in the special case of real coefficients [edit]
If the coefficients of the quartic equation are real then the nested depressed cubic equation (5) also has real coefficients, thus it has at least one real root.
Furthermore the cubic function
where P and Q are given by (5) has the properties that
and
where α and β are given by (1).
This means that (5) has a real root greater than
, and therefore that (4) has a real root greater than
.
Using this root the term
in (8) is always real, which ensures that the two quadratic equations (8) have real coefficients.[6]
Obtaining alternative solutions by factoring out complex conjugate solutions [edit]
It could happen that one only obtained one solution through the seven formulae above, because not all four sign patterns are tried for four solutions, and the solution obtained is complex. It may also be the case that one is only looking for a real solution. Let x1 denote the complex solution. If all the original coefficients A, B, C, D and E are real — which should be the case when one desires only real solutions — then there is another complex solution x2, which is the complex conjugate of x1. If the other two roots are denoted as x3 and x4 then the quartic equation can be expressed as
but this quartic equation is equivalent to the product of two quadratic equations:
and
Since
then
Let
so that equation (9) becomes
Also let there be (unknown) variables w and v such that equation (10) becomes
Multiplying equations (11) and (12) produces
Comparing equation (13) to the original quartic equation, it can be seen that
and
Therefore
Equation (12) can be solved for x yielding
These two solutions are the desired real solutions if real solutions exist.
Alternative methods [edit]
Factorization into quadratics [edit]
One can solve a quartic by factoring it into a product of two quadratics.[7] Let
By equating coefficients, this results in the following set of simultaneous equations:
This can be simplified by starting again with a depressed quartic where
, which can be obtained by substituting
for
, then
, and:
It's now easy to eliminate both
and
by doing the following:
If we set
, then this equation turns into the resolvent cubic equation
which is solved elsewhere. Then:
The symmetries in this solution are easy to see. 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
for the square root of
merely exchanges the two quadratics with one another.
The above solution shows that the quartic polynomial with a zero coefficient on the cubic term is factorable into quadratics with rational coefficients if and only if the resolvent cubic
has a root which is the square of a rational; this can readily be checked using the rational root test.
Galois theory and factorization [edit]
The symmetric group S4 on four elements has the Klein four-group as a normal subgroup. This suggests using a resolvent cubic 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. Suppose ri for i from 0 to 3 are roots of
If we now set
then since the transformation is an involution we may express the roots in terms of the four si in exactly the same way. Since we know the value s0 = -b/2, we really only need the values for s1, s2 and s3. These we may find by expanding the polynomial
which if we make the simplifying assumption that b=0, is equal to
This polynomial is of degree six, but only of degree three in z2, and so the corresponding equation is solvable. By trial we can determine which three roots are the correct ones, and hence find the solutions of the quartic.
We can remove any requirement for trial by using a root of the same resolvent polynomial for factoring; if w is any root of (3), and if
then
We therefore can solve the quartic by solving for w and then solving for the roots of the two factors using the quadratic formula.
Algebraic geometry [edit]
An alternative solution using algebraic geometry is given in (Faucette 1996), and proceeds as follows (more detailed discussion in reference). 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
may also be expressed as the x coordinates of the intersections of the two quadratic equations
i.e., using the substitution
that two quadratics intersect in four points is an instance of Bézout's theorem. Explicitly, the four points are
for the four roots
of the quartic.
These four points are not collinear because they lie on the irreducible quadratic
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:
the pencil is given by the forms
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
different ways. Denote these
Given any two of these, their intersection is exactly the four points.
The reducible quadratics, in turn, may be determined by expressing the quadratic form
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 [edit]
References [edit]
- ^ O'Connor, John J.; Robertson, Edmund F., "Lodovico Ferrari", MacTutor History of Mathematics archive, University of St Andrews.
- ^ P. Beckmann (1971). A history of π. Macmillan. p. 80.
- ^ P. Zoll (1989). "Letter to the Editor". American Mathematical Monthly 96 (8): 709–710. JSTOR 2324719.
- ^ Stewart, Ian, Galois Theory, Third Edition (Chapman & Hall/CRC Mathematics, 2004)
- ^ http://planetmath.org/QuarticFormula, PlanetMath, quartic formula, 21st October 2012
- ^ Carstensen, Jens (1981). Komplekse tal (in Danish) (First ed.). Systime. ISBN 87-87454-71-8.
- ^ Brookfield, G. (2007). "Factoring quartic polynomials: A lost art". Mathematics Magazine 80 (1): 67–70.
Further reading [edit]
- Cardano, Gerolamo (1545), Ars magna or The Rules of Algebra, Dover (published 1993), ISBN 0-486-67811-3
- Faucette, William Mark (1996), "A Geometric Interpretation of the Solution of the General Quartic Polynomial", The American Mathematical Monthly 103 (1): 51–57, doi:10.2307/2975214, CiteSeerX: 10.1.1.111.5574
- Nickalls, R. W. D. (2009). "The quartic equation: invariants and Euler's solution revealed". Mathematical Gazette 93: 66–75.
- Carpenter, W. (1966). "On the solution of the real quartic". Mathematics Magazine 39: 28–30.
- Shmakov, S.L. (2011). "A Universal Method of Solving Quartic Equations". International Journal of Pure and Applied Mathematics 71: 251–259.
External links [edit]
- Quartic formula as four single equations at PlanetMath
- Ferrari's achievement
- Calculator for solving Quartics (also solves Cubics and Quadratics)
|
||||||||




the equation's four roots are either all real or all complex.
the equation has two real roots and two complex roots.






(see 

where 
































![U=\sqrt[3]{-{Q\over 2}\pm \sqrt{{Q^{2}\over 4}+{P^{3}\over 27}}}](http://upload.wikimedia.org/math/b/6/f/b6f987f2ebbf25dc28f768e5138e1363.png)
![V=\begin{cases}
-\frac{P}{3U}&\text{ if }U\ne 0\text{ and }\\
-\sqrt[3]{Q}&\text{ if }U=0\ .
\end{cases}](http://upload.wikimedia.org/math/a/6/f/a6f2ffb5408554862e1e2da2dd6192f3.png)
![(s^2)u^2+(2st)u+(t^2) = (s^2)\left(u - {-(2st) \over 2(s^2)}\right)^2=\left[\sqrt{(s^2)}\left(u - {-(2st) \over 2(s^2)}\right)\right]^2,](http://upload.wikimedia.org/math/2/f/8/2f87c090a98031bbc2aa251c3d0a30fd.png)
.
.
.
.
and
is to note that they are dependent.

is independent.






![U = \sqrt[3]{R},](http://upload.wikimedia.org/math/e/3/3/e3322597c0d374ee70164f962ea53329.png)
![y = \begin{cases}
- {5 \over 6} \alpha + U - \frac{P}{3U} & \text{if }U\ne 0\\
-{5\over 6} \alpha - \sqrt[3]{Q} & \text{if }U=0
\end{cases}](http://upload.wikimedia.org/math/1/e/5/1e516f83855ee18458fa3f0055dcb000.png)



and



![\begin{matrix}
(x-x_1)(x-x_2)&=&x^2-(x_1+x_1^\star)x+x_1x_1^\star\qquad\qquad\qquad\quad
\\
&=&x^2-2\,\mathrm{Re}(x_1)x+[\mathrm{Re}(x_1)]^2+[\mathrm{Im}(x_1)]^2.
\end{matrix}](http://upload.wikimedia.org/math/4/4/a/44a486189cc52f48c6d3487926282b6d.png)

![b = \left[ \mathrm{Re}( x_1) \right]^{2} + \left[ \mathrm{Im}(x_1) \right]^{2}](http://upload.wikimedia.org/math/9/c/0/9c0f7d72f03a6d901ce5a55d7afdbcb0.png)








![v = {E \over A b} = {E \over A \left(
[ \mathrm{Re}(x_1) ]^2 + [ \mathrm{Im}(x_1) ]^2 \right) }.](http://upload.wikimedia.org/math/3/4/7/347b3acbe99d2f51ec309a6dfbc503f0.png)















