Class 12 Maths, Worked in Full Past papersGet updates
Chapter 4 · Determinants

Exercise 4.4 · Q3: Verify A(adj⁡A)=(adj⁡A)A=∣A∣IA(\operatorname{adj}A)=(\operatorname{adj}A)A=|A|I⁠, 2×22\times2

Exercise 4.4Theorem 1, A(adj A) = |A| I · Section 4.5.1
The question

Verify A(adj⁡A)=(adj⁡A)A=∣A∣ IA(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|\,I in Exercises 3 and 4.

3.

A=[23−4−6]A = \begin{bmatrix} 2 & 3 \\ -4 & -6 \end{bmatrix}
Exam answer ∣A∣=∣23−4−6∣=−12+12=0|A| = \begin{vmatrix} 2 & 3 \\ -4 & -6 \end{vmatrix} = -12 + 12 = 0

Cofactors: A11=−6A_{11} = -6⁠, A12=4A_{12} = 4⁠, A21=−3A_{21} = -3⁠, A22=2A_{22} = 2⁠.

adj⁡A=[−6−342]\operatorname{adj}A = \begin{bmatrix} -6 & -3 \\ 4 & 2 \end{bmatrix} A(adj⁡A)=[23−4−6][−6−342]=[−12+12−6+624−2412−12]=[0000]=O\begin{aligned} &A(\operatorname{adj}A) \\ &= \begin{bmatrix} 2 & 3 \\ -4 & -6 \end{bmatrix}\begin{bmatrix} -6 & -3 \\ 4 & 2 \end{bmatrix} \\ &= \begin{bmatrix} -12+12 & -6+6 \\ 24-24 & 12-12 \end{bmatrix} \\ &= \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O \end{aligned} (adj⁡A)A=[−6−342][23−4−6]=[−12+12−18+188−812−12]=[0000]=O\begin{aligned} &(\operatorname{adj}A)A \\ &= \begin{bmatrix} -6 & -3 \\ 4 & 2 \end{bmatrix}\begin{bmatrix} 2 & 3 \\ -4 & -6 \end{bmatrix} \\ &= \begin{bmatrix} -12+12 & -18+18 \\ 8-8 & 12-12 \end{bmatrix} \\ &= \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O \end{aligned} ∣A∣ I=0[1001]=[0000]=O\begin{aligned} |A|\,I &= 0\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} \\ &= \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O \end{aligned}

