Study guide
8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem
Key Takeaways Explain This Topic AI
A linear transformation T: V -> W preserves vector addition and scalar multiplication; it is completely and uniquely determined by its action on any basis of V.
The kernel ker(T) is a subspace of the domain measuring injectivity (ker(T) = {0} iff T is one-to-one), while the image im(T) is a subspace of the codomain measuring surjectivity (im(T) = W iff T is onto).
The Rank-Nullity Theorem states that for finite-dimensional V, dim(ker T) + dim(im T) = dim V, completely partitioning the domain's dimension into nullity and rank.
For an endomorphism on a finite-dimensional space (T: V -> V with dim V < infinity), injectivity, surjectivity, and bijectivity are strictly equivalent; this equivalence fails in infinite dimensions.
Composition satisfies the rank bound rank(S o T) <= min(rank S, rank T) and Sylvester's inequality rank(S o T) >= rank S + rank T - dim W.
Last updated: September 2026
8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem
Linear transformations represent morphisms that preserve algebraic structure between vector spaces. On the GRE Subject Test in Mathematics, linear transformations are evaluated through their fundamental subspaces—kernel (null space) and range (image)—their injectivity and surjectivity characteristics, the Rank-Nullity Theorem, and composition algebra.
Definition and Fundamental Properties
Let V V V and W W W be vector spaces over the same field F \mathbb{F} F . A function T : V → W T: V \to W T : V → W is a linear transformation (or linear map) if for all u , v ∈ V u, v \in V u , v ∈ V and c ∈ F c \in \mathbb{F} c ∈ F :
Additivity : T ( u + v ) = T ( u ) + T ( v ) T(u + v) = T(u) + T(v) T ( u + v ) = T ( u ) + T ( v ) .
Homogeneity : T ( c u ) = c T ( u ) T(c u) = c T(u) T ( c u ) = c T ( u ) .
Equivalently, T ( c u + v ) = c T ( u ) + T ( v ) T(c u + v) = c T(u) + T(v) T ( c u + v ) = c T ( u ) + T ( v ) for all u , v ∈ V u, v \in V u , v ∈ V and c ∈ F c \in \mathbb{F} c ∈ F .
Elementary Consequences
T ( 0 V ) = 0 W T(0_V) = 0_W T ( 0 V ) = 0 W . If T ( 0 V ) ≠ 0 W T(0_V) \neq 0_W T ( 0 V ) = 0 W , T T T is non-linear (e.g., affine shifts T ( x ) = A x + b T(x) = Ax + b T ( x ) = A x + b with b ≠ 0 b \neq 0 b = 0 ).
T ( − v ) = − T ( v ) T(-v) = -T(v) T ( − v ) = − T ( v ) .
Linear combinations are preserved: T ( ∑ i = 1 k c i v i ) = ∑ i = 1 k c i T ( v i ) T\left(\sum_{i=1}^k c_i v_i\right) = \sum_{i=1}^k c_i T(v_i) T ( ∑ i = 1 k c i v i ) = ∑ i = 1 k c i T ( v i ) .
Principle of Linear Extension
Let B = { v 1 , … , v n } \mathcal{B} = \{v_1, \dots, v_n\} B = { v 1 , … , v n } be a basis of V V V , and let { w 1 , … , w n } \{w_1, \dots, w_n\} { w 1 , … , w n } be arbitrary vectors in W W W . Then there exists a unique linear transformation T : V → W T: V \to W T : V → W such that: T ( v i ) = w i ∀ i ∈ { 1 , … , n } . T(v_i) = w_i \quad \forall i \in \{1, \dots, n\}. T ( v i ) = w i ∀ i ∈ { 1 , … , n } .
A linear transformation is completely and unambiguously determined by its action on a basis.
- Kernel, Range, Injectivity, and Surjectivity
- Kernel (Null Space)
The kernel of T : V → W T: V \to W T : V → W , denoted ker ( T ) \ker(T) ker ( T ) or null ( T ) \operatorname{null}(T) null ( T ) , is the set of all vectors in V V V mapped to zero: ker ( T ) = { v ∈ V ∣ T ( v ) = 0 W } . \ker(T) = \{v \in V \mid T(v) = 0_W\}. ker ( T ) = { v ∈ V ∣ T ( v ) = 0 W } .
ker ( T ) \ker(T) ker ( T ) is a subspace of the domain V V V .
The nullity of T T T is nullity ( T ) = dim ( ker T ) \operatorname{nullity}(T) = \dim(\ker T) nullity ( T ) = dim ( ker T ) .
Range (Image)
The range (or image) of T : V → W T: V \to W T : V → W , denoted im ( T ) \operatorname{im}(T) im ( T ) or range ( T ) \operatorname{range}(T) range ( T ) , is the set of all outputs: im ( T ) = { T ( v ) ∣ v ∈ V } = { w ∈ W ∣ ∃ v ∈ V such that T ( v ) = w } . \operatorname{im}(T) = \{T(v) \mid v \in V\} = \{w \in W \mid \exists v \in V \text{ such that } T(v) = w\}. im ( T ) = { T ( v ) ∣ v ∈ V } = { w ∈ W ∣ ∃ v ∈ V such that T ( v ) = w } .
im ( T ) \operatorname{im}(T) im ( T ) is a subspace of the codomain W W W .
If span ( { v 1 , … , v n } ) = V \operatorname{span}(\{v_1, \dots, v_n\}) = V span ({ v 1 , … , v n }) = V , then im ( T ) = span ( { T ( v 1 ) , … , T ( v n ) } ) \operatorname{im}(T) = \operatorname{span}(\{T(v_1), \dots, T(v_n)\}) im ( T ) = span ({ T ( v 1 ) , … , T ( v n )}) .
The rank of T T T is rank ( T ) = dim ( im T ) \operatorname{rank}(T) = \dim(\operatorname{im} T) rank ( T ) = dim ( im T ) .
Injectivity and Surjectivity Criteria
Injective (One-to-One) : T T T is injective if and only if ker ( T ) = { 0 V } ⟺ nullity ( T ) = 0 \ker(T) = \{0_V\} \iff \operatorname{nullity}(T) = 0 ker ( T ) = { 0 V } ⟺ nullity ( T ) = 0 .
Surjective (Onto) : T T T is surjective if and only if im ( T ) = W ⟺ rank ( T ) = dim W \operatorname{im}(T) = W \iff \operatorname{rank}(T) = \dim W im ( T ) = W ⟺ rank ( T ) = dim W .
Isomorphism (Bijective) : T T T is an isomorphism if it is both injective and surjective. Two finite-dimensional spaces over F \mathbb{F} F are isomorphic ( V ≅ W V \cong W V ≅ W ) if and only if dim V = dim W \dim V = \dim W dim V = dim W .
The Rank-Nullity Theorem
The Rank-Nullity Theorem (Fundamental Theorem of Linear Maps) bridges the dimensions of the kernel, image, and domain.
Theorem Statement
Let V V V be a finite-dimensional vector space and let T : V → W T: V \to W T : V → W be a linear transformation. Then: dim ( ker T ) + dim ( im T ) = dim V . \dim(\ker T) + \dim(\operatorname{im} T) = \dim V. dim ( ker T ) + dim ( im T ) = dim V . nullity ( T ) + rank ( T ) = dim ( Domain ) . \operatorname{nullity}(T) + \operatorname{rank}(T) = \dim(\operatorname{Domain}). nullity ( T ) + rank ( T ) = dim ( Domain ) .
Key Proof Mechanism
Let { u 1 , … , u k } \{u_1, \dots, u_k\} { u 1 , … , u k } be a basis of ker ( T ) \ker(T) ker ( T ) (so nullity ( T ) = k \operatorname{nullity}(T) = k nullity ( T ) = k ). By the Basis Extension Theorem, extend this to a basis { u 1 , … , u k , v 1 , … , v r } \{u_1, \dots, u_k, v_1, \dots, v_r\} { u 1 , … , u k , v 1 , … , v r } of V V V , where k + r = dim V k + r = \dim V k + r = dim V .
It follows that the set { T ( v 1 ) , … , T ( v r ) } \{T(v_1), \dots, T(v_r)\} { T ( v 1 ) , … , T ( v r )} is linearly independent and spans im ( T ) \operatorname{im}(T) im ( T ) , forming a basis of im ( T ) \operatorname{im}(T) im ( T ) . Thus rank ( T ) = r \operatorname{rank}(T) = r rank ( T ) = r , establishing k + r = dim V k + r = \dim V k + r = dim V .
Endomorphisms and Dimensional Constraints
When T : V → V T: V \to V T : V → V is an endomorphism (operator on V V V ) with dim V = n < ∞ \dim V = n < \infty dim V = n < ∞ , the Rank-Nullity Theorem yields an equivalence: T is injective ⟺ T is surjective ⟺ T is an isomorphism ⟺ ker ( T ) = { 0 } ⟺ rank ( T ) = n . T \text{ is injective} \iff T \text{ is surjective} \iff T \text{ is an isomorphism} \iff \ker(T) = \{0\} \iff \operatorname{rank}(T) = n. T is injective ⟺ T is surjective ⟺ T is an isomorphism ⟺ ker ( T ) = { 0 } ⟺ rank ( T ) = n .
Dimensional Constraints Between Different Spaces
For any linear map T : V → W T: V \to W T : V → W between finite-dimensional spaces:
Domain Larger than Codomain ( dim V > dim W \dim V > \dim W dim V > dim W ): nullity ( T ) = dim V − rank ( T ) ≥ dim V − dim W > 0. \operatorname{nullity}(T) = \dim V - \operatorname{rank}(T) \ge \dim V - \dim W > 0. nullity ( T ) = dim V − rank ( T ) ≥ dim V − dim W > 0. Therefore, T T T cannot be injective . There must exist a non-trivial kernel.
Domain Smaller than Codomain ( dim V < dim W \dim V < \dim W dim V < dim W ): rank ( T ) = dim V − nullity ( T ) ≤ dim V < dim W . \operatorname{rank}(T) = \dim V - \operatorname{nullity}(T) \le \dim V < \dim W. rank ( T ) = dim V − nullity ( T ) ≤ dim V < dim W . Therefore, T T T cannot be surjective . The image cannot fill W W W .
Infinite-Dimensional Failure
The equivalence between injectivity and surjectivity fails completely when dim V = ∞ \dim V = \infty dim V = ∞ .
Right-Shift Operator on ℓ 2 \ell^2 ℓ 2 : S ( x 1 , x 2 , … ) = ( 0 , x 1 , x 2 , … ) S(x_1, x_2, \dots) = (0, x_1, x_2, \dots) S ( x 1 , x 2 , … ) = ( 0 , x 1 , x 2 , … ) is injective ( ker S = { 0 } \ker S = \{0\} ker S = { 0 } ) but not surjective ( ( 1 , 0 , 0 , … ) ∉ im S (1, 0, 0, \dots) \notin \operatorname{im} S ( 1 , 0 , 0 , … ) ∈ / im S ).
Left-Shift Operator on ℓ 2 \ell^2 ℓ 2 : L ( x 1 , x 2 , … ) = ( x 2 , x 3 , … ) L(x_1, x_2, \dots) = (x_2, x_3, \dots) L ( x 1 , x 2 , … ) = ( x 2 , x 3 , … ) is surjective but not injective ( L ( 1 , 0 , 0 , … ) = 0 L(1, 0, 0, \dots) = 0 L ( 1 , 0 , 0 , … ) = 0 ).
Composition of Linear Maps and Rank Inequalities
For linear maps T : V → W T: V \to W T : V → W and S : W → U S: W \to U S : W → U :
S ∘ T : V → U S \circ T: V \to U S ∘ T : V → U is linear.
Kernel Inclusion : ker ( T ) ⊆ ker ( S ∘ T ) \ker(T) \subseteq \ker(S \circ T) ker ( T ) ⊆ ker ( S ∘ T ) .
Image Inclusion : im ( S ∘ T ) ⊆ im ( S ) \operatorname{im}(S \circ T) \subseteq \operatorname{im}(S) im ( S ∘ T ) ⊆ im ( S ) .
Standard Rank Bound : rank ( S ∘ T ) ≤ min ( rank ( S ) , rank ( T ) ) . \operatorname{rank}(S \circ T) \le \min(\operatorname{rank}(S), \operatorname{rank}(T)). rank ( S ∘ T ) ≤ min ( rank ( S ) , rank ( T )) .
Sylvester's Rank Inequality : rank ( S ∘ T ) ≥ rank ( S ) + rank ( T ) − dim W . \operatorname{rank}(S \circ T) \ge \operatorname{rank}(S) + \operatorname{rank}(T) - \dim W. rank ( S ∘ T ) ≥ rank ( S ) + rank ( T ) − dim W .
Summary of Mapping Invariants
Dimension Relation Injective Possible? Surjective Possible? Bijective Possible?
dim V < dim W \dim V < \dim W dim V < dim W Yes (e.g., canonical inclusion) No (rank ≤ dim V < dim W \le \dim V < \dim W ≤ dim V < dim W ) No
dim V = dim W < ∞ \dim V = \dim W < \infty dim V = dim W < ∞ Yes (iff surjective) Yes (iff injective) Yes (invertible)
dim V > dim W \dim V > \dim W dim V > dim W No (nullity ≥ dim V − dim W > 0 \ge \dim V - \dim W > 0 ≥ dim V − dim W > 0 ) Yes (e.g., projection) No
- dim V = ∞ \dim V = \infty dim V = ∞ Yes (without surjectivity) Yes (without injectivity) Yes
- Step-by-Step Worked Problems
- Problem 1: Rank and Nullity of a Differential Map
Let T : P 3 ( R ) → P 2 ( R ) T: P_3(\mathbb{R}) \to P_2(\mathbb{R}) T : P 3 ( R ) → P 2 ( R ) be defined by T ( p ( x ) ) = p ′ ( x ) − 2 p ′ ′ ( x ) T(p(x)) = p'(x) - 2 p''(x) T ( p ( x )) = p ′ ( x ) − 2 p ′′ ( x ) . Find nullity ( T ) \operatorname{nullity}(T) nullity ( T ) and rank ( T ) \operatorname{rank}(T) rank ( T ) .
Solution :
Domain is P 3 ( R ) P_3(\mathbb{R}) P 3 ( R ) with dim ( P 3 ( R ) ) = 4 \dim(P_3(\mathbb{R})) = 4 dim ( P 3 ( R )) = 4 . Codomain is P 2 ( R ) P_2(\mathbb{R}) P 2 ( R ) with dimension 3.
Find ker ( T ) \ker(T) ker ( T ) : Let p ( x ) = a x 3 + b x 2 + c x + d p(x) = ax^3 + bx^2 + cx + d p ( x ) = a x 3 + b x 2 + c x + d .
p ′ ( x ) = 3 a x 2 + 2 b x + c p'(x) = 3ax^2 + 2bx + c p ′ ( x ) = 3 a x 2 + 2 b x + c .
p ′ ′ ( x ) = 6 a x + 2 b p''(x) = 6ax + 2b p ′′ ( x ) = 6 a x + 2 b .
T ( p ) = 3 a x 2 + ( 2 b − 12 a ) x + ( c − 4 b ) = 0 T(p) = 3ax^2 + (2b - 12a)x + (c - 4b) = 0 T ( p ) = 3 a x 2 + ( 2 b − 12 a ) x + ( c − 4 b ) = 0 .
Equating coefficients:
3 a = 0 ⟹ a = 0 3a = 0 \implies a = 0 3 a = 0 ⟹ a = 0 .
2 b − 12 ( 0 ) = 0 ⟹ b = 0 2b - 12(0) = 0 \implies b = 0 2 b − 12 ( 0 ) = 0 ⟹ b = 0 .
c − 4 ( 0 ) = 0 ⟹ c = 0 c - 4(0) = 0 \implies c = 0 c − 4 ( 0 ) = 0 ⟹ c = 0 .
The constant term d d d is completely unrestricted!
Thus ker ( T ) = { d ∣ d ∈ R } = span ( { 1 } ) \ker(T) = \{d \mid d \in \mathbb{R}\} = \operatorname{span}(\{1\}) ker ( T ) = { d ∣ d ∈ R } = span ({ 1 }) .
Hence nullity ( T ) = 1 \operatorname{nullity}(T) = 1 nullity ( T ) = 1 .
By the Rank-Nullity Theorem: rank ( T ) = dim ( P 3 ( R ) ) − nullity ( T ) = 4 − 1 = 3. \operatorname{rank}(T) = \dim(P_3(\mathbb{R})) - \operatorname{nullity}(T) = 4 - 1 = 3. rank ( T ) = dim ( P 3 ( R )) − nullity ( T ) = 4 − 1 = 3. Since rank ( T ) = 3 = dim ( P 2 ( R ) ) \operatorname{rank}(T) = 3 = \dim(P_2(\mathbb{R})) rank ( T ) = 3 = dim ( P 2 ( R )) , T T T is surjective!
Problem 2: Operator Invertibility
Let T : M 2 × 2 ( R ) → M 2 × 2 ( R ) T: M_{2 \times 2}(\mathbb{R}) \to M_{2 \times 2}(\mathbb{R}) T : M 2 × 2 ( R ) → M 2 × 2 ( R ) be defined by T ( X ) = X + X T T(X) = X + X^T T ( X ) = X + X T . Determine whether T T T is an isomorphism.
Solution :
Compute ker ( T ) \ker(T) ker ( T ) : T ( X ) = 0 ⟺ X + X T = 0 ⟺ X T = − X T(X) = 0 \iff X + X^T = 0 \iff X^T = -X T ( X ) = 0 ⟺ X + X T = 0 ⟺ X T = − X .
The kernel is precisely the subspace of 2 × 2 2 \times 2 2 × 2 skew-symmetric matrices: ker ( T ) = { ( 0 b − b 0 ) | b ∈ R } . \ker(T) = \left\{ \begin{pmatrix} 0 & b \\ -b & 0 \end{pmatrix} \;\middle|\; b \in \mathbb{R} \right\}. ker ( T ) = { ( 0 − b b 0 ) b ∈ R } .
Since non-zero skew-symmetric matrices exist (e.g., b = 1 b = 1 b = 1 ), dim ( ker T ) = 1 ≠ 0 \dim(\ker T) = 1 \neq 0 dim ( ker T ) = 1 = 0 .
Because nullity ( T ) = 1 > 0 \operatorname{nullity}(T) = 1 > 0 nullity ( T ) = 1 > 0 , T T T is not injective.
Because M 2 × 2 ( R ) M_{2 \times 2}(\mathbb{R}) M 2 × 2 ( R ) is finite-dimensional, failure of injectivity immediately implies failure of surjectivity. Thus T T T is not an isomorphism.
GRE Exam Traps & Pitfalls
Trap 1: Applying Rank-Nullity to the Codomain Dimension A frequent blunder is setting rank + nullity = dim W \operatorname{rank} + \operatorname{nullity} = \dim W rank + nullity = dim W . The theorem strictly asserts rank ( T ) + nullity ( T ) = dim V \operatorname{rank}(T) + \operatorname{nullity}(T) = \dim V rank ( T ) + nullity ( T ) = dim V (the dimension of the domain ).
Trap 2: Assuming S ∘ T = 0 S \circ T = 0 S ∘ T = 0 Implies S = 0 S = 0 S = 0 or T = 0 T = 0 T = 0 In linear algebra, S ∘ T = 0 S \circ T = 0 S ∘ T = 0 simply means im ( T ) ⊆ ker ( S ) \operatorname{im}(T) \subseteq \ker(S) im ( T ) ⊆ ker ( S ) . Neither operator needs to be the zero operator.
Trap 3: Injectivity Equivalence in Infinite Dimensions On GRE questions involving function spaces ( C [ 0 , 1 ] C[0, 1] C [ 0 , 1 ] or ℓ 2 \ell^2 ℓ 2 ), never assume injectivity implies surjectivity. The shift operators and integration operators provide standard counterexamples.