4.1 Vector Spaces and Subspaces

Download as pdf or txt
Download as pdf or txt
You are on page 1of 28

4 Vector Spaces

4.1 VECTOR SPACES AND SUBSPACES

Vector Space
Geometric Representation of :

a+b
a

b
Algebraic Representation of :
Let S be the space of all vectors of the form (2a, 0, a) in R3 :

S = {(2a, 0, a) | a in R}.
The set of all polynomials of degree at most n is a vector space
denoted by Pn . In other words, Pn consists of all polynomials of the form

an xn + an−1 xn−1 + · · · + a1 x + a0 ,

with real-valued coefficients.


Subspace

Fact

If S1 and S2 are two vector spaces with S1 ⊆ S2 , then S1 is a subspace of S2 .

The vector space S = {(2a, 0, a) | a in R} is subspace of R3 .

The set of all polynomials with the zero constant, a0 = 0, is a


subspace of Pn .
Example 7: Let H be the set of all vectors of the form

v = (4a + 5b, a − 2b, b, 3a)

where a and b are arbitrary scalars. Show that H is a subspace of R4 .


Example 8: For what value(s) of h will y be in the subspace of R3 spanned
by v1, v2, v3, if
       
1 5 −3 −4
v1 = −1, v2 = −4, v3 =  1 , and y =  3 .
−2 −7 0 h
4.2 NULL SPACES, COLUMN SPACES, AND LINEAR TRANS-
FORMATIONS

Null Space

Theorem

The null space of an m × n matrix A, is a subspace of Rn .


Example 1: Find a spanning set for the null space of the matrix
 
1 2 −1 0
A= 2 0 0 1 
−1 1 3 −3
Column Space

Theorem

The column space of an m × n matrix A, is a subspace of Rm .

Fact

The column space of an m × n matrix A is all of Rm if and only if the equation


Ax = b has a solution for each b in Rm .
Nul A vs Col A:

If A is an m × n matrix, then:
Linear Transformation

Kernel and Range

The kernel (or null space) of a linear transformation T : V → W is the set


of all u in V such that T u = 0.

The range of T is the set of all vectors b in W such that T x = b for some x
in V .

Example 2: Let V be the vector space of all polynomials of degree at most 1


defined on the interval [0, 1]. Define the transformation T : V → R as

Z 1
T (p(x)) = p(x) dx.
0

Show that T is a linear transformation and compute the kernel and the range
of T .
4.3 LINEARLY INDEPENDENT SETS; BASES
Linearly Independent Set

An indexed set of vectors {v1 , v2 , . . . , vk } in V is said to be linearly indepen-


dent if the vector equation

c1 v1 + c2 v2 + · · · + ck vk = 0 (1)

has only the trivial solution, c1 = c2 = · · · = ck = 0.

The set {v1 , . . . , vk } is said to be linearly dependent if (1) has a nontrivial


solution, that is, if there are some weights, c1 , c2 , . . . , ck , not all zero, such
that (1) holds.

Facts

1. Just as in Rn , a set containing a single vector v is linearly independent


dependent if
and only if v = 0.

2. A set of two vectors is linearly dependent if and only if one of the vectors
is a multiple of the other.

3. Any set containing the zero vector is linearly dependent.

Theorem
Example 1: The set {sin t, cos t} is a linearly independent set in the vector
space C[0, 2π].

Example 2: The set {sin 2t, sin t cos t} is linearly dependent in the vector
space C[0, 2π].

Example 3: Is the set {1, t, 3 − 5t} linearly independent in the vector space
C[0, 1]?

Example 4: Is the set {1, t, t2 } linearly independent in the vector space


C[0, 1]?
Basis

Example 5: If A is an n × n invertible matrix, the columns of A form a basis


for Rn . The standard basis for Rn is the columns of the identity matrix In :
 
1 0 0 ... 0
0 1 0 ... 0
 
In = 0 0 1 ... 0 .

 .. .. .. .. .. 
. . . . .
1 0 0 ... 1

Example 6: The standard basis for Pn is

B = {1, x, x2 , . . . , xn }.
Theorem

Theorem

The pivot columns of A form a basis for the Col A.

Example 7:


1 2 0 −4

0
0 0 0 0 0
 
A=
0 0 −1 2 0 

0 0 0 0 5
0 0 0 0 1
Remark

You might also like