Cubic equation: Difference between revisions

From testwiki
Jump to navigation Jump to search
imported>D.Lazard
Reverted 1 edit by 2001:861:2D00:F930:8658:FD3A:FDAE:EF4D (talk): Wrong change; the formulas where correct
 
(No difference)

Latest revision as of 16:47, 28 February 2025

Template:Short description Template:About Template:Distinguish

Graph of a cubic function with 3 real roots (where the curve crosses the horizontal axis at Template:Math). The case shown has two critical points. Here the function is f(x)=14(x3+3x26x8)=14(x2)(x+1)(x+4) and therefore the three real roots are 2, −1 and −4.

In algebra, a cubic equation in one variable is an equation of the form ax3+bx2+cx+d=0 in which Template:Mvar is not zero.

The solutions of this equation are called roots of the cubic function defined by the left-hand side of the equation. If all of the coefficients Template:Mvar, Template:Mvar, Template:Mvar, and Template:Mvar of the cubic equation are real numbers, then it has at least one real root (this is true for all odd-degree polynomial functions). All of the roots of the cubic equation can be found by the following means:

The coefficients do not need to be real numbers. Much of what is covered below is valid for coefficients in any field with characteristic other than 2 and 3. The solutions of the cubic equation do not necessarily belong to the same field as the coefficients. For example, some cubic equations with rational coefficients have roots that are irrational (and even non-real) complex numbers.

History

Cubic equations were known to the ancient Babylonians, Greeks, Chinese, Indians, and Egyptians.[1][2][3] Babylonian (20th to 16th centuries BC) cuneiform tablets have been found with tables for calculating cubes and cube roots.[4][5] The Babylonians could have used the tables to solve cubic equations, but no evidence exists to confirm that they did.[6] The problem of doubling the cube involves the simplest and oldest studied cubic equation, and one for which the ancient Egyptians did not believe a solution existed.[7] In the 5th century BC, Hippocrates reduced this problem to that of finding two mean proportionals between one line and another of twice its length, but could not solve this with a compass and straightedge construction,[8] a task which is now known to be impossible. Methods for solving cubic equations appear in The Nine Chapters on the Mathematical Art, a Chinese mathematical text compiled around the 2nd century BC and commented on by Liu Hui in the 3rd century.[2]

In the 3rd century AD, the Greek mathematician Diophantus found integer or rational solutions for some bivariate cubic equations (Diophantine equations).[3][9] Hippocrates, Menaechmus and Archimedes are believed to have come close to solving the problem of doubling the cube using intersecting conic sections,[8] though historians such as Reviel Netz dispute whether the Greeks were thinking about cubic equations or just problems that can lead to cubic equations. Some others like T. L. Heath, who translated all of Archimedes's works, disagree, putting forward evidence that Archimedes really solved cubic equations using intersections of two conics, but also discussed the conditions where the roots are 0, 1 or 2.[10]

Graph of the cubic function f(x) = 2x3 − 3x2 − 3x + 2 = (x + 1) (2x − 1) (x − 2)

In the 7th century, the Tang dynasty astronomer mathematician Wang Xiaotong in his mathematical treatise titled Jigu Suanjing systematically established and solved numerically 25 cubic equations of the form Template:Math, 23 of them with Template:Math, and two of them with Template:Math.[11]

In the 11th century, the Persian poet-mathematician, Omar Khayyam (1048–1131), made significant progress in the theory of cubic equations. In an early paper, he discovered that a cubic equation can have more than one solution and stated that it cannot be solved using compass and straightedge constructions. He also found a geometric solution.[12]Template:Efn In his later work, the Treatise on Demonstration of Problems of Algebra, he wrote a complete classification of cubic equations with general geometric solutions found by means of intersecting conic sections.[13][14] Khayyam made an attempt to come up with an algebraic formula for extracting cubic roots. He wrote:

“We have tried to express these roots by algebra but have failed. It may be, however, that men who come after us will succeed.”[15]

In the 12th century, the Indian mathematician Bhaskara II attempted the solution of cubic equations without general success. However, he gave one example of a cubic equation: Template:Math.[16] In the 12th century, another Persian mathematician, Sharaf al-Dīn al-Tūsī (1135–1213), wrote the Al-Muʿādalāt (Treatise on Equations), which dealt with eight types of cubic equations with positive solutions and five types of cubic equations which may not have positive solutions. He used what would later be known as the Horner–Ruffini method to numerically approximate the root of a cubic equation. He also used the concepts of maxima and minima of curves in order to solve cubic equations which may not have positive solutions.[17] He understood the importance of the discriminant of the cubic equation to find algebraic solutions to certain types of cubic equations.[18]

