Linear Algebra (1): Ax = b
Linear algebra starts from one equation, Ax = b.
flowchart TD A["Ax = b"] --> B["Vector Space"] B --> C["Subspace"] C --> D["Linear Combination"] D --> E["Span"] E --> F["Column Space"] E --> G["Null Space"] F --> H["Linear Independence"] G --> H H --> I["Basis and Dimension"] I --> J["Rank–Nullity Theorem"] J --> K["Solutions of Ax = b"]
Ax = b
Setup. A system of
is the coefficient matrix, is the vector of unknowns, is the right-hand side.
Definitions.
- Augmented matrix:
. - Consistent: the system has at least one solution. Otherwise it is inconsistent.
- Row echelon form (REF): every zero row is at the bottom, and the leading (first non-zero) entry of each row lies to the right of the leading entry of the row above it.
- Pivot: a leading entry of REF. A pivot column is a column that contains a pivot.
- Basic variable: a variable whose column is a pivot column. Free variable: a variable whose column is not.
Questions. Does a solution exist? Is it unique? What do all the solutions look like? The boxes below build the tools; the last box answers them.
Vector Space
Definition. A vector space is a set
Addition
- Closure:
- Commutativity:
- Associativity:
- Zero vector: there is a
with - Additive inverse: each
has a with
Scalar multiplication
- Closure:
- Distributivity over vectors:
- Distributivity over scalars:
- Associativity:
- Identity:
Examples.
| Space | Elements |
|---|---|
| columns of | |
| polynomials of degree at most | |
| continuous functions on |
Subspace
Definition. A subspace of
Subspace test.
- Zero vector:
- Closure under addition:
- Closure under scalar multiplication:
The other axioms are inherited from
Non-example.
Linear Combination
Definition. A linear combination of
The scalars
Span
Definition. The span of
Properties.
-
is always a subspace of . -
If
spans , then so does
Column Space
Definition. For
Remark.
Theorem.
Null Space
Definition. For
Properties.
is a subspace of . - If
is one solution of , then every solution has the form with .
Linear Independence
Definition.
Otherwise it is linearly dependent: some non-trivial combination gives
No redundancy: the only combination that gives
Theorem. For
- the columns of
are linearly independent; ; has only the trivial solution.
Example. If
Since
Basis and Dimension
Definition. A basis of
- is linearly independent, and
- spans
.
Theorem. If
Definition. The dimension of
Definition. The row space of
Finding a basis.
| Space | Basis |
|---|---|
| the pivot columns of the original | |
| one vector per free variable, from the solution of | |
| the non-zero rows of REF |
Example.
The three matrices form a basis, so
Rank–Nullity Theorem
Definitions. For
= number of pivots = number of free variables
Theorem (Rank–Nullity).
Equivalently: number of pivots + number of free variables = number of columns = number of unknowns.
Solutions of Ax = b
For
| Space | What it answers |
|---|---|
| Existence: a solution exists | |
| If consistent, how many equations are necessary to solve it: | |
| Uniqueness and the form of all solutions: |
| Property | REF | Rank | Space |
|---|---|---|---|
| consistent for every | a pivot in every row | ||
| at most one solution | a pivot in every column, no free variables |
Corollary.