CHAPTER 4�VECTOR SPACES
4.1 VECTORS IN RN
4.2 VECTOR SPACES
4.3 SUBSPACES OF VECTOR SPACES
4.4 SPANNING SETS AND LINEAR INDEPENDENCE
4.5 BASIS AND DIMENSION
4.6 RANK OF A MATRIX AND SYSTEMS OF LINEAR EQUATIONS
4.7 COORDINATES AND CHANGE OF BASIS
4.8 APPLICATIONS OF VECTOR SPACES
Elementary Linear Algebra
R. Larson (8 Edition)
投影片設計製作者
淡江大學 電機系 翁慶昌 教授
CH 4 Linear Algebra Applied
Force (p.157) Image Morphing (p.180)
Digital Sampling (p.172)
Crystallography (p.207) Satellite Dish (p.217)
2/136
4.1 Vectors in Rn
a sequence of n real number
the set of all ordered n-tuple
Elementary Linear Algebra: Section 4.1, p.155
3/136
n = 4
= set of all ordered quadruple of real numbers
R4 = 4-space
R1 = 1-space
= set of all real number
n = 1
n = 2
R2 = 2-space
= set of all ordered pair of real numbers
n = 3
R3 = 3-space
= set of all ordered triple of real numbers
Elementary Linear Algebra: Section 4.1, p.155
4/136
a point
a vector
(1) An n-tuple can be viewed as a point in Rn with the xi’s as its coordinates.
(2) An n-tuple can be viewed as a vector
in Rn with the xi’s as its components.
Elementary Linear Algebra: Section 4.1, p.152
5/136
(two vectors in Rn)
if and only if
in Rn are called the standard operations in Rn.
Elementary Linear Algebra: Section 4.1, p.153
6/136
(1) The zero vector 0 in Rn is called the additive identity in Rn.
(2) The vector –v is called the additive inverse of v.
Elementary Linear Algebra: Section 4.1, p.155
7/136
Let u, v, and w be vectors in Rn , and let c and d be scalars.
(1) u+v is a vector in Rn
(2) u+v = v+u
(3) (u+v)+w = u+(v+w)
(4) u+0 = u
(5) u+(–u) = 0
(6) cu is a vector in Rn
(7) c(u+v) = cu+cv
(8) (c+d)u = cu+du
(9) c(du) = (cd)u
(10) 1(u) = u
Elementary Linear Algebra: Section 4.1, p.156
8/136
Sol: (a)
Let u=(2, – 1, 5, 0), v=(4, 3, 1, – 1), and w=(– 6, 2, 0, 3) be vectors in R4. Solve x for x in each of the following.
(a) x = 2u – (v + 3w)
(b) 3(x+w) = 2u – v+x
Elementary Linear Algebra: Section 4.1, p.156
9/136
(b)
Elementary Linear Algebra: Section 4.1, p.156
10/136
Let v be a vector in Rn and c be a scalar. Then the following is true.
(1) The additive identity is unique. That is, if u+v=v, then u = 0
(2) The additive inverse of v is unique. That is, if v+u=0, then u = –v
(3) 0v=0
(4) c0=0
(5) If cv=0, then c=0 or v=0
(6) –(– v) = v
Elementary Linear Algebra: Section 4.1, p.157
11/136
Given x = (– 1, – 2, – 2), u = (0,1,4), v = (– 1,1,2), and
w = (3,1,2) in R3, find a, b, and c such that x = au+bv+cw.
Sol:
The vector x is called a linear combination of ,
if it can be expressed in the form
Elementary Linear Algebra: Section 4.1, p.158
12/136
A vector in can be viewed as:
(The matrix operations of addition and scalar multiplication
give the same results as the corresponding vector operations)
or
a n×1 column matrix (column vector):
a 1×n row matrix (row vector):
Elementary Linear Algebra: Section 4.1, p.158
13/136
Vector addition
Scalar multiplication
Elementary Linear Algebra: Section 4.1, p.158
14/136
Key Learning in Section 4.1
15/136
Keywords in Section 4.1
16/136
4.2 Vector Spaces
Let V be a set on which two operations (vector addition and scalar multiplication) are defined. If the following axioms are satisfied for every u, v, and w in V and every scalar (real number) c and d, then V is called a vector space.
Addition:
(1) u + v is in V
(2) u + v = v + u
(3) u + (v + w) = (u + v) + w
(4) V has a zero vector 0 such that for every u in V, u + 0 = u
(5) For every u in V, there is a vector in V denoted by –u
such that u + (–u) = 0
Elementary Linear Algebra: Section 4.2, p.161
17/136
Scalar multiplication:
(6) is in V.
(7)
(8)
(9)
(10)
Elementary Linear Algebra: Section 4.2, p.161
18/136
(1) A vector space consists of four entities:
(2)
zero vector space
V:nonempty set
c:scalar
vector addition
scalar multiplication
is called a vector space
a set of vectors, a set of scalars, and two operations
Elementary Linear Algebra: Section 4.2, Addition
19/136
20/136
21/136
(1) n-tuple space: Rn
(2) Matrix space: (the set of all m×n matrices with real values)
Ex: :(m = n = 2)
vector addition
scalar multiplication
vector addition
scalar multiplication
Elementary Linear Algebra: Section 4.2, Addition
22/136
(3) n-th degree polynomial space:
(the set of all real polynomials of degree n or less)
(4) Function space: (the set of all real-valued
continuous functions defined on the entire real line.)
Elementary Linear Algebra: Section 4.2, Addition
23/136
Let v be any element of a vector space V, and let c be any
scalar. Then the following properties are true.
Elementary Linear Algebra: Section 4.2, p.164
24/136
only find one axiom that is not satisfied.
Pf: Let and
(it is not closed under vector addition)
(it is not closed under scalar multiplication)
scalar
Pf:
integer
noninteger
Elementary Linear Algebra: Section 4.2, p.165
25/136
V=R2=the set of all ordered pairs of real numbers
vector addition:
scalar multiplication:
the set (together with the two given operations) is
not a vector space
Verify V is not a vector space.
Sol:
Elementary Linear Algebra: Section 4.2, p.165
26/136
Key Learning in Section 4.2
27/136
Keywords in Section 4.2:
28/136
4.3 Subspaces of Vector Spaces
: a vector space
: a nonempty subset
:a vector space (under the operations of addition and
scalar multiplication defined in V)
W is a subspace of V
Every vector space V has at least two subspaces.
(1) Zero vector space {0} is a subspace of V.
(2) V is a subspace of V.
Elementary Linear Algebra: Section 4.3, p.168
29/136
If W is a nonempty subset of a vector space V, then W is
a subspace of V if and only if the following conditions hold.
(1) If u and v are in W, then u+v is in W.
(2) If u is in W and c is any scalar, then cu is in W.
Elementary Linear Algebra: Section 4.3, p.168
30/136
Elementary Linear Algebra: Section 4.3, p.168
31/136
Let W be the set of all 2×2 symmetric matrices. Show that
W is a subspace of the vector space M2×2, with the standard
operations of matrix addition and scalar multiplication.
Sol:
Elementary Linear Algebra: Section 4.3, p.169
32/136
Let W be the set of singular matrices of order 2. Show that
W is not a subspace of M2×2 with the standard operations.
Sol:
Elementary Linear Algebra: Section 4.3, p.169
33/136
Show that , with the standard
operations, is not a subspace of R2.
Sol:
(not closed under scalar
multiplication)
Elementary Linear Algebra: Section 4.3, p.170
34/136
Which of the following two subsets is a subspace of R2?
(a) The set of points on the line given by x+2y=0.
(b) The set of points on the line given by x+2y=1.
Sol:
(closed under addition)
(closed under scalar multiplication)
Elementary Linear Algebra: Section 4.3, p.171
35/136
(b)
(Note: the zero vector is not on the line)
Elementary Linear Algebra: Section 4.3, p.171
36/136
Sol:
Elementary Linear Algebra: Section 4.3, p.172
37/136
Elementary Linear Algebra: Section 4.3, p.170
38/136
Key Learning in Section 4.3
39/136
Keywords in Section 4.3:
40/136
4.4 Spanning Sets and Linear Independence
Elementary Linear Algebra: Section 4.4, p.175
41/136
Sol:
Elementary Linear Algebra: Section 4.4, p.176
42/136
(this system has infinitely many solutions)
Elementary Linear Algebra: Section 4.4, p.176
43/136
Elementary Linear Algebra: Section 4.4, p.176
44/136
If S ={v1, v2,…, vk} is a set of vectors in a vector space V, then the span of S is the set of all linear combinations of the vectors in S,
If every vector in a given vector space can be written as a linear combination of vectors in a given set S, then S is called a spanning set of the vector space.
Elementary Linear Algebra: Section 4.4, p.177
45/136
Elementary Linear Algebra: Section 4.4, p.177
46/136
Sol:
Elementary Linear Algebra: Section 4.4, p.177
47/136
Elementary Linear Algebra: Section 4.4, p.177
48/136
If S={v1, v2,…, vk} is a set of vectors in a vector space V,
then
(Every other subspace of V that contains S must contain span (S).)
Elementary Linear Algebra: Section 4.4, p.178
49/136
: a set of vectors in a vector space V
Elementary Linear Algebra: Section 4.4, p.179
50/136
Elementary Linear Algebra: Section 4.4, p.179
51/136
Sol:
Determine whether the following set of vectors in R3 is L.I. or L.D.
Elementary Linear Algebra: Section 4.4, p.180
v1 v2 v3
52/136
Determine whether the following set of vectors in P2 is L.I. or L.D.
S = {1+x – 2x2 , 2+5x – x2 , x+x2}
c1v1+c2v2+c3v3 = 0
i.e.
c1(1+x – 2x2) + c2(2+5x – x2) + c3(x+x2) = 0+0x+0x2
⇒
c1+2c2 = 0
c1+5c2+c3 = 0
–2c1 – c2+c3 = 0
v1 v2 v3
Sol:
⇒ This system has infinitely many solutions.
(i.e., This system has nontrivial solutions.)
⇒ S is linearly dependent.
(Ex: c1=2 , c2= – 1 , c3=3)
⇒
Elementary Linear Algebra: Section 4.4, p.181
53/136
Determine whether the following set of vectors in 2×2
matrix space is L.I. or L.D.
Sol:
c1v1+c2v2+c3v3 = 0
v1 v2 v3
Elementary Linear Algebra: Section 4.4, p.181
54/136
(This system has only the trivial solution.)
c1 = c2 = c3= 0
⇒
S is linearly independent.
⇒
⇒
2c1+3c2+ c3 = 0
c1 = 0
2c2+2c3 = 0
c1+ c2 = 0
⇒
Elementary Linear Algebra: Section 4.4, p.181
55/136
A set S = {v1,v2,…,vk}, k≥2, is linearly independent if and
only if at least one of the vectors vj in S can be written as
a linear combination of the other vectors in S.
⇒ ci ≠ 0 for some i
(⇒)
c1v1+c2v2+…+ckvk = 0
Pf:
Elementary Linear Algebra: Section 4.4, p.182
56/136
Let
(nontrivial solution)
S is linearly dependent
Two vectors u and v in a vector space V are linearly dependent
if and only if one is a scalar multiple of the other.
vi = d1v1+…+di-1vi-1+di+1vi+1+…+dkvk
⇒ d1v1+…+di-1vi-1-vi+di+1vi+1+…+dkvk = 0
⇒ c1=d1, …,ci-1=di-1, ci=-1,ci+1=di+1,…, ck=dk
Elementary Linear Algebra: Section 4.4, p.182-183
57/136
Key Learning in Section 4.4
58/136
Keywords in Section 4.4:
59/136
4.5 Basis and Dimension
V:a vector space
S spans V (i.e., span(S) = V )
S is linearly independent
Generating
Sets
Bases
Linearly
Independent
Sets
⇒ S is called a basis for V
(1) Ø is a basis for {0}
(2) the standard basis for R3:
{i, j, k} i = (1, 0, 0), j = (0, 1, 0), k = (0, 0, 1)
S ={v1, v2, …, vn}⊆V
Elementary Linear Algebra: Section 4.5, p.186
60/136
(3) the standard basis for Rn :
{e1, e2, …, en} e1= (1,0,…,0), e2= (0,1,…,0), en= (0,0,…,1)
Ex: R4
{(1,0,0,0), (0,1,0,0), (0,0,1,0), (0,0,0,1)}
Ex: matrix space:
(4) the standard basis for m×n matrix space:
{ Eij | 1 ≤ i ≤ m , 1 ≤ j ≤ n }
(5) the standard basis for Pn(x):
{1, x, x2, …, xn}
Ex: P3(x)
{1, x, x2, x3}
Elementary Linear Algebra: Section 4.5, p.186
61/136
If is a basis for a vector space V, then every
vector in V can be written in one and only one way as a linear
combination of vectors in S.
Pf:
span(S) = V
Let
v = c1v1+c2v2+…+cnvn
v = b1v1+b2v2+…+bnvn
⇒ 0 = (c1–b1)v1+(c2 – b2)v2+…+(cn – bn)vn
(i.e., uniqueness)
⇒ c1= b1 , c2= b2 ,…, cn= bn
Elementary Linear Algebra: Section 4.5, p.188
62/136
If is a basis for a vector space V, then every
set containing more than n vectors in V is linearly dependent.
Pf:
S1 = {u1, u2, …, um} , m > n
Let
ui∈V
Elementary Linear Algebra: Section 4.5, p.189
63/136
⇒ di= 0 ∀i
i.e.
Let
k1u1+k2u2+…+kmum= 0
(where di = ci1k1+ci2k2+…+cimkm)
⇒ d1v1+d2v2+…+dnvn= 0
Thm 1.1: If the homogeneous system has fewer equations than variables, then it must have infinitely many solution.
m > n ⇒ k1u1+k2u2+…+kmum = 0 has nontrivial solution
⇒ S1 is linearly dependent
Elementary Linear Algebra: Section 4.5, p.189
64/136
If a vector space V has one basis with n vectors, then every
basis for V has n vectors. (All bases for a finite-dimensional
vector space has the same number of vectors.)
Pf:
S ={v1, v2, …, vn}
S'={u1, u2, …, um}
two bases for a vector space
Elementary Linear Algebra: Section 4.5, p.190
65/136
A vector space V is called finite dimensional,
if it has a basis consisting of a finite number of elements.
If a vector space V is not finite dimensional,
then it is called infinite dimensional.
The dimension of a finite dimensional vector space V is
defined to be the number of vectors in a basis for V.
V: a vector space
S: a basis for V
⇒ dim(V) = #(S)
(the number of vectors in S)
Elementary Linear Algebra: Section 4.5, p.191
66/136
(1) dim({0}) = 0 = #(Ø)
(2) dim(V) = n , S⊆V
S:a generating set ⇒ #(S) ≥ n
S:a L.I. set ⇒ #(S) ≤ n
S:a basis ⇒ #(S) = n
(3) dim(V) = n , W is a subspace of V ⇒ dim(W) ≤ n
Generating
Sets
Bases
Linearly
Independent
Sets
#(S) > n
#(S) = n
#(S) < n
dim(V) = n
Elementary Linear Algebra: Section 4.5, Addition
67/136
(1) Vector space Rn ⇒ basis {e1 , e2 , … , en}
(2) Vector space Mm×n ⇒ basis {Eij | 1≤i≤m , 1≤j≤n}
(3) Vector space Pn(x) ⇒ basis {1, x, x2, … , xn}
(4) Vector space P(x) ⇒ basis {1, x, x2, …}
⇒ dim(Rn) = n
⇒ dim(Mm×n)=mn
⇒ dim(Pn(x)) = n+1
⇒ dim(P(x)) = ∞
Elementary Linear Algebra: Section 4.5, Addition
68/136
(a) W={(d, c–d, c): c and d are real numbers}
(b) W={(2b, b, 0): b is a real number}
Sol:
(Note: Find a set of L.I. vectors that spans the subspace)
(a)
(d, c– d, c) = c(0, 1, 1) + d(1, – 1, 0)
⇒ S = {(0, 1, 1) , (1, – 1, 0)}
(S is L.I. and S spans W)
⇒ S is a basis for W
⇒ dim(W) = #(S) = 2
⇒ S = {(2, 1, 0)} spans W and S is L.I.
⇒ S is a basis for W
⇒ dim(W) = #(S) = 1
(b)
Elementary Linear Algebra: Section 4.5, p.191
69/136
Let W be the subspace of all symmetric matrices in M2×2.
What is the dimension of W?
Sol:
spans W and S is L.I.
⇒ S is a basis for W
⇒ dim(W) = #(S) = 3
Elementary Linear Algebra: Section 4.5, p.192
70/136
Let V be a vector space of dimension n.
(1) If is a linearly independent set of
vectors in V, then S is a basis for V.
(2) If spans V, then S is a basis for V.
Generating
Sets
Bases
Linearly
Independent
Sets
dim(V) = n
#(S) > n
#(S) = n
#(S) < n
Elementary Linear Algebra: Section 4.5, p.192
71/136
Key Learning in Section 4.5
72/136
Keywords in Section 4.5
73/136
4.6 Rank of a Matrix and Systems of Linear Equations
Row vectors of A
Column vectors of A
|| || ||
A(1) A(2) A(n)
Elementary Linear Algebra: Section 4.6, p.195
74/136
Let A be an m×n matrix.
The row space of A is the subspace of Rn spanned by
the row vectors of A.
The column space of A is the subspace of Rm spanned by
the column vectors of A.
The null space of A is the set of all solutions of Ax=0 and
it is a subspace of Rn.
Elementary Linear Algebra: Section 4.6, p.195
75/136
(1) The row space of a matrix is not changed by elementary
row operations.
RS(r(A)) = RS(A) r: elementary row operations
(2) Elementary row operations can change the column space.
If an m×n matrix A is row equivalent to an m×n matrix B,
then the row space of A is equal to the row space of B.
Elementary Linear Algebra: Section 4.6, p.196
76/136
If a matrix A is row equivalent to a matrix B in row-echelon
form, then the nonzero row vectors of B form a basis for the
row space of A.
Elementary Linear Algebra: Section 4.6, p.196
77/136
Find a basis of row space of A =
Sol:
A=
B =
Elementary Linear Algebra: Section 4.6, p.196
78/136
a basis for RS(A) = {the nonzero row vectors of B} (Thm 4.14)
= {w1, w2, w3} = {(1, 3, 1, 3), (0, 1, 1, 0), (0, 0, 0, 1)}
Elementary Linear Algebra: Section 4.6, p.196
79/136
Find a basis for the subspace of R3 spanned by
Sol:
a basis for span({v1, v2, v3})
= a basis for RS(A)
= {the nonzero row vectors of B} (Thm 4.14)
= {w1, w2}
= {(1, –2, – 5) , (0, 1, 3)}
A =
G.E.
Elementary Linear Algebra: Section 4.6, p.197
80/136
Find a basis for the column space of the matrix A given in Ex 2.
Sol. (Method 1):
Elementary Linear Algebra: Section 4.6, pp.197-198
81/136
CS(A)=RS(AT)
(a basis for the column space of A)
a basis for CS(A)
= a basis for RS(AT)
= {the nonzero vectors of B}
= {w1, w2, w3}
Elementary Linear Algebra: Section 4.6, pp.197-198
82/136
(1) This basis is a subset of {c1, c2, c3, c4}.
(2) v3 = –2v1+ v2, thus c3 = – 2c1+ c2 .
Leading 1 => {v1, v2, v4} is a basis for CS(B)
{c1, c2, c4} is a basis for CS(A)
Elementary Linear Algebra: Section 4.6, pp.197-198
83/136
If A is an m×n matrix, then the set of all solutions of the
homogeneous system of linear equations Ax = 0 is a subspace
of Rn called the nullspace of A.
Pf:
the homogeneous system Ax = 0.
Elementary Linear Algebra: Section 4.6, p.200
84/136
Find the nullspace of the matrix A.
Sol: The nullspace of A is the solution space of Ax = 0.
x1 = –2s – 3t, x2 = s, x3 = –t, x4 = t
Elementary Linear Algebra: Section 4.6, p.201
85/136
If A is an m×n matrix, then the row space and the column
space of A have the same dimension.
dim(RS(A)) = dim(CS(A))
The dimension of the row (or column) space of a matrix A
is called the rank of A and is denoted by rank(A).
rank(A) = dim(RS(A)) = dim(CS(A))
Elementary Linear Algebra: Section 4.6, pp.198-199
86/136
Pf: rank(AT) = dim(RS(AT)) = dim(CS(A)) = rank(A)
The dimension of the nullspace of A is called the nullity of A.
nullity(A) = dim(NS(A))
Elementary Linear Algebra: Section 4.6, p.200
87/136
(1) rank(A): The number of leading variables in the solution of Ax=0.
(The number of nonzero rows in the row-echelon form of A)
(2) nullity (A): The number of free variables in the solution of Ax = 0.
If A is an m×n matrix of rank r, then the dimension of
the solution space of Ax = 0 is n – r. That is
n = rank(A) + nullity(A)
Elementary Linear Algebra: Section 4.6, p.202
88/136
Fundamental Space | Dimension |
RS(A)=CS(AT) | r |
CS(A)=RS(AT) | r |
NS(A) | n – r |
NS(AT) | m – r |
If A is an m×n matrix and rank(A) = r, then
Elementary Linear Algebra: Section 4.6, Addition
89/136
Let the column vectors of the matrix A be denoted by a1, a2,
a3, a4, and a5.
a1 a2 a3 a4 a5
(a) Find the rank and nullity of A.
(b) Find a subset of the column vectors of A that forms a basis for
the column space of A .
(c) If possible, write the third column of A as a linear combination
of the first two columns.
Elementary Linear Algebra: Section 4.6, p.202
90/136
Sol: Let B be the reduced row-echelon form of A.
a1 a2 a3 a4 a5 b1 b2 b3 b4 b5
(a) rank(A) = 3 (the number of nonzero rows in B)
Elementary Linear Algebra: Section 4.6, p.202
91/136
(b) Leading 1
(c)
Elementary Linear Algebra: Section 4.6, p.202
92/136
If xp is a particular solution of the nonhomogeneous system
Ax = b, then every solution of this system can be written in
the form x = xp + xh , wher xh is a solution of the corresponding
homogeneous system Ax = 0.
Pf:
Let x be any solution of Ax = b.
is a solution of Ax = 0
Elementary Linear Algebra: Section 4.6, p.203
93/136
Find the set of all solution vectors of the system of linear equations.
Sol:
s t
Elementary Linear Algebra: Section 4.6, p.203
94/136
i.e.
xh = su1 + tu2 is a solution of Ax = 0
is a particular solution vector of Ax=b.
Elementary Linear Algebra: Section 4.6, p.203
95/136
The system of linear equations Ax = b is consistent if and only
if b is in the column space of A.
Pf:
Let
be the coefficient matrix, the column matrix of unknowns,
and the right-hand side, respectively, of the system Ax = b.
Elementary Linear Algebra: Section 4.6, p.204
96/136
Then
Hence, Ax = b is consistent if and only if b is a linear combination
of the columns of A. That is, the system is consistent if and only if
b is in the subspace of Rm spanned by the columns of A.
Elementary Linear Algebra: Section 4.6, p.204
97/136
Sol:
If rank([A|b])=rank(A)
Then the system Ax=b is consistent.
Elementary Linear Algebra: Section 4.6, p.204
98/136
c1 c2 c3 b w1 w2 w3 v
(b is in the column space of A)
The system of linear equations is consistent.
Elementary Linear Algebra: Section 4.6, p.204
99/136
If A is an n×n matrix, then the following conditions are equivalent.
(1) A is invertible
(2) Ax = b has a unique solution for any n×1 matrix b.
(3) Ax = 0 has only the trivial solution
(4) A is row-equivalent to In
(5)
(6) rank(A) = n
(7) The n row vectors of A are linearly independent.
(8) The n column vectors of A are linearly independent.
Elementary Linear Algebra: Section 4.6, p.204
100/136
Key Learning in Section 4.6
101/136
Keywords in Section 4.6:
102/136
4.7 Coordinates and Change of Basis
Let B = {v1, v2, …, vn} be an ordered basis for a vector space V
and let x be a vector in V such that
The scalars c1, c2, …, cn are called the coordinates of x relative to the basis B. The coordinate matrix (or coordinate vector) of x relative to B is the column matrix in Rn whose components are the coordinates of x.
Elementary Linear Algebra: Section 4.7, p.208
103/136
Find the coordinate matrix of x = (–2, 1, 3) in R3
relative to the standard basis� S = {(1, 0, 0), ( 0, 1, 0), (0, 0, 1)}
Sol:
Elementary Linear Algebra: Section 4.7, p.208
104/136
Find the coordinate matrix of x = (1, 2, –1) in R3
relative to the (nonstandard) basis� B ' = {u1, u2, u3}={(1, 0, 1), (0, – 1, 2), (2, 3, – 5)}
Sol:
Elementary Linear Algebra: Section 4.7, p.209
105/136
You were given the coordinates of a vector relative to one
basis B and were asked to find the coordinates relative to
another basis B'.
Consider two bases for a vector space V
Elementary Linear Algebra: Section 4.7, p.210
106/136
Let
Elementary Linear Algebra: Section 4.7, p.210
107/136
where
is called the transition matrix from B' to B
If [v]B is the coordinate matrix of v relative to B
[v]B‘ is the coordinate matrix of v relative to B'
Elementary Linear Algebra: Section 4.7, p.210
108/136
If P is the transition matrix from a basis B' to a basis B in Rn,
then
(1) P is invertible
(2) The transition matrix from B to B' is P–1
Elementary Linear Algebra: Section 4.7, p.210
109/136
Let B={v1, v2, … , vn} and B' ={u1, u2, … , un} be two bases
for Rn. Then the transition matrix P–1 from B to B' can be found
by using Gauss-Jordan elimination on the n×2n matrix
as follows.
Elementary Linear Algebra: Section 4.7, p.210
110/136
B ={(–3, 2), (4,–2)} and B' ={(–1, 2), (2,–2)} are two bases for R2
(a) Find the transition matrix from B' to B.
(b)
(c) Find the transition matrix from B to B' .
Elementary Linear Algebra: Section 4.7, p.214
111/136
Sol:
(a)
(b)
G.J.E.
B B'
I P
(the transition matrix from B' to B)
Elementary Linear Algebra: Section 4.7, p.214
112/136
(c)
(the transition matrix from B to B')
G.J.E.
B' B
I P-1
Elementary Linear Algebra: Section 4.7, p.214
113/136
(a) Find the coordinate matrix of p = 3x3-2x2+4 relative to the
standard basis S = {1, x, x2, x3} in P3(x).
(b) Find the coordinate matrix of p = 3x3-2x2+4 relative to the
basis S = {1, 1+x, 1+ x2, 1+ x3} in P3(x).
Sol:
Elementary Linear Algebra: Section 4.7, p.215
114/136
Find the coordinate matrix of x = relative to
the standard basis in M2×2.
B =
Sol:
Elementary Linear Algebra: Section 5.7, Addition
115/136
Key Learning in Section 4.7
116/136
Keywords in Section 4.7
117/136
4.8 Applications of Vector Spaces
Every conic section in the xy-plane has an equation that can be written in the form
Identifying the graph of this equation is fairly simple as long as b, the coefficient of the xy-term, is zero.
When b is zero, the conic axes are parallel to the coordinate axes, and the identification is accomplished by writing the equation in standard (completed square) form.
Elementary Linear Algebra: Section 4.8, p.221
118/136
Elementary Linear Algebra: Section 4.8, p.221
119/136
Elementary Linear Algebra: Section 4.8, p.221
120/136
Elementary Linear Algebra: Section 4.8, p.221
121/136
The standard form of is
The axis of the parabola is vertical. Because p = −1,
the focus is the point (1, 0).
Because the focus lies below the vertex,
the parabola opens downward.
vertex at
Elementary Linear Algebra: Section 4.8, p.222
122/136
The standard form of is
The vertices of this ellipse occur at (−5, 1) and (−1, 1), and the end points of the minor axis occur at (−3, 2) and (−3, 0).
center at
Elementary Linear Algebra: Section 4.8, p.222
123/136
For second-degree equations that have an xy-term, the axes of the graphs of the corresponding conics are not parallel to the coordinate axes.
The required rotation θ angle (measured counterclockwise) is
standard basis
new basis
Elementary Linear Algebra: Section 4.8, p.222
124/136
Sol: By Theorem 4.21
Elementary Linear Algebra: Section 4.8, p.223
125/136
The general second-degree equation
can be written in the form
by rotating the coordinate axes counterclockwise through the angle θ, where θ is defined by
The coefficients of the new equation are obtained from the substitutions
and
Elementary Linear Algebra: Section 4.8, p.223
126/136
Perform a rotation of axes to eliminate the xy-term in
and sketch the graph of the resulting equation in the x’y’-plane.
Sol: The angle of rotation
By substituting
Elementary Linear Algebra: Section 4.8, p.224
127/136
new basis
the vertices
use the equations
obtain
Elementary Linear Algebra: Section 4.8, p.224
128/136
Key Learning in Section 4.8
129/136
Keywords in Section 4.8
130/136
Vectors have a wide variety of applications in engineering and the physical sciences. For example, to determine the amount of force required to pull an object up a ramp that has an angle of elevation θ, use the figure at the right.
In the figure, the vector labeled W represents the weight of the object, and the vector labeled F represents the required force. Using similar triangles and some trigonometry, the required force is F = W sin θ. (Verifying this.)
4.1 Linear Algebra Applied
Elementary Linear Algebra: Section 4.1, p.157
131/136
In a mass-spring system, motion is assumed to occur in only the vertical direction. That is, the system has one degree of freedom. When the mass is pulled downward and then released, the system will oscillate. If the system is undamped, meaning that there are no forces present to slow or stop the oscillation, then the system will oscillate indefinitely. Applying Newton’s Second Law of Motion to the mass yields the second order differential equation
where x is the displacement at time t and ω is a fixed constant called the natural frequency of the system. The general solution of this differential equation is
where a1 and a2 are arbitrary constants. (Try verifying this.) In Exercise 41, you are asked to show that the set of all functions x(t) is a vector space.
4.2 Linear Algebra Applied
Elementary Linear Algebra: Section 4.2, p.164
132/136
Digital signal processing depends on sampling, which converts continuous signals into discrete sequences that can be used by digital devices. Traditionally, sampling is uniform and pointwise, and is obtained from a single vector space. Then, the resulting sequence is reconstructed into a continuous-domain signal. Such a process, however, can involve a significant reduction in information, which could result in a low-quality reconstructed signal. In applications such as radar, geophysics, and wireless communications, researchers have determined situations in which sampling from a union of vector subspaces can be more appropriate.
4.3 Linear Algebra Applied
Elementary Linear Algebra: Section 4.3, p.172
133/136
Image morphing is the process of transforming one
image into another by generating a sequence of synthetic intermediate images. Morphing has a wide variety of applications, such as movie special effects, age progression software, and simulating wound healing and cosmetic surgery results. Morphing an image uses a process called warping, in which a piece of an image is distorted. The mathematics behind warping and morphing can include forming a linear combination of the vectors that bound a triangular piece of an image, and performing an affine transformation to form new vectors and a distorted image piece.
4.4 Linear Algebra Applied
Elementary Linear Algebra: Section 4.4, p.180
134/136
4.5 Linear Algebra Applied
Elementary Linear Algebra: Section 4.5, p. 190
135/136
The U.S. Postal Service uses barcodes to represent such information as ZIP codes and delivery addresses. The ZIP + 4 barcode shown at the left starts with a long bar, has a series of short and long bars to represent each digit in the ZIP + 4 code and an additional digit for error checking, and ends with a long bar. The following is the code for the digits.
The error checking digit is such that when it is summed with the digits in the ZIP + 4 code, the result is a multiple of 10. (Verify this, as well as whether the ZIP + 4 code shown is coded correctly.) More sophisticated barcodes will also include error correcting digit(s). In an analogous way, matrices can be used to check for errors in transmitted messages. Information in the form of column vectors can be multiplied by an error detection matrix. When the resulting product is in the nullspace of the error detection matrix, no error in transmission exists. Otherwise, an error exists somewhere in the message. If the error detection matrix also has error correction, then the resulting matrix.
4.6 Linear Algebra Applied
Elementary Linear Algebra: Section 4.6, p. 200
136/136
Crystallography is the science of atomic and molecular structure. In a crystal, atoms are in a repeating pattern called a lattice. The simplest repeating unit in a lattice is a unit cell. Crystallographers can use bases and coordinate matrices in R3 to designate the locations of atoms in a unit cell. For example, the figure below shows the unit cell known as end-centered monoclinic.
One possible coordinate matrix for the top end-centered (blue) atom is
4.7 Linear Algebra Applied
Elementary Linear Algebra: Section 4.7, p. 213
137/136
A satellite dish is an antenna that is designed to transmit or receive signals of a specific type. A standard satellite dish consists of a bowl-shaped surface and a feed horn that is aimed toward the surface. The bowl-shaped surface is typically in the shape of an elliptic paraboloid. (See Section 7.4.) The cross section of the surface is typically in the shape of a rotated parabola.
4.8 Linear Algebra Applied
Elementary Linear Algebra: Section 4.8, p.223
138/136