Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf Linear Algebra Exercises-n-Answers.pdf
92 Linear Algebra, by Hefferon Three.II.2.26 The shadow of a scalar multiple is the scalar multiple of the shadow. Three.II.2.27 (a) Setting a 0 + (a 0 + a 1 )x + (a 2 + a 3 )x 3 = 0 + 0x + 0x 2 + 0x 3 gives a 0 = 0 and a 0 + a 1 = 0 and a 2 + a 3 = 0, so the nullspace is {−a 3 x 2 + a 3 x ∣ 3 a 3 ∈ R}. (b) Setting a 0 + (a 0 + a 1 )x + (a 2 + a 3 )x 3 = 2 + 0x + 0x 2 − x 3 gives that a 0 = 2, and a 1 = −2, and a 2 + a 3 = −1. Taking a 3 as a parameter, and renaming it a 3 = a gives this set description {2 − 2x + (−1 − a)x 2 + ax ∣ 3 a ∈ R} = {(2 − 2x − x 2 ) + a · (−x 2 + x 3 ) ∣ a ∈ R}. (c) This set is empty because the range of h includes only those polynomials with a 0x 2 term. Three.II.2.28 All inverse images are lines with slope −2. 2x + y = 0 2x + y = −3 2x + y = 1 Three.II.2.29 These are the inverses. (a) a 0 + a 1 x + a 2 x 2 + a 3 x 3 ↦→ a 0 + a 1 x + (a 2 /2)x 2 + (a 3 /3)x 3 (b) a 0 + a 1 x + a 2 x 2 + a 3 x 3 ↦→ a 0 + a 2 x + a 1 x 2 + a 3 x 3 (c) a 0 + a 1 x + a 2 x 2 + a 3 x 3 ↦→ a 3 + a 0 x + a 1 x 2 + a 2 x 3 (d) a 0 + a 1 x + a 2 x 2 + a 3 x 3 ↦→ a 0 + (a 1 − a 0 )x + (a 2 − a 1 )x 2 + (a 3 − a 2 )x 3 For instance, for the second one, the map given in the question sends 0 + 1x + 2x 2 + 3x 3 ↦→ 0 + 2x + 1x 2 + 3x 3 and then the inverse above sends 0 + 2x + 1x 2 + 3x 3 ↦→ 0 + 1x + 2x 2 + 3x 3 . So this map is actually self-inverse. Three.II.2.30 For any vector space V , the nullspace is trivial, while the rangespace {⃗v ∈ V ∣ ∣ 2⃗v = ⃗0} { ⃗w ∈ V ∣ ∣ ⃗w = 2⃗v for some ⃗v ∈ V } is all of V , because every vector ⃗w is twice some other vector, specifically, it is twice (1/2) ⃗w. (Thus, this transformation is actually an automorphism.) Three.II.2.31 Because the rank plus the nullity equals the dimension of the domain (here, five), and the rank is at most three, the possible pairs are: (3, 2), (2, 3), (1, 4), and (0, 5). Coming up with linear maps that show that each pair is indeed possible is easy. Three.II.2.32 No (unless P n is trivial), because the two polynomials f 0 (x) = 0 and f 1 (x) = 1 have the same derivative; a map must be one-to-one to have an inverse. Three.II.2.33 The nullspace is this. {a 0 + a 1 x + · · · + a n x n ∣ ∣ a 0 (1) + a 1 2 (1 2 ) + · · · + a n n + 1 (1n+1 ) = 0} Thus the nullity is n. = {a 0 + a 1 x + · · · + a n x n ∣ ∣ a 0 + (a 1 /2) + · · · + (a n+1 /n + 1) = 0} Three.II.2.34 (a) One direction is obvious: if the homomorphism is onto then its range is the codomain and so its rank equals the dimension of its codomain. For the other direction assume that the map’s rank equals the dimension of the codomain. Then the map’s range is a subspace of the codomain, and has dimension equal to the dimension of the codomain. Therefore, the map’s range must equal the codomain, and the map is onto. (The ‘therefore’ is because there is a linearly independent subset of the range that is of size equal to the dimension of the codomain, but any such linearly independent subset of the codomain must be a basis for the codomain, and so the range equals the codomain.) (b) By Theorem 2.21, a homomorphism is one-to-one if and only if its nullity is zero. Because rank plus nullity equals the dimension of the domain, it follows that a homomorphism is one-to-one if and only if its rank equals the dimension of its domain. But this domain and codomain have the same dimension, so the map is one-to-one if and only if it is onto. Three.II.2.35 We are proving that h: V → W is nonsingular if and only if for every linearly independent subset S of V the subset h(S) = {h(⃗s) ∣ ⃗s ∈ S} of W is linearly independent.
Answers to Exercises 93 One half is easy — by Theorem 2.21, if h is singular then its nullspace is nontrivial (contains more than just the zero vector). So, where ⃗v ≠ ⃗0 V is in that nullspace, the singleton set {⃗v } is independent while its image {h(⃗v)} = {⃗0 W } is not. For the other half, assume that h is nonsingular and so by Theorem 2.21 has a trivial nullspace. Then for any ⃗v 1 , . . . , ⃗v n ∈ V , the relation ⃗0 W = c 1 · h(⃗v 1 ) + · · · + c n · h(⃗v n ) = h(c 1 · ⃗v 1 + · · · + c n · ⃗v n ) implies the relation c 1 · ⃗v 1 + · · · + c n · ⃗v n = ⃗0 V . Hence, if a subset of V is independent then so is its image in W . Remark. The statement is that a linear map is nonsingular if and only if it preserves independence for all sets (that is, if a set is independent then its image is also independent). A singular map may well preserve some independent sets. An example is this singular map from R 3 to R 2 . ⎛ ⎝ x ⎞ ( ) y⎠ x + y + z ↦→ 0 z Linear independence is preserved for this set ⎛ { ⎝ 1 ⎞ ( 1 0⎠} ↦→ { } 0) 0 and (in a somewhat more tricky example) also for this set ⎛ { ⎝ 1 ⎞ ⎛ 0⎠ , ⎝ 0 ⎞ ( 1 1⎠} ↦→ { } 0) 0 0 (recall that in a set, repeated elements do not appear twice). However, there are sets whose independence is not preserved under this map; ⎛ { ⎝ 1 ⎞ ⎛ 0⎠ , ⎝ 0 ⎞ ( ( 1 2 2⎠} ↦→ { , } 0) 0) 0 0 and so not all sets have independence preserved. Three.II.2.36 (We use the notation from Theorem 1.9.) Fix a basis 〈 β ⃗ 1 , . . . , β ⃗ n 〉 for V and a basis 〈 ⃗w 1 , . . . , ⃗w k 〉 for W . If the dimension k of W is less than or equal to the dimension n of V then the theorem gives a linear map from V to W determined in this way. ⃗β 1 ↦→ ⃗w 1 , . . . , β ⃗ k ↦→ ⃗w k and β ⃗ k+1 ↦→ ⃗w k , . . . , β ⃗ n ↦→ ⃗w k We need only to verify that this map is onto. Any member of W can be written as a linear combination of basis elements c 1 · ⃗w 1 + · · · + c k · ⃗w k . This vector is the image, under the map described above, of c 1 · ⃗β 1 + · · · + c k · ⃗β k + 0 · ⃗β k+1 · · · + 0 · ⃗β n . Thus the map is onto. Three.II.2.37 By assumption, h is not the zero map and so a vector ⃗v ∈ V exists that is not in the nullspace. Note that 〈h(⃗v)〉 is a basis for R, because it is a size one linearly independent subset of R. Consequently h is onto, as for any r ∈ R we have r = c · h(⃗v) for some scalar c, and so r = h(c⃗v). Thus the rank of h is one. Because the nullity is given as n, the dimension of the domain of h (the vector space V ) is n + 1. We can finish by showing {⃗v, β ⃗ 1 , . . . , β ⃗ n } is linearly independent, as it is a size n + 1 subset of a dimension n + 1 space. Because { β ⃗ 1 , . . . , β ⃗ n } is linearly independent we need only show that ⃗v is not a linear combination of the other vectors. But c 1β1 ⃗ + · · · + c nβn ⃗ = ⃗v would give −⃗v + c 1β1 ⃗ + · · · + c nβn ⃗ = ⃗0 and applying h to both sides would give a contradiction. Three.II.2.38 Yes. For the transformation of R 2 given by ( ( x h 0 ↦−→ y) x) we have this. ( ) 0 ∣∣ N (h) = { y ∈ R} = R(h) y Remark. We will see more of this in the fifth chapter.
- Page 44 and 45: 42 Linear Algebra, by Hefferon (e)
- Page 46 and 47: 44 Linear Algebra, by Hefferon Asso
- Page 48 and 49: 46 Linear Algebra, by Hefferon of B
- Page 50 and 51: 48 Linear Algebra, by Hefferon (c)
- Page 52 and 53: 50 Linear Algebra, by Hefferon Poss
- Page 54 and 55: 52 Linear Algebra, by Hefferon Repe
- Page 56 and 57: 54 Linear Algebra, by Hefferon give
- Page 58 and 59: 56 Linear Algebra, by Hefferon (b)
- Page 60 and 61: 58 Linear Algebra, by Hefferon and
- Page 62 and 63: 60 Linear Algebra, by Hefferon Two.
- Page 64 and 65: 62 Linear Algebra, by Hefferon Two.
- Page 66 and 67: 64 Linear Algebra, by Hefferon Two.
- Page 68 and 69: 66 Linear Algebra, by Hefferon But
- Page 70 and 71: 68 Linear Algebra, by Hefferon (b)
- Page 72 and 73: 70 Linear Algebra, by Hefferon 2 Fo
- Page 74 and 75: 72 Linear Algebra, by Hefferon -a T
- Page 76 and 77: 74 Linear Algebra, by Hefferon 3 (a
- Page 78 and 79: 76 Linear Algebra, by Hefferon and
- Page 80 and 81: 78 Linear Algebra, by Hefferon (d)
- Page 82 and 83: 80 Linear Algebra, by Hefferon Thre
- Page 84 and 85: 82 Linear Algebra, by Hefferon has
- Page 86 and 87: 84 Linear Algebra, by Hefferon (c)
- Page 88 and 89: 86 Linear Algebra, by Hefferon (c)
- Page 90 and 91: 88 Linear Algebra, by Hefferon Thre
- Page 92 and 93: 90 Linear Algebra, by Hefferon ∣
- Page 96 and 97: 94 Linear Algebra, by Hefferon Thre
- Page 98 and 99: 96 Linear Algebra, by Hefferon and,
- Page 100 and 101: 98 Linear Algebra, by Hefferon The
- Page 102 and 103: 100 Linear Algebra, by Hefferon (c)
- Page 104 and 105: 102 Linear Algebra, by Hefferon mea
- Page 106 and 107: 104 Linear Algebra, by Hefferon (c)
- Page 108 and 109: 106 Linear Algebra, by Hefferon Thr
- Page 110 and 111: 108 Linear Algebra, by Hefferon (e)
- Page 112 and 113: 110 Linear Algebra, by Hefferon (a)
- Page 114 and 115: 112 Linear Algebra, by Hefferon to
- Page 116 and 117: 114 Linear Algebra, by Hefferon Thr
- Page 118 and 119: 116 Linear Algebra, by Hefferon Thr
- Page 120 and 121: 118 Linear Algebra, by Hefferon As
- Page 122 and 123: 120 Linear Algebra, by Hefferon and
- Page 124 and 125: 122 Linear Algebra, by Hefferon we
- Page 126 and 127: 124 Linear Algebra, by Hefferon (b)
- Page 128 and 129: 126 Linear Algebra, by Hefferon As
- Page 130 and 131: 128 Linear Algebra, by Hefferon (d)
- Page 132 and 133: 130 Linear Algebra, by Hefferon the
- Page 134 and 135: 132 Linear Algebra, by Hefferon Thr
- Page 136 and 137: and that (⃗v − (c1 · ⃗κ 1 +
- Page 138 and 139: 136 Linear Algebra, by Hefferon (a)
- Page 140 and 141: 138 Linear Algebra, by Hefferon the
- Page 142 and 143: 140 Linear Algebra, by Hefferon and
<strong>Answers</strong> to <strong>Exercises</strong> 93<br />
One half is easy — by Theorem 2.21, if h is singular then its nullspace is nontrivial (contains more<br />
than just the zero vector). So, where ⃗v ≠ ⃗0 V is in that nullspace, the singleton set {⃗v } is independent<br />
while its image {h(⃗v)} = {⃗0 W } is not.<br />
For the other half, assume that h is nonsingular and so by Theorem 2.21 has a trivial nullspace.<br />
Then for any ⃗v 1 , . . . , ⃗v n ∈ V , the relation<br />
⃗0 W = c 1 · h(⃗v 1 ) + · · · + c n · h(⃗v n ) = h(c 1 · ⃗v 1 + · · · + c n · ⃗v n )<br />
implies the relation c 1 · ⃗v 1 + · · · + c n · ⃗v n = ⃗0 V . Hence, if a subset of V is independent then so is its<br />
image in W .<br />
Remark. The statement is that a linear map is nonsingular if and only if it preserves independence<br />
for all sets (that is, if a set is independent then its image is also independent). A singular map may<br />
well preserve some independent sets. An example is this singular map from R 3 to R 2 .<br />
⎛<br />
⎝ x ⎞<br />
( )<br />
y⎠ x + y + z<br />
↦→<br />
0<br />
z<br />
<strong>Linear</strong> independence is preserved for this set<br />
⎛<br />
{ ⎝ 1 ⎞<br />
(<br />
1<br />
0⎠} ↦→ { }<br />
0)<br />
0<br />
and (in a somewhat more tricky example) also for this set<br />
⎛<br />
{ ⎝ 1 ⎞ ⎛<br />
0⎠ , ⎝ 0 ⎞<br />
(<br />
1<br />
1⎠} ↦→ { }<br />
0)<br />
0 0<br />
(recall that in a set, repeated elements do not appear twice). However, there are sets whose independence<br />
is not preserved under this map;<br />
⎛<br />
{ ⎝ 1 ⎞ ⎛<br />
0⎠ , ⎝ 0 ⎞<br />
( (<br />
1 2<br />
2⎠} ↦→ { , }<br />
0)<br />
0)<br />
0 0<br />
and so not all sets have independence preserved.<br />
Three.II.2.36 (We use the notation from Theorem 1.9.) Fix a basis 〈 β ⃗ 1 , . . . , β ⃗ n 〉 for V and a basis<br />
〈 ⃗w 1 , . . . , ⃗w k 〉 for W . If the dimension k of W is less than or equal to the dimension n of V then the<br />
theorem gives a linear map from V to W determined in this way.<br />
⃗β 1 ↦→ ⃗w 1 , . . . , β ⃗ k ↦→ ⃗w k and β ⃗ k+1 ↦→ ⃗w k , . . . , β ⃗ n ↦→ ⃗w k<br />
We need only to verify that this map is onto.<br />
Any member of W can be written as a linear combination of basis elements c 1 · ⃗w 1 + · · · + c k · ⃗w k .<br />
This vector is the image, under the map described above, of c 1 · ⃗β 1 + · · · + c k · ⃗β k + 0 · ⃗β k+1 · · · + 0 · ⃗β n .<br />
Thus the map is onto.<br />
Three.II.2.37 By assumption, h is not the zero map and so a vector ⃗v ∈ V exists that is not in the<br />
nullspace. Note that 〈h(⃗v)〉 is a basis for R, because it is a size one linearly independent subset of R.<br />
Consequently h is onto, as for any r ∈ R we have r = c · h(⃗v) for some scalar c, and so r = h(c⃗v).<br />
Thus the rank of h is one. Because the nullity is given as n, the dimension of the domain of h (the<br />
vector space V ) is n + 1. We can finish by showing {⃗v, β ⃗ 1 , . . . , β ⃗ n } is linearly independent, as it is a<br />
size n + 1 subset of a dimension n + 1 space. Because { β ⃗ 1 , . . . , β ⃗ n } is linearly independent we need<br />
only show that ⃗v is not a linear combination of the other vectors. But c 1β1 ⃗ + · · · + c nβn ⃗ = ⃗v would<br />
give −⃗v + c 1β1 ⃗ + · · · + c nβn ⃗ = ⃗0 and applying h to both sides would give a contradiction.<br />
Three.II.2.38<br />
Yes. For the transformation of R 2 given by<br />
( ( x h 0<br />
↦−→<br />
y)<br />
x)<br />
we have this.<br />
( )<br />
0 ∣∣<br />
N (h) = { y ∈ R} = R(h)<br />
y<br />
Remark. We will see more of this in the fifth chapter.