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

Exercise 4.5 · Q11: Solve 2x+y+z=12x+y+z=1⁠, x−2y−z=32x-2y-z=\frac{3}{2}⁠, 3y−5z=93y-5z=9 by the matrix method

Exercise 4.5Solving systems AX = B · Section 4.6.1
The question

Solve system of linear equations, using matrix method, in Exercises 7 to 14.

11.

2x+y+z=1x−2y−z=323y−5z=9\begin{aligned} 2x + y + z &= 1\\ x - 2y - z &= \frac{3}{2}\\ 3y - 5z &= 9 \end{aligned}
Exam answer

The system is AX=BAX = B⁠, where

A=[2111−2−103−5],X=[xyz], B=[1329]\begin{aligned} A &= \begin{bmatrix} 2 & 1 & 1 \\ 1 & -2 & -1 \\ 0 & 3 & -5 \end{bmatrix}, \\ X &= \begin{bmatrix} x \\ y \\ z \end{bmatrix},\ B = \begin{bmatrix} 1 \\ \frac{3}{2} \\ 9 \end{bmatrix} \end{aligned}

Expanding along R3R_3⁠:

∣A∣=0∣11−2−1∣−3∣211−1∣+(−5)∣211−2∣=0(1)−3(−3)−5(−5)=34\begin{aligned} |A| &= 0\begin{vmatrix} 1 & 1 \\ -2 & -1 \end{vmatrix} - 3\begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix} \\ &\quad + (-5)\begin{vmatrix} 2 & 1 \\ 1 & -2 \end{vmatrix} \\ &= 0(1) - 3(-3) - 5(-5) \\ &= 34 \end{aligned}

∣A∣=34≠0|A| = 34 \ne 0⁠. So A−1A^{-1} exists and the system has a unique solution, X=A−1BX = A^{-1}B⁠.

Cofactors:

A11=∣−2−13−5∣=13A12=−∣1−10−5∣=5A13=∣1−203∣=3\begin{aligned} A_{11} &= \begin{vmatrix} -2 & -1 \\ 3 & -5 \end{vmatrix} = 13 \\ A_{12} &= -\begin{vmatrix} 1 & -1 \\ 0 & -5 \end{vmatrix} = 5 \\ A_{13} &= \begin{vmatrix} 1 & -2 \\ 0 & 3 \end{vmatrix} = 3 \end{aligned} A21=−∣113−5∣=8A22=∣210−5∣=−10A23=−∣2103∣=−6\begin{aligned} A_{21} &= -\begin{vmatrix} 1 & 1 \\ 3 & -5 \end{vmatrix} = 8 \\ A_{22} &= \begin{vmatrix} 2 & 1 \\ 0 & -5 \end{vmatrix} = -10 \\ A_{23} &= -\begin{vmatrix} 2 & 1 \\ 0 & 3 \end{vmatrix} = -6 \end{aligned} A31=∣11−2−1∣=1A32=−∣211−1∣=3A33=∣211−2∣=−5\begin{aligned} A_{31} &= \begin{vmatrix} 1 & 1 \\ -2 & -1 \end{vmatrix} = 1 \\ A_{32} &= -\begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix} = 3 \\ A_{33} &= \begin{vmatrix} 2 & 1 \\ 1 & -2 \end{vmatrix} = -5 \end{aligned} adj⁡A=[13815−1033−6−5]A−1=1∣A∣adj⁡A=134[13815−1033−6−5]\begin{aligned} \operatorname{adj}A &= \begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix} \\ A^{-1} &= \frac{1}{|A|}\operatorname{adj}A \\ &= \frac{1}{34}\begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix} \end{aligned} X=A−1B=134[13815−1033−6−5][1329]=134[13+12+95−15+273−9−45]=134[3417−51]=[112−32]\begin{aligned} X &= A^{-1}B \\ &= \frac{1}{34}\begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix}\begin{bmatrix} 1 \\ \frac{3}{2} \\ 9 \end{bmatrix} \\ &= \frac{1}{34}\begin{bmatrix} 13 + 12 + 9 \\ 5 - 15 + 27 \\ 3 - 9 - 45 \end{bmatrix} \\ &= \frac{1}{34}\begin{bmatrix} 34 \\ 17 \\ -51 \end{bmatrix} = \begin{bmatrix} 1 \\ \frac{1}{2} \\ -\frac{3}{2} \end{bmatrix} \end{aligned}

