Linear Algebra Exercises-n-Answers.pdf
Linear Algebra Exercises-n-Answers.pdf Linear Algebra Exercises-n-Answers.pdf
84 Linear Algebra, by Hefferon (c) Yes, they have the same dimension. One isomorphism is this. ⎛ ⎞ ( ) a a b c ⎜ ↦→ d e f ⎝ ⎟ . ⎠ f (d) Yes, they have the same dimension. This is an isomorphism. ( ) a + bx + · · · + fx 5 a b c ↦→ d e f (e) Yes, both have dimension 2k. ( 5 Three.I.2.9 (a) Rep B (3 − 2x) = −2) Three.I.2.10 Three.I.2.11 Three.I.2.12 Three.I.2.13 They have different dimensions. Yes, both are mn-dimensional. (b) ( 0 2) (c) ( ) −1 1 Yes, any two (nondegenerate) planes are both two-dimensional vector spaces. There are many answers, one is the set of P k (taking P −1 to be the trivial vector space). Three.I.2.14 False (except when n = 0). For instance, if f : V → R n is an isomorphism then multiplying by any nonzero scalar, gives another, different, isomorphism. (Between trivial spaces the isomorphisms are unique; the only map possible is ⃗0 V ↦→ 0 W .) Three.I.2.15 No. A proper subspace has a strictly lower dimension than it’s superspace; if U is a proper subspace of V then any linearly independent subset of U must have fewer than dim(V ) members or else that set would be a basis for V , and U wouldn’t be proper. Three.I.2.16 Three.I.2.17 Where B = 〈 β ⃗ 1 , . . . , β ⃗ n 〉, the inverse is this. ⎛ ⎞ 1.. ⎜ ⎟ ⎝c ⎠ ↦→ c 1β1 ⃗ + · · · + c nβn ⃗ c n All three spaces have dimension equal to the rank of the matrix. Three.I.2.18 We must show that if ⃗a = ⃗ b then f(⃗a) = f( ⃗ b). So suppose that a 1β1 ⃗ + · · · + a nβn ⃗ = b 1β1 ⃗ + · · · + b nβn ⃗ . Each vector in a vector space (here, the domain space) has a unique representation as a linear combination of basis vectors, so we can conclude that a 1 = b 1 , . . . , a n = b n . Thus, ⎛ ⎛ and so the function is well-defined. Three.I.2.19 f(⃗a) = ⎜ ⎝ ⎞ a 1 . a n ⎟ ⎠ = ⎞ 1 ⎜ ⎝b . b n ⎟ ⎠ = f( ⃗ b) Yes, because a zero-dimensional space is a trivial space. Three.I.2.20 (a) No, this collection has no spaces of odd dimension. (b) Yes, because P k ∼ = R k+1 . (c) No, for instance, M 2×3 ∼ = M3×2 . Three.I.2.21 One direction is easy: if the two are isomorphic via f then for any basis B ⊆ V , the set D = f(B) is also a basis (this is shown in Lemma 2.3). The check that corresponding vectors have the same coordinates: f(c 1β1 ⃗ + · · · + c nβn ⃗ ) = c 1 f( β ⃗ 1 ) + · · · + c n f( β ⃗ n ) = c 1 ⃗ δ1 + · · · + c n ⃗ δn is routine. For the other half, assume that there are bases such that corresponding vectors have the same coordinates with respect to those bases. Because f is a correspondence, to show that it is an isomorphism, we need only show that it preserves structure. Because Rep B (⃗v ) = Rep D (f(⃗v )), the map f preserves structure if and only if representations preserve addition: Rep B (⃗v 1 + ⃗v 2 ) = Rep B (⃗v 1 ) + Rep B (⃗v 2 ) and scalar multiplication: Rep B (r ·⃗v ) = r · Rep B (⃗v ) The addition calculation is this: (c 1 +d 1 ) β ⃗ 1 +· · ·+(c n +d n ) β ⃗ n = c 1β1 ⃗ +· · ·+c nβn ⃗ +d 1β1 ⃗ +· · ·+d nβn ⃗ , and the scalar multiplication calculation is similar. Three.I.2.22 (a) Pulling the definition back from R 4 to P 3 gives that a 0 + a 1 x + a 2 x 2 + a 3 x 3 is orthogonal to b 0 + b 1 x + b 2 x 2 + b 3 x 3 if and only if a 0 b 0 + a 1 b 1 + a 2 b 2 + a 3 b 3 = 0.
Answers to Exercises 85 (b) A natural definition is this. ⎛ ⎞ ⎛ ⎞ a 0 a 1 D( ⎜a 1 ⎟ ⎝a 2 ⎠ ) = ⎜2a 2 ⎟ ⎝3a 3 ⎠ a 3 0 Three.I.2.23 Yes. Assume that V is a vector space with basis B = 〈 β ⃗ 1 , . . . , β ⃗ n 〉 and that W is another vector space such that the map f : B → W is a correspondence. Consider the extension ˆf : V → W of f. ˆf(c 1β1 ⃗ + · · · + c nβn ⃗ ) = c 1 f( β ⃗ 1 ) + · · · + c n f( β ⃗ n ). The map ˆf is an isomorphism. First, ˆf is well-defined because every member of V has one and only one representation as a linear combination of elements of B. Second, ˆf is one-to-one because every member of W has only one representation as a linear combination of elements of 〈f( β ⃗ 1 ), . . . , f( β ⃗ n )〉. That map ˆf is onto because every member of W has at least one representation as a linear combination of members of 〈f( β ⃗ 1 ), . . . , f( β ⃗ n )〉. Finally, preservation of structure is routine to check. For instance, here is the preservation of addition calculation. ˆf( (c 1β1 ⃗ + · · · + c nβn ⃗ ) + (d 1β1 ⃗ + · · · + d nβn ⃗ ) ) = ˆf( (c 1 + d 1 ) β ⃗ 1 + · · · + (c n + d n ) β ⃗ n ) = (c 1 + d 1 )f( ⃗ β 1 ) + · · · + (c n + d n )f( ⃗ β n ) = c 1 f( ⃗ β 1 ) + · · · + c n f( ⃗ β n ) + d 1 f( ⃗ β 1 ) + · · · + d n f( ⃗ β n ) = ˆf(c 1β1 ⃗ + · · · + c nβn ⃗ ) + + ˆf(d 1β1 ⃗ + · · · + d nβn ⃗ ). Preservation of scalar multiplication is similar. Three.I.2.24 Because V 1 ∩ V 2 = {⃗0 V } and f is one-to-one we have that f(V 1 ) ∩ f(V 2 ) = {⃗0 U }. To finish, count the dimensions: dim(U) = dim(V ) = dim(V 1 ) + dim(V 2 ) = dim(f(V 1 )) + dim(f(V 2 )), as required. Three.I.2.25 Rational numbers have many representations, e.g., 1/2 = 3/6, and the numerators can vary among representations. Subsection Three.II.1: Definition Three.II.1.17 (a) Yes. The verification is straightforward. ⎛ h(c 1 · ⎝ x ⎞ ⎛ 1 y 1 ⎠ + c 2 · ⎝ x ⎛ 2 ⎠) = h( ⎝ c 1x 1 + c 2 x 2 ⎠) z 1 ⎞ y 2 z 2 ⎞ c 1 y 1 + c 2 y 2 c 1 z 1 + c 2 z 2 ( ) c = 1 x 1 + c 2 x 2 c 1 x 1 + c 2 x 2 + c 1 y 1 + c 2 y 2 + c 1 z 1 + c 2 z 2 ( ) ( ) x = c 1 · 1 x + c x 1 + y 1 + z 2 · 2 1 c 2 + y 2 + z 2 ⎛ ⎞ ⎛ ⎞ x 1 x 2 = c 1 · h( ⎝y 1 ⎠) + c 2 · h( ⎝y 2 ⎠) z 1 z 2 (b) Yes. The verification is easy. ⎛ h(c 1 · ⎝ x ⎞ ⎛ 1 y 1 ⎠ + c 2 · ⎝ x ⎞ ⎛ 2 y 2 ⎠) = h( ⎝ c ⎞ 1x 1 + c 2 x 2 c 1 y 1 + c 2 y 2 ⎠) z 1 z 2 c 1 z 1 + c 2 z 2 ( 0 = 0) ⎛ = c 1 · h( ⎝ x ⎞ ⎛ 1 y 1 ⎠) + c 2 · h( ⎝ x ⎞ 2 y 2 ⎠) z 1 z 2
- Page 36 and 37: 34 Linear Algebra, by Hefferon Topi
- Page 38 and 39: 36 Linear Algebra, by Hefferon 65 5
- Page 40 and 41: 38 Linear Algebra, by Hefferon Two.
- Page 42 and 43: 40 Linear Algebra, by Hefferon oute
- 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 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 94 and 95: 92 Linear Algebra, by Hefferon Thre
- 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
84 <strong>Linear</strong> <strong>Algebra</strong>, by Hefferon<br />
(c) Yes, they have the same dimension. One isomorphism is this.<br />
⎛ ⎞<br />
( ) a<br />
a b c ⎜<br />
↦→<br />
d e f<br />
⎝<br />
⎟<br />
. ⎠<br />
f<br />
(d) Yes, they have the same dimension. This is an isomorphism.<br />
( )<br />
a + bx + · · · + fx 5 a b c<br />
↦→<br />
d e f<br />
(e) Yes, both have dimension 2k.<br />
(<br />
5<br />
Three.I.2.9 (a) Rep B (3 − 2x) =<br />
−2)<br />
Three.I.2.10<br />
Three.I.2.11<br />
Three.I.2.12<br />
Three.I.2.13<br />
They have different dimensions.<br />
Yes, both are mn-dimensional.<br />
(b)<br />
(<br />
0<br />
2)<br />
(c)<br />
( )<br />
−1<br />
1<br />
Yes, any two (nondegenerate) planes are both two-dimensional vector spaces.<br />
There are many answers, one is the set of P k (taking P −1 to be the trivial vector space).<br />
Three.I.2.14 False (except when n = 0). For instance, if f : V → R n is an isomorphism then multiplying<br />
by any nonzero scalar, gives another, different, isomorphism. (Between trivial spaces the<br />
isomorphisms are unique; the only map possible is ⃗0 V ↦→ 0 W .)<br />
Three.I.2.15 No. A proper subspace has a strictly lower dimension than it’s superspace; if U is<br />
a proper subspace of V then any linearly independent subset of U must have fewer than dim(V )<br />
members or else that set would be a basis for V , and U wouldn’t be proper.<br />
Three.I.2.16<br />
Three.I.2.17<br />
Where B = 〈 β ⃗ 1 , . . . , β ⃗ n 〉, the inverse is this.<br />
⎛ ⎞<br />
1..<br />
⎜ ⎟<br />
⎝c<br />
⎠ ↦→ c 1β1 ⃗ + · · · + c nβn<br />
⃗<br />
c n<br />
All three spaces have dimension equal to the rank of the matrix.<br />
Three.I.2.18 We must show that if ⃗a = ⃗ b then f(⃗a) = f( ⃗ b). So suppose that a 1β1 ⃗ + · · · + a nβn ⃗ =<br />
b 1β1 ⃗ + · · · + b nβn ⃗ . Each vector in a vector space (here, the domain space) has a unique representation<br />
as a linear combination of basis vectors, so we can conclude that a 1 = b 1 , . . . , a n = b n . Thus,<br />
⎛ ⎛<br />
and so the function is well-defined.<br />
Three.I.2.19<br />
f(⃗a) =<br />
⎜<br />
⎝<br />
⎞<br />
a 1<br />
.<br />
a n<br />
⎟<br />
⎠ =<br />
⎞<br />
1<br />
⎜<br />
⎝b<br />
. b n<br />
⎟<br />
⎠ = f( ⃗ b)<br />
Yes, because a zero-dimensional space is a trivial space.<br />
Three.I.2.20 (a) No, this collection has no spaces of odd dimension.<br />
(b) Yes, because P k<br />
∼ = R k+1 .<br />
(c) No, for instance, M 2×3<br />
∼ = M3×2 .<br />
Three.I.2.21 One direction is easy: if the two are isomorphic via f then for any basis B ⊆ V , the set<br />
D = f(B) is also a basis (this is shown in Lemma 2.3). The check that corresponding vectors have the<br />
same coordinates: f(c 1β1 ⃗ + · · · + c nβn ⃗ ) = c 1 f( β ⃗ 1 ) + · · · + c n f( β ⃗ n ) = c 1<br />
⃗ δ1 + · · · + c n<br />
⃗ δn is routine.<br />
For the other half, assume that there are bases such that corresponding vectors have the same<br />
coordinates with respect to those bases. Because f is a correspondence, to show that it is an<br />
isomorphism, we need only show that it preserves structure. Because Rep B (⃗v ) = Rep D (f(⃗v )),<br />
the map f preserves structure if and only if representations preserve addition: Rep B (⃗v 1 + ⃗v 2 ) =<br />
Rep B (⃗v 1 ) + Rep B (⃗v 2 ) and scalar multiplication: Rep B (r ·⃗v ) = r · Rep B (⃗v ) The addition calculation is<br />
this: (c 1 +d 1 ) β ⃗ 1 +· · ·+(c n +d n ) β ⃗ n = c 1β1 ⃗ +· · ·+c nβn ⃗ +d 1β1 ⃗ +· · ·+d nβn ⃗ , and the scalar multiplication<br />
calculation is similar.<br />
Three.I.2.22 (a) Pulling the definition back from R 4 to P 3 gives that a 0 + a 1 x + a 2 x 2 + a 3 x 3 is<br />
orthogonal to b 0 + b 1 x + b 2 x 2 + b 3 x 3 if and only if a 0 b 0 + a 1 b 1 + a 2 b 2 + a 3 b 3 = 0.