Subspace And All Solutions to Ax=b

Subspace

The Definition Of Subspace

• A subspace of a vector space is a set of vectors (including 0) that satisfied two requirments: if $w$ and $v$ are verctor in the subspace and $c$ is any sclar,then

1. $v+w$ is in the subspace
2. $cv$ in the subspace

• Every subspace must contain the zero vector. for example：

1. The plane in $R^3$ has to go through ( 0, 0, 0)
2. Lines through the origin are also subspace.

The Column Space of $A$

• The Column space consists of all linear combinations of the columns. The combinations are all possible vectors $Ax$. They fill the column space $C(A)$

• The system $Ax=b$ is solvable if and only if b is in the column space of $A$

• Suppose $A$ is a m by n matrix , columns belongs to $R^m$ （每个column 是m个元素）, the column space of $A$ is a subspace of $R^m$

The Row Space of $A$

• Like column space , row space is a linear conbinations of rows，rows belongs to $R^n$（每一行有n个元素）,所以row space 是 $R^n$的subspace

The Null Space of $A$

• There are nonzero solutions to $Ax=0$ , each solution x belongs to the nullspace of A, which is denoted by N($A$) .
  
  
• The solution vector x have n components. they are vectors in $R^n$ , so nullspace is a subspace of $R^n$

• Solving $Ax=0$ by elimination

$$Ax=0->\left[\begin{array}{cccc}1& 1& 2& 3\\ 2& 2& 8& 10\\ 3& 3& 10& 13\end{array}\right]\left[\begin{array}{c}x1\\ x2\\ x3\\ x4\end{array}\right]=\left[\begin{array}{c}0\\ 0\\ 0\\ 0\end{array}\right]$$


Get Triangular U by eliminating A： $$U=\left[\begin{array}{cccc}1& 1& 2& 3\\ 0& 0& 4& 4\\ 0& 0& 0& 0\end{array}\right]$$

The pivot variables are $x1$ and $x3$ : column1 and 3 contains pivots
The free variables are $x2$ and $x4$: column2 and 4 have no pivots

Special solutions:

• set $x2=1,x4=0$ , by back substitution $x3=0$ ,then $x1=-1$
• set $x2=0,x4=1$ , by back substitution $x3=-1$ ,then $x1=-1$

Complete solutions to $Ax=0$：  $x2$ and $x4$ can be any multiplies
$$x=x2\left[\begin{array}{c}-1\\ 1\\ 0\\ 0\end{array}\right]+x4\left[\begin{array}{c}-1\\ 0\\ -1\\ 1\end{array}\right]$$

• With n>m ,there is at least one free variable . The system $Ax=0$ has at least one nonzero solution. the nulllspace dimension is the number of free variables(at least n-m).

The Rank And Reduced Echelon Form R

• The rank of $A$ is the number of pivots ,this number is r

• The rank r is the “dimension” of the column space. It is also the dimension of the row space . The great thing is that r also reveals the dimetion of nullspace(n-r).

• R：the conponents above the pivots are 0 in the pivot columns (column 1 and column 3 )
  $$A=\left[\begin{array}{ccccc}1& 3& 0& 2& -1\\ 0& 0& 1& 4& -3\\ 1& 3& 1& 6& -4\end{array}\right]yieldsR=\left[\begin{array}{ccccc}1& 3& 0& 2& -1\\ 0& 0& 1& 4& -3\\ 0& 0& 0& 0& 0\end{array}\right]$$

The form of R is like :$\left[\begin{array}{cc}I& F\\ 0& 0\end{array}\right]$
Nullspace matrix form is like :$\left[\begin{array}{c}-F\\ I\end{array}\right]$

Nullspace for the A（5-2=3） is：$\left[\begin{array}{ccc}-3& -2& 1\\ 1& 0& 0\\ 0& -4& 3\\ 0& 1& 0\\ 0& 0& 1\end{array}\right]\left[\begin{array}{c}x1notfree\\ x2free\\ x3notfree\\ x4free\\ x5free\end{array}\right]$

---

All solutions to $Ax=b$

Ax=b

$$\left[\begin{array}{cccc}1& 3& 0& 2\\ 0& 0& 1& 4\\ 1& 3& 1& 6\end{array}\right]\left[\begin{array}{c}x1\\ x2\\ x3\\ x4\end{array}\right]=\left[\begin{array}{c}1\\ 6\\ 7\end{array}\right]$$

augmented matrix：
$$[Ab]=\left[\begin{array}{ccccc}1& 3& 0& 2& 1\\ 0& 0& 1& 4& 6\\ 1& 3& 1& 6& 7\end{array}\right]$$

after elimination：
$$\left[\begin{array}{ccccc}1& 3& 0& 2& 1\\ 0& 0& 1& 4& 6\\ 0& 0& 0& 0& 0\end{array}\right]=[Rd]$$

particular solution：set x2=x4=0 then Xp=(1, 0, 6, 0)
the solutions to Ax=0：$$Xn=\left[\begin{array}{cc}-3& -2\\ 1& 0\\ 0& -4\\ 0& 1\end{array}\right]$$

Complete solutions：X=Xp+Xn
$$X=\left[\begin{array}{c}1\\ 0\\ 6\\ 0\end{array}\right]+x2\left[\begin{array}{c}-3\\ 1\\ 0\\ 0\end{array}\right]+x4\left[\begin{array}{c}-2\\ 0\\ -4\\ 1\end{array}\right]$$

four possibilities of solutions depend on rank r

r	A	solutions
r=m and r=n	square and invertible	Ax=b has 1 solution
r=m and r<n	short and wide	Ax=b has $\infty$ solutions
r<m and r=n	tall and thin	Ax=b has 0 or 1 solution
r<m and r<n	not full rank	Ax=b has 0 or $\infty$ solutions