Unless otherwise stated, is a field and every space in a dimension formula is finite-dimensional.
We take to be a field and vector spaces to be finite-dimensional unless otherwise stated. The familiar space of column vectors is one model of a vector space, but not the only one: polynomials, matrices and functions can also be vectors. The task is to use their operations, not their appearance.
Definition
Subspaces and direct sums
A nonempty subset of a vector space is a subspace if for all and . For subspaces , their sum is . It is a direct sum, written , if every element has a unique such decomposition; equivalently .
The equivalence follows by subtracting two decompositions; conversely, a nonzero vector in the intersection has two decompositions. If bases of and are concatenated, they span the sum. The concatenated list is linearly independent exactly when the sum is direct.
For subspaces , their sum is . It is a direct sum, written , precisely when , equivalently each vector in the sum has a unique decomposition. Extend a basis of separately to bases of and ; the combined extended list gives
To check independence, move the and combinations to opposite sides: the common vector lies in the intersection, so the extra basis coefficients vanish, then the intersection coefficients vanish. Every subspace of a finite-dimensional space has a complement by basis extension, but the complement is usually not unique or canonical.
Definition
Kernel and image
A map is linear if . Its kernel is and its image is . Both are subspaces. The map is injective exactly when , and surjective exactly when .
A map is linear if . Its kernel and image are subspaces. Choose a basis of and extend to a basis with . Then form a basis of : spanning follows by expanding any input; a dependence among these images places the corresponding input combination in the kernel, and independence of the extended basis makes all coefficients zero. Thus
This is rank–nullity. In equal finite dimensions, injectivity and surjectivity are equivalent, but the equivalence can fail in infinite-dimensional spaces.
Worked example
Differentiation on polynomials
Let be the real polynomials of degree at most two and be differentiation. For , . Thus and . Their dimensions agree with rank–nullity. is neither injective nor surjective as a map into .
Choosing a method and avoiding mistakes
Use the subspace test to prove closure, a basis to prove dimension, and rank–nullity when a kernel or image is easier than the other. For uniqueness of decompositions use the intersection; a sum is not automatically direct. Do not equate with the zero vector or image with the codomain without proof. Injectivity and surjectivity are equivalent for an endomorphism of a finite-dimensional space, not for arbitrary domain and codomain dimensions.
Exercises
- In , let and . Find and .
- Let send to . Find a basis of its kernel and decide whether it is onto.
- Prove that if is linear and is finite-dimensional, injectivity implies surjectivity.
Full solutions
- A polynomial in both spans has no constant or quadratic term, so . The sum is , of dimension .
- For , the two conditions are and . Hence and the kernel basis is . Rank–nullity gives image dimension , so the image is all of .
- Injectivity gives zero kernel. Rank–nullity yields . A subspace of a finite-dimensional space with the same dimension equals the space, so is onto.
Connection
Choosing bases turns these structural statements into matrix statements. The kernel and image dimensions do not depend on those choices.