Vous êtes sur la page 1sur 9

Linear Algebra Done Right Solutions

Kyle Funk
July 9, 2014
Chapter 1
1. Suppose a and b are real numbers, not both 0. Find real numbers c and d such that
1/(a + bi) = c + bi
Solution:
Multiply the top an bottom of the left side by the conjugate:
(a bi)
(a bi)
1
(a + bi)
= c + bi
so that
a bi
a
2
+ b
2
= c + di
and, equating real and imaginary parts of both sides,
c =
a
a
2
+ b
2
and
d =
b
a
2
+ b
2
.
2. Show that
1 +

3i
2
is a cube root of 1.
Solution:

1 +

3i
2

1 +

3i
2

=
1 +

3i
2
and

1

3i
2

1 +

3i
2

= 1.
1
3. Prove that (v) = v for every v V .
Proof. The additive inverse of v is (v), by denition, and we have
v + (v) = 0.
So v is also the additive inverse of (v). Therefore, by the uniqueness of inverses,
(v) = v.
4. Prove that if a R, v V, av = 0, then a = 0 or v = 0.
Proof. : If a = 0, then clearly av = 0. If a = 0, then multiply both sides of the equation by
1
a
:
1
a
(av) =
1
a
0.
By the associative property,
(
1
a
a)v = 0
so
v = 0
5. For each of the following subsets of F
3
, which we will call V , determine whether it is a
subspace of F
3
:
(a) {(x
1
, x
2
, x
3
) F
3
: x
1
+ 2x
2
+ 3x
3
= 0};
(b) {(x
1
, x
2
, x
3
) F
3
: x
1
+ 2x
2
+ 3x
3
= 4};
(c) {(x
1
, x
2
, x
3
) F
3
: x
1
x
2
x
3
= 0};
(d) {(x
1
, x
2
, x
3
) F
3
: x
1
= 5x
1
};
let u = (x
1
, x
2
, x
3
), v = (y
1
, y
2
, y
3
) V and a R
(a) Closed under addition:
x + y = (x
1
+ y
1
, x
2
+ y
2
, x
3
+ y
3
)
x
1
+ y
1
+ 2(x
2
+ y
2
) + 3(x
3
+ y
3
) = 0
(x
1
+ 2x
2
+ 3x
3
) + (y
1
+ 2y
2
+ 3y
3
) = 0
0 + 0 = 0
Closed under scalar multiplication:
ax = (ax
1
, ax
2
, ax
3
)
2
ax
1
+ 2ax
2
+ 3ax
3
= 0
a(x
1
+ 2x
2
+ 3x
3
) = 0
a0 = 0
Therefore, V is a subspace of F
3
.
(b) This is not a subspace:
let u = (1, 0, 1) and v = (0, 2, 0). Then u + v = (1, 2, 1) V . Therefore, it this subset is
not closed under scalar multiplication and is not a subspace of F
3
.
(c) This is not a subspace:
let u = (1, 1, 0) and v = (0, 0, 1). Then u +v = (1, 1, 1) V . So this subset is not closed
under addition, and therefore not a subspace of F
3
.
(d) Closed under addition:
x + y = (x
1
+ y
1
, x
2
+ y
2
, x
3
+ y
3
)
x
1
+ y
1
= 5x
3
+ 5y
3
= 5(x
3
+ y
3
)
Closed under scalar multiplication.
ax
1
= a(5x
3
) = 5(ax
3
)
Therefore, V is a subspace of F
3
.
6. Give an example of a non-empty subset U of R
2
such that U is closed under addition and
taking inverses, but is not a subspace of R
2
.
Solution:
Z (the integers) is one example. Q is another. These are closed under addition and taking
inverses, but because scalars are elements of R, scalar multiplication is not closed.
7. Give an example of a subset U of R
2
such that U is closed under scalar multiplication, but
is not a subspace of R
2
.
Solution (from number 5):
U = {(x
1
, x
2
) R
2
: x
1
x
2
= 0}
There are obviously many examples.
8. Prove that the intersection of any collection of subspaces of V is a subspace of V .
Proof. Let {U
i
} denote an arbitrary collection of subspaces, and let u, v U
i
. Since, by the
denition of intersection, u, v U
i
for every i. Then u + v U
i
and {U
i
} is closed under
addition. Since u U
i
for every i, au U
i
for every i, and au U
i
. So {U
i
} is closed
under scalar multiplication. Therefore, it is a subspace of V .
3
9. Prove that the union of two subspaces of V is a subspace if and only if one subspace is
contained in the other.
Proof. Let U, W be subspaces of V . If one subspace is contained in the other, then either
U W or W U. If U W, then U W = U, which is a subspace of V . If W U, then
W U = W, which is a subspace of W.
Now we will use a proof by contradiction to show that U W is a subspace of V = U W
or W U. Assume that U Wis a subspace of V and that U W and W U. Then
u U such that u W and w W such that w U. Since u, w U W, and U W is a
subspace of V , u + w U W. This implies that u + w U or u + w W.
If u+w U, then u+w+(u) = w by associative property and existence of additive inverses.
So we have w U by closure under addition. If u + w W, then u + w + (w) = u W
by the same argument. we have reached a contradiction and have shown that U W is a
subspace of V U W or W U.
10. Suppose U is a subspace of V . What is U + U?
Solution:
By denition, U + U = {u + u : u U}. U U + U because u + u U by closure under
addition. U + U U because u + u + (u) = u U. Therefore, U + U = U.
11. Is the operation of addition on the subspaces of V commutative? Associative?
Solution:
The operation of addition on subspaces is commutative and associative, by the associative
and commutative properties of individual vectors in V .
12. Does the operation of addition on subspaces have an additive identity? Which subspaces have
additive inverses?
solution:
{0} is the additive identity for addition on subspaces of V because, if U is a subspace of V ,
U + {0} = {0} + U = U. For the additive inverse of a subspace U, we are looking for a
subspace V such that U + V = {0}. Since U, V U + V , the only subspace which satises
this is V = {0}.
13. Prove or give a counterexample: if U
1
, U
2
, W are subspaces of V, then
U
1
+ W = U
2
+ W
implies U
1
= U
2
.
Solution:
One should suspect this is untrue because of the lack of additive inverses found in the pre-
vious problem. For a counterexample, let U
1
= {0} and W = U
2
be any arbitrary subspace.
Then both sides are equal to W (from problem 10), but U
1
= U
2
. Another counterexample:
U
1
= {(x, 0) R
2
: x R}, U
2
= {(0, y) R
2
: y R}, and W = {(x, y) R
2
: x, y R}.
4
14. Suppose U is the subspace of P(F) consisting of all polynomial of the form
p(z) = az
2
+ bz
5
,
where a, b P(F). Find a subspace W of P(F) such that U W = P(F).
Solution:
Let W be the set of all polynomials such that the z
2
and z
5
coecients are 0.
15. Prove or give a counterexample: if U
1
, U
2
, W are subspaces of V, then
V = U
1
W and V = U
2
W
implies U
1
= U
2
.
Solution:
Counterexample: U
1
= {(x, 0) R
2
: x R}, U
2
= {(0, y) R
2
: y R}, and
W = {(z, z) R
2
: z R}.
Chapter 2
1. Prove that if (v
1
, . . . , v
n
) spans V , then so does the list
(v
1
v
2
, v
2
v
3
, . . . , v
n1
v
n
, v
n
)
obtained by subtracting from each vector (except the last one) the following vector.
Proof. Let v V . to show that v span(v
1
v
2
, v
2
v
3
, , v
n1
v
n
, v
n
), we need to nd
a
1
, . . . , a
n
F such that
v = a
1
(v
1
v
2
) + a
2
(v
2
v
3
) + a
n1
(v
n1
v
n
) + a
n
v
n
.
rearranging the terms, we get
v = a
1
v
1
+ (a
2
a
1
)v
2
+ (a
3
a
2
)v
3
+ + (a
n1
a
n
)v
n
+ a
n
v
n
.
Since v span(v
1
, . . . v
n
), there are b
1
, . . . , b
n
F such that
v = b
1
v
1
+ + b
n
v
n
.
Letting a
1
= b
1
, a
2
= b
2
+ a
1
, a
3
= b
3
+ a
2
, . . . shows that our list in question spans V .
2. Prove that if (v
1
, , v
n
) is linearly independent in V , then so is the list
(v
1
v
2
, v
2
v
1
, , v
n1
v
n
, v
n
)
obtained by subtracting from each vector(except the last one) the following vector.
5
Proof. We must show that, with a
1
, . . . , a
n
F,
0 = a
1
(v
1
v
2
) + a
2
(v
2
v
3
) + a
n1
(v
n1
v
n
) + a
n
v
n
has only the trivial solution. Rearranging terms, we get
0 = a
1
v
1
+ (a
2
a
1
)v
2
+ (a
3
a
2
)v
3
+ + (a
n1
a
n
)v
n
+ a
n
v
n
.
Since (v
1
, . . . v
n
) is linearly independent, we have a
1
= 0, a
2
a
1
= 0, a
3
a
2
= 0 . . . , implying
that a
1
= a
2
= = a
n
= 0.
3. Suppose (v
1
, . . . , v
n
) is linearly independent in V and w V . Prove that if (v
1
+w, . . . , v
n
+w)
is linearly dependent, then w span(v
1
, . . . , v
n
).
Proof. If (v
1
+ w, , v
n
+ w) is linearly dependent then
a
1
(v
1
+ w) + + a
n
(v
n
+ w) = 0
has a solution other than the trivial solution. Rearranging terms, we get
a
1
v
1
+ a
2
v
2
+ + a
n
v
n
+ (a
1
+ + a
n
)w = 0
. Since (v
1
. . . , v
2
) is linearly independent, we know that a
1
+ + a
n
= 0, so can write
w =
n

