Difference between revisions of "Section 1.10 Homework"

From Grad Wiki
Jump to navigation Jump to search
(Created page with "'''3.''' Let <math>L: V \to W</math> be a linear map and <math>N \subset W</math> a subspace. Show that: <math>L^{-1}(N) = \{ x\in V: L(x) \in N\}</math> is a subspace of <ma...")
 
Line 12: Line 12:
 
'''12.''' Let <math>L: V \to W</math> be a linear map and consider the graph  
 
'''12.''' Let <math>L: V \to W</math> be a linear map and consider the graph  
 
<math>G_L = \{ (x,L(x)): x \in V\} \subset V \times W</math>
 
<math>G_L = \{ (x,L(x)): x \in V\} \subset V \times W</math>
(a) Show that <math>G_L</math> is a subspace.<br />
+
(a) Show that <math>G_L</math> is a subspace.<br />
 
<br />
 
<br />
 
''Proof:'' Suppose <math>(x_1,L(x_1),(x_2,L(x_2) \in G_L</math>. Then <math>(x_1,L(x_1)+(x_2,L(x_2) = (x_1+x_2,L(x_1)+L(x_2)) = (x_1+x_2, L(x_1+x_2) \in G_L</math>. Here I used the fact that <math>L</math> is linear which means <math>L(x_1)+L(x_2) = L(x_1+x_2)</math>. Thus, <math>G_L</math> is closed under vector addition. Now suppose <math>(x,L(x)) \in G_L</math> and <math>\alpha \in \mathbb{F}</math>. Then <math>\alpha (x,L(x)) = (\alpha x, \alpha L(x)) = (\alpha x, L(\alpha x) \in G_L</math>. Again I used the linearity property to conclude <math>\alpha L(x) = L(\alpha x)</math>. Hence <math>G_L</math> is closed under scalar multiplication. Therefore <math>G_L</math> is a subspace of <math>V \times W</math>.<br />
 
''Proof:'' Suppose <math>(x_1,L(x_1),(x_2,L(x_2) \in G_L</math>. Then <math>(x_1,L(x_1)+(x_2,L(x_2) = (x_1+x_2,L(x_1)+L(x_2)) = (x_1+x_2, L(x_1+x_2) \in G_L</math>. Here I used the fact that <math>L</math> is linear which means <math>L(x_1)+L(x_2) = L(x_1+x_2)</math>. Thus, <math>G_L</math> is closed under vector addition. Now suppose <math>(x,L(x)) \in G_L</math> and <math>\alpha \in \mathbb{F}</math>. Then <math>\alpha (x,L(x)) = (\alpha x, \alpha L(x)) = (\alpha x, L(\alpha x) \in G_L</math>. Again I used the linearity property to conclude <math>\alpha L(x) = L(\alpha x)</math>. Hence <math>G_L</math> is closed under scalar multiplication. Therefore <math>G_L</math> is a subspace of <math>V \times W</math>.<br />
Line 18: Line 18:
 
(b) Show that the map <math>V \to G_L</math> that sends <math>x</math> to <math>(x,L(x)</math> is an isomorphism.<br />
 
(b) Show that the map <math>V \to G_L</math> that sends <math>x</math> to <math>(x,L(x)</math> is an isomorphism.<br />
 
<br />
 
<br />
''Proof:'' Call this map <math>\hat{L}: V \to G_L</math>. That is <math>\hat{L}(x) = (x,L(x))</math>. First I will show this map is linear: <math>\begin{aligned}
+
''Proof:'' Call this map <math>\hat{L}: V \to G_L</math>. That is <math>\hat{L}(x) = (x,L(x))</math>. First I will show this map is linear:  
 +
<math>
 
\hat{L}(x_1+x_2) & =(x_1+x_2, L(x_1+x_2)) = (x_1+x_2,L(x_1)+L(x_2)) = (x_1,L(x_1))+(x_2,L(x_2)) \\
 
\hat{L}(x_1+x_2) & =(x_1+x_2, L(x_1+x_2)) = (x_1+x_2,L(x_1)+L(x_2)) = (x_1,L(x_1))+(x_2,L(x_2)) \\
& = \hat{L}(x_1)+\hat{L}(x_2)\end{aligned}</math> and <math>\hat{L}(\alpha x) =(\alpha x, L(\alpha x)) = (\alpha x,\alpha L(x)) = \alpha (x,L(x)) = \alpha \hat{L}(x)</math>. Thus <math>\hat{L}</math> is linear. Now to show <math>\hat{L}</math> is bijective. If <math>(x,L(x)) \in G_L</math>, then <math>\hat{L}(x) = (x,L(x))</math> so <math>\hat{L}</math> is trivially onto. In fact, we essentially chose to the codomain of our function <math>\hat{L}</math> to just be the image/range of the map to ensure it was onto. Now to show <math>\hat{L}</math> is one-to-one. Suppose <math>\hat{L}(x_1) = \hat{L}(x_2)</math>. Then <math>(x_1,L(x_1)) = (x_2,L(x_2)</math>. But two ordered pairs are equal if and only if both components are equal. That is, <math>x_1 = x_2</math>. Thus <math>\hat{L}</math> is one-to-one. Therefore <math>\hat{L}</math> is an isomorphism.
+
& = \hat{L}(x_1)+\hat{L}(x_2)</math>
 +
and <math>\hat{L}(\alpha x) =(\alpha x, L(\alpha x)) = (\alpha x,\alpha L(x)) = \alpha (x,L(x)) = \alpha \hat{L}(x)</math>. Thus <math>\hat{L}</math> is linear. Now to show <math>\hat{L}</math> is bijective. If <math>(x,L(x)) \in G_L</math>, then <math>\hat{L}(x) = (x,L(x))</math> so <math>\hat{L}</math> is trivially onto. In fact, we essentially chose to the codomain of our function <math>\hat{L}</math> to just be the image/range of the map to ensure it was onto. Now to show <math>\hat{L}</math> is one-to-one. Suppose <math>\hat{L}(x_1) = \hat{L}(x_2)</math>. Then <math>(x_1,L(x_1)) = (x_2,L(x_2)</math>. But two ordered pairs are equal if and only if both components are equal. That is, <math>x_1 = x_2</math>. Thus <math>\hat{L}</math> is one-to-one. Therefore <math>\hat{L}</math> is an isomorphism.

Revision as of 16:19, 12 November 2015

3. Let be a linear map and a subspace. Show that: is a subspace of .

Proof: Suppose . Then . But is a subspace and so . But is linear so that so that . Thus, is closed under vector addition. Now suppose and . Then and since is a subspace, . But again is linear so . This means . Hence is closed under scalar multiplication. Therefore is a subspace of .

10. Show that if and are subspaces, then is also a subspace.

Proof: Suppose . Then and . But is a subspace and so . Also is a subspace so . This means . On the other hand . Thus, is closed under vector addition. Now suppose and . Then and . But and are subspaces so and . That means . This means . Hence is closed under scalar multiplication. Therefore is a subspace of .

12. Let be a linear map and consider the graph (a) Show that is a subspace.

Proof: Suppose . Then . Here I used the fact that is linear which means . Thus, is closed under vector addition. Now suppose and . Then . Again I used the linearity property to conclude . Hence is closed under scalar multiplication. Therefore is a subspace of .

(b) Show that the map that sends to is an isomorphism.

Proof: Call this map . That is . First I will show this map is linear: Failed to parse (syntax error): {\displaystyle \hat{L}(x_1+x_2) & =(x_1+x_2, L(x_1+x_2)) = (x_1+x_2,L(x_1)+L(x_2)) = (x_1,L(x_1))+(x_2,L(x_2)) \\ & = \hat{L}(x_1)+\hat{L}(x_2)} and . Thus is linear. Now to show is bijective. If , then so is trivially onto. In fact, we essentially chose to the codomain of our function to just be the image/range of the map to ensure it was onto. Now to show is one-to-one. Suppose . Then . But two ordered pairs are equal if and only if both components are equal. That is, . Thus is one-to-one. Therefore is an isomorphism.