Quartic function

From formulasearchengine
Jump to navigation Jump to search
Graph of a polynomial of degree 4, with 3 critical points.

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 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 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.

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.[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).

The Soviet historian I. Y. Depman claimed that even earlier, in 1486, Spanish mathematician Valmes was burned at the stake for claiming to have solved the quartic equation.[2] Inquisitor General Tomás de Torquemada allegedly told Valmes that it was the will of God that such a solution be inaccessible to human understanding.[3] However Beckmann, who popularized this story of Depman in the west, said that it was unreliable and hinted that it may have been invented as Soviet antireligious propaganda.[4] Beckmann's version of this story has been widely copied in several books and internet sites, usually without his reservations and sometimes with fanciful embellishments. Several attempts to find corroborating evidence for this story, or even for the existence of Valmes, have failed.[5]

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.[6]

Applications

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, for example when computing the intersection of two conic sections. Another example is ray-tracing against quartic surfaces such as tori.

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

Nature of the roots

Given the general quartic equation

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

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

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

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

which is 0 if the quartic has two double roots.

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

There are some cases that do not seem to be covered, but they can not occur. For example > 0, Template:Mvar = 0 and Template:Mvar ≤ 0 is not one of the cases. However if > 0 and Template:Mvar = 0 then Template:Mvar > 0 so this combination is not possible.

General formula for roots

Quartic formula written out in full. This formula is too unwieldy for general use, hence other methods or simpler formulas are generally used.[9]

The four roots () for the general quartic equation

with Template:Mvar ≠ 0 are given in the following formula, which is deduced from the one in the section Solving by factoring into quadratics by back changing the variables (see section Converting to a depressed quartic) and using the formulas for the quadratic and cubic equations.

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

and where

with

and

where is the aforementioned discriminant. The mathematical expressions of these last four terms are very similar to those of their cubic counterparts.

Special cases of the formula

If using may prove inconvenient, since its value is now a complex number. However, if all four roots are real, the value of is also real, and it would be simpler to express it with the aid of trigonometric functions, as follows:

where

If and the sign of has to be chosen to have that is one should define as maintaining the sign of

If then one must change the choice of the cubic root in for having This is always possible except if the quartic may be factored into The result is then correct, but misleading hiding the fact that no cubic root is needed in this case. In fact this case may occur only if the numerator of is zero, and the associated depressed quartic is biquadratic; it may thus be solved by the method described below.

If and and thus also 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.

Simpler cases

Reducible quartics

Consider the general quartic

It is reducible 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 quadratic 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

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-palindromic equation

The polynomial

is almost palindromic, as

(it is palindromic if m = 1).

The change of variables in produces the quadratic equation As x2 - xz + m= 0, the quartic equation

may be solved by applying twice the quadratic formula.

Converting to a depressed quartic

For solving purpose, 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

be the general quartic equation we want to solve.

Dividing by a4, provides the equivalent equation

with

Substituting x by gives, after a simple term regrouping, the equation

where

If y1, y2, y3, y4 are the roots of this depressed quartic, then the roots of the original quartic are

Ferrari's solution

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

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)

Then, we introduce a variable y into the factor on the left-hand side by adding to both sides. After regrouping the coefficients of the power of u in the right-hand side, this gives the equation

which is equivalent to the original equation, whichever value is given to y.

As the value of y may be arbitrarily chosen, we will choose it in order to get a perfect square in the right-hand side. This implies that the discriminant in u of this quadratic equation is zero, that is y is a root of the equation

which may be rewritten

The value of y may thus be obtained from the formulas provided in the article Cubic equation.

When y is a root of equation (4), the right-hand side of equation (3) the square of

However, this induces a division by zero if This implies 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 need to choose a root of the cubic equation such that This is always possible unless for the depressed equation x4=0.

Now, if y is a root of the cubic equation such that equation (3) may be rewritten

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

where and denote either + or -. As the two occurrences of must denote the same sign, this leave four possibilities, one for each root.

Therefore the solutions of the original quartic equation are

Solving by factoring into quadratics

One can solve a quartic by factoring it into a product of two quadratics.[10] 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, if p is a square root of a non-zero root of this resolvent (such a non zero root exists except for the quartic x4, which is trivially factored),

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 either the resolvent cubic has a non-zero root which is the square of a rational, or is the square of rational and c=0; this can readily be checked using the rational root test.

Solving by Lagrange resolvent

The symmetric group S4 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 xi, for i from 0 to 3, the four roots of

If we 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 = -a/2, we only need the values for s1, s2 and s3. These are the roots of the polynomial

Substituting the si by their values in term of the xi, this polynomial may be expanded in a polynomial in s whose coefficients are symmetric polynomials in the xi. 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 a=0, this results in the polynomial

This polynomial is of degree six, but only of degree three in s2, and so the corresponding equation is solvable by the method described in the article Cubic function. By substituting the roots in the expression of the xi in terms of the si, 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 xi.

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

then

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

Note that this gives exactly the same formula for the roots as the preceding section.

Solving with algebraic geometry

An alternative solution using algebraic geometry is given in Template:Harv, 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

References

  1. {{#invoke:citation/CS1|citation |CitationClass=citation }}.
  2. {{#invoke:citation/CS1|citation |CitationClass=citation }}
  3. {{#invoke:citation/CS1|citation |CitationClass=book }}
  4. {{#invoke:citation/CS1|citation |CitationClass=book }}
  5. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  6. Stewart, Ian, Galois Theory, Third Edition (Chapman & Hall/CRC Mathematics, 2004)
  7. {{#invoke:Citation/CS1|citation |CitationClass=journal }}
  8. Template:Cite doi
  9. http://planetmath.org/QuarticFormula, PlanetMath, quartic formula, 21st October 2012
  10. {{#invoke:Citation/CS1|citation |CitationClass=journal }}

Further reading

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:citation/CS1|citation

|CitationClass=citation }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

  • {{#invoke:Citation/CS1|citation

|CitationClass=journal }}

External links

Template:Polynomials