Lecture 2

Robin Sandquist Robin Sandquist

linalg föreläsning 4

September 2026

Introduction

Let V and W be finite dimensional vector spaces over a field 𝕂, and let T:V→W be a linear mapping.

Now we have the following definitions that we will use throughout this lecture:

Definition (Image)

The image of T is defined by RanT={Tv;v∈V}⊆W. This is also called the range of T.

Definition (Rank)

The rank of T, is the dimension of its image: rankT=dimRanT.

Definition (Kernel)

The kernel of T is defined by KerT:={v∈V;Tv=0}⊆V. What this means is that KerT consists of all the vectors v that are mapped to zero by T.

Definition (Injectivity)

A mapping T is called injective if its left-invertible, and Tv1≠Tv2⟹v1≠v2.

Definition (Surjectivity)

A mapping T is called surjective if its right-invertible, and RanT=W.

We will come back to injectivity and surjectivity further down.

kinds of linear maps

There are 3 classes of linear mappings. We start with the first one:

A (Algebraic/matrix mappings)

Example

Example:

Let

A=[122357]∈ℝ2×3.

The matrix A defines a linear map

TA:ℝ3⟶ℝ2,x⟼y=Ax.

This is represented by

TA(x1x2x3)=(x1+2x2+2x33x1+5x2+7x3).
Definition

In general, a matrix A∈𝕂m×n is a linear map

TA:𝕂n⟶𝕂m,x⟼Ax.

G (Geometrical mappings)

Example

Scalars: Let α∈ℝ,then α:ℝ2→ℝ2,x⟼αx. The matrix equivalence of this is

[α00α].

Even rotation with an angle φ is a linear map on ℝ2: ℝφ:x⟼ℝφx.

Exercise

Exercise: Fix an orthonormal (and oriented) base = (𝐞1,𝐞2).

Let ℝφ be the counter-clockwise rotation by an angle φ. The matrix for ℝφ is then the 2×2-matrix

[cos⁡φ−sin⁡φsin⁡φcos⁡φ]

Sketch the basis vectors 𝐞1,𝐞2, and their images Rφ(𝐞1),Rφ(𝐞2) in the plane.

Example

Projection: Let L⊆ℝ2 be a linear subspace. Choose an orthonormal basis E=(𝐞1,𝐞2) such that

L=span⁡{𝐞1},𝐞2⟂L.

Reflection across L leaves the part of the vector along L unchanged and flips the part perpendicular to L:

ML(𝐯)=a𝐞1−b𝐞2.

The matrix equivalent to mirroring a vector is given by

[100−1],

and the matrix equivalent to projecting is given by

[1000].

D/I (Differentiating and integrating)

Definition

Define the following:

𝒫[t]:={all polynomials in t},D=ddt:{𝒫[t]⟶𝒫[t],f(t)⟼Df(t)=f′(t).
Example

Now we ask ourselves, is integration: ∫dt:f(t)⟼∫f(t)dt a map?

Solution: We have to fix the integration points. f(t)⟼∫t0tf(s)ds is a map.

Properties on linear mapping

Proposition

Proposition: If T:V→W is a linear map, then:

{1.T(0)=02.T maps linearly dependent vectors to linearly dependent vectors.3.We can’t directly say anything about how T preserves linearly independant vectors. 
Definition

Definition: Let T:V→W be a linear mapping, then:

{ker⁡T:={v∈V:T(v)=0W}.Also denoted N(T), or the null space of T.Ran⁡T:={T(v):v∈V}⊆W.rank⁡T:=dim⁡Ran⁡T.If the range is infinite-dimensional, we write rank⁡T=∞.T is an isomorphism if it is linear, injective, and surjective.
Example

Example and reminder

Let

A:=[123246],

viewed as a linear map A:ℝ3→ℝ2. Its kernel is

ker⁡A=Null⁡A={x∈ℝ3:Ax=0}.

The equation Ax=0 is equivalent to

{x1+2x2+3x3=0,2x1+4x2+6x3=0.

Since the second equation is twice the first, we obtain

x1=−2x2−3x3.

Setting x2=s and x3=t, we find

ker⁡A={[−2s−3tst]:s,t∈ℝ}=span⁡{[−210],[−301]}.

Thus, dim⁡ker⁡A=2 and rank⁡A=1.

In this example,

Ran⁡A=Col⁡A={y[12]:y∈ℝ}.

Thus, rank⁡A=1. A is not injective because ker⁡A≠{0}: the equation Ax=0 has at least one free variable. □

Theorem

Theorem (Theorem 2.1.5, Proposition 2.1.7, and Theorem 2.2.12)

Let T:V→W be a linear map between finite-dimensional vector spaces.

  1. The following are equivalent:

    T is injective⟺ker⁡T={0V}⟺there exists a linear map S:W→V such that S∘T=IV.

    The map S is called a left inverse of T:

    V→TW→SV.
  2. The following are equivalent:

    T is surjective⟺defRan⁡T=W⟺there exists a linear map R:W→V such that T∘R=IW.

    The map R is called a right inverse of T:

    W→RV→TW.

Matrices of linear mappinggs with respect to bases

Definition

Let 𝒜 and ℬ be bases of V and W. The matrix of a linear map T:V→W with respect to these bases is defined by

[Tv]ℬ=[T]ℬ←𝒜[v]𝒜.

Its columns are the coordinates of ran(⋅) of the basis vectors:

[T]ℬ←𝒜=[[T(a1)]ℬ⋯[T(an)]ℬ].
Example

Example: Mirroring with respect to x1=x2.} Let S:ℝ2→ℝ2 be the mirror across the line x1=x2. Choose the basis

ℬ=(b1,b2),b1=[11],b2=[−11].

Since b1 lies along the reflection line and b2 is perpendicular to it,

S(b1)=b1,S(b2)=−b2.

. You can see this since b1 rotates around the line it sits on. Thus,

[S]ℬ←ℬ=[[S(b1)]ℬ[S(b2)]ℬ]=[100−1].
Note

Note: The standard bases (𝐞𝟏,𝐞𝟐) when mapped by this mirroring will change places across the axles.

Example

Example: The identity map and change of coordinates.

Let ℰ be the standard basis of ℝ2=(𝐞𝟏,𝐞𝟐). The identity map I:ℝ2→ℝ2 leaves every vector unchanged, but its matrix converts ℬ-coordinates into ℰ-coordinates:

[v]ℰ=[I]ℰ←ℬ[v]ℬ.

Since I(b1)=b1 and I(b2)=b2, we get

P:=[I]ℰ←ℬ=[[b1]ℰ[b2]ℰ]=[1−111].

The reflection matrix in the standard basis is

[S]ℰ←ℰ=P[S]ℬ←ℬP−1=[0110].

Thus, in standard coordinates, S(x1,x2)=(x2,x1).