MATH F112

Vector Spaces
Rank, Nullity, and Fundamental Matrix spaces

Mukesh Kumar Nagar

Department of Mathematics

BITS Pilani, K K Birla Goa Campus

Email : [email protected]

February 5, 2025

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 1 / 20
 Recall: Basis of Span

Problem 1
Given a set of vectors S = {v1 , v2 , . . . , vk } in Rn , find a subset of
these vectors that forms a basis for span(S),

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 2 / 20
 Recall: Basis of Span

Problem 1
Given a set of vectors S = {v1 , v2 , . . . , vk } in Rn , find a subset of
these vectors that forms a basis for span(S),

and express each vector that is not in that basis as a linear

combination of the basis vectors.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 2 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }
• STEP 2. Reduce the matrix A to reduced row echelon form R.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }
• STEP 2. Reduce the matrix A to reduced row echelon form R.
• STEP 3. Denote the column vectors of R by w1 , w2 , · · · , wk .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }
• STEP 2. Reduce the matrix A to reduced row echelon form R.
• STEP 3. Denote the column vectors of R by w1 , w2 , · · · , wk .
• STEP 4. Identify the columns of R that contain the leading 1’s.
The corresponding column vectors of A form a basis for span(S).
This completes the first part of the problem.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }
• STEP 2. Reduce the matrix A to reduced row echelon form R.
• STEP 3. Denote the column vectors of R by w1 , w2 , · · · , wk .
• STEP 4. Identify the columns of R that contain the leading 1’s.
The corresponding column vectors of A form a basis for span(S).
This completes the first part of the problem.
• STEP 5. Obtain a set of dependency equations for the column
vectors w1 , w2 , · · · , wk . of R by successively expressing each wi
that does not contain a leading 1 of R as a linear combination of
predecessors that do.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Basis for span(S), where S = {v1 , v2 , · · · , vk } ⊂ Rn
• STEP 1. Form the matrix A whose columns are the vectors in
the set S = {v1 , v2 , · · · , vk }
• STEP 2. Reduce the matrix A to reduced row echelon form R.
• STEP 3. Denote the column vectors of R by w1 , w2 , · · · , wk .
• STEP 4. Identify the columns of R that contain the leading 1’s.
The corresponding column vectors of A form a basis for span(S).
This completes the first part of the problem.
• STEP 5. Obtain a set of dependency equations for the column
vectors w1 , w2 , · · · , wk . of R by successively expressing each wi
that does not contain a leading 1 of R as a linear combination of
predecessors that do.
• STEP 6. In each dependency equation obtained in Step 5,
replace the vector wi by the vector vi for i = 1, 2, · · · , n.
This completes the second part of the problem.
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 3 / 20
 Recall Example

Example 2
Find bases for the row and column spaces of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A=  −1

3 −4 2 −5 −4 
2 −6 9 −1 9 7

Solution: The REF of A is

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 4 / 20
 Recall Example

Example 2
Find bases for the row and column spaces of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A=  −1

3 −4 2 −5 −4 
2 −6 9 −1 9 7

Solution: The REF of A is

 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=  0 0

0 0 1 5 
0 0 0 0 0 0

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 4 / 20
 Recall Example

Example 2
Find bases for the row and column spaces of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A=  −1

3 −4 2 −5 −4 
2 −6 9 −1 9 7

Solution: The REF of A is

 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=  0 0

0 0 1 5 
0 0 0 0 0 0

Thus a basis of the column space of A is {c1 , c3 , c5 }.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 4 / 20
 Recall Example

Example 2
Find bases for the row and column spaces of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A=  −1

3 −4 2 −5 −4 
2 −6 9 −1 9 7

Solution: The REF of A is

 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=  0 0

0 0 1 5 
0 0 0 0 0 0

Thus a basis of the column space of A is {c1 , c3 , c5 }.

What is about a basis for the row space of A?
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 4 / 20
 It is easy to see that row(A) = col(AT ).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 5 / 20
 It is easy to see that row(A) = col(AT ).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 5 / 20
 It is easy to see that row(A) = col(AT ).

2 −1 2
 
1

 0 1 0 1 
 0 0 0 1
is R1 =  

 0 0 0 0 
 0 0 0 0
0 0 0 0
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 5 / 20
 Rank of a Matrix

