In algebra, a resolvent cubic is one of several distinct, although related, cubic polynomials defined from a monic polynomial of degree four:
In each case:
Suppose that the coefficients of P(x) belong to a field k whose characteristic is different from 2. In other words, we are working in a field in which 1 + 1 ≠ 0. Whenever roots of P(x) are mentioned, they belong to some extension K of k such that P(x) factors into linear factors in K[x]. If k is the field Q of rational numbers, then K can be the field C of complex numbers or the field Q of algebraic numbers.
In some cases, the concept of resolvent cubic is defined only when P(x) is a quartic in depressed form—that is, when a3 = 0.
Note that the fourth and fifth definitions below also make sense and that the relationship between these resolvent cubics and P(x) are still valid if the characteristic of k is equal to 2.
Suppose that P(x) is a depressed quartic—that is, that a3 = 0. A possible definition of the resolvent cubic of P(x) is: [1]
The origin of this definition lies in applying Ferrari's method to find the roots of P(x). To be more precise:
Add a new unknown, y, to x2 + a2/2. Now you have:
If this expression is a square, it can only be the square of
But the equality
is equivalent to
and this is the same thing as the assertion that R1(y) = 0.
If y0 is a root of R1(y), then it is a consequence of the computations made above that the roots of P(x) are the roots of the polynomial
together with the roots of the polynomial
Of course, this makes no sense if y0 = 0, but since the constant term of R1(y) is –a12, 0 is a root of R1(y) if and only if a1 = 0, and in this case the roots of P(x) can be found using the quadratic formula.
Another possible definition [1] (still supposing that P(x) is a depressed quartic) is
The origin of this definition is similar to the previous one. This time, we start by doing:
and a computation similar to the previous one shows that this last expression is a square if and only if
A simple computation shows that
Another possible definition [2] [3] (again, supposing that P(x) is a depressed quartic) is
The origin of this definition lies in another method of solving quartic equations, namely Descartes' method. If you try to find the roots of P(x) by expressing it as a product of two monic quadratic polynomials x2 + αx + β and x2 – αx + γ, then
If there is a solution of this system with α ≠ 0 (note that if a1 ≠ 0, then this is automatically true for any solution), the previous system is equivalent to
It is a consequence of the first two equations that then
and
After replacing, in the third equation, β and γ by these values one gets that
and this is equivalent to the assertion that α2 is a root of R3(y). So, again, knowing the roots of R3(y) helps to determine the roots of P(x).
Note that
Still another possible definition is [4]
In fact, if the roots of P(x) are α1, α2, α3, and α4, then
a fact the follows from Vieta's formulas. In other words, R4(y) is the monic polynomial whose roots are α1α2 + α3α4, α1α3 + α2α4, and α1α4 + α2α3.
It is easy to see that
Therefore, P(x) has a multiple root if and only if R4(y) has a multiple root. More precisely, P(x) and R4(y) have the same discriminant.
One should note that if P(x) is a depressed polynomial, then
Yet another definition is [5] [6]
If, as above, the roots of P(x) are α1, α2, α3, and α4, then
again as a consequence of Vieta's formulas. In other words, R5(y) is the monic polynomial whose roots are (α1 + α2)(α3 + α4), (α1 + α3)(α2 + α4), and (α1 + α4)(α2 + α3).
It is easy to see that
Therefore, as it happens with R4(y), P(x) has a multiple root if and only if R5(y) has a multiple root. More precisely, P(x) and R5(y) have the same discriminant. This is also a consequence of the fact that R5(y + a2) = -R4(-y).
Note that if P(x) is a depressed polynomial, then
It was explained above how R1(y) , R2(y) , and R3(y) can be used to find the roots of P(x) if this polynomial is depressed. In the general case, one simply has to find the roots of the depressed polynomial P(x − a3/4). For each root x0 of this polynomial, x0 − a3/4 is a root of P(x).
If a quartic polynomial P(x) is reducible in k[x], then it is the product of two quadratic polynomials or the product of a linear polynomial by a cubic polynomial. This second possibility occurs if and only if P(x) has a root in k. In order to determine whether or not P(x) can be expressed as the product of two quadratic polynomials, let us assume, for simplicity, that P(x) is a depressed polynomial. Then it was seen above that if the resolvent cubic R3(y) has a non-null root of the form α2, for some α ∈ k, then such a decomposition exists.
This can be used to prove that, in R[x], every quartic polynomial without real roots can be expressed as the product of two quadratic polynomials. Let P(x) be such a polynomial. We can assume without loss of generality that P(x) is monic. We can also assume without loss of generality that it is a reduced polynomial, because P(x) can be expressed as the product of two quadratic polynomials if and only if P(x − a3/4) can and this polynomial is a reduced one. Then R3(y) = y3 + 2a2y2 + (a22 − 4a0)y − a12. There are two cases:
More generally, if k is a real closed field, then every quartic polynomial without roots in k can be expressed as the product of two quadratic polynomials in k[x]. Indeed, this statement can be expressed in first-order logic and any such statement that holds for R also holds for any real closed field.
A similar approach can be used to get an algorithm [2] to determine whether or not a quartic polynomial P(x) ∈ Q[x] is reducible and, if it is, how to express it as a product of polynomials of smaller degree. Again, we will suppose that P(x) is monic and depressed. Then P(x) is reducible if and only if at least one of the following conditions holds:
Indeed:
The resolvent cubic of an irreducible quartic polynomial P(x) can be used to determine its Galois group G; that is, the Galois group of the splitting field of P(x). Let m be the degree over k of the splitting field of the resolvent cubic (it can be either R4(y) or R5(y); they have the same splitting field). Then the group G is a subgroup of the symmetric group S4. More precisely: [4]
In algebra, a quadratic equation is any equation that can be rearranged in standard form as
In mathematics, the discriminant of a polynomial is a quantity that depends on the coefficients and allows deducing some properties of the roots without computing them. More precisely, it is a polynomial function of the coefficients of the original polynomial. The discriminant is widely used in polynomial factoring, number theory, and algebraic geometry.
In elementary algebra, the quadratic formula is a formula that provides the solutions to a quadratic equation. Other ways of solving a quadratic equation, such as completing the square, yield the same solutions.
In mathematics, factorization (or factorisation, see English spelling differences) or factoring consists of writing a number or another mathematical object as a product of several factors, usually smaller or simpler objects of the same kind. For example, 3 × 5 is an integer factorization of 15, and (x – 2)(x + 2) is a polynomial factorization of x2 – 4.
In abstract algebra, a splitting field of a polynomial with coefficients in a field is the smallest field extension of that field over which the polynomial splits, i.e., decomposes into linear factors.
In algebra, a cubic equation in one variable is an equation of the form
In mathematics, a quadratic polynomial is a polynomial of degree two in one or more variables. A quadratic function is the polynomial function defined by a quadratic polynomial. Before the 20th century, the distinction was unclear between a polynomial and its associated polynomial function; so "quadratic polynomial" and "quadratic function" were almost synonymous. This is still the case in many elementary courses, where both terms are often abbreviated as "quadratic".
In mathematics, a cubic function is a function of the form that is, a polynomial function of degree three. In many texts, the coefficientsa, b, c, and d are supposed to be real numbers, and the function is considered as a real function that maps real numbers to real numbers or as a complex function that maps complex numbers to complex numbers. In other cases, the coefficients may be complex numbers, and the function is a complex function that has the set of the complex numbers as its codomain, even when the domain is restricted to the real numbers.
In mathematics, a reciprocity law is a generalization of the law of quadratic reciprocity to arbitrary monic irreducible polynomials with integer coefficients. Recall that first reciprocity law, quadratic reciprocity, determines when an irreducible polynomial splits into linear terms when reduced mod . That is, it determines for which prime numbers the relation
In mathematics, a quartic equation is one which can be expressed as a quartic function equaling zero. The general form of a quartic equation is
In mathematics, a quintic function is a function of the form
In algebra, a quartic function is a function of the form
In mathematics, an algebraic equation or polynomial equation is an equation of the form , where P is a polynomial with coefficients in some field, often the field of the rational numbers. For example, is an algebraic equation with integer coefficients and
This article describes periodic points of some complex quadratic maps. A map is a formula for computing a value of a variable based on its own previous value or values; a quadratic map is one that involves the previous value raised to the powers one and two; and a complex map is one in which the variable and the parameters are complex numbers. A periodic point of a map is a value of the variable that occurs repeatedly after intervals of a fixed length.
In algebra, a nested radical is a radical expression that contains (nests) another radical expression. Examples include
In algebra, the Bring radical or ultraradical of a real number a is the unique real root of the polynomial
In mathematics, a polynomial transformation consists of computing the polynomial whose roots are a given function of the roots of a polynomial. Polynomial transformations such as Tschirnhaus transformations are often used to simplify the solution of algebraic equations.
In algebra, casus irreducibilis is one of the cases that may arise in solving polynomials of degree 3 or higher with integer coefficients algebraically, i.e., by obtaining 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 have three real roots, which was proven by Pierre Wantzel in 1843. One can see whether a given cubic polynomial is in so-called casus irreducibilis by looking at the discriminant, via Cardano's formula.
In Galois theory, a discipline within the field of abstract algebra, a resolvent for a permutation group G is a polynomial whose coefficients depend polynomially on the coefficients of a given polynomial p and has, roughly speaking, a rational root if and only if the Galois group of p is included in G. More exactly, if the Galois group is included in G, then the resolvent has a rational root, and the converse is true if the rational root is a simple root. Resolvents were introduced by Joseph Louis Lagrange and systematically used by Évariste Galois. Nowadays they are still a fundamental tool to compute Galois groups. The simplest examples of resolvents are
Kunerth's algorithm is an algorithm for computing the modular square root of a given number. The algorithm does not require the factorization of the modulus, and relies on modular operations that is often easy when the given number is prime.