Quiz 2

Kernel & Image of Linear Transformations

2034 words
10 min read
Python Week 1: the first filter for runtime behavior
Visual companion
Python
Type and operator map

Python Week 1: the first filter for runtime behavior

View
Revision summary

What this note is really saying

Short form

# Kernel & Image of Linear Transformations ## 🎯 Learning Objectives After this topic you will be able to: - Define the kernel (null space) of a linear transformation - Define the image (range) of a linear transformation - Find bases for the kernel and image of a linear transformation - State and apply the rank-null...

Kernel & Image of Linear Transformations

🎯 Learning Objectives

After this topic you will be able to:
  • Define the kernel (null space) of a linear transformation
  • Define the image (range) of a linear transformation
  • Find bases for the kernel and image of a linear transformation
  • State and apply the rank-nullity theorem for linear transformations
  • Determine whether a linear transformation is injective or surjective

📋 Prerequisites

  • Linear Transformations (Week 5) — definition and properties
  • Null Space & Column Space (Week 5) — the matrix version of kernel and image
  • Basis & Dimension (Week 4) — finding bases for subspaces

1. Intuition: What Gets Crushed vs. What Gets Hit

Every linear transformation T:VWT: V \to W tells us two things:
  1. Kernel (null space): Which vectors in VV get mapped to 0\mathbf{0}? These are the "crushed" vectors — they lose all information.
  2. Image (range): Which vectors in WW can be reached? These are the "hit" vectors — the possible outputs. (Diagram) Key insight: The kernel measures non-injectivity (how many vectors collapse to the same output). The image measures non-surjectivity (how much of WW is covered).

2. Kernel

2.1 Definition

Definition (Kernel). Let T:VWT: V \to W be a linear transformation. The kernel (or null space) of TT is:
>ker(T)={vVT(v)=0W}>> \ker(T) = \{\mathbf{v} \in V \mid T(\mathbf{v}) = \mathbf{0}_W\} >
Theorem: ker(T)\ker(T) is a subspace of VV. Proof:
  • 0Vker(T)\mathbf{0}_V \in \ker(T) because T(0V)=0WT(\mathbf{0}_V) = \mathbf{0}_W
  • If u,vker(T)\mathbf{u}, \mathbf{v} \in \ker(T), then T(u+v)=T(u)+T(v)=0+0=0T(\mathbf{u}+\mathbf{v}) = T(\mathbf{u}) + T(\mathbf{v}) = \mathbf{0} + \mathbf{0} = \mathbf{0}, so u+vker(T)\mathbf{u}+\mathbf{v} \in \ker(T)
  • If vker(T)\mathbf{v} \in \ker(T) and cRc \in \mathbb{R}, then T(cv)=cT(v)=c0=0T(c\mathbf{v}) = cT(\mathbf{v}) = c \cdot \mathbf{0} = \mathbf{0}, so cvker(T)c\mathbf{v} \in \ker(T)

2.2 Finding a Basis for the Kernel