Theorem 3
The row space and the column space of a matrix A have the same
dimension.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 6 / 20
 Rank of a Matrix

Theorem 3
The row space and the column space of a matrix A have the same
dimension.

Proof: Hint

dim(row space of A) = dim(row space of R) = non-zero rows of R

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 6 / 20
 Rank of a Matrix

Theorem 3
The row space and the column space of a matrix A have the same
dimension.

Proof: Hint

dim(row space of A) = dim(row space of R) = non-zero rows of R

dim(column space of A) = dim(column space of R)

Exercise: Complete the proof.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 6 / 20
 Rank of a Matrix

Definition 4
The common dimension of the row space and column space of a
matrix A is called the rank of A and is denoted by rank(A).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 7 / 20
 Rank of a Matrix

Definition 4
The common dimension of the row space and column space of a
matrix A is called the rank of A and is denoted by rank(A).
The dimension of the null space of A is called the nullity of A and is
denoted by nullity(A).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 7 / 20
 Rank of a Matrix

Definition 4
The common dimension of the row space and column space of a
matrix A is called the rank of A and is denoted by rank(A).
The dimension of the null space of A is called the nullity of A and is
denoted by nullity(A).

What is the maximum possible rank of an m × n matrix A?

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 7 / 20
 Rank of a Matrix

Definition 4
The common dimension of the row space and column space of a
matrix A is called the rank of A and is denoted by rank(A).
The dimension of the null space of A is called the nullity of A and is
denoted by nullity(A).

What is the maximum possible rank of an m × n matrix A?

Solution: Easy to see that rank(A) ≤ min(m, n).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 7 / 20
 Example 5
Find the rank and nullity of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A= 
 2 −6 9 −1 9 7 
−1 3 −4 2 −5 −4

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 8 / 20
 Example 5
Find the rank and nullity of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A= 
 2 −6 9 −1 9 7 
−1 3 −4 2 −5 −4

Solution: REF of A is
 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=
 0 0 0 0

1 5 
0 0 0 0 0 0

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 8 / 20
 Example 5
Find the rank and nullity of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A= 
 2 −6 9 −1 9 7 
−1 3 −4 2 −5 −4

Solution: REF of A is
 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=  0 0 0 0

1 5 
0 0 0 0 0 0
Therefore a basis of column space of A is given by the set {c1 , c3 , c5 }
of column vectors of A.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 8 / 20
 Example 5
Find the rank and nullity of the matrix
 
1 −3 4 −2 5 4
 2 −6 9 −1 8 2 
A= 
 2 −6 9 −1 9 7 
−1 3 −4 2 −5 −4

Solution: REF of A is
 
1 −3 4 −2 5 4
 0 0 1 3 −2 −6 
R=  0 0 0 0

1 5 
0 0 0 0 0 0
Therefore a basis of column space of A is given by the set {c1 , c3 , c5 }
of column vectors of A.
Thus, rank(A) = 3. What is nullity(A)?

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 8 / 20
 To find nullity(A) or dim(N (A)), solution set of Ax = 0 is required.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 9 / 20
 To find nullity(A) or dim(N (A)), solution set of Ax = 0 is required.

Solution set of Ax = 0 is given by the solution set of

 x1
 
  
1 −3 4 −2 5 4  x2  0
 0 0 1 3 −2 −6   x
 
0 
 3 =
   
 0 0 0 0 1 5   x4  0 
0 0 0 0 0 0  x
5
 0
x6

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 9 / 20
 To find nullity(A) or dim(N (A)), solution set of Ax = 0 is required.

Solution set of Ax = 0 is given by the solution set of

 x1
 
  
1 −3 4 −2 5 4  x2  0
 0 0 1 3 −2 −6   x
 
0 
 3 =
   
 0 0 0 0 1 5   x4  0 
0 0 0 0 0 0  x
5
 0
x6

It is easy to see that x2 , x4 , x6 are free variables and these are

assigned arbitrary real values say r, s, t ∈ R, respectively.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 9 / 20
 To find nullity(A) or dim(N (A)), solution set of Ax = 0 is required.

Solution set of Ax = 0 is given by the solution set of

 x1
 
  
1 −3 4 −2 5 4  x2  0
 0 0 1 3 −2 −6   x
 
0 
 3 =
   
 0 0 0 0 1 5   x4  0 
