Jump to content

Proofs for linear maps – "Math for Non-Geeks"

From Wikibooks, open books for an open world

We will give here a proof structure that shows how to prove linearity of a map.

General procedure

[edit | edit source]

Recap: Definition of a linear map

[edit | edit source]

We recall that a linear map (or homeomorphism) is a structure-preserving map of a K-vector space V into a K-vector space W. That is, for the map f:V→W, the following two conditions must hold:

  1. f must be additive, i.e., for v,w∈V we have that: f(v+w)=f(v)+f(w)
  2. f must be homogeneous, i.e., for v∈V,λ∈K we have that: f(λ⋅v)=λ⋅f(v).

So for a linear map it doesn't matter if we first do the addition or scalar multiplication in the vector space V and then map the sum into the vector space W, or first map the vectors v,w into the vector space W and perform the addition or scalar multiplication there, using the images of the map.

Proving that a map is linear

[edit | edit source]

The proof that a map is linear can be done according to the following structure. First, we assume that a map f:V→W is given between vector spaces. That is, V and W are K-vector spaces and f is well-defined. Then for the linearity of f we have to show:

  1. additivity: ∀v,w∈V:f(v+w)=f(v)+f(w)
  2. homogeneity: ∀v∈V∀λ∈K:f(λ⋅v)=λ⋅f(v)
Exercise (Introductory example)

We consider the following map

f:ℝ2→ℝ,f(v1v2):=2v1+v2

and show that it is linear.

Proof (Introductory example)

First, ℝ2 and ℝ are vector spaces over the field ℝ. Moreover, the map f is well-defined.

Proof step: proving additivity

Let (v1v2),(w1w2)∈ℝ2.

f((v1v2)+(w1w2))=f(v1+w1v2+w2)↓ definition of f= 2(v1+w1)+(v2+w2)↓ distributive law= 2v1+2w1+v2+w2↓ commutative and associative law = (2v1+v2)+(2w1+w2)↓ definition of f= f(v1v2)+f(w1w2)

Thus, we have proved the additivity of f.

Proof step: proving homogeneity

Let (v1v2)∈ℝ2 and λ∈ℝ. Then, we have

f(λ(v1v1))=f(λv1λv2)↓ definition of f= 2λv1+λv2↓ distributive law = λ(2v1+v2)↓ definition of f= λ⋅f(v1v2)

Thus, we have proved the homogeneity of f.

The map to zero

[edit | edit source]

The map to zero is the map which sends every vector to zero. For instance, the map to zero of ℝ to ℝ3 looks as follows:

f:ℝ→ℝ3,x↦(000)

Exercise (The map to zero linear)

Show that the map f:ℝ→ℝ3,x↦(000) is linear.

Proof (The map to zero linear)

We already know that ℝ and ℝ3 are both ℝ-vector spaces, and that the map to zero is well-defined.

Proof step: additivity

For all x,y∈ℝ we have that

f(x+y)=(000)↓ additive neutral element=(000)+(000)↓ definition of f=f(x)+f(y)

Proof step: homogeneity

For all x∈ℝ,λ∈ℝ we have that

f(λ⋅x)=(000)↓ scalar multiplication =λ⋅(000)↓ definition of f=λ⋅f(x)

Thus, the map to zero is linear.

An example in ℝ2

[edit | edit source]

We consider an example for a linear map of ℝ2 to ℝ2:

f:ℝ2→ℝ2 with f(x1x2)=(x1+x2x1−5x2)

Exercise (Linearity of f)

Show that the map f:ℝ2→ℝ2,(x1x2)↦(x1+x2x1−5x2) is linear.

Proof (Linearity of f)

ℝ2 is an ℝ-vector space. In addition, the map is well-defined.

Proof step: additivity

Let (x1,x2)T and (y1,y2)T be any vectors from the plane ℝ2. Then, we have:

f((x1x2)+(y1y2))=f(x1+y1x2+y2)↓ definition of f=((x1+y1)+(x2+y2)(x1+y1)−5⋅(x2+y2))↓ distributive law=((x1+x2)+(y1+y2)(x1−5x2)+(y1−5y2))↓ separate vectors=(x1+x2x1−5x2)+(y1+y2y1−5y2)↓ definition of f=f(x1x2)+f(y1y2)


Proof step: homogeneity

Let λ∈ℝ and (x1,x2)T∈ℝ2. Then:

f(λ⋅(x1x2))=f(λ⋅x1λ⋅x2)↓ definition of f=(λx1+λx2λx1−5λx2)↓ distributive law=(λ(x1+x2)λ(x1−5x2))↓ scalar multiplication=λ⋅((x1+x2)(x1−5x2))↓ definition of f=λ⋅f(x1x2)

Thus, the map is linear.


A linear map in the vector space of sequences

[edit | edit source]

Next, we consider the space of all sequences of real numbers. This space is infinite-dimensional, because there are not finitely many sequences generating this sequence space. But it is a vector space, as we have shown in the chapter about sequence spaces.


Exercise (Sequence space)

