Definition · Subspace
A nonempty subset of a vector space is a subspace if it is closed under both operations: for every scalar and ; and for all . The remaining axioms are inherited from for free.
→Shortcut
Taking in C1 shows automatically. So the fastest disproof is: does the set contain the zero vector? If not, done in one line.
Always subspaces
(the zero subspace) and itself — the two trivial subspaces. Also , any span, lines/planes through the origin.
Never subspaces
Anything missing : lines not through the origin, with , sets defined by or .
The null space
Definition · Null space
For an matrix , . It is a subspace of : if then .
Worked example
0/5 stepsFinding a basis for
Determine and write it as a span.
Span
Definition · Span
is the set of all linear combinations . It is always a subspace (Thm 3.2.1). If we call a spanning set for .
Deciding whether is literally the question of whether is consistent, where has the as columns. Span questions are consistency questions in disguise.
Theorem 3.2.2 · Structure of the solution set
If is consistent with a particular solution , then the full solution set is . The solution is unique iff .
This is why the answer to any consistent system looks like 'particular + parameters': the parameters trace out .
Check your work
Row reduction / rank / null space
Exact fraction arithmetic — type entries like 3, -2, or 1/2. One row per line.
| 1 | 2 | -1 | 1 |
| 2 | 4 | -3 | 0 |
| 1 | 2 | 1 | 5 |
| 1 | 2 | 0 | 3 |
| 0 | 0 | 1 | 2 |
| 0 | 0 | 0 | 0 |
rank
2
nullity
2
cols (n)
4
pivot cols
1, 3
Basis for N(A)
| -2 |
| 1 |
| 0 |
| 0 |
| -3 |
| 0 |
| -2 |
| 1 |
Basis for the column space — original columns 1, 3
| 1 |
| 2 |
| 1 |
| -1 |
| -3 |
| 1 |
Enter any matrix to get its null-space basis, rank, and nullity.
Check yourself
Q1
Which subset of is a subspace?
T / F
The solution set of with is a subspace of .
T / F
is always a subspace, even if the are linearly dependent.