06-240/Classnotes For Tuesday October 3

06-240/Navigation Panel   # Week of... Notes and Links 1 Sep 11 About, Tue, HW1, Putnam, Thu 2 Sep 18 Tue, HW2, Thu 3 Sep 25 Tue, HW3, Photo, Thu 4 Oct 2 Tue, HW4, Thu 5 Oct 9 Tue, HW5, Thu 6 Oct 16 Why?, Iso, Tue, Thu 7 Oct 23 Term Test, Thu (double) 8 Oct 30 Tue, HW6, Thu 9 Nov 6 Tue, HW7, Thu 10 Nov 13 Tue, HW8, Thu 11 Nov 20 Tue, HW9, Thu 12 Nov 27 Tue, HW10, Thu 13 Dec 4 On the final, Tue, Thu F Dec 11 Final: Dec 13 2-5PM at BN3, Exam Forum Register of Good Deeds Add your name / see who's in! edit the panel

Links to Classnotes

• PDF file by User:Alla: Week 4 Lecture 1 notes
• PDF file by User:Gokmen: Week 4 Lecture 1 notes

---

[math]\displaystyle{ \mbox{Definition}{}_{}^{} }[/math]

[math]\displaystyle{ v\in V \mbox{ is a linear combination of elements in } S\subset V }[/math] [math]\displaystyle{ \mbox{ if }\exists u_1,\ldots,u_n\in S \mbox{ and } a_1,\dots,a_n \in F \mbox{ such that } V=\sum a_i u_i }[/math]

[math]\displaystyle{ \mbox{Example}{}_{}^{} }[/math]

[math]\displaystyle{ \mbox{In }P_3(\mathbb{R})\mbox{,} }[/math] [math]\displaystyle{ v_1^{}=2x^3-2x^2+12-6 \mbox{ is a linear combination of:} }[/math] [math]\displaystyle{ u_1^{}=x^3-2x^2-5x-3\mbox{ and }u_2=3x^3-5x^2-4x-9 }[/math] [math]\displaystyle{ \mbox{but } v_2^{}=3x^3-2x^2+7x+8 \mbox{ is not.} }[/math]

[math]\displaystyle{ \mbox{Why?}{}_{}^{} }[/math]

[math]\displaystyle{ v_1^{}=2x^3-2x^2+12-6=a_1^{}u_1+a_2u_2=a_1(x^3-2x^2-5x-3)+a_2(3x^3-5x^2-4x-9) }[/math] [math]\displaystyle{ v_1^{}=-4u_1+2u_2 }[/math]

[math]\displaystyle{ \mbox{Definition}{}_{}^{} }[/math]

[math]\displaystyle{ \mbox{We say that a subset }S\subset V\mbox{ generates or spans }V \mbox{ if span }S=\lbrace\mbox{ all linear combinations of elements in } S\rbrace=V }[/math]

[math]\displaystyle{ \mbox{Examples}{}_{}^{} }[/math]

[math]\displaystyle{ V=M_{2\times 2}(\mathbb{R}) }[/math]

[math]\displaystyle{ M_1=\begin{pmatrix}1&0\\0&0\end{pmatrix}, M_2=\begin{pmatrix}0&1\\0&0\end{pmatrix}, M_3=\begin{pmatrix}0&0\\1&0\end{pmatrix}, M_4\begin{pmatrix}0&0\\0&1\end{pmatrix} }[/math]

[math]\displaystyle{ N_1=\begin{pmatrix}0&1\\1&1\end{pmatrix}, N_2=\begin{pmatrix}1&0\\1&1\end{pmatrix}, N_3=\begin{pmatrix}1&1\\0&1\end{pmatrix}, N_4\begin{pmatrix}1&1\\1&0\end{pmatrix} }[/math]

[math]\displaystyle{ \mbox{Claims}{}_{}^{} }[/math]

1. [math]\displaystyle{ \lbrace M_1^{},M_2,M_3,M_4\rbrace\mbox{ generates }V }[/math]
2. [math]\displaystyle{ \lbrace N_1^{},N_2,N_3,N_4\rbrace\mbox{ generates }V }[/math]
3. [math]\displaystyle{ \lbrace M_1^{},M_2,M_3\rbrace\mbox{ does not generate }V }[/math]
4. [math]\displaystyle{ \lbrace N_1^{},N_2,N_3\rbrace\mbox{ does not generate }V }[/math]

[math]\displaystyle{ \mbox{Proof of 1}{}_{}^{} }[/math]

