Linear TransformationsTopic #27 of 30

Kernel and Range

Null space as kernel, column space as range, and dimension theorem.

Overview

The kernel and range are fundamental subspaces associated with a linear transformation. They describe what gets mapped to zero and what can be reached by the transformation.

Kernel (Null Space)

The kernel of T:VWT: V \to W is:

ker(T)={vV:T(v)=0}\ker(T) = \{\mathbf{v} \in V : T(\mathbf{v}) = \mathbf{0}\}

The set of all vectors that map to zero.

Properties

  • ker(T)\ker(T) is a subspace of VV
  • dim(ker(T))\dim(\ker(T)) = nullity of TT
  • TT is injective (one-to-one) ker(T)={0}\Leftrightarrow \ker(T) = \{\mathbf{0}\}

Example

For T(x,y,z)=(x+y,y+z)T(x, y, z) = (x + y, y + z):

T(x,y,z)=(0,0)T(x, y, z) = (0, 0)

x+y=0x=yx + y = 0 \Rightarrow x = -y

y+z=0z=yy + z = 0 \Rightarrow z = -y

ker(T)={(t,t,t):tR}=span{(1,1,1)}\ker(T) = \{(-t, t, -t) : t \in \mathbb{R}\} = \text{span}\{(-1, 1, -1)\}

Range (Image)

The range of T:VWT: V \to W is:

range(T)={T(v):vV}={wW:w=T(v) for some v}\text{range}(T) = \{T(\mathbf{v}) : \mathbf{v} \in V\} = \{\mathbf{w} \in W : \mathbf{w} = T(\mathbf{v}) \text{ for some } \mathbf{v}\}

The set of all outputs of TT.

Properties

  • range(T)\text{range}(T) is a subspace of WW
  • dim(range(T))\dim(\text{range}(T)) = rank of TT
  • TT is surjective (onto) range(T)=W\Leftrightarrow \text{range}(T) = W

Example

For T(x,y)=(x+y,xy,2x)T(x, y) = (x + y, x - y, 2x):

T(x,y)=x(1,1,2)+y(1,1,0)T(x, y) = x(1, 1, 2) + y(1, -1, 0)

range(T)=span{(1,1,2),(1,1,0)}\text{range}(T) = \text{span}\{(1, 1, 2), (1, -1, 0)\}

Dimension Theorem (Rank-Nullity)

For T:VWT: V \to W where VV is finite-dimensional:

dim(V)=dim(ker(T))+dim(range(T))=nullity(T)+rank(T)\dim(V) = \dim(\ker(T)) + \dim(\text{range}(T)) = \text{nullity}(T) + \text{rank}(T)

Example

T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2 with nullity = 1

3=1+rank(T)3 = 1 + \text{rank}(T)

rank(T)=2\text{rank}(T) = 2

So range(T)\text{range}(T) has dimension 2 (could be all of R2\mathbb{R}^2).

For Matrix Transformations

If T(x)=AxT(\mathbf{x}) = A\mathbf{x}:

ConceptMatrix Form
ker(T)\ker(T)Null space of AA
range(T)\text{range}(T)Column space of AA
nullityNumber of free variables
rankNumber of pivot columns

Injectivity, Surjectivity, Bijectivity

PropertyConditionKernelRange
InjectiveOne-to-oneker(T)={0}\ker(T) = \{\mathbf{0}\}-
SurjectiveOnto-range(T)=W\text{range}(T) = W
BijectiveBothker(T)={0}\ker(T) = \{\mathbf{0}\}range(T)=W\text{range}(T) = W

Determining Properties

TT is Injective if:

  • ker(T)={0}\ker(T) = \{\mathbf{0}\}
  • T(u)=T(v)u=vT(\mathbf{u}) = T(\mathbf{v}) \Rightarrow \mathbf{u} = \mathbf{v}
  • nullity(T)=0\text{nullity}(T) = 0

TT is Surjective if:

  • range(T)=W\text{range}(T) = W
  • rank(T)=dim(W)\text{rank}(T) = \dim(W)
  • Every wW\mathbf{w} \in W has a preimage

TT is Bijective if:

  • Both injective and surjective
  • TT has an inverse T1T^{-1}

Example: Complete Analysis

T:R3R3T: \mathbb{R}^3 \to \mathbb{R}^3 defined by T(x,y,z)=(x+y,y+z,x+2y+z)T(x, y, z) = (x + y, y + z, x + 2y + z)

Matrix form:

A=[110011121]A = \begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 2 & 1 \end{bmatrix}

Row reduce:

[110011121][110011011][101011000]\begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 1 & 2 & 1 \end{bmatrix} \to \begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 1 \\ 0 & 1 & 1 \end{bmatrix} \to \begin{bmatrix} 1 & 0 & -1 \\ 0 & 1 & 1 \\ 0 & 0 & 0 \end{bmatrix}

  • rank = 2, nullity = 1
  • ker(T)=span{(1,1,1)}\ker(T) = \text{span}\{(1, -1, 1)\}
  • range(T)=span{(1,0,1),(1,1,2)}\text{range}(T) = \text{span}\{(1, 0, 1), (1, 1, 2)\} (2-dimensional subspace of R3\mathbb{R}^3)
  • Not injective (ker{0}\ker \neq \{\mathbf{0}\})
  • Not surjective (rangeR3\text{range} \neq \mathbb{R}^3)