Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
8 views

Lecture 19

Uploaded by

anutyo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Lecture 19

Uploaded by

anutyo
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Lecture 19

Ajay Kumar
ajay.kumar@iitjammu.ac.in

October 12, 2023


Subspaces of Rn
Some subspaces of Rn
Let A = [aij ] be m × n matrix, R1 , . . . , Rm be rows of A and C1 , . . . , Cn
be columns of A. Then a subspace of Rn spanned by the rows of A,
i.e., span(R1 , . . . , Rm ) is called the row space of A which is denoted as
R(A), and the subspace of Rm spanned by columns of A, i.e.,
span(C1 , . . . , Cn ) is called the column space of A which is denoted as
C(A). The solution space of the homogeneous system of equations
Ax = 0 is called the null space of A which is denoted as N (A).
Example
 
1 3 4
Let A = . Then
2 6 8
• Row space of A, R(A) = span{(1, 3, 4), (2, 6, 8)}.
     
1 3 4
• The column space of A, C(A) = span , , .
2 6 8
• The null space of A is the set of all solution of Ax = 0.
Theorem
Elementary row operations do not change the null space of a matrix,
i.e., for A ∈ Rm×n and B ∈ Rm×n , if A and B are row equivalent, then
N (A) = N (B).

Theorem
Elementary row operations do not change the row space of a matrix,
i.e., for A ∈ Rm×n and B ∈ Rm×n , if A and B are row equivalent, then
R(A) = R(B).
Note that C(A) need not be equal to C(B).
  
Example 
1 3 4 1 3 4
Let A = and B = .
2 6 8 0 0 0
• R(A) = span{(1, 3, 4), (2, 6, 8)} = span{(1, 3, 4)} = R(B).
• N (A) = span{(x1 , x2 , x3 ) : x1 + 3x2 + 4x3 = 0 = 2x1 + 6x2 + 8x3 } =
span{(x1 , x2 , x3 ) : x1 + 3x2 + 4x3 = 0 = 0x1 + 0x2 + 0x3 } = N (B).
     
1 3 4
• C(A) = span , ,
2 6 8
 
1
• C(B) = span
0

Theorem
Let A be an m × n matrix and b ∈ Rn . Then Ax = b has a solution if
and only if b ∈ C(A).

Theorem
Let A be an m × n matrix. Then Ax = 0 has a non-trivial solution if and
only if columns of A are linearly dependent.
Theorem
Let A and B be row equivalent matrices. Then a given set of column
vectors in A is linear dependent if and only if the corresponding
columns of B are linear dependent.
Proof. Let v1 , . . . , vr be a subset of linear dependent columns of A.
Then there exist scalars not all zero such that

c1 v1 + · · · + cr vr = 0. (1)

After applying certain row operations columns v1 , . . . , vr changes to


v01 , . . . , v0r . These column vectors satisfies the relation

c1 v01 + · · · + cr v0r = 0 (2)

with same coefficients. Thus v01 , . . . , v0r are also linearly dependent.
Theorem
Let A and B be row equivalent matrices. Then a given set of column
vectors of A forms a basis for C(A) if and only if the corresponding
column vectors of B forms a basis of C(B).

You might also like