Linear algebra (Osnabrück 2024-2025)/Part I/Lecture 19/refcontrol

In the lectures to come we will try to understand a $d\times d$-matrixMDLD/matrix $M$ (an endomorphism) by looking at expressions of the form

$a_n{M}^n+a_{n-1}{M}^{n-1}+\cdots +a_2{M}^2+a_1{M}^1+a_0{M}^0,$

where $M^i$ means the $i$-th matrix product of the matrix with itself, $M^0$being the unit matrix $E_d$. Such expressions arise by plugging matrices into polynomials. In this lecture, we introduce polynomials and the polynomial ring.

The polynomial ring over a field

Definition

The polynomial ring over a fieldMDLD/field $K$ consists of all polynomials

$P=a_0+a_{1}X+a_2{X}^2+\cdots +a_n{X}^n,$

where $a_i\in K$, $n\in \mathbb{N}$. It is endowed with componentwise addition and a multiplication, which arises by distributive continuation of the rule

$X^n\cdot X^m:=X^{n+m}.$

A polynomial

$P=\sum _{i=0}^n{a}_i{X}^i=a_0+a_{1}X+a_2{X}^2+\cdots +a_n{X}^n$

is, formally seen, nothing but the tuple $(a_0,a_1,\dots ,a_n)$, these numbers are called the coefficient of the polynomial. The polynomials are equal if and only if all their coefficients coincide. The letter $X$ is called the variable of the polynomial ring. In this context, the field $K$ is called the base field of the polynomial ring. Due to the componentwise definition of the addition, we have immediately a commutative group, with the zero polynomial (where all coefficients are $0$) as neutral element. The polynomials with $a_i=0$ for all $i\ge 1$ are called constant polynomials, they are simply written as $a_0$.

The way a polynomial is written suggests how the multiplication shall work, the product $X^n\cdot X^m$ is given by the addition of the exponents, thus $X^n\cdot X^m:=X^{n+m}$. For arbitrary polynomials, the multiplication arises from this simple multiplication rule by distributive continuation according to the law to multiply "everything with everything“. Explicitly, the multiplication is given by the following rule gegeben:

$\left(\sum _{i=0}^n{a}_i{X}^i\right)\cdot \left(\sum _{j=0}^m{a}_j{X}^j\right)=\sum _{k=0}^{n+m}{c}_k{X}^k\text{ where }{c}_k=\sum _{r=0}^k{a}_r{b}_{k-r}.$

The multiplication is associative, commutative, distributive, and the constant polynomial $1$ is its neutral element, see Exercise 19.4 . Altogether, we have a commutative ring.MDLD/commutative ring

Definition

The degree of a nonzero polynomial

$P=a_0+a_{1}X+a_2{X}^2+\cdots +a_n{X}^n$

with $a_n\ne 0$

is $n$.

We do not define a degree for the zero polynomial. The coefficient $a_n$, where $n$ is the degree of the polynomial, is called the leading coefficient of the polynomial. The term $a_n{X}^n$ is called leading term. A polynomial with leading coefficient $1$ is called normed.

The graph of a polynomial function from $ℝ$ to $ℝ$ of degree $5$.

We can plug in (or insert or evaluate at) an element $a\in K$, into a polynomial $P\in K[X]$, by replacing the variable $X$ everywhere by $a$. This gives a mapping

$K⟶K,a⟼P(a),$

which we call the polynomial function defined by the polynomial. In general, this mapping is not linear, only the polynomials of the form $P=a_{1}X$ are linear.

Die Division with remainder

Definition

Let $K$ be a field. We say that a polynomial $T\in K[X]$ divides a polynomial $P\in K[X]$, if there exists a polynomial $Q\in K[X]$ such that

$P=TQ.$

If $P$ can be divided by $T$, we also say that $P$ is a multiple of $T$. In $K[X]$ it is not possible to divide any element by any element $\ne 0$. This is different from a field, but similar no the integers $\mathbb{Z}$. However, there is an important substitute, the Euclidean division.

TheoremTheorem 19.4 change

Let $K$ be a fieldMDLD/field and let $K[X]$ be the polynomial ringMDLD/polynomial ring over $K$. Let $P,T\in K[X]$ be polynomials with $T\ne 0$. Then there exist unique polynomials $Q,R\in K[X]$ such that

