Want the reason behind every step, the basics and the checks?
The one idea this problem is built on
As a matrix equation the system is AX=B. Because ∣A∣=0,A has the inverse A−1=∣A∣1adjA, and multiplying AX=B on the left by it gives the unique solution X=A−1B.
Given, to find, and the plan
Given
2x+3y+3z=5,x−2y+z=−4,3x−y−2z=3.
To find
x,y,z by the matrix method.
Plan
(1) AX=B. (2) All nine minors and cofactors. (3) ∣A∣ by expanding along row 2 (its entries are smallest). (4) adjA,A−1. (5) Check A(adjA)=∣A∣I. (6) X=A−1B. (7) Check.
A is 3×3,X is 3×1, so AX is defined and 3×1, the order of B:
AX=2x+3y+3zx−2y+z3x−y−2z.
Multiplying out confirms that each row of A carries the coefficients of one equation, with signs. (The book prints the first equation as "2x+3y+3z=5"; the spacing is only typographical, the coefficient of z is 3.)
We find the cofactors first this time, because adjA needs all nine anyway and ∣A∣ can then be read off from any row. In each minor the four surviving entries keep their places: for M21, deleting row 2 and column 1 leaves 3,3 (from row 1) above −1,−2 (from row 3).
So ∣A∣=40=0:A is nonsingular, and the system has a unique solution.
The value of a determinant does not depend on which row or column we expand along. Row 2 has the smallest entries, so the products are easiest. The signs −+− come from (−1)2+1,(−1)2+2,(−1)2+3.
Section 4.2.3 (six ways, same value); the Remark in Section 4.4 (Δ = sum of the entries of any row times their cofactors); Section 4.6.1, Case I. Lesson: expanding a 3 × 3 determinant
Build adjA and A−1
Matrix of cofactors:
5395−131511−7
Transpose for the adjoint, divide by ∣A∣=40 for the inverse:
The row of cofactors 5,5,5 becomes the first column of the adjoint. A quick test that the transpose was done: position (1,2) of adjA must be A21=3, not A12=5.
Diagonal entries: a row times its own cofactors gives ∣A∣. Off-diagonal entries: a row times another row's cofactors gives 0. Every cofactor has been used in at least three of these products, so they are all confirmed.
From AX=B, multiplying on the left by A−1 and using A−1A=I gives X=A−1B: there is no other solution. Step 7 confirms that this one satisfies the equations.
Only a check in every original equation proves that the computed numbers are a solution of the system as printed.
Result
∣A∣=40=0, and
A−1=4015553−131191−7.
The unique solution is x=1,y=2,z=−1.
(Textbook answer: x=1,y=2,z=−1.)
Check it with numbers
∣A∣ along row 1.2(5)+3(5)+3(5)=10+15+15=40, the same as along row 2.
By substitution. The second equation gives x=−4+2y−z. Putting this into the first: −8+7y+z=5, so 7y+z=13. Into the third: −12+5y−5z=3, so y−z=3. Adding these two, 8y=16, so y=2, then z=−1 and x=−4+4+1=1. The same answer.
Common mistakes
Starting row 2 with a plus sign. The signs for row 2 are −+−. Using +−+ gives −3−26−11=−40, the right size but the wrong sign, and then every entry of X comes out with the wrong sign.
Mixing up A12 and A21 in the adjoint. Here A12=5 and A21=3, so a missed transpose changes the answer.
Arithmetic with negative products.(−13)(−4)=+52; a sign slip here changes y.
What to take away
You may expand along any row or column; choose the one with the smallest entries or the most zeros, and use its own sign pattern.
Once all nine cofactors are known, ∣A∣ is free: any row of A times its row of cofactors.
The check A(adjA)=∣A∣I and the check in the original equations catch different mistakes; do both.
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 →