MAT3141
September 7, 2012
1
1.1
Revision of vector spaces
Vector space
De nition 1. A vector space over a eld K is (V, +, ) where
1. (V, +) is an abelian group 2. K V V, (, v) v with (a) (b) (c) (d)
IK v = v ( + ) v = v + v (u + v) = u + v ( v) = () v m, n = 0, the set
Example 2. For m, n N,
Mmn (K) = {m n matrices, entries in K}
becomes a vector space with the usual addition and scalar multiplication of matrices.
K n = M atn1 (K)
1.2 Vector subspaces
Fix a vector space V over K .
De nition 3. A vector subspace of V is a subset U of V such that:
1. 0 U 2. u, v U = u + v U 3. K, u U = u U
Proposition 4. A subspace U of V is a vector space over K for the addition and scalar multiplication restricted from V to U .
1
Proposition 5. If U is a subspace of V and W is a subspace of U , then W is a subspace of V . Proposition 6. Let U1 , . . . , Un be subspaces of V . Then
1. U1 + + Un := {u1 + + un | ui Ui , 1 i n} 2. U1 U2 Un = {v V | v Ui i, 1 i n} are subspaces of V , called the sum and intersection.
Example 7. Suppose V1 and V2 are vector subspaces over K . Then V1 V2 is
a vector space over K : 1. (v1 , v2 ) + (u1 , u2 ) = (v1 + u1 , v2 + u2 ) 2. (v1 , v2 ) = (v1 , v2 ) Let V V1 V2 , U1 = {(v1 , 0) | v1 V1 }, U2 = {(0, v2 ) | v2 V2 }, then U1 + U2 = V and U1 U2 = {0}.
1.3 Bases
Fix a vector space V over K .
De nition 8. An element
v1 , . . . , v n
K
v V is a linear combination of v1 , . . . , vn V if there are scalars a1 , . . . , an K such that v = ai vi . Notation: = {all linear combinations of v1 , . . . , vn }
Proposition 9. The set v1 , . . . , vn K is a subspace of V that contains v1 , . . . , vn , and that is contained in any subspace of V containing v1 , . . . , vn . De nition 10. We say that v1 , . . . , vn generate V if V
of nite type if V admits a nite set of generators.
= v1 , . . . , v n
K
. V is
De nition 11. De nition 12.
v1 , . . . , vn V are linearly independent i ai K, ai vi = 0 = i, ai = 0
dent generators of V .
{v1 , . . . , vn } is a basis of V i {v1 , . . . , vn } are linearly indepen-
Proposition 13. Suppose that {v1 , . . . , vn } is a basis of V . For all v V , there exists a unique choice of scalars a1 , . . . , an K such that v = ai vi . One calls a1 , . . . , an the coordinates of v for the (ordered) basis B = (v1 , . . . , vn ).
[v]B = a1
. Kn . .
an
Example 14. For V
= K n , the vectors 0 0 1 0 0 1 E = { . , . , . . . , . } . . . . . . 1 0 0
form a basis of K n , called the standard basis of K n .
a1 a1 a2 a2 . = . . . . . an an E
Proposition 15. Suppose V is of nite type. Then
1. V has a basis, and all bases of V have the same cardinality, called the dimension of V , denoted dimK V . 2. Every generating set of V contains a basis of V . 3. Every linearly independent set of vectors in V is contained in a basis of V. 4. Every subspace U of V has a basis, dimK U dimK V . Remark 16. Special case: V = {0} has basis and dimK {0} = 0.
Proposition 17. If U1 , U2 are subspaces of nite dimension of a vector space V , then dimK (U1 + U2 ) + dimK (U1 U2 ) = dimK U1 + dimK U2 .
1.4 Direct sum
Fix a vector space V over K and subspaces V1 , . . . , Vn of V .
De nition 18. We say the sum V1 + + Vn is direct i
vi Vi , vi = 0 = i, vi = 0
Notation: V = V1 V2 Vn is equivalent to saying that V is the direct sum of V1 , . . . , Vn .
Example 19. Let {v1 , . . . , vn } be a basis of V .
Vi V = = vi = {avi | a K} v1
K
vn
Example 20. Any vector space V is a direct sum V
3
= V {0}.
Proposition 21. A vector space V is the direct sum of V1 , . . . , Vn i for every v V , there exists a unique choice of vectors v1 V1 , . . . , vn Vn such that
v = v1 + + vn
Proposition 22. The sum V1 + +Vn is direct i Vi {0} for all 1 i n.
V1 + V2 + + Vi + + Vn =
Proposition 23. Suppose V1 , V2 are nite-dimensional subspaces of a vector space V . Then V = V1 V2 i
1. dimK V = dimK V1 + dimK V2 2. V1 V2 = {0}
Proposition 24. Suppose V = V1 Vs is of nite dimension, and that Bi = {vi,1 , . . . , vi,n } is a basis of Vi , 1 i s. Then B = B1 B2 Bs is a basis. Notation: B = B1 B2 Bs . Corollary 25. If V
= V1 Vs
of nite dimension, then dim V =
dim Vi .
