Section 1.12

From Math Wiki
Jump to navigation Jump to search

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.


Proof: Suppose that are linearly independent. To show that are linearly independent we consider any combination that gives 0. We want to show that this can only happen if all of . Since , then . As in the proof of part (b) we then have . That is, we have found a linear combination of that gives zero. But since are linearly independent, then we must have . Therefore are linearly independent.