and denote $$P[F] = {x \mapsto \sum\limits_{k=0}^{n} c_{k}x^{k} : n \in \mathbb{Z}{\geq 0}; c{0}, \dots, c_{n} \in F }$$ the Set of all Polynomials over F. Then P[F] forms a Vector Subspace
, it suffices to check we are closed under scaling and addition.
Suppose c∈F and p,r∈P[F]. Then there exist $n, m \in \mathbb{Z}{\geq 0}sothat$\begin{align*}
&p = c{0} + c_{1} x + \cdots + c_{n} x^{n}\\ &r = d_{0} + d_{1} x + \cdots + d_{m} x^{m}\\ \end{align*}$$
Without Loss of Generality we can take n≥m and then rewrite r=d0+d1x+⋯+dmxm+dm+1xm+1+⋯dnxn, taking dm+1,…,dn=0. Then we get that cp+r=k=0∑ncckxk+k=0∑ndkxk=k=0∑n(cck+dk)xk∈P[F]