∴ x=1, y=12, z=−32\therefore\ x = 1,\ y = \dfrac{1}{2},\ z = -\dfrac{3}{2}⁠.

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

The one idea this problem is built on

Three equations in three unknowns are one matrix equation AX=BAX = B with a 3×33\times3 matrix AA⁠. If ∣A∣≠0|A| \ne 0⁠, the unique solution is X=A−1BX = A^{-1}B, where A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj} A⁠. The work is mostly bookkeeping: nine small 2×22\times2 determinants (the minors), each with the right sign, arranged and transposed into adj⁡A\operatorname{adj} A⁠.

Given, to find, and the plan
Given
2x+y+z=12x + y + z = 1⁠, x−2y−z=32x - 2y - z = \frac{3}{2}⁠, 3y−5z=93y - 5z = 9⁠.
To find
xx⁠, yy⁠, zz by the matrix method.
Plan
(1) Write AX=BAX = B⁠, noting that xx is missing from the third equation. (2) Find ∣A∣|A|⁠, expanding along a row with a zero. (3) Find all nine minors and cofactors. (4) Build adj⁡A\operatorname{adj} A and A−1A^{-1}⁠. (5) Check A(adj⁡A)=∣A∣ IA(\operatorname{adj} A) = |A|\,I⁠. (6) Compute X=A−1BX = A^{-1}B⁠. (7) Check in all three equations.

Basics you need

1A system is a matrix product

Row ii of AA times XX is the left side of equation ii⁠. A missing unknown has coefficient 0, and that 0 must be written into AA⁠. Basics: matrix facts the chapter uses

2Expanding a 3×33\times3 determinant

Pick any row or column. Multiply each entry by its signed minor, using the sign pattern below, and add. A row with a 0 saves work, because that term vanishes. Basics: the + − + sign pattern

[+−+−+−+−+]\begin{bmatrix} + & - & + \\ - & + & - \\ + & - & + \end{bmatrix}
3Minor, cofactor, adjoint

MijM_{ij}⁠: delete row ii and column jj⁠, take the 2×22\times2 determinant that is left. Aij=(−1)i+jMijA_{ij} = (-1)^{i+j}M_{ij}⁠. adj⁡A\operatorname{adj} A is the transpose of the matrix [Aij][A_{ij}]⁠. Basics: where the determinant comes from

4The inverse divides by ∣A∣|A|

A(adj⁡A)=∣A∣ IA(\operatorname{adj} A) = |A|\,I⁠, so A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj} A whenever ∣A∣≠0|A| \ne 0⁠. Basics: why the inverse divides by |A|

5Fractions are just numbers

The right-hand side 32\frac{3}{2} goes into BB as it is; 8⋅32=128\cdot\frac{3}{2} = 12 and (−10)⋅32=−15(-10)\cdot\frac{3}{2} = -15⁠. Basics: algebra the chapter leans on

