How to use these solu­tions

These are the worked solu­tions to the mixed prac­tice in Sym­met­ric Matri­ces, Inverses and Mixed Prac­tice. Try each ques­tion first, then com­pare your work­ing with the steps here. For row-oper­a­tion ques­tions, many dif­fer­ent sequences of oper­a­tions are cor­rect — what mat­ters is that each oper­a­tion is applied to the whole aug­mented row and that you fin­ish with the iden­tity on the left.

Ques­tion 1: Show­ing a matrix is skew-sym­met­ric

The prob­lem

Show that A=[03−2−3052−50]A = \begin{bmatrix} 0 & 3 & -2 \\ -3 & 0 & 5 \\ 2 & -5 & 0 \end{bmatrix} is skew-sym­met­ric.

Under­stand­ing the prob­lem

A square matrix is skew-sym­met­ric when AT=−AA^T = -A, that is, aji=−aija_{ji} = -a_{ij} for every i,ji, j. In par­tic­u­lar, every diag­o­nal entry must be 00.

The idea

Write down ATA^T (rows become columns) and −A-A (change every sign), and com­pare them.

Step-by-step solu­tion

Step 1. Trans­pose: the first row of ATA^T is the first col­umn of AA, and so on.

AT=[0−3230−5−250]A^T = \begin{bmatrix} 0 & -3 & 2 \\ 3 & 0 & -5 \\ -2 & 5 & 0 \end{bmatrix}

Step 2. Neg­a­tive of AA.

−A=[0−3230−5−250]-A = \begin{bmatrix} 0 & -3 & 2 \\ 3 & 0 & -5 \\ -2 & 5 & 0 \end{bmatrix}

Step 3. The two matri­ces agree entry by entry, so AT=−AA^T = -A and AA is skew-sym­met­ric.

Check­ing the answer

The diag­o­nal is all zeros, and each mir­ror pair has oppo­site signs: (3,−3)(3, -3), (−2,2)(-2, 2), (5,−5)(5, -5). ✓

Answer

AT=−AA^T = -A, so AA is skew-sym­met­ric.

Ques­tion 2: Sym­met­ric plus skew-sym­met­ric (2 × 2)

The prob­lem

Write [351−1]\begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} as the sum of a sym­met­ric and a skew-sym­met­ric matrix.

Under­stand­ing the prob­lem

Every square matrix AA splits as A=P+QA = P + Q with PP sym­met­ric (PT=PP^T = P) and QQ skew-sym­met­ric (QT=−QQ^T = -Q).

The idea

Use P=12(A+AT)\displaystyle P = \tfrac12(A + A^T) and Q=12(A−AT)\displaystyle Q = \tfrac12(A - A^T).

Step-by-step solu­tion

Step 1. Trans­pose.

AT=[315−1]A^T = \begin{bmatrix} 3 & 1 \\ 5 & -1 \end{bmatrix}

Step 2. Sym­met­ric part.

P=12[666−2]=[333−1]\displaystyle P = \frac12\begin{bmatrix} 6 & 6 \\ 6 & -2 \end{bmatrix} = \begin{bmatrix} 3 & 3 \\ 3 & -1 \end{bmatrix}

Step 3. Skew-sym­met­ric part.

Q=12[04−40]=[02−20]\displaystyle Q = \frac12\begin{bmatrix} 0 & 4 \\ -4 & 0 \end{bmatrix} = \begin{bmatrix} 0 & 2 \\ -2 & 0 \end{bmatrix}

Check­ing the answer

P+Q=[351−1]=AP + Q = \begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} = A ✓; PP is sym­met­ric and QQ has zero diag­o­nal with oppo­site off-diag­o­nal entries. ✓

Answer

[351−1]=[333−1]+[02−20]\begin{bmatrix} 3 & 5 \\ 1 & -1 \end{bmatrix} = \begin{bmatrix} 3 & 3 \\ 3 & -1 \end{bmatrix} + \begin{bmatrix} 0 & 2 \\ -2 & 0 \end{bmatrix}

Ques­tion 3: Sym­met­ric plus skew-sym­met­ric (3 × 3)

The prob­lem

Write [14−20362−25]\begin{bmatrix} 1 & 4 & -2 \\ 0 & 3 & 6 \\ 2 & -2 & 5 \end{bmatrix} as a sum of sym­met­ric and skew-sym­met­ric parts.