Let V be the ℝ-vector space of all real-valued sequences. Show that the map

f:V→V(a0,a1,a2,…)↦(a1,a2,a3,…)

is linear.

How to get to the proof? (Sequence space)

To show linearity, two properties need to be checked:

  1. f is additive: f(v+w)=f(v)+f(w) for all v,w∈V
  2. f is homogeneous: f(λ⋅v)=λ⋅f(v) for all v∈V and λ∈ℝ

The vectors v and w are sequences of real numbers, i.e. they are of the form v=(a0,a1,a2,…) and w=(b0,b1,b2,…) with ak,bk∈ℝ for all k∈ℕ0.

Proof (Sequence space)

Proof step: additivity

Let v=(a0,a1,a2,…)∈V and w=(b0,b1,b2,…)∈V. Then, we have

f(v+w)=f((a0,a1,a2,…)+(b0,b1,b2,…))= f(a0+b0,a1+b1,a2+b2,…)= (a1+b1,a2+b2,a3+b3,…)= (a1,a2,a3,…)+(b1,b2,b3,…)= f(a0,a1,a2,…)+f(b0,b1,b2,…)= f(v)+f(w)

It follows that f is additive.

Proof step: homogeneity

Let v=(a0,a1,a2,…)∈V and λ∈ℝ. Then, we have

f(λ⋅v)=f(λ⋅(a0,a1,a2,…))= f(λa0,λa1,λa2,…)= (λa1,λa2,λa3,…)= λ⋅(a1,a2,a3,…)= λ⋅f(a0,a1,a2,…)= λ⋅f(v)

So f is homogeneous.

Thus, it was proved that f is a ℝ-linear map.


Abstract example

[edit | edit source]

In this chapter, we deal with somewhat more abstract vectors. Let M,N be arbitrary sets; K a field and V a K-vector space. We now consider the set of all maps/ functions of the set M into the vector space V and denote this set with Fun(M,V). Furthermore, we also consider the set of all maps of the set N into the vector space V and denote this set with Fun(N,V). The addition of two maps is defined for f,g∈Fun(M,V) by

(f+g)(m)=f(m)+g(m)

Die scalar multiplication is defined for λ∈K via

(λ⋅f)(m)=λ⋅f(m)

Analogously, we define addition scalar multiplication for Fun(N,V).

Exercise (The set Fun(M,V) is a K-vector space)

Show that Fun(M,V) is a K-vector space.

How to get to the proof? (The set Fun(M,V) is a K-vector space)

Simply check the vector space axioms.

We now show that the composition with a mapping t∈Fun(N,M) is a linear map from Fun(M,V) to Fun(N,V).


Exercise (The composition with a map is linear.)

Let V be a vector space, let M,N be sets, and let Fun(M,V) or Fun(N,V) be the vector space of functions from M or N to V. Let t∈Fun(N,M) be arbitrary but fixed. We consider the mapping

Θ:Fun(M,V)→Fun(N,V)g↦g∘t

Show that Θ is linear.

It is important that you exactly follow the definitions. Note that Θ is a map that assigns to every map of M to V a map of N to V. These maps, which are elements of Fun(M,V) and Fun(N,V) respectively, need not themselves be linear, since there is no vector space structure on the sets M and N.

Summary of proof (The composition with a map is linear.)

In order to prove the linearity of Θ, we need to check the two properties again:

  1. Θ is additive: Θ(g+h)=Θ(g)+Θ(h) for all g,h∈Fun(M,V)
  2. Θ is homogeneous: Θ(λ⋅g)=λ⋅Θ(g) for all g∈Fun(M,V) and λ∈K

So at both points an equivalence of maps N→V is to be shown. For this, we evaluate the maps at every m element y∈N.

Proof (The composition with a map is linear.)

Let g,h∈Fun(M,V).

Proof step: additivity

For all n∈N we have that

Θ(g+h)(n)=↓ definition of Θ= ((g+h)∘t)(n)= (g+h)(t(n))↓ vector addition on Fun(M,V)= g(t(n))+h(t(n))= (g∘t)(n)+(h∘t)(n)↓ definition of Θ= Θ(g)(n)+Θ(h)(n)↓ vector addition on Fun(N,V)= (Θ(g)+Θ(h))(n)

Thus, we have shown Θ(g+h)=Θ(g)+Θ(h), i.e., Θ is additive.

Let g∈Fun(M,V) and λ∈K.

Proof step: homogeneity

For all n∈N we have that

Θ(λ⋅g)(n)=↓ definition of Θ= ((λ⋅g)∘t)(n)= (λ⋅g)(t(n))↓ scalar multiplication on Fun(M,V)= λ⋅g(t(n))= λ⋅(g∘t)(n)↓ definition of Θ= λ⋅Θ(g)(n)↓ scalar multiplication on Fun(N,V)= (λ⋅Θ(g))(n)

Thus, we have shown Θ(λ⋅g)=λ⋅Θ(g), i.e., Θ is homogeneous.

Now, additivity and homogeneity of Θ implies that Θ is a linear map.