Kernel & Image of Linear Transformations
2034 words
10 min read
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:V→W tells us two things:
- Kernel (null space): Which vectors in V get mapped to 0? These are the "crushed" vectors — they lose all information.
- Image (range): Which vectors in W 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 W is covered).
2. Kernel
2.1 Definition
>ker(T)={v∈V∣T(v)=0W}>Definition (Kernel). Let T:V→W be a linear transformation. The kernel (or null space) of T is:
Theorem: ker(T) is a subspace of V.
Proof:
- 0V∈ker(T) because T(0V)=0W ✓
- If u,v∈ker(T), then T(u+v)=T(u)+T(v)=0+0=0, so u+v∈ker(T) ✓
- If v∈ker(T) and c∈R, then T(cv)=cT(v)=c⋅0=0, so cv∈ker(T) ✓
2.2 Finding a Basis for the Kernel
Case 1: T:Rn→Rm with standard matrix A ker(T)=N(A). Find null space basis as before.
Case 2: T:V→W in abstract Set T(v)=0 and solve using the definition of T.
>A=[1224−1−2]>Example 1: Kernel of a matrix transformationT:R3→R2, T(x)=Ax where
>[1020−10]>.Solve Ax=0: Row 2 = 2(Row 1), so RREF is
>ker(T)=⎩⎨⎧x2−210+x3101⎭⎬⎫>.x1+2x2−x3=0, so x1=−2x2+x3. Free: x2,x3.
Basis for ker(T): {(−2,1,0),(1,0,1)}. dim(ker(T))=2. Example 2: Kernel of a polynomial transformationT:P2→P1, T(p)=p′ (derivative).ker(T)={p∈P2∣p′(x)=0}={constant polynomials}.Basis: {1}. dim(ker(T))=1. (Constant polynomials are degree 0.)
3. Image
3.1 Definition
>im(T)={T(v)∈W∣v∈V}>Definition (Image). Let T:V→W be a linear transformation. The image (or range) of T is:
Theorem: im(T) is a subspace of W.
Proof:
- 0W∈im(T) because T(0V)=0W ✓
- If w1,w2∈im(T), then w1=T(v1), w2=T(v2). Then w1+w2=T(v1)+T(v2)=T(v1+v2)∈im(T) ✓
- If w∈im(T) and c∈R, cw=cT(v)=T(cv)∈im(T) ✓
3.2 Finding a Basis for the Image
Case 1: T:Rn→Rm with standard matrix A im(T)=C(A). Basis = pivot columns of A.
Case 2: Abstract T Find the span of {T(b1),…,T(bn)} where {b1,…,bn} is a basis of V, then reduce.
>A=[1224−1−2]>Example 3: Image of a matrix transformationT:R3→R2, T(x)=Ax where
.Columns: (1,2), (2,4), (−1,−2). Columns 2 and 3 are multiples of column 1.im(T)=span{(1,2)}, a line through origin.Basis: {(1,2)}. dim(im(T))=1. Example 4: Image of a derivative transformationT:P2→P1, T(p)=p′.T(1)=0, T(x)=1, T(x2)=2x.im(T)=span{0,1,2x}=span{1,2x}=P1 (all polynomials of degree ≤1).Basis: {1,x}. dim(im(T))=2.
4. Rank-Nullity Theorem for Linear Transformations
>dim(ker(T))+dim(im(T))=dim(V)>Theorem (Rank-Nullity). For a linear transformation T:V→W where V is finite-dimensional:
Terminology:
- Nullity = dim(ker(T))
- Rank = dim(im(T))
Example 5: Checking rank-nullityFor T:P2→P1, T(p)=p′: dim(ker(T))=1 (constants) dim(im(T))=2 (P1) dim(P2)=3 1+2=3 ✓
5. Injectivity, Surjectivity, and Isomorphism
5.1 Injectivity (One-to-One)
Theorem. T is injective iff ker(T)={0}. Proof: (⇒) If T(v)=0, and T(0)=0, then by injectivity v=0. (⇐) If T(u)=T(v), then T(u−v)=0, so u−v∈ker(T)={0}, hence u=v.
5.2 Surjectivity (Onto)
Theorem. T is surjective iff im(T)=W (i.e., dim(im(T))=dim(W)).
5.3 Isomorphism
Definition (Isomorphism). A linear transformation T:V→W is an isomorphism if it is both injective and surjective (bijective). In that case, V and W are called isomorphic. Key fact: V≅W (isomorphic) iff dim(V)=dim(W). Example 6: IsomorphismT:R3→P2, T(a,b,c)=a+bx+cx2 is an isomorphism.ker(T): a+bx+cx2=0 ⇒ a=b=c=0 ⇒ ker(T)={0} (injective) ✓im(T)=P2 (surjective) ✓dim(R3)=dim(P2)=3 ✓
6. Edge Cases & Gotchas
| Situation | Kernel | Image |
|---|---|---|
| Zero transformation | ker(T)=V | im(T)={0} |
| Identity transformation | ker(T)={0} | im(T)=V |
| Projection onto subspace | The orthogonal complement | The subspace itself |
| **Differentiation on Pn ** | Constant polynomials | Pn−1 |
7. Common Pitfalls
❌ Pitfall 1: Confusing kernel of T with kernel of its matrix
When T is given as a formula (not a matrix), solve T(v)=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), not dim(W).
8. Formula Summary Table
| Concept | Definition | Relation to Matrix |
|---|---|---|
| Kernel | {v∈V∣T(v)=0} | N(A) |
| Image | {T(v)∈W∣v∈V} | C(A) |
| Nullity | dim(ker(T)) | n−rank(A) |
| Rank | dim(im(T)) | rank(A) |
| Rank-Nullity | dim(ker)+dim(im)=dim(V) | r+(n−r)=n |
| Injective | ker(T)={0} | N(A)={0} |
| Surjective | im(T)=W | C(A)=Rm |
9. 📝 Practice Questions
>A=12−124−2>Q1: Kernel of a matrix transformationFind a basis for ker(T) where T:R3→R2, T(x,y,z)=(x+y,2x+2y).Solution: Solve x+y=0, 2x+2y=0 ⇒ y=−x, z free. ker(T)={(x,−x,z)∣x,z∈R}=span{(1,−1,0),(0,0,1)}. Basis: {(1,−1,0),(0,0,1)}. Nullity = 2. Q2: Image of a matrix transformationFind a basis for im(T) where T(x,y)=(x+2y,2x+4y,−x−2y).Solution: Standard matrix: T(1,0)=(1,2,−1), T(0,1)=(2,4,−2).
>A=111011001>. Column 2 = 2(column 1). Basis for C(A): {(1,2,−1)}. im(T)=span{(1,2,−1)}, a line. Rank = 1. Q3: Rank-Nullity on a polynomial mapFor T:P2→P2, T(p)(x)=p(0)+p(1)x+p(2)x2, find nullity and rank.Solution: Let p(x)=a+bx+cx2. p(0)=a, p(1)=a+b+c, p(2)=a+2b+4c. T(p)=a+(a+b+c)x+(a+2b+4c)x2.Kernel: Solve a=0, a+b+c=0, a+2b+4c=0. From first: a=0. Then b+c=0, 2b+4c=0 ⇒ b=−c, 2(−c)+4c=2c=0 ⇒ c=0, b=0. ker(T)={0}. Nullity = 0. Rank = dim(P2)−0=3. im(T)=P2. Q4: Injective but not surjectiveShow T:R2→R3, T(x,y)=(x,y,0) is injective but not surjective.Solution: ker(T): (x,y,0)=(0,0,0) ⇒ x=y=0. ker(T)={0}, injective ✓.im(T)={(x,y,0)} = xy-plane in R3. Not all of R3 (e.g., (0,0,1) not reachable). Not surjective.Check rank-nullity: 0+2=2=dim(R2) ✓ Q5: Surjective but not injectiveShow T:R3→R2, T(x,y,z)=(x,0) is surjective? Actually no. Let me fix.T:R3→R2, T(x,y,z)=(x,y) is surjective (every (a,b) is reached by (a,b,0)), but not injective ((0,0,1) also maps to (0,0)).ker(T)={(0,0,z)}, dimension 1. im(T)=R2, dimension 2. Rank-nullity: 1+2=3=dim(R3) ✓ Q6: IsomorphismIs T:R3→R3, T(x,y,z)=(x,x+y,x+y+z) an isomorphism?Solution: Matrix of T:
>T(x)=[100121]x>.det(A)=1=0, so A is invertible. T is an isomorphism.ker(T)={0}, im(T)=R3. Q7: Kernel of an integral operatorT:C[0,1]→R, T(f)=∫01f(x)dx. What is ker(T)?Solution: ker(T)={f∈C[0,1]∣∫01f(x)dx=0}. These are functions with zero average (zero net area). Examples: f(x)=x−21, sin(2πx). Note: ker(T) is infinite-dimensional. Q8: Image of a differentiation mapT:P3→P2, T(p)=p′. Find im(T).Solution: T(1)=0, T(x)=1, T(x2)=2x, T(x3)=3x2. im(T)=span{0,1,2x,3x2}=span{1,x,x2}=P2. So im(T)=P2 (surjective). dim(im(T))=3. Nullity = dim(P3)−3=4−3=1. Q9: Determining if a vector is in the imageT:R3→R2,
. Is (3,1) in im(T)?Solution: Solve T(x)=(3,1): x+2z=3, y+z=1. Choose z=0: x=3, y=1. So x=(3,1,0) works. Yes, (3,1)∈im(T). Q10: Kernel and image of projectionT:R3→R3, T(x,y,z)=(x,y,0) (projection onto xy-plane). Find bases for ker(T) and im(T).Solution: ker(T): (x,y,0)=(0,0,0) ⇒ x=0,y=0. So ker(T)={(0,0,z)}=span{(0,0,1)}. Basis: {(0,0,1)}.im(T): T(1,0,0)=(1,0,0), T(0,1,0)=(0,1,0), T(0,0,1)=(0,0,0). im(T)=span{(1,0,0),(0,1,0)} = xy-plane. Basis: {(1,0,0),(0,1,0)}.Rank-nullity: 1+2=3 ✓
🔗 Cross-References
- Next topic: Matrix Representation of Linear Transformations
- Week 5 (Rank-Nullity Theorem): The matrix version of the same idea
- Week 7 (Similarity): Two matrix representations of the same T
- BSCS2004 (ML Foundations): Feature maps, kernel methods in SVM Join Discord Previous5.2 Linear TransformationsNext6.2 Matrix Representation