[math]\displaystyle{ \mbox{Given any }B=\begin{pmatrix}b_{11}^{}&b_{12}\\b_{21}&b_{22}\end{pmatrix}\mbox{ need to find }a_1,a_2,a_3,a_4\mbox{ such that,} }[/math]

[math]\displaystyle{ \begin{pmatrix}b_{11}^{}&b_{12}\\b_{21}&b_{22}\end{pmatrix}=B=a_1M_1+a_2M_2+a_3M_3+a_4M_4=\begin{pmatrix}a_1&0\\0&0\end{pmatrix} +\begin{pmatrix}0&a_2\\0&0\end{pmatrix} +\begin{pmatrix}0&0\\a_3&0\end{pmatrix} +\begin{pmatrix}0&0\\0&a_4\end{pmatrix} }[/math]

[math]\displaystyle{ =\begin{pmatrix}a_1^{}&a_2\\a_3&a_4\end{pmatrix}\Leftrightarrow \begin{cases}b_{11}=a_1\\b_{12}=a_2\\b_{21}=a_3\\b_{22}=a_4\end{cases} }[/math] [math]\displaystyle{ \mbox{A system of 4 equations with 4 unknowns}{}_{}^{} }[/math]
[math]\displaystyle{ \mbox{Proof of 2}{}_{}^{} }[/math]

[math]\displaystyle{ \begin{pmatrix}b_{11}^{}&b_{12}\\b_{21}&b_{22}\end{pmatrix} =B=a_1N_1+a_2N_2+a_3N_3+a_4N_4= \begin{pmatrix}0&a_1\\a_1&a_1\end{pmatrix} +\begin{pmatrix}a_2&0\\a_2&a_2\end{pmatrix} +\begin{pmatrix}a_3&a_3\\0&a_3\end{pmatrix} +\begin{pmatrix}a_4&a_4\\a_4&0\end{pmatrix} }[/math]

[math]\displaystyle{ =\begin{pmatrix}a_2^{}+a_3+a_4&a_1+a_3+a_4\\a_1+a_2+a_4&a_1+a_2+a_3\end{pmatrix}\Leftrightarrow \begin{cases}b_{11}=a_2+a_3+a_4\\b_{12}=a_1+a_3+a_4\\b_{21}=a_1+a_2+a_4\\b_{22}=a_1+a_2+a_3\end{cases} }[/math]

[math]\displaystyle{ \mbox{Trick}{}_{}^{} }[/math]

[math]\displaystyle{ M_1=\frac{1}{3}\left(N_1+N_2+N_3+N_4\right)-3N_1 }[/math] [math]\displaystyle{ M_2=\frac{1}{3}\left(N_1+N_2+N_3+N_4\right)-3N_2 }[/math] [math]\displaystyle{ M_3=\frac{1}{3}\left(N_1+N_2+N_3+N_4\right)-3N_3 }[/math] [math]\displaystyle{ M_4=\frac{1}{3}\left(N_1+N_2+N_3+N_4\right)-3N_4 }[/math]

[math]\displaystyle{ B=b_{11}^{}M_1+b_{12}M_3+b_{21}M_3+b_{22}M_4 }[/math] [math]\displaystyle{ =b_{11}\left(\frac{1}{3}\left(N_1+N_2+N_3+N_4\right)-3N_1\right)+\ldots }[/math]

[math]\displaystyle{ =\mbox{ a linear combination of }N_1^{},N_2,N_3,N_4 }[/math]

[math]\displaystyle{ \mbox{Proof of 3}{}_{}^{} }[/math]

[math]\displaystyle{ \mbox{Indeed in }a_1^{}M_1+a_2M_2+a_3M_3= \begin{pmatrix}a_1&a_2\\a_3&0\end{pmatrix}\mbox{ lower right corner is always } 0 }[/math]

[math]\displaystyle{ \mbox{for example }\begin{pmatrix}240&157\\e&\pi\end{pmatrix}\mbox{ not in span.} }[/math]

[math]\displaystyle{ \mbox{Proof of 4}{}_{}^{} }[/math]

[math]\displaystyle{ a_1^{}N_1+a_2N_2+a_3N_3=\begin{pmatrix}a_2+a_3&a_1+a_3\\a_1+a_2&a_1+a_2+a_3\end{pmatrix} }[/math]

[math]\displaystyle{ \begin{pmatrix}240&157\\e&\pi\end{pmatrix}\mbox{ is equal? } \begin{cases}240=a_2+a_3\\157=a_1+a_3\\e=a_1+a_2\\\pi=a_1+a_2+a_3\end{cases}\Rightarrow\mbox{No solution} }[/math]

[math]\displaystyle{ \mbox{Motivation}{}_{}^{} }[/math]

[math]\displaystyle{ S\subset V\mbox{ is linearly dependent if it is wasteful,} }[/math] [math]\displaystyle{ \mbox{i.e. if }\exists v\in V\mbox{ such that }\exists a_1^{}\ldots a_n\in F \mbox{ and }u_1^{}\ldots u_2\in S }[/math] [math]\displaystyle{ \mbox{ and }\exists b_1^{}\ldots b_m\in F \mbox{ and }w_1\ldots w_m\in S }[/math]

[math]\displaystyle{ \mbox{so that }\sum_{i=1}^na_iu_i=v=\sum_{i=1}^mb_iw_i }[/math]

[math]\displaystyle{ \sum a_iu_i-\sum b_iw_i=0 }[/math]

[math]\displaystyle{ \mbox{can be represented as }\sum c_iz_i=0 }[/math]

[math]\displaystyle{ \mbox{Definition}{}_{}^{} }[/math]

[math]\displaystyle{ S\subset V\mbox{ is called linearly dependent if you can find } }[/math] [math]\displaystyle{ z_1^{}\ldots z_n\in S\mbox{ different from each other and }c_1^{}\ldots c_n\in F\mbox{ so that not all of which are } 0, }[/math] [math]\displaystyle{ \mbox{so that }\sum c_iz_i=0 \mbox{ otherwise, }S\mbox{ is called linearly independent} }[/math]

[math]\displaystyle{ \mbox{Example 1}{}_{}^{} }[/math]

[math]\displaystyle{ \mbox{In }\mathbb{R}, S= \lbrace\begin{pmatrix}1&2&3\end{pmatrix}, \begin{pmatrix}4&5&6\end{pmatrix}, \begin{pmatrix}7&8&9\end{pmatrix}\rbrace\mbox{ is linearly dependent} }[/math]

[math]\displaystyle{ 1\cdot\begin{pmatrix}1&2&3\end{pmatrix}- 2\cdot\begin{pmatrix}4&5&6\end{pmatrix}+ 1\cdot\begin{pmatrix}7&8&9\end{pmatrix}=0 }[/math]

[math]\displaystyle{ \mbox{Example 2}{}_{}^{} }[/math]

[math]\displaystyle{ \mathbb{R}^n, e_i=\begin{pmatrix}0\\\vdots\\1\\\vdots\\0\end{pmatrix}i^{th}\mbox{ row} }[/math]

[math]\displaystyle{ S=\lbrace e_1^{},\ldots,e_n\rbrace }[/math]

[math]\displaystyle{ \mbox{Claim }S\mbox{ is linearly independent}{}_{}^{} }[/math]

[math]\displaystyle{ \begin{pmatrix}0\\\vdots\\0\end{pmatrix}=0 =\sum_{i=1}^na_ie_i =\begin{pmatrix}a_1\\a_2\\\vdots\\a_n\end{pmatrix}\Rightarrow \begin{matrix}a_1=0\\a_2=0\\\vdots\\a_n=0\end{matrix} }[/math]

[math]\displaystyle{ \mbox{not not all }a_i^{}\mbox{ are }0\Rightarrow \mbox{ not linearly dependent.} }[/math]

[math]\displaystyle{ \mbox{Claim }S\subset V\mbox{ is linearly independent iff whenever }\sum a_iu_i=0 \mbox{ and distinct }u_i\in S\mbox{ then }\forall i\quad a_i=0 }[/math]

[math]\displaystyle{ \mbox{Comments}{}_{}^{} }[/math]

1. [math]\displaystyle{ \emptyset\subset V\mbox{ is linearly independent} }[/math]
2. [math]\displaystyle{ \mbox{Suppose }u\in V,\quad \lbrace u\rbrace\mbox{ the singleton set is linearly independent iff }u_{}^{}\neq 0 }[/math]

[math]\displaystyle{ \lbrace0\rbrace\mbox{ is linearly dependent. example }7\cdot0=0 }[/math]

[math]\displaystyle{ \mbox{if }u\neq0\mbox{ assume }a\cdot u=0\mbox{, and }a\neq0\Rightarrow a_{}^{-1}au=0 \Rightarrow u=0\mbox{ contradiction results, so no such }a\mbox{ exists.} }[/math] [math]\displaystyle{ \mbox{ So}{}_{}^{}\lbrace u\rbrace\mbox{is not linearly dependent, hence it is linearly independent.} }[/math]