In his book Flos, Leonardo de Pisa, also known as Fibonacci (1170–1250), was able to closely approximate the positive solution to the cubic equation Template:Math. Writing in Babylonian numerals he gave the result as 1,22,7,42,33,4,40 (equivalent to 1 + 22/60 + 7/602 + 42/603 + 33/604 + 4/605 + 40/606), which has a relative error of about 10−9.[19]

In the early 16th century, the Italian mathematician Scipione del Ferro (1465–1526) found a method for solving a class of cubic equations, namely those of the form Template:Math. In fact, all cubic equations can be reduced to this form if one allows Template:Mvar and Template:Mvar to be negative, but negative numbers were not known to him at that time. Del Ferro kept his achievement secret until just before his death, when he told his student Antonio Fior about it.

Niccolò Fontana Tartaglia

In 1535, Niccolò Tartaglia (1500–1557) received two problems in cubic equations from Zuanne da Coi and announced that he could solve them. He was soon challenged by Fior, which led to a famous contest between the two. Each contestant had to put up a certain amount of money and to propose a number of problems for his rival to solve. Whoever solved more problems within 30 days would get all the money. Tartaglia received questions in the form Template:Math, for which he had worked out a general method. Fior received questions in the form Template:Math, which proved to be too difficult for him to solve, and Tartaglia won the contest.

Later, Tartaglia was persuaded by Gerolamo Cardano (1501–1576) to reveal his secret for solving cubic equations. In 1539, Tartaglia did so only on the condition that Cardano would never reveal it and that if he did write a book about cubics, he would give Tartaglia time to publish. Some years later, Cardano learned about del Ferro's prior work and published del Ferro's method in his book Ars Magna in 1545, meaning Cardano gave Tartaglia six years to publish his results (with credit given to Tartaglia for an independent solution).

Cardano's promise to Tartaglia said that he would not publish Tartaglia's work, and Cardano felt he was publishing del Ferro's, so as to get around the promise. Nevertheless, this led to a challenge to Cardano from Tartaglia, which Cardano denied. The challenge was eventually accepted by Cardano's student Lodovico Ferrari (1522–1565). Ferrari did better than Tartaglia in the competition, and Tartaglia lost both his prestige and his income.[20]

Cardano noticed that Tartaglia's method sometimes required him to extract the square root of a negative number. He even included a calculation with these complex numbers in Ars Magna, but he did not really understand it. Rafael Bombelli studied this issue in detail[21] and is therefore often considered as the discoverer of complex numbers.

François Viète (1540–1603) independently derived the trigonometric solution for the cubic with three real roots, and René Descartes (1596–1650) extended the work of Viète.[22]

Factorization

If the coefficients of a cubic equation are rational numbers, one can obtain an equivalent equation with integer coefficients, by multiplying all coefficients by a common multiple of their denominators. Such an equation ax3+bx2+cx+d=0, with integer coefficients, is said to be reducible if the polynomial on the left-hand side is the product of polynomials of lower degrees. By Gauss's lemma, if the equation is reducible, one can suppose that the factors have integer coefficients.

Finding the roots of a reducible cubic equation is easier than solving the general case. In fact, if the equation is reducible, one of the factors must have degree one, and thus have the form qxp, with Template:Mvar and Template:Mvar being coprime integers. The rational root test allows finding Template:Mvar and Template:Mvar by examining a finite number of cases (because Template:Mvar must be a divisor of Template:Mvar, and Template:Mvar must be a divisor of Template:Mvar).

Thus, one root is x1=pq, and the other roots are the roots of the other factor, which can be found by polynomial long division. This other factor is aqx2+bq+apq2x+cq2+bpq+ap2q3. (The coefficients seem not to be integers, but must be integers if Template:Tmath is a root.)

Then, the other roots are the roots of this quadratic polynomial and can be found by using the quadratic formula.

Depressed cubicTemplate:Anchor

Cubics of the form t3+pt+q are said to be depressed. They are much simpler than general cubics, but are fundamental, because the study of any cubic may be reduced by a simple change of variable to that of a depressed cubic.

Let ax3+bx2+cx+d=0 be a cubic equation. The change of variable x=tb3a gives a cubic (in Template:Mvar) that has no term in Template:Math.

After dividing by Template:Mvar one gets the depressed cubic equation t3+pt+q=0, with t=x+b3ap=3acb23a2q=2b39abc+27a2d27a3.