$P=TQ+R\text{ and with }\mathrm{deg}(R)<\mathrm{deg}(T)\text{ or }R=0.$

Proof

We prove the statement about the existence by induction over the degreeMDLD/degree (polynomial) of $P$. If the degree of $T$ is larger than the degree of $P$, then $Q=0$ and $R=P$ is a solution.

Suppose that $\mathrm{deg}(P)=0$. By the remark just made also $\mathrm{deg}(T)=0$ holds, so $T$ is a constant polynomial, and therefore (since $T\ne 0$ and $K$ is a field) $Q=P/T$ and $R=0$ is a solution.

So suppose now that $\mathrm{deg}(P)=n$ and that the statement for smaller degrees is already proven. We write $P=a_n{X}^n+\cdots +a_{1}X+a_0$ and $T=b_k{X}^k+\cdots +b_{1}X+b_0$ with $a_n,b_k\ne 0,k\le n$. Then setting $H=\frac{a_n}{b_k}{X}^{n-k}$ we have the relation

$\begin{array}{cc}{P}^{\prime }& :=P-TH\\ & =0X^n+(a_{n-1}-\frac{a_n}{b_k}{b}_{k-1})X^{n-1}+\cdots +(a_{n-k}-\frac{a_n}{b_k}{b}_0)X^{n-k}+a_{n-k-1}{X}^{n-k-1}+\cdots +a_0.\end{array}$

The degree of this polynomial $P^{\prime }$ is smaller than $n$ and we can apply the induction hypothesis to it. That means there exist $Q^{\prime }$ and $R^{\prime }$ such that

$P^{\prime }=T{Q}^{\prime }+R^{\prime }\text{ and with }\mathrm{deg}(R^{\prime })<\mathrm{deg}(T)\text{ or }{R}^{\prime }=0.$

From this we get altogether

$P=P^{\prime }+TH=T{Q}^{\prime }+TH+R^{\prime }=T(Q^{\prime }+H)+R^{\prime },$

so that $Q=Q^{\prime }+H$ and $R=R^{\prime }$ is a solution.

To prove uniqueness, let $P=TQ+R=T{Q}^{\prime }+R^{\prime }$, both fulfilling the stated conditions. Then $T(Q-Q^{\prime })=R^{\prime }-R$. Since the degree of the difference $R^{\prime }-R$ is smaller than $\mathrm{deg}(T)$, this implies $R=R^{\prime }$ and so $Q=Q^{\prime }$.

$◻$

The polynomial $T$ divides $P$ if and only if the remainder in the Euclidean division is $0$. The proof of this theorem is constructive, that is, it describes a method how to perform the Euclidean division effectively. For this, it is necessary to be able to perform the operations in the base field. We give two examples, one over the rational numbers and one over the complex numbers.

Example Create referencenumber

We want to apply the Euclidean divisionMDLD/Euclidean division (over $\mathbb{Q}$)

$P=6X^3+X+1\text{ divided by }T=3X^2+2X-4.$

So we want to divide a polynomial of degree $3$ by a polynomial of degree $2$, hence the quotient and also the remainder have (at most) degree $1$. For the first step, we ask with which term we have to multiply $T$ to achieve that the product and $P$ have the same leading term. This is $2X$. The product is

$2X(3X^2+2X-4)=6X^3+4X^2-8X.$

The difference between $P$ and this product is

$6X^3+X+1-(6X^3+4X^2-8X)=-4X^2+9X+1.$

We continue the division by $T$ with this polynomial, which we call $P^{\prime }$. In order to get coincidence with the leading coefficient we have to multiply $T$ with $\frac{-4}{3}$. This yields

$-\frac{4}{3}T=-\frac{4}{3}(3X^2+2X-4)=-4X^2-\frac{8}{3}X+\frac{16}{3}.$

The difference between this and $P^{\prime }$ is therefore

$-4X^2+9X+1-(-4X^2-\frac{8}{3}X+\frac{16}{3})=\frac{35}{3}X-\frac{13}{3}.$

This is the remainder and altogether we get

$6X^3+X+1=(3X^2+2X-4)(2X-\frac{4}{3})+\frac{35}{3}X-\frac{13}{3}.$

Example Create referencenumber

We perform the Euclidean divisionMDLD/Euclidean division (polynomial)

