Vector spaces are the basic setting for linear algebra, where vectors can be added and scaled in a consistent way. This cheat sheet helps students recognize vector spaces, test subspaces, and understand how vectors generate larger sets. It is useful for organizing definitions, theorem statements, and common proof patterns in one printable reference.
The most important ideas are span, linear independence, basis, dimension, and linear transformations. A set spans a space when every vector in the space can be written as a linear combination of the set. A basis is both spanning and linearly independent, so every vector has a unique coordinate representation.
Rank-nullity connects the image and kernel of a linear map through .
Key Facts
- A vector space over a field is closed under vector addition and scalar multiplication and satisfies the standard addition, scalar, identity, and inverse axioms.
- A nonempty subset is a subspace if for all and , and .
- The span of vectors is .
- Vectors are linearly independent if implies .
- Vectors are linearly dependent if there is a nontrivial solution to .
- A basis for is a linearly independent set that spans , and every vector has a unique form .
- The dimension of a finite-dimensional vector space is the number of vectors in any basis, written .
- For a linear transformation , the rank-nullity theorem is .
Vocabulary
- Vector Space
- A set with vector addition and scalar multiplication that satisfies the vector space axioms over a field .
- Subspace
- A subset of a vector space that is itself a vector space under the same operations.
- Span
- The set of all linear combinations of given vectors, written .
- Linear Independence
- A property of vectors where the only solution to is the trivial solution .
- Basis
- A set of vectors that spans a vector space and is linearly independent.
- Dimension
- The number of vectors in any basis of a finite-dimensional vector space.
Common Mistakes to Avoid
- Forgetting to check the zero vector in a subspace test is wrong because every subspace must contain as a consequence of closure under scalar multiplication.
- Testing linear independence by checking only whether vectors are nonzero is wrong because nonzero vectors can still satisfy a nontrivial equation such as .
- Assuming a spanning set is automatically a basis is wrong because a basis must also be linearly independent.
- Confusing rank and nullity is wrong because measures the dimension of the image while measures the dimension of the kernel.
- Using row operations on column vectors without preserving the correct matrix interpretation is wrong because linear dependence of columns is determined by solving .
Practice Questions
- 1 Determine whether the vectors , , and in are linearly independent.
- 2 Find a basis and the dimension of the subspace .
- 3 For a linear map with , find .
- 4 Explain why a set of four vectors in cannot be linearly independent, even if none of the vectors is the zero vector.