Skip to main content

Section Polynomials

Let \(R\) be a ring with unity. We give definition of a polynomial in one variable with coefficients in a ring \(R\text{.}\)

Definition 1. Polynomial in one variable.

A polynomial in one variable with coefficients in a ring \(R\) is defined as a map \(P\colon\mathbb{Z}_{\geq 0}\to R\) such that the image of \(n\in\Z_{\geq 0}\) under \(P\) is denoted by \(P_n\) and the set \(\{n\in\mathbb{Z}_{\geq 0}:P_n\neq 0\}\) is finite.

Example 2.

Given \(r\in R\) we define \(r\colon\Z_{\geq 0}\to R\) such that \(0\mapsto r\) and \(n\mapsto 0\) for all \(n\in\N\text{.}\)

Example 3.

We define \(X\colon\Z_{\geq 0}\to R\) such that \(1\mapsto 1\) and \(n\mapsto 0\) for all \(n\neq 1\text{.}\)

Definition 4. Ring of polynomials.

For two polynomials \(P,Q\) their addition, \(P+Q\) is defined as the addition of functions, i.e., \((P+Q)_n=P_n+Q_n\text{.}\) Their product is defined as follows:
\begin{equation*} (PQ)_n=\sum_{i+j=n}P_i\cdot Q_j \end{equation*}
The set of all polynomials in one indeterminate with coefficients in a ring \(R\) is denoted by \(R[X]\text{.}\) The set \(R[X]\) is a ring with unity, where the unity is the polynomial \(1\colon\Z_{\geq 0}\to R\) such that \(0\mapsto 1\) and \(n\mapsto 0\) for all \(n\neq 0\text{.}\)

Remark 5.

Note that every polynomial \(P\) can be uniquely written as \(P=\sum P_i\cdot X^i\text{.}\) So, from now onwards write \(r_0+r_1X+\cdots+r_nX^n\) for the polynomial that maps \(i\in\Z_{\geq 0}\) to \(r_i\) for \(i=0,1,\ldots,n\) and to \(0\) for \(i \geq n+1\text{.}\)
As usual, for a nonzero polynomial \(P\) the largest integer \(n\) for which the coefficient of \(X^n\) is not zero is called the leading coefficient of \(P\) and \(n\) is called the degree of \(P\text{.}\) A polynomial \(P\) is called a monic polynomial if the leading coefficient is \(1\text{.}\)

Definition 6. Polynomial function.

Let \(R\) be a ring and let \(P=r_0+r_1X+\cdots+r_nX^n\) be a polynomial in \(R[X]\text{.}\) The polynomial function \(P(\cdot)\colon R\to R\) is defined as follows:
\begin{equation*} P(x)=r_0+r_1x+\cdots+r_nx^n\quad\text{ for }x\in R. \end{equation*}

Definition 7. Root of a polynomial.

Keep notation as in DefinitionΒ 6. An element \(r\in R\) is called a root of the polynomial \(P\in R[X]\) if \(P(r)=0\text{.}\)

Checkpoint 8.

Convince yourself that the usual definition given in terms of formal sums of monomials is equivalent to the definition given above.

Checkpoint 9.

Convince yourself that DefinitionΒ 1 distinguishes a polynomial and a polynomial function.
Indeed, let \(R=\{r_1,r_2,\ldots,r_n\}\) be a finite field. The polynomial \(P=(X-r_1)(X-r_2)\cdots (X-r_n)\) is not a zero polynomial, but the polynomial function \(P\colon R\to R\) is a zero function.

Definition 10. Ring of polynomials in several variables.

Let \(n\in\N\text{.}\) The ring of polynomials in \(n\) variables with coefficients in a ring \(R\) is denoted by \(R[X_1,\ldots,X_n]\text{.}\) It is defined in a similar way as above DefinitionΒ 4.
We state the following theorem without proof. The proof is similar to the proof of the division algorithm in field case.

Example 12.

Let \(I=\{f\in\Q[X,Y]:f(t^2,t^3)=0\text{ for }t\in\Q\}\text{.}\) We show that \(Y^2-X^3\) divides \(f\in I\text{.}\)
Suppose that \(A=\Q[X]\text{.}\) Note that \(\Q[X,Y]=A[Y]\text{.}\) As \(Y^2-X^3\) is a monic polynomial in \(A[Y]\text{,}\) there exists \(Q,R\in A[Y]\) such that \(f=Q(X,Y)(Y^2-X^3)+R(X,Y)\) with \(R=a(X)Y+b(X)\text{.}\) Therefore, \(a(t^2)t^3+b(t^2)=0\) for all \(t\in\Q\text{.}\) As \(\Q\) is an infinite field, we get that \(a(Z^2)Z^3+b(Z^2)=0\in\Q[Z]\text{.}\) Hence, by separating the odd and the even degree terms, we get that \(a=0=b\text{,}\) i.e., \(R=0\text{.}\) Therefore, \((Y^2-X^3)\) divides \(f\text{.}\)

Checkpoint 13.

Let \(A\) be a commutative ring with unity. Show that \(a\in A\) is a root of a polynomial \(P\in A[X]\) if and only if \((X-a)\) divides \(P\text{.}\)