0 0 0 0 0 0  x
5
 0
x6

It is easy to see that x2 , x4 , x6 are free variables and these are

assigned arbitrary real values say r, s, t ∈ R, respectively.

Therefore x2 = r, x4 = s, x6 = t, and using back-substitution, the

value of leading variables

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 9 / 20
 To find nullity(A) or dim(N (A)), solution set of Ax = 0 is required.

Solution set of Ax = 0 is given by the solution set of

 x1
 
  
1 −3 4 −2 5 4  x2  0
 0 0 1 3 −2 −6   x
 
0 
 3 =
   
 0 0 0 0 1 5   x4  0 
0 0 0 0 0 0  x
5
 0
x6

It is easy to see that x2 , x4 , x6 are free variables and these are

assigned arbitrary real values say r, s, t ∈ R, respectively.

Therefore x2 = r, x4 = s, x6 = t, and using back-substitution, the

value of leading variables
x5 = −5t, x3 = −3s − 4t, and x1 = 3r + 14s + 37t.
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 9 / 20
 3r + 14s + 37t
  
 
r

 


   

−3s − 4t
  
Thus N (A) =   : r, s, t ∈ R
 

  s  





 −5t  



t

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 10 / 20
 3r + 14s + 37t
  
 
r

 


   

−3s − 4t
  
Thus N (A) =   : r, s, t ∈ R
 

  s  





 −5t  



t
3 14 37
       
 
1 0 0

 


       

 0   −3   −4 
       
N (A) = r   + s   + t  : r, s, t ∈ R

  0   1   0  


  0   0   −5  


 

0 0 1

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 10 / 20
 3r + 14s + 37t
  
 
r

 


   

−3s − 4t
  
Thus N (A) =   : r, s, t ∈ R
 

  s  





 −5t  



t
3 14 37
       
 
1 0 0

 


       

 0   −3   −4 
       
N (A) = r   + s   + t  : r, s, t ∈ R

  0   1   0  


  0   0   −5  


 

0 0 1

Thus, nullity(A) = 3.
Here, rank(A) + nullity(A) = number of variables = number of
columns of A.
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 10 / 20
 3r + 14s + 37t
  
 
r

 


   

−3s − 4t
  
Thus N (A) =   : r, s, t ∈ R
 

  s  





 −5t  



t
3 14 37
       
 
1 0 0

 


       

 0   −3   −4 
       
N (A) = r   + s   + t  : r, s, t ∈ R

  0   1   0  


  0   0   −5  


 

0 0 1

Thus, nullity(A) = 3.
Here, rank(A) + nullity(A) = number of variables = number of
columns of A. Is it always true?
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 10 / 20
 Dimension Theorem for Matrices

Theorem 6 (Rank-nullity Theorem)

If A is a matrix with n columns, then

rank(A) + nullity(A) = n

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 11 / 20
 Dimension Theorem for Matrices

Theorem 6 (Rank-nullity Theorem)

If A is a matrix with n columns, then

rank(A) + nullity(A) = n

Proof: In Ax = 0,
number of leading variables + number of free variables = n.
Exercise: Complete the proof.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 11 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

2 nullity(A) = the number of parameters in the general solution of

Ax = 0.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

2 nullity(A) = the number of parameters in the general solution of

Ax = 0.

Example 8
1 Find the number of parameters in the general solution of Ax = 0
if A is a 5 × 7 matrix of rank 3.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

2 nullity(A) = the number of parameters in the general solution of

Ax = 0.

Example 8
1 Find the number of parameters in the general solution of Ax = 0
if A is a 5 × 7 matrix of rank 3. Ans. 4

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

2 nullity(A) = the number of parameters in the general solution of

Ax = 0.

Example 8
1 Find the number of parameters in the general solution of Ax = 0
if A is a 5 × 7 matrix of rank 3. Ans. 4

2 Find the rank of a 5 × 7 matrix A for which Ax = 0 has a

two-dimensional solution space.
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Use of Rank-Nullity theorem
Theorem 7
If A is an m × n matrix, then
1 rank(A) = the number of leading variables in the general solution
of Ax = 0.

2 nullity(A) = the number of parameters in the general solution of

Ax = 0.

Example 8
1 Find the number of parameters in the general solution of Ax = 0
if A is a 5 × 7 matrix of rank 3. Ans. 4