Under­stand­ing the prob­lem

Same task as Ques­tion 2, for a 3×33 \times 3 matrix.

The idea

P=12(A+AT)\displaystyle P = \tfrac12(A + A^T) and Q=12(A−AT)\displaystyle Q = \tfrac12(A - A^T).

Step-by-step solu­tion

Step 1. Trans­pose.

AT=[10243−2−265]A^T = \begin{bmatrix} 1 & 0 & 2 \\ 4 & 3 & -2 \\ -2 & 6 & 5 \end{bmatrix}

Step 2. Add and halve.

A+AT=[2404640410],P=[120232025]A + A^T = \begin{bmatrix} 2 & 4 & 0 \\ 4 & 6 & 4 \\ 0 & 4 & 10 \end{bmatrix}, \qquad P = \begin{bmatrix} 1 & 2 & 0 \\ 2 & 3 & 2 \\ 0 & 2 & 5 \end{bmatrix}

Step 3. Sub­tract and halve.

A−AT=[04−4−4084−80],Q=[02−2−2042−40]A - A^T = \begin{bmatrix} 0 & 4 & -4 \\ -4 & 0 & 8 \\ 4 & -8 & 0 \end{bmatrix}, \qquad Q = \begin{bmatrix} 0 & 2 & -2 \\ -2 & 0 & 4 \\ 2 & -4 & 0 \end{bmatrix}

Check­ing the answer

P+Q=[14−20362−25]=AP + Q = \begin{bmatrix} 1 & 4 & -2 \\ 0 & 3 & 6 \\ 2 & -2 & 5 \end{bmatrix} = A. ✓

Answer

P=[120232025]P = \begin{bmatrix} 1 & 2 & 0 \\ 2 & 3 & 2 \\ 0 & 2 & 5 \end{bmatrix} (sym­met­ric), Q=[02−2−2042−40]Q = \begin{bmatrix} 0 & 2 & -2 \\ -2 & 0 & 4 \\ 2 & -4 & 0 \end{bmatrix} (skew-sym­met­ric), A=P+QA = P + Q.

Ques­tion 4: A Aᵀ is always sym­met­ric

The prob­lem

Show that for any square AA, AATAA^T is sym­met­ric.

Under­stand­ing the prob­lem

This is a proof. A matrix MM is sym­met­ric when MT=MM^T = M. So you must show (AAT)T=AAT(AA^T)^T = AA^T.

The idea

Use two rules of trans­poses: (XY)T=YTXT(XY)^T = Y^TX^T (order reverses) and (XT)T=X(X^T)^T = X.

Step-by-step solu­tion

Step 1. Apply the prod­uct rule with X=AX = A, Y=ATY = A^T.

(AAT)T=(AT)TAT(AA^T)^T = (A^T)^T A^T

Step 2. Trans­pos­ing twice gives back the orig­i­nal: (AT)T=A(A^T)^T = A.

(AAT)T=AAT(AA^T)^T = AA^T

Step 3. So AATAA^T equals its own trans­pose, which means it is sym­met­ric.

Check­ing the answer

Take A=[1203]A = \begin{bmatrix} 1 & 2 \\ 0 & 3 \end{bmatrix}: AAT=[5669]AA^T = \begin{bmatrix} 5 & 6 \\ 6 & 9 \end{bmatrix}, which is sym­met­ric. ✓

Answer

(AAT)T=(AT)TAT=AAT(AA^T)^T = (A^T)^TA^T = AA^T, so AATAA^T is sym­met­ric.

Ques­tion 5: Inverses by ele­men­tary row oper­a­tions

The prob­lem

Find the inverse by row oper­a­tions: (a) [3152]\begin{bmatrix} 3 & 1 \\ 5 & 2 \end{bmatrix}; (b) [4−31−1]\begin{bmatrix} 4 & -3 \\ 1 & -1 \end{bmatrix}.

Under­stand­ing the prob­lem

Write the aug­mented matrix [A∣I][A \mid I]. Apply row oper­a­tions to the whole row until the left half becomes II; the right half is then A−1A^{-1}.

The idea

Aim to cre­ate a 11 in the top-left, clear the entry below it, then clear the entry above the sec­ond 11. Choose oper­a­tions that avoid frac­tions where pos­si­ble.

Step-by-step solu­tion

Part (a)

