Casus irreducibilis

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In algebra, casus irreducibilis (Latin for "the irreducible case") is one of the cases that may arise in attempting to solve polynomials of degree 3 or higher with integer coefficients, to obtain roots that are expressed with radicals. It shows that many algebraic numbers are real-valued but cannot be expressed in radicals without introducing complex numbers. The most notable occurrence of casus irreducibilis is in the case of cubic polynomials that are irreducible (cannot be factored into lower-degree polynomials) over the rational numbers and have three real roots, which was proven by Pierre Wantzel in 1843.[1] One can decide whether a given irreducible cubic polynomial is in casus irreducibilis using the discriminant Δ, via Cardano's formula.[2] Let the cubic equation be given by

with a≠0. Then the discriminant appearing in the algebraic solution is given by

  • If Δ < 0, then the polynomial has two complex non-real roots, so casus irreducibilis does not apply.
  • If Δ = 0, then there are three real roots, and two of them are equal and can be found by the Euclidean algorithm, and by the quadratic formula. All roots are real and expressible by real radicals. The polynomial is not irreducible.
  • If Δ > 0, then there are three distinct real roots. Either a rational root exists and can be found using the rational root test, in which case the cubic polynomial can be factored into the product of a linear polynomial and a quadratic polynomial, the latter of which can be solved via the quadratic formula; or no such factorization can occur, so the polynomial is casus irreducibilis: all roots are real, but require complex numbers to express them in radicals.

Formal statement and proof[edit]

More generally, suppose that F is a formally real field, and that p(x) ∈ F[x] is a cubic polynomial, irreducible over F, but having three real roots (roots in the real closure of F). Then casus irreducibilis states that it is impossible to find any solution of p(x) = 0 by real radicals.

To prove this,[3] note that the discriminant D is positive. Form the field extension F(D). Since this is F or a quadratic extension of F (depending in whether or not D is a square in F), p(x) remains irreducible in it. Consequently, the Galois group of p(x) over F(D) is the cyclic group C3. Suppose that p(x) = 0 can be solved by real radicals. Then p(x) can be split by a tower of cyclic extensions

At the final step of the tower, p(x) is irreducible in the penultimate field K, but splits in K(3α) for some α. But this is a cyclic field extension, and so must contain a primitive root of unity.

However, there are no primitive 3rd roots of unity in a real closed field. Suppose that ω is a primitive 3rd root of unity. Then, by the axioms defining an ordered field, ω, ω2, and 1 are all positive. But if ω2>ω, then cubing both sides gives 1>1, a contradiction; similarly if ω>ω2.

Solution in non-real radicals[edit]

Cardano's solution[edit]

The equation ax3 + bx2 + cx + d = 0 can be depressed to a monic trinomial by dividing by and substituting x = tb/3a (the Tschirnhaus transformation), giving the equation t3 + pt + q = 0 where

Then regardless of the number of real roots, by Cardano's solution the three roots are given by

where (k=1, 2, 3) is a cube root of 1 (, , and , where i is the imaginary unit). Here if the radicands under the cube roots are non-real, the cube roots expressed by radicals are defined to be any pair of complex conjugate cube roots, while if they are real these cube roots are defined to be the real cube roots.

Casus irreducibilis occurs when none of the roots are rational and when all three roots are distinct and real; the case of three distinct real roots occurs if and only if q2/4 + p3/27 < 0, in which case Cardano's formula involves first taking the square root of a negative number, which is imaginary, and then taking the cube root of a complex number (the cube root cannot itself be placed in the form α + βi with specifically given expressions in real radicals for α and β, since doing so would require independently solving the original cubic). Even in the reducible case in which one of three real roots is rational and hence can be factored out by polynomial long division, Cardano's formula (unnecessarily in this case) expresses that root (and the others) in terms of non-real radicals.

Example[edit]

The cubic equation

is irreducible, because if it could be factored there would be a linear factor giving a rational solution, while none of the possible roots given by the rational root test are actually roots. Since its discriminant is positive, it has three real roots, so it is an example of casus irreducibilis. These roots can be expressed as

for . The solutions are in radicals and involve the cube roots of complex conjugate numbers.

Trigonometric solution in terms of real quantities[edit]

While casus irreducibilis cannot be solved in radicals in terms of real quantities, it can be solved trigonometrically in terms of real quantities.[4] Specifically, the depressed monic cubic equation is solved by

These solutions are in terms of real quantities if and only if — i.e., if and only if there are three real roots. The formula involves starting with an angle whose cosine is known, trisecting the angle by multiplying it by 1/3, and taking the cosine of the resulting angle and adjusting for scale.

Although cosine and its inverse function (arccosine) are transcendental functions, this solution is algebraic in the sense that is an algebraic function, equivalent to angle trisection.