The roots x1,x2,x3 of the original equation are related to the roots t1,t2,t3 of the depressed equation by the relations xi=tib3a, for i=1,2,3.

Discriminant and nature of the roots

The nature (real or not, distinct or not) of the roots of a cubic can be determined without computing them explicitly, by using the discriminant.

Discriminant

The discriminant of a polynomial is a function of its coefficients that is zero if and only if the polynomial has a multiple root, or, if it is divisible by the square of a non-constant polynomial. In other words, the discriminant is nonzero if and only if the polynomial is square-free.

If Template:Math are the three roots (not necessarily distinct nor real) of the cubic ax3+bx2+cx+d, then the discriminant is a4(r1r2)2(r1r3)2(r2r3)2.

The discriminant of the depressed cubic t3+pt+q is (4p3+27q2).

The discriminant of the general cubic ax3+bx2+cx+d is 18abcd4b3d+b2c24ac327a2d2. It is the product of a4 and the discriminant of the corresponding depressed cubic. Using the formula relating the general cubic and the associated depressed cubic, this implies that the discriminant of the general cubic can be written as 4(b23ac)3(2b39abc+27a2d)227a2.

It follows that one of these two discriminants is zero if and only if the other is also zero, and, if the coefficients are real, the two discriminants have the same sign. In summary, the same information can be deduced from either one of these two discriminants.

To prove the preceding formulas, one can use Vieta's formulas to express everything as polynomials in Template:Math, and Template:Mvar. The proof then results in the verification of the equality of two polynomials.

Nature of the roots

If the coefficients of a polynomial are real numbers, and its discriminant Δ is not zero, there are two cases:

  • If Δ>0, the cubic has three distinct real roots
  • If Δ<0, the cubic has one real root and two non-real complex conjugate roots.

This can be proved as follows. First, if Template:Mvar is a root of a polynomial with real coefficients, then its complex conjugate is also a root. So the non-real roots, if any, occur as pairs of complex conjugate roots. As a cubic polynomial has three roots (not necessarily distinct) by the fundamental theorem of algebra, at least one root must be real.

As stated above, if Template:Math are the three roots of the cubic ax3+bx2+cx+d, then the discriminant is Δ=a4(r1r2)2(r1r3)2(r2r3)2

If the three roots are real and distinct, the discriminant is a product of positive reals, that is Δ>0.

If only one root, say Template:Math, is real, then Template:Math and Template:Math are complex conjugates, which implies that Template:Math is a purely imaginary number, and thus that Template:Math is real and negative. On the other hand, Template:Math and Template:Math are complex conjugates, and their product is real and positive.[23] Thus the discriminant is the product of a single negative number and several positive ones. That is Δ<0.

Multiple root

If the discriminant of a cubic is zero, the cubic has a multiple root. If furthermore its coefficients are real, then all of its roots are real.

The discriminant of the depressed cubic t3+pt+q is zero if 4p3+27q2=0. If Template:Mvar is also zero, then Template:Math, and 0 is a triple root of the cubic. If 4p3+27q2=0, and Template:Math, then the cubic has a simple root t1=3qp

and a double root t2=t3=3q2p.

In other words, t3+pt+q=(t3qp)(t+3q2p)2.

This result can be proved by expanding the latter product or retrieved by solving the rather simple system of equations resulting from Vieta's formulas.

By using the reduction of a depressed cubic, these results can be extended to the general cubic. This gives: If the discriminant of the cubic ax3+bx2+cx+d is zero, then

  • either, if b2=3ac, the cubic has a triple root x1=x2=x3=b3a, and ax3+bx2+cx+d=a(x+b3a)3
  • or, if b23ac, the cubic has a double root x2=x3=9adbc2(b23ac), and a simple root, x1=4abc9a2db3a(b23ac). and thus ax3+bx2+cx+d=a(xx1)(xx2)2.

Characteristic 2 and 3

The above results are valid when the coefficients belong to a field of characteristic other than 2 or 3, but must be modified for characteristic 2 or 3, because of the involved divisions by 2 and 3.

The reduction to a depressed cubic works for characteristic 2, but not for characteristic 3. However, in both cases, it is simpler to establish and state the results for the general cubic. The main tool for that is the fact that a multiple root is a common root of the polynomial and its formal derivative. In these characteristics, if the derivative is not a constant, it is a linear polynomial in characteristic 3, and is the square of a linear polynomial in characteristic 2. Therefore, for either characteristic 2 or 3, the derivative has only one root. This allows computing the multiple root, and the third root can be deduced from the sum of the roots, which is provided by Vieta's formulas.