∴ A(adj⁡A)=(adj⁡A)A=∣A∣ I\therefore\ A(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|\,I⁠. Hence verified.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

Theorem 1 of Section 4.5.1 says that a square matrix times its adjoint, in either order, is ∣A∣|A| times the identity. To verify it for this matrix we compute all three sides separately and compare them entry by entry. This matrix has a twist: its second row is −2-2 times its first, so ∣A∣=0|A|=0⁠. The theorem then predicts that both products are the zero matrix, and that is what we find.

Given, to show, and the plan
Given
The 2×22\times2 matrix AA above.
To show
A(adj⁡A)A(\operatorname{adj}A)⁠, (adj⁡A)A(\operatorname{adj}A)A and ∣A∣ I|A|\,I are the same matrix.
Plan
Compute ∣A∣|A|⁠. Find the four cofactors and adj⁡A\operatorname{adj}A⁠. Multiply in both orders, entry by entry. Compare with ∣A∣ I|A|\,I⁠.

Basics you need

1A 2×22\times2 determinant

∣A∣=a11a22−a12a21|A| = a_{11}a_{22} - a_{12}a_{21} (Section 4.2.2). Lesson: determinant of a square matrix

2Cofactors and the adjoint

Aij=(−1)i+jMijA_{ij}=(-1)^{i+j}M_{ij}⁠, and adj⁡A\operatorname{adj}A is the transpose of [Aij][A_{ij}]⁠. For a 2×22\times2 matrix this means: swap the diagonal entries, change the sign of the other two (Remark after Example 12). Lesson: the adjoint

3Matrix product

The (i,j)(i,j) entry of PQPQ is row ii of PP times column jj of QQ⁠: multiply matching entries and add. Order matters, so A(adj⁡A)A(\operatorname{adj}A) and (adj⁡A)A(\operatorname{adj}A)A are two separate calculations. Basics: matrix facts the chapter uses

4Scalar times identity

kIkI has kk on the diagonal and 0 elsewhere; in particular 0⋅I0\cdot I is the zero matrix OO⁠. Basics: scaling and adding matrices

5Singular matrix

A square matrix with ∣A∣=0|A|=0 is called singular (Definition 4, Section 4.5); it has no inverse (Theorem 4). Basics: why the inverse divides by |A|

Solution

  1. Compute ∣A∣|A|

    ∣A∣=∣23−4−6∣=2⋅(−6)−3⋅(−4)=−12+12=0\begin{aligned} |A| &= \begin{vmatrix} 2 & 3 \\ -4 & -6 \end{vmatrix} = 2\cdot (-6) - 3\cdot (-4) \\ &= -12 + 12 = 0 \end{aligned}

    So ∣A∣=0|A|=0⁠: AA is a singular matrix.

    We need ∣A∣|A| for the right-hand side ∣A∣ I|A|\,I⁠. It is 0 because the rows are proportional: row 2 is (−4, −6)=−2⋅(2, 3)(-4,\ -6) = -2\cdot(2,\ 3)⁠, so the two diagonal products 2⋅(−6)2\cdot(-6) and 3⋅(−4)3\cdot(-4) are equal and cancel.
    Definition 4, Section 4.5: AA is singular when ∣A∣=0|A|=0⁠. Lesson: determinant of a square matrix
  2. The four cofactors

    For each entry, delete its row and its column; the single entry left over is the minor MijM_{ij}⁠. Then multiply by (−1)i+j(-1)^{i+j}⁠, which is ++ for positions (1,1)(1,1)⁠, (2,2)(2,2) and −- for (1,2)(1,2)⁠, (2,1)(2,1)⁠:

    ElementMinorCofactor
    a11=2a_{11} = 2⁠; delete row 1 and column 1M11=−6M_{11} = -6A11=+(−6)=−6A_{11} = +(-6) = -6
    a12=3a_{12} = 3⁠; delete row 1 and column 2M12=−4M_{12} = -4A12=−(−4)=4A_{12} = -(-4) = 4
    a21=−4a_{21} = -4⁠; delete row 2 and column 1M21=3M_{21} = 3A21=−(3)=−3A_{21} = -(3) = -3
    a22=−6a_{22} = -6⁠; delete row 2 and column 2M22=2M_{22} = 2A22=+(2)=2A_{22} = +(2) = 2
    In a 2×22\times2 matrix, deleting row ii and column jj leaves one entry, the one diagonally opposite, and that number is the minor. The positions (1,2)(1,2) and (2,1)(2,1) have odd i+ji+j⁠, so their minors change sign.
    Definitions 1 and 2, Section 4.4. Basics: the + − + sign pattern
  3. Build adj⁡A\operatorname{adj}A

    The matrix of cofactors and its transpose:

    [Aij]=[−64−32][A_{ij}] = \begin{bmatrix} -6 & 4 \\ -3 & 2 \end{bmatrix} adj⁡A=[−6−342]\operatorname{adj}A = \begin{bmatrix} -6 & -3 \\ 4 & 2 \end{bmatrix}

    Shortcut check: swap 22 and −6-6 on the diagonal, change the signs of 33 and −4-4⁠. This gives the same adj⁡A\operatorname{adj}A⁠.

    The adjoint is the transpose of the cofactor matrix (Definition 3). Doing it both ways, by the definition and by the Remark after Example 12, guards against a slip before we use adj⁡A\operatorname{adj}A in two products.
  4. Compute A(adj⁡A)A(\operatorname{adj}A)

    Both factors are 2×22\times2⁠, so the product is defined and is 2×22\times2⁠. Write A(adj⁡A)=[pij]A(\operatorname{adj}A)=[p_{ij}]⁠; entry pijp_{ij} is row ii of AA times column jj of adj⁡A\operatorname{adj}A⁠:

    p11=2⋅(−6)+3⋅4=−12+12=0p12=2⋅(−3)+3⋅2=−6+6=0p21=(−4)⋅(−6)+(−6)⋅4=24−24=0p22=(−4)⋅(−3)+(−6)⋅2=12−12=0\begin{aligned} p_{11} &= 2\cdot (-6) + 3\cdot 4 \\ &= -12 + 12 = 0 \\ p_{12} &= 2\cdot (-3) + 3\cdot 2 \\ &= -6 + 6 = 0 \\ p_{21} &= (-4)\cdot (-6) + (-6)\cdot 4 \\ &= 24 - 24 = 0 \\ p_{22} &= (-4)\cdot (-3) + (-6)\cdot 2 \\ &= 12 - 12 = 0 \end{aligned} A(adj⁡A)=[0000]=OA(\operatorname{adj}A) = \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O
    Each product pairs a row of AA with a column of adj⁡A\operatorname{adj}A⁠. The diagonal entries p11,p22p_{11}, p_{22} are expansions of ∣A∣|A| along a row, so they equal ∣A∣=0|A| = 0⁠. The off-diagonal entries pair a row with the cofactors of the other row, and such sums are always 0 (Note in Section 4.4).
    Row times column; a negative times a negative is positive: (−4)⋅(−6)=24(-4)\cdot(-6) = 24⁠. Basics: matrix facts the chapter uses
  5. Compute (adj⁡A)A(\operatorname{adj}A)A

    Now the rows come from adj⁡A\operatorname{adj}A and the columns from AA⁠. Write (adj⁡A)A=[qij](\operatorname{adj}A)A=[q_{ij}]⁠:

    q11=(−6)⋅2+(−3)⋅(−4)=−12+12=0q12=(−6)⋅3+(−3)⋅(−6)=−18+18=0q21=4⋅2+2⋅(−4)=8−8=0q22=4⋅3+2⋅(−6)=12−12=0\begin{aligned} q_{11} &= (-6)\cdot 2 + (-3)\cdot (-4) \\ &= -12 + 12 = 0 \\ q_{12} &= (-6)\cdot 3 + (-3)\cdot (-6) \\ &= -18 + 18 = 0 \\ q_{21} &= 4\cdot 2 + 2\cdot (-4) \\ &= 8 - 8 = 0 \\ q_{22} &= 4\cdot 3 + 2\cdot (-6) \\ &= 12 - 12 = 0 \end{aligned} (adj⁡A)A=[0000]=O(\operatorname{adj}A)A = \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O
    Matrix multiplication is not commutative in general, so (adj⁡A)A(\operatorname{adj}A)A has to be computed on its own; the question asks us to verify both orders. Here the entries are column-wise expansions: q11q_{11} and q22q_{22} are ∣A∣|A| expanded along a column, and q12,q21q_{12}, q_{21} use the cofactors of a different column.
  6. Compute ∣A∣ I|A|\,I and compare

    ∣A∣ I=0⋅[1001]=[0000]=O|A|\,I = 0\cdot\begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = \begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix} = O

    All three matrices are the 2×22\times2 zero matrix, entry for entry, so

    A(adj⁡A)=(adj⁡A)A=∣A∣ I=O.A(\operatorname{adj}A) = (\operatorname{adj}A)A = |A|\,I = O.
    Two matrices are equal when they have the same order and the same entries in every position. All three are 2×22\times2 with every entry 0, so the identity of Theorem 1 is verified for this AA⁠.
    Scalar multiple: every entry of II is multiplied by 0. Basics: scaling and adding matrices
  7. What the zero result means

    Theorem 1 holds for every square matrix, singular or not. When ∣A∣≠0|A|\neq0 we may divide it by ∣A∣|A| to get A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj}A (Theorem 4). Here ∣A∣=0|A|=0⁠, so that division is impossible, and indeed this AA has no inverse.

    If some BB had AB=IAB=I⁠, then ∣A∣ ∣B∣=∣I∣=1|A|\,|B| = |I| = 1 (Theorem 3), which is impossible when ∣A∣=0|A|=0⁠. The zero products we found are the visible sign of this: adj⁡A\operatorname{adj}A is not the zero matrix, yet AA times it gives OO⁠, something an invertible matrix could never do.
    Theorem 4, Section 4.5: AA is invertible exactly when ∣A∣≠0|A|\neq0⁠. Basics: why the inverse divides by |A|
