Ma211 Chap1

Vector Spaces Subspaces
Ma211: Vector Spaces
April 12, 2010
4-4
Denition Let F be a eld, whose elements are referred to as scalars. A vector space over F is a nonempty set V , together with two operations: addition denoted by + and multiplication denoted by juxtaposition subject to several conditions.
4-4
4-4
4-4
Denition (a) (Closure under Addition) For each pair (u , v ) V V , u + v V. (b) (Associativity of Addition) For all vectors u , v , w V , u + (v + w ) = ( u + v ) + w . (c) (Commutativity of Addition) For all vectors u , v V , u+v =v +u (d) (Existence of a zero) There is a zero vector 0 V such that, for all vectors u V , 0 + u = u + 0 = u . (e) (Existence of an Additive Inverse) Each vector u V has an additive inverse denoted by u such that u + (u ) = (u ) + u = 0. Note that conditions (a)-(e) imply that V is an abelian group under addition.
4-4
4-4
4-4
4-4
4-4
4-4
4-4
4-4
Denition (e) (Closure under Scaler Multiplication) For each pair (r , v ) F V , rv V . (f) (Distributive Property over Addition) For all vectors u , v V and scalars r , s F , r (u + v ) = ru + rv and (r + s )u = ru + su . (c) (Scalar Associativity) For a vector u V and scalars r , s F , (rs )u = r (su ). (d) (Existence of an Identity) There is an identity vector 1 V such that, for all vectors u V , 1u = u 1 = u .
4-4
4-4
4-4
4-4
4-4
4-4
Example The set R2 is a vector space over R if the addition and multiplication have their usual meaning. x1 x2 r + x1 x2 y1 y2 = = x1 + y1 x2 + y2 rx1 rx2
4-4
Example The set R2 is a vector space over R if the addition and multiplication have their usual meaning. x1 x2 r + x1 x2 y1 y2 = = x1 + y1 x2 + y2 rx1 rx2
4-4
Example Prove that this is not a vector space: the set R2 where addition and multiplication are dened as follows. x1 y1 r + x y x2 y2 = = rx ry x1 x2 y1 y2
4-4
Example Prove that this is not a vector space: the set R2 where addition and multiplication are dened as follows. x1 y1 r + x y x2 y2 = = rx ry x1 x2 y1 y2
4-4
Lemma In a vector space V over F , for any v V and r F , we have

1 2 3
0v = 0; (1v ) + v = 0 r0 = 0
4-4
Lemma In a vector space V over F , for any v V and r F , we have

1 2 3
0v = 0; (1v ) + v = 0 r0 = 0
4-4
Lattice of Spaces Direct Sums
Denition Any expression of the form r1 v1 + + rn cn where ri F and vi V for all i , is called a linear combination of the vectors v1 , . . . , vn .
4-4
Denition Any expression of the form r1 v1 + + rn cn where ri F and vi V for all i , is called a linear combination of the vectors v1 , . . . , vn .
4-4
Denition For any vector space V , a subspace is a subset S of V that is itself a vector space, under the inherited operations.
4-4
Denition For any vector space V , a subspace is a subset S of V that is itself a vector space, under the inherited operations.
4-4
Lemma For a nonempty subset S of a vector space V , under the inherited operations, the following are equivalent statements.
1 2
S is a subspace of V . S is closed under linear combinations of pairs of vectors: for any vectors s1 , s2 S and r1 , r2 F , the vector r1 s1 + r2 s2 S. S is closed under linear combinations of any number of vectors: for any vectors s1 , . . . , sn S and r1 , . . . , rn F , the vector r1 s1 + + rn sn S.
4-4
Lemma For a nonempty subset S of a vector space V , under the inherited operations, the following are equivalent statements.
1 2
S is a subspace of V . S is closed under linear combinations of pairs of vectors: for any vectors s1 , s2 S and r1 , r2 F , the vector r1 s1 + r2 s2 S. S is closed under linear combinations of any number of vectors: for any vectors s1 , . . . , sn S and r1 , . . . , rn F , the vector r1 s1 + + rn sn S.
4-4
Example The set Mm,n (F ) of all m n matrices with entries in a eld f is a vector space over F , under the operations of matrix addition and scalar multiplication. The subset of the vector space M2,2 (R) L= a 0 b c |a + b + c = 0
is a subspace of M2,2 (R).
4-4
4-4
4-4
The set L(V ) of all subspaces of a vector space V is partially ordered by set inclusion. {0} is the smallest element and V itself is the largest element. If S , T L(V ), then S T is the largest subspace of V that is contained in S and T . = glb {S , T } = S T Similarly, if {Si |i K } is any collection of subspaces of V , then the intersection i K Si is also a subspace of V , and the glb {{Si |i K }}.
4-4
4-4
4-4
4-4
4-4
4-4
On the other hand, if S , T L(V ), then S T L(V ) if and only if S T or T S . Theorem A vector space V over an innite eld F is never a union of nite number of proper subspaces.
4-4
4-4
4-4
To determine the smallest subspace of V containing the subspaces S and T , we make the following denition. Theorem Let S and T be a subspace of V . The sum S + T is the set S + T = {u + v |u S , v T }. More generally, the sum of any collection {Si |i K } of subspaces is the set Si = {s1 + + sn |sj Si }.
i K i K
4-4
i K i K
4-4
i K i K
4-4
i K i K
4-4
i K i K
4-4
Theorem The following results are easy to prove:

