Jump to content

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



The interpolation theorem
A piecewise linear and
a polynomial interpolation.

The following theorem is called 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 (the graph is a line), three values at three points determine a quadratic polynomial, etc.


TheoremTheorem 20.1 change

Let K be a field,MDLD/field and let n different elements a1,…,an∈K, and n elements b1,…,bn∈K be given. Then there exists a unique polynomialMDLD/polynomial (1K) P∈K[X] of degree ≤n−1, such that P(ai)=bi

holds for all i.

Proof  

We prove the existence and consider first the situation where bj=0 for all j≠i for some fixed i. Then

(X−a1)⋯(X−ai−1)(X−ai+1)⋯(X−an)

is a polynomial of degree n−1, which at the points a1,…,ai−1,ai+1,…,an has value 0. The polynomial

bi(ai−a1)⋯(ai−ai−1)(ai−ai+1)⋯(ai−an)(X−a1)⋯(X−ai−1)(X−ai+1)⋯(X−an)

has at these points still a zero, but additionally at ai, its value is bi. We denote this polynomial by Pi. Then

P=P1+P2+⋯+Pn

is the polynomial looked for, because for the point ai, we have

Pj(ai)=0

for j≠i and Pi(ai)=bi.

The uniqueness follows from Corollary 19.9 .

◻


  A variant of the proof considers the mapping

K[X]⟶Kn,P⟼(P(a1),…,P(an)).

This mapping is K-linear,MDLD/linear since its components are linear due to Remark 19.7 . The interpolation theorem says that this mapping is surjective, this can be shown as in the proof. Moreover, it claims that this mapping, when restricted to the linear subspace of all polynomials of degree ≤n−1, is an isomorphism.MDLD/isomorphism (linear)


If the data a1,…,an and b1,…,bn are given, then one can find the interpolating polynomial P of degree ≤n−1, which exists by Theorem 20.1 , in the following way: We write

P=c0+c1X+c2X2+⋯+cn−2Xn−2+cn−1Xn−1

with unknown coefficients c0,…,cn−1, and determine then these coefficients. Each interpolation point (ai,bi) yields a linear equation

c0+c1ai+c2ai2+⋯+cn−2ain−2+cn−1ain−1=bi

over K. The resulting system of linear equations has exactly one solution (c0,…,cn−1), which gives the polynomial.




Inserting an endomorphism

For a linear mappingMDLD/linear mapping

f:V⟶V

on a K-vector space,MDLD/vector space we can consider the iterations fn, that is, the n-fold composition of f with itself. Moreover, we can add linear mappings and multiply them with scalars from the field. Therefore, expressions of the form

anfn+an−1fn−1+⋯+a2f2+a1f+a0

are linear mappings from V to V. Here, we have to interpret

a0=a0f0=a0IdV.

At first glance, it is not clear why studying such polynomial expressions in f help in understanding f. The expression described can be understood in the sense that in the polynomial anXn+an−1Xn−1+⋯+a2X2+a1X+a0, we substitute the variable X by the linear mapping f. This assignment fulfills the following structural properties.


LemmaLemma 20.3 change

Let K be a field,MDLD/field V a K-vector space,MDLD/vector space and

f:V⟶V

a linear mapping.MDLD/linear mapping Then the mapping

K[X]⟶End(V),P⟼P(f),
has the following properties.
  1. For a constant polynomial P=a0, we have
    P(f)=a0(f)=a0f0=a0IdV.

    In particular, the zero polynomial is sent to the zero mapping and the constant 1-polynomial is sent to the identity.

  2. We have
    (P+Q)(f)=P(f)+Q(f)=Q(f)+P(f)

    for all polynomials P,Q∈K[X].

  3. We have
    (P⋅Q)(f)=P(f)∘Q(f)=Q(f)∘P(f)

    for all polynomials P,Q∈K[X].

  4. We have
    (Xn)(f)=fn

    for all n∈ℕ.

Proof  

(1) and (4) are inherent in the definition of the substitution homomorphism. From this, also (2) and (3) follows.

◻


If V is finite-dimensional, say of dimension d, then all powers fk, k∈ℕ, are elements in the d2-dimensional vector space

HomK(V,V)=End(V)

of all linear mappings from V to V. Because the space of homomorphisms has also finite dimension, these powers must be linearly dependent. That is, there exists some m∈ℕ and coefficients ai, 0≤i≤m, not all 0, such that

amfm+am−1fm−1+⋯+a2f2+a1f+a0=0

holds (here, m≤d2 is immediately clear, we will see later that even m≤d holds). The corresponding polynomial amXm+am−1Xm−1+⋯+a2X2+a1X+a0 has the property that it is not the zero polynomial, and that, after replacing X everywhere by f, the zero mapping on V arises. We ask the following questions:


    • Does there exist some structure on the set of all polynomials
    P∈K[X] with P(f)=0?
    • Does there exist an especially simple polynomial
    P0∈K[X] with P0(f)=0?
    • How can we find it?
    • Which properties of f can we deduce from the factor decomposition of this polynomial P0?

Let K be a field,MDLD/field V a finite-dimensionalMDLD/finite-dimensional K-vector spaceMDLD/vector space and

f:V⟶V

a linear mapping.MDLD/linear mapping Let v1,…,vn be a basisMDLD/basis (vs) of V, and let M denote the corresponding matrix. Due to Lemma 11.10 , we have a correspondence between compositions of linear mappings and matrix multiplication. In particular, fn corresponds with Mn. In the same way, the scalar multiplication and the addition on the space of endomorphisms End(V) and on the space of matrices correspond to each other. Therefore, instead of the assignment P↦P(f), we can also work with the assignment P↦P(M).



Ideals

