Level 3 — ProductionMatrices & Determinants — Introduction

Matrices & Determinants — Introduction

45 minutes60 marksprintable — key stays hidden on paper

Level 3 — Production Paper

Time limit: 45 minutes
Total marks: 60

Instructions: Show all derivations from scratch. Where an "explain" is requested, write your reasoning in full sentences. Use ...... / ...... for mathematics.


Q1. (10 marks) From-scratch derivation of the 2×22\times2 inverse.

(a) Let A=(abcd)A=\begin{pmatrix} a & b \\ c & d\end{pmatrix}. Starting from the requirement AX=IAX = I where X=(x1x2x3x4)X=\begin{pmatrix} x_1 & x_2 \\ x_3 & x_4\end{pmatrix}, solve the resulting linear systems to derive the formula for A1A^{-1}. State clearly the condition for existence. (7)

(b) Explain out loud (in words) why a square matrix with detA=0\det A = 0 cannot have an inverse, referencing your derivation. (3)


Q2. (12 marks) Symmetric / skew-symmetric decomposition.

(a) Prove that any square matrix MM can be written uniquely as M=S+KM = S + K where SS is symmetric and KK is skew-symmetric. Derive expressions for SS and KK. (6)

(b) Apply your result to M=(4372)M=\begin{pmatrix} 4 & 3 \\ 7 & 2\end{pmatrix}, giving SS and KK explicitly. (4)

(c) State what all diagonal entries of any skew-symmetric matrix must equal, and justify from the definition. (2)


Q3. (12 marks) Determinant of a 3×33\times3 via cofactor expansion + properties.

Let A=(213045102).A=\begin{pmatrix} 2 & -1 & 3 \\ 0 & 4 & 5 \\ 1 & 0 & 2\end{pmatrix}.

(a) Compute detA\det A by cofactor expansion along the first column. Show every cofactor. (6)

(b) Recompute detA\det A by expansion along a different row or column of your choice and confirm the values agree. (4)

(c) Explain out loud why expansion along any row or column gives the same answer. (2)


Q4. (10 marks) Non-commutativity and transpose properties.

(a) For A=(1201)A=\begin{pmatrix} 1 & 2 \\ 0 & 1\end{pmatrix}, B=(1031)B=\begin{pmatrix} 1 & 0 \\ 3 & 1\end{pmatrix}, compute ABAB and BABA and state whether they are equal. (4)

(b) Verify the property (AB)T=BTAT(AB)^{T} = B^{T}A^{T} for these matrices by computing both sides. (4)

(c) Explain out loud why matrix multiplication is generally not commutative, referring to the order/dimension conditions. (2)


Q5. (16 marks) Solving a 2×22\times2 system — two methods.

Consider the system 3x+2y=7,x4y=9.3x + 2y = 7, \qquad x - 4y = -9.

(a) Solve using Cramer's rule. Show DD, DxD_x, DyD_y and the final values. (6)

(b) Solve the same system using matrix inversion (X=A1bX = A^{-1}b), computing A1A^{-1} from scratch. (7)

(c) Explain out loud one condition under which neither method gives a unique solution, and what it means geometrically. (3)


Answer keyMark scheme & solutions

Q1 (10)

(a) AX=IAX=I gives two systems (one per column of II): Column 1: ax1+bx3=1ax_1+bx_3=1, cx1+dx3=0cx_1+dx_3=0. Column 2: ax2+bx4=0ax_2+bx_4=0, cx2+dx4=1cx_2+dx_4=1. (1 for setting up systems)

Solve column 1: from second eqn x3=cdx1x_3=-\frac{c}{d}x_1 (or eliminate). Using elimination: x1=dadbcx_1 = \dfrac{d}{ad-bc}, x3=cadbcx_3=\dfrac{-c}{ad-bc}. (2) Column 2 similarly: x2=badbcx_2=\dfrac{-b}{ad-bc}, x4=aadbcx_4=\dfrac{a}{ad-bc}. (2)

