Linear Algebra Lecture 10

Linear Algebra Lecture 10

1. Four Fundamental Subspaces

---

Four subspaces

Column space $C(A)$
Null space $N(A)$
Row space = All combinations of rows of $A$ = All combinations of $A^T$ = $C(A^T)$
Null space of $A^T$ = the left null space of $A$(左零矩阵) = $N(A^T)$

When $A$ is $m \times n$,
$C(A)$ in $R^m$
$N(A)$ in $R^n$
$C(A^T)$ in $R^n$
$N(A^T)$ in $R^m$

---

basis of A transpose

$A = \begin{bmatrix} 1& 2 & 3 & 1\\ 1 & 1 & 2 & 1 \\ 1& 2& 3&1\end{bmatrix} = \begin{bmatrix} 1& 0 & 1 & 1\\ 0 & 1 & 1 & 0 \\ 0& 0& 0&0\end{bmatrix} = \begin{bmatrix} I & F \\ 0 & 0 \end{bmatrix} = R$

The column space changed after we do row reduction, the column space of R is not the column space of $A$, $C(R) \ne C(A)$, different column spaces.

The row space of $A$ and row space of $R$ are all combinations of these rows, then the basis of $R$ will be a basis for the row space of the original $A$.

For the row space of $A$ or of $R$, a basis is the first $r$(rank) rows of $R$. It’s the best basis. If the columns of the identity matrix are the best basis for $R^n$, the rows of $R$ are the best basis for the row space, best in the sense of being as clean as I can make it.

---

Null space of A transpose

For $N(A^T)$, it has in it vectors, call them $y$, if $A^Ty=0$, then $y$ is in the null space of $A$ transpose.

Take transpose on both side of
$A^Ty = 0 \to y^TA = 0^T$ , then I have a row vector, $y$ transpose, multiplying $A$ and multiplying from the left, that’s why it called the left null space.

Basis of left null space

Simplified $A$ to $R$ should have revealed the left null space too. From $A$ to $R$, took some step, and I’m interested in what were those steps.

Gauss-Jordan, were you tack on the identity matrix, $[ A_{m\times n} I_{m \times m}]$.
And do the reduced row echelon form of this matrix,$rref[ A_{m\times n} I_{m \times m}] \to [ R_{m\times n} E_{m \times m}]$.

$E$ is just going to contain a record of what we did, we did whatever it took to get $A$ to become $R$, and at the same time, we were doing it to the identity matrix.

So we started with the identity matrix, we took all this row reduction amounted to multiplying on the left by some matrix, some series of elementary matrices that altogether gave us one matrix, and that matrix is $E$.

$E[ A_{m\times n} I_{m \times m}] \to [ R_{m\times n} E_{m \times m}]$

$EA=R$

When $A$ was square and invertible, $EA=I$, then $E$ was $A^{-1}$.
Now $A$ is rectangular, it hasn’t got an inverse. Then follow Gauss-Jordan to get $E$

$\begin{bmatrix} 1& 2 & 3 & 1 &1&0&0\\ 1 & 1 & 2 & 1 &0&1&0\\ 1& 2& 3&1&0&0&1\end{bmatrix} = \begin{bmatrix} 1& 0 & 1 & 1&-1&2&0\\ 0 & 1 & 1 & 0&1&-1&0 \\ 0& 0& 0&0&-1&0&1\end{bmatrix}$

$E= \begin{bmatrix} -1&2&0\\ 1&-1&0 \\ -1&0&1\end{bmatrix}$

The dimension of the left null space is supposed to be $m-r$.
There is one combination of those three rows that produces the zero row. If I am looking for the left null space, I am looking for combinations of rows that give the zero row.

---

basis and dimension of four subspaces

Four subspaces	$C(A)$	$N(A)$	$C(A^T)$	$N(A^T)$
Basis	pivot columns	special solutions	first $r$ rows of $R$	last $m-r$ rows of $E$
Dimension	$r$	$n-r$	$r$	$m-r$

The row space and null space are in $R^n$, and their dimensions add to n. The column space and the left null space are in $R^m$, and their dimensions add to m.