Sign in to save

Bookmark this page so you can find it later.

Sign in to save

Bookmark this page so you can find it later.

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 dim(V)=rank(T)+nullity(T)\dim(V) = \operatorname{rank}(T) + \operatorname{nullity}(T).

Key Facts

  • A vector space VV over a field F\mathbb{F} is closed under vector addition and scalar multiplication and satisfies the standard addition, scalar, identity, and inverse axioms.
  • A nonempty subset WVW \subseteq V is a subspace if for all u,vWu,v \in W and cFc \in \mathbb{F}, u+vWu+v \in W and cuWcu \in W.
  • The span of vectors v1,,vkv_1,\dots,v_k is span{v1,,vk}={c1v1++ckvk:ciF}\operatorname{span}\{v_1,\dots,v_k\}=\{c_1v_1+\cdots+c_kv_k: c_i \in \mathbb{F}\}.
  • Vectors v1,,vkv_1,\dots,v_k are linearly independent if c1v1++ckvk=0c_1v_1+\cdots+c_kv_k=0 implies c1==ck=0c_1=\cdots=c_k=0.
  • Vectors v1,,vkv_1,\dots,v_k are linearly dependent if there is a nontrivial solution to c1v1++ckvk=0c_1v_1+\cdots+c_kv_k=0.
  • A basis for VV is a linearly independent set that spans VV, and every vector vVv \in V has a unique form v=c1b1++cnbnv=c_1b_1+\cdots+c_nb_n.
  • The dimension of a finite-dimensional vector space is the number of vectors in any basis, written dim(V)=n\dim(V)=n.
  • For a linear transformation T:VWT:V\to W, the rank-nullity theorem is dim(V)=rank(T)+nullity(T)\dim(V)=\operatorname{rank}(T)+\operatorname{nullity}(T).

Vocabulary

Vector Space
A set VV with vector addition and scalar multiplication that satisfies the vector space axioms over a field F\mathbb{F}.
Subspace
A subset WW of a vector space VV that is itself a vector space under the same operations.
Span
The set of all linear combinations of given vectors, written span{v1,,vk}\operatorname{span}\{v_1,\dots,v_k\}.
Linear Independence
A property of vectors where the only solution to c1v1++ckvk=0c_1v_1+\cdots+c_kv_k=0 is the trivial solution c1==ck=0c_1=\cdots=c_k=0.
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 00 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 c1v1+c2v2=0c_1v_1+c_2v_2=0.
  • 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 rank(T)\operatorname{rank}(T) measures the dimension of the image while nullity(T)\operatorname{nullity}(T) 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 Ax=0Ax=0.

Practice Questions

  1. 1 Determine whether the vectors (1,2,3)(1,2,3), (2,4,6)(2,4,6), and (0,1,1)(0,1,1) in R3\mathbb{R}^3 are linearly independent.
  2. 2 Find a basis and the dimension of the subspace W={(x,y,z)R3:x+y+z=0}W=\{(x,y,z)\in\mathbb{R}^3: x+y+z=0\}.
  3. 3 For a linear map T:R5R3T:\mathbb{R}^5\to\mathbb{R}^3 with rank(T)=2\operatorname{rank}(T)=2, find nullity(T)\operatorname{nullity}(T).
  4. 4 Explain why a set of four vectors in R3\mathbb{R}^3 cannot be linearly independent, even if none of the vectors is the zero vector.