|
|
Line 19: |
Line 19: |
| <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: | | ''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> | + | <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)+\hat{L}(x_2)</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)+\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. | | 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. |
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:
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.