This sheet introduces vector spaces and linear transformations—the fundamental structures underlying matrix theory and many parts of advanced algebra. Vector spaces provide the language for discussing linear equations, eigenvalues, and canonical forms. Linear transformations are the structure-preserving maps between vector spaces.
Commentary. A vector space is an abstraction of Euclidean space . The key idea is that we can add vectors and multiply them by scalars (elements of a field). Linear transformations preserve these operations. This framework is essential for understanding matrices, linear systems, and the structural results (rational and Jordan canonical forms) that follow.
Prerequisites. This sheet uses the following results from earlier sheets:
- Fields (Sheet 7, Definition 7.42)
- Rings, fields as commutative rings with unity (Sheet 7)
- Groups and abelian groups (Sheet 1)
Fields and Scalars#
Definition 9.5.1. A field is a commutative ring with unity in which every nonzero element has a multiplicative inverse.
Remark. We will use to denote an arbitrary field. The elements of are called scalars.
Example 9.5.2. , , , and (for prime ) are fields.
Vector Spaces#
Definition 9.5.3. Let be a field. A vector space over (or -vector space) is a set together with two operations:
- Vector addition: , denoted
- Scalar multiplication: , denoted
such that for all and :
- is an abelian group.
- (distributivity over vector addition)
- (distributivity over scalar addition)
- (associativity of scalar multiplication)
- (identity for scalar multiplication)
The elements of are called vectors. The additive identity of is denoted (or simply ).
Example 9.5.4. is a vector space over with component-wise addition and scalar multiplication.
Example 9.5.5. is a vector space over for any field .
Example 9.5.6. The set of all polynomials is a vector space over .
Example 9.5.7. The set of all matrices over , denoted , is a vector space over .
Exercise 9.5.8. Verify that satisfies all vector space axioms.
Exercise 9.5.9. Show that is a vector space over any field .
Subspaces#
Definition 9.5.10. A subspace of a vector space over is a nonempty subset that is itself a vector space over with the induced operations.
Theorem 9.5.11 (Subspace Criterion). A nonempty subset is a subspace iff for all and :
Example 9.5.12. The set is a subspace of .
Example 9.5.13. The set of polynomials of degree is a subspace of .
Exercise 9.5.14. Prove Theorem 9.5.11.
Exercise 9.5.15. Show that the intersection of any collection of subspaces of is a subspace.
Linear Combinations, Span, and Linear Independence#
Definition 9.5.16. Let . A linear combination of these vectors is an expression:
Definition 9.5.17. The span of a set is the set of all finite linear combinations of vectors in :If , we say spans (or generates ).
Definition 9.5.18. A set of vectors is linearly independent if:Otherwise, it is linearly dependent.
Example 9.5.19. In , is linearly independent and spans .
Example 9.5.20. In , is linearly dependent (since ).
Exercise 9.5.21. Determine whether the following sets are linearly independent:
(a) in
(b) in
(c) in
Exercise 9.5.22. Prove that a set containing the zero vector is linearly dependent.
Exercise 9.5.23. Prove that is a subspace of .
Bases and Dimension#
Definition 9.5.24. A basis of a vector space is a linearly independent set that spans .
Theorem 9.5.25 (Existence of Basis). Every vector space has a basis. In particular, every finite-dimensional vector space has a finite basis.
Theorem 9.5.26 (Replacement Theorem). If is a basis of , then any linearly independent set has at most elements, and any spanning set has at least elements.
Corollary 9.5.27. Any two bases of a finite-dimensional vector space have the same number of elements.
Definition 9.5.28. The dimension of a finite-dimensional vector space over , denoted , is the number of elements in any basis.
Example 9.5.30. is infinite.
Example 9.5.31. (basis ).
Exercise 9.5.32. Find a basis for the subspace .
Exercise 9.5.33. Show that .
Exercise 9.5.34. Prove the Replacement Theorem.
Linear Transformations#
Definition 9.5.35. Let be vector spaces over the same field . A function is a linear transformation (or linear map) if for all and :
Definition 9.5.36. The kernel (or null space) of is:The image (or range) of is:
Theorem 9.5.37. is a subspace of , and is a subspace of .
Theorem 9.5.38 (Dimension Theorem). If is finite-dimensional and is linear, then:
Definition 9.5.39. A linear transformation is:
- injective if
- surjective if
- bijective (or an isomorphism) if both injective and surjective
Example 9.5.40. The map defined by has and .
Exercise 9.5.41. Show that the map given by (derivative) is linear.
Exercise 9.5.42. Prove Theorem 9.5.37.
Exercise 9.5.43. Prove the Dimension Theorem.
The Matrix of a Linear Transformation#
Definition 9.5.44. Let be an -dimensional vector space over with basis . The coordinate vector of is:
Definition 9.5.45. Let be linear, with bases of and of . The matrix of with respect to and , denoted , is the matrix whose -th column is .
Theorem 9.5.46. For all :
Theorem 9.5.47. The map defined by (with respect to a fixed basis ) is a ring isomorphism. In particular, composition of linear transformations corresponds to matrix multiplication.
Example 9.5.48. Let be . With the standard basis , we have:
Exercise 9.5.49. Let be . Find the matrix of with respect to the standard basis.
Exercise 9.5.50. Prove Theorem 9.5.46.
Change of Basis and Similarity#
Definition 9.5.51. Let and be two bases of . The change-of-basis matrix from to , denoted , is the matrix whose columns are for each .
Theorem 9.5.52. For any vector :
Theorem 9.5.53. If is a linear transformation, and are two bases of , then:where .
Definition 9.5.54. Two matrices are similar if for some invertible .
Corollary 9.5.55. Similar matrices represent the same linear transformation in different bases.
Exercise 9.5.56. Let be . Find the matrix of in the standard basis and in the basis . Show they are similar.
Exercise 9.5.57. Prove Theorem 9.5.53.
Direct Sums#
Definition 9.5.58. Let be subspaces of . Their sum is:
Definition 9.5.59. The sum is a direct sum, denoted , if every vector can be written uniquely as with .
Theorem 9.5.60. iff:
- , and
- for each .
Theorem 9.5.61. If , then:
Exercise 9.5.63. Let and . Show that .
Exercise 9.5.64. Prove Theorem 9.5.60.
Invariant Subspaces#
Definition 9.5.65. Let be a linear transformation. A subspace is -invariant if .
Theorem 9.5.66. If is -invariant, then the restriction is a linear transformation.
Theorem 9.5.67. If is a direct sum of -invariant subspaces, then the matrix of with respect to a basis adapted to this decomposition is block diagonal.
Example 9.5.68. For with , the -axis and -axis are invariant subspaces.
Exercise 9.5.69. Show that and are -invariant subspaces.
Exercise 9.5.70. Let be diagonalizable. Show that each eigenspace is -invariant.
Determinants (Review of Properties)#
Definition 9.5.71. Let . The determinant of , denoted , is a scalar in characterized by the following properties:
- Multilinearity: is linear in each row.
- Alternating: If two rows are swapped, changes sign.
- Normalization: .
Theorem 9.5.72. For all :
Theorem 9.5.73. is invertible iff .
Theorem 9.5.74. For any and scalar :
Example 9.5.75. For , .
Exercise 9.5.76. Compute .
Exercise 9.5.77. Show that .
Summary#
We have introduced:
- Vector spaces over a field
- Subspaces
- Linear combinations, span, linear independence
- Bases and dimension
- Linear transformations and the Dimension Theorem
- Matrices of linear transformations
- Change of basis and similarity
- Direct sums
- Invariant subspaces
- Determinants (properties)