线代notes_2: MIT18.06 L6-L10

Column Space Null Space

All linear combinations $c\text{v}+d\text{w}$ are in the space.

Subspace $S$ and $T$:
Intersection $S\cap T$ is a subspace

Column Space

$A=\left[\begin{array}{ccc}1& 1& 2\\ 2& 1& 3\\ 3& 1& 4\\ 4& 1& 5\end{array}\right]$

The column space of A is a subspace of $R^4$.
$C(A)$ is all linear combinations of columns.
$AX=b$ not have a solution for every $b$.
But for some right hand side, we can solve it, exactly when $b$ is in the column space.

Null Space

Null space of A: contains all solutions $X$ to the equation $AX=0$
In this example, the null space is a subspace of $R^3$.

Lecture 7: Pivot Variables-Free Variables

$A=\left[\begin{array}{cccc}1& 2& 2& 2\\ 2& 4& 6& 8\\ 3& 6& 8& 10\end{array}\right]$

$->\left[\begin{array}{cccc}1& 2& 2& 2\\ 0& 0& 2& 4\\ 0& 0& 0& 0\end{array}\right]->echelonform$
2 pivot columns
2 free columns

$$\begin{array}{r}{x}_1+2x_2+2x_3+2x_4=0\\ 2x_3+4x_4=0\end{array}$$
free variables: $x_2,x_4$
$\left[\begin{array}{c}-2\\ 1\\ 0\\ 0\end{array}\right]\left[\begin{array}{c}2\\ 0\\ -2\\ 1\end{array}\right]$

So the solution is:
$X=c\left[\begin{array}{c}-2\\ 1\\ 0\\ 0\end{array}\right]+d\left[\begin{array}{c}2\\ 0\\ -2\\ 1\end{array}\right]$

Rank: the number of the pivot variables

$n-r=4-2$: number of free variables

$R=reducedrowechelonform$
$\left[\begin{array}{cccc}1& 2& 2& 2\\ 0& 0& 2& 4\\ 0& 0& 0& 0\end{array}\right]->\left[\begin{array}{cccc}1& 2& 0& -2\\ 0& 0& 1& 2\\ 0& 0& 0& 0\end{array}\right]=R$

Lecture 8: AX=b

Sovability condition on b

$AX=b$ solvable when $b$ is in C(A)
If a combination of rows of $A$ gives zero row, the same combination of $b$ must give 0.

Find complete solution to $AX=b$

1. $x_{particular}$: set all free variables to zero. Solve $AX=b$ for pivot variables
2. $x_{nullspace}$:

$x=x_p+x_n$

Full column rank

$r=n$
No free variables
N ( A ) = { z e r o   v e c t o r } N(A) = \{zero \ vector\} N(A)={zero vector}
$X=x_p$
unique solution if it exists

Full row rank

$r=m$
Can solve $AX=b$ for every $b$
Left with $n-r$ free variables

Conclusion

$r=m=n$:
$R=I$
1 solution for $AX=b$

$r=n<m$:
$R=\left[\begin{array}{c}I\\ 0\end{array}\right]$
0 or 1 solution

$r=m<n$:
$R=\left[\begin{array}{cc}I& F\end{array}\right]$
$\infty$ solutions

$r<m,r<n$:
$R=\left[\begin{array}{cc}I& F\\ 0& 0\end{array}\right]$
0 or $\infty$ solutions

Lecture 9: Linear Independence

Linear independence

Vectors $x_1,x_2,\dots ,x_n$ are independent if no combination gives zero vector (except the zero combination)

$$c_1{x}_1+c_2{x}_x+\cdots +c_n{x}_n\ne 0(c_i\ne 0)$$

Span a space

vectors: $v_1,\dots ,v_l$ span a space means the space consists of all combinations of those vectors

Basis

Basis for a space is a sequence of vectors with 2 properties:

1. They are independent
2. They span the space

E.g: Space is $R^3$
One basis is :
$\left[\begin{array}{c}1\\ 0\\ 0\end{array}\right]\left[\begin{array}{c}0\\ 1\\ 0\end{array}\right]\left[\begin{array}{c}0\\ 0\\ 1\end{array}\right]$

Another basis:
$\left[\begin{array}{c}1\\ 1\\ 2\end{array}\right]\left[\begin{array}{c}2\\ 2\\ 5\end{array}\right]\left[\begin{array}{c}0\\ 4\\ \pi \end{array}\right]$

Dimension

Every basis for the space has the same number of vectors. This number is called the dimension

rank($A$) = # pivot columns = dimension of C($A$)

$dimN(A)=$ # free variables

Lecture 10

4 Subspaces

column space $C(A)$
nullspace $N(A)$
rowspace = all combinations of the columns of $A^T$ = $C(A^T)$
nullspace $N(A^T)$ = the left nullspace of $A$

$C(A)$ is in $R^m$
$N(A)$ is in $R^n$
$C(A^T)$ is in $R^n$
$N(A^T)$ is in $R^m$