In mathematics, a quintic function is a function of the form
where a, b, c, d, e and f are members of a field, typically the rational numbers, the real numbers or the complex numbers, and a is nonzero. In other words, a quintic function is defined by a polynomial of degree five.
Because they have an odd degree, normal quintic functions appear similar to normal cubic functions when graphed, except they may possess one additional local maximum and one additional local minimum. The derivative of a quintic function is a quartic function.
Setting g(x) = 0 and assuming a ≠ 0 produces a quintic equation of the form:
Solving quintic equations in terms of radicals (nth roots) was a major problem in algebra from the 16th century, when cubic and quartic equations were solved, until the first half of the 19th century, when the impossibility of such a general solution was proved with the Abel–Ruffini theorem.
Finding the roots (zeros) of a given polynomial has been a prominent mathematical problem.
Solving linear, quadratic, cubic and quartic equations in terms of radicals and elementary arithmetic operations on the coefficients can always be done, no matter whether the roots are rational or irrational, real or complex; there are formulas that yield the required solutions. However, there is no algebraic expression (that is, in terms of radicals) for the solutions of general quintic equations over the rationals; this statement is known as the Abel–Ruffini theorem, first asserted in 1799 and completely proven in 1824. This result also holds for equations of higher degree. An example of a quintic whose roots cannot be expressed in terms of radicals is x5 − x + 1 = 0.
Some quintics may be solved in terms of radicals. However, the solution is generally too complicated to be used in practice. Instead, numerical approximations are calculated using a root-finding algorithm for polynomials.
Some quintic equations can be solved in terms of radicals. These include the quintic equations defined by a polynomial that is reducible, such as x5 − x4 − x + 1 = (x2 + 1)(x + 1)(x − 1)2. For example, it has been shown [1] that
has solutions in radicals if and only if it has an integer solution or r is one of ±15, ±22440, or ±2759640, in which cases the polynomial is reducible.
As solving reducible quintic equations reduces immediately to solving polynomials of lower degree, only irreducible quintic equations are considered in the remainder of this section, and the term "quintic" will refer only to irreducible quintics. A solvable quintic is thus an irreducible quintic polynomial whose roots may be expressed in terms of radicals.
To characterize solvable quintics, and more generally solvable polynomials of higher degree, Évariste Galois developed techniques which gave rise to group theory and Galois theory. Applying these techniques, Arthur Cayley found a general criterion for determining whether any given quintic is solvable. [2] This criterion is the following. [3]
Given the equation
the Tschirnhaus transformation x = y − b/5a, which depresses the quintic (that is, removes the term of degree four), gives the equation
where
Both quintics are solvable by radicals if and only if either they are factorisable in equations of lower degrees with rational coefficients or the polynomial P2 − 1024 z Δ, named Cayley's resolvent, has a rational root in z, where
and
Cayley's result allows us to test if a quintic is solvable. If it is the case, finding its roots is a more difficult problem, which consists of expressing the roots in terms of radicals involving the coefficients of the quintic and the rational root of Cayley's resolvent.
In 1888, George Paxton Young described how to solve a solvable quintic equation, without providing an explicit formula; [4] in 2004, Daniel Lazard wrote out a three-page formula. [5]
There are several parametric representations of solvable quintics of the form x5 + ax + b = 0, called the Bring–Jerrard form.
During the second half of the 19th century, John Stuart Glashan, George Paxton Young, and Carl Runge gave such a parameterization: an irreducible quintic with rational coefficients in Bring–Jerrard form is solvable if and only if either a = 0 or it may be written
where μ and ν are rational.
In 1994, Blair Spearman and Kenneth S. Williams gave an alternative,
The relationship between the 1885 and 1994 parameterizations can be seen by defining the expression
where a = 5(4ν + 3)/ν2 + 1. Using the negative case of the square root yields, after scaling variables, the first parametrization while the positive case gives the second.
The substitution c = −m/ℓ5, e = 1/ℓ in the Spearman–Williams parameterization allows one to not exclude the special case a = 0, giving the following result:
If a and b are rational numbers, the equation x5 + ax + b = 0 is solvable by radicals if either its left-hand side is a product of polynomials of degree less than 5 with rational coefficients or there exist two rational numbers ℓ and m such that
A polynomial equation is solvable by radicals if its Galois group is a solvable group. In the case of irreducible quintics, the Galois group is a subgroup of the symmetric group S5 of all permutations of a five element set, which is solvable if and only if it is a subgroup of the group F5, of order 20, generated by the cyclic permutations (1 2 3 4 5) and (1 2 4 3).
If the quintic is solvable, one of the solutions may be represented by an algebraic expression involving a fifth root and at most two square roots, generally nested. The other solutions may then be obtained either by changing the fifth root or by multiplying all the occurrences of the fifth root by the same power of a primitive 5th root of unity, such as
In fact, all four primitive fifth roots of unity may be obtained by changing the signs of the square roots appropriately; namely, the expression
where , yields the four distinct primitive fifth roots of unity.
It follows that one may need four different square roots for writing all the roots of a solvable quintic. Even for the first root that involves at most two square roots, the expression of the solutions in terms of radicals is usually highly complicated. However, when no square root is needed, the form of the first solution may be rather simple, as for the equation x5 − 5x4 + 30x3 − 50x2 + 55x − 21 = 0, for which the only real solution is
An example of a more complicated (although small enough to be written here) solution is the unique real root of x5 − 5x + 12 = 0. Let a = √2φ−1, b = √2φ, and c = 4√5, where φ = 1+√5/2 is the golden ratio. Then the only real solution x = −1.84208... is given by
or, equivalently, by
where the yi are the four roots of the quartic equation
More generally, if an equation P(x) = 0 of prime degree p with rational coefficients is solvable in radicals, then one can define an auxiliary equation Q(y) = 0 of degree p – 1, also with rational coefficients, such that each root of P is the sum of p-th roots of the roots of Q. These p-th roots were introduced by Joseph-Louis Lagrange, and their products by p are commonly called Lagrange resolvents. The computation of Q and its roots can be used to solve P(x) = 0. However these p-th roots may not be computed independently (this would provide pp–1 roots instead of p). Thus a correct solution needs to express all these p-roots in term of one of them. Galois theory shows that this is always theoretically possible, even if the resulting formula may be too large to be of any use.
It is possible that some of the roots of Q are rational (as in the first example of this section) or some are zero. In these cases, the formula for the roots is much simpler, as for the solvable de Moivre quintic
where the auxiliary equation has two zero roots and reduces, by factoring them out, to the quadratic equation
such that the five roots of the de Moivre quintic are given by
where yi is any root of the auxiliary quadratic equation and ω is any of the four primitive 5th roots of unity. This can be easily generalized to construct a solvable septic and other odd degrees, not necessarily prime.
There are infinitely many solvable quintics in Bring–Jerrard form which have been parameterized in a preceding section.
Up to the scaling of the variable, there are exactly five solvable quintics of the shape , which are [6] (where s is a scaling factor):
Paxton Young (1888) gave a number of examples of solvable quintics:
Root: | |
An infinite sequence of solvable quintics may be constructed, whose roots are sums of nth roots of unity, with n = 10k + 1 being a prime number:
Roots: | ||
Root: | ||
Root: | ||
Root: | ||
Root: |
There are also two parameterized families of solvable quintics: The Kondo–Brumer quintic,
and the family depending on the parameters
where
Analogously to cubic equations, there are solvable quintics which have five real roots all of whose solutions in radicals involve roots of complex numbers. This is casus irreducibilis for the quintic, which is discussed in Dummit. [7] : p.17 Indeed, if an irreducible quintic has all roots real, no root can be expressed purely in terms of real radicals (as is true for all polynomial degrees that are not powers of 2).
About 1835, Jerrard demonstrated that quintics can be solved by using ultraradicals (also known as Bring radicals), the unique real root of t5 + t − a = 0 for real numbers a. In 1858, Charles Hermite showed that the Bring radical could be characterized in terms of the Jacobi theta functions and their associated elliptic modular functions, using an approach similar to the more familiar approach of solving cubic equations by means of trigonometric functions. At around the same time, Leopold Kronecker, using group theory, developed a simpler way of deriving Hermite's result, as had Francesco Brioschi. Later, Felix Klein came up with a method that relates the symmetries of the icosahedron, Galois theory, and the elliptic modular functions that are featured in Hermite's solution, giving an explanation for why they should appear at all, and developed his own solution in terms of generalized hypergeometric functions. [8] Similar phenomena occur in degree 7 (septic equations) and 11, as studied by Klein and discussed in Icosahedral symmetry § Related geometries.
A Tschirnhaus transformation, which may be computed by solving a quartic equation, reduces the general quintic equation of the form
to the Bring–Jerrard normal form x5 − x + t = 0.
The roots of this equation cannot be expressed by radicals. However, in 1858, Charles Hermite published the first known solution of this equation in terms of elliptic functions. [9] At around the same time Francesco Brioschi [10] and Leopold Kronecker [11] came upon equivalent solutions.
See Bring radical for details on these solutions and some related ones.
Solving for the locations of the Lagrangian points of an astronomical orbit in which the masses of both objects are non-negligible involves solving a quintic.
More precisely, the locations of L2 and L1 are the solutions to the following equations, where the gravitational forces of two masses on a third (for example, Sun and Earth on satellites such as Gaia and the James Webb Space Telescope at L2 and SOHO at L1) provide the satellite's centripetal force necessary to be in a synchronous orbit with Earth around the Sun:
The ± sign corresponds to L2 and L1, respectively; G is the gravitational constant, ω the angular velocity, r the distance of the satellite to Earth, R the distance Sun to Earth (that is, the semi-major axis of Earth's orbit), and m, ME, and MS are the respective masses of satellite, Earth, and Sun.
Using Kepler's Third Law and rearranging all terms yields the quintic
with:
Solving these two quintics yields r = 1.501 × 109m for L2 and r = 1.491 × 109m for L1. The Sun–Earth Lagrangian points L2 and L1 are usually given as 1.5 million km from Earth.
If the mass of the smaller object (ME) is much smaller than the mass of the larger object (MS), then the quintic equation can be greatly reduced and L1 and L2 are at approximately the radius of the Hill sphere, given by:
That also yields r = 1.5 × 109m for satellites at L1 and L2 in the Sun-Earth system.
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted i, called the imaginary unit and satisfying the equation ; every complex number can be expressed in the form , where a and b are real numbers. Because no real number satisfies the above equation, i was called an imaginary number by René Descartes. For the complex number ,a is called the real part, and b is called the imaginary part. The set of complex numbers is denoted by either of the symbols or C. Despite the historical nomenclature, "imaginary" complex numbers have a mathematical existence as firm as that of the real numbers, and they are fundamental tools in the scientific description of the natural world.
In mathematics, a polynomial is a mathematical expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication and exponentiation to nonnegative integer powers, and has a finite number of terms. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2 − yz + 1.
In mathematics, a quadratic equation is an equation that can be rearranged in standard form as where the variable x represents an unknown number, and a, b, and c represent known numbers, where a ≠ 0. The numbers a, b, and c are the coefficients of the equation and may be distinguished by respectively calling them, the quadratic coefficient, the linear coefficient and the constant coefficient or free term.
In elementary algebra, the quadratic formula is a closed-form expression describing the solutions of a quadratic equation. Other ways of solving quadratic equations, such as completing the square, yield the same solutions.
In mathematics, Galois theory, originally introduced by Évariste Galois, provides a connection between field theory and group theory. This connection, the fundamental theorem of Galois theory, allows reducing certain problems in field theory to group theory, which makes them simpler and easier to understand.
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 mathematics, the Abel–Ruffini theorem states that there is no solution in radicals to general polynomial equations of degree five or higher with arbitrary coefficients. Here, general means that the coefficients of the equation are viewed and manipulated as indeterminates.
In algebra, a cubic equation in one variable is an equation of the form in which a is not zero.
In mathematics, an nth root of a number x is a number r which, when raised to the power of the positive integer n, yields x:
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 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
In mathematics, an expression or equation is in closed form if it is formed with constants, variables and a finite set of basic functions connected by arithmetic operations and function composition. Commonly, the allowed functions are nth root, exponential function, logarithm, and trigonometric functions. However, the set of basic functions depends on the context.
In mathematics, an algebraic function is a function that can be defined as the root of an irreducible polynomial equation. Algebraic functions are often algebraic expressions using a finite number of terms, involving only the algebraic operations addition, subtraction, multiplication, division, and raising to a fractional power. Examples of such functions are:
A solution in radicals or algebraic solution is an expression of a solution of a polynomial equation that is algebraic, that is, relies only on addition, subtraction, multiplication, division, raising to integer powers, and extraction of nth roots.
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
Casus irreducibilis is the name given by mathematicians of the 16th century to cubic equations that cannot be solved in terms of real radicals, that is to those equations such that the computation of the solutions cannot be reduced to the computation of square and cube roots.
In algebra, a septic equation is an equation of the form
In mathematics, a linear recurrence with constant coefficients sets equal to 0 a polynomial that is linear in the various iterates of a variable—that is, in the values of the elements of a sequence. The polynomial's linearity means that each of its terms has degree 0 or 1. A linear recurrence denotes the evolution of some variable over time, with the current time period or discrete moment in time denoted as t, one period earlier denoted as t − 1, one period later as t + 1, etc.
{{cite book}}
: CS1 maint: location missing publisher (link)