A difference with other characteristics is that, in characteristic 2, the formula for a double root involves a square root, and, in characteristic 3, the formula for a triple root involves a cube root.

Cardano's formula

Gerolamo Cardano is credited with publishing the first formula for solving cubic equations, attributing it to Scipione del Ferro and Niccolo Fontana Tartaglia. The formula applies to depressed cubics, but, as shown in Template:Slink, it allows solving all cubic equations.

Cardano's result is that if t3+pt+q=0 is a cubic equation such that Template:Mvar and Template:Mvar are real numbers such that q24+p327 is positive (this implies that the discriminant of the equation is negative) then the equation has the real root u13+u23, where u1 and u2 are the two numbers q2+q24+p327 and q2q24+p327.

See Template:Slink, below, for several methods for getting this result.

As shown in Template:Slink, the two other roots are non-real complex conjugate numbers, in this case. It was later shown (Cardano did not know complex numbers) that the two other roots are obtained by multiplying one of the cube roots by the primitive cube root of unity ε1=1+i32, and the other cube root by the other primitive cube root of the unity ε2=ε12=1i32. That is, the other roots of the equation are ε1u13+ε2u23 and ε2u13+ε1u23.[24]

If 4p3+27q2<0, there are three real roots, but Galois theory allows proving that, if there is no rational root, the roots cannot be expressed by an algebraic expression involving only real numbers. Therefore, the equation cannot be solved in this case with the knowledge of Cardano's time. This case has thus been called casus irreducibilis, meaning irreducible case in Latin.

In casus irreducibilis, Cardano's formula can still be used, but some care is needed in the use of cube roots. A first method is to define the symbols and 3 as representing the principal values of the root function (that is the root that has the largest real part). With this convention Cardano's formula for the three roots remains valid, but is not purely algebraic, as the definition of a principal part is not purely algebraic, since it involves inequalities for comparing real parts. Also, the use of principal cube root may give a wrong result if the coefficients are non-real complex numbers. Moreover, if the coefficients belong to another field, the principal cube root is not defined in general.

The second way for making Cardano's formula always correct, is to remark that the product of the two cube roots must be Template:Math. It results that a root of the equation is Cp3CwithC=q2+q24+p3273. In this formula, the symbols and 3 denote any square root and any cube root. The other roots of the equation are obtained either by changing of cube root or, equivalently, by multiplying the cube root by a primitive cube root of unity, that is 1±32.

This formula for the roots is always correct except when Template:Math, with the proviso that if Template:Math, the square root is chosen so that Template:Math. However, Cardano's formula is useless if p=0, as the roots are the cube roots of q. Similarly, the formula is also useless in the cases where no cube root is needed, that is when the cubic polynomial is not irreducible; this includes the case 4p3+27q2=0.

This formula is also correct when Template:Mvar and Template:Mvar belong to any field of characteristic other than 2 or 3.

General cubic formula

A cubic formula for the roots of the general cubic equation (with Template:Math) ax3+bx2+cx+d=0 can be deduced from every variant of Cardano's formula by reduction to a depressed cubic. The variant that is presented here is valid not only for real coefficients, but also for coefficients Template:Math belonging to any field of characteristic other than 2 or 3. If the coefficients are real numbers, the formula covers all complex solutions, not just real ones.

The formula being rather complicated, it is worth splitting it in smaller formulas.

Let Δ0=b23ac,Δ1=2b39abc+27a2d.

(Both Δ0 and Δ1 can be expressed as resultants of the cubic and its derivatives: Δ1 is Template:Math times the resultant of the cubic and its second derivative, and Δ0 is Template:Math times the resultant of the first and second derivatives of the cubic polynomial.)

Then let C=Δ1±Δ124Δ0323, where the symbols and 3 are interpreted as any square root and any cube root, respectively (every nonzero complex number has two square roots and three cubic roots). The sign "Template:Math" before the square root is either "Template:Math" or "Template:Math"; the choice is almost arbitrary, and changing it amounts to choosing a different square root. However, if a choice yields Template:Math (this occurs if Δ0=0), then the other sign must be selected instead. If both choices yield Template:Math, that is, if Δ0=Δ1=0, a fraction Template:Sfrac occurs in following formulas; this fraction must be interpreted as equal to zero (see the end of this section). With these conventions, one of the roots is x=13a(b+C+Δ0C).

