Polynomial transformation

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.

Simple examples

Translating the roots

Let

$P(x)=a_0{x}^n+a_1{x}^{n-1}+\cdots +a_n$

be a polynomial, and

${\alpha }_1,\dots ,{\alpha }_n$

be its complex roots (not necessarily distinct).

For any constant Template:Math, the polynomial whose roots are

${\alpha }_1+c,\dots ,{\alpha }_n+c$

is

$Q(y)=P(y-c)=a_0(y-c{)}^n+a_1(y-c{)}^{n-1}+\cdots +a_n.$

If the coefficients of Template:Math are integers and the constant $c=\frac{p}{q}$ is a rational number, the coefficients of Template:Math may be not integers, but the polynomial Template:Math has integer coefficients and has the same roots as Template:Math.

A special case is when $c=\frac{a_1}{n{a}_0}.$ The resulting polynomial Template:Math does not have any term in Template:Math.

Reciprocals of the roots

Let

$P(x)=a_0{x}^n+a_1{x}^{n-1}+\cdots +a_n$

be a polynomial. The polynomial whose roots are the reciprocals of the roots of Template:Math as roots is its reciprocal polynomial

$Q(y)=y^{n}P\left(\frac{1}{y}\right)=a_n{y}^n+a_{n-1}{y}^{n-1}+\cdots +a_0.$

Scaling the roots

Let

$P(x)=a_0{x}^n+a_1{x}^{n-1}+\cdots +a_n$

be a polynomial, and Template:Math be a non-zero constant. A polynomial whose roots are the product by Template:Math of the roots of Template:Math is

$Q(y)=c^{n}P\left(\frac{y}{c}\right)=a_0{y}^n+a_{1}c{y}^{n-1}+\cdots +a_n{c}^n.$

The factor Template:Math appears here because, if Template:Math and the coefficients of Template:Math are integers or belong to some integral domain, the same is true for the coefficients of Template:Math.

In the special case where $c=a_0$, all coefficients of Template:Math are multiple of Template:Math, and $\frac{Q}{c}$ is a monic polynomial, whose coefficients belong to any integral domain containing Template:Math and the coefficients of Template:Math. This polynomial transformation is often used to reduce questions on algebraic numbers to questions on algebraic integers.

Combining this with a translation of the roots by $\frac{a_1}{n{a}_0}$, allows to reduce any question on the roots of a polynomial, such as root-finding, to a similar question on a simpler polynomial, which is monic and does not have a term of degree Template:Math. For examples of this, see Cubic function § Reduction to a depressed cubic or Quartic function § Converting to a depressed quartic.

Transformation by a rational function

All preceding examples are polynomial transformations by a rational function, also called Tschirnhaus transformations. Let

$f(x)=\frac{g(x)}{h(x)}$

be a rational function, where Template:Math and Template:Math are coprime polynomials. The polynomial transformation of a polynomial Template:Math by Template:Math is the polynomial Template:Math (defined up to the product by a non-zero constant) whose roots are the images by Template:Math of the roots of Template:Math.

Such a polynomial transformation may be computed as a resultant. In fact, the roots of the desired polynomial Template:Math are exactly the complex numbers Template:Math such that there is a complex number Template:Math such that one has simultaneously (if the coefficients of Template:Math and Template:Math are not real or complex numbers, "complex number" has to be replaced by "element of an algebraically closed field containing the coefficients of the input polynomials")

$\begin{array}{rl}P(x)& =0\\ yh(x)-g(x)& =0.\end{array}$

This is exactly the defining property of the resultant

${\mathrm{Res}}_x(yh(x)-g(x),P(x)).$

This is generally difficult to compute by hand. However, as most computer algebra systems have a built-in function to compute resultants, it is straightforward to compute it with a computer.

Properties

If the polynomial Template:Math is irreducible, then either the resulting polynomial Template:Math is irreducible, or it is a power of an irreducible polynomial. Let $\alpha$ be a root of Template:Math and consider Template:Math, the field extension generated by $\alpha$. The former case means that $f(\alpha )$ is a primitive element of Template:Math, which has Template:Math as minimal polynomial. In the latter case, $f(\alpha )$ belongs to a subfield of Template:Math and its minimal polynomial is the irreducible polynomial that has Template:Math as power.

Transformation for equation-solving

Polynomial transformations have been applied to the simplification of polynomial equations for solution, where possible, by radicals. Descartes introduced the transformation of a polynomial of degree Template:Math which eliminates the term of degree Template:Math by a translation of the roots. Such a polynomial is termed depressed. This already suffices to solve the quadratic by square roots. In the case of the cubic, Tschirnhaus transformations replace the variable by a quadratic function, thereby making it possible to eliminate two terms, and so can be used to eliminate the linear term in a depressed cubic to achieve the solution of the cubic by a combination of square and cube roots. The Bring–Jerrard transformation, which is quartic in the variable, brings a quintic into Bring-Jerrard normal form with terms of degree 5,1, and 0.

See also

• Tschirnhaus transformation
• Adamchik transformation