0% found this document useful (0 votes)
109 views16 pages

Basic of Vector Space

The document discusses bases and dimensions of vector spaces. It defines what a basis is, provides examples of bases, and proves theorems about the properties of bases and dimensions. The document also discusses how to find a basis for a given vector space.

Uploaded by

Trọng Hiếu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
109 views16 pages

Basic of Vector Space

The document discusses bases and dimensions of vector spaces. It defines what a basis is, provides examples of bases, and proves theorems about the properties of bases and dimensions. The document also discusses how to find a basis for a given vector space.

Uploaded by

Trọng Hiếu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

MATH 304

Linear Algebra
Lecture 16:
Basis and dimension.
Basis

Definition. Let V be a vector space. A linearly


independent spanning set for V is called a basis.

Equivalently, a subset S V is a basis for V if any


vector v V is uniquely represented as a linear
combination
v = r1 v1 + r2 v2 + + rk vk ,
where v1 , . . . , vk are distinct vectors from S and
r1 , . . . , rk R.
Examples. Standard basis for Rn :
e1 = (1, 0, 0, . . . , 0, 0), e2 = (0, 1, 0, . . . , 0, 0),. . . ,
en = (0, 0, 0, . . . , 0, 1).
       
1 0 0 1 0 0 0 0
Matrices , , ,
0 0 0 0 1 0 0 1
form a basis for M2,2 (R).

Polynomials 1, x, x 2 , . . . , x n1 form a basis for


Pn = {a0 + a1 x + + an1 x n1 : ai R}.

The infinite set {1, x, x 2 , . . . , x n , . . . } is a basis


for P, the space of all polynomials.
Bases for Rn

Theorem Every basis for the vector space Rn


consists of n vectors.

Theorem For any vectors v1 , v2 , . . . , vn Rn the


following conditions are equivalent:
(i) {v1 , v2 , . . . , vn } is a basis for Rn ;
(ii) {v1 , v2 , . . . , vn } is a spanning set for Rn ;
(iii) {v1 , v2 , . . . , vn } is a linearly independent set.
Dimension

Theorem Any vector space V has a basis. All


bases for V are of the same cardinality.
Definition. The dimension of a vector space V ,
denoted dim V , is the cardinality of its bases.

Remark. By definition, two sets are of the same cardinality if


there exists a one-to-one correspondence between their elements.
For a finite set, the cardinality is the number of its elements.
For an infinite set, the cardinality is a more sophisticated
notion. For example, Z and R are infinite sets of different
cardinalities while Z and Q are infinite sets of the same
cardinality.
Examples. dim Rn = n
M2,2 (R): the space of 22 matrices
dim M2,2 (R) = 4
Mm,n (R): the space of mn matrices
dim Mm,n (R) = mn
Pn : polynomials of degree less than n
dim Pn = n
P: the space of all polynomials
dim P =
{0}: the trivial vector space
dim {0} = 0
Problem. Find the dimension of the plane
x + 2z = 0 in R3 .
The general solution of the equation x + 2z = 0 is

x = 2s
y =t (t, s R)
z =s

That is, (x, y , z) = (2s, t, s) = t(0, 1, 0) + s(2, 0, 1).


Hence the plane is the span of vectors v1 = (0, 1, 0)
and v2 = (2, 0, 1). These vectors are linearly
independent as they are not parallel.
Thus {v1 , v2 } is a basis so that the dimension of
the plane is 2.
How to find a basis?

Theorem Let S be a subset of a vector space V .


Then the following conditions are equivalent:
(i) S is a linearly independent spanning set for V ,
i.e., a basis;
(ii) S is a minimal spanning set for V ;
(iii) S is a maximal linearly independent subset of V .
Minimal spanning set means remove any element from this
set, and it is no longer a spanning set.
Maximal linearly independent subset means add any
element of V to this set, and it will become linearly
dependent.
Theorem Let V be a vector space. Then
(i) any spanning set for V can be reduced to a
minimal spanning set;
(ii) any linearly independent subset of V can be
extended to a maximal linearly independent set.
Equivalently, any spanning set contains a basis,
while any linearly independent set is contained in a
basis.

