Linear Algebra
2.176 min read

Chapter Summary

Chapter 2 built the language of vectors: objects we can add and scale, with rich geometric interpretations. The key concepts form a chain: linear combination → span → independence → basis → dimension.

A basis for a subspace is a minimal spanning set (or equivalently, a maximal independent set). All bases have the same size — the dimension. The span of any collection is always a subspace.

Affine sets are the translated versions of subspaces — they are the shapes of solution sets. Next, we will use this language to study matrices, rank, and nullity as maps between vector spaces.

Formal View

Summary 2.17 — Key Relationships
\begin{align*} \text{Span}(S) &= \text{smallest subspace containing } S \\ \dim(V) &= \text{size of any basis for } V \\ \text{Basis for } V &= \text{independent set that spans } V \\ \text{Affine set} &= \mathbf{p} + V \text{ for some subspace } V \end{align*}

Why This Matters

This chapter's vocabulary is the universal language of linear algebra — everything in Chapters 3 and 4 is stated in these terms.

  • Rank-nullity theorem (Chapter 3) says: dim(input) = dim(null space) + rank
  • Invertible Matrix Theorem (Chapter 4) uses independence and spanning at its core
  • Principal Component Analysis finds an optimal basis for high-dimensional data

Quiz

Question 1

The maximum number of linearly independent vectors in R4\mathbb{R}^4 is:

Common Mistakes

  • Forgetting that span, independence, basis, and dimension are all interconnected — you cannot understand one in isolation.