Step 1. Start.

[31105201]\left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 5 & 2 & 0 & 1 \end{array}\right]

Step 2. R2→R2−R1R_2 \to R_2 - R_1.

[311021−11]\left[\begin{array}{cc|cc} 3 & 1 & 1 & 0 \\ 2 & 1 & -1 & 1 \end{array}\right]

Step 3. R1→R1−R2R_1 \to R_1 - R_2 gives a lead­ing 11.

[102−121−11]\left[\begin{array}{cc|cc} 1 & 0 & 2 & -1 \\ 2 & 1 & -1 & 1 \end{array}\right]

Step 4. R2→R2−2R1R_2 \to R_2 - 2R_1.

[102−101−53]\left[\begin{array}{cc|cc} 1 & 0 & 2 & -1 \\ 0 & 1 & -5 & 3 \end{array}\right]

The left half is II, so A−1=[2−1−53]A^{-1} = \begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix}.

Part (b)

Step 1. Start, then R1↔R2R_1 \leftrightarrow R_2 to bring a 11 to the top.

[4−3101−101]→[1−1014−310]\left[\begin{array}{cc|cc} 4 & -3 & 1 & 0 \\ 1 & -1 & 0 & 1 \end{array}\right] \to \left[\begin{array}{cc|cc} 1 & -1 & 0 & 1 \\ 4 & -3 & 1 & 0 \end{array}\right]

Step 2. R2→R2−4R1R_2 \to R_2 - 4R_1.

[1−101011−4]\left[\begin{array}{cc|cc} 1 & -1 & 0 & 1 \\ 0 & 1 & 1 & -4 \end{array}\right]

Step 3. R1→R1+R2R_1 \to R_1 + R_2.

[101−3011−4]\left[\begin{array}{cc|cc} 1 & 0 & 1 & -3 \\ 0 & 1 & 1 & -4 \end{array}\right]

So A−1=[1−31−4]A^{-1} = \begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix}.

Check­ing the answer

(a) [3152][2−1−53]=[6−5−3+310−10−5+6]=I\begin{bmatrix} 3 & 1 \\ 5 & 2 \end{bmatrix}\begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix} = \begin{bmatrix} 6 - 5 & -3 + 3 \\ 10 - 10 & -5 + 6 \end{bmatrix} = I. ✓
(b) [4−31−1][1−31−4]=[4−3−12+121−1−3+4]=I\begin{bmatrix} 4 & -3 \\ 1 & -1 \end{bmatrix}\begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix} = \begin{bmatrix} 4 - 3 & -12 + 12 \\ 1 - 1 & -3 + 4 \end{bmatrix} = I. ✓

Answer

(a) [2−1−53]\begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix}; (b) [1−31−4]\begin{bmatrix} 1 & -3 \\ 1 & -4 \end{bmatrix}.

Com­mon mis­take to avoid

Apply­ing an oper­a­tion to the left half only. Every oper­a­tion must be applied to the right half too.

Ques­tion 6: A matrix with no inverse

The prob­lem

Show that [6−3−21]\begin{bmatrix} 6 & -3 \\ -2 & 1 \end{bmatrix} has no inverse.

Under­stand­ing the prob­lem

With row oper­a­tions, a matrix has no inverse when, at some stage, a row of zeros appears on the left-hand side: then the left side can never become II.

The idea

Notice row 1 is −3-3 times row 2. So adding 3R23R_2 to R1R_1 should wipe out row 1.

Step-by-step solu­tion

Step 1. Write [A∣I][A \mid I].

[6−310−2101]\left[\begin{array}{cc|cc} 6 & -3 & 1 & 0 \\ -2 & 1 & 0 & 1 \end{array}\right]

Step 2. R1→R1+3R2R_1 \to R_1 + 3R_2.

[0013−2101]\left[\begin{array}{cc|cc} 0 & 0 & 1 & 3 \\ -2 & 1 & 0 & 1 \end{array}\right]

Step 3. The first row on the left is all zeros. No fur­ther row oper­a­tions can turn it into a row of II, so A−1A^{-1} does not exist.

Check­ing the answer

Row 1 of AA is −3-3 times row 2, so for any matrix CC, row 1 of ACAC is −3-3 times row 2 of ACAC. If ACAC were II, you would need (1,0)=−3(0,1)(1, 0) = -3(0, 1), which is false. So no inverse can exist. ✓

