Professional Documents
Culture Documents
Vector Spaces Associated With Matrices
Vector Spaces Associated With Matrices
Vector Spaces Associated With Matrices
Section 4.1
Row Spaces and Column
Spaces
Row spaces and column spaces (Definition 4.1.1)
r1 = 2 −1 0 ,
2 −1 0
1 −1 3 r2 = 1 −1 3 ,
Let A = . Write
−5 1 0 r3 = −5 1 0 ,
1 0 1
r4 = 1 0 1 .
The row space of A
= span{ r1, r2, r3, r4 }
= { a(2, −1, 0) + b(1, −1, 3) + c(−5, 1, 0) + d(1, 0, 1) |
a, b, c, d ∈ }
= { (2a + b − 5c + d, −a − b + c, 3b + d ) | a, b, c, d ∈ }.
An examples (Example 4.1.4.1)
2 −1 0
1 −1 3
Write c1 = , c2 = , c3 = .
−5 1 0
1 0 1
row
matrix A matrix B
equivalent
Proof: r1
r2
Write A = where ri = ai 1 ai 2 ··· ai n
⁞
rm is the i th row of A.
Theorem 3.2.10: span(u1, u2, ..., uk) ⊆ span(v1, v2, ..., vm) if
and only if each ui is a linear combination of v1, v2, ..., vm .
0 0 1 1 0 0
R1 ↔ R3 2R1 R1 − R2
A= 0 2 4 D= 0 2 4
1
2 1 2 0 0 1
row
matrix A matrix B
equivalent
Warning: In general,
the column space of A ≠ the column space of B.
For example,
0 0 R1 ↔ R2 1 0
A= B=
1 0 0 0
A and B are row equivalent
but the column space of A = { (0, y )T | y ∈ }
while the column space of B = { (x, 0)T | x ∈ }.
Column vectors (Theorem 4.1.11)
2 2 −1 0 1 2 2 −1 0 1
3 3
−1 −1 2 −3 1 Gaussian 0 0 2 −3 2
A= R=
0 0 1 1 1 Elimination 0 0 0 3 0
1 1 −2 0 −1 0 0 0 0 0
1 3 4 −2 5 4 1 3 4 −2 5 4
2 6 9 −1 8 2 Gaussian 0 0 1 3 −2 −6
2 6 9 −1 9 7 Elimination 0 0 0 0 1 5
1 3 5 1 4 3 0 0 0 0 0 0
pivot columns
So
{ (1, 2, 2, 1), (4, 9, 9, 5), (5, 8, 9, 4) } is a basis for W.
Finding bases (Example 4.1.14.2)
Solution:
In the following, we present an algorithm that extends a
linearly independent subset S of n to a basis for n.
Finding bases (Example 4.1.14.2)
1 4 −2 5 1 1 4 −2 5 1
Gaussian
A = 2 9 −1 8 2 R = 0 1 3 −2 0
Elimination
2 9 −1 9 3 0 0 0 1 1
1 4 −2 5 1 1 4 −2 5 1
Gaussian
A = 2 9 −1 8 2 R = 0 1 3 −2 0
Elimination
2 9 −1 9 3 0 0 0 1 1
1 4 −2 5 1 1 4 −2 5 1
Gaussian
A = 2 9 −1 8 2 R = 0 1 3 −2 0
Elimination
2 9 −1 9 3 0 0 0 1 1
is a basis for n.
For this example,
{ (1, 4, −2, 5, 1), (2, 9, −1, 8, 2), (2, 9, −1, 9, 3),
(0, 0, 1, 0, 0), (0, 0, 0, 0, 1) }
is a basis for 5.
Linear Systems (Discussion 4.1.15)
2x − y = −1 2 −1 0 −1
x
x − y + 3z = 4 1 −1 3 4
y =
−5x + y = −2 −5 1 0 −2
z
x + z = 3 1 0 1 3
2 −1 0 −1 2 −1 0 −1
For example, x
1 −1 3 4 1 −1 3 4
(x, y, z) = (1,
y 3,= 2) 1
x + y3 + z2 =
−5 1 0 −2 −5 1 0 −2
is a solution to z system.
the
1 0 1 3 1 0 1 3
2 −1 0 −1
1 −1 3 4
Let A = and b = .
−5 1 0 −2
1 0 1 3
Then a solution to the system is a way of writing the
vector b as a linear combination of the column vectors of
A.
Linear systems (Theorem 4.1.16)
Let A be an m × n matrix.
The column space of A = { Au | u ∈ n }.
A linear system Ax = b is consistent if and only if b lies
in the column space of A.
Proof:
Write A = c1 c2 ··· cn
where cj is the j th column of A.
Linear systems (Theorem 4.1.16)
u1
u2
Au = c1 c2 ··· cn
⁞
un
= u1c1 + u2c2 + ··· + uncn ∈ span{ c1, c2, ..., cn }
= the column space of A.
Thus { Au | u ∈ n } ⊆ the column space of A.
Linear systems (Theorem 4.1.16)
Finally,
the linear system Ax = b is consistent
⇔ there exists u ∈ n such that Au = b
⇔ b ∈ { Au | u ∈ n } = span{ c1, c2, ..., cn }
= the column space of A.
Chapter 4 Vector Spaces Associated with Matrices
Section 4.2
Ranks
Row spaces and column spaces (Theorem 4.2.1)
pivot columns
Row spaces and column spaces (Theorem 4.2.1)
2 0 3 −1 8 2 0 3 −1 8
Gaussian
C = 2 1 1 −2 5 0 1 −2 −1 −3
Elimination
−4 −3 0 5 −7 0 0 0 0 0
{ (2, 0, 3, −1, 8), (0, 1, −2, −1, −3) } is a basis for the row
space of C.
{ (2, 2, −4)T, (0, 1, −3)T } is a basis for the column space
of C.
The dimension of both the row space and column space
of C is 2.
Ranks (Definition 4.2.3 & Example 4.2.4.1 & Remark 4.2.5)
2 −1 0 1 2 −1 0 1
x
1 −1 3 0 1 −1 3 0
y =
−5 1 0 0 −5 1 0 0 Gaussian
z Elimination
1 0 1 0 1 0 1 0
A b (A|b) 2 −1 0 1
For this example, rank(A) = 3 0 −1/2 3 −1/2
while rank( ( A | b ) ) = 4. 0 0 −9 4
The system is inconsistent. 0 0 0 7/9
Ranks of product of matrices (Theorem 4.2.8)
Section 4.3
Nullspaces and Nullities
Nullspaces (Definition 4.3.1 & Notation 4.3.2)
Let A be an m × n matrix.
The solution space of the homogeneous linear system
Ax = 0 is known as the nullspace of A.
The dimension of the nullspace of A is called the nullity
of A and is denoted by nullity(A).
Since the nullspace is a subspace of n,
nullity(A) = dim( the nullspace of A )
≤ dim( n) = n.
From now on, vectors in nullspaces, as well as solution
sets of linear systems, will always written as column
vectors. (See Notation 4.1.5.)
Examples (Example 4.3.3.1)
2 2 −1 0 1
−1 −1 2 −3 1
Find a basis for the nullspace of A = .
0 0 1 1 1
1 1 −2 0 −1
Solution:
2 2 −1 0 1 0 1 1 0 0 1 0
−1 −1 2 −3 1 0 Gauss-Jordan 0 0 1 0 1 0
0 0 1 1 1 0 Elimination 0 0 0 1 0 0
1 1 −2 0 −1 0 0 0 0 0 0 0
Examples (Example 4.3.3.1)
2 1 −5 1
Determine the nullity of B = −1 −1 1 0 .
0 3 0 1
Solution:
2 1 −5 1 0 1 0 0 −7/9 0
Gauss-Jordan
−1 −1 1 0 0 0 1 0 1/3 0
Elimination
0 3 0 1 0 0 0 1 −4/9 0
Examples (Example 4.3.3.2)
Let A be a matrix.
Then rank(A) + nullity(A) = the number of columns of A.
−1 −1 1
1 0 −1
x=s 0 + t −1 + 1 where s, t are
0 0 1 arbitrary parameters.
0 1 1
A related result (Remark 4.3.9)