i=1
a
i
v
i
a
1
+ + a
n
We have written w as a linear combination of (v
1
, . . . , v
n
), and have therefore shown that
w span(v
1
, . . . , v
n
).
4. Suppose m is a positive integer. Is the set consisting of 0 and all polynomials with coecients
in F and with degree equal to m a subspace of P(F)?
Solution:
This set is not a subspace of P(F) because it is not closed under addition. Any example where
the highest degree terms of each polynomial cancel each other out when added together is a
counterexample. This result is tied to how, when we dened degree, we added the constraint
that a
m
= 0.
5. Prove that F

is innite dimensional.
Proof. We will use proof by contradiction. Assume F

is nite dimensional with dimension


N. Then (e
1
, e
2
, . . . , e
N
), the list of standard basis vectors, is a basis for F

. So clearly
(e
1
, e
2
, . . . , e
N
) spans F

, but e
N+1
F

cannot be written as a linear combination of the


vectors in the list (e
1
, e
2
, . . . , e
N
), which contradicts the denition of a basis. Therefore, F

is innite dimensional.
6. Prove that the real vector space consisting of all continuous functions on the interval [0, 1] is
innite dimensional.
6
Proof. Consider the list of vectors (1, x, x
2
, , x
n
) (with necessary constrictions on x.) This
list is linearly independent for all n, which will be proven by induction:
The rst case, x
0
= 1,is a single vector which is linearly independent because it is not 0.
When you add x
n+1
to the list (1, x, x
2
, , x
n
), the list is still linearly independent
because x
n+1
span(1, x, x
2
, , x
n
)
Since this list is linearly independent for all n, the vector space is innite dimensional.
7. Prove that V is innite dimensional if and only if there is a sequence v
1
, v
2
. . . of vectors in
V such that (v
1
, v
2
, . . . , v
n
) is linearly dependent for every n.
Proof.
8. Let U be the subspace of R
5
dened by
U = {(x
1
, x
2
, x
3
, x
4
, x
5
) R
5
: x
1
= 3x
2
andx
3
= 7x
4
}.
Find a basis of U.
Solution:
The vectors
v
1
= (3, 1, 0, 0, 0)
v
2
= (0, 0, 7, 1, 0)
v
3
= (0, 0, 0, 0, 1)
form a basis for the subspace.
9. Prove or disprove: there exists a basis (p
0
, p
1
, p
2
, p
3
) of P
3
(F) such that none of the polyno-
mials p
0
, p
1
, p
2
, p
3
has degree 2.
Proof. Here is an example of such a basis:
p
0
= 1, p
1
= x, p
2
= x
2
+ x
3
, p
3
= x
2
+ 3x
3
This basis is linearly independent, and spans P
3
(F), which is easy to verify. No vector in this
list has degree 2. This is obviously one of many examples.
10. Suppose that V is nite dimensional, with dim V = n. Prove that there exist one dimensional
subspaces U
1
, . . . , U
n
of V such that
V = U
1
U
n
.
7
Proof. Let (v
1
, v
2
, . . . , v
n
) be a basis for V . Let Each U
j
be dened by
U
j
= {av
j
: a F}.
Then clearly U
1
+ + U
n
= V. Since a basis is linearly independent, the equation
a
1
v
1
+ + a
n
v
n
= 0
has only the trivial solution, which implies that the only way