$P=(4+3\mathrm{i})X^3+X^2+5\mathrm{i}\text{ divided by }T=(1+\mathrm{i})X^2+X-3+2\mathrm{i}.$

The inverse of $1+\mathrm{i}$ is $\frac{1}{2}-\frac{1}{2}\mathrm{i}$, and therefore we have

$\begin{array}{cc}(4+3\mathrm{i})(1+\mathrm{i}{)}^{-1}& =(4+3\mathrm{i})(\frac{1}{2}-\frac{1}{2}\mathrm{i})\\ & =2+\frac{3}{2}-2\mathrm{i}+\frac{3}{2}\mathrm{i}\\ & =\frac{7}{2}-\frac{1}{2}\mathrm{i}.\end{array}$

Hence, $Q$ starts with $(\frac{7}{2}-\frac{1}{2}\mathrm{i})X$, and we have

$\begin{array}{cc}((1+\mathrm{i})X^2+X-3+2\mathrm{i})(\frac{7}{2}-\frac{1}{2}\mathrm{i})X& =(4+3\mathrm{i})X^3+(\frac{7}{2}-\frac{1}{2}\mathrm{i})X^2+(-\frac{19}{2}+\frac{17}{2}\mathrm{i})X\\ \end{array}$

We have to subtract this term from $P$ and we obtain

$\begin{array}{cc}P-((4+3\mathrm{i})X^3+(\frac{7}{2}-\frac{1}{2}\mathrm{i})X^2+(-\frac{19}{2}+\frac{17}{2}\mathrm{i})X)& =(-\frac{5}{2}+\frac{1}{2}\mathrm{i})X^2+(\frac{19}{2}-\frac{17}{2}\mathrm{i})X+5\mathrm{i}\\ \end{array}$

We apply the same procedure to this polynomial (which we call $P^{\prime }$). We compute

$\begin{array}{cc}(-\frac{5}{2}+\frac{1}{2}\mathrm{i})(\frac{1}{2}-\frac{1}{2}\mathrm{i})& =-1+\frac{3}{2}\mathrm{i}\\ \end{array}$

Therefore, the constant term of $Q$ equals $-1+\frac{3}{2}\mathrm{i}$, and we obtain

$((1+\mathrm{i})X^2+X-3+2\mathrm{i})(-1+\frac{3}{2}\mathrm{i})=(-\frac{5}{2}+\frac{1}{2}\mathrm{i})X^2+(-1+\frac{3}{2}\mathrm{i})X-\frac{13}{2}\mathrm{i}.$

We subtract this from $P^{\prime }$ and get

$P^{\prime }-((-\frac{5}{2}+\frac{1}{2}\mathrm{i})X^2+(-1+\frac{3}{2}\mathrm{i})X-\frac{13}{2}\mathrm{i})=(\frac{21}{2}-10\mathrm{i})X+\frac{23}{2}\mathrm{i}.$

This term is the remainder $R$, the Euclidean division altogether is

$\begin{array}{cc}(4+3\mathrm{i})X^3+X^2+5\mathrm{i}& =((1+\mathrm{i})X^2+X-3+2\mathrm{i})((\frac{7}{2}-\frac{1}{2}\mathrm{i})X-1+\frac{3}{2}\mathrm{i})+(\frac{21}{2}-10\mathrm{i})X+\frac{23}{2}\mathrm{i}\\ \end{array}$

Zeroes

A zero of a polynomial $P$ is an element $a\in K$ such that $P(a)=0$. A polynomial does not necessarily have zeroes, and this depends also on the base field. The polynomial $X^2+1$ has no real zero, but it has the complex zeroes $\mathrm{i}$ and $-\mathrm{i}$. As an element in $ℝ[X]$, the polynomial $X^2+1$ can not be written as a product of simpler polynomials. However, in $ℂ[X]$, it has the factor decomposition

$X^2+1=(X-\mathrm{i})(X+\mathrm{i}).$

Remark

Let $K$ be a field,MDLD/field let $K[X]$ be the polynomial ringMDLD/polynomial ring (1) over $K$ and $a\in K$. Then the evaluation mapping

$K[X]⟶K,P⟼P(a),$

is $K$-linear.MDLD/linear Moreover, we have

$(PQ)(a)=P(a)Q(a),$

