Unless otherwise stated, is a field and every space in a dimension formula is finite-dimensional.
1. Why vectors need not be columns
A vector space is a set with addition and scalar multiplication satisfying the usual abelian-group and distributive axioms over a field . Columns are one model. Polynomials of degree at most , denoted , and linear maps between spaces are others. The zero polynomial is included in although its degree is not ordinarily defined.
A subspace contains zero and is closed under sums and scalar multiples. A list spans if every vector is a linear combination of its entries; it is independent if only the zero coefficients give zero. A basis is both. A finite spanning list can be reduced to a basis by deleting dependent entries; an independent list can be extended to a basis by adding vectors outside its span until the given finite spanning list is spanned.
Exchange lemma. An independent list of vectors in the span of vectors has . To see this, express the first independent vector in the spanning list, use a nonzero coefficient to replace one spanning vector by it, and repeat. At each stage independence ensures the next independent vector has a nonzero coefficient on an as-yet unreplaced spanning vector. There must be at least such slots. Comparing two bases in both directions proves that their lengths agree; this common length is .
Consequently, in dimension , any independent vectors form a basis, as do any spanning vectors. Counting a list is useful only after its independence or spanning has been justified.
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.
2. Linear maps and dimension bookkeeping
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.
A basis identifies with through its coordinate isomorphism. For bases , the matrix has columns . For an endomorphism, changing basis by gives
This is similarity, with the same basis change in domain and codomain. Independent changes of domain and codomain for a general map produce , a different equivalence problem.
3. Quotients make an ignored subspace into zero
For a subspace , define when . This is an equivalence relation. Its classes are cosets , and the quotient has operations
These are well-defined because changing representatives adds elements of . The projection is linear and surjective, with kernel . If is an extended basis as above, then form a quotient basis, proving
A quotient is a space of equivalence classes, not a chosen complementary subspace, though any chosen complement maps isomorphically to it.
Factorization theorem. A linear map descends to a map satisfying exactly when . In that case is well-defined and unique. For , this map is injective onto , giving the first isomorphism theorem
The formula itself proves all assertions: representatives differ by a vector killed by , and a quotient class maps to zero exactly when its representative lies in the kernel.
Worked example. On let with the formal polynomial derivative, and first assume has characteristic zero. Its kernel is the constants and its image is . Thus , with quotient basis mapping to . In characteristic two, however, : the kernel is and the image consists of constants. The general theorem remains true; the characteristic-zero computation does not.
4. The dual space and coordinate-free transpose
The dual consists of linear functions . For a basis , its dual basis is defined by . Every functional is uniquely , so .
The dual map of is , defined by . In dual bases its matrix is the ordinary transpose , including over . There is no complex conjugation: this is algebraic duality, not a Hermitian adjoint. Composition reverses:
This follows by evaluating either side on an arbitrary functional and vector.
For , its annihilator is
An adapted basis shows . The quotient's dual identifies naturally with the annihilator: is an isomorphism , because precisely the functionals killing descend through the quotient.
For a linear map,
The first equality is immediate by evaluation. For the second, inclusion follows because whenever . To prove the reverse inclusion, if kills , define a functional on by ; it is well-defined, and basis extension extends it to all of . This extended satisfies . Taking dimensions gives equality of row rank and column rank without choosing a row-reduction algorithm.
Finally the evaluation map , , is injective because a nonzero vector can be included in a basis and detected by its first dual functional. Equal finite dimensions make it an isomorphism. This identification is canonical. An isomorphism generally requires a chosen basis or a nondegenerate bilinear form and is not canonical in the same way.
5. Exercises
P01 — Foundation. In , find the dimension and a complement of .
P02 — Core. For , , find its kernel, image and quotient-space isomorphism.
P03 — Core. For , find .
P04 — Core. Given in , write its dual basis as row functionals in standard coordinates.
P05 — Diagnosis. Let and . Does descend to ? Explain using representatives.
P06 — Proof. Prove that is surjective exactly when is injective, for finite-dimensional spaces.
P07 — Proof. Prove that .
P08 — Extension. Let shift a sequence right by inserting zero at its first coordinate. Show that is injective but not surjective. What hypothesis of the finite-dimensional equivalence is absent?
P09 — Core. For formal differentiation on in characteristic two, give a quotient basis for and its image under the first isomorphism theorem.
6. Full solutions
P01. The linear condition solves , so is a basis and . The vector does not satisfy the condition, so . This works over any field, since .
P02. The equations give , , so the kernel is . The images of are the two standard vectors in , so the image is all of . The induced isomorphism is ; it is well-defined and bijective by §3.
P03. A functional has form . Vanishing on the two spanning vectors requires and . Thus as a space of functionals.
P04. If , then and . Thus and . They evaluate to the required Kronecker deltas on .
P05. No. Zero and represent the same quotient class, but and . Equivalently is not contained in .
P06. If is onto, . Conversely if its image is a proper subspace, extend a basis of that image to a basis of ; a nonzero dual functional supported on an added basis vector kills the image. It belongs to , contradicting injectivity.
P07. Inclusion of follows by definition. If , extend a basis of by and then to a basis of . The functional taking value one at and zero on all other adapted basis vectors lies in but does not kill . Thus no vector outside belongs to the displayed set.
P08. If is zero, every is zero, so it is injective. No sequence whose first coordinate is one is in its image, so it is not surjective. The space is infinite-dimensional; equal domain and codomain alone do not restore the finite-dimensional implication.
P09. The kernel is , so a quotient basis is . Its image is the constant polynomial one, a basis of the one-dimensional image. Rank one plus nullity two equals dimension three.
7. Summary
Bases justify dimension; rank–nullity tracks information lost by a map. Quotients forget precisely a specified subspace, and their well-defined maps are controlled by kernels. Duality turns subspaces into annihilators and reverses arrows, with ordinary transpose rather than Hermitian adjoint. Polynomial operators in the next chapter add a second algebraic structure to this picture.
Product-space supplement
Let be a field. All vector spaces in one product use this same field. A dimension formula below assumes the displayed factors are finite-dimensional; the definition of a product does not require this assumption. Write for the space of all sequences indexed by the positive integers, not just the finitely supported ones.
Finite products: structure, coordinates and a universal property
Definition. For an integer and vector spaces over , their external product is
with componentwise addition and scalar multiplication. The zero vector is the tuple of zeros. Each vector-space axiom holds in every coordinate because it holds in the corresponding factor, so the product is a vector space over .
The projection sends a tuple to its th coordinate. The injection puts its input in coordinate and zero elsewhere. Both maps are linear, as can be checked in each coordinate. The projection is surjective; the injection is injective. Moreover,
Consequently the product is the internal direct sum of the subspaces . For finite families the external product and external direct sum have the same underlying tuples and operations. This finite-family statement must not be transferred to an infinite family without a finite-support condition.
Universal property. Given a vector space and linear maps , there is exactly one linear map such that for every .
Proof. Define . Each coordinate of equals the corresponding coordinate of , so is linear. Its projections have the required values. Any other map with these projections has exactly the same coordinates at each , hence is equal to . No choice of bases or finite-dimensionality is needed. ∎
Finite-dimensional basis theorem. If is a basis of , the concatenated list of all , in any fixed factor order and basis order, is a basis of the product. In particular,
Proof. Expand every coordinate of a tuple in its factor basis and use the displayed finite decomposition to obtain spanning. For independence, apply to a zero linear combination of the concatenated list. This leaves a zero linear combination of , whose coefficients are all zero. Repeating for every makes every coefficient zero. Thus the list is a basis, of the stated length. A zero-dimensional factor contributes an empty list and causes no exception. ∎
Worked example. For , let denote the vector space of formal polynomials of degree at most one together with the zero polynomial, not a space of polynomial functions. A basis is
Hence . The second projection has image and kernel , of dimensions two and two respectively. The ordered pair in each displayed vector separates the coordinate from the polynomial coordinate; a polynomial is not being identified with a single field scalar.
Infinite products are not finite-support direct sums
The product contains every sequence with entries in , using componentwise operations. Its finite-support subspace is
It is a subspace: the support of a sum is contained in the union of two finite supports, and scalar multiplication does not create a new nonzero coordinate outside the old support.
Let be the sequence with a one in coordinate and zeros elsewhere. The list is independent: in any finite zero linear combination, coordinate projection recovers each coefficient as zero. Its span is exactly , because a linear combination is finite by definition, while every finitely supported sequence is such a combination. The sequence belongs to the product but not that span. Thus the form a basis of the direct sum, not a basis of the full product. This conclusion does not assert a dimension for the full product or permit an infinite linear sum without a separate meaning of convergence.
The product universal property still holds for infinitely many coordinate maps: define the output tuple coordinatewise and check linearity and uniqueness coordinatewise. The finite formula expressing each tuple as a sum of its coordinate injections no longer holds algebraically for a tuple of infinite support.
Exercises
P01. For , verify the displayed basis directly. Find the kernel and image of the first projection, and verify rank–nullity.
P02. Let and be linear maps, and put . Prove . If is finite-dimensional, deduce a formula for . Explain, with an example, why need not equal .
P03. In , prove that the constant-one sequence is outside the span of the coordinate vectors . Prove that deleting the first coordinate is a surjective but noninjective linear map on . Which finite-dimensional hypothesis prevents a contradiction with the injectivity–surjectivity equivalence?
Full solutions
P01. Every element has form and has the unique expansion with coefficients in the displayed four vectors. Uniqueness follows first by the two coordinates in , then by equality of polynomial coefficients. The first projection has image and kernel . Both have dimension two. Thus rank plus nullity is , the dimension of the domain.
P02. A product tuple is zero exactly when both its coordinates are zero. Therefore exactly when and , proving the kernel identity. Rank–nullity gives
Take and . Each component map has rank one, but has the one-dimensional diagonal as its image. Its rank is one, not two. The two recorded outputs can carry dependent information.
P03. Any linear combination of coordinate vectors uses finitely many indices. Choose a positive integer outside those indices. That coordinate of the combination is zero, but the same coordinate of the constant-one sequence is one, which is nonzero in a field. Thus the sequence is outside the span. The deletion map is . It is linear coordinatewise. Any target is the image of , so it is surjective; with , so it is not injective. The domain and codomain here are infinite-dimensional: the infinite independent coordinate list shows this. The injectivity–surjectivity equivalence requires equal finite dimensions, not merely the same domain and codomain.