Matrices and Determinants: Solving for Singularity and Consistency

Introduction

In our last lesson, we learned how to solve systems of linear equations using the matrix inversion method and Cramer's rule. We also took a first look at the conditions that determine whether a system has a unique solution, no solution, or infinitely many solutions, based on the values of the determinants involved.

This lesson builds directly on that foundation. Our goal is to formalize these concepts of singularity and consistency. We will move beyond just applying rules and develop a more robust framework for analyzing linear systems using the concept of matrix rank. Mastering this is crucial, as a significant number of questions in your MHT-CET exam will ask you to find the value of a parameter (e.g., $λ$ or $μ$ ) for which a system of equations behaves in a certain way.

Singularity and Consistency: The Big Picture

Let's begin by clearly defining the key terms.

Singular vs. Non-Singular Matrix: A square matrix $A$ is called non-singular if its determinant is non-zero ( $det (A) \neq = 0$ ). If $det (A) = 0$ , the matrix is called singular. This property is fundamental because, as you know, a matrix has an inverse if and only if it is non-singular.
Consistent vs. Inconsistent System: A system of linear equations is consistent if it has at least one solution (this could be a single unique solution or infinitely many solutions). If there is no solution, the system is inconsistent.
Homogeneous vs. Non-Homogeneous System:
- A system of the form $A X = B$ , where $B$ is a non-zero column matrix, is called non-homogeneous. This is what we have mostly dealt with so far.
- A system of the form $A X = 0$ , where the right-hand side is the zero matrix, is called homogeneous. Such a system is always consistent because $X = 0$ (all variables equal to zero) is always a solution, known as the trivial solution. The interesting question for homogeneous systems is whether they also have non-trivial solutions.

In the previous lesson, we used the flowchart below to decide the type of solution based on the determinants from Cramer's Rule.

This flowchart outlines the conditions for a system of linear equations to have a unique solution, no solution, or infinitely many solutions based on the determinants Δ, Δ₁, Δ₂, and Δ₃.

This method is fast and effective. However, to tackle more complex problems and gain a deeper understanding, we need a more general method: the rank method.

The Rank Method for Analyzing Consistency

The rank of a matrix is a powerful concept that provides a complete picture of a system's consistency. The rank, denoted as $ρ (A)$ , is the number of non-zero rows in the matrix after it has been reduced to its row echelon form using elementary row operations.

Let's define the key components and rules for a non-homogeneous system $A X = B$ .

[PDF] MODULE-3 MATRIX ALGEBRA

This document from MITE provides a formal and clear explanation of the rank method. We'll read it in a few parts to build our understanding.

First, familiarize yourself with the concept of the augmented matrix, which combines the coefficient matrix A and the constant matrix B. Read the short definition under the heading AUGMENTED MATRIX. Next, understand what elementary row operations are. These are the tools we use to simplify a matrix without changing the solution of the system it represents. Read the three bullet points under ELEMENTARY ROW TRANSFORMATIONS. Now, let's see how these operations are used to find the rank. Read the definition of rank and look at the first worked example under the heading RANK OF A MATRIX to see how a matrix is reduced to echelon form to find its rank. Finally, let's look at the rules that connect rank to the number of solutions. Read the section SOLUTION OF NON-HOMOGENEOUS SYSTEM. Pay close attention to the conditions involving the rank of the coefficient matrix, \rho(A), and the rank of the augmented matrix, \rho([A:B]).

Let's summarize the rules from the reading. For a system of $n$ variables:

Inconsistent System (No Solution): If the rank of the coefficient matrix is not equal to the rank of the augmented matrix.
$ρ (A) \neq = ρ ([A : B])$
Consistent System (At least one solution): If the ranks are equal.
$ρ (A) = ρ ([A : B])$
In this case, there are two possibilities:
- Unique Solution: If the rank is equal to the number of variables. $ρ (A) = ρ ([A : B]) = n$
- Infinitely Many Solutions: If the rank is less than the number of variables. The number of free parameters you can choose is $n - ρ (A)$ . $ρ (A) = ρ ([A : B]) < n$

Conditions for Homogeneous Systems

For a homogeneous system $A X = 0$ , the situation is simpler. Since the last column of the augmented matrix $[A ∣ 0]$ is all zeros, its rank will always be equal to the rank of $A$ . Thus, homogeneous systems are always consistent. The only question is whether we have only the trivial solution or infinite non-trivial solutions.

