a real vector space
a non-empty set V with operations
- addition
- scalar multiplication
properties of a real vector space
vector subspace
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
basis
of V is a set of elements in V which are
- LI
- spanning
span and vector subspace
u1..uk are vectors in V
Span(u1..uk) is a vector subspace of V
span if one of elements can be written as a linear combination
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)
span of a non LI set removing a vector
{ 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
basis and finite spanning set
if V has a finite spanning set it has a basis
basis, max LI set, min span
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
LI and span adding a vector
if {u1…uk} are LI and u isnt in span
then {u,u1.. uk} are LI
what is a basis - all equivalent statements
finite dimensional
a vector space is finite dimensional if it has a finite bases
steinitz exchange theorem (SET)
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
corollary of SET
if B1 = {a1..am} and B2 = {b1..bn} are both bases for V then m=n
dimensions
if V is a finite dimensional vector space call ist dimensions the size of any basis
dimensions of vector subspaces
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
dimensions and spanning or LI
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
R^n and the number of vectors in a subset of it and LI / span / basis
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
column space
the span of vectors given by the columns of a matrix
column rank
column rank of A is the dimensions of the column space
row space
the span of vectors given by the rows of a matrix
row rank
row rank of A is the dimensions of the row space
null space
null space of a matrix A is the solution set of Ax = 0
nullity
dimensions of the null space of A