# Mathematics for Applied Sciences (Osnabrück 2023-2024)/Part I/Lecture 6/latex

\setcounter{section}{6}
\zwischenueberschrift{Polynomials}
Mathematical mappings are usually given by a mathematical term, an expression which describes how to get (compute) from a given number its value. Here we consider polynomial functions, which are built in an easy manner. Their definition and basic properties work over any field.
\inputdefinition { } {
Let $K$ be a field. An expression of the form \mavergleichskettedisp {\vergleichskette { P } { =} { a_0 + a_1X+a_2X^2 + \cdots + a_nX^n } { } { } { } { } { } { } }{,} with \mavergleichskette {\vergleichskette { a_i } { \in }{ K } { }{ } { }{ } { }{ } } and \mavergleichskette {\vergleichskette { n } { \in }{ \N } { }{ } { }{ } { }{ } }{,}
The numbers \mathl{a_0, a_1 , \ldots , a_n} are called the \stichwort {coefficients} of the polynomial. Two polynomials are equal if all their coefficients coincide. The polynomials with \mavergleichskette {\vergleichskette {a_i } { = }{ 0 } { }{ } { }{ } { }{ } } for all \mavergleichskette {\vergleichskette {i } { \geq }{1 } { }{ } { }{ } { }{ } } are called \stichwort {constant polynomials} {,} we write simply $a_0$ for them. In the \stichwort {zero polynomial} {,} all coefficients equal $0$. Using the sum symbol, one can write a polynomial briefly as \mathl{\sum_{i = 0}^n a_iX^i}{.}
\inputdefinition { } {
The \definitionswort {degree} of a nonzero polynomial \mavergleichskettedisp {\vergleichskette {P } { =} {a_0 + a_1X+a_2X^2 + \cdots + a_nX^n } { } { } { } { } { } { } } with \mavergleichskette {\vergleichskette {a_n } { \neq }{ 0 } { }{ } { }{ } { }{ } }
The zero polynomial does not have a degree. The coefficient $a_n$, where $n$ is the degree of the polynomial, is called the \stichwort {leading coefficient} of the polynomial. The term \mathl{a_nX^n} is called the \stichwort {leading term} of the polynomial.
The set of all polynomials over a field $K$ is called \stichwort {polynomial ring} over $K$, it is denoted by \mathl{K[X]}{,} where $X$ is the \stichwort {variable} of the polynomial ring.
Two polynomials \mathdisp {P= \sum_{i = 0}^n a_iX^i \text{ and } Q= \sum_{i = 0}^m b_iX^i} { } can be added by adding the components, i.e. the coefficients of the sum \mathl{P+Q} are just the sums of the coefficients of the two polynomials. In case \mavergleichskette {\vergleichskette { n } { > }{ m } { }{ } { }{ } { }{ } }{,} the \anfuehrung{missing} coefficients of $Q$ are to be interpreted as $0$. This addition is obviously associative and commutative, the zero polynomial is the neutral element and the negative polynomial $-P$ is obtained by taking from every coefficient of $P$ its negative.
One can also multiply two polynomials, one puts \mavergleichskettedisp {\vergleichskette { X^n \cdot X^m } { \defeq} { X^{n+m} } { } { } { } { } { } { } } and extends this multiplication rule so that distributivity holds. This means one multiplies each summand with each summand and adds then everything together. One can describe this multiplication also explicitly by the rule: \mathdisp {{ \left( \sum_{ i = 0 }^{ n } a_{ i } X^{ i } \right) } \cdot { \left( \sum_{ j = 0 }^{ m } b_{ j } X^{ j } \right) } = \sum_{ k = 0 }^{ n+m } c_{ k } X^{ k } \text{ with } c_{ k} =\sum_{ r= 0}^{ k } a_{ r } b_{ k - r }} { . } For the degree the following rules hold. \aufzaehlungzwei { \mavergleichskettedisp {\vergleichskette { \operatorname{deg} \, (P+Q) } { \leq} { \max \{ \operatorname{deg} \, (P),\, \operatorname{deg} \, (Q) \} } { } { } { } { } { } { } }{.} } { \mavergleichskettedisp {\vergleichskette { \operatorname{deg} \, (P \cdot Q) } { =} { \operatorname{deg} \, (P) + \operatorname{deg} \, (Q) } { } { } { } { } { } { } }{.} }
If a polynomial \mavergleichskette {\vergleichskette { P } { \in }{ K[X] } { }{ } { }{ } { }{ } } and an element \mavergleichskette {\vergleichskette { a } { \in }{ K } { }{ } { }{ } { }{ } } are given, then one can \stichwort {insert} $a$ into $P$ meaning that one replaces everywhere the variable $X$ by $a$. This yields a mapping \mathdisp {K \longrightarrow K , a \longmapsto P(a)} { , }
which is called the corresponding \stichwort {polynomial function} {.}
If \mathkor {P} {and} {Q} are polynomials, then the composition \mathl{P \circ Q} is described in the following way: one has to replace everywhere in $P$ the variable $X$ by $Q$ and then simplify this expression. The result is again a polynomial. The order of \mathkor {P} {and} {Q} is important for this.
\zwischenueberschrift{Euclidean division}
If we have a polynomial over the reals, we are interested in its zeros, its growth behavior, local maxima and minima. For these questions, the euclidean division for polynomials \zusatzklammer {long division} is important.
\faktsituation \faktvoraussetzung {Let $K$ be a field and let $K[X]$ be the polynomial ring over $K$. Let \mavergleichskette {\vergleichskette {P,T } { \in }{ K[X] } { }{ } { }{ } { }{ } } be polynomials with \mavergleichskette {\vergleichskette {T } { \neq }{0 } { }{ } { }{ } { }{ } }{.}} \faktfolgerung {Then there exist unique polynomials \mavergleichskette {\vergleichskette {Q,R } { \in }{ K[X] } { }{ } { }{ } { }{ } } such that \mathdisp {P=TQ+R \text{ and with } \operatorname{deg} \, (R) < \operatorname{deg} \, (T) \text{ or } R= 0} { . } } \faktzusatz } {
We prove the statement about the existence by induction over the degree of $P$. If the degree of $T$ is larger than the degree of $P$, then \mathkor {Q=0} {and} {R=P} is a solution.
Suppose that \mavergleichskette {\vergleichskette { \operatorname{deg} \, (P) } { = }{ 0 } { }{ } { }{ } { }{ } }{.} By the remark just made also \mavergleichskette {\vergleichskette { \operatorname{deg} \, (T) } { = }{ 0 } { }{ } { }{ } { }{ } } holds, so $T$ is a constant polynomial, and therefore (since \mavergleichskette {\vergleichskette {T } { \neq }{0 } { }{ } { }{ } { }{ } } and $K$ is a field) \mathkor {Q=P/T} {and} {R=0} is a solution.
So suppose now that \mavergleichskette {\vergleichskette { \operatorname{deg} \, (P) } { = }{ n } { }{ } { }{ } { }{ } } and that the statement for smaller degrees is already proven. We write \mathkor {P= a_nX^n + \cdots + a_1X+a_0} {and} {T= b_kX^k + \cdots + b_1X+b_0} with \mathl{a_n, b_k \neq 0,\, k \leq n}{.} Then setting \mavergleichskette {\vergleichskette { H } { = }{ { \frac{ a_n }{ b_k } } X^{n-k} } { }{ } { }{ } { }{ } } we have the relation \mavergleichskettealign {\vergleichskettealign { P' } { \defeq} { P-TH } { =} { 0X^n + { \left( a_{n-1} - \frac{a_n}{b_k} b_{k-1} \right) } X^{n-1} + \cdots + { \left( a_{n-k} - \frac{a_n}{b_k} b_{0} \right) } X^{n-k} + a_{n-k-1}X^{n-k-1} + \cdots + a_0 } { } { } { } { } }{.} The degree of this polynomial $P'$ is smaller than $n$ and we can apply the induction hypothesis to it. That means there exist \mathkor {Q'} {and} {R'} such that \mathdisp {P'=TQ'+R' \text{ and with } \operatorname{deg} \, (R') < \operatorname{deg} \, (T) \text{ or } R'= 0} { . } From this we get altogether \mavergleichskettedisp {\vergleichskette { P } { =} { P'+TH } { =} { TQ'+TH+R' } { =} { T(Q'+H)+R' } { } }{,} so that \mavergleichskette {\vergleichskette { Q } { = }{ Q'+H } { }{ } { }{ } { }{ } } and \mavergleichskette {\vergleichskette { R } { = }{ R' } { }{ } { }{ } { }{ } } is a solution.
To prove uniqueness, let \mavergleichskette {\vergleichskette { P } { = }{ TQ+R } { = }{ TQ'+R' } { }{ } { }{ } }{,} both fulfilling the stated conditions. Then \mavergleichskette {\vergleichskette { T(Q-Q') } { = }{ R'-R } { }{ } { }{ } { }{ } }{.} Since the degree of the difference \mathl{R'-R} is smaller than \mathl{\operatorname{deg} \, (T)}{,} this implies \mavergleichskette {\vergleichskette { R } { = }{ R' } { }{ } { }{ } { }{ } } and so \mavergleichskette {\vergleichskette { Q } { = }{ Q' } { }{ } { }{ } { }{ } }{.}
The computation of the polynomials \mathkor {Q} {and} {R} is also called \stichwort {long division} {.} The polynomial $T$ is a factor of $P$ if and only if the division of $P$ by $T$ yields the remainder $0$. The proof of this theorem is constructive, meaning it can be used to do the computation effectively. For this, one has to be able to do the computing operations in the field $K$. We give an example.
\inputbeispiel {
We want to apply the Euclidean division \zusatzklammer {over $\Q$} \mathdisp {P=6 X^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 \zusatzklammer {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 \mavergleichskettedisp {\vergleichskette { 2X { \left( 3X^2+2X-4 \right) } } { =} { 6X^3 +4 X^2 -8 X } { } { } { } { } { } { } }{.} The difference between $P$ and this product is \mavergleichskettedisp {\vergleichskette { 6 X^3+X+1 - { \left( 6X^3 +4 X^2 -8 X \right) } } { =} { -4 X^2 +9X +1 } { } { } { } { } { } { } }{.} We continue the division by $T$ with this polynomial, which we call $P'$. In order to get coincidence with the leading coefficient we have to multiply $T$ with \mathl{{ \frac{ -4 }{ 3 } }}{.} This yields \mavergleichskettedisp {\vergleichskette {- { \frac{ 4 }{ 3 } } T } { =} { - { \frac{ 4 }{ 3 } } { \left( 3X^2 +2X-4 \right) } } { =} { -4X^2 - { \frac{ 8 }{ 3 } } X + { \frac{ 16 }{ 3 } } } { } { } { } { } }{.} The difference between this and $P'$ is therefore \mavergleichskettedisp {\vergleichskette { -4 X^2 +9X +1 - { \left( -4X^2 - { \frac{ 8 }{ 3 } } X + { \frac{ 16 }{ 3 } } \right) } } { =} { { \frac{ 35 }{ 3 } } X - { \frac{ 13 }{ 3 } }
} { } { } { } { } { } { } }{.} This is the remainder and altogether we get \mavergleichskettedisp {\vergleichskette { 6 X^3 +X + 1 } { =} { { \left( 3X^2 +2 X-4 \right) } { \left( 2X - { \frac{ 4 }{ 3 } } \right) } + { \frac{ 35 }{ 3 } } X - { \frac{ 13 }{ 3 } } } { } { } { } { } { } { } }{.}
\faktsituation {Let $K$ be a field and let $K[X]$ be the polynomial ring over $K$. Let \mavergleichskette {\vergleichskette {P } { \in }{ K[X] } { }{ } { }{ } { }{ } } be a polynomial and \mavergleichskette {\vergleichskette {a } { \in }{K } { }{ } { }{ } { }{ } }{.}} \faktfolgerung {Then $a$ is a zero of $P$ if and only if $P$ is a multiple of the linear polynomial \mathl{X-a}{.}} \faktzusatz } {
If $P$ is a multiple of \mathl{X-a}{,} then we can write \mavergleichskettedisp {\vergleichskette {P } { =} {(X-a)Q } { } { } { } { } { } { } } with another polynomial $Q$. Inserting $a$ yields \mavergleichskettedisp {\vergleichskette { P(a) } { =} { (a-a) Q(a) } { =} { 0 } { } { } { } { } }{.} In general, there exists, due to Theorem 6.3 , a representation \mavergleichskettedisp {\vergleichskette { P } { =} { (X-a)Q +R } { } { } { } { } { } { } }{,} where either \mavergleichskette {\vergleichskette { R } { = }{ 0 } { }{ } { }{ } { }{ } } or the degree of $R$ is $0$, so in both cases $R$ is a constant. Inserting $a$ yields \mavergleichskettedisp {\vergleichskette { P(a) } { =} { R } { } { } { } { } { } { } }{.} So if \mavergleichskette {\vergleichskette { P(a) } { = }{ 0 } { }{ } { }{ } { }{ } } holds, then the remainder must be \mavergleichskette {\vergleichskette { R } { = }{ 0 } { }{ } { }{ } { }{ } }{,} and this means \mavergleichskette {\vergleichskette { P } { = }{ (X-a)Q } { }{ } { }{ } { }{ } }{.}
\faktsituation {Let $K$ be a field and let $K[X]$ be the polynomial ring over $K$. Let \mavergleichskette {\vergleichskette {P } { \in }{K[X] } { }{ } { }{ } { }{ } } be a polynomial ($\neq 0$) of degree $d$.} \faktfolgerung {Then $P$ has at most $d$ zeroes.} \faktzusatz } {
We prove the statement by induction over $d$. For \mavergleichskette {\vergleichskette { d } { = }{ 0,1 } { }{ } { }{ } { }{ } } the statement holds. So suppose that \mavergleichskette {\vergleichskette {d } { \geq }{2 } { }{ } { }{ } { }{ } } and that the statement is already proven for smaller degrees. Let $a$ be a zero of $P$ \zusatzklammer {if $P$ does not have a zero at all, we are done anyway} {.} Hence, \mavergleichskette {\vergleichskette { P } { = }{ Q(X-a) } { }{ } { }{ } { }{ } } by Lemma 6.5
and the degree of $Q$ is \mathl{d-1}{,} so we can apply to $Q$ the induction hypothesis. The polynomial $Q$ has at most \mathl{d-1} zeroes. For \mavergleichskette {\vergleichskette {b } { \in }{K } { }{ } { }{ } { }{ } } we have \mavergleichskette {\vergleichskette { P(b) } { = }{ Q(b)(b-a) } { }{ } { }{ } { }{ } }{.} This can be zero, due to Lemma 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$.
\zwischenueberschrift{Fundamental theorem of algebra}
The following \stichwort {fundamental theorem of algebra} {,} for which we do not provide a proof, shows the importance of complex numbers.
\faktsituation \faktvoraussetzung {Every nonconstant polynomial \mavergleichskette {\vergleichskette {P } { \in }{\Complex [X] } { }{ } { }{ } { }{ } } over the complex numbers} \faktfolgerung {has a zero.} \faktzusatz
The fundamental theorem of algebra implies that for every polynomial \mavergleichskette {\vergleichskette {P } { \in }{ \Complex[X] } { }{ } { }{ } { }{ } } \mavergleichskette {\vergleichskette { P } { \neq }{ 0 } { }{ } { }{ } { }{ } }{,} there is a factorization into linear factors, i.e. one can write \mavergleichskettedisp {\vergleichskette { P } { =} { c(X-z_1)(X-z_2) \cdot (X-z_n) } { } { } { } { } { } { } } with uniquely determined complex numbers \mathkor {c} {and} {z_1 , \ldots , z_n} \zusatzklammer {where repetitions are allowed} {.}
\zwischenueberschrift{Polynomial interpolation}
The following theorem is called \stichwort {theorem about polynomial interpolation} and describes the interpolation of given function values by a polynomial. If just one function value at one point is given, then this determines a constant polynomial, two values at two points determine a linear polynomial \zusatzklammer {the graph is a line} {,} three values at three points determine a quadratic polynomial, etc.
\faktsituation {Let $K$ be a field, and let $n$ different elements \mavergleichskette {\vergleichskette { a_1 , \ldots , a_n } { \in }{ K } { }{ } { }{ } { }{ } } and $n$ elements \mavergleichskette {\vergleichskette { b_1 , \ldots , b_n } { \in }{ K } { }{ } { }{ } { }{ } } are given.} \faktfolgerung {Then there exist a unique
polynomial \mavergleichskette {\vergleichskette {P } { \in }{ K[X] } { }{ } { }{ } { }{ } } of degree \mathl{\leq n-1}{,} such that \mavergleichskette {\vergleichskette { P { \left( a_i \right) } } { = }{ b_i } { }{ } { }{ } { }{ } } holds for all $i$.} \faktzusatz } {
We prove the existence and consider first the situation where \mavergleichskette {\vergleichskette {b_j } { = }{ 0 } { }{ } { }{ } { }{ } } for all \mavergleichskette {\vergleichskette {j } { \neq }{i } { }{ } { }{ } { }{ } } for some fixed $i$. Then \mathdisp {(X-a_1) \cdots (X-a_{i-1}) (X-a_{i+1}) \cdots (X-a_n)} { } is a polynomial of degree $n-1$ which at the points \mathl{a_1 , \ldots , a_{i-1}, a_{i+1} , \ldots , a_n} has value $0$. The polynomial \mathdisp {{ \frac{ b_i }{ (a_i-a_1) \cdots (a_{i}-a_{i-1}) (a_{i} -a_{i+1}) \cdots (a_i-a_n) } } (X-a_1) \cdots (X-a_{i-1}) (X-a_{i+1}) \cdots (X-a_n)} { } has at these points still a zero, but additionally at $a_i$ its value is $b_i$. We denote this polynomial by $P_i$. Then \mavergleichskettedisp {\vergleichskette {P } { =} {P_1 + P_2 + \cdots + P_n } { } { } { } { } { } { } } is the polynomial looked for, because for the point $a_i$ we have \mavergleichskettedisp {\vergleichskette { P_j(a_i) } { =} { 0 } { } { } { } { } { } { } } for \mavergleichskette {\vergleichskette {j } { \neq }{i } { }{ } { }{ } { }{ } } and \mavergleichskette {\vergleichskette { P_i(a_i) } { = }{b_i } { }{ } { }{ } { }{ } }{.}
The uniqueness follows from Corollary 6.6 .
\inputremark {
If the data \mathl{a_1 , \ldots , a_n} and \mathl{b_1 , \ldots , b_n} are given, then one can find the interpolating polynomial $P$ of degree $\leq n-1$, which exists by Theorem 6.8 , in the following way: We write \mavergleichskettedisp {\vergleichskette {P } { =} { c_0+c_1X +c_2X^2 + \cdots + c_{n-2}X^{n-2}+c_{n-1}X^{n-1} } { } { } { } { } { } { } } with unknown coefficients \mathl{c_0 , \ldots , c_{n-1}}{,} and determine then these coefficients. Each interpolation point \mathl{(a_i,b_i)} yields a linear equation \mavergleichskettedisp {\vergleichskette { c_0+c_1a_i +c_2a_i^2 + \cdots + c_{n-2} a_i^{n-2}+c_{n-1} a_i^{n-1} } { =} { b_i } { } { } { } { } { } { } } over $K$. The resulting system of linear equations has exactly one solution \mathl{(c_0 , \ldots , c_{n-1})}{,} which gives the polynomial.
We will deal with systems of linear equations later in more detail, it should however be known from school how to find the solutions.
\zwischenueberschrift{Rational functions}
Next to the polynomial functions, the simplest functions are the rational functions.
\inputdefinition { } {
For polynomials \mathbed {P,Q \in \R [X]} {Q \neq 0} {,} the function \mathdisp {D \longrightarrow \R , z \longmapsto { \frac{ P(z) }{ Q(z) } }} { , } where $D$ is the complement of the zeroes