Let , be a matrix, such that .
Statement - I: .
Statement - II: The polynomial , can be reduced to . Then:
We are told that the square of the matrix satisfies the quadratic relation
where is the identity matrix and is the zero matrix. This single equation is the only information we need; every other result will follow just by ordinary algebra on matrices.
First, we rearrange this relation so that the constant term is on the left:
Multiplying both sides by gives a slightly friendlier form:
and, equivalently,
Now we investigate Statement I, which concerns the inverse of . Because the right‐hand side is , whose determinant is we already know that is non-singular and an inverse exists. To display that inverse explicitly, we right-multiply both sides by (allowed because exists):
We now perform the right multiplication term by term:
Using the basic facts and we simplify each term:
Finally we isolate by dividing by the scalar :
This matches Statement I exactly, so Statement I is true.
Next, we verify Statement II. We wish to simplify the cubic polynomial
The idea is to eliminate every occurrence of or higher powers in favour of lower ones using the basic relation
We start by writing as and then substituting for :
Substituting this expression for into the cubic polynomial, we get
Now we gather the terms together and the terms together:
We still have an term, so we substitute once more using :
Replacing with this result in the expression yields
Combining like terms produces
A common factor of can be taken out:
This is exactly the reduction claimed in Statement II, so Statement II is also true.
We have demonstrated that both statements are correct.
Hence, the correct answer is Option A.
Tagged Adjoint and inverse of a matrix. Machine-assigned, so read it as a strong shortlist rather than a verdict.