L11 - Linear Algebra - Row, Column & Null Space of A Matrix

Linear Algebra
- Row and Column Space
4.1
Row Space, Column Space and Null space:
If A is an m⨉n matrix, then

n
 The subspace of R spanned by the row vectors of A is called
the row space of A.

m
 The subspace of R spanned by the column vectors of A is
called the column space of A.
 The solution space (set of all solutions - Assignment) of the
homogeneous linear system of equationsAx  0 , which is a
subspace of R,nis called the null space of A.

4.2
Rank and Nullity of the Matrix:
If A is an m⨉n matrix, then
 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).
Theorem:
If A is a matrix with n columns, then
Rank(A) + Nullity(A) = n.
4.3
Example:
1 1 2 2 3
 
1 2 1 2 1
Consider the matrix A   2 1. 2 1 2 
 
4 4 5 5 6 

So that the column space of the matrix is the space generate by
the vectors (1,1,2,4), (1,2,1,4), (2,1(set

,2,5),of
(2,2all ), (3,1,2,6) It is very clear
,1,5columns).
that, column space is a subspace of . R4
The row space of the matrix is the space generate by the
vectors (1,1,2,2,3), (1,2,1,2,1), (2,(set

1,2,1,2), (4,4,5,5,6)
of all rows). It is very clear that,
this row space is a subspace of . R5

4.4
We already know that rank of a matrix is number of linearly
independent row or number of linearly independent column.
It is clear that Rank(A) = 3.
Hence the dimension of the column space is 3 and dimension
of the row space is 3.
Because in the current example number of independent vector
in the spanning set of column (row) space is 3.
The null space of a given matrix is the solution space of the
equation Ax 
. 0
4.5
 x1  0
1 1 2 2 3    
   x2  0
1 2 1 2 1    0
2 x3
1 2 1 2    
   x4   0 
4 4 5 5 6 
  
 x 5   0 
The row echelon form (by using row operations) of the

1 1 2 2 3 
coefficient matrix is  
0 1 1 0  2
0 0 1 1 2 
 
0 0 0 0 0 

The null space of a given matrix is the solution space of the
equation . The solutions of the equation is

x1  s  t , x2   s, x3   s  2t , x4  s, x5  t
4.6
i.e. the solution is
x = (s+t, -s, -s-2t, s, t) = s(1, -1, -1, 1, 0)+ t (1, 0, -2, 0, 1)
where s and t are arbitrary.

5
R
The null space of a given matrix is the subspace of
generated by the vectors {(1, -1, -1, 1, 0), (1, 0, -2, 0, 1)}.
Hence the nullity of the matrix is 2.
4.7
Some Theorems:
 A system of linear equations Ax isbconsistent if and only if b
is in the column space of A.
 If x0 is any solution of a consistent linear system Ax  b, and

S  v1 , v 2 ,  , v k 
if is a basis for the null space of A, then every
solution of Axexpressed
can be b in the form
x  x 0  c1 v1  c 2 v 2    c k v k .
Conversely, for all choices of scalarsc 1 , c 2 ,  ,, cthe

k given
vector x is a solution of .
Ax  b
4.8
 Elementary row operations do not change the null space / row
space of a matrix.
 If A and B are row equivalent matrices, then:
a) A given set of column vectors of A is linearly independent
if and only if the corresponding column vectors of B are
linearly independent.
b) A given set of column vectors of A forms a basis for the
column space of A if and only if the corresponding column
vectors of B form a basis for the column space of B.

4.9
Example:
1 1 2 2 3
 
1 2 1 2 1
Consider the same matrix A
2 1 .2 1 2 
 
4 4 5 5 6 

The row space of the matrix is the space generate by the
vectors (1,1,2,2,3), (1,2,1,2,1), (2,(set

1,2,1,2), (4,4,5,5,6)
of all rows).
To find basis of row space: As per the theorem, the row space
won’t get disturb because of row operations. So that to find basis of
row space we can use row echelon form.

4.10
The row echelon form (Find by using row operations) of the
1 1 2 2 3 
coefficient matrix is  
0 1 1 0  2
0 0 1 1 2 
 
0 0 0 0 0 

Hence the basis of the row space of a given matrix is
{(1,1,2,2,3), (0,1,-1,0,-2), (0,0,1,1,2)}.
The column space of the matrix is the space generate by the
vectors (1,1,2,4), (1,2,1,4), (2,1,2,5(set

), (2,of
2,1all (3,1,2,6)
,5),columns).
To find basis of column space also we can use row echelon
4.11
1 1 2 2 3 
 
0 1 1 0  2
0 0 1 1 2 
 
0 0 0 0 0 

To find independent columns, we have to choose the leading
columns.
For those columns original column of original matrix will form
a basis for a column space.
The basis of the column space is {(1,1,2,4), (1,2,1,4),
(2,1,2,5)}.
Leading column in row echelon form:
4.13
Thank
You
4.14

L11 - Linear Algebra - Row, Column & Null Space of A Matrix

Uploaded by

Copyright:

Available Formats

L11 - Linear Algebra - Row, Column & Null Space of A Matrix

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

L11 - Linear Algebra - Row, Column & Null Space of A Matrix

Uploaded by

Copyright:

Available Formats

Linear Algebra

- Row and Column Space

If A is an m⨉n matrix, then

the row space of A.

called the column space of A.

 The solution space (set of all solutions - Assignment) of the

homogeneous linear system of equationsAx  0 , which is a

subspace of R,nis called the null space of A.

If A is an m⨉n matrix, then

 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).

If A is a matrix with n columns, then

So that the column space of the matrix is the space generate by

the vectors (1,1,2,4), (1,2,1,4), (2,1(set

that, column space is a subspace of . R4

The row space of the matrix is the space generate by the

vectors (1,1,2,2,3), (1,2,1,2,1), (2,(set

this row space is a subspace of . R5

independent row or number of linearly independent column.

It is clear that Rank(A) = 3.

Hence the dimension of the column space is 3 and dimension

of the row space is 3.

Because in the current example number of independent vector

in the spanning set of column (row) space is 3.

The null space of a given matrix is the solution space of the

The row echelon form (by using row operations) of the

equation . The solutions of the equation is

x = (s+t, -s, -s-2t, s, t) = s(1, -1, -1, 1, 0)+ t (1, 0, -2, 0, 1)

where s and t are arbitrary.

Hence the nullity of the matrix is 2.

 A system of linear equations Ax isbconsistent if and only if b

is in the column space of A.

 If x0 is any solution of a consistent linear system Ax  b, and

Conversely, for all choices of scalarsc 1 , c 2 ,  ,, cthe

 If A and B are row equivalent matrices, then:

a) A given set of column vectors of A is linearly independent

if and only if the corresponding column vectors of B are

b) A given set of column vectors of A forms a basis for the

column space of A if and only if the corresponding column

vectors of B form a basis for the column space of B.

The row space of the matrix is the space generate by the

vectors (1,1,2,2,3), (1,2,1,2,1), (2,(set

won’t get disturb because of row operations. So that to find basis of

row space we can use row echelon form.

{(1,1,2,2,3), (0,1,-1,0,-2), (0,0,1,1,2)}.

The column space of the matrix is the space generate by the

vectors (1,1,2,4), (1,2,1,4), (2,1,2,5(set

To find basis of column space also we can use row echelon

To find independent columns, we have to choose the leading

For those columns original column of original matrix will form

a basis for a column space.

The basis of the column space is {(1,1,2,4), (1,2,1,4),

You might also like