Hence A1=1adbc(dbca).A^{-1}=\frac{1}{ad-bc}\begin{pmatrix} d & -b \\ -c & a\end{pmatrix}. (1) Condition: exists iff adbc=detA0ad-bc=\det A \neq 0. (1)

(b) The formula divides by detA\det A; if detA=0\det A=0 the division is undefined, so no matrix XX satisfies AX=IAX=I. Geometrically the rows/columns are linearly dependent, so AA collapses dimensions and cannot be undone. (3: any valid reasoning referencing derivation)

Q2 (12)

(a) Suppose M=S+KM=S+K with ST=SS^T=S, KT=KK^T=-K. Take transpose: MT=ST+KT=SKM^T=S^T+K^T=S-K. (2) Add: M+MT=2SS=12(M+MT)M+M^T=2S \Rightarrow S=\tfrac12(M+M^T). (1) Subtract: MMT=2KK=12(MMT)M-M^T=2K \Rightarrow K=\tfrac12(M-M^T). (1) Check ST=12(MT+M)=SS^T=\tfrac12(M^T+M)=S ✓, KT=12(MTM)=KK^T=\tfrac12(M^T-M)=-K ✓. (1) Uniqueness: the two equations determine S,KS,K from MM uniquely. (1)

(b) MT=(4732)M^T=\begin{pmatrix}4&7\\3&2\end{pmatrix}. S=12(810104)=(4552)S=\tfrac12\begin{pmatrix}8&10\\10&4\end{pmatrix}=\begin{pmatrix}4&5\\5&2\end{pmatrix}. (2) K=12(0440)=(0220)K=\tfrac12\begin{pmatrix}0&-4\\4&0\end{pmatrix}=\begin{pmatrix}0&-2\\2&0\end{pmatrix}. (2)

(c) Diagonal entries are all 00. From KT=KK^T=-K, entry kii=kii2kii=0kii=0k_{ii}=-k_{ii}\Rightarrow 2k_{ii}=0\Rightarrow k_{ii}=0. (2)

Q3 (12)

(a) Expand along column 1 (entries 2,0,12,0,1): detA=2C11+0C21+1C31\det A = 2\cdot C_{11} + 0\cdot C_{21} + 1\cdot C_{31}. C11=+det(4502)=8C_{11}=+\det\begin{pmatrix}4&5\\0&2\end{pmatrix}=8. (2) C31=+det(1345)=(1)(5)(3)(4)=512=17C_{31}=+\det\begin{pmatrix}-1&3\\4&5\end{pmatrix}=(-1)(5)-(3)(4)=-5-12=-17. (2) (middle term zero.) detA=2(8)+1(17)=1617=1.\det A = 2(8)+1(-17)=16-17=-1. (2)

(b) Expand along row 3 (entries 1,0,21,0,2): =1(+)det(1345)+0+2(+)det(2104)= 1\cdot(+)\det\begin{pmatrix}-1&3\\4&5\end{pmatrix} + 0 + 2\cdot(+)\det\begin{pmatrix}2&-1\\0&4\end{pmatrix} =1(17)+2(8)=17+16=1= 1(-17)+2(8)= -17+16 = -1. Matches. (4)

(c) The cofactor expansion along any line is a way of grouping the same signed permutation terms of the determinant; the determinant is a single well-defined value independent of the chosen line. (2)

Q4 (10)

(a) AB=(1201)(1031)=(7231)AB=\begin{pmatrix}1&2\\0&1\end{pmatrix}\begin{pmatrix}1&0\\3&1\end{pmatrix}=\begin{pmatrix}7&2\\3&1\end{pmatrix}. (2) BA=(1031)(1201)=(1237)BA=\begin{pmatrix}1&0\\3&1\end{pmatrix}\begin{pmatrix}1&2\\0&1\end{pmatrix}=\begin{pmatrix}1&2\\3&7\end{pmatrix}. (1) ABBAAB\neq BA. (1)

