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 & Linear Independence Reference cheat sheet - grade college

Click image to open full size

Math Grade college

Vector Spaces & Linear Independence Reference Cheat Sheet

A printable reference covering vector space axioms, subspaces, span, linear independence, bases, dimension, and rank-nullity for college.

TopicsVectorsAlgebraMathematicsStudy Guide
Download PNG

Related Tools

Related Labs

Related Worksheets

Related Infographics

Study as Flashcards

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 W⊆VW \subseteq V is a subspace if for all u,v∈Wu,v \in W and c∈Fc \in \mathbb{F}, u+v∈Wu+v \in W and cu∈Wcu \in W.
  • The span of vectors v1,…,vkv_1,\dots,v_k is span⁡{v1,…,vk}={c1v1+⋯+ckvk:ci∈F}\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 v∈Vv \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:V→WT: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:R5→R3T:\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.

Understanding Vector Spaces & Linear Independence Reference

A useful way to think about a vector space is as a collection of objects for which linear rules make sense. The objects need not be arrows in a picture. They can be lists of numbers, polynomials, functions, matrices, sound signals, or data sets.

What matters is that the chosen operations behave predictably. For example, polynomials of degree at most three form a vector space because adding two such polynomials or multiplying one by a number stays within the same degree limit. By contrast, polynomials of exactly degree three do not form a vector space.

Multiplying one by zero produces the zero polynomial, which does not have degree three. This zero check often reveals why a proposed set fails.

When testing a subspace, first check that the zero vector belongs to the set. Then combine two arbitrary members using arbitrary scalars. This single combination test is often quicker than checking addition and scalar multiplication separately.

Sets described by homogeneous linear equations usually pass the test. For instance, all triples whose coordinates satisfy a linear equation with zero on one side form a subspace. A condition with a nonzero constant usually creates a shifted plane or line that misses the origin, so it is not a subspace.

Students often confuse a geometric shape with a subspace. A plane can be a subspace only when it passes through the origin.

Row reduction turns the abstract ideas of span and independence into a practical procedure. Put the candidate vectors into the columns of a matrix. A pivot in every column shows that no column is built from earlier pivot information, which supports independence.

A column without a pivot signals redundancy. That vector can be removed without changing what the whole list can produce. For a spanning problem, compare the pivot positions with the coordinates or equations of the target space.

In an ordinary space of coordinate vectors, a pivot in every row means the columns can produce every possible target vector. Keep the original columns when identifying useful basis vectors. Row operations change the columns themselves, even though they preserve the locations of pivots.

Coordinates relative to a basis are not merely labels. They compress an object into a list of coefficients. A polynomial can be represented by its coefficients, an image by pixel values, and a physical displacement by components along chosen directions.

Different bases give different coordinate lists for the same object. A change of basis is therefore a controlled translation between descriptions. This matters in computer graphics, engineering, statistics, and quantum physics, where a smart choice of basis can make a complicated problem simpler.

The rank of a transformation measures how many independent output directions remain after the transformation. Its nullity measures how many independent input directions disappear into zero. Their total accounts for every independent direction available at the input.

When solving systems, pay close attention to free variables. They describe the null space and explain why a solution may not be unique.