Relation to angle trisection[edit]

The distinction between the reducible and irreducible cubic cases with three real roots is related to the issue of whether or not an angle is trisectible by the classical means of compass and unmarked straightedge. For any angle θ, one-third of this angle has a cosine that is one of the three solutions to

Likewise, θ3 has a sine that is one of the three real solutions to

In either case, if the rational root test reveals a rational solution, x or y minus that root can be factored out of the polynomial on the left side, leaving a quadratic that can be solved for the remaining two roots in terms of a square root; then all of these roots are classically constructible since they are expressible in no higher than square roots, so in particular cos(​θ3) or sin(​θ3) is constructible and so is the associated angle θ3. On the other hand, if the rational root test shows that there is no rational root, then casus irreducibilis applies, cos(​θ3) or sin(​θ3) is not constructible, the angle θ3 is not constructible, and the angle θ is not classically trisectible.

As an example, while a 180° angle can be trisected into three 60° angles, a 60° angle cannot be trisected with only compass and straightedge. Using triple-angle formulae one can see that cos π/3 = 4x3 − 3x where x = cos(20°). Rearranging gives 8x3 − 6x − 1 = 0, which fails the rational root test as none of the rational numbers suggested by the theorem is actually a root. Therefore, the minimal polynomial of cos(20°) has degree 3, whereas the degree of the minimal polynomial of any constructible number must be a power of two.

Expressing cos(20°) in radicals results in

which involves taking the cube root of complex numbers. Note the similarity to e/3 = 1+i3/2 and e−iπ/3 = 1−i3/2.

The connection between rational roots and trisectability can also be extended to some cases where the sine and cosine of the given angle is irrational. Consider as an example the case where the given angle is a vertex angle of a regular pentagon, a polygon that can be constructed classically. For this angle is 180°, and standard trigonometric identities then give

thus

The cosine of the trisected angle is rendered as a rational expression in terms of the cosine of the given angle, so the vertex angle of a regular pentagon can be trisected (mechanically, by simply drawing a diagonal).

Generalization[edit]

Casus irreducibilis can be generalized to higher degree polynomials as follows. Let p ∈ F[x] be an irreducible polynomial which splits in a formally real extension R of F (i.e., p has only real roots). Assume that p has a root in which is an extension of F by radicals. Then the degree of p is a power of 2, and its splitting field is an iterated quadratic extension of F.[5][6]:pp. 571–572

Thus for any irreducible polynomial whose degree is not a power of 2 and which has all roots real, no root can be expressed purely in terms of real radicals. Moreover, if the polynomial degree is a power of 2 and the roots are all real, then if there is a root that can be expressed in real radicals it can be expressed in terms of square roots and no higher-degree roots, as can the other roots, and so the roots are classically constructible.

Casus irreducibilis for quintic polynomials is discussed by Dummit.[7]:p.17

Relation to angle pentasection (quintisection) and higher[edit]

The distinction between the reducible and irreducible quintic cases with five real roots is related to the issue of whether or not an angle with rational cosine or rational sine is pentasectible (able to be split into five equal parts) by the classical means of compass and unmarked straightedge. For any angle θ, one-fifth of this angle has a cosine that is one of the five real roots of the equation

Likewise, θ/5 has a sine that is one of the five real roots of the equation

In either case, if the rational root test yields a rational root x1, then the quintic is reducible since it can be written as a factor (x—x1) times a quartic polynomial. But if the test shows that there is no rational root, then the polynomial may be irreducible, in which case casus irreducibilis applies, cos(​θ5) and sin(​θ5) are not constructible, the angle θ5 is not constructible, and the angle θ is not classically pentasectible. An example of this is when one attempts to construct a 25-gon (icosipentagon) with compass and straightedge. While a pentagon is relatively easy to construct, a 25-gon requires an angle pentasector as the minimal polynomial for cos(14.4°) has degree 10:

Thus,

Notes[edit]

  1. ^ Wantzel, Pierre (1843), "Classification des nombres incommensurables d'origine algébrique" (PDF), Nouvelles Annales de Mathématiques (in French), 2: 117–127
  2. ^ Cox (2012), Theorem 1.3.1, p. 15.
  3. ^ B.L. van der Waerden, Modern Algebra (translated from German by Fred Blum), Frederick Ungar Publ. Co., 1949, p. 180.
  4. ^ Cox (2012), Section 1.3B Trigonometric Solution of the Cubic, pp. 18–19.
  5. ^ Cox (2012), Theorem 8.6.5, p. 222.
  6. ^ I. M. Isaacs, "Solution of polynomials by real radicals", American Mathematical Monthly 92 (8), October 1985, 571–575,
  7. ^ David S. Dummit Solving Solvable Quintics

References[edit]

External links[edit]