(b) (AB)T=(7321)(AB)^T=\begin{pmatrix}7&3\\2&1\end{pmatrix}. (1) BT=(1301)B^T=\begin{pmatrix}1&3\\0&1\end{pmatrix}, AT=(1021)A^T=\begin{pmatrix}1&0\\2&1\end{pmatrix}. BTAT=(1301)(1021)=(7321)B^TA^T=\begin{pmatrix}1&3\\0&1\end{pmatrix}\begin{pmatrix}1&0\\2&1\end{pmatrix}=\begin{pmatrix}7&3\\2&1\end{pmatrix}. (2) Equal ✓. (1)

(c) Multiplication combines rows of the first with columns of the second; swapping order changes which rows meet which columns (and may not even be defined dimensionally), so results differ in general. (2)

Q5 (16)

(a) A=(3214)A=\begin{pmatrix}3&2\\1&-4\end{pmatrix}, b=(79)b=\begin{pmatrix}7\\-9\end{pmatrix}. D=3(4)2(1)=14D=3(-4)-2(1)=-14. (2) Dx=det(7294)=7(4)2(9)=28+18=10D_x=\det\begin{pmatrix}7&2\\-9&-4\end{pmatrix}=7(-4)-2(-9)=-28+18=-10. (1) Dy=det(3719)=3(9)7(1)=277=34D_y=\det\begin{pmatrix}3&7\\1&-9\end{pmatrix}=3(-9)-7(1)=-27-7=-34. (1) x=Dx/D=1014=57x=D_x/D=\frac{-10}{-14}=\frac{5}{7}, y=Dy/D=3414=177y=D_y/D=\frac{-34}{-14}=\frac{17}{7}. (2)

(b) detA=14\det A=-14, A1=114(4213)A^{-1}=\frac{1}{-14}\begin{pmatrix}-4&-2\\-1&3\end{pmatrix}. (3) X=A1b=114(4213)(79)X=A^{-1}b=\frac{1}{-14}\begin{pmatrix}-4&-2\\-1&3\end{pmatrix}\begin{pmatrix}7\\-9\end{pmatrix} =114(28+18727)=114(1034)=(5/717/7)=\frac{1}{-14}\begin{pmatrix}-28+18\\-7-27\end{pmatrix}=\frac{1}{-14}\begin{pmatrix}-10\\-34\end{pmatrix}=\begin{pmatrix}5/7\\17/7\end{pmatrix}. (4) (matches (a))

(c) If D=detA=0D=\det A=0, neither Cramer's rule nor inversion works (division by zero / no inverse). Geometrically the two lines are parallel — either coincident (infinitely many solutions) or distinct (no solution). (3)

[
  {"claim":"det of Q3 matrix A = -1","code":"A=Matrix([[2,-1,3],[0,4,5],[1,0,2]]); result=(A.det()==-1)"},
  {"claim":"Q4 AB != BA","code":"A=Matrix([[1,2],[0,1]]); B=Matrix([[1,0],[3,1]]); result=(A*B!=B*A)"},
  {"claim":"Q4 (AB)^T = B^T A^T","code":"A=Matrix([[1,2],[0,1]]); B=Matrix([[1,0],[3,1]]); result=((A*B).T==B.T*A.T)"},
  {"claim":"Q5 solution x=5/7 y=17/7","code":"A=Matrix([[3,2],[1,-4]]); b=Matrix([7,-9]); X=A.inv()*b; result=(X==Matrix([Rational(5,7),Rational(17,7)]))"},
  {"claim":"Q2 S+K reconstructs M","code":"M=Matrix([[4,3],[7,2]]); S=(M+M.T)/2; K=(M-M.T)/2; result=(S+K==M and S.T==S and K.T==-K)"}
]