u
j
= 0 where u
j
U
j
is
when all u
j
s are equal to 0. So we have U
1
+ +U
n
= V and U
n
= 0. Thus, {U
1
, . . . , U
n
}
is a set of subspaces such that
V = U
1
U
n
.
11. Suppose that V is nite dimensional and U is a subspace of V such that dimU = dimV .
Prove that U = V .
Proof. Let (v
1
, . . . , v
n
) be a basis for U. Since dimV = dimU, V has the same number of
basis vectors as U. Since the list (v
1
, . . . , v
n
) is linearly independent, and has the correct
number of vectors, it also form a basis for V . Therefore, U = V = span(v
1
, . . . , v
n
)
12. Suppose that p
0
, p
1
, . . . p
m
are polynomials in P
m
(F) such that p
j
(2) = 0 for each j. Prove
that (p
0
, p
1
, . . . p
m
) is not linearly independent in P
m
(F).
Proof. If p
j
(2) = 0 for every j, then the equation
a
0
p
0
+ a
1
p
1
+ + a
m
p
m
has the solution x = 2, regardless of choice of as. Therefore, (p
0
, p
1
, . . . p
m
) is not linearly
independent in P
m
(F)
13. Suppose U and W are subspaces of R
8
such that dimU = 3, dimW = 5, and U + W = R
8
.
Prove that U W = {0}.
Proof. We have the equation
dim(U + V ) = dimU + dimV dim(U V ).
Since dim(U + V ) = 8, dimW = 5, and dimU = 3, we have
8 = 5 + 3 dim(U V )
so that
dim(U V ) = 0.
This implies that (U V ) must be {0}.
14. Suppose that U and W are both ve-dimensional subspaces of R
9
. Prove that U W = {0}.
8
15. You might guess that, by analogy with the formula for the number of elements in the union
of three subsets of a nite set, that if U
1
, U
2
, U
3
are subspaces of a nite dimensional vector
space, then
dim(U
1
+ U
2
+ U
3
) = dimU
1
+ dim U
2
+ dim U
3
dim (U
1
U
2
) dim (U
1
U
3
) dim (U
2
U
3
)
+ dim (U
1
U
2
U
3
)
Prove this or give a counterexample.
16. Prove that if V is nite dimensional and U
1
, . . . , U
m
are subspaces of V , then
dim(U
1
, + + U
m
) dimU
1
+ + dimU
m
17. Suppose V is nite dimensional. Prove that if U
1
, . . . , U
m
are subspaces of V such that
V = U
1
U
m
, then
dimV = dimU
1
+ + dimU
m
.
9

Vous aimerez peut-être aussi