Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>Answers</strong> to <strong>Exercises</strong> 89<br />
nontrivial relationship in the range h(⃗0 V ) = ⃗0 W = h(c 1 ⃗v 1 + · · · + c n ⃗v n ) = c 1 h(⃗v 1 ) + · · · + c n h(⃗v n ) =<br />
c 1 ⃗w + · · · + c n ⃗w n .<br />
(b) Not necessarily. For instance, the transformation of R 2 given by<br />
( ( )<br />
x x + y<br />
↦→<br />
y)<br />
x + y<br />
sends this linearly independent set in the domain to a linearly dependent image.<br />
( ( ( (<br />
1 1 1 2<br />
{⃗v 1 , ⃗v 2 } = { , } ↦→ { , } = { ⃗w<br />
0)<br />
1)<br />
1)<br />
2)<br />
1 , ⃗w 2 }<br />
(c) Not necessarily. An example is the projection map π : R 3 → R 2<br />
⎛<br />
⎝ x ⎞<br />
(<br />
y⎠ x<br />
↦→<br />
y)<br />
z<br />
and this set that does not span the domain but maps to a set that does span the codomain.<br />
⎛<br />
{ ⎝ 1 ⎞ ⎛<br />
0⎠ , ⎝ 0 ⎞<br />
( (<br />
1⎠} ↦−→ π 1 0<br />
{ , }<br />
0)<br />
1)<br />
0 0<br />
(d) Not necessarily. For instance, the injection map ι: R 2 → R 3 sends the standard basis E 2 for the<br />
domain to a set that does not span the codomain. (Remark. However, the set of ⃗w’s does span the<br />
range. A proof is easy.)<br />
Three.II.1.34 Recall that the entry in row i and column j of the transpose of M is the entry m j,i<br />
from row j and column i of M. Now, the check is routine.<br />
⎛<br />
⎞ ⎛<br />
⎞ trans ⎛<br />
⎞trans<br />
.<br />
[r · ⎜<br />
⎝· · · a i,j · · · ⎟<br />
⎠ + s · .<br />
⎜<br />
⎝· · · b i,j · · · ⎟<br />
⎠ ] .<br />
= ⎜<br />
⎝· · · ra i,j + sb i,j · · · ⎟<br />
⎠<br />
.<br />
.<br />
.<br />
.<br />
.<br />
.<br />
⎛<br />
⎞<br />
.<br />
= ⎜<br />
⎝· · · ra j,i + sb j,i · · · ⎟<br />
⎠<br />
.<br />
⎛<br />
⎞ ⎛<br />
⎞<br />
.<br />
.<br />
.<br />
= r · ⎜<br />
⎝<br />
· · · a j,i · · · ⎟<br />
⎠ + s · .<br />
⎜<br />
⎝<br />
· · · b j,i · · · ⎟<br />
⎠<br />
The domain is M m×n while the codomain is M n×m .<br />
Three.II.1.35<br />
.<br />
⎛<br />
⎞<br />
.<br />
= r · ⎜<br />
⎝· · · a j,i · · · ⎟<br />
⎠<br />
.<br />
(a) For any homomorphism h: R n → R m we have<br />
trans<br />
.<br />
⎛<br />
⎞<br />
.<br />
+ s · ⎜<br />
⎝· · · b j,i · · · ⎟<br />
⎠<br />
.<br />
h(l) = {h(t · ⃗u + (1 − t) · ⃗v) ∣ ∣ t ∈ [0..1]} = {t · h(⃗u) + (1 − t) · h(⃗v) ∣ ∣ t ∈ [0..1]}<br />
which is the line segment from h(⃗u) to h(⃗v).<br />
(b) We must show that if a subset of the domain is convex then its image, as a subset of the range, is<br />
also convex. Suppose that C ⊆ R n is convex and consider its image h(C). To show h(C) is convex<br />
we must show that for any two of its members, ⃗ d 1 and ⃗ d 2 , the line segment connecting them<br />
l = {t · ⃗d 1 + (1 − t) · ⃗d 2<br />
∣ ∣ t ∈ [0..1]}<br />
is a subset of h(C).<br />
Fix any member ˆt · ⃗d 1 + (1 − ˆt) · ⃗d 2 of that line segment. Because the endpoints of l are in the<br />
image of C, there are members of C that map to them, say h(⃗c 1 ) = ⃗ d 1 and h(⃗c 2 ) = ⃗ d 2 . Now, where<br />
ˆt is the scalar that is fixed in the first sentence of this paragraph, observe that h(ˆt ·⃗c 1 + (1 − ˆt) ·⃗c 2 ) =<br />
ˆt · h(⃗c 1 ) + (1 − ˆt) · h(⃗c 2 ) = ˆt · ⃗d 1 + (1 − ˆt) · ⃗d 2 Thus, any member of l is a member of h(C), and so<br />
h(C) is convex.<br />
trans