Solution

  1. Write the system as AX=BAX = B

    The third equation has no xx-term, so its coefficient of xx is 0. With columns in the order x,y,zx, y, z⁠:

    A=[2111−2−103−5],A = \begin{bmatrix} 2 & 1 & 1 \\ 1 & -2 & -1 \\ 0 & 3 & -5 \end{bmatrix}, X=[xyz],B=[1329].X = \begin{bmatrix} x \\ y \\ z \end{bmatrix},\quad B = \begin{bmatrix} 1 \\ \frac{3}{2} \\ 9 \end{bmatrix}.

    AA is 3×33\times3 and XX is 3×13\times1⁠, so AXAX is defined and 3×13\times1⁠, like BB⁠. Row by row,

    AX=[2x+y+zx−2y−z0x+3y−5z],AX = \begin{bmatrix} 2x + y + z \\ x - 2y - z \\ 0x + 3y - 5z \end{bmatrix},

    which reproduces the three left-hand sides.

    Leaving out the 0 would make the third row 3,−53, -5⁠, only two entries, and AA would not even be a matrix. Each unknown keeps its own column, so a missing unknown leaves a 0 in its column.
    Section 4.6.1 (matrix form); Section 3.4.5 (row times column). Lesson: solving systems AX = B
  2. Compute ∣A∣|A| by expanding along row 3

    Row 3 is (0,3,−5)(0, 3, -5) and contains a 0, so expand along it. The signs for row 3 are + − ++\,-\,+⁠:

    ∣A∣=0∣11−2−1∣−3∣211−1∣+(−5)∣211−2∣=0(1)−3(−3)+(−5)(−5)=0+9+25=34.\begin{aligned} |A| &= 0\begin{vmatrix} 1 & 1 \\ -2 & -1 \end{vmatrix} - 3\begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix}\\ &\qquad + (-5)\begin{vmatrix} 2 & 1 \\ 1 & -2 \end{vmatrix}\\ &= 0(1) - 3(-3) + (-5)(-5)\\ &= 0 + 9 + 25 = 34. \end{aligned}

    The two minors that matter are

    ∣211−1∣=(2)(−1)−(1)(1)=−3,∣211−2∣=(2)(−2)−(1)(1)=−5.\begin{aligned} \begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix} &= (2)(-1) - (1)(1) = -3,\\ \begin{vmatrix} 2 & 1 \\ 1 & -2 \end{vmatrix} &= (2)(-2) - (1)(1) = -5. \end{aligned}

    So ∣A∣=34≠0|A| = 34 \ne 0⁠: AA is nonsingular and the system has a unique solution.

    Each small determinant is the minor of the row-3 entry in front of it: delete row 3 and that entry's column. The first term is 0 whatever its minor is, which is why a row with a zero is the cheapest choice. The −- before the 3 comes from the sign (−1)3+2=−1(-1)^{3+2} = -1⁠, not from the entry itself.
    Section 4.2.3: a 3×33\times3 determinant can be expanded along any row or column, all six ways giving the same value. Section 4.6.1, Case I. Lesson: expanding a 3 × 3 determinant
  3. Find all nine minors and cofactors

    For each entry, delete its row and column, evaluate the 2×22\times2 determinant left (ad−bcad - bc⁠), then attach the sign (−1)i+j(-1)^{i+j}⁠.

    Row 1 (entries 2,1,12, 1, 1⁠):

    M11=∣−2−13−5∣=(−2)(−5)−(−1)(3)=13,A11=(−1)1+1(13)=13,M12=∣1−10−5∣=(1)(−5)−(−1)(0)=−5,A12=(−1)1+2(−5)=5,M13=∣1−203∣=(1)(3)−(−2)(0)=3,A13=(−1)1+3(3)=3.\begin{aligned} M_{11} &= \begin{vmatrix} -2 & -1 \\ 3 & -5 \end{vmatrix}\\ &= (-2)(-5) - (-1)(3) = 13,\\ A_{11} &= (-1)^{1+1}(13) = 13,\\ M_{12} &= \begin{vmatrix} 1 & -1 \\ 0 & -5 \end{vmatrix}\\ &= (1)(-5) - (-1)(0) = -5,\\ A_{12} &= (-1)^{1+2}(-5) = 5,\\ M_{13} &= \begin{vmatrix} 1 & -2 \\ 0 & 3 \end{vmatrix}\\ &= (1)(3) - (-2)(0) = 3,\\ A_{13} &= (-1)^{1+3}(3) = 3. \end{aligned}

    Row 2 (entries 1,−2,−11, -2, -1⁠):

    M21=∣113−5∣=(1)(−5)−(1)(3)=−8,A21=(−1)2+1(−8)=8,M22=∣210−5∣=(2)(−5)−(1)(0)=−10,A22=(−1)2+2(−10)=−10,M23=∣2103∣=(2)(3)−(1)(0)=6,A23=(−1)2+3(6)=−6.\begin{aligned} M_{21} &= \begin{vmatrix} 1 & 1 \\ 3 & -5 \end{vmatrix}\\ &= (1)(-5) - (1)(3) = -8,\\ A_{21} &= (-1)^{2+1}(-8) = 8,\\ M_{22} &= \begin{vmatrix} 2 & 1 \\ 0 & -5 \end{vmatrix}\\ &= (2)(-5) - (1)(0) = -10,\\ A_{22} &= (-1)^{2+2}(-10) = -10,\\ M_{23} &= \begin{vmatrix} 2 & 1 \\ 0 & 3 \end{vmatrix}\\ &= (2)(3) - (1)(0) = 6,\\ A_{23} &= (-1)^{2+3}(6) = -6. \end{aligned}

    Row 3 (entries 0,3,−50, 3, -5⁠):

    M31=∣11−2−1∣=(1)(−1)−(1)(−2)=1,A31=(−1)3+1(1)=1,M32=∣211−1∣=(2)(−1)−(1)(1)=−3,A32=(−1)3+2(−3)=3,M33=∣211−2∣=(2)(−2)−(1)(1)=−5,A33=(−1)3+3(−5)=−5.\begin{aligned} M_{31} &= \begin{vmatrix} 1 & 1 \\ -2 & -1 \end{vmatrix}\\ &= (1)(-1) - (1)(-2) = 1,\\ A_{31} &= (-1)^{3+1}(1) = 1,\\ M_{32} &= \begin{vmatrix} 2 & 1 \\ 1 & -1 \end{vmatrix}\\ &= (2)(-1) - (1)(1) = -3,\\ A_{32} &= (-1)^{3+2}(-3) = 3,\\ M_{33} &= \begin{vmatrix} 2 & 1 \\ 1 & -2 \end{vmatrix}\\ &= (2)(-2) - (1)(1) = -5,\\ A_{33} &= (-1)^{3+3}(-5) = -5. \end{aligned}
    Every cofactor is needed, including those of row 3 already used for ∣A∣|A|⁠, because adj⁡A\operatorname{adj} A contains all nine. Note that a31=0a_{31} = 0 does not make its cofactor 0: A31A_{31} depends only on the other entries, and it is 1. The sign (−1)i+j(-1)^{i+j} is ++ at positions where i+ji + j is even (the corners and the centre) and −- at the four others.
    Definitions 1 and 2, Section 4.4. Lesson: minors and cofactors
  4. Build adj⁡A\operatorname{adj} A and A−1A^{-1}

    Matrix of cofactors (each AijA_{ij} in position (i,j)(i, j)⁠):

    [13538−10−613−5]\begin{bmatrix} 13 & 5 & 3 \\ 8 & -10 & -6 \\ 1 & 3 & -5 \end{bmatrix}

    Its transpose (rows become columns) is the adjoint:

    adj⁡A=[13815−1033−6−5],\operatorname{adj} A = \begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix},

    and, since A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj} A⁠,

    A−1=134[13815−1033−6−5].A^{-1} = \frac{1}{34}\begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix}.
    The cofactors of row 1 of AA become column 1 of adj⁡A\operatorname{adj} A⁠. This transpose is what makes row ii of AA meet its own cofactors in the product A(adj⁡A)A(\operatorname{adj} A)⁠, giving ∣A∣|A| on the diagonal.
    Definition 3, Section 4.5.1; Theorem 4, Section 4.5. Lesson: the adjoint
  5. Check: A(adj⁡A)=34 IA(\operatorname{adj} A) = 34\,I

    Row ii of AA times column jj of adj⁡A\operatorname{adj} A⁠:

    (1,1): 2(13)+1(5)+1(3)=26+5+3=34,(1,2): 2(8)+1(−10)+1(−6)=16−10−6=0,(1,3): 2(1)+1(3)+1(−5)=2+3−5=0,(2,1): 1(13)+(−2)(5)+(−1)(3)=13−10−3=0,(2,2): 1(8)+(−2)(−10)+(−1)(−6)=8+20+6=34,(2,3): 1(1)+(−2)(3)+(−1)(−5)=1−6+5=0,(3,1): 0(13)+3(5)+(−5)(3)=0+15−15=0,(3,2): 0(8)+3(−10)+(−5)(−6)=0−30+30=0,(3,3): 0(1)+3(3)+(−5)(−5)=0+9+25=34.\begin{aligned} (1,1)&:\ 2(13) + 1(5) + 1(3)\\ &= 26 + 5 + 3 = 34,\\ (1,2)&:\ 2(8) + 1(-10) + 1(-6)\\ &= 16 - 10 - 6 = 0,\\ (1,3)&:\ 2(1) + 1(3) + 1(-5)\\ &= 2 + 3 - 5 = 0,\\ (2,1)&:\ 1(13) + (-2)(5) + (-1)(3)\\ &= 13 - 10 - 3 = 0,\\ (2,2)&:\ 1(8) + (-2)(-10) + (-1)(-6)\\ &= 8 + 20 + 6 = 34,\\ (2,3)&:\ 1(1) + (-2)(3) + (-1)(-5)\\ &= 1 - 6 + 5 = 0,\\ (3,1)&:\ 0(13) + 3(5) + (-5)(3)\\ &= 0 + 15 - 15 = 0,\\ (3,2)&:\ 0(8) + 3(-10) + (-5)(-6)\\ &= 0 - 30 + 30 = 0,\\ (3,3)&:\ 0(1) + 3(3) + (-5)(-5)\\ &= 0 + 9 + 25 = 34. \end{aligned} A(adj⁡A)=[340003400034]=34 I,A(\operatorname{adj} A) = \begin{bmatrix} 34 & 0 & 0 \\ 0 & 34 & 0 \\ 0 & 0 & 34 \end{bmatrix} = 34\,I,

    so AA−1=134(34 I)=IAA^{-1} = \frac{1}{34}(34\,I) = I⁠.

    The diagonal entries are "a row times its own cofactors", which is ∣A∣|A| (the expansion along that row). The off-diagonal entries are "a row times another row's cofactors", which is always 0. Seeing exactly this pattern confirms all nine cofactors at once.
    Theorem 1, Section 4.5, and the Note in Section 4.4 (a row times the cofactors of a different row gives 0). Basics: why the inverse divides by |A|
  6. Compute X=A−1BX = A^{-1}B

    A−1A^{-1} is 3×33\times3⁠, BB is 3×13\times1⁠, so A−1BA^{-1}B is 3×13\times1⁠. First (adj⁡A)B(\operatorname{adj} A)B⁠, row by row:

    row 1: 13(1)+8(32)+1(9)=13+12+9=34,row 2: 5(1)+(−10)(32)+3(9)=5−15+27=17,row 3: 3(1)+(−6)(32)+(−5)(9)=3−9−45=−51.\begin{aligned} \text{row 1}&:\ 13(1) + 8\left(\tfrac{3}{2}\right) + 1(9)\\ &= 13 + 12 + 9 = 34,\\ \text{row 2}&:\ 5(1) + (-10)\left(\tfrac{3}{2}\right) + 3(9)\\ &= 5 - 15 + 27 = 17,\\ \text{row 3}&:\ 3(1) + (-6)\left(\tfrac{3}{2}\right) + (-5)(9)\\ &= 3 - 9 - 45 = -51. \end{aligned} X=[xyz]=134[3417−51]=[112−32].X = \begin{bmatrix} x \\ y \\ z \end{bmatrix} = \frac{1}{34}\begin{bmatrix} 34 \\ 17 \\ -51 \end{bmatrix} = \begin{bmatrix} 1 \\ \frac{1}{2} \\ -\frac{3}{2} \end{bmatrix}.

    So x=1x = 1⁠, y=12y = \frac{1}{2}⁠, z=−32z = -\frac{3}{2}.

    Multiplying AX=BAX = B on the left by A−1A^{-1} gives (A−1A)X=A−1B(A^{-1}A)X = A^{-1}B⁠, that is X=A−1BX = A^{-1}B⁠; so this is the only possible solution, and Step 7 confirms it works. The fraction in BB is harmless: it is multiplied by whole numbers, and the factor 134\frac{1}{34} comes last.
    Section 4.6.1, Case I; associativity of matrix multiplication, Section 3.4.6. Lesson: inverse of a matrix
  7. Check in all three original equations

    2x+y+z=2(1)+12+(−32)=1,x−2y−z=1−2(12)−(−32)=32,3y−5z=3(12)−5(−32)=9.\begin{aligned} 2x + y + z &= 2(1) + \tfrac{1}{2} + \left(-\tfrac{3}{2}\right) = 1,\\ x - 2y - z &= 1 - 2\left(\tfrac{1}{2}\right) - \left(-\tfrac{3}{2}\right) = \tfrac{3}{2},\\ 3y - 5z &= 3\left(\tfrac{1}{2}\right) - 5\left(-\tfrac{3}{2}\right) = 9. \end{aligned}

    In detail: 2+12−32=12 + \frac{1}{2} - \frac{3}{2} = 1⁠; 1−1+32=321 - 1 + \frac{3}{2} = \frac{3}{2}⁠; 32+152=182=9\frac{3}{2} + \frac{15}{2} = \frac{18}{2} = 9⁠. All three hold.

    A solution of the system must satisfy every equation. Checking all three in the original equations also guards against a slip in writing down AA or BB in Step 1.
