Difference between revisions of "Section 1.12 Homework"
Jump to navigation
Jump to search
(Created page with "'''8.''' Let <math>L: V \to W</math> be a linear map.<br /> <br /> (b) Show that if <math>x_1,x_2,...,x_k</math> are linearly dependent, then <math>L(x_1),L(x_2),...,L(x_k)</m...") |
|||
Line 3: | Line 3: | ||
(b) Show that if <math>x_1,x_2,...,x_k</math> are linearly dependent, then <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly dependent.<br /> | (b) Show that if <math>x_1,x_2,...,x_k</math> are linearly dependent, then <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly dependent.<br /> | ||
<br /> | <br /> | ||
− | + | {| class="mw-collapsible mw-collapsed" style = "text-align:left;" | |
+ | !Proof: | ||
+ | |- | ||
+ | |Suppose that <math>x_1,x_2,...,x_k</math> are linearly dependent. Then there are scalars <math>c_1,c_2,...,c_k</math>, not all of which are zero that satisfy <math>c_1 x_1 + c_2 x_2 + \cdots +c_k x_k = 0</math>. Now recall that for any linear transformation <math>L(0) = 0</math>. So then <math>L(c_1 x_1 + \cdots +c_k x_k) = L(0) = 0</math>. But by linearity of <math>L</math> we have <math>L(c_1x_1 + \cdots +c_k x_k) = L(c_1 x_1) + L(c_2 x_2) + \cdots +L(c_k x_k) = c_1 L(x_1) + c_2 L(x_2) + \cdots +c_k L(x_k)</math>. Combining these facts gives that <math>c_1 L(x_1) + \cdots +c_k L(x_k) = 0</math>. In other words, we have a linear combination of <math>L(x_1),L(x_2),...,L(x_k)</math> that gives zero and we know that not all of the <math>c_1,...,c_k</math> are zero. Therefore <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly dependent.<br /> | ||
+ | |} | ||
<br /> | <br /> | ||
(c) Show that if <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent then <math>x_1,x_2,...,x_k</math> are linearly independent.<br /> | (c) Show that if <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent then <math>x_1,x_2,...,x_k</math> are linearly independent.<br /> | ||
<br /> | <br /> | ||
− | Note: This is the contrapositive statement of part (b). Hence since we proved (b), then (c) is also true as contrapositives are logically equivalent. However, we can prove this separately as follows.<br /> | + | {| class="mw-collapsible mw-collapsed" style = "text-align:left;" |
+ | !Proof: | ||
+ | |- | ||
+ | |Note: This is the contrapositive statement of part (b). Hence since we proved (b), then (c) is also true as contrapositives are logically equivalent. However, we can prove this separately as follows.<br /> | ||
<br /> | <br /> | ||
''Proof:'' Suppose that <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent. To show that <math>x_1,x_2,...,x_k</math> are linearly independent we consider any combination <math>c_1 x_1 + c_2 x_2 + \cdots +c_k x_k</math> that gives 0. We want to show that this can only happen if all of <math>c_1,c_2,...,c_k =0</math>. Since <math>c_1 x_1 + c_2 x_2 + \cdots +c_k x_k = 0</math>, then <math>L(c_1 x_1 + \cdots +c_k x_k) = L(0) = 0</math>. As in the proof of part (b) we then have <math>c_1 L(x_1) + c_2 L(x_2) + \cdots +c_k L(x_k) = 0</math>. That is, we have found a linear combination of <math>L(x_1),L(x_2),...,L(x_k)</math> that gives zero. But since <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent, then we must have <math>c_1 = c_2 = \cdots = c_k = 0</math>. Therefore <math>x_1,x_2,...,x_k</math> are linearly independent. | ''Proof:'' Suppose that <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent. To show that <math>x_1,x_2,...,x_k</math> are linearly independent we consider any combination <math>c_1 x_1 + c_2 x_2 + \cdots +c_k x_k</math> that gives 0. We want to show that this can only happen if all of <math>c_1,c_2,...,c_k =0</math>. Since <math>c_1 x_1 + c_2 x_2 + \cdots +c_k x_k = 0</math>, then <math>L(c_1 x_1 + \cdots +c_k x_k) = L(0) = 0</math>. As in the proof of part (b) we then have <math>c_1 L(x_1) + c_2 L(x_2) + \cdots +c_k L(x_k) = 0</math>. That is, we have found a linear combination of <math>L(x_1),L(x_2),...,L(x_k)</math> that gives zero. But since <math>L(x_1),L(x_2),...,L(x_k)</math> are linearly independent, then we must have <math>c_1 = c_2 = \cdots = c_k = 0</math>. Therefore <math>x_1,x_2,...,x_k</math> are linearly independent. | ||
+ | |} |
Latest revision as of 00:06, 16 November 2015
8. Let be a linear map.
(b) Show that if are linearly dependent, then are linearly dependent.
Proof: |
---|
Suppose that are linearly dependent. Then there are scalars , not all of which are zero that satisfy . Now recall that for any linear transformation . So then . But by linearity of we have . Combining these facts gives that . In other words, we have a linear combination of that gives zero and we know that not all of the are zero. Therefore are linearly dependent. |
(c) Show that if are linearly independent then are linearly independent.
Proof: |
---|
Note: This is the contrapositive statement of part (b). Hence since we proved (b), then (c) is also true as contrapositives are logically equivalent. However, we can prove this separately as follows.
|