see Exercise 19.8 .

LemmaLemma 19.8 change

Let $K$ be a fieldMDLD/field and let $K[X]$ be the polynomial ringMDLD/polynomial ring over $K$. Let $P\in K[X]$ be a polynomial and $a\in K$. Then $a$ is a zeroMDLD/zero (polynomial)

of $P$ if and only if $P$ is a multiple of the linear polynomial $X-a$.

Proof

If $P$ is a multiple of $X-a$, then we can write

$P=(X-a)Q$

with another polynomial $Q$. Inserting $a$ yields

$P(a)=(a-a)Q(a)=0.$

In general, there exists, due to Theorem 19.4 , a representation

$P=(X-a)Q+R,$

where either $R=0$ or the degree of $R$ is $0$, so in both cases $R$ is a constant. Inserting $a$ yields

$P(a)=R.$

So if $P(a)=0$ holds, then the remainder must be $R=0$, and this means $P=(X-a)Q$.

$◻$

CorollaryCorollary 19.9 change

Let $K$ be a fieldMDLD/field and let $K[X]$ be the polynomial ringMDLD/polynomial ring over $K$. Let $P\in K[X]$ be a polynomial ($\ne 0$) of degreeMDLD/degree (polynomial)

$d$. Then $P$ has at most $d$ zeroes.

Proof

We prove the statement by induction over $d$. For $d=0,1$ the statement holds. So suppose that $d\ge 2$ and that the statement is already proven for smaller degrees. Let $a$ be a zero of $P$ (if $P$ does not have a zero at all, we are done anyway). Hence, $P=Q(X-a)$ by Lemma 19.8 and the degree of $Q$ is $d-1$, so we can apply to $Q$ the induction hypothesis. The polynomial $Q$ has at most $d-1$ zeroes. For $b\in K$ we have $P(b)=Q(b)(b-a)$. This can be zero, due to Lemma 3.5   (5), only if one factor is $0$, so the zeroes of $P$ are $a$ or a zero of $Q$. Hence, there are at most $d$ zeroes of $P$.

$◻$

The Fundamental theorem of algebra

The following Fundamental theorem of algebra holds, which we state without a proof.

TheoremCreate referencenumber

Every nonconstant polynomialMDLD/polynomial (1K) $P\in ℂ[X]$ over the complex numbersMDLD/complex numbers has a

zero.MDLD/zero (function)

The Fundamental theorem of algebra implies that every polynomial $P\in ℂ[X]$ different from $0$ has a factorization into linear factors, that is,

$P=c(X-z_1)(X-z_2)\cdots (X-z_n),$

where, up to the ordering, the complex numbers $c,z_1,\dots ,z_n$ are uniquely determined (and repetitions may happen).

Rational functionen

The polynomial ring $K[X]$ is a commutative ring,MDLD/commutative ring but not a field.MDLD/field However, we can construct a field which contains the polynomial ring with the help of the so-called formal-rational functions, in a similar way as we can construct the rational numbers $\mathbb{Q}$ from the integers $\mathbb{Z}$. For this, we define

$K(X):=\{\frac{P}{Q}\mid P,Q\in K[X],Q\ne 0\},$

where we identify, like in $\mathbb{Q}$, two fractions $\frac{P}{Q}$ and $\frac{P^{\prime }}{Q^{\prime }}$, whenever

$P{Q}^{\prime }=P^{\prime }Q$

holds. In this way, the field of rational functions (over $K$) arises.

A fraction $P/Q$ of polynomials may be considered as a function which is defined outside the zeroes of the denominator. The example shows the graph of the rationale function $1/X$.

The formal expression $P/Q$ can be considered as a function in the following way.

Definition

Let $K$ be a field.MDLD/field For polynomialsMDLD/polynomials (1K) $P,Q\in K[X]$, $Q\ne 0$, the functionMDLD/function

$D⟶K,z⟼\frac{P(z)}{Q(z)},$

where $D$ is the complementMDLD/complement of the zeroesMDLD/zeroes

of $Q$, is called a rational function.

Next to the polynomial functions, the simplest functions are the rational functions.

Footnotes

<< | Linear algebra (Osnabrück 2024-2025)/Part I | >> PDF-version of this lecture Exercise sheet for this lecture (PDF)