A linear map (or transformation, or function)
transforms elements of a vector space
called domain into elements of another vector space
called codomain.
The kernel (or null space) of a linear transformation is the subset of the domain that is transformed into the zero vector.
Let us provide a more formal definition of kernel.
Definition
Let
and
be two vector spaces. Let
be a linear map. The
set
is
called the null space (or kernel) of
.
Let us see some examples.
Example
Let
be the space of all
column vectors having real
entries. Let
be the linear map defined by the
matrix
product
where
For
any
,
denote by
and
the two entries of
,
so
that
As
a consequence,
whenever
.
Therefore, the kernel of
is formed by all the vectors of
whose two entries are equal to each
other:
Example
Let
and
respectively be the spaces of all
and
column vectors having real entries. Let
be the linear map defined by the matrix
product
where
For
any
,
denote by
and
the two entries of
,
so
that
By
looking at the three entries of
,
it is apparent that
only when
.
Therefore the kernel of
is formed by a single vector, the zero
vector:
An interesting property of the null space is that it is a subspace of the domain, that is, it is closed with respect to taking linear combinations.
Proposition
Let
and
be two vector spaces. Let
be a linear map. Then, the null space
is a subspace of
.
By the definition of subspace,
is a subspace of
if and only if any linear combination of elements of
belongs to
.
Let us check that this condition is verified. Arbitrarily choose two vectors
and two scalars
and
.
Then,
where:
in step
we have used the fact that
is a linear map; in step
we have used the fact that
and, as a consequence,
.
Thus, the linear
combination
belongs
to the kernel (because the function
maps it into the zero vector). This is exactly what we needed to prove.
Note that the zero vector always belongs to the kernel. In fact, the linearity
of
implies
that
for
any
and any scalar
.
Thus, when we set
,
the previous equation
becomes
Below you can find some exercises with explained solutions.
Let
be the space of all
column vectors having real entries. Let
be the linear map defined by
where
Find the null space of
.
For any
,
denote by
and
the two entries of
,
so
that
Hence,
for
and any value of
.
Thus, the null space of
is:
Remember that a linear transformation
can be defined by specifying the values taken by
in correspondence of a
basis of
(see the lecture on linear maps).
Let
be a basis for
.
Let
be a basis for
.
Suppose that
is defined
by
Find
the kernel of
.
Any vector
can be represented in terms of the basis
as
where
are scalars. Then, by the linearity of
,
we have
that
So,
we have that
whenever
Thus,
Let
and
respectively be the spaces of all
and
column vectors having real entries. Let
be the linear map defined by the matrix
product
where
is a
matrix.
Find the null space of
under the hypothesis that the columns of
are linearly independent.
Denote by
the three columns of
.
For any
,
denote by
the three entries of
.
The product
can
be written as a linear combination of the columns of
with coefficients taken from the vector
:
Since
the three columns of
are linearly independent, the only
linear combination that
gives
is
the combination with coefficients
.
Therefore,
Please cite as:
Taboga, Marco (2021). "Kernel of a linear map", Lectures on matrix algebra. https://www.statlect.com/matrix-algebra/kernel-of-a-linear-map.
Most of the learning materials found on this website are now available in a traditional textbook format.