Casus irreducibilis

In algebra, casus irreducibilis (Latin for "the irreducible case") is one of the cases that may arise in attempting to solve a cubic equation with integer coefficients with roots that are expressed with radicals. Specifically, if a cubic polynomial is irreducible over the rational numbers and has three real roots, then in order to express the roots with radicals, one must introduce complex-valued expressions, even though the resulting expressions are ultimately real-valued.

One can decide whether a given irreducible cubic polynomial is in casus irreducibilis using the discriminant D, via Cardano's formula.[1] Let the cubic equation be given by

ax^3+bx^2+cx+d=0.\,

Then the discriminant D appearing in the algebraic solution is given by

 D = 18abcd -4b^3d + b^2c^2 - 4ac^3 - 27a^2d^2. \,

Formal statement and proof

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

 F\sub F(\sqrt{D})\sub F(\sqrt{D}, \sqrt[p_1]{\alpha_1}) \sub\cdots \sub K\sub K(\sqrt[3]{\alpha})

At the final step of the tower, p(x) is irreducible in the penultimate field K, but splits in K(α) 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. Indeed, 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

The equation ax^3+bx^2+cx+d=0\, can be depressed to a monic trinomial by dividing by a and substituting x = t-\frac{b}{3a} (the Tschirnhaus transformation), giving the equation

t^3+pt+q=0

where

p=\frac{3ac-b^2}{3a^2}
q=\frac{2b^3-9abc+27a^2d}{27a^3}.

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

 t_k = \omega_k \sqrt[3]{-{q\over 2}+ \sqrt{{q^{2}\over 4}+{p^{3}\over 27}}} + \omega_k^2  \sqrt[3]{-{q\over 2}- \sqrt{{q^{2}\over 4}+{p^{3}\over 27}}}

where  \omega_k (k=1, 2, 3) is a cube root of 1: \omega_1 = 1, \omega_2 = -\frac{1}{2} + \frac{\sqrt{3}}{2}i, and \omega_3 = -\frac{1}{2} - \frac{\sqrt{3}}{2}i, where i is the imaginary unit.

Casus irreducibilis occurs when none of the roots is rational and when all three roots are distinct and real; the case of three distinct real roots occurs if and only if {q^{2}\over 4}+{p^{3}\over 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 (which cube root cannot itself be placed in the form \alpha + \beta i with specifically given expressions in real radicals for \alpha and \beta, since doing so would require independently solving the original cubic). Note that 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.

Non-algebraic solution in terms of real quantities

While casus irreducibilis cannot be solved in radicals in terms of real quantities, it can be solved trigonometrically in terms of real quantities.[2] Specifically, the depressed monic cubic equation t^3+pt+q=0 is solved by

t_k=2\sqrt{-\frac{p}{3}}\cos\left(\frac{1}{3}\arccos\left(\frac{3q}{2p}\sqrt{\frac{-3}{p}}\right)-k\frac{2\pi}{3}\right) \quad \text{for} \quad k=0,1,2 \,.

These solutions are in terms of real quantities if and only if {q^{2}\over 4}+{p^{3}\over 27} < 0 — i.e., if and only if there are three real roots.

Relation to angle trisection

The distinction between the reducible and irreducible cubic cases with three real roots is related to the issue of whether or not an angle with rational cosine or rational sine is trisectible by the classical means of compass and unmarked straightedge. If the cosine of an angle \theta is known to have a particular rational value, then one third of this angle has a cosine that is one of the three real roots of the equation

 4x^3  - 3x - \cos (\theta) = 0.

Likewise, if the sine of \theta is known to have a particular rational value, then one third of this angle has a sine that is one of the three real roots of the equation

 -4y^3 + 3y - \sin (\theta) = 0.

In either case, if the rational root test reveals a rational root of the equation, 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 (\theta / 3) or \sin (\theta / 3) is constructible and so is the associated angle \theta / 3. On the other hand, if the rational root test shows that there is no rational root, then casus irreducibilis applies, \cos (\theta / 3) or \sin (\theta / 3) is not constructible, the angle \theta / 3 is not constructible, and the angle \theta is not classically trisectible.

Generalization

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 K\subseteq R 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.[3]

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


Notes

  1. Cox (2012), Theorem 1.3.1, p. 15.
  2. Cox (2012), Section 1.3B Trigonometric Solution of the Cubic, pp. 18–19.
  3. Cox (2012), Theorem 8.6.5, p. 222.
  4. David S. Dummit Solving Solvable Quintics

References

External links

This article is issued from Wikipedia - version of the Sunday, April 17, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.