Case 1: T:RnRmT: \mathbb{R}^n \to \mathbb{R}^m with standard matrix AA ker(T)=N(A)\ker(T) = N(A). Find null space basis as before. Case 2: T:VWT: V \to W in abstract Set T(v)=0T(\mathbf{v}) = \mathbf{0} and solve using the definition of TT.
Example 1: Kernel of a matrix transformation
T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2, T(x)=AxT(\mathbf{x}) = A\mathbf{x} where
>A=[121242]>> A = \begin{bmatrix} 1 & 2 & -1 \\ 2 & 4 & -2 \end{bmatrix} >
.
Solve Ax=0A\mathbf{x} = \mathbf{0}: Row 2 = 2(Row 1), so RREF is
>[121000]>> \begin{bmatrix} 1 & 2 & -1 \\ 0 & 0 & 0 \end{bmatrix} >
.
x1+2x2x3=0x_1 + 2x_2 - x_3 = 0, so x1=2x2+x3x_1 = -2x_2 + x_3. Free: x2,x3x_2, x_3.
>ker(T)={x2[210]+x3[101]}>> \ker(T) = \left\{ x_2\begin{bmatrix} -2 \\ 1 \\ 0 \end{bmatrix} + x_3\begin{bmatrix} 1 \\ 0 \\ 1 \end{bmatrix} \right\} >
Basis for ker(T)\ker(T): {(2,1,0),(1,0,1)}\{(-2,1,0), (1,0,1)\}. dim(ker(T))=2\dim(\ker(T)) = 2. Example 2: Kernel of a polynomial transformation
T:P2P1T: P_2 \to P_1, T(p)=pT(p) = p' (derivative).
ker(T)={pP2p(x)=0}={constant polynomials}\ker(T) = \{p \in P_2 \mid p'(x) = 0\} = \{\text{constant polynomials}\}.
Basis: {1}\{1\}. dim(ker(T))=1\dim(\ker(T)) = 1. (Constant polynomials are degree 0.)

3. Image

3.1 Definition

Definition (Image). Let T:VWT: V \to W be a linear transformation. The image (or range) of TT is:
>im(T)={T(v)WvV}>> \text{im}(T) = \{T(\mathbf{v}) \in W \mid \mathbf{v} \in V\} >
Theorem: im(T)\text{im}(T) is a subspace of WW. Proof:
  • 0Wim(T)\mathbf{0}_W \in \text{im}(T) because T(0V)=0WT(\mathbf{0}_V) = \mathbf{0}_W
  • If w1,w2im(T)\mathbf{w}_1, \mathbf{w}_2 \in \text{im}(T), then w1=T(v1)\mathbf{w}_1 = T(\mathbf{v}_1), w2=T(v2)\mathbf{w}_2 = T(\mathbf{v}_2). Then w1+w2=T(v1)+T(v2)=T(v1+v2)im(T)\mathbf{w}_1 + \mathbf{w}_2 = T(\mathbf{v}_1) + T(\mathbf{v}_2) = T(\mathbf{v}_1 + \mathbf{v}_2) \in \text{im}(T)
  • If wim(T)\mathbf{w} \in \text{im}(T) and cRc \in \mathbb{R}, cw=cT(v)=T(cv)im(T)c\mathbf{w} = cT(\mathbf{v}) = T(c\mathbf{v}) \in \text{im}(T)

3.2 Finding a Basis for the Image

Case 1: T:RnRmT: \mathbb{R}^n \to \mathbb{R}^m with standard matrix AA im(T)=C(A)\text{im}(T) = C(A). Basis = pivot columns of AA. Case 2: Abstract TT Find the span of {T(b1),,T(bn)}\{T(\mathbf{b}_1), \dots, T(\mathbf{b}_n)\} where {b1,,bn}\{\mathbf{b}_1, \dots, \mathbf{b}_n\} is a basis of VV, then reduce.
Example 3: Image of a matrix transformation
T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2, T(x)=AxT(\mathbf{x}) = A\mathbf{x} where
>A=[121242]>> A = \begin{bmatrix} 1 & 2 & -1 \\ 2 & 4 & -2 \end{bmatrix} >
.
Columns: (1,2)(1,2), (2,4)(2,4), (1,2)(-1,-2). Columns 2 and 3 are multiples of column 1.
im(T)=span{(1,2)}\text{im}(T) = \text{span}\{(1,2)\}, a line through origin.
Basis: {(1,2)}\{(1,2)\}. dim(im(T))=1\dim(\text{im}(T)) = 1. Example 4: Image of a derivative transformation
T:P2P1T: P_2 \to P_1, T(p)=pT(p) = p'.
T(1)=0T(1) = 0, T(x)=1T(x) = 1, T(x2)=2xT(x^2) = 2x.
im(T)=span{0,1,2x}=span{1,2x}=P1\text{im}(T) = \text{span}\{0, 1, 2x\} = \text{span}\{1, 2x\} = P_1 (all polynomials of degree 1\leq 1).
Basis: {1,x}\{1, x\}. dim(im(T))=2\dim(\text{im}(T)) = 2.

4. Rank-Nullity Theorem for Linear Transformations

Theorem (Rank-Nullity). For a linear transformation T:VWT: V \to W where VV is finite-dimensional:
>dim(ker(T))+dim(im(T))=dim(V)>> \dim(\ker(T)) + \dim(\text{im}(T)) = \dim(V) >
Terminology:
  • Nullity = dim(ker(T))\dim(\ker(T))
  • Rank = dim(im(T))\dim(\text{im}(T))
Example 5: Checking rank-nullity
For T:P2P1T: P_2 \to P_1, T(p)=pT(p) = p': dim(ker(T))=1\dim(\ker(T)) = 1 (constants) dim(im(T))=2\dim(\text{im}(T)) = 2 (P1P_1) dim(P2)=3\dim(P_2) = 3 1+2=31 + 2 = 3

5. Injectivity, Surjectivity, and Isomorphism

5.1 Injectivity (One-to-One)

Theorem. TT is injective iff ker(T)={0}\ker(T) = \{\mathbf{0}\}. Proof: (\Rightarrow) If T(v)=0T(\mathbf{v}) = \mathbf{0}, and T(0)=0T(\mathbf{0}) = \mathbf{0}, then by injectivity v=0\mathbf{v} = \mathbf{0}. (\Leftarrow) If T(u)=T(v)T(\mathbf{u}) = T(\mathbf{v}), then T(uv)=0T(\mathbf{u}-\mathbf{v}) = \mathbf{0}, so uvker(T)={0}\mathbf{u}-\mathbf{v} \in \ker(T) = \{\mathbf{0}\}, hence u=v\mathbf{u} = \mathbf{v}.

5.2 Surjectivity (Onto)

Theorem. TT is surjective iff im(T)=W\text{im}(T) = W (i.e., dim(im(T))=dim(W)\dim(\text{im}(T)) = \dim(W)).

5.3 Isomorphism

Definition (Isomorphism). A linear transformation T:VWT: V \to W is an isomorphism if it is both injective and surjective (bijective). In that case, VV and WW are called isomorphic. Key fact: VWV \cong W (isomorphic) iff dim(V)=dim(W)\dim(V) = \dim(W). Example 6: Isomorphism
T:R3P2T: \mathbb{R}^3 \to P_2, T(a,b,c)=a+bx+cx2T(a,b,c) = a + bx + cx^2 is an isomorphism.
ker(T)\ker(T): a+bx+cx2=0a + bx + cx^2 = 0a=b=c=0a=b=c=0ker(T)={0}\ker(T) = \{\mathbf{0}\} (injective) ✓
im(T)=P2\text{im}(T) = P_2 (surjective) ✓
dim(R3)=dim(P2)=3\dim(\mathbb{R}^3) = \dim(P_2) = 3

6. Edge Cases & Gotchas

SituationKernelImage
Zero transformationker(T)=V\ker(T) = Vim(T)={0}\text{im}(T) = \{\mathbf{0}\}
Identity transformationker(T)={0}\ker(T) = \{\mathbf{0}\}im(T)=V\text{im}(T) = V
Projection onto subspaceThe orthogonal complementThe subspace itself
**Differentiation on PnP_n **Constant polynomialsPn1P_{n-1}

7. Common Pitfalls

❌ Pitfall 1: Confusing kernel of TT with kernel of its matrix

When TT is given as a formula (not a matrix), solve T(v)=0T(\mathbf{v}) = \mathbf{0} directly rather than trying to find its matrix first.

❌ Pitfall 2: Thinking image = codomain

The image is a subspace of the codomain, but may not equal it. Surjectivity is a special case.

❌ Pitfall 3: Forgetting rank-nullity counts domain dimension

dim(ker(T))+dim(im(T))=dim(V)\dim(\ker(T)) + \dim(\text{im}(T)) = \dim(V), not dim(W)\dim(W).

8. Formula Summary Table

ConceptDefinitionRelation to Matrix
Kernel{vVT(v)=0}\{v \in V \mid T(v) = 0\}N(A)N(A)
Image{T(v)WvV}\{T(v) \in W \mid v \in V\}C(A)C(A)
Nullitydim(ker(T))\dim(\ker(T))nrank(A)n - \text{rank}(A)
Rankdim(im(T))\dim(\text{im}(T))rank(A)\text{rank}(A)
Rank-Nullitydim(ker)+dim(im)=dim(V)\dim(\ker) + \dim(\text{im}) = \dim(V)r+(nr)=nr + (n-r) = n
Injectiveker(T)={0}\ker(T) = \{\mathbf{0}\}N(A)={0}N(A) = \{\mathbf{0}\}
Surjectiveim(T)=W\text{im}(T) = WC(A)=RmC(A) = \mathbb{R}^m

9. 📝 Practice Questions

Q1: Kernel of a matrix transformation
Find a basis for ker(T)\ker(T) where T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2, T(x,y,z)=(x+y,2x+2y)T(x,y,z) = (x+y, 2x+2y).
Solution: Solve x+y=0x+y=0, 2x+2y=02x+2y=0y=xy=-x, zz free. ker(T)={(x,x,z)x,zR}=span{(1,1,0),(0,0,1)}\ker(T) = \{(x,-x,z) \mid x,z \in \mathbb{R}\} = \text{span}\{(1,-1,0), (0,0,1)\}. Basis: {(1,1,0),(0,0,1)}\{(1,-1,0), (0,0,1)\}. Nullity = 2. Q2: Image of a matrix transformation
Find a basis for im(T)\text{im}(T) where T(x,y)=(x+2y,2x+4y,x2y)T(x,y) = (x+2y, 2x+4y, -x-2y).
Solution: Standard matrix: T(1,0)=(1,2,1)T(1,0) = (1,2,-1), T(0,1)=(2,4,2)T(0,1) = (2,4,-2).
>A=[122412]>> A = \begin{bmatrix} 1 & 2 \\ 2 & 4 \\ -1 & -2 \end{bmatrix} >
. Column 2 = 2(column 1). Basis for C(A)C(A): {(1,2,1)}\{(1,2,-1)\}. im(T)=span{(1,2,1)}\text{im}(T) = \text{span}\{(1,2,-1)\}, a line. Rank = 1. Q3: Rank-Nullity on a polynomial map
For T:P2P2T: P_2 \to P_2, T(p)(x)=p(0)+p(1)x+p(2)x2T(p)(x) = p(0) + p(1)x + p(2)x^2, find nullity and rank.
Solution: Let p(x)=a+bx+cx2p(x) = a + bx + cx^2. p(0)=ap(0) = a, p(1)=a+b+cp(1) = a + b + c, p(2)=a+2b+4cp(2) = a + 2b + 4c. T(p)=a+(a+b+c)x+(a+2b+4c)x2T(p) = a + (a+b+c)x + (a+2b+4c)x^2.
Kernel: Solve a=0a = 0, a+b+c=0a+b+c = 0, a+2b+4c=0a+2b+4c = 0. From first: a=0a=0. Then b+c=0b+c = 0, 2b+4c=02b+4c = 0b=cb = -c, 2(c)+4c=2c=02(-c)+4c = 2c = 0c=0c=0, b=0b=0. ker(T)={0}\ker(T) = \{0\}. Nullity = 0. Rank = dim(P2)0=3\dim(P_2) - 0 = 3. im(T)=P2\text{im}(T) = P_2. Q4: Injective but not surjective
Show T:R2R3T: \mathbb{R}^2 \to \mathbb{R}^3, T(x,y)=(x,y,0)T(x,y) = (x, y, 0) is injective but not surjective.
Solution: ker(T)\ker(T): (x,y,0)=(0,0,0)(x,y,0) = (0,0,0)x=y=0x=y=0. ker(T)={0}\ker(T) = \{\mathbf{0}\}, injective ✓.
im(T)={(x,y,0)}\text{im}(T) = \{(x,y,0)\} = xyxy-plane in R3\mathbb{R}^3. Not all of R3\mathbb{R}^3 (e.g., (0,0,1)(0,0,1) not reachable). Not surjective.
Check rank-nullity: 0+2=2=dim(R2)0 + 2 = 2 = \dim(\mathbb{R}^2)Q5: Surjective but not injective
Show T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2, T(x,y,z)=(x,0)T(x,y,z) = (x, 0) is surjective? Actually no. Let me fix.
T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2, T(x,y,z)=(x,y)T(x,y,z) = (x, y) is surjective (every (a,b)(a,b) is reached by (a,b,0)(a,b,0)), but not injective ((0,0,1)(0,0,1) also maps to (0,0)(0,0)).
ker(T)={(0,0,z)}\ker(T) = \{(0,0,z)\}, dimension 1. im(T)=R2\text{im}(T) = \mathbb{R}^2, dimension 2. Rank-nullity: 1+2=3=dim(R3)1 + 2 = 3 = \dim(\mathbb{R}^3)Q6: Isomorphism
Is T:R3R3T: \mathbb{R}^3 \to \mathbb{R}^3, T(x,y,z)=(x,x+y,x+y+z)T(x,y,z) = (x, x+y, x+y+z) an isomorphism?
Solution: Matrix of TT:
>A=[100110111]>> A = \begin{bmatrix} 1 & 0 & 0 \\ 1 & 1 & 0 \\ 1 & 1 & 1 \end{bmatrix} >
.
det(A)=10\det(A) = 1 \neq 0, so AA is invertible. TT is an isomorphism.
ker(T)={0}\ker(T) = \{\mathbf{0}\}, im(T)=R3\text{im}(T) = \mathbb{R}^3. Q7: Kernel of an integral operator
T:C[0,1]RT: C[0,1] \to \mathbb{R}, T(f)=01f(x)dxT(f) = \int_0^1 f(x) dx. What is ker(T)\ker(T)?
Solution: ker(T)={fC[0,1]01f(x)dx=0}\ker(T) = \{f \in C[0,1] \mid \int_0^1 f(x) dx = 0\}. These are functions with zero average (zero net area). Examples: f(x)=x12f(x) = x - \frac{1}{2}, sin(2πx)\sin(2\pi x). Note: ker(T)\ker(T) is infinite-dimensional. Q8: Image of a differentiation map
T:P3P2T: P_3 \to P_2, T(p)=pT(p) = p'. Find im(T)\text{im}(T).
Solution: T(1)=0T(1) = 0, T(x)=1T(x) = 1, T(x2)=2xT(x^2) = 2x, T(x3)=3x2T(x^3) = 3x^2. im(T)=span{0,1,2x,3x2}=span{1,x,x2}=P2\text{im}(T) = \text{span}\{0, 1, 2x, 3x^2\} = \text{span}\{1, x, x^2\} = P_2. So im(T)=P2\text{im}(T) = P_2 (surjective). dim(im(T))=3\dim(\text{im}(T)) = 3. Nullity = dim(P3)3=43=1\dim(P_3) - 3 = 4 - 3 = 1. Q9: Determining if a vector is in the image
T:R3R2T: \mathbb{R}^3 \to \mathbb{R}^2,
>T(x)=[102011]x>> T(\mathbf{x}) = \begin{bmatrix} 1 & 0 & 2 \\ 0 & 1 & 1 \end{bmatrix}\mathbf{x} >
. Is (3,1)(3,1) in im(T)\text{im}(T)?
Solution: Solve T(x)=(3,1)T(\mathbf{x}) = (3,1): x+2z=3x + 2z = 3, y+z=1y + z = 1. Choose z=0z = 0: x=3x = 3, y=1y = 1. So x=(3,1,0)\mathbf{x} = (3,1,0) works. Yes, (3,1)im(T)(3,1) \in \text{im}(T). Q10: Kernel and image of projection
T:R3R3T: \mathbb{R}^3 \to \mathbb{R}^3, T(x,y,z)=(x,y,0)T(x,y,z) = (x, y, 0) (projection onto xyxy-plane). Find bases for ker(T)\ker(T) and im(T)\text{im}(T).
Solution: ker(T)\ker(T): (x,y,0)=(0,0,0)(x,y,0) = (0,0,0)x=0,y=0x=0, y=0. So ker(T)={(0,0,z)}=span{(0,0,1)}\ker(T) = \{(0,0,z)\} = \text{span}\{(0,0,1)\}. Basis: {(0,0,1)}\{(0,0,1)\}.
im(T)\text{im}(T): T(1,0,0)=(1,0,0)T(1,0,0) = (1,0,0), T(0,1,0)=(0,1,0)T(0,1,0) = (0,1,0), T(0,0,1)=(0,0,0)T(0,0,1) = (0,0,0). im(T)=span{(1,0,0),(0,1,0)}\text{im}(T) = \text{span}\{(1,0,0), (0,1,0)\} = xyxy-plane. Basis: {(1,0,0),(0,1,0)}\{(1,0,0), (0,1,0)\}.
Rank-nullity: 1+2=31 + 2 = 3

🔗 Cross-References

Document outline

Keep your place and jump directly to a heading.

Table of Contents
System Normal // Awaiting Context

Intelligence Hub

Navigate the knowledge graph to generate context. The Hub adapts dynamically to surface backlinks, related notes, and metadata insights.