2 Find the rank of a 5 × 7 matrix A for which Ax = 0 has a

two-dimensional solution space. Ans. 5
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 12 / 20
 Overdetermined/Underdetermined
Theorem 9
If Ax = b is a consistent linear system of m equations in n unknowns,
and if A has rank r, then the general solution of the system contains
n − r parameters.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 13 / 20
 Overdetermined/Underdetermined
Theorem 9
If Ax = b is a consistent linear system of m equations in n unknowns,
and if A has rank r, then the general solution of the system contains
n − r parameters.
Since if x0 is a particular solution of Ax = b, and
S = {v1 , v2 , . . . , vn−r } is a basis for N (A).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 13 / 20
 Overdetermined/Underdetermined
Theorem 9
If Ax = b is a consistent linear system of m equations in n unknowns,
and if A has rank r, then the general solution of the system contains
n − r parameters.
Since if x0 is a particular solution of Ax = b, and
S = {v1 , v2 , . . . , vn−r } is a basis for N (A). Then, what??

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 13 / 20
 Overdetermined/Underdetermined
Theorem 9
If Ax = b is a consistent linear system of m equations in n unknowns,
and if A has rank r, then the general solution of the system contains
n − r parameters.
Since if x0 is a particular solution of Ax = b, and
S = {v1 , v2 , . . . , vn−r } is a basis for N (A). Then, what??

Theorem 10
Let A be an m × n matrix.
1 (Overdetermined Case). If m > n, then the linear system Ax = b
is inconsistent for at least one vector b in Rm .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 13 / 20
 Overdetermined/Underdetermined
Theorem 9
If Ax = b is a consistent linear system of m equations in n unknowns,
and if A has rank r, then the general solution of the system contains
n − r parameters.
Since if x0 is a particular solution of Ax = b, and
S = {v1 , v2 , . . . , vn−r } is a basis for N (A). Then, what??

Theorem 10
Let A be an m × n matrix.
1 (Overdetermined Case). If m > n, then the linear system Ax = b
is inconsistent for at least one vector b in Rm .
2 (Underdetermined Case). If m < n, then for each vector b in Rm
the linear system Ax = b is either inconsistent or has infinitely
many solutions.
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 13 / 20
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 14 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT
Here row space of A = column space of AT and

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT
Here row space of A = column space of AT and
Here column space of A = row space of AT

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT
Here row space of A = column space of AT and
Here column space of A = row space of AT
Thus, the following four spaces are known as Fundamental Spaces
of a Matrix A:
1. row space of A 2. column space of A

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT
Here row space of A = column space of AT and
Here column space of A = row space of AT
Thus, the following four spaces are known as Fundamental Spaces
of a Matrix A:
1. row space of A 2. column space of A
3. null space of A 4. null space of AT

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Fundamental Spaces of a Matrix
There are six important vector spaces associated with a matrix A and
its transpose AT :
1. row space of A 2. row space of AT
3. column space of A 4. column space of AT
5. null space of A 6. null space of AT
Here row space of A = column space of AT and
Here column space of A = row space of AT
Thus, the following four spaces are known as Fundamental Spaces
of a Matrix A:
1. row space of A 2. column space of A
3. null space of A 4. null space of AT
Are they (Fundamental Spaces of a Matrix) related?
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 15 / 20
 Theorem 11
If A is any matrix, then rank(A) = rank(AT ).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 16 / 20
 Theorem 11
If A is any matrix, then rank(A) = rank(AT ).

Remark
Let A be an m × n matrix and rank(A) = r. then

dim[row(A)] = r, dim[col(A)] = r.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 16 / 20
 Theorem 11
If A is any matrix, then rank(A) = rank(AT ).

Remark
Let A be an m × n matrix and rank(A) = r. then

dim[row(A)] = r, dim[col(A)] = r.

dim[N (A)] = n − r dim[N (AT )] = m − r

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 16 / 20
 Theorem 11
If A is any matrix, then rank(A) = rank(AT ).

Remark
Let A be an m × n matrix and rank(A) = r. then

dim[row(A)] = r, dim[col(A)] = r.

dim[N (A)] = n − r dim[N (AT )] = m − r

Definition 12
Two vectors u, v in Rn are said to be orthogonal if uT v = 0.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 16 / 20
 Theorem 11
If A is any matrix, then rank(A) = rank(AT ).

Remark
Let A be an m × n matrix and rank(A) = r. then

dim[row(A)] = r, dim[col(A)] = r.

dim[N (A)] = n − r dim[N (AT )] = m − r

Definition 12
Two vectors u, v in Rn are said to be orthogonal if uT v = 0.
   
−3 6
Example: Vectors u =  5  and v =  4  in R3 are orthogonal.
1 −2
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 16 / 20
 Definition 13
If W is a subspace of Rn , then the set of all vectors in Rn that are
orthogonal to every vector in W is called the orthogonal complement
of W and is denoted by the symbol W ⊥ .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 17 / 20
 Definition 13
If W is a subspace of Rn , then the set of all vectors in Rn that are
orthogonal to every vector in W is called the orthogonal complement
of W and is denoted by the symbol W ⊥ .

In other words, if W is a subspace of Rn , then

W ⊥ = {u ∈ Rn : uT v = 0, ∀ v ∈ W }.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 17 / 20
 Definition 13
If W is a subspace of Rn , then the set of all vectors in Rn that are
orthogonal to every vector in W is called the orthogonal complement
of W and is denoted by the symbol W ⊥ .

In other words, if W is a subspace of Rn , then

W ⊥ = {u ∈ Rn : uT v = 0, ∀ v ∈ W }.

Theorem 14
If W is a subspace of Rn , then:
1 W
⊥
is a subspace of Rn .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 17 / 20
 Definition 13
If W is a subspace of Rn , then the set of all vectors in Rn that are
orthogonal to every vector in W is called the orthogonal complement
of W and is denoted by the symbol W ⊥ .

In other words, if W is a subspace of Rn , then

W ⊥ = {u ∈ Rn : uT v = 0, ∀ v ∈ W }.

Theorem 14
If W is a subspace of Rn , then:
1 W
⊥
is a subspace of Rn .
2 The only vector common to W and W ⊥ is 0, i.e., W ∩ W ⊥ = 0.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 17 / 20
 Definition 13
If W is a subspace of Rn , then the set of all vectors in Rn that are
orthogonal to every vector in W is called the orthogonal complement
of W and is denoted by the symbol W ⊥ .

In other words, if W is a subspace of Rn , then

W ⊥ = {u ∈ Rn : uT v = 0, ∀ v ∈ W }.

Theorem 14
If W is a subspace of Rn , then:
1 W
⊥
is a subspace of Rn .
2 The only vector common to W and W ⊥ is 0, i.e., W ∩ W ⊥ = 0.
3 The orthogonal complement of W ⊥ is W , i.e., (W ⊥ )⊥ = W .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 17 / 20
Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 18 / 20
 For an m × n matrix A,

N (A) = {x ∈ Rn : Ax = 0}.

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 18 / 20
 For an m × n matrix A,

N (A) = {x ∈ Rn : Ax = 0}.

Thus, (row space of A)⊥ = N (A).

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 18 / 20
 Theorem 15
If A is an m × n matrix, then:
1 The null space of A and the row space of A are orthogonal
complements in Rn .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 19 / 20
 Theorem 15
If A is an m × n matrix, then:
1 The null space of A and the row space of A are orthogonal
complements in Rn .
2 The null space of AT and the column space of A are orthogonal
complements in Rm .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 19 / 20
 Theorem 15
If A is an m × n matrix, then:
1 The null space of A and the row space of A are orthogonal
complements in Rn .
2 The null space of AT and the column space of A are orthogonal
complements in Rm .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 19 / 20
 Remark
If A is an m × n matrix, then:
⊥
1 (row space of A) = N (A)

2 N (A)⊥ = row space of A

3 (column space of A)⊥ = N (AT )

4 N (AT )⊥ = column space of A

Example 16
Let W = span(S), where S ⊂ R5 is the set of the following vectors
v1 = (1, 0, 2, 1, −1), v2 = (1, 5, −6, 0, 3), v3 = (2, −7, 3, −4, 1),
v4 = (2, 5, −4, 1, 2), v5 = (3, −2, −3, −4, 4).
Find a basis of W ⊥ .

Mukesh Kumar Nagar (BITS Pilani Goa) MATH F112 Vector Spaces February 5, 2025 20 / 20