Real vector spaces Flashcards

(37 cards)

1
Q

a real vector space

A

a non-empty set V with operations
- addition
- scalar multiplication

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

properties of a real vector space

A
  • element 0 such that 0 + V = V + 0 = V
  • v + w = w + v
  • for each v in V theres a -v such that v + -v = -v + v = 0
  • v+ (w + u) = (v+w) + u
  • 0v = 0
  • 1v = v
  • (λµ)v = λ(µv)
  • (λ + µ)v = λv + µv
    µ(v+w) = µv + µw
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

vector subspace

A

is a non empty subset U of V which is closed under addition and scalar multiplication (as used in V)
equivalently a vector subspace of V is a non empty subset U which is a vector space using same operations

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

basis

A

of V is a set of elements in V which are
- LI
- spanning

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

span and vector subspace

A

u1..uk are vectors in V
Span(u1..uk) is a vector subspace of V

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

span if one of elements can be written as a linear combination

A

u1..uk are vectors in V
if one can be written as a linear combination of the others say u1
then Span(u1…uk) = Span(u2..uk)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

span of a non LI set removing a vector

A

{ u1..uk} is not LI then for some i
ui is an element of Span {u1…ui-1, ui+1..uk}
so span(u1..uk) = Span(u1…ui-1, ui+1..uk) - same set without ui

hence if we have a finite spanning set thats not LI we can reduce no vectors and still get a span - continuing to do this till its LI then we get a basis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

basis and finite spanning set

A

if V has a finite spanning set it has a basis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

basis, max LI set, min span

A

u1..uk are vectors in V the following are equivalent:
- {u1..uk} are a basis
- {u1…uk} are a maximal LI set - adding any other vector makes it not LI
- any v in V can be written uniquely as µ1 u1 + …+ µk uk
- {u1…uk} is a minimal spanning set - removing any uis and it wont span

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

LI and span adding a vector

A

if {u1…uk} are LI and u isnt in span
then {u,u1.. uk} are LI

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what is a basis - all equivalent statements

A
  • {u1…uk} are a basis for V
  • the uis are a max LI set
  • every u in V has a unique expression ∑ λu
  • the uis are a minimal spanning set
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

finite dimensional

A

a vector space is finite dimensional if it has a finite bases

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

steinitz exchange theorem (SET)

A

let S = {v1…vk} be a spanning set for V
let {u1…uk} be a LI set in V
then there are l distinct vectors {vi1, vi2…vil} such that for each j, 0<= j <= l
the set S \ {vi1…vij} U {u1..uj} still spans V
- we must have k>= l
- any spanning set in V is at least as large as any LI set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

corollary of SET

A

if B1 = {a1..am} and B2 = {b1..bn} are both bases for V then m=n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

dimensions

A

if V is a finite dimensional vector space call ist dimensions the size of any basis

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

dimensions of vector subspaces

A

V is a finite dimensional vector space and U is a vector subspace of V
- U is also finite dimensional
- Dim U <= Dim V
- Dim U = Dim V iff U = V

17
Q

dimensions and spanning or LI

A

V is a vector space {v1…vl} are l vectors in V
let k = dimV
- if k<l the {v1..vl} are not LI
- if k>l then {v1…vl} dont span
- if k = l then the following are equivalent:
-> the vectors are a basis
-> are LI
-> span V

18
Q

R^n and the number of vectors in a subset of it and LI / span / basis

A

if there are k vectors {u1..uk} c R^n
- k>n - not LI
- k<n - dont span
- k = n are a basis <=> matrix (u1..uk) = A is non singular <=> detA ≠ 0

19
Q

column space

A

the span of vectors given by the columns of a matrix

20
Q

column rank

A

column rank of A is the dimensions of the column space

21
Q

row space

A

the span of vectors given by the rows of a matrix

22
Q

row rank

A

row rank of A is the dimensions of the row space

23
Q

null space

A

null space of a matrix A is the solution set of Ax = 0

24
Q

nullity

A

dimensions of the null space of A

25
matrix and LI
let v1..vk be LI vectors in R^n let P be an invertible matrix Pv1...Pvk are also LI
26
A and PA ranks
- A and PA have same row space - A and PA may have diff column spaces but have same dimension (same column rank) - A and PA have same null space
27
row rank and column rank
row rank = column rank common number called the rank
28
rank nullity theorem
if A is a matrix M nxk rank + nullity = k (no. collumns)
29
30
rank and nullity in terms of GJ
rank = no. leading 1s nullity = no columns without leading 1s
31
sum of vector subspaces
U+W = { v in V | v = u + w for u in U and w in W}
32
intersection of vector subspaces
UnW = { v in V| v in U and v in W}
33
dim(U+W) if U and W vector subspaces
dim(U + W) = dim(U) + dim(W) - dim(UnW)
34
direct sum
V = U ⊕ W if V = U + w and UnW = {0} V is direct sum of U and W
35
equivalent to direct sum
if U and W vector subspaces of V the following are equivalent V = U ⊕ W if {u1...us} and {w1..wt} are basis then {u1..us,w1..wt} is a basis of V V = U+W and dimV = dimU + dimW every v in V can be written uniquely as v = u + w
36
coordinate map
let B = {v1..vn} be an ordered basis for V any v in V has unique expression v = x1v1+ ..+ xnvn given B to specify v we just need the xis which we can write as a column vector (coordinates) the function from V-> R^n that goes from v to this column vector of xis is the coordinate map
37
problem of 2 basis
we have standard basis S and another basis B suppose v is in S basis with xis given the xis how do we find the yis to write v in B? first write bis in S coordinates as the columns of an nxn matrix then do the inverse of that matrix onto the xis in S to find the it in B coords