Result

∣A∣=34≠0|A| = 34 \ne 0⁠, and

A−1=134[13815−1033−6−5].A^{-1} = \frac{1}{34}\begin{bmatrix} 13 & 8 & 1 \\ 5 & -10 & 3 \\ 3 & -6 & -5 \end{bmatrix}.

The unique solution is x=1x = 1⁠, y=12y = \frac{1}{2}⁠, z=−32z = -\frac{3}{2}.

(Textbook answer: x=1x = 1⁠, y=12y = \frac{1}{2}⁠, z=−32z = \frac{-3}{2}⁠.)

Check it with numbers

A second expansion of ∣A∣|A|⁠. Along row 1, with the cofactors of Step 3: 2(13)+1(5)+1(3)=26+5+3=342(13) + 1(5) + 1(3) = 26 + 5 + 3 = 34⁠. Along column 1: 2(13)+1(8)+0(1)=26+8=342(13) + 1(8) + 0(1) = 26 + 8 = 34⁠. Same value every time, as Section 4.2.3 promises.

Without matrices. Adding the first two equations removes zz⁠: 3x−y=523x - y = \frac{5}{2}⁠. With x=1x = 1 this gives y=12y = \frac{1}{2}⁠, and then the third equation gives 5z=3y−9=−1525z = 3y - 9 = -\frac{15}{2}⁠, so z=−32z = -\frac{3}{2}⁠. Consistent.