The other two roots can be obtained by changing the choice of the cube root in the definition of Template:Mvar, or, equivalently by multiplying Template:Mvar by a primitive cube root of unity, that is Template:Math. In other words, the three roots are xk=13a(b+ξkC+Δ0ξkC),k{0,1,2}, where Template:Math.

As for the special case of a depressed cubic, this formula applies but is useless when the roots can be expressed without cube roots. In particular, if Δ0=Δ1=0, the formula gives that the three roots equal b3a, which means that the cubic polynomial can be factored as a(x+b3a)3. A straightforward computation allows verifying that the existence of this factorization is equivalent with Δ0=Δ1=0.

Trigonometric and hyperbolic solutions

Trigonometric solution for three real roots

When a cubic equation with real coefficients has three real roots, the formulas expressing these roots in terms of radicals involve complex numbers. Galois theory allows proving that when the three roots are real, and none is rational (casus irreducibilis), one cannot express the roots in terms of real radicals. Nevertheless, purely real expressions of the solutions may be obtained using trigonometric functions, specifically in terms of cosines and arccosines.[25] More precisely, the roots of the depressed cubic t3+pt+q=0 are[26] tk=2p3cos[13arccos(3q2p3p)2πk3]for k=0,1,2.

This formula is due to François Viète.[22] It is purely real when the equation has three real roots (that is 4p3+27q2<0). Otherwise, it is still correct but involves complex cosines and arccosines when there is only one real root, and it is nonsensical (division by zero) when Template:Math.

This formula can be straightforwardly transformed into a formula for the roots of a general cubic equation, using the back-substitution described in Template:Slink.

The formula can be proved as follows: Starting from the equation Template:Math, let us set Template:Nowrap The idea is to choose Template:Mvar to make the equation coincide with the identity 4cos3θ3cosθcos(3θ)=0. For this, choose u=2p3, and divide the equation by u34. This gives 4cos3θ3cosθ3q2p3p=0. Combining with the above identity, one gets cos(3θ)=3q2p3p, and the roots are thus tk=2p3cos[13arccos(3q2p3p)2πk3]for k=0,1,2.

Hyperbolic solution for one real root

When there is only one real root (and Template:Math), this root can be similarly represented using hyperbolic functions, as[27][28] t0=2|q|qp3cosh[13arcosh(3|q|2p3p)]if 4p3+27q2>0 and p<0,t0=2p3sinh[13arsinh(3q2p3p)]if p>0. If Template:Math and the inequalities on the right are not satisfied (the case of three real roots), the formulas remain valid but involve complex quantities.

When Template:Math, the above values of Template:Math are sometimes called the Chebyshev cube root.[29] More precisely, the values involving cosines and hyperbolic cosines define, when Template:Math, the same analytic function denoted Template:Math, which is the proper Chebyshev cube root. The value involving hyperbolic sines is similarly denoted Template:Math, when Template:Math.

Geometric solutions

Omar Khayyám's solution

Omar Khayyám's geometric solution of a cubic equation, for the case Template:Math, Template:Math, giving the root Template:Math. The intersection of the vertical line on the Template:Mvar-axis at the center of the circle is happenstance of the example illustrated.

For solving the cubic equation Template:Math where Template:Math, Omar Khayyám constructed the parabola Template:Math, the circle that has as a diameter the line segment Template:Math on the positive Template:Mvar-axis, and a vertical line through the point where the circle and the parabola intersect above the Template:Mvar-axis. The solution is given by the length of the horizontal line segment from the origin to the intersection of the vertical line and the Template:Mvar-axis (see the figure).

A simple modern proof is as follows. Multiplying the equation by Template:Math and regrouping the terms gives x4m2=x(nm2x). The left-hand side is the value of Template:Math on the parabola. The equation of the circle being Template:Math, the right hand side is the value of Template:Math on the circle.

Solution with angle trisector

A cubic equation with real coefficients can be solved geometrically using compass, straightedge, and an angle trisector if and only if it has three real roots.[30]Template:Rp

A cubic equation can be solved by compass-and-straightedge construction (without trisector) if and only if it has a rational root. This implies that the old problems of angle trisection and doubling the cube, set by ancient Greek mathematicians, cannot be solved by compass-and-straightedge construction.

Geometric interpretation of the roots

Three real roots

For the cubic (Template:EquationNote) with three real roots, the roots are the projection on the Template:Mvar-axis of the vertices Template:Mvar, Template:Mvar, and Template:Mvar of an equilateral triangle. The center of the triangle has the same Template:Mvar-coordinate as the inflection point.

