Recall that a subspace S satisfies 2 properties.
It is always the case that S is the span of a set of vectors because S = span(S). What is the minimal number of vectors required to span S? What is the maximal number of vectors that are linearly indepedent in S? It turns out these numbers are equal and that number is called the dimension.
Definition: A set B = {u1, …, um} is a basis for a subspace S if
In this case, the dimension of S is m. Dimension is an invariant independent on the choice of basis.
The empty set is the basis for the zero subspace {0}. It has dimension 0.
Theorem:
A set B is a basis for S if it is a maximal linearly independent set. This means you can’t add any vectors to B and have it still be linearly independent.
A set B is a basis for S if it is a minimal set that spans S. This means you can’t substract any vectors from B and have it still be spanning.
Example:
Let S be the subspace given by w + x + y + z = 0. What is the dimension? Give 2 3 different basis.
Definition:
The row space of a matrix A is the span of the rows. It is denote row(A).
Theorem:
Let A and B be equivalent matrices. Then the
Proof: The matrix A is equivalent to B if A can be obtained from B using elementary row opeartions. There are 3 such operations. None of them change the span.
Example:
Let S be the subspace spanned by u1 = ( − 1, 2, 3, 1), u2 = ( − 6, 7, 5, 2), u3 = (4, − 3, 1, 0). Find a basis for S. What is the dimension of S?
(just find rref, and use the rows)
Notice we just take the nonzero rows.
Theorem:
Suppose U = [u1 u2 … um] and V = [v1 … vm] be equivalent matrices. Then any relation between the ui exists between the vi. For example,
If 2u1 − u2 = u3 then 2v1 − v2 = v3.
Proof: Relations correspond to solutions to Ux = 0 and Vx = 0. Since they are equivalent, the relations must be the same.
Example:
Let S be the subspace spanned by u1 = ( − 1, 2, 3, 1), u2 = ( − 6, 7, 5, 2), u3 = (4, − 3, 1, 0). Find a basis for S. What is the dimension of S?
(use rref to determine relations between columns)
Notice we only take the columns with leading variables.
Let T : ℝn → ℝm be a linear transform given by T(x) = Ax. Recall that the the range is the span of the columns of A and the kernel is the space of solutions to Ax = 0. The dimension of the range is called the rank of A, the dimension of the kernel is called the nullity.
Do an example of this in class.