A subset 𝔞 of a commutative ringMDLD/commutative ring R is called an ideal, if the following conditions are fulfilled:

  1. 0∈𝔞.
  2. For all a,b∈𝔞, we have a+b∈𝔞.
  3. For all a∈𝔞 and r∈R, we have ra∈𝔞.

The property 0∈𝔞 can be replaced by the condition that 𝔞 is not empty. An ideal is a subgroup of the additive group of R, which, moreover, is also closed under scalar multiplication.


For a family of element a1,a2,…,an∈R in a commutative ringMDLD/commutative ring R, we denote by (a1,a2,…,an) the ideal generated by these elements. It consists of all linear combinations

r1a1+r2a2+⋯+rnan,

where

r1,r2,…,rn∈R.

An idealMDLD/ideal 𝔞 in a commutative ringMDLD/commutative ring R of the form

𝔞=(a)=Ra={ra:r∈R}
is called a principal ideal.

The zero element forms, in every ring, the so-called zero ideal. We write this simply as 0=(0)={0}. write. The 1 and, moreover, every unit,MDLD/unit generates as an ideal the total ring.  A unit in a commutative ring R is an invertible element, that is, an element x∈R such that there exists an y∈R with xy=1. A commutative ring is a field if and only if all elements with the exception of 0 are units.


The unit ideal in a commutative ringMDLD/commutative ring

R is the ring itself.

In a field, there exist exactly two ideals.


LemmaCreate referencenumber

Let R be a commutative ring.MDLD/commutative ring Then the following statements are equivalent.

  1. R is a field.MDLD/field
  2. There exist exactly two idealsMDLD/ideals in R.

Proof  

If R is a field, then there exists the zero ideal and the unit ideal, and these are different ideals. Let I be an ideal in R different from 0. Then I contains some element x≠0, which is a unit.MDLD/unit Therefore, 1=xx−1∈I and thus I=R.

Suppose now that R is a commutative ring with exactly two ideals. Then R is not the zero ring. Let now x be an element in R different from 0. The principal idealMDLD/principal ideal generated by x, that is Rx, is ≠0, and therefore it must be the other ideal, which is the unit ideal. In particular, this means 1∈Rx. Hence, 1=xr for some r∈R, so that x is a unit.

◻



Ideals in K[X]

TheoremTheorem 20.10 change

Proof  

Let I denote an idealMDLD/ideal in K[X] different from 0. We consider the non-empty set of natural numbers

{deg⁡(P)∣P∈I,P≠0}.

This set has a minimum m∈ℕ. This number arises from an element F∈I, F≠0, m=deg⁡(F). We claim that I=(F).

The inclusion ⊇ is clear. To prove the other inclusion ⊆, let P∈I be given. Due to Theorem 19.4 , we have

P=FQ+R and with deg⁡(R)<deg⁡(F) or R=0.

Because of R∈I and the minimality of deg⁡(F), the first case can not happen. Therefore, R=0, and this means that P is a multiple of F.

◻




The minimal polynomial

Let V be a finite-dimensionalMDLD/finite-dimensional K-vector spaceMDLD/vector space and

f:V⟶V

a linear mapping.MDLD/linear mapping Then the uniquely determined normedMDLD/normed (polynomial) polynomialMDLD/polynomial μf∈K[X] of minimal degreeMDLD/degree (polynomial) fulfilling

μf(f)=0

is called the minimal polynom

of f.

CorollaryCorollary 20.12 change

Let V be a finite-dimensionalMDLD/finite-dimensional vector spaceMDLD/vector space over a fieldMDLD/field K, and let

f:V⟶V

denote a linear mapping.MDLD/linear mapping Then the set

{P∈K[X]∣P(f)=0}

is a principal idealMDLD/principal ideal in the polynomial ring K[X], which is generated by the minimal polynomialMDLD/minimal polynomial (endomorphism)

μf.

Proof

◻



For the identity IdV on a K-vector spaceMDLD/vector space V, the minimal polynomialMDLD/minimal polynomial (endomorphism) is just X−1. This polynomial is sent under the evaluation homomorphism to

IdV−IdV=0.

A constant polynomial a0 is sent to a0Id, which is not, with the exception of a0=0 or V=0, the zero mapping.

For a homothety, that is, a mapping of the form λIdV, the minimal polynomial is X−λ, under the condition λ≠0 and V≠0. For the zero mapping on V≠0, the minimal polynomial is X, in case V=0, it is the constant polynomial 1.


For a diagonal matrixMDLD/diagonal matrix

M=(d10⋯00d2⋱⋮⋮⋱⋱00⋯0dn)

with different entries di, the minimal polynomialMDLD/minimal polynomial (endomorphism) is

P=(X−d1)(X−d2)⋯(X−dn).

This polynomial is sent under the substitution to

(M−d1En)∘(M−d2En)∘(M−dnEn).

We apply this to a standard vector ei. Then factor (M−djEn) sends eito (di−dj)ei. Therefore, the i-th factor ensures that ei is annihilated. Since a basis is mapped under P(M) to 0, it must be the zero mapping.

Assume now that P is not the minimal polynomial μ. Then there exists, due to Corollary 20.12 , a polynomial Q with

P=Qμ,

and, because of Lemma 19.8 , μ is a partial product of the linear factors of P. But as soon as one factor of P is removed, say we remove X−di, then ei is not annihilated by the corresponding mapping.


For the matrix

M=(0100),

X2 is the minimal polynomial.MDLD/minimal polynomial (endomorphism) This polynomial becomes, after the substitution, the zero mapping, because of

M2=(0000).

The factors of X2 of smaller degree are the constant polynomials ≠0 and a1X with a1≠0, but these polynomials do not annihilate M.


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