Result

∣A∣=0|A|=0 and

adj⁡A=[−6−342].\operatorname{adj}A = \begin{bmatrix} -6 & -3 \\ 4 & 2 \end{bmatrix}.

Both A(adj⁡A)A(\operatorname{adj}A) and (adj⁡A)A(\operatorname{adj}A)A equal the zero matrix OO⁠, which is ∣A∣ I=0⋅I|A|\,I = 0\cdot I⁠. Hence A(adj⁡A)=(adj⁡A)A=∣A∣ IA(\operatorname{adj}A)=(\operatorname{adj}A)A=|A|\,I is verified. (The answer key gives nothing for this question, since it is a verification.)

Check it with numbers

The Remark after Theorem 3 says ∣adj⁡A∣=∣A∣n−1|\operatorname{adj}A| = |A|^{n-1}⁠; for n=2n=2 this is ∣A∣1=0|A|^1 = 0⁠. Directly:

∣adj⁡A∣=∣−6−342∣=(−6)⋅2−(−3)⋅4=−12+12=0\begin{aligned} |\operatorname{adj}A| &= \begin{vmatrix} -6 & -3 \\ 4 & 2 \end{vmatrix} \\ &= (-6)\cdot 2 - (-3)\cdot 4 \\ &= -12 + 12 = 0 \end{aligned}

Also the columns of adj⁡A\operatorname{adj}A are (−6, 4)(-6,\ 4) and (−3, 2)(-3,\ 2)⁠, both multiples of (3, −2)(3,\ -2)⁠, and row 1 of AA gives 2⋅3+3⋅(−2)=02\cdot3 + 3\cdot(-2) = 0⁠; row 2 is −2-2 times row 1, so it also gives 0. That is why every entry of A(adj⁡A)A(\operatorname{adj}A) vanished.

Common mistakes
  1. Thinking the verification "failed". Getting OO is correct here because ∣A∣=0|A|=0⁠; ∣A∣ I|A|\,I is then the zero matrix too.
  2. Computing only one product. The question asks for both orders. Matrix products need not commute, so each must be computed.
  3. Sign slips with two negative entries. (−4)⋅(−6)=+24(-4)\cdot(-6)=+24 and (−6)⋅(−4)=+24(-6)\cdot(-4)=+24⁠; the minus signs cancel in pairs.
  4. Trying to form A−1A^{-1}⁠. 1∣A∣adj⁡A\frac{1}{|A|}\operatorname{adj}A would need division by 0. A singular matrix has no inverse.
What to take away
  1. A(adj⁡A)=(adj⁡A)A=∣A∣ IA(\operatorname{adj}A)=(\operatorname{adj}A)A=|A|\,I holds for every square matrix, including singular ones, where both sides are OO⁠.
  2. Diagonal entries of the product are expansions of ∣A∣|A|⁠; off-diagonal entries use cofactors of the wrong row or column and are always 0.
  3. Proportional rows mean ∣A∣=0|A|=0⁠: the matrix is singular and has no inverse.

Every fact used, and where it comes from

FactUsed inSource
∣A∣=a11a22−a12a21|A| = a_{11}a_{22}-a_{12}a_{21}Step 1, CheckSection 4.2.2 (Lesson: determinant)
Singular: ∣A∣=0|A|=0Steps 1, 7Definition 4, Section 4.5
Minor and cofactorStep 2Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors)
Adjoint; 2×22\times2 shortcutStep 3Definition 3 and Remark after Example 12, Section 4.5.1
Product of matrices, row times columnSteps 4, 5Chapter 3, Section 3.4.5 (Basics: matrix facts)
Elements times cofactors of another row (or column) sum to 0Step 4Note in Section 4.4
Scalar multiple of a matrix; equality of matricesStep 6Chapter 3, Sections 3.4.2 and 3.3.1
A(adj⁡A)=(adj⁡A)A=∣A∣ IA(\operatorname{adj}A)=(\operatorname{adj}A)A=|A|\,ISteps 6, 7Theorem 1, Section 4.5.1 (Lesson: the adjoint)
∣AB∣=∣A∣ ∣B∣|AB|=|A|\,|B|⁠; invertible   ⟺  ∣A∣≠0\iff |A|\neq0Step 7Theorems 3 and 4, Section 4.5 (Lesson: inverse of a matrix)
∣adj⁡A∣=∣A∣n−1|\operatorname{adj}A| = |A|^{n-1}CheckRemark after Theorem 3, Section 4.5
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →