logo

Polynomial Vector Spaces 📂Linear Algebra

Polynomial Vector Spaces

Definition1

Polynomial

A polynomial with coefficients from a field FF is defined for a non-negative integer nn as the following form.

f(x)=anxn+an1xn1++a1x+a0 \begin{equation} f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{1}x + a_{0} \end{equation}

Here, each akFa_{k} \in F is called the coefficient of xkx^{k}. If an=an1==a0=0a_{n}=a_{n-1}=\cdots=a_{0}=0, then f(x)f(x) is called a zero polynomial.

The degree of a polynomial is the largest power of xx with a coefficient 00 not equal to zero in the form of (1)(1). For a non-zero constant cc, the degree of f(x)=cf(x) = c is 00, and the degree of the zero polynomial is defined as 1-1 for convenience.

Polynomial Vector Space

Let f,gf, g be a polynomial with coefficients from FF.

f(x)=anxn+an1xn1++a1x+a0 f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{1}x + a_{0}

g(x)=bmxm+bm1xm1++b1x+b0 g(x) = b_{m}x^{m} + b_{m-1}x^{m-1} + \cdots + b_{1}x + b_{0}

Without loss of generality, assume that mnm \le n and define bm+1=bm+2==bn=0b_{m+1}=b_{m+2}=\cdots=b_{n}=0. Then g(x)g(x) can be written as follows.

g(x)=bnxn+bn1xn1++b1x+b0 g(x) = b_{n}x^{n} + b_{n-1}x^{n-1} + \cdots + b_{1}x + b_{0}

Now, let’s define the sum of two polynomials f(x)f(x) and g(x)g(x) as follows.

f(x)+g(x)=(an+bn)xn+(an1+bn1)xn1+(a1+b1)x+(a0+b0) f(x) + g(x) = (a_{n} + b_{n})x^{n} + (a_{n-1} + b_{n-1})x^{n-1} + \cdots (a_{1} + b_{1})x + (a_{0} + b_{0})

For cFc \in F, define scalar multiplication as follows.

cf(x)=canxn+can1xn1++ca1x+ca0 cf(x) = ca_{n}x^{n} + ca_{n-1}x^{n-1} + \cdots + ca_{1}x + ca_{0}

Then, with respect to this addition and scalar multiplication, the set of all polynomials with coefficients from FF becomes a FF-vector space, denoted by P(F)P(F).

Description

The set of all polynomials with degree less than or equal to nn is denoted by Pn(F)P_{n}(F). P(F)P(F) includes all polynomials of any degree, whereas Pn(F)P_{n}(F) includes all polynomials of degree less than or equal to nn. Note that both are infinite sets and both are sets of polynomials (not sets of infinite series).

P(F)={anxn++a1x+a0:nN,aiF} P(F) = \left\{ a_{n}x^{n} + \cdots + a_{1}x + a_{0} : n \in \mathbb{N}, a_{i} \in F \right\}

Pn(F)={akxk++a1x+a0:1kn,aiF} P_{n}(F) = \left\{ a_{k}x^{k} + \cdots + a_{1}x + a_{0} : 1 \le k \le n, a_{i} \in F \right\}

Moreover, while P(F)P(F) includes polynomials of all degrees and is thus infinite-dimensional, Pn(F)P_{n}(F) is of nn dimensions.


  1. Stephen H. Friedberg, Linear Algebra (4th Edition, 2002), p9-10 ↩︎