Common mistakes
  1. Dropping the 0 for the missing xx⁠. The third row of AA is 0,3,−50, 3, -5⁠, not 3,−53, -5 shifted left.
  2. Sign slips in the cofactors. A12=5A_{12} = 5⁠, A21=8A_{21} = 8 and A32=3A_{32} = 3 are positive because a negative minor meets a −- sign. Write (−1)i+j(-1)^{i+j} every time.
  3. Forgetting the transpose. Using the cofactor matrix itself as adj⁡A\operatorname{adj} A gives a first entry 13+5(32)+3(9)=47.513 + 5\left(\frac{3}{2}\right) + 3(9) = 47.5⁠, not 34, and the answer is wrong.
  4. Thinking a zero entry has a zero cofactor. a31=0a_{31} = 0 but A31=1A_{31} = 1⁠.
What to take away
  1. For a 3×33\times3 system, expand ∣A∣|A| along the row or column with the most zeros, but compute all nine cofactors for the adjoint.
  2. The product A(adj⁡A)A(\operatorname{adj} A) must be ∣A∣ I|A|\,I⁠: it checks every cofactor at once.
  3. Fractions in BB cause no trouble. (Multiplying the second equation by 2 first would also work: it changes AA and BB but not the solution.)

Every fact used, and where it comes from

FactUsed inSource
A system written as AX=BAX = BStep 1Section 4.6.1 (Lesson: solving systems)
Matrix product, row times columnSteps 1, 5, 6Section 3.4.5 (Chapter 3)
Expansion along any row or column, sign (−1)i+j(-1)^{i+j}Step 2Section 4.2.3 (Lesson: expanding a 3 × 3 determinant)
2×22\times2 determinant =ad−bc= ad - bcSteps 2, 3Section 4.2.2
Minor MijM_{ij}⁠, cofactor Aij=(−1)i+jMijA_{ij} = (-1)^{i+j}M_{ij}Step 3Definitions 1 and 2, Section 4.4 (Lesson: minors and cofactors)
adj⁡A\operatorname{adj} A = transpose of [Aij][A_{ij}]Step 4Definition 3, Section 4.5.1 (Lesson: the adjoint)
A(adj⁡A)=∣A∣ IA(\operatorname{adj} A) = |A|\,I⁠; row times another row's cofactors is 0Step 5Theorem 1, Section 4.5; Note in Section 4.4
A−1=1∣A∣adj⁡AA^{-1} = \frac{1}{|A|}\operatorname{adj} A when ∣A∣≠0|A| \ne 0Step 4Theorem 4, Section 4.5 (Lesson: inverse of a matrix)
X=A−1BX = A^{-1}B is the unique solutionSteps 2, 6Section 4.6.1, Case I
Associativity, (A−1A)X=A−1(AX)(A^{-1}A)X = A^{-1}(AX)Step 6Section 3.4.6 (Chapter 3)
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 →