Scribd
Upload
76 views6 pages

Rank - Nullity - Theorem - Detailed With Examples

Uploaded by

Harsh Solanki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
76 views6 pages

Rank - Nullity - Theorem - Detailed With Examples

Uploaded by

Harsh Solanki
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Rank-Nullity Theorem

The Rank-Nullity Theorem is a fundamental theorem in linear algebra that relates the
dimensions of certain subspaces associated with a linear transformation. For a linear
transformation T :V → W , where V is a vector space of dimension n, the Rank-Nullity

Theorem states:

dim (V )=rank (T )+ nullity(T )

Where:
rank(T) is the dimension of the image (or range) of T (i.e., the number of linearly
independent columns in the matrix).
nullity(T) is the dimension of the kernel (or null space) of T (i.e., the number of linearly
independent solutions to the homogeneous equation T(x) = 0).
dim(V) is the dimension of the domain vector space V.

Algorithm to Find the Rank of a Matrix

1. Form the Matrix:

o Construct the matrix from the given data.

2. Row Reduction to Row Echelon Form (REF):

o Use elementary row operations (row swapping, scaling rows,


adding/subtracting rows) to transform the matrix into Row Echelon Form
(REF), where:

 All non-zero rows are above any rows of all zeros.

 The leading entry (pivot) of each non-zero row is 1 and appears to


the right of the leading entry of the previous row.

3. Identify Pivot Elements:

o Locate the pivot elements (leading 1s) in the matrix.

4. Count the Number of Pivot Elements:


o The rank of the matrix is equal to the number of pivot elements.

5. Verify the Rank:

o Optionally, verify the rank by counting the number of linearly independent


rows or columns.

Notes:

 The rank remains unchanged under elementary row operations.

 Row rank and column rank are always equal.

 A matrix has full rank if its rank is equal to the minimum of its number of rows
and columns.
In the following examples, we will perform row reductions to find the rank and
nullity of matrices.

Example 1
Consider the matrix A:

[ ]
1 2
A= 3 4 R 2→ R 2−3∗R 1 , R 3 → R 3−5∗R 1 :
5 6

[ ]
1 2
A= 0 −2 Step 2:
0 −4

R 3 → R 3−2∗R 2 :

[ ]
1 2
A= 0 −2 nullity (A )=number of columns−rank =2−2=0.
0 0
Thus, rank (A )+ nullity (A )=2+0=2.
Example 2
Consider the matrix B:

[ ]
1 2 3
B= 4 5 6 R 2→ R 2−4∗R 1 , R 3 → R 3−7∗R 1 :
7 8 9

[ ]
1 2 3
B= 0 −3 −6
0 −6 −12

R 3 → R 3−2∗R 2 :

[ ]
1 2 3
B= 0 −3 −6 The rank of B is 2.
0 0 0
The nullity is: nullity (B)=number of columns−rank =3−2=1.
Thus, rank (B)+nullity (B)=2+1=3.
Example 3
Consider the matrix C:

[ ]
2 4 6
C= 1 2 3 R 2→ R 2−0.5∗R 1 :
0 0 0

[ ]
2 4 6
C= 0 0 0
0 0 0

[ ]
1 2 3
C= 0 0 0 nullity (C)=number of columns−rank=3−1=2. rank (C)+nullity (C)=1+ 2=3.
0 0 0
Example 4
Consider the identity matrix D:

[ ]
1 0 0
D= 0 1 0 nullity( D)=number of columns−rank=3−3=0.rank (D)+ nullity (D)=3+0=3.
0 0 1

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy