Topic 2 built an algorithm — elimination — that solves mechanically. This topic steps back and asks the structural question the algorithm's output actually answers: what does the full solution set look like, and what invariant properties does a matrix have regardless of which basis you happen to compute in? The answer is a short, precise vocabulary — vector space, subspace, span, independence, basis, dimension — that every later topic in the unit assumes fluently. It closes on the four fundamental subspaces, the single organising picture Strang calls "the heart of linear algebra": every matrix carries exactly four subspaces attached to it, and nearly every question the rest of the unit asks (is a system solvable? is a map invertible? what are the eigenvectors?) is really a question about one of these four.
By the end of this topic you should be able to:
- verify whether a subset is a subspace using the closure test;
- find the nullspace of a matrix and describe it via free variables;
- write the complete solution to as a particular solution plus a nullspace solution;
- test a set of vectors for linear independence and extract a basis, using the Steinitz exchange lemma to justify that dimension is well defined;
- name the four fundamental subspaces of a matrix, state their dimensions, and read the finance meaning of each.
In this lesson
- Contents
- The big picture
The full lesson is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.