Trivial Solution Only ( $X = 0$ ): This occurs if the system has a unique solution. Based on the rules above, this means $ρ (A) = n$ . For a square matrix, this is equivalent to $det (A) \neq = 0$ .
Infinite Non-Trivial Solutions: This occurs if $ρ (A) < n$ . For a square matrix, this is equivalent to the crucial condition: $det (A) = 0$

This last point is extremely important for competitive exams. Whenever a question asks for the condition for a homogeneous system to have a non-trivial solution, it is simply asking you to set the determinant of the coefficient matrix to zero.

Application: Solving Problems with Parameters

The most common application of these concepts in MHT-CET and JEE involves systems with unknown parameters. You'll be asked to find the values of these parameters that result in a specific type of solution (unique, infinite, or none).

Let's examine how this works.

[PDF] MODULE-3 MATRIX ALGEBRA

The same PDF provides excellent worked examples. We will focus on one that deals with parameters.

Find and read Example 6 in the "EXAMPLES" section. It starts with the system "Find the values of λ and μ". Follow the steps of reducing the augmented matrix to row echelon form. The final form of the matrix contains terms with \lambda and \mu. The analysis then depends on setting these terms to zero or non-zero to satisfy the conditions for each solution type.

The logic used in that example is the key to solving these problems:

Set up the augmented matrix $[A : B]$ .
Use row operations to reduce it to echelon form. Your goal is to create zeros in the lower-left part of the matrix.
Examine the last non-zero row(s) of the echelon form. The expressions involving the parameters ( $λ, μ$ ) will determine the ranks $ρ (A)$ and $ρ ([A : B])$ .
Apply the rank conditions:
- For no solution: Set things up so $ρ (A) \neq = ρ ([A : B])$ . This usually means making the last entry in a row of the $A$ part zero, while the corresponding entry in the $B$ part is non-zero. In the example, this corresponds to $λ - 3 = 0$ and $μ - 10 \neq = 0$ .
- For infinite solutions: Set things up so $ρ (A) = ρ ([A : B]) < n$ . This usually means making an entire row (both in the $A$ part and the $B$ part) zero. In the example, this is $λ - 3 = 0$ and $μ - 10 = 0$ .
- For a unique solution: Set things up so $ρ (A) = ρ ([A : B]) = n$ . This means the diagonal elements (or leading elements in each row) of the $A$ part are non-zero. In the example, $λ - 3 \neq = 0$ .

The same logic can be applied using determinants, which can sometimes be faster if you don't need to find the full solution. Let's look at some examples solved this way.

Cramer’s Rule: Definition, Properties, Formula and Examples

This resource from Careers360 shows how to solve similar parameter-based problems from the JEE Mains exam using the determinant method (Cramer's Rule conditions).

Read through the Solved Examples 1, 3, and 5. Notice the strategy: For infinitely many solutions (or a line of intersection, as in Example 5), the condition is \Delta = \Delta_1 = \Delta_2 = \Delta_3 = 0. For no solution, the condition is \Delta = 0 and at least one of \Delta_1, \Delta_2, \Delta_3 is non-zero. Pay attention to how they set up and solve the determinant equations to find the values of the parameters. This approach directly mirrors the logic you saw with the rank method but uses determinants instead of row reduction.

Conclusion

This lesson completes our study of matrices and determinants by tying everything together. We have formalized the conditions under which a system of linear equations has a unique solution, no solution, or infinitely many solutions.

Here are the key takeaways:

A system $A X = B$ has a unique solution if and only if the coefficient matrix $A$ is non-singular ( $det (A) \neq = 0$ ).
If $A$ is singular ( $det (A) = 0$ ), the system can have either no solution or infinitely many solutions.
We can determine the exact outcome using two main methods:
1. Cramer's Rule Determinants: Check if $Δ_{x}, Δ_{y}, Δ_{z}$ are zero or non-zero.
2. Matrix Rank: Compare the rank of the coefficient matrix, $ρ (A)$ , with the rank of the augmented matrix, $ρ ([A : B])$ .
For homogeneous systems ( $A X = 0$ ), the condition for having non-trivial solutions is simply $det (A) = 0$ .

With this, you have concluded the first module. You are now equipped with the essential tools from mathematical logic, matrices, and determinants needed for your MHT-CET preparation.

In our next lesson, we will begin Module 2: Trigonometry & Inverse Trigonometric Functions. We will start by reviewing the fundamental sum, difference, multiple, and sub-multiple angle formulas, addressing an area you've highlighted for improvement.

Recommended resources