CA 1 Assignment
Name: MD TOUHID
Department: BTECH CSE (AI/ML)
University Roll No.: 25330825021
Reg. No.: 252530110092
Semester: 1st
Year: 2025-26
Subject : MATHEMATICS
Topic of the Presentation: Rank And Solutions Of A System Of Linear Equations By Matrix Method
RANK AND SOLUTIONS OF A
SYSTEM OF LINEAR
EQUATIONS BY MATRIX
METHOD
CONTENTS
• Introduction of System of linear Equation
• Types of Solutions in Linear equations
• Augmented Matrix
• Gaussian Elimination Method
• Finding Rank And Solutions of a Linear Equations
• Conclusion
What Is A System Of Linear Equations ?
A system of linear equations or linear system is a finite collections of linear equations in same
variables. For instance, a linear system of m equations in n variables x1, x2,......, xn can be written as
a11x1 + a12x2 +…..+ a1nxn = b1
a21x1 + a22x2 +…..+ a2nxn = b2
am1x1 + am2x2 +…..+ amnxn = bm
Where, a is coefficients and x is variables.
Types Solutions of a System of Linear Equations:
There are three types of Solutions :
1. Unique Solutions(Consistent)
• A system has a unique solutions if there is exactly one set of values for the variables(n).
• Matrix Condition: Rank(A) = Rank([A|B]) = n.
2. Infinitely Solutions (Consistent)
• A system has infinitely many solutions if there are an infinitely number of sets of value for all the variables(n).
• Matrix Condition: Rank(A) = Rank([A|B]) < n.
3. No Solutions (Inconsistent)
• A system has no set of values for the variables that can satisfy all the equations.
• Matrix Condition: Rank(A) ≠ Rank([A|B]).
What is Rank ?
In the linear equations, the rank of a matrix is the maximum number of linearly independent (filled with zeroes) rows or
columns. It indicates the number of independent equations in the system and is crucial for determining the number of
solutions: a unique solution, infinite solutions, or no solution.
The rank of the coefficient matrix (A) and the augmented matrix ([A|B]) is compared to the number of variables (n) to
determine the system's solution set.
What Is Augmented Matrix
An Augmented Matrix is a fundamental concept used to efficiently represent and solve a system of linear equations. It
is formed by combining the coefficient matrix of the system with the column vector of constants (the right-hand side
of the equations). The process essentially replaces the variables, plus signs, and equal signs with a compact array of
numbers. Structure and Formation For a system of m linear equations with n variables, typically written in the form
AX=B.
a11x1 + a12x2 +…..+ a1nxn = b1
a21x1 + a22x2 +…..+ a2nxn = b2 Let, a11 a12 a1n b1
Linear
Equation a21 a22 a2n b2
=A =B
am1x1 + am2x2 +…..+ amnxn = bm am1 a22 amn bm
a11 a12 a1n b1
a21 a22 a2n b2
Augmented Matrix Form
([A|B])
am1 a22 amn bm
Gaussian Elimination or Gaussian Jorden Elimination
Gaussian elimination is an algorithm for solving linear equations by transforming the augmented matrix into an upper
triangular form (row echelon form) using elementary row operations, and then using back-substitution to find the
solution. It's used to find Rank and unique, no, or infinite solutions to systems of equations by systematically
eliminating variables to simplify the problem.
Steps Involved:
• Create the augmented matrix: Write the system of linear equations as an augmented matrix, which combines the
coefficient matrix and the constant vector.
• Forward elimination: Use elementary row operations to transform the matrix into upper triangular or row echelon
form, creating zeros below the main diagonal.
• Elementary row operations: include swapping two rows, multiplying a row by a non-zero constant, or adding a
multiple of one row to another row.
• Back-substitution: Solve the simplified system starting from the last equation and substitute the values back into
the previous equations to find the remaining variables.
Rank and Solutions of the Linear Equation
Example:
Let’s solve the following system of equations:
x + 2y + z = 6
Let, [ 1 2 1 ] [x] [6]
2x – y + 3z = 12 [ 2 -1 3 ] = A [y]= X [12] = B
3x + y + 2z = 11 [3 1 2] [z] [11]
Step 1: Write the augmented matrix
[1 2 1 | 6]
[ 2 -1 3 | 12 ] = ([A|B])
[3 1 2 | 11]
Step 2: Use row operations on augmented matrix to get to row echelon form ( Gaussian Elimination Method)
Operation 1: Replace row 2 with R2 - 2R1 Operation 2: Replacing row 3 with R3 - 3R1 Operation 3: Replacing row 3 with R3 – R2
[1 2 1|6 ] [1 2 1| 6 ] Final Matrix: [ 1 2 1 | 6 ]
[ 0 -5 1 | 0 ] [ 0 -5 1 | 0 ] [ 0 -5 1 | 0 ]
[ 3 1 2 | 11 ] [ 0 -5 -1 | -7 ] [ 0 0 -2 | -7 ]
The matrix is now echelon form.
Step 3: Find The Rank:
• Counting the non-zero rows. There are a 3 non- zero rows in the final matrix.
• Rank: the rank is 3.
Step 4: Determine the types of solution:
R(A) = R([A|B]) = n = 3, then the system is consistent with a unique solution.
Step 5: Use Back- substitution to find the solution:
Equation 3: -2z = -7 => z= 7/2
Equation 2: -5y + z = 0 => y = 7/10
Equation 1: x + 2y + z = 6 => x= 11/10
So the solutions is x=11/10 , y = 7/10 , z = 7/2.
Conclusion
The conclusion of a project on the rank and solution of linear
equations using the matrix method typically synthesizes the
understanding of how matrix properties directly determine the nature
of solutions.