Lecture 2
linalg föreläsning 4
September 2026
Introduction
Let and be finite dimensional vector spaces over a field , and let be a linear mapping.
Now we have the following definitions that we will use throughout this lecture:
Definition (Image)
The image of is defined by . This is also called the range of .
Definition (Rank)
The rank of , is the dimension of its image: .
Definition (Kernel)
The kernel of is defined by . What this means is that consists of all the vectors that are mapped to zero by .
Definition (Injectivity)
A mapping is called injective if its left-invertible, and
Definition (Surjectivity)
A mapping is called surjective if its right-invertible, and .
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
The matrix defines a linear map
This is represented by
Definition
In general, a matrix is a linear map
G (Geometrical mappings)
Example
Scalars: Let The matrix equivalence of this is
Even rotation with an angle is a linear map on : .
Exercise
Exercise: Fix an orthonormal (and oriented) base = .
Let be the counter-clockwise rotation by an angle . The matrix for is then the -matrix
Sketch the basis vectors , and their images in the plane.
Example
Projection: Let be a linear subspace. Choose an orthonormal basis such that
Reflection across leaves the part of the vector along unchanged and flips the part perpendicular to :
The matrix equivalent to mirroring a vector is given by
and the matrix equivalent to projecting is given by
D/I (Differentiating and integrating)
Definition
Define the following:
Example
Now we ask ourselves, is integration: a map?
Solution: We have to fix the integration points. is a map.
Properties on linear mapping
Proposition
Proposition: If is a linear map, then:
Definition
Definition: Let be a linear mapping, then:
Example
Example and reminder
Let
viewed as a linear map . Its kernel is
The equation is equivalent to
Since the second equation is twice the first, we obtain
Setting and , we find
Thus, and .
In this example,
Thus, . is not injective because : the equation has at least one free variable.
Theorem
Theorem (Theorem 2.1.5, Proposition 2.1.7, and Theorem 2.2.12)
Let be a linear map between finite-dimensional vector spaces.
The following are equivalent:
The map is called a left inverse of :
The following are equivalent:
The map is called a right inverse of :
Matrices of linear mappinggs with respect to bases
Definition
Let and be bases of and . The matrix of a linear map with respect to these bases is defined by
Its columns are the coordinates of of the basis vectors:
Example
Example: Mirroring with respect to .} Let be the mirror across the line . Choose the basis
Since lies along the reflection line and is perpendicular to it,
. You can see this since rotates around the line it sits on. Thus,
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 . The identity map leaves every vector unchanged, but its matrix converts -coordinates into -coordinates:
Since and , we get
The reflection matrix in the standard basis is
Thus, in standard coordinates, .