Q.If A=(1223), verify that A(adjA)=∣A∣I=(adjA)A.
Concept understanding — Adjoint and Inverse of a Matrix
For a square matrix A=[aij] of order n, the cofactor of aij is the signed minor Aij=(−1)i+jMij (the minor Mij is the determinant left after deleting row i and column j). Replace every entry of A by its cofactor to get the cofactor matrix; its transpose is the adjoint, adjA.
Theorem (the central identity). For every square matrix A of order n,
A(adjA)=(adjA)A=∣A∣In.
This follows from Laplace expansion: a row's entries dotted with their own cofactors reproduce ∣A∣, while a row's entries dotted with a different row's cofactors always give 0 -- so the product matrix is ∣A∣ on the diagonal and 0 off it.
Definition of the inverse. A square matrix B with AB=BA=In is called the inverse of A, written A−1. The inverse, when it exists, is unique. A−1 exists if and only if A is non-singular (∣A∣=0): dividing the central identity by ∣A∣ (possible exactly when ∣A∣=0) gives the working formula
A−1=∣A∣1adjA.
A singular matrix (∣A∣=0) has no inverse.
Worked illustration (order 2). For A=(acbd), the cofactors are A11=d, A12=−c, A21=−b, A22=a, so adjA=(d−c−ba) (swap the diagonal entries, negate the off-diagonal ones) and A−1=ad−bc1(d−c−ba) whenever ad−bc=0.
Standing laws of inverses (for non-singular A,B of the same order, λ=0 a scalar):
- ∣A−1∣=∣A∣1.
- (AT)−1=(A−1)T.
- (λA)−1=λ1A−1.
- Left/right cancellation: AB=AC⇒B=C; BA=CA⇒B=C (pre/post-multiply by A−1) -- this fails when A is singular.
- Reversal law: (AB)−1=B−1A−1 (note the order flips, exactly as for transposes).
- Double inverse: (A−1)−1=A.
Six adjoint identities (non-singular A, order n): (i) adj(A−1)=(adjA)−1=∣A∣A; (ii) ∣adjA∣=∣A∣n−1; (iii) adj(adjA)=∣A∣n−2A; (iv) adj(λA)=λn−1adjA; (v) ∣adj(adjA)∣=∣A∣(n−1)2; (vi) (adjA)T=adj(AT); and for two non-singular matrices of the same order, adj(AB)=(adjB)(adjA) (order reverses, exactly like the inverse and the transpose).
For a non-singular matrix of order 3, since ∣adjA∣=∣A∣2>0, one can also write A=±adjA1adj(adjA) -- useful when only adjA is given and A itself must be recovered.
Orthogonal matrices. A square matrix A is orthogonal if AAT=ATA=I, equivalently A is non-singular and A−1=AT. The standard rotation matrix W=(cosθsinθ−sinθcosθ) that converts one 2-D coordinate system into another (rotated by θ) is orthogonal, since W−1=WT is exactly the inverse rotation by −θ.
Cryptography via a non-singular matrix. Assign each letter A--Z a number 1--26 and a blank space 0. Group the plaintext numbers into row vectors of length n (padding with 0s if needed) and multiply each by a chosen non-singular encoding matrix E of order n (post-multiplication: (row)×E) to get the coded row. The receiver recovers the plaintext by post-multiplying each coded row by the decoding matrix E−1, since (row)E⋅E−1=row. The security of the scheme rests entirely on E being invertible and known only to sender and receiver.
[!TLDR] Compute ∣A∣=−1, adjA, then both products A(adjA) and (adjA)A. [!ANSWER] Both products equal −I=∣A∣I, confirming the relation both ways.
For A=(1223): ∣A∣=1(3)−2(2)=3−4=−1. By the shortcut, adjA=(3−2−21). Then A(adjA)=(1223)(3−2−21)=(3−46−6−2+2−4+3)=(−100−1)=−I. Also (adjA)A=(3−2−21)(1223)=(3−4−2+26−6−4+3)=(−100−1)=−I. Both equal −I=∣A∣I since ∣A∣=−1. [!ANSWER] Both products equal −I=∣A∣I, confirming the relation both ways.
Find ∣A∣ and adjA, then multiply in both orders, A(adjA) and (adjA)A, confirming each equals the scalar matrix ∣A∣I.
Verifying only one of the two products (A(adjA) alone) and assuming the reverse order automatically matches -- matrix multiplication is not commutative in general, so both orders should genuinely be checked.
Showing the 12 most recent of 15 on this concept.
- CBSE 2026Set ANNUAL1 markMCQQ.If A is a 3×3 non-singular matrix such that AAT=ATA and B=A−1AT, then BBT=(a) I3(b) A(c) BT(d) B
›Reveal solutionSolution
Uses the given normal-matrix condition AAT=ATA to collapse BBT down to the identity.
- Given B=A−1AT. Taking transpose: BT=(A−1AT)T=(AT)TA−T=A(AT)−1.
- So BBT=(A−1AT)(A(AT)−1)=A−1(ATA)(AT)−1.
- Using the given condition AAT=ATA, substitute ATA=AAT: BBT=A−1(AAT)(AT)−1.
- Regroup: BBT=(A−1A)(AT(AT)−1)=I3⋅I3=I3.
✓Final answer(a) I3
- CBSE 2026Set SEM31 markMCQQ.If the inverse of a matrix A of order 3×3 exists and ∣A∣=5, then the value of ∣adjA∣ is(a) 20(b) 15(c) 5(d) 25
›Reveal solutionSolution
Use the identity ∣adjA∣=∣A∣n−1 with n=3.
The adjoint–determinant relation is a CBSE/NCERT Class 12 determinants and adjoint/inverse result.
For a non-singular matrix of order n, the standard identity is
∣adjA∣=∣A∣n−1.
With n=3 and ∣A∣=5:
∣adjA∣=53−1=52=25.
✓Final answer∣adjA∣=25 — option (d).
- CBSE 2025Set ANNUAL1 markMCQQ.If A is a non-singular matrix of order 3×3 and ∣A∣=5 then ∣A−1∣ is :(a) 52(b) 5(c) 521(d) 51
›Reveal solutionSolution
The standard determinant identity ∣A−1∣=1/∣A∣ gives the answer directly by substitution.
- Since AA−1=I, taking determinants of both sides: ∣A∣∣A−1∣=∣I∣=1.
- So ∣A−1∣=∣A∣1.
- Given ∣A∣=5: ∣A−1∣=51.
✓Final answer(d) 51
- CBSE 2025Set ANNUAL1 markMCQQ.If A=[253−2] be such that λA−1=A, then λ is :(a) 19(b) 17(c) 21(d) 14
›Reveal solutionSolution
Multiplying the given relation by A turns it into A2=λI, so λ is found by directly computing A2.
- Given λA−1=A. Multiply both sides on the left by A: λAA−1=A⋅A⇒λI=A2.
- Compute A2 for A=[253−2].
- Row 1: (2)(2)+(3)(5)=4+15=19; (2)(3)+(3)(−2)=6−6=0.
- Row 2: (5)(2)+(−2)(5)=10−10=0; (5)(3)+(−2)(−2)=15+4=19.
- So A2=[190019]=19I.
- Comparing with λI=A2: λ=19.
✓Final answer(a) 19
- CBSE 2024Set ANNUAL1 markMCQQ.If A is a non-singular matrix such that A−1=[5−23−1], then (AT)−1=(a) [−12−35](b) [−5231](c) [53−2−1](d) [5−23−1]
›Reveal solutionSolution
Uses the identity (AT)−1=(A−1)T and simply transposes the given A−1.
- A standard matrix identity: (AT)−1=(A−1)T (the inverse of the transpose equals the transpose of the inverse).
- Given A−1=[5−23−1].
- (A−1)T=[53−2−1] (swap rows and columns).
- So (AT)−1=[53−2−1].
✓Final answer(c) [53−2−1]
- CBSE 2024Set ANNUAL1 markMCQQ.If A, B and C are invertible matrices of some order, then which one of the following is not true ?(a) detA−1=(detA)−1(b) adjA=∣A∣A−1(c) (ABC)−1=C−1B−1A−1(d) adj(AB)=(adjA)(adjB)
›Reveal solutionSolution
Checking each identity against the standard matrix-algebra facts, only the adjugate-of-a-product rule has its order reversed from what's stated.
- (a) detA−1=(detA)−1: always true, since det(A)det(A−1)=det(AA−1)=detI=1.
- (b) adjA=∣A∣A−1: always true — this is the defining relation A⋅adjA=∣A∣I, rearranged using A−1.
- (c) (ABC)−1=C−1B−1A−1: always true (reverse-order law for inverses of a product).
- (d) The correct reverse-order law for adjugates is adj(AB)=(adjB)(adjA) — the stated (adjA)(adjB) has the order un-reversed, and is not true in general (only when A,B commute appropriately). So this is the one that is NOT true in general.
✓Final answer(d) adj(AB)=(adjA)(adjB)
- CBSE 2023Set ANNUAL1 markMCQQ.A square matrix A of order n has inverse if and only if :(a) ρ(A)>n(b) ρ(A)=n(c) ρ(A)=n(d) ρ(A)<n
›Reveal solutionSolution
A square matrix has an inverse exactly when it is non-singular, i.e. when its rank equals its order.
- A square matrix A of order n has an inverse iff A is non-singular, i.e. ∣A∣=0.
- ∣A∣=0 for an n×n matrix happens exactly when all n rows (columns) are linearly independent, i.e. when the rank ρ(A)=n.
- If ρ(A)<n, some row is a linear combination of others, ∣A∣=0, and A−1 does not exist.
✓Final answer(b) ρ(A)=n
- CBSE 2023Set ANNUAL1 markMCQQ.∣adj(adjA)∣=∣A∣16, then the order of the square matrix A is :(a) 2(b) 3(c) 5(d) 4
›Reveal solutionSolution
Using the standard identity ∣adjA∣=∣A∣n−1 twice gives ∣adj(adjA)∣=∣A∣(n−1)2, matched against the exponent 16.
- For an n×n matrix A, the standard identity is ∣adjA∣=∣A∣n−1.
- Applying it to adjA (also n×n): ∣adj(adjA)∣=∣adjA∣n−1=(∣A∣n−1)n−1=∣A∣(n−1)2.
- Given ∣adj(adjA)∣=∣A∣16, matching exponents: (n−1)2=16⇒n−1=4⇒n=5.
✓Final answer(c) 5
- CBSE 2022Set ANNUAL1 markMCQQ.If A=[253−2] be such that λA−1=A, then λ is :(a) 19(b) 17(c) 21(d) 14
›Reveal solutionSolution
Multiplying both sides of λA−1=A by A gives λI=A2; computing A2 shows it equals 19I, so λ=19.
- We are given λA−1=A for A=[253−2].
- Post-multiplying both sides by A: λA−1A=A⋅A, i.e. λI=A2.
- Compute A2=[253−2][253−2].
- The (1,1) entry is 2(2)+3(5)=4+15=19; the (1,2) entry is 2(3)+3(−2)=6−6=0.
- The (2,1) entry is 5(2)+(−2)(5)=10−10=0; the (2,2) entry is 5(3)+(−2)(−2)=15+4=19.
- So A2=[190019]=19I.
- Comparing with λI=A2=19I, we get λ=19.
✓Final answerλ=19 — option (a).
- CBSE 2022Set ANNUAL1 markMCQQ.Which one of the following is incorrect ?(a) If A is a square matrix of order n, and λ is a scalar, then Adj (λA)=λn (Adj A).(b) Adjoint of a symmetric matrix is also a symmetric matrix.(c) A(Adj A) = (Adj A)A = |A|I.(d) Adjoint of a diagonal matrix is also a diagonal matrix.
›Reveal solutionSolution
The adjoint scaling law is Adj(λA)=λn−1Adj(A), not λnAdj(A), so statement (a) is the incorrect one.
- Each entry of Adj(A) is a cofactor of A, obtained from an (n−1)×(n−1) minor.
- If every entry of A is scaled by λ to form λA, each (n−1)×(n−1) minor (a determinant of n−1 rows/columns, each scaled by λ) scales by λn−1.
- Hence the correct identity is Adj(λA)=λn−1Adj(A), so the claim in (a) that it equals λnAdj(A) is false.
- Statement (b) is a standard true property: the adjoint (transpose of the cofactor matrix) of a symmetric matrix is symmetric.
- Statement (c) is the fundamental adjoint identity A(Adj A)=(Adj A)A=∣A∣I, which always holds.
- Statement (d) is true: cofactors of a diagonal matrix off the leading diagonal vanish, so its adjoint is also diagonal.
- Since (b), (c), (d) are all true and (a) misstates the exponent, (a) is the incorrect statement.
✓Final answerStatement (a) is incorrect — the correct law is Adj(λA)=λn−1(Adj A).
- CBSE 2020Set ANNUAL1 markMCQQ.If (AB)−1=[12−19−1727] and A−1=[1−2−13], then B−1=(a) [8−3−52](b) [2−3−58](c) [8352](d) [3211]
›Reveal solutionSolution
Using (AB)−1=B−1A−1⇒B−1=(AB)−1A, and finding A from A−1, gives B−1=[2−3−58].
- For invertible matrices, (AB)−1=B−1A−1.
- Multiply both sides on the right by A: (AB)−1A=B−1A−1A=B−1I=B−1. So B−1=(AB)−1A.
- We need A, but are given A−1=[1−2−13]. Since A=(A−1)−1, invert this matrix.
- For a 2×2 matrix [prqs], the inverse is ps−qr1[s−r−qp]. Here p=1,q=−1,r=−2,s=3, so det(A−1)=1(3)−(−1)(−2)=3−2=1.
- So A=11[3211]=[3211]. (Check: AA−1=[3211][1−2−13]=[3−22−2−3+3−2+3]=[1001], correct.)
- Now compute B−1=(AB)−1A=[12−19−1727][3211].
- Row 1: [12(3)+(−17)(2), 12(1)+(−17)(1)]=[36−34, 12−17]=[2,−5].
- Row 2: [−19(3)+27(2), −19(1)+27(1)]=[−57+54, −19+27]=[−3,8].
- So B−1=[2−3−58].
✓Final answerB−1=[2−3−58] — option (b).
- CBSE 2019Set ANNUAL1 markMCQQ.If A is a scalar matrix with scalar k=0, of order 3, then A−1 is :(a) k1I(b) kI(c) k21I(d) k31I
›Reveal solutionSolution
The inverse of the scalar matrix A=kI (order 3, k=0) is A−1=k1I.
- A scalar matrix of order 3 with scalar k is A=kI, where I is the 3×3 identity matrix.
- To find A−1, we need a matrix B such that AB=I.
- Try B=k1I: then AB=(kI)(k1I)=(k⋅k1)I=I.
- Since k=0, k1 is defined, so this B is a valid two-sided inverse.
- Hence A−1=k1I.
✓Final answerA−1=k1I — option (a).
🎓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.