A vector space is a set of vectors closed under addition and scalar multiplication. The column space, null space, and row space of a matrix are the key subspaces we work with throughout the course.
Any set of objects satisfying these axioms is a vector space. In this course, we almost always use $\mathbb{R}^m$ (real column vectors with $m$ entries) as our vector space.
The set of all vectors reachable by the map $A : \mathbb{R}^n \to \mathbb{R}^m$. Dimension = rank of $A$. Also called the image or range of $A$. The system $A\vec{x} = \vec{b}$ is consistent if and only if $\vec{b} \in \mathcal{C}(A)$.
The set of all vectors mapped to zero. Dimension = $n - \text{rank}(A)$ (nullity). Found by solving $A\vec{u} = \vec{0}$ using RREF: free variables give basis vectors for the null space.
For any $A \in \mathbb{R}^{m \times n}$: rank + dim(null space) = $n$. This is one of the most fundamental results in linear algebra.
A basis is a linearly independent spanning set. Any vector in the space has a unique representation as a linear combination of basis vectors.
Example: if RREF has pivots in columns 1 and 3, take columns 1 and 3 of the original $A$.
Fundamental orthogonality: the null space $\mathcal{N}(A)$ is orthogonal to the row space of $A$. The left null space of $A$ is orthogonal to the column space of $A$.
An orthogonal matrix $Q$ preserves lengths and angles: $\|Q\vec{v}\| = \|\vec{v}\|$. MATLAB: orth(A) returns orthonormal basis for column space.