Corollary A vector space is finite-dimensional if


and only if it is spanned by a finite set.
How to find a basis?

Approach 1. Get a spanning set for the vector


space, then reduce this set to a basis.

Proposition Let v0 , v1 , . . . , vk be a spanning set


for a vector space V . If v0 is a linear combination
of vectors v1 , . . . , vk then v1 , . . . , vk is also a
spanning set for V .
Indeed, if v0 = r1 v1 + + rk vk , then
t0 v0 + t1 v1 + + tk vk =
= (t0 r1 + t1 )v1 + + (t0 rk + tk )vk .
How to find a basis?

Approach 2. Build a maximal linearly independent


set adding one vector at a time.

If the vector space V is trivial, it has the empty basis.


If V 6= {0}, pick any vector v1 6= 0.
If v1 spans V , it is a basis. Otherwise pick any
vector v2 V that is not in the span of v1 .
If v1 and v2 span V , they constitute a basis.
Otherwise pick any vector v3 V that is not in the
span of v1 and v2 .
And so on. . .
Problem. Find a basis for the vector space V
spanned by vectors w1 = (1, 1, 0), w2 = (0, 1, 1),
w3 = (2, 3, 1), and w4 = (1, 1, 1).
To pare this spanning set, we need to find a relation
of the form r1 w1 +r2 w2 +r3 w3 +r4 w4 = 0, where
ri R are not all equal to zero. Equivalently,

r1
1 0 2 1 0
r2
1 1 3 1 = 0 .
r3
0 1 1 1 r4 0

To solve this system of linear equations for


r1 , r2 , r3 , r4 , we apply row reduction.

1 0 2 1 1 0 2 1 1 0 2 1
1 1 3 1 0 1 1 0 0 1 1 0
0 1 1 1 0 1 1 1 0 0 0 1

1 0 2 0
0 1 1 0 (reduced row echelon form)
0 0 0 1

r1 + 2r3 = 0 r1 = 2r3
r + r3 = 0 r = r3
2 2
r4 = 0 r4 = 0
General solution: (r1 , r2 , r3 , r4 )=(2t, t, t, 0), t R.
Particular solution: (r1 , r2 , r3 , r4 ) = (2, 1, 1, 0).
Problem. Find a basis for the vector space V
spanned by vectors w1 = (1, 1, 0), w2 = (0, 1, 1),
w3 = (2, 3, 1), and w4 = (1, 1, 1).
We have obtained that 2w1 + w2 w3 = 0.
Hence any of vectors w1 , w2 , w3 can be dropped.
For instance, V = Span(w1 , w2 , w4 ).
Let us check whether vectors w1 , w2 , w4 are
linearly independent:

1 0 1 1 0 1
1 1
1 1 1 = 1 1 0 =
0 1 = 1 6= 0.


0 1 1 0 1 0
They are!!! It follows that V = R3 and
{w1 , w2 , w4 } is a basis for V .
Vectors v1 = (0, 1, 0) and v2 = (2, 0, 1) are
linearly independent.
Problem. Extend the set {v1 , v2 } to a basis for R3 .
Our task is to find a vector v3 that is not a linear
combination of v1 and v2 .
Then {v1 , v2 , v3 } will be a basis for R3 .
Hint 1. v1 and v2 span the plane x + 2z = 0.
The vector v3 = (1, 1, 1) does not lie in the plane
x + 2z = 0, hence it is not a linear combination of
v1 and v2 . Thus {v1 , v2 , v3 } is a basis for R3 .
Vectors v1 = (0, 1, 0) and v2 = (2, 0, 1) are
linearly independent.
Problem. Extend the set {v1 , v2 } to a basis for R3 .
Our task is to find a vector v3 that is not a linear
combination of v1 and v2 .
Hint 2. At least one of vectors e1 = (1, 0, 0),
e2 = (0, 1, 0), and e3 = (0, 0, 1) is a desired one.
Let us check that {v1 , v2 , e1 } and {v1 , v2 , e3 } are
two bases for R3 :

0 2 1 0 2 0

1 0 0 = 1 6= 0, 1 0 0 = 2 6= 0.

0 1 0 0 1 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy