Q.Find for .
For a matrix, the adjoint is found by swapping the diagonal entries and changing the sign of the off-diagonal entries. For , .
The adjoint of a matrix is the transpose of its cofactor matrix. For a matrix, this simplifies to a neat pattern that saves you from computing cofactors individually every time.
Why this works: The cofactor of an entry is times the determinant of the submatrix obtained by deleting row and column . For a matrix, each cofactor is just a single number (the other entry, with a possible sign change). Transposing the cofactor matrix then gives the adjoint.
Let’s apply this step by step.
-
Write down the matrix.
.
-
Find the cofactor of each entry.
- For : delete row 1, column 1 → submatrix is . Cofactor .
- For : delete row 1, column 2 → submatrix is . Cofactor .
- For : delete row 2, column 1 → submatrix is . Cofactor .
- For : delete row 2, column 2 → submatrix is . Cofactor .
So the cofactor matrix is .
-
Transpose the cofactor matrix to get the adjoint.
The adjoint is the transpose: swap rows and columns.
.
For any matrix , the adjoint is . Just swap and , then flip the signs of and . No cofactor calculation needed.
A common mistake is to forget the transpose step — students sometimes write the cofactor matrix directly as the adjoint. Remember: adjoint = (cofactor matrix), not the cofactor matrix itself.
The adjoint of is .
Unlock everything free for 14 days
- Full step-by-step solutions
- Concept-first explanations
- Methods, shortcuts & mistakes
- PYQ mapping + timed mock tests
Full access for 14 days. No credit card required.