Answer

R1→R1+3R2R_1 \to R_1 + 3R_2 gives a zero row, so the matrix has no inverse.

Ques­tion 7: Inverse of an upper tri­an­gu­lar matrix

The prob­lem

Find A−1A^{-1} for A=[120013001]A = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 3 \\ 0 & 0 & 1 \end{bmatrix}.

Under­stand­ing the prob­lem

AA already has 11s on the diag­o­nal and zeros below it, so you only need to clear the entries above the diag­o­nal.

The idea

Work from the bot­tom up: use R3R_3 to clear col­umn 3, then R2R_2 to clear col­umn 2.

Step-by-step solu­tion

Step 1. Write [A∣I][A \mid I].

[120100013010001001]\left[\begin{array}{ccc|ccc} 1 & 2 & 0 & 1 & 0 & 0 \\ 0 & 1 & 3 & 0 & 1 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right]

Step 2. R2→R2−3R3R_2 \to R_2 - 3R_3 clears the 33.

[12010001001−3001001]\left[\begin{array}{ccc|ccc} 1 & 2 & 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 0 & 1 & -3 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right]

Step 3. R1→R1−2R2R_1 \to R_1 - 2R_2 clears the 22.

[1001−2601001−3001001]\left[\begin{array}{ccc|ccc} 1 & 0 & 0 & 1 & -2 & 6 \\ 0 & 1 & 0 & 0 & 1 & -3 \\ 0 & 0 & 1 & 0 & 0 & 1 \end{array}\right]

Check­ing the answer

[120013001][1−2601−3001]=[1−2+26−601−3+3001]=I\begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 3 \\ 0 & 0 & 1 \end{bmatrix}\begin{bmatrix} 1 & -2 & 6 \\ 0 & 1 & -3 \\ 0 & 0 & 1 \end{bmatrix} = \begin{bmatrix} 1 & -2 + 2 & 6 - 6 \\ 0 & 1 & -3 + 3 \\ 0 & 0 & 1 \end{bmatrix} = I

Answer

A−1=[1−2601−3001]A^{-1} = \begin{bmatrix} 1 & -2 & 6 \\ 0 & 1 & -3 \\ 0 & 0 & 1 \end{bmatrix}

Ques­tion 8: The rota­tion matrix is orthog­o­nal

The prob­lem

If A=[cos⁡α−sin⁡αsin⁡αcos⁡α]A = \begin{bmatrix} \cos\alpha & -\sin\alpha \\ \sin\alpha & \cos\alpha \end{bmatrix}, show ATA=IA^TA = I and hence A−1=ATA^{-1} = A^T.

Under­stand­ing the prob­lem

First com­pute the prod­uct ATAA^TA and show it is the iden­tity. Then explain why that makes ATA^T the inverse of AA.

The idea

Mul­ti­ply and use cos⁡2α+sin⁡2α=1\cos^2\alpha + \sin^2\alpha = 1.

Step-by-step solu­tion

Step 1. Trans­pose.

AT=[cos⁡αsin⁡α−sin⁡αcos⁡α]A^T = \begin{bmatrix} \cos\alpha & \sin\alpha \\ -\sin\alpha & \cos\alpha \end{bmatrix}

Step 2. Mul­ti­ply ATAA^TA.

ATA=[cos⁡2α+sin⁡2α−cos⁡αsin⁡α+sin⁡αcos⁡α−sin⁡αcos⁡α+cos⁡αsin⁡αsin⁡2α+cos⁡2α]A^TA = \begin{bmatrix} \cos^2\alpha + \sin^2\alpha & -\cos\alpha\sin\alpha + \sin\alpha\cos\alpha \\ -\sin\alpha\cos\alpha + \cos\alpha\sin\alpha & \sin^2\alpha + \cos^2\alpha \end{bmatrix}

Step 3. Sim­plify: each diag­o­nal entry is 11, each off-diag­o­nal entry is 00.

ATA=[1001]=IA^TA = \begin{bmatrix} 1 & 0 \\ 0 & 1 \end{bmatrix} = I