1
The sum of any collection of subspaces of V is a subspace of V. lub {S , T } = S + T lub {Si } =

i K
2 3
Si
4-4
Theorem The following results are easy to prove:

1
The sum of any collection of subspaces of V is a subspace of V. lub {S , T } = S + T lub {Si } =

i K
2 3
Si
4-4
Denition A partially ordered set in which every pair of elements has a least upper bound (lub) and greatest lower bound (glb) is called a lattice.
Theorem The set L(V ) of all subspaces of a vector space V is a lattice under the set inclusion, with glb {S , T } = S T and lub {S , T } = S + T .
4-4
4-4
4-4
As we will see, there are many ways to construct new vector space from old ones. Denition Let V1 , V2 , . . . , Vn be vector spaces over the same eld F . The external direct sum of V1 , . . . , Vn denoted by V = V1 V2 Vn , is the vector space V whose elements are ordered n-tuples V = {(v1 , . . . , vn |vi Vi , i = 1, . . . , n)} with componentwise operations (u1 , . . . , un ) + (v1 , . . . , vn ) = (u1 + v1 , . . . , un + vn ) r (v1 , . . . , vn ) = (rv1 , . . . , rvn ).
4-4
4-4
4-4
4-4
This construction can be generalized to any collection of vector spaces, by generalizing the idea that an ordered n-tuple (v1 , . . . , vn ) is just a function f : {1, . . . , n} Vi with the property that f (i ) Vi . Denition Let F = {Vi |i K } be any family of vector spaces over F . The direct product of F is the vector space Vi = {f : K
i K i K
Vi |f (i ) Vi }
thought of as a subspace of the vector space of all functions from K to Vi .

4-4
i K i K
Vi |f (i ) Vi }

4-4
i K i K
Vi |f (i ) Vi }

4-4
i K i K
Vi |f (i ) Vi }

4-4
Denition Let F = {Vi |i K } be any family of vector spaces over F . The support of a function f : K Vi is the set supp (f ) = {i K |f (i ) = 0}. Thus, f has a nite support if f (i ) = 0 for all but a nite number of i K .
4-4
Denition Let F = {Vi |i K } be any family of vector spaces over F . The support of a function f : K Vi is the set supp (f ) = {i K |f (i ) = 0}. Thus, f has a nite support if f (i ) = 0 for all but a nite number of i K .
4-4

Ma211 Chap1

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Ma211 Chap1

Hochgeladen von

Copyright:

Verfügbare Formate

Vector Spaces Subspaces

Ma211: Vector Spaces

April 12, 2010

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Ma211: Vector Spaces

Vector Spaces Subspaces

Lemma In a vector space V over F , for any v V and r F , we have

Ma211: Vector Spaces

Vector Spaces Subspaces

Lemma In a vector space V over F , for any v V and r F , we have

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces

Lattice of Spaces Direct Sums

Ma211: Vector Spaces

Vector Spaces Subspaces