Animated Solution for Mathematics - Matrices and Determinants: Let M=(aij),i,j∈{1,2,3}, be the 3×3 matrix such that aij=1 if j+1 is divisible by i, otherwise aij=0. Then which of the following statements is (are) true ?
Select Answer:
* Multiple Correct
Visualized Solution
Defining Matrix M
We need to construct a 3×3 matrix M=(aij).
The condition is: aij=1 if i divides (j+1).
Otherwise, aij=0.
Here, i∈{1,2,3} is the row index and j∈{1,2,3} is the column index.
Row 1 Elements (i=1)
For the first row, i=1.
We check if 1 divides (j+1) for j=1,2,3.
j=1⇒j+1=2. 1 divides 2, so a11=1.
j=2⇒j+1=3. 1 divides 3, so a12=1.
j=3⇒j+1=4. 1 divides 4, so a13=1.
Row 2 Elements (i=2)
For the second row, i=2.
We check if 2 divides (j+1) for j=1,2,3.
j=1⇒j+1=2. 2 divides 2, so a21=1.
j=2⇒j+1=3. 2 does not divide 3, so a22=0.
j=3⇒j+1=4. 2 divides 4, so a23=1.
Row 3 Elements and Matrix M
For the third row, i=3.
j=1⇒j+1=2. 3 does not divide 2, so a31=0.
j=2⇒j+1=3. 3 divides 3, so a32=1.
j=3⇒j+1=4. 3 does not divide 4, so a33=0.
M=110101110
Determinant of M
Option A claims M is invertible.
A matrix is invertible if and only if its determinant is non-zero (∣M∣=0).
∣M∣=1(0−1)−1(0−0)+1(1−0)
∣M∣=−1−0+1=0
Since ∣M∣=0, M is not invertible. Option A is false.
Homogeneous System MX=0
Option C discusses the set {X∈R3:MX=0}.
This represents a system of homogeneous linear equations.
It always has the trivial solution X=0.
Non-trivial solutions exist if and only if ∣M∣=0.
Evaluating Option C
We already established that ∣M∣=0.
This means the system MX=0 has infinitely many non-trivial solutions.
Thus, the solution set is not just {0}.
Therefore, {X∈R3:MX=0}={0} is true. Option C is correct.
Analyzing MX=−X
Option B states there exists a non-zero X such that MX=−X.
We can rewrite this as MX+X=0.
Factoring out X, we get (M+I)X=0, where I is the identity matrix.
For a non-zero solution X to exist, we must have ∣M+I∣=0.
Matrix M+I
Let's find the matrix M+I.
M+I=110101110+100010001
M+I=210111111
Determinant of M+I
Now, calculate the determinant of M+I.
∣M+I∣=2(1−1)−1(1−0)+1(1−0)
∣M+I∣=2(0)−1(1)+1(1)=0
Since ∣M+I∣=0, a non-zero X exists. Option B is true.
Matrix M−2I
Option D claims the matrix (M−2I) is invertible.
M−2I=110101110−200020002
M−2I=−1101−2111−2
Determinant of M−2I
To check invertibility, we calculate ∣M−2I∣.
∣M−2I∣=−1(4−1)−1(−2−0)+1(1−0)
∣M−2I∣=−1(3)−1(−2)+1(1)
∣M−2I∣=−3+2+1=0
Since the determinant is 0, (M−2I) is not invertible. Option D is false.
Final Answer
Option A is False (M is not invertible).
Option B is True (Non-zero X exists for MX=−X).
Option C is True (Null space of M is non-trivial).
Option D is False ((M−2I) is not invertible).
Correct Options: B and C
00:00 / 00:00
The Sigma Insight: Solution of System of Linear Equations (Matrix Method and Cramer's Rule)
Phase 1
The Code-Breaking Construction
Imagine you are standing before a 3×3 grid. You have the power to fill it, but only if you obey the law: aij=1 if i divides (j+1), and 0 otherwise.
For the first row, i=1. Since 1 divides every integer, every element in the first row is 1. Our first row is (1,1,1).
For the second row, i=2. We check j=1,2,3:
For j=1, j+1=2, which is divisible by 2.
For j=2, j+1=3, which is not.
* For j=3, j+1=4, which is divisible by 2.
Thus, the second row is (1,0,1).
For the third row, i=3:
For j=1, j+1=2 (no).
For j=2, j+1=3 (yes).
* For j=3, j+1=4 (no).
The third row is (0,1,0).
Our matrix M stands revealed:
M=110101110
Phase 2
The Gatekeeper
The determinant is the gatekeeper of matrix properties. It tells us if a matrix is invertible or singular. Let us calculate ∣M∣.
Expanding along the first row:
∣M∣=1(0−1)−1(0−0)+1(1−0)=−1−0+1=0
The determinant is zero! This is a massive revelation. It means M is not invertible, instantly falsifying Option A.
Furthermore, because ∣M∣=0, the homogeneous system MX=0 must have non-trivial solutions. This confirms Option C is true.
Phase 3
The Hidden Symmetry
Now, look at Option B: MX=−X. This is not just an equation; it is a question about eigenvalues. If we rearrange this, we get MX+IX=0, or (M+I)X=0.
For a non-zero vector X to exist, the matrix (M+I) must be singular, meaning ∣M+I∣=0. Let us construct M+I:
M+I=1+11010+11110+1=210111111
Now, calculate its determinant:
∣M+I∣=2(1−1)−1(1−0)+1(1−0)=2(0)−1+1=0
The determinant is zero! This confirms that a non-zero vector X exists. Option B is true.
Phase 4
The Final Verdict
Finally, we evaluate M−2I. We construct it:
M−2I=−1101−2111−2
Calculating the determinant:
∣M−2I∣=−1(4−1)−1(−2−0)+1(1−0)=−3+2+1=0
Since the determinant is zero, M−2I is not invertible. Therefore, Option D is false.
We have systematically dismantled the problem. The truth lies in Options B and C.