Viète's trigonometric expression of the roots in the three-real-roots case lends itself to a geometric interpretation in terms of a circle.[22][31] When the cubic is written in depressed form (Template:EquationNote), Template:Math, as shown above, the solution can be expressed as

tk=2p3cos(13arccos(3q2p3p)k2π3)fork=0,1,2.

Here arccos(3q2p3p) is an angle in the unit circle; taking Template:Math of that angle corresponds to taking a cube root of a complex number; adding Template:Math for Template:Math finds the other cube roots; and multiplying the cosines of these resulting angles by 2p3 corrects for scale.

For the non-depressed case (Template:EquationNote) (shown in the accompanying graph), the depressed case as indicated previously is obtained by defining Template:Mvar such that Template:Math so Template:Math. Graphically this corresponds to simply shifting the graph horizontally when changing between the variables Template:Mvar and Template:Mvar, without changing the angle relationships. This shift moves the point of inflection and the centre of the circle onto the Template:Mvar-axis. Consequently, the roots of the equation in Template:Mvar sum to zero.

One real root

In the Cartesian plane

The slope of line RA is twice that of RH. Denoting the complex roots of the cubic as Template:Math, Template:Math (negative here) and Template:Mvar = Template:Math = Template:Math = Template:Math = Template:Math.

When the graph of a cubic function is plotted in the Cartesian plane, if there is only one real root, it is the abscissa (Template:Mvar-coordinate) of the horizontal intercept of the curve (point R on the figure). Further,[32][33][34] if the complex conjugate roots are written as Template:Math, then the real part Template:Mvar is the abscissa of the tangency point H of the tangent line to cubic that passes through Template:Mvar-intercept R of the cubic (that is the signed length OM, negative on the figure). The imaginary parts Template:Mvar are the square roots of the tangent of the angle between this tangent line and the horizontal axis.Template:Clarify

In the complex plane

With one real and two complex roots, the three roots can be represented as points in the complex plane, as can the two roots of the cubic's derivative. There is an interesting geometrical relationship among all these roots.

The points in the complex plane representing the three roots serve as the vertices of an isosceles triangle. (The triangle is isosceles because one root is on the horizontal (real) axis and the other two roots, being complex conjugates, appear symmetrically above and below the real axis.) Marden's theorem says that the points representing the roots of the derivative of the cubic are the foci of the Steiner inellipse of the triangle—the unique ellipse that is tangent to the triangle at the midpoints of its sides. If the angle at the vertex on the real axis is less than Template:Math then the major axis of the ellipse lies on the real axis, as do its foci and hence the roots of the derivative. If that angle is greater than Template:Math, the major axis is vertical and its foci, the roots of the derivative, are complex conjugates. And if that angle is Template:Math, the triangle is equilateral, the Steiner inellipse is simply the triangle's incircle, its foci coincide with each other at the incenter, which lies on the real axis, and hence the derivative has duplicate real roots.

Galois group

Given a cubic irreducible polynomial over a field Template:Mvar of characteristic different from 2 and 3, the Galois group over Template:Mvar is the group of the field automorphisms that fix Template:Mvar of the smallest extension of Template:Mvar (splitting field). As these automorphisms must permute the roots of the polynomials, this group is either the group Template:Math of all six permutations of the three roots, or the group Template:Math of the three circular permutations.

The discriminant Template:Math of the cubic is the square of Δ=a2(r1r2)(r1r3)(r2r3), where Template:Mvar is the leading coefficient of the cubic, and Template:Math, Template:Math and Template:Math are the three roots of the cubic. As Δ changes of sign if two roots are exchanged, Δ is fixed by the Galois group only if the Galois group is Template:Math. In other words, the Galois group is Template:Math if and only if the discriminant is the square of an element of Template:Mvar.

As most integers are not squares, when working over the field Template:Math of the rational numbers, the Galois group of most irreducible cubic polynomials is the group Template:Math with six elements. An example of a Galois group Template:Math with three elements is given by Template:Math, whose discriminant is Template:Math.

Derivation of the roots

This section regroups several methods for deriving Cardano's formula.

Cardano's method

This method is due to Scipione del Ferro and Tartaglia, but is named after Gerolamo Cardano who first published it in his book Ars Magna (1545).

This method applies to a depressed cubic Template:Math. The idea is to introduce two variables Template:Mvar and v such that u+v=t and to substitute this in the depressed cubic, giving u3+v3+(3uv+p)(u+v)+q=0.

At this point Cardano imposed the condition 3uv+p=0. This removes the third term in previous equality, leading to the system of equations u3+v3=quv=p3.