Step 4. In the same way, AAT=[cos⁡2α+sin⁡2αcos⁡αsin⁡α−sin⁡αcos⁡αsin⁡αcos⁡α−cos⁡αsin⁡αsin⁡2α+cos⁡2α]=IAA^T = \begin{bmatrix} \cos^2\alpha + \sin^2\alpha & \cos\alpha\sin\alpha - \sin\alpha\cos\alpha \\ \sin\alpha\cos\alpha - \cos\alpha\sin\alpha & \sin^2\alpha + \cos^2\alpha \end{bmatrix} = I. Since ATA^T mul­ti­plied by AA on either side gives II, ATA^T is the inverse of AA: A−1=ATA^{-1} = A^T.

Check­ing the answer

Take α=90∘\alpha = 90^\circ: A=[0−110]A = \begin{bmatrix} 0 & -1 \\ 1 & 0 \end{bmatrix}, AT=[01−10]A^T = \begin{bmatrix} 0 & 1 \\ -1 & 0 \end{bmatrix}, and ATA=IA^TA = I. ✓

Answer

ATA=AAT=IA^TA = AA^T = I, so A−1=ATA^{-1} = A^T.

Ques­tion 9: The rever­sal law for inverses

The prob­lem

If AA and BB are invert­ible, ver­ify (AB)−1=B−1A−1(AB)^{-1} = B^{-1}A^{-1} by mul­ti­ply­ing.

Under­stand­ing the prob­lem

A matrix CC is the inverse of ABAB when (AB)C=I(AB)C = I and C(AB)=IC(AB) = I. So take C=B−1A−1C = B^{-1}A^{-1} and check both prod­ucts. (AA and BB are square of the same order.)

The idea

Use asso­cia­tiv­ity to regroup the brack­ets so that BB−1BB^{-1} or A−1AA^{-1}A sit next to each other.

Step-by-step solu­tion

Step 1. Mul­ti­ply on the right.

(AB)(B−1A−1)=A(BB−1)A−1=AIA−1=AA−1=I(AB)(B^{-1}A^{-1}) = A(BB^{-1})A^{-1} = AIA^{-1} = AA^{-1} = I

Step 2. Mul­ti­ply on the left.

(B−1A−1)(AB)=B−1(A−1A)B=B−1IB=B−1B=I(B^{-1}A^{-1})(AB) = B^{-1}(A^{-1}A)B = B^{-1}IB = B^{-1}B = I

Step 3. Both prod­ucts are II, so B−1A−1B^{-1}A^{-1} is the inverse of ABAB.

Check­ing the answer

Note the order: in A−1B−1(AB)A^{-1}B^{-1}(AB) noth­ing can­cels, because B−1B^{-1} and AA are not next to each other; that is why the order must reverse.

Answer

(AB)(B−1A−1)=(B−1A−1)(AB)=I(AB)(B^{-1}A^{-1}) = (B^{-1}A^{-1})(AB) = I, so (AB)−1=B−1A−1(AB)^{-1} = B^{-1}A^{-1}.

Ques­tion 10: Find­ing k in a matrix equa­tion

The prob­lem

Find kk if A=[1234]A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} sat­is­fies A2−5A−kI=OA^2 - 5A - kI = O.

Under­stand­ing the prob­lem

OO is the zero matrix. You need the num­ber kk that makes A2−5AA^2 - 5A equal to kIkI.

The idea

Com­pute A2−5AA^2 - 5A; if it comes out as a mul­ti­ple of II, that mul­ti­ple is kk.

Step-by-step solu­tion

Step 1. Square AA.

A2=[1+62+83+126+16]=[7101522]A^2 = \begin{bmatrix} 1 + 6 & 2 + 8 \\ 3 + 12 & 6 + 16 \end{bmatrix} = \begin{bmatrix} 7 & 10 \\ 15 & 22 \end{bmatrix}

Step 2. Sub­tract 5A5A.

A2−5A=[7−510−1015−1522−20]=[2002]=2IA^2 - 5A = \begin{bmatrix} 7 - 5 & 10 - 10 \\ 15 - 15 & 22 - 20 \end{bmatrix} = \begin{bmatrix} 2 & 0 \\ 0 & 2 \end{bmatrix} = 2I

Step 3. So A2−5A−kI=(2−k)I=OA^2 - 5A - kI = (2 - k)I = O requires k=2k = 2.

Check­ing the answer

With k=2k = 2: A2−5A−2I=2I−2I=OA^2 - 5A - 2I = 2I - 2I = O. ✓

Answer

k=2k = 2