Académique Documents
Professionnel Documents
Culture Documents
Finite-dimensional spaces
Recall we defined a finite-dimensional space as one that
is spanned by a finite number of vectors.
Today we will see how questions about a finite-dimensional
vector space can be translated into questions about
Euclidean space.
Basis
Let V be a vector space. Vectors v1 , . . . , vr are a finite
basis for V if they are linearly independent and
span({v1 , . . . , vr }) = V.
Example
Consider the vector space P2 of degree 2 polynomials.
2
Example
Consider the vector space P2 of degree 2 polynomials.
Another basis for this space is given by {1 + x, x, x
x+x
x} .
Example
Consider the vector space P2 of degree 2 polynomials.
Another basis for this space is given by {1 + x, x, x
x) = 0 .
c)x + c x2 = 0 .
c = 0, c = 0
a = 0, b = 0, c = 0
x} .
Example
Consider the vector space of 2-by-3 matrices with real
entries.
A basis for this space is given by the matrices
1 0 0
0 1 0
0 0 1
,
,
,
0 0 0
0 0 0
0 0 0
0
1
0
0
0
0 0 0
0 0 0
,
,
.
0
0 1 0
0 0 1
Construction of a basis
Theorem: Every finite-dimensional vector space V has a
finite basis.
Proof: Let v1 , . . . , vr be such that span({v1 , . . . , vr }) = V .
1 vi 1
+ ai+1 vi+1 + . . . + ar vr
Construction of a basis
Theorem: Every finite-dimensional vector space V has a
finite basis.
Proof:
Otherwise, some vi can be expressed as a linear
combination of the others.
vi = a1 v 1 + . . . + ai
1 vi 1
+ ai+1 vi+1 + . . . + ar vr
This means
span({v1 , . . . , vr }) = span({v1 , . . . , vi
1 , vi+1 , . . . , vr })
Construction of a basis
Theorem: Every finite-dimensional vector space V has a
finite basis.
Proof:
Coordinates
We discussed the coordinates of a vector with respect to
a given basis in Euclidean space.
Example:
Let B = {(1, 0, 0), (1, 1, 0), (1, 1, 1)} be a basis for R3 .
(0, 1, 1) = 1 (1, 0, 0) + ( 2) (1, 1, 0) + 1 (1, 1, 1)
Coordinates
We can do the same thing in a general finite-dimensional
vector space V .
Fix some basis v1 , . . . , vr for V . We have already seen
such a basis exists.
Every vector u 2 V can be written as a unique linear
combination of the basis vectors v1 , . . . , vr .
u = a1 v1 + + ar vr
Example
Consider the vector space P2 of degree 2 polynomials.
2
{1
+
x,
x,
x
A basis for this space is given by
2
x} .
x = 0 (1 + x) + 1 x + 1 (x
x).
Coordinate Mapping
Fix some basis v1 , . . . , vr for V .
If
u = a1 v1 + + ar vr
Coordinate Mapping
The basis B = {v1 , . . . , vr } defines a mapping
coordB : V ! R
Coordinate Mapping
The basis B = {v1 , . . . , vr } defines a mapping
coordB : V ! R
Coordinate Mapping
The basis B = {v1 , . . . , vr } defines a mapping
coordB : V ! R
for any c 2 R
If u = a1 v1 + + ar vr then c u = c(a1 v1 + + ar vr )
= ca1 v1 + + car vr
Example
Consider the vector space P2 of degree 2 polynomials.
2
2x + 5x ) = (3, 2, 5)
2
coordB ( 1 + x + x ) = ( 1, 1, 1)
(3
2x + 5x2 ) + ( 1 + x + x2 ) = 2
x + 6x2
(3, 2, 5) + ( 1 + 1 + 1) = (2, 1, 6)
3
P
Adding polynomials in 2 is just like adding vectors in R .
Isomorphism
Let V and W be two vector spaces. A function f : V ! W
is an isomorphism if
f is a bijection between V and W .
f (u + v) = f (u) + f (v) for all u, v 2 V
f (c v) = c f (v) for all c 2 R, v 2 V
Two spaces are isomorphic if there is an isomorphism
between them.
Isomorphic spaces are essentially the same.
Linear combinations
Let V and W be two vector spaces. If f : V ! W is
an isomorphism then
f (c1 v1 + c2 v2 + + cr vr ) = c1 f (v1 ) + c2 f (v2 ) + + cr f (vr )
Coordinate Mapping
The basis B = {v1 , . . . , vr } defines a mapping
coordB : V ! R
for any c 2 R
Consequences
Example: The vector space P2 of polynomials of degree 2
3
is isomorphic to R .
An isomorphism is given by the coordinate mapping with
2
{1,
x,
x
}.
respect to the basis
The coordinate mapping lets us transfer questions about
a general finite-dimensional vector space to questions about
Euclidean space.
We are already familiar with Euclidean space, and know how
to answer the questions there!
Consequences
Theorem: Let V be a vector space with zero element 0 and
basis B = {v1 , . . . , vr } . Then
r
coordB (0) = 0 2 R
Proof:
Linear Independence
Theorem: Let V be a finite-dimensional vector space and fix
a basis B = {v1 , . . . , vr } for V . Then vectors u1 , . . . , uk 2 V
are linearly dependent if and only if
coordB (u1 ), . . . , coordB (uk ) 2 R
c1 u1 + ck uk = 0 where some ci 6= 0 .
coordB (0) = 0
Proof:
Suppose coordB (u1 ), . . . , coordB (uk ) are lin. dependent.
0 = c1 coordB (u1 ) + + ck coordB (uk )
= coordB (c1 u1 ) + + coordB (ck uk )
= coordB (c1 u1 + + ck uk )
coord
(0)
=
0
coord
:
V
!
R
We know that
and as
is
B
B
c 1 u1 + + c k uk = 0
Comment
Notice that in the last proof we only used the fact that coordB
is an isomorphism.
We did not use any specific details about the action of coordB
Span
Theorem: Let V be a finite-dimensional vector space and fix
a basis B = {v1 , . . . , vr } for V . Then v 2 span({u1 , . . . , uk })
if and only if
coordB (v) 2 span({coordB (u1 ), . . . , coordB (uk )}),
for any v, u1 , . . . , uk 2 V .
Proof: If v 2 span({u1 , . . . , uk }) then v = c1 u1 + . . . + ck uk
coordB (v) = coordB (c1 u1 + + ck uk )
Span
Theorem: Let V be a finite-dimensional vector space and fix
a basis B = {v1 , . . . , vr } for V . Then v 2 span({u1 , . . . , uk })
if and only if
coordB (v) 2 span({coordB (u1 ), . . . , coordB (uk )}),
for any v, u1 , . . . , uk 2 V .
Proof: If coordB (v) 2 span({coordB (u1 ), . . . , coordB (uk )})
coordB (v) = c1 coordB (u1 ) + + ck coordB (uk )
= coordB (c1 u1 + + ck uk )
Dimension Theorem
Theorem: Let V be a finite dimensional vector space and
let B1 = {u1 , . . . , ur } and B2 = {v1 , . . . , vs } be two bases
for V . Then r = s .
Proof: Suppose that r < s. From the dimension theorem
in Euclidean space we know that the largest linearly
independent set in Rr is of size r .
Consider coordB1 : V ! Rr . As v1 , . . . , vs are linearly
independent, so are
coordB1 (v1 ), . . . , coordB1 (vs ) 2 Rr.
Dimension Theorem
Theorem: Let V be a finite dimensional vector space and
let B1 = {u1 , . . . , ur } and B2 = {v1 , . . . , vs } be two bases
for V . Then r = s .
Dimension
Definition: Let V be a finite-dimensional vector space. The
dimension of V is the number of elements in a basis for V.
Example: Polynomials
Consider Pn the vector space of polynomials of degree
at most n.
2
n
{1,
x,
x
,
.
.
.
,
x
}.
A basis is given by
The dimension of Pn is n + 1 .
Example: Matrices
Let M (m, n) be the vector space of m-by-n matrices
with real entries.
A basis for this space is given by the matrices
Eij (k, `) =
1
0
if k = i, ` = j
otherwise
where 1 i m, 1 j n.
In total, there are mn elements in this basis.
The dimension of M (m, n) is mn.
Subspaces
Theorem: Let V be a vector space of dimension r with a
basis B = {v1 , . . . , vr }, and let U V. If
r
{coord
(u)
:
u
2
U
}
R
S=
B
Subspaces
Theorem: Let V be a vector space of dimension r with a
basis B = {v1 , . . . , vr }, and let U V. If
r
{coord
(u)
:
u
2
U
}
R
S=
B
Subspaces
Theorem: Let V be a vector space of dimension r with a
basis B = {v1 , . . . , vr }, and let U V. If
r
{coord
(u)
:
u
2
U
}
R
S=
B
Example
Consider the vector space M (2, 2) of 2-by-2 matrices.
Let
S=
a11
a21
a12
: a11 + a22 = 0
a22
a11
a21
a12
: a11 + a22 = 0
a22
Note that
coordE
1
0
0
0 1
0
,
,
0
0 0
1
a11
a12
a12
a22
0
0
,
0
0
0
1
S=
a11
a21
a12
: a11 + a22 = 0
a22
Example continued
Consider the vector space M (2, 2) of 2-by-2 matrices.
Let
S=
a11
a21
a12
: a11 + a22 = 0
a22
1
0
0
1
= ( 1, 0, 0, 1)
coordE
0
1
0
0
coordE
= (0, 0, 1, 0)
0
0
1
0
= (0, 1, 0, 0)
The matrices
1
0
0
0
,
1
0
1
0 0
,
S
form
a
basis
for
.
0
1 0