Knowing the sum and the product of Template:Math and v3, one deduces that they are the two solutions of the quadratic equation 0=(xu3)(xv3)=x2(u3+v3)x+u3v3=x2(u3+v3)x+(uv)3 so x2+qxp327=0. The discriminant of this equation is Δ=q2+4p327, and assuming it is positive, real solutions to this equation are (after folding division by 4 under the square root): q2±q24+p327. So (without loss of generality in choosing Template:Mvar or v): u=q2+q24+p3273. v=q2q24+p3273. As u+v=t, the sum of the cube roots of these solutions is a root of the equation. That is t=q2+q24+p3273+q2q24+p3273 is a root of the equation; this is Cardano's formula.

This works well when 4p3+27q2>0, but, if 4p3+27q2<0, the square root appearing in the formula is not real. As a complex number has three cube roots, using Cardano's formula without care would provide nine roots, while a cubic equation cannot have more than three roots. This was clarified first by Rafael Bombelli in his book L'Algebra (1572). The solution is to use the fact that uv=p3, that is, v=p3u. This means that only one cube root needs to be computed, and leads to the second formula given in Template:Slink.

The other roots of the equation can be obtained by changing of cube root, or, equivalently, by multiplying the cube root by each of the two primitive cube roots of unity, which are 1±32.

Vieta's substitution

Vieta's substitution is a method introduced by François Viète (Vieta is his Latin name) in a text published posthumously in 1615, which provides directly the second formula of Template:Slink, and avoids the problem of computing two different cube roots.[35]

Starting from the depressed cubic Template:Math, Vieta's substitution is Template:Math.Template:Efn

The substitution Template:Math transforms the depressed cubic into w3+qp327w3=0.

Multiplying by Template:Math, one gets a quadratic equation in Template:Mvar: (w3)2+q(w3)p327=0.

Let W=q2±p327+q24 be any nonzero root of this quadratic equation. If Template:Math, Template:Math and Template:Math are the three cube roots of Template:Mvar, then the roots of the original depressed cubic are Template:Math, Template:Math, and Template:Math. The other root of the quadratic equation is p327W. This implies that changing the sign of the square root exchanges Template:Math and Template:Math for Template:Math, and therefore does not change the roots. This method only fails when both roots of the quadratic equation are zero, that is when Template:Math, in which case the only root of the depressed cubic is Template:Math.

Lagrange's method

In his paper Réflexions sur la résolution algébrique des équations ("Thoughts on the algebraic solving of equations"),[36] Joseph Louis Lagrange introduced a new method to solve equations of low degree in a uniform way, with the hope that he could generalize it for higher degrees. This method works well for cubic and quartic equations, but Lagrange did not succeed in applying it to a quintic equation, because it requires solving a resolvent polynomial of degree at least six.[37][38][39] Apart from the fact that nobody had previously succeeded, this was the first indication of the non-existence of an algebraic formula for degrees 5 and higher; as was later proved by the Abel–Ruffini theorem. Nevertheless, modern methods for solving solvable quintic equations are mainly based on Lagrange's method.[39]

In the case of cubic equations, Lagrange's method gives the same solution as Cardano's. Lagrange's method can be applied directly to the general cubic equation Template:Math, but the computation is simpler with the depressed cubic equation, Template:Math.

Lagrange's main idea was to work with the discrete Fourier transform of the roots instead of with the roots themselves. More precisely, let Template:Mvar be a primitive third root of unity, that is a number such that Template:Math and Template:Math (when working in the space of complex numbers, one has ξ=1±i32=e2iπ/3, but this complex interpretation is not used here). Denoting Template:Math, Template:Math and Template:Math the three roots of the cubic equation to be solved, let s0=x0+x1+x2,s1=x0+ξx1+ξ2x2,s2=x0+ξ2x1+ξx2, be the discrete Fourier transform of the roots. If Template:Math, Template:Math and Template:Math are known, the roots may be recovered from them with the inverse Fourier transform consisting of inverting this linear transformation; that is, x0=13(s0+s1+s2),x1=13(s0+ξ2s1+ξs2),x2=13(s0+ξs1+ξ2s2).

By Vieta's formulas, Template:Math is known to be zero in the case of a depressed cubic, and Template:Math for the general cubic. So, only Template:Math and Template:Math need to be computed. They are not symmetric functions of the roots (exchanging Template:Math and Template:Math exchanges also Template:Math and Template:Math), but some simple symmetric functions of Template:Math and Template:Math are also symmetric in the roots of the cubic equation to be solved. Thus these symmetric functions can be expressed in terms of the (known) coefficients of the original cubic, and this allows eventually expressing the Template:Mvar as roots of a polynomial with known coefficients. This works well for every degree, but, in degrees higher than four, the resulting polynomial that has the Template:Mvar as roots has a degree higher than that of the initial polynomial, and is therefore unhelpful for solving. This is the reason for which Lagrange's method fails in degrees five and higher.

In the case of a cubic equation, P=s1s2, and S=s13+s23 are such symmetric polynomials (see below). It follows that s13 and s23 are the two roots of the quadratic equation z2Sz+P3=0. Thus the resolution of the equation may be finished exactly as with Cardano's method, with s1 and s2 in place of Template:Mvar and v.

In the case of the depressed cubic, one has x0=13(s1+s2) and s1s2=3p, while in Cardano's method we have set x0=u+v and uv=13p. Thus, up to the exchange of Template:Mvar and v, we have s1=3u and s2=3v. In other words, in this case, Cardano's method and Lagrange's method compute exactly the same things, up to a factor of three in the auxiliary variables, the main difference being that Lagrange's method explains why these auxiliary variables appear in the problem.

Computation of Template:Mvar and Template:Mvar

A straightforward computation using the relations Template:Math and Template:Math gives P=s1s2=x02+x12+x22(x0x1+x1x2+x2x0),S=s13+s23=2(x03+x13+x23)3(x02x1+x12x2+x22x0+x0x12+x1x22+x2x02)+12x0x1x2. This shows that Template:Mvar and Template:Mvar are symmetric functions of the roots. Using Newton's identities, it is straightforward to express them in terms of the elementary symmetric functions of the roots, giving P=e123e2,S=2e139e1e2+27e3, with Template:Math, Template:Math and Template:Math in the case of a depressed cubic, and Template:Math, Template:Math and Template:Math, in the general case.

Applications

Cubic equations arise in various other contexts.

In mathematics

In other sciences

See also

Notes

Template:Reflist

References

Template:Reflist

Further reading

Template:Polynomials

  1. Template:Citation
  2. 2.0 2.1 Template:Cite book
  3. 3.0 3.1 Van der Waerden, Geometry and Algebra of Ancient Civilizations, chapter 4, Zurich 1983 Template:ISBN
  4. Template:Cite book
  5. Template:Cite book
  6. Template:Cite book
  7. Template:Harvtxt states that "the Egyptians considered the solution impossible, but the Greeks came nearer to a solution."
  8. 8.0 8.1 Template:Harvtxt
  9. Template:Cite book
  10. Template:Cite book
  11. Template:Citation
  12. A paper of Omar Khayyam, Scripta Math. 26 (1963), pages 323–337
  13. J. J. O'Connor and E. F. Robertson (1999), Omar Khayyam, MacTutor History of Mathematics archive, states, "Khayyam himself seems to have been the first to conceive a general theory of cubic equations."
  14. Template:Harvtxt states, "Omar Al Hay of Chorassan, about 1079 AD did most to elevate to a method the solution of the algebraic equations by intersecting conics."
  15. Template:Cite book
  16. Template:Citation
  17. Template:MacTutor
  18. Template:Citation
  19. Template:MacTutor
  20. Template:Cite book
  21. Template:Citation
  22. 22.0 22.1 22.2 Template:Cite journal
  23. Template:Cite book
  24. Template:Cite web
  25. Template:Cite journal
  26. Template:Cite book
  27. These are Formulas (80) and (83) of Weisstein, Eric W. 'Cubic Formula'. From MathWorld—A Wolfram Web Resource. https://mathworld.wolfram.com/CubicFormula.html, rewritten for having a coherent notation.
  28. Holmes, G. C., "The use of hyperbolic cosines in solving cubic polynomials", Mathematical Gazette 86. November 2002, 473–477.
  29. Abramowitz, Milton; Stegun, Irene A., eds. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Dover (1965), chap. 22 p. 773
  30. Template:Cite journal
  31. Template:Citation See esp. Fig. 2.
  32. Template:Citation
  33. Template:Citation
  34. Template:Citation
  35. Template:Citation
  36. Template:Citation
  37. Template:Citation, §6.2, p. 134
  38. Template:Citation, Algebra in the Eighteenth Century: The Theory of Equations
  39. 39.0 39.1 Daniel Lazard, "Solving quintics in radicals", in Olav Arnfinn Laudal, Ragni Piene, The Legacy of Niels Henrik Abel, pp. 207–225, Berlin, 2004. Template:Isbn