# Polynomial/Advanced

In algebra, a **polynomial** is, roughly speaking, a formal expression obtained from constant numbers called coefficients and one or more variables by making a finite number of additions and multiplications. For instance, is a polynomial involving one variable, *x* (often called a polynomial *in one variable*), whereas is a polynomial in two variables, and .

In order to add and multiply polynomials, we need only know how to add and multiply their coefficients. In abstract algebra, an abstract collection of objects that can be added and multiplied subject to the usual algebraic rules is called a ring. Polynomials can be defined with coefficients from an arbitrary ring, although they will often exhibit unfamiliar properties not shared by the more common polynomials with real number coefficients. Polynomials with coefficients in an arbitrary ring form a ring themselves, with the usual addition and multiplication operations for polynomials, called a polynomial ring.

When the polynomials have coefficients in a special type of ring, called a field, then they behave in many ways similarly to polynomials with real number coefficients. Polynomials with real number coefficients are discussed on the main polynomial page. This "advanced" version discusses polynomials with coefficients in a field.

## Contents

## Review of fields

A field is a set of objects, numbers if you like, which can be added and multiplied. A field contains distinct additive and multiplicative identities, denoted 0 and 1. The objects in a field can also be subtracted and divided, with the usual restriction that division by 0 is not allowed. In particular, the fraction is defined for any *a* and *b* in the field with . Finally, we require the addition and multiplication operations to be both commutative and associative, and for multiplication to be distributive over addition. All of the usual algebraic rules for manipulating sums, differences, products, and quotients of numbers and fractions hold for the elements of a field.

## Polynomials over a field

### Polynomials in one variable

There are many possible equivalent approaches to defining polynomials. For instance, they can be defined as the convolution algebra of the monoid of non-negative powers of the generator *X* of a cyclic group. This method also allows one to define non-commuting polynomial rings, and to view polynomials in one variable as a special case. Alternatively, polynomials can be defined as infinite sequences of coefficients such that all but a finite number of coefficients are equal to zero. This approach is useful because it allows one to view a polynomial ring as a subring of a ring of formal power series. This is the approach that will be used in this article.

Let us consider some expressions like , ½*X* ³+*X*−√2 , or . We can write all of them as follows:

This suggests that a polynomial can be entirely defined by giving a sequence of numbers, which are called its *coefficients*, all of them being zero from some rank. For instance the three polynomials above can be written respectively , , and , the dots meaning the sequence continues with an infinity of zeros. This leads to the definition below.

**Definition.** A *polynomial* , over the ring is a sequence of elements of , called the *coefficients* of , this sequence containing only a finite number of nonzero terms. The rank of the last nonzero term is called the *degree* of the polynomial.

Hence, the degrees of the three polynomials given above are respectively 2, 3 and 5. By convention, the degree of is set to .

This definition may surprise the reader, because in reality, one thinks of a polynomial as an expression of the form rather than . We will progressively show how to return to this usual way of writing a polynomial. First, we identify any element of the ring to the polynomial . For instance, we write only instead of the cumbersome , (or in the familiar fashion ).

Secondly, we merely denote by the polynomial

This is natural, as in the familiar fashion this sequence corresponds to It remains to give a sense to , , etc. This will be made in the next two subsections.

### Polynomials in several variables

## Operations

We now define addition and multiplication of polynomials.

#### Addition

With the traditional notation, if we have and , we want to have , that is, one wants to add coefficients separately for each degree. This leads to the formal definition below.

**Definition.** Given two polynomials and , the sum is defined by .

#### Multiplication

Multiplication is harder to define. Let us begin with an example using traditional notation. For and , we want to have

One can observe that the coefficient of say, , is obtained by adding , and , that is, by adding all the so that , where the denote the coefficients of and the those of . Those mechanics lead to give the definition below.

**Definition.** Given two polynomials and , the product is defined by , where for every index , the coefficient is given by .

The reader which is upset by those cumbersome notations should just retain that this definition allows to multiply polynomials (considered as mere sequences of coefficients) as one is used to do in elementary algebra (using the traditional notation, as in the example). The only striking fact is that in our construction, does not represent a number, but a pure abstract entity for which we have defined some rules of calculation.

#### The algebra

With the definition above, one can verify that the product of the polynomial by itself, that is , is the sequence . More generally, for each natural number , one can verify that the -th power of is given by , where the is the coefficient of index and all other coefficients are zeros. In particular, we have the usual convention , which we identified to the constant .

Now, any polynomial is *exactly* equal to , where the addition and the powers (which are mere repetitions of multiplications) are defined as in the preceding subsections. Our whole construction legitimates the traditional notation, and from now on, we will only use the later, with which calculations use natural rules of elementary algebra. It is however important to remember that the "variable" did not denote some number in our construction, but a particular sequence of coefficients. We have succeeded in defining polynomials in a purely formal manner.

#### Operations and degree: the algebra

## Polynomials versus polynomial functions

It may be convenient to think of a polynomial as a function of its variables, that is, or . Such a function is called a polynomial function. But in reality, both concepts are different, the unspecified variables being purely *formal* entities when one thinks of an abstract polynomial, whereas they are meant to be replaced by *any number* when one thinks of a function. The distinction is important in abstract algebra, because what we have called "constant numbers" is more generally replaced by any ring, and for some rings the two concepts cannot be identified. There is not such a problem with polynomials over rings of usual numbers like integers, rational, real or complex numbers. Still it is important to understand that calculations with polynomials can be conceived in an only formal way, without giving any special ontological status to the variables. To make the distinction clear, it is common in algebra to denote the abstract variables with capital letters (, , etc.), while variables of functions are still denoted with lowercase letters. We will use this convention in what follows.