Chapter 3 · Matrices and Determinants

3.3 Adjoint, Inverse and Systems of Linear Equations

The adjoint of a square matrix turns its cofactors into an inverse: $A^{-1}=\frac{1}{|A|}\operatorname{adj}A$ whenever $|A|\ne0$. With the inverse, a system of linear equations $AX=B$ is solved in one line — and when $|A|=0$, the same cofactors decide whether there are no solutions or infinitely many.

To solve $5x=15$ you divide by $5$ — that is, you multiply both sides by $5^{-1}=\tfrac15$, the number that undoes multiplication by $5$. A system such as $2x+y+z=17$, $x+2y+z=15$, $x+y+3z=20$ is a single matrix equation $AX=B$, and we would like to solve it the same way: $X=A^{-1}B$. But matrices cannot be divided, and some of them cannot be undone at all — the nilpotent matrix of Section 3.1 squashes the whole plane onto a line, and no matrix can unsquash it. Which matrices have an inverse, and how do you find it?

The answer comes straight from Section 3.2. Arrange the cofactors of $A$ into a matrix and transpose it: this adjoint multiplied by $A$ gives $|A|$ times the identity. So if $|A|\ne0$, dividing the adjoint by $|A|$ produces $A^{-1}$; if $|A|=0$, there is no inverse. In this section we build the adjoint and its properties, find inverses, and then solve systems of two or three linear equations: by $X=A^{-1}B$ (or Cramer's rule) when $|A|\ne0$, and by the test of consistency when $|A|=0$. JEE Main asks about this in nearly every paper: a chain of properties such as $|\operatorname{adj}(\operatorname{adj}A)|$, an inverse found from a matrix equation, or "for which $\lambda$ and $\mu$ does the system have infinitely many solutions?".

The Adjoint of a Square Matrix

📘 Definition 3.11 — Adjoint

The adjoint (adjugate) of a square matrix $A=[a_{ij}]$ is the transpose of the matrix of its cofactors: $\operatorname{adj}A=[C_{ij}]^{T}$, so the $(i,j)$ entry of $\operatorname{adj}A$ is $C_{ji}$. For a $3\times3$ matrix,

$$\operatorname{adj}A=\begin{bmatrix}C_{11}&C_{21}&C_{31}\\C_{12}&C_{22}&C_{32}\\C_{13}&C_{23}&C_{33}\end{bmatrix}.$$

For a $2\times2$ matrix the cofactors are single entries, and $\operatorname{adj}\begin{bmatrix}a&b\\c&d\end{bmatrix}=\begin{bmatrix}d&-b\\-c&a\end{bmatrix}$: swap the diagonal entries and change the signs of the other two.

📐 Theorem 3.12 — The fundamental identity of the adjoint

For every square matrix $A$ of order $n$,

$$A\,(\operatorname{adj}A)=(\operatorname{adj}A)\,A=|A|\,I_n.$$

Proof. The $(i,k)$ entry of $A\,(\operatorname{adj}A)$ is row $i$ of $A$ times column $k$ of $\operatorname{adj}A$, and column $k$ of $\operatorname{adj}A$ holds the cofactors of row $k$ of $A$:

$$\big(A\,\operatorname{adj}A\big)_{ik}=a_{i1}C_{k1}+a_{i2}C_{k2}+a_{i3}C_{k3}=\begin{cases}|A|,&i=k\ \ \text{(Theorem 3.7)},\\0,&i\ne k\ \ \text{(Theorem 3.10)}.\end{cases}$$

So $A\,(\operatorname{adj}A)$ has $|A|$ down the diagonal and $0$ elsewhere: it is $|A|\,I$. The same argument with columns gives $(\operatorname{adj}A)\,A=|A|\,I$. $\blacksquare$ This is the whole reason the transpose appears in the definition: it puts the cofactors of row $k$ into column $k$, where row-by-column multiplication meets them.

✏️ Example 1 — Building adjoints
(a) Find $\operatorname{adj}A$ for $A=\begin{bmatrix}3&-1\\4&2\end{bmatrix}$ and verify Theorem 3.12. (b) Find $\operatorname{adj}A$ for $A=\begin{bmatrix}1&2&0\\-1&1&3\\2&0&1\end{bmatrix}$ and verify that $A\,(\operatorname{adj}A)=|A|\,I$.
(a) Swap $3$ and $2$, change the signs of $-1$ and $4$: $\operatorname{adj}A=\begin{bmatrix}2&1\\-4&3\end{bmatrix}$. Then $A\,(\operatorname{adj}A)=\begin{bmatrix}6+4&3-3\\8-8&4+6\end{bmatrix}=10I$, and $|A|=6+4=10$ ✓.
(b) Cofactors Row 1: $C_{11}=\begin{vmatrix}1&3\\0&1\end{vmatrix}=1$, $C_{12}=-\begin{vmatrix}-1&3\\2&1\end{vmatrix}=7$, $C_{13}=\begin{vmatrix}-1&1\\2&0\end{vmatrix}=-2$. Row 2: $C_{21}=-\begin{vmatrix}2&0\\0&1\end{vmatrix}=-2$, $C_{22}=\begin{vmatrix}1&0\\2&1\end{vmatrix}=1$, $C_{23}=-\begin{vmatrix}1&2\\2&0\end{vmatrix}=4$. Row 3: $C_{31}=\begin{vmatrix}2&0\\1&3\end{vmatrix}=6$, $C_{32}=-\begin{vmatrix}1&0\\-1&3\end{vmatrix}=-3$, $C_{33}=\begin{vmatrix}1&2\\-1&1\end{vmatrix}=3$.
Transpose The cofactors of row $k$ become column $k$:
$$\operatorname{adj}A=\begin{bmatrix}1&-2&6\\7&1&-3\\-2&4&3\end{bmatrix},\qquad |A|=1\cdot1+2\cdot7+0\cdot(-2)=15.$$
Verify Row $1$ of $A$ times the columns of $\operatorname{adj}A$: $1+14=15$, $-2+2=0$, $6-6=0$. Row $2$: $-1+7-6=0$, $2+1+12=15$, $-6-3+9=0$. Row $3$: $2-2=0$, $-4+4=0$, $12+3=15$. So $A\,(\operatorname{adj}A)=15I$ ✓.

$S=\begin{bmatrix}1&2&1\\2&1&3\\3&3&4\end{bmatrix}$ has third row equal to the sum of the first two, so $|S|=0$. Its adjoint is not the zero matrix. What is $S\,(\operatorname{adj}S)$?

Choose the preset singular and let Play run to the end. The lab builds all nine cofactors (for instance $C_{11}=1\cdot4-3\cdot3=-5$), transposes them into $\operatorname{adj}S=\begin{bmatrix}-5&-5&5\\1&1&-1\\3&3&-3\end{bmatrix}$ — not zero — and then multiplies: the readout shows $S\cdot\operatorname{adj}S=O$. Theorem 3.12 says $S\,(\operatorname{adj}S)=|S|\,I=0\cdot I=O$. Every square matrix has an adjoint; only the step "divide by $|A|$" fails, so $S$ has no inverse.
Interactive 1 — The Adjoint Machine

Press Play (or step ▸) to build the adjoint one cofactor at a time: the lab crosses out row $i$ and column $j$ of $A$, evaluates the $2\times2$ minor that is left, attaches the chessboard sign and writes the cofactor $C_{ij}$. Then it transposes the cofactor matrix to get $\operatorname{adj}A$, multiplies $A\cdot\operatorname{adj}A$ to show $|A|\,I$, and divides by $|A|$ — when it can.

$|A|$—
current step—
$A\cdot\operatorname{adj}A$—
inverse?—

For $A=\begin{bmatrix}5&2\\-3&4\end{bmatrix}$, $\operatorname{adj}A$ is

The Inverse of a Square Matrix

📘 Definition 3.12 — Inverse of a matrix

A square matrix $A$ of order $n$ is invertible if there is a square matrix $B$ of the same order with $AB=BA=I_n$. Such a $B$ is called the inverse of $A$ and written $A^{-1}$.

📐 Theorem 3.13 — When does the inverse exist, and what is it?
  1. An inverse, if it exists, is unique.
  2. $A$ is invertible if and only if $|A|\ne0$ ($A$ is non-singular), and then $$A^{-1}=\frac{1}{|A|}\operatorname{adj}A.$$
  3. For square matrices, $AB=I$ alone already implies $BA=I$, so $B=A^{-1}$.

In particular, for $ad-bc\ne0$: $\ \begin{bmatrix}a&b\\c&d\end{bmatrix}^{-1}=\dfrac{1}{ad-bc}\begin{bmatrix}d&-b\\-c&a\end{bmatrix}$.

Proof. (1) If $B$ and $C$ are both inverses of $A$, then $B=BI=B(AC)=(BA)C=IC=C$. (2) If $AB=I$, then $|A||B|=|I|=1$ by Theorem 3.9, so $|A|\ne0$. Conversely, if $|A|\ne0$, divide Theorem 3.12 by $|A|$: $A\big(\tfrac{1}{|A|}\operatorname{adj}A\big)=\big(\tfrac1{|A|}\operatorname{adj}A\big)A=I$. (3) If $AB=I$, then $|A|\ne0$ as in (2), so $A^{-1}$ exists, and $B=A^{-1}(AB)=A^{-1}$. $\blacksquare$

📐 Theorem 3.14 — Properties of the inverse

If $A$ and $B$ are invertible matrices of the same order and $k\ne0$:

Undo twice$(A^{-1})^{-1}=A$
Products reverse$(AB)^{-1}=B^{-1}A^{-1}$
Transpose$(A^{T})^{-1}=(A^{-1})^{T}$
Multiples and determinant$(kA)^{-1}=\tfrac1kA^{-1},\quad |A^{-1}|=\dfrac1{|A|}$

And cancelling is allowed for invertible matrices: if $A$ is invertible and $AB=AC$, then $B=C$.

Proofs. Each one is "check that the claimed inverse works" plus Theorem 3.13(3): $(AB)(B^{-1}A^{-1})=A(BB^{-1})A^{-1}=AA^{-1}=I$; $\ A^{T}(A^{-1})^{T}=(A^{-1}A)^{T}=I^{T}=I$; $\ |A||A^{-1}|=|AA^{-1}|=1$. For cancelling, multiply $AB=AC$ on the left by $A^{-1}$. $\blacksquare$ Compare Section 3.1: $AB=AC$ does not allow cancelling in general — invertibility is exactly what is needed.

✏️ Example 2 — Finding inverses
(a) Find the inverse of $\begin{bmatrix}3&5\\1&2\end{bmatrix}$. (b) Find $A^{-1}$ for $A=\begin{bmatrix}2&1&-1\\0&1&3\\1&0&2\end{bmatrix}$, and check your answer.
Find the $(2,3)$ entry of $A^{-1}$ in (b), as a decimal:
(a) $ad-bc=6-5=1$, so the inverse is the adjoint itself: $\begin{bmatrix}2&-5\\-1&3\end{bmatrix}$. Check: $\begin{bmatrix}3&5\\1&2\end{bmatrix}\begin{bmatrix}2&-5\\-1&3\end{bmatrix}=\begin{bmatrix}1&0\\0&1\end{bmatrix}$ ✓.
(b) Determinant Along row $1$: $|A|=2(2-0)-1(0-3)+(-1)(0-1)=4+3+1=8\ne0$, so $A^{-1}$ exists.
Cofactors $C_{11}=2$, $C_{12}=3$, $C_{13}=-1$; $C_{21}=-2$, $C_{22}=5$, $C_{23}=1$; $C_{31}=4$, $C_{32}=-6$, $C_{33}=2$. Transposing and dividing by $8$:
$$A^{-1}=\frac18\begin{bmatrix}2&-2&4\\3&5&-6\\-1&1&2\end{bmatrix}.$$
Check $A\,\operatorname{adj}A$: row $1$ gives $4+3+1=8$, $-4+5-1=0$, $8-6-2=0$; row $2$ gives $3-3=0$, $5+3=8$, $-6+6=0$; row $3$ gives $2-2=0$, $-2+2=0$, $4+4=8$. So $A\,\operatorname{adj}A=8I$ and $AA^{-1}=I$ ✓. The $(2,3)$ entry of $A^{-1}$ is $\tfrac{-6}{8}=-0.75$.

With the inverse in hand, the properties of the adjoint that JEE Main loves follow in a line or two each.

📐 Theorem 3.15 — Properties of the adjoint

For square matrices $A$, $B$ of order $n$ ($n=2$ or $3$) and a number $k$:

$$|\operatorname{adj}A|=|A|^{n-1},\qquad \operatorname{adj}(\operatorname{adj}A)=|A|^{n-2}A,\qquad |\operatorname{adj}(\operatorname{adj}A)|=|A|^{(n-1)^2},$$ $$\operatorname{adj}(kA)=k^{n-1}\operatorname{adj}A,\qquad \operatorname{adj}(A^{T})=(\operatorname{adj}A)^{T},\qquad \operatorname{adj}(AB)=(\operatorname{adj}B)(\operatorname{adj}A).$$

For $n=3$: $|\operatorname{adj}A|=|A|^2$, $\operatorname{adj}(\operatorname{adj}A)=|A|\,A$, $|\operatorname{adj}(\operatorname{adj}A)|=|A|^4$.

Proofs (for $|A|\ne0$; the formulas stay true when $|A|=0$). Take determinants in Theorem 3.12: $|A|\,|\operatorname{adj}A|=\big||A|\,I_n\big|=|A|^n$, and divide by $|A|$. Next, $\operatorname{adj}A=|A|A^{-1}$; apply this to $\operatorname{adj}A$ itself: $\operatorname{adj}(\operatorname{adj}A)=|\operatorname{adj}A|\,(\operatorname{adj}A)^{-1}$ $=|A|^{n-1}\cdot\tfrac{1}{|A|}A=|A|^{n-2}A$, using $(\operatorname{adj}A)^{-1}=\big(|A|A^{-1}\big)^{-1}=\tfrac1{|A|}A$. Its determinant is $\big(|A|^{n-2}\big)^n|A|=|A|^{n^2-2n+1}=|A|^{(n-1)^2}$. Every cofactor of $kA$ is an $(n-1)\times(n-1)$ determinant with each row multiplied by $k$, so it gains a factor $k^{n-1}$. Finally $\operatorname{adj}(AB)=|AB|(AB)^{-1}$ $=|A||B|B^{-1}A^{-1}$ $=\big(|B|B^{-1}\big)\big(|A|A^{-1}\big)$ $=(\operatorname{adj}B)(\operatorname{adj}A)$ — the order reverses again. $\blacksquare$

✏️ Example 3 — A chain of determinants
$A$ is a $3\times3$ matrix with $|A|=3$. Find (a) $|\operatorname{adj}A|$, (b) $|\operatorname{adj}(\operatorname{adj}A)|$, (c) $|A^{-1}|$, (d) $|\operatorname{adj}(2A)|$, (e) $|A\,\operatorname{adj}A|$.
Find (d), $|\operatorname{adj}(2A)|$:
(a) $|\operatorname{adj}A|=|A|^{n-1}=3^2=9$.
(b) $|\operatorname{adj}(\operatorname{adj}A)|=|A|^{(n-1)^2}=3^4=81$. (Or: $\operatorname{adj}A$ has determinant $9$, so its adjoint has determinant $9^2=81$.)
(c) $|A^{-1}|=\tfrac13$.
(d) $\operatorname{adj}(2A)=2^{2}\operatorname{adj}A$, so $|\operatorname{adj}(2A)|=4^3\,|\operatorname{adj}A|=64\cdot9=576$. Check another way: $|\operatorname{adj}(2A)|=|2A|^2=(8\cdot3)^2=576$ ✓.
(e) $A\,\operatorname{adj}A=3I$, whose determinant is $3^3=27$.
✏️ Example 4 — An inverse from a matrix equation
(a) For $A=\begin{bmatrix}3&1\\-1&2\end{bmatrix}$, show that $A^2-5A+7I=O$ and use it to find $A^{-1}$. (b) With $B=\begin{bmatrix}1&2\\0&1\end{bmatrix}$, find $(AB)^{-1}$.
(a) Verify $A^2=\begin{bmatrix}9-1&3+2\\-3-2&-1+4\end{bmatrix}=\begin{bmatrix}8&5\\-5&3\end{bmatrix}$ and $5A=\begin{bmatrix}15&5\\-5&10\end{bmatrix}$, so $A^2-5A=-7I$ ✓.
Factor out $A$ $A(A-5I)=-7I$, i.e. $A\cdot\tfrac17(5I-A)=I$. By Theorem 3.13(3):
$$A^{-1}=\tfrac17(5I-A)=\tfrac17\begin{bmatrix}2&-1\\1&3\end{bmatrix}.$$
Check The $2\times2$ formula gives the same: $|A|=6+1=7$ and $\operatorname{adj}A=\begin{bmatrix}2&-1\\1&3\end{bmatrix}$ ✓.
(b) $(AB)^{-1}=B^{-1}A^{-1}=\begin{bmatrix}1&-2\\0&1\end{bmatrix}\cdot\tfrac17\begin{bmatrix}2&-1\\1&3\end{bmatrix}=\tfrac17\begin{bmatrix}0&-7\\1&3\end{bmatrix}$.
Check $AB=\begin{bmatrix}3&7\\-1&0\end{bmatrix}$, $|AB|=7$, and $\tfrac17\begin{bmatrix}0&-7\\1&3\end{bmatrix}$ is exactly $\tfrac1{|AB|}\operatorname{adj}(AB)$ ✓. Writing $A^{-1}B^{-1}$ instead gives a different, wrong matrix.

$A$ is a $3\times3$ matrix with $|A|=2$. Then $|\operatorname{adj}A|$ is

Systems of Linear Equations: Solution and Consistency

📘 Definition 3.13 — Linear systems, consistency

A system of three linear equations in $x$, $y$, $z$,

$$a_1x+b_1y+c_1z=d_1,\quad a_2x+b_2y+c_2z=d_2,\quad a_3x+b_3y+c_3z=d_3,$$

is the matrix equation $AX=B$ with coefficient matrix $A=\begin{bmatrix}a_1&b_1&c_1\\a_2&b_2&c_2\\a_3&b_3&c_3\end{bmatrix}$, $X=\begin{bmatrix}x\\y\\z\end{bmatrix}$, $B=\begin{bmatrix}d_1\\d_2\\d_3\end{bmatrix}$ (two equations in $x$, $y$ work the same way with $2\times2$ matrices). The system is consistent if it has at least one solution and inconsistent if it has none. It is homogeneous if $B=O$; a homogeneous system always has the trivial solution $X=O$.

Geometry explains the possible answers. Two equations in $x$, $y$ are two lines: they meet in one point, are parallel (no point in common) or coincide (infinitely many common points). Three equations in $x$, $y$, $z$ are three planes in space, which meet in a single point, along a whole line, in a whole plane, or not at all. So a linear system has exactly one solution, none, or infinitely many — never exactly two.

|A| ≠ 0: one solution parallel: no solution same line: infinitely many
📐 Theorem 3.16 — The matrix method and Cramer's rule

If $|A|\ne0$, the system $AX=B$ has exactly one solution,

$$X=A^{-1}B=\frac{1}{|A|}(\operatorname{adj}A)\,B.$$

Equivalently (Cramer's rule), with $\Delta=|A|$ and $\Delta_1$, $\Delta_2$, $\Delta_3$ the determinants obtained by replacing the first, second, third column of $A$ by $B$:

$$x=\frac{\Delta_1}{\Delta},\qquad y=\frac{\Delta_2}{\Delta},\qquad z=\frac{\Delta_3}{\Delta}.$$

Proof. If $AX=B$, multiply on the left by $A^{-1}$: $X=A^{-1}B$, so there is at most one solution. And $X=A^{-1}B$ really is a solution: $A(A^{-1}B)=B$. For Cramer's rule, the first entry of $(\operatorname{adj}A)B$ is $C_{11}d_1+C_{21}d_2+C_{31}d_3$ — the expansion along column $1$ of the determinant whose first column is $B$ and whose other columns are those of $A$. That is $\Delta_1$; similarly for $\Delta_2$, $\Delta_3$. $\blacksquare$ So $(\operatorname{adj}A)B=\begin{bmatrix}\Delta_1\\\Delta_2\\\Delta_3\end{bmatrix}$ — a fact we use again in a moment.

📐 Theorem 3.17 — Test of consistency when $|A|=0$; homogeneous systems

Let $|A|=0$.

  1. If $(\operatorname{adj}A)B\ne O$ — that is, at least one of $\Delta_1$, $\Delta_2$, $\Delta_3$ is non-zero — the system $AX=B$ is inconsistent (no solution).
  2. If $(\operatorname{adj}A)B=O$ ($\Delta_1=\Delta_2=\Delta_3=0$), the system has either infinitely many solutions or none; eliminate to decide.

A homogeneous system $AX=O$ has only the trivial solution if $|A|\ne0$, and infinitely many solutions (non-trivial ones included) if $|A|=0$.

Proof. (1) If $X$ were a solution, then $(\operatorname{adj}A)B=(\operatorname{adj}A)AX=|A|X=O$. So $(\operatorname{adj}A)B\ne O$ rules out every solution. (2) Both cases really happen. The system $x+y+z=1$, $2x+2y+2z=3$, $3x+3y+3z=4$ has every $2\times2$ minor of $A$ equal to $0$, so $\operatorname{adj}A=O$ and all $\Delta_i=0$ — yet it has no solution, since twice the first equation says $2x+2y+2z=2\ne3$. Change the right-hand sides to $1,2,3$ and every point of the plane $x+y+z=1$ is a solution. For the homogeneous system, $|A|\ne0$ gives the unique solution $X=A^{-1}O=O$. If $|A|=0$ and $\operatorname{adj}A\ne O$, some column $v$ of $\operatorname{adj}A$ is non-zero, and $A\,\operatorname{adj}A=|A|I=O$ says $Av=O$; then every multiple $tv$ is a solution too. (If $\operatorname{adj}A=O$, all $2\times2$ minors vanish, the rows of $A$ are multiples of one row $(p,q,r)$, and a non-zero vector such as $(q,-p,0)$ or $(r,0,-p)$ solves every equation.) $\blacksquare$

🧭 Problem-solving strategy — the test of consistency, in order
  1. Compute $\Delta=|A|$. If $\Delta\ne0$: unique solution — find it by $X=A^{-1}B$ or by Cramer's rule.
  2. If $\Delta=0$: compute $\Delta_1$, $\Delta_2$, $\Delta_3$ (equivalently $(\operatorname{adj}A)B$). If any is non-zero: no solution.
  3. If all are zero: look for a combination of equations whose left sides cancel or agree (for example, "equation 3 = equation 1 + equation 2" on the left). If the right sides agree in the same way, there are infinitely many solutions — solve the independent equations with one variable as a parameter; otherwise none.
  4. Parameter questions ("find $\lambda$, $\mu$"): $\Delta(\lambda)=0$ gives the critical $\lambda$; then the $\Delta_i$ (or the combination of equations) decide $\mu$.
✏️ Example 5 — Blending fertiliser by the matrix method
A farmer needs exactly $17$ kg of nitrogen (N), $15$ kg of phosphorus (P) and $20$ kg of potassium (K). Bag X contains $2$ kg N, $1$ kg P, $1$ kg K; bag Y contains $1$ kg N, $2$ kg P, $1$ kg K; bag Z contains $1$ kg N, $1$ kg P, $3$ kg K. How many bags of each should be bought? Use $X=A^{-1}B$.
Set up With $x$, $y$, $z$ bags of X, Y, Z, one equation per nutrient:
$$\begin{bmatrix}2&1&1\\1&2&1\\1&1&3\end{bmatrix}\begin{bmatrix}x\\y\\z\end{bmatrix}=\begin{bmatrix}17\\15\\20\end{bmatrix}.$$
Determinant and adjoint $|A|=2(6-1)-1(3-1)+1(1-2)=10-2-1=7\ne0$. The cofactors give the (here symmetric) adjoint $\operatorname{adj}A=\begin{bmatrix}5&-2&-1\\-2&5&-1\\-1&-1&3\end{bmatrix}$.
Solve $X=\tfrac17\operatorname{adj}A\,B=\tfrac17\begin{bmatrix}85-30-20\\-34+75-20\\-17-15+60\end{bmatrix}=\tfrac17\begin{bmatrix}35\\21\\28\end{bmatrix}=\begin{bmatrix}5\\3\\4\end{bmatrix}$.
Answer $5$ bags of X, $3$ of Y and $4$ of Z. Check: N $10+3+4=17$, P $5+6+4=15$, K $5+3+12=20$ ✓.

Consider $x+2y+z=4$, $\ 2x-y+3z=3$, $\ 3x+y+\lambda z=\mu$. With $\lambda=4$ and $\mu=9$, how many solutions are there?

Set $\lambda=4$ and $\mu=9$ (the marker sits on the red line of the map). The readouts show $\Delta=0$ but $\Delta_1=14$, $\Delta_2=-2$, $\Delta_3=-10$: since some $\Delta_i\ne0$, there is no solution (Theorem 3.17). The reason is visible in the equations: with $\lambda=4$ the left side of the third equation is the sum of the first two left sides, which must equal $4+3=7$ — and $\mu=9\ne7$. Move $\mu$ to $7$: all four determinants become $0$ and the lab reports infinitely many solutions. "Exactly two" is never possible for a linear system.
Interactive 2 — Consistency Map: one, none or infinitely many?

The system $x+2y+z=4$, $\ 2x-y+3z=3$, $\ 3x+y+\lambda z=\mu$ depends on two parameters. The map on the left colours every pair $(\lambda,\mu)$: green — exactly one solution, red — no solution, blue — infinitely many. Move the sliders (or press Play) and watch $\Delta$, $\Delta_1$, $\Delta_2$, $\Delta_3$: the solution $x=\Delta_1/\Delta$, … blows up as $\Delta\to0$.

29
$\Delta$—
$\Delta_1,\ \Delta_2,\ \Delta_3$—
solutions—
✏️ Example 6 — Hard example: parameters, and a homogeneous system
(a) For the system $x-y+2z=1$, $\ 2x+y-z=4$, $\ x+2y+\alpha z=\beta$, find the values of $\alpha$ and $\beta$ for which it has (i) a unique solution, (ii) no solution, (iii) infinitely many solutions, and describe the solutions in case (iii). Find $\beta-\alpha$ in case (iii). (b) For which $k$ does $x+ky+z=0$, $\ kx+y+z=0$, $\ x+y+kz=0$ have a non-trivial solution?
Find $\beta-\alpha$ when the system in (a) has infinitely many solutions:
$\Delta$ Along row $1$: $\Delta=\begin{vmatrix}1&-1&2\\2&1&-1\\1&2&\alpha\end{vmatrix}=1(\alpha+2)+1(2\alpha+1)+2(4-1)=3\alpha+9$. So $\Delta=0$ exactly when $\alpha=-3$.
(i) $\alpha\ne-3$ (any $\beta$): unique solution.
$\alpha=-3$ The left side of equation $3$, $x+2y-3z$, equals (equation $2$) $-$ (equation $1$): $(2x+y-z)-(x-y+2z)$. So the third equation repeats the first two exactly when $\beta=4-1=3$. Indeed $\Delta_3=\begin{vmatrix}1&-1&1\\2&1&4\\1&2&\beta\end{vmatrix}=3\beta-9$, non-zero for $\beta\ne3$.
(ii), (iii) No solution: $\alpha=-3$, $\beta\ne3$. Infinitely many: $\alpha=-3$, $\beta=3$. Then adding equations $1$ and $2$ gives $3x+z=5$, so $z=5-3x$, and equation $1$ gives $y=x+2z-1=9-5x$: the solutions are $(t,\ 9-5t,\ 5-3t)$ for every real $t$ — a line of points. And $\beta-\alpha=3-(-3)=6$.
(b) A non-trivial solution needs $\Delta=0$ (Theorem 3.17): $\begin{vmatrix}1&k&1\\k&1&1\\1&1&k\end{vmatrix}=(k-1)-k(k^2-1)+(k-1)=(k-1)(2-k^2-k)=-(k-1)^2(k+2)$. So $k=1$ or $k=-2$.
Check $k=1$: all three equations are $x+y+z=0$. $k=-2$: $(1,1,1)$ satisfies $x-2y+z=0$, $-2x+y+z=0$ and $x+y-2z=0$ ✓.
⚠️ JEE Main traps

1. Forgetting the transpose. $\operatorname{adj}A$ is the transpose of the cofactor matrix: its $(i,j)$ entry is $C_{ji}$. For $2\times2$: swap the diagonal, change the signs of the off-diagonal entries — do not swap them.

2. Powers in the adjoint chain. $|\operatorname{adj}A|=|A|^{n-1}$ (not $|A|^n$), $\operatorname{adj}(kA)=k^{n-1}\operatorname{adj}A$, $\operatorname{adj}(\operatorname{adj}A)=|A|^{n-2}A$. For $n=3$: $|\operatorname{adj}(\operatorname{adj}A)|=|A|^4$.

3. Reversal again. $(AB)^{-1}=B^{-1}A^{-1}$ and $\operatorname{adj}(AB)=\operatorname{adj}B\,\operatorname{adj}A$. And $(A+B)^{-1}\ne A^{-1}+B^{-1}$.

4. "All $\Delta_i=0$" does not prove infinitely many solutions. With $\Delta=0$, non-zero $\Delta_i$ means no solution; but $\Delta=\Delta_1=\Delta_2=\Delta_3=0$ can still be inconsistent ($x+y+z=1$, $2x+2y+2z=3$, $3x+3y+3z=4$). Check by combining the equations.

5. Homogeneous systems are always consistent. The question is only whether there is a non-trivial solution, and that happens exactly when $\Delta=0$ — the $\Delta_i$ are all $0$ anyway.

The system $x+2y=3$, $\ 2x+4y=k$ has infinitely many solutions when

Exercises

$I$ is the identity matrix. "Solve" means: decide whether the system has one, no or infinitely many solutions, and find them.

I
Adjoints and inverses.
  • 1 Find $\operatorname{adj}A$ for $A=\begin{bmatrix}4&-3\\2&1\end{bmatrix}$ and verify that $A\,\operatorname{adj}A=|A|\,I$.
  • 2 Find the inverse of $\begin{bmatrix}5&3\\3&2\end{bmatrix}$.
  • 3 Find $|A|$ and $\operatorname{adj}A$ for $A=\begin{bmatrix}1&0&2\\2&1&0\\0&3&1\end{bmatrix}$.
  • 4 Hence find $A^{-1}$ for the matrix of part 3, and give its $(1,2)$ entry as a decimal.
  • 5 Find every $k$ for which $\begin{bmatrix}k&2&2\\2&k&2\\2&2&k\end{bmatrix}$ has no inverse.
  • 6 For $A=\begin{bmatrix}2&3\\1&2\end{bmatrix}$, verify that $(A^{T})^{-1}=(A^{-1})^{T}$.
  • 7 Show that $A=\begin{bmatrix}2&5\\1&3\end{bmatrix}$ satisfies $A^2-5A+I=O$ and use it to find $A^{-1}$. Give the $(1,2)$ entry.
  • 8 $A$ and $B$ are invertible $3\times3$ matrices with $|A|=2$ and $|B|=5$. Find $|(AB)^{-1}|$ and $|\operatorname{adj}(A^{-1}B)|$.
  • 9 Prove that if $A$ is invertible and $A^2=A$, then $A=I$.
1 $\operatorname{adj}A=\begin{bmatrix}1&3\\-2&4\end{bmatrix}$; $A\,\operatorname{adj}A=\begin{bmatrix}4+6&12-12\\2-2&6+4\end{bmatrix}=10I$ and $|A|=4+6=10$ ✓.
2 $|A|=10-9=1$: the inverse is $\begin{bmatrix}2&-3\\-3&5\end{bmatrix}$.
3 $|A|=1(1-0)-0+2(6-0)=13$. Cofactors by rows: $1,-2,6$; $6,1,-3$; $-2,4,1$. Transposed: $\operatorname{adj}A=\begin{bmatrix}1&6&-2\\-2&1&4\\6&-3&1\end{bmatrix}$ (check: $A\,\operatorname{adj}A=13I$).
4 $A^{-1}=\tfrac1{13}\begin{bmatrix}1&6&-2\\-2&1&4\\6&-3&1\end{bmatrix}$; the $(1,2)$ entry is $\tfrac6{13}\approx0.4615$.
5 The determinant is $(k-2)^2(k+4)$ (put $k=2$: all rows equal; rows add up to $k+4$). No inverse for $k=2$ or $k=-4$.
6 $A^{-1}=\begin{bmatrix}2&-3\\-1&2\end{bmatrix}$ (as $|A|=1$), so $(A^{-1})^{T}=\begin{bmatrix}2&-1\\-3&2\end{bmatrix}$. $A^{T}=\begin{bmatrix}2&1\\3&2\end{bmatrix}$ has inverse $\begin{bmatrix}2&-1\\-3&2\end{bmatrix}$ ✓.
7 $A^2=\begin{bmatrix}9&25\\5&14\end{bmatrix}$ and $5A-I=\begin{bmatrix}9&25\\5&14\end{bmatrix}$ ✓. So $A(5I-A)=I$ and $A^{-1}=5I-A=\begin{bmatrix}3&-5\\-1&2\end{bmatrix}$; the $(1,2)$ entry is $-5$.
8 $|(AB)^{-1}|=\tfrac1{10}=0.1$. $|A^{-1}B|=\tfrac52$, and $|\operatorname{adj}M|=|M|^2$ for order $3$: $\big(\tfrac52\big)^2=6.25$.
9 Multiply $AA=A$ on the left by $A^{-1}$: $A=I$. $\blacksquare$ (So an idempotent matrix other than $I$ is always singular.)
II
Properties of the adjoint and the inverse.
  • 1 $A$ is $3\times3$ with $|A|=5$. Find $|\operatorname{adj}A|$, $|\operatorname{adj}(\operatorname{adj}A)|$, $|A^{-1}|$ and $|A\,\operatorname{adj}A|$.
  • 2 $A$ is $3\times3$ with $|A|=-2$. Find $|\operatorname{adj}(-A)|$ and $|\operatorname{adj}(2A)|$.
  • 3 Show that $\operatorname{adj}(\operatorname{adj}A)=A$ for every $3\times3$ matrix $A$ with $|A|=1$.
  • 4 Find $\operatorname{adj}A$ and $A^{-1}$ for $A=\begin{bmatrix}1&1&1\\0&1&1\\0&0&1\end{bmatrix}$.
  • 5 A $3\times3$ matrix $A$ has $\operatorname{adj}A=\begin{bmatrix}1&2&-1\\0&3&1\\2&1&0\end{bmatrix}$. Find the possible values of $|A|$.
  • 6 Prove that the adjoint of a symmetric matrix is symmetric.
  • 7 $A$ is $3\times3$ with $|A|=2$. Find $|3\operatorname{adj}(A^{-1})|$.
1 $5^2=25$; $5^4=625$; $\tfrac15$; $|5I|=125$.
2 $\operatorname{adj}(-A)=(-1)^2\operatorname{adj}A=\operatorname{adj}A$, so $|\operatorname{adj}(-A)|=|A|^2=4$. $\operatorname{adj}(2A)=4\operatorname{adj}A$, so $|\operatorname{adj}(2A)|=4^3\cdot4=256$.
3 $\operatorname{adj}(\operatorname{adj}A)=|A|^{n-2}A=1\cdot A$. $\blacksquare$
4 $|A|=1$. Cofactors by rows: $1,0,0$; $-1,1,0$; $0,-1,1$. So $\operatorname{adj}A=A^{-1}=\begin{bmatrix}1&-1&0\\0&1&-1\\0&0&1\end{bmatrix}$ (check: $AA^{-1}=I$).
5 $|\operatorname{adj}A|=1(0-1)-2(0-2)+(-1)(0-6)=9=|A|^2$: $|A|=3$ or $-3$.
6 $\operatorname{adj}(A^{T})=(\operatorname{adj}A)^{T}$ (Theorem 3.15). If $A^{T}=A$ this reads $\operatorname{adj}A=(\operatorname{adj}A)^{T}$. $\blacksquare$
7 $|\operatorname{adj}(A^{-1})|=|A^{-1}|^2=\tfrac14$, so $|3\operatorname{adj}(A^{-1})|=27\cdot\tfrac14=6.75$.
III
Solving systems.
  • 1 Solve $3x+2y=4$, $\ x-3y=5$ by the matrix method. Give $x$.
  • 2 Solve $x+y-z=1$, $\ 2x-y+z=5$, $\ x+2y+3z=10$ by the matrix method. Give $z$.
  • 3 Use Cramer's rule for $2x-y+z=3$, $\ x+3y-2z=1$, $\ 3x+y+z=8$. Give $\Delta$ and $y$.
  • 4 Show that $x+y+2z=3$, $\ 2x-y+z=1$, $\ 3x+3z=5$ is inconsistent.
  • 5 Show that $x+y+2z=3$, $\ 2x-y+z=1$, $\ 3x+3z=4$ has infinitely many solutions, and find them.
  • 6 Find $k$ for which $kx+2y=5$, $\ 3x+y=1$ has no solution.
  • 7 Find $k$ for which $x+2y+3z=0$, $\ 2x+ky+4z=0$, $\ x+y+z=0$ has a non-trivial solution.
  • 8 Asha buys $2$ kg of apples, $1$ kg of bananas and $3$ kg of oranges for $\text{₹}\,530$; Ravi buys $1$ kg, $2$ kg and $1$ kg for $\text{₹}\,300$; Meera buys $3$ kg, $1$ kg and $2$ kg for $\text{₹}\,570$. Find the price of each fruit per kg.
1 $|A|=-9-2=-11$, $A^{-1}=\tfrac{1}{-11}\begin{bmatrix}-3&-2\\-1&3\end{bmatrix}$, $X=\tfrac1{-11}\begin{bmatrix}-12-10\\-4+15\end{bmatrix}=\begin{bmatrix}2\\-1\end{bmatrix}$: $x=2$, $y=-1$.
2 $|A|=-15\ne0$; $X=A^{-1}B$ gives $x=2$, $y=1$, $z=2$ (check: $2+1-2=1$, $4-1+2=5$, $2+2+6=10$ ✓).
3 $\Delta=2(3+2)+1(1+6)+1(1-9)=9$; $\Delta_2=\begin{vmatrix}2&3&1\\1&1&-2\\3&8&1\end{vmatrix}=18$, so $y=2$. Similarly $x=\Delta_1/\Delta=1$, $z=\Delta_3/\Delta=3$.
4 $\Delta=1(-3-0)-1(6-3)+2(0+3)=0$ and $\Delta_1=\begin{vmatrix}3&1&2\\1&-1&1\\5&0&3\end{vmatrix}=3\ne0$: inconsistent. (The first two equations add to $3x+3z=4$, not $5$.)
5 Now the third equation is the sum of the first two, so drop it. With $z=t$: $x=\tfrac43-t$ from $3x+3z=4$, and $y=3-x-2z=\tfrac53-t$. Solutions $\big(\tfrac43-t,\ \tfrac53-t,\ t\big)$, $t\in\mathbb{R}$.
6 $\Delta=k-6=0$ gives $k=6$; then $6x+2y=5$ but $2(3x+y)=2$: parallel lines, no solution. So $k=6$.
7 $\Delta=1(k-4)-2(2-4)+3(2-k)=6-2k=0$: $k=3$.
8 $\begin{bmatrix}2&1&3\\1&2&1\\3&1&2\end{bmatrix}\begin{bmatrix}a\\b\\o\end{bmatrix}=\begin{bmatrix}530\\300\\570\end{bmatrix}$, $\Delta=-8\ne0$. Solving: apples $\text{₹}\,120$, bananas $\text{₹}\,50$, oranges $\text{₹}\,80$ per kg (check: $240+50+240=530$ ✓).
IV
Parameters and harder questions.
  • 1 For $x+y+z=2$, $\ 2x+3y+z=5$, $\ x+2y+\lambda z=\mu$, find when the system has a unique solution, no solution and infinitely many solutions. Give $\lambda+\mu$ in the last case.
  • 2 Discuss the system $x+ay=1$, $\ ax+y=1$ for all real $a$. For which $a$ is it inconsistent?
  • 3 Show that $2x+y-z=0$, $\ x-y+2z=0$, $\ 3x+z=0$ has non-trivial solutions, and find them all.
  • 4 Show that $x+y+z=1$, $\ 2x+2y+2z=3$, $\ 3x+3y+3z=4$ has $\Delta=\Delta_1=\Delta_2=\Delta_3=0$ but no solution.
  • 5 The system $x+2y-z=3$, $\ 3x-y+2z=1$, $\ 2x-3y+\alpha z=\beta$ has infinitely many solutions. Find $\alpha^2+\beta^2$.
  • 6 For $A=\begin{bmatrix}1&2&3\\2&3&4\\3&4&5\end{bmatrix}$, show that $|A|=0$ and use a column of $\operatorname{adj}A$ to find a non-trivial solution of $AX=O$.
1 $\Delta=1(3\lambda-2)-1(2\lambda-1)+1(4-3)=\lambda$. Unique: $\lambda\ne0$. For $\lambda=0$, the left side of equation $3$ is (eq. $2$) $-$ (eq. $1$), which equals $5-2=3$: infinitely many if $\lambda=0$, $\mu=3$; none if $\lambda=0$, $\mu\ne3$. So $\lambda+\mu=3$.
2 $\Delta=1-a^2$. For $a\ne\pm1$: unique solution $x=y=\tfrac1{1+a}$. For $a=1$: both equations are $x+y=1$ — infinitely many. For $a=-1$: $x-y=1$ and $-x+y=1$ — inconsistent. Answer $a=-1$.
3 $\Delta=2(-1-0)-1(1-6)+(-1)(0+3)=0$, so non-trivial solutions exist. Adding the first two equations: $3x+z=0$, so $z=-3x$; then $y=z-2x=-5x$. Solutions $(t,-5t,-3t)$.
4 Every $2\times2$ minor of $A$ is $0$ (all rows proportional), and each $\Delta_i$ has two equal columns — all are $0$. But twice the first equation gives $2x+2y+2z=2\ne3$: no solution.
5 $\Delta=21-7\alpha=0$ gives $\alpha=3$. Then the left side of equation $3$ is (eq. $2$) $-$ (eq. $1$): $(3x-y+2z)-(x+2y-z)=2x-3y+3z$, so $\beta=1-3=-2$. $\alpha^2+\beta^2=9+4=13$.
6 $|A|=1(15-16)-2(10-12)+3(8-9)=0$. The cofactors of row $1$ are $C_{11}=-1$, $C_{12}=2$, $C_{13}=-1$; they form column $1$ of $\operatorname{adj}A$, and $A\,\operatorname{adj}A=O$ gives $A\begin{bmatrix}-1\\2\\-1\end{bmatrix}=O$. So $(x,y,z)=(-1,2,-1)$ (check: $-1+4-3=0$, $-2+6-4=0$, $-3+8-5=0$ ✓), and every multiple of it.
🎯 Exam corner JEE Main · MCQJEE Main · Numerical

E1. JEE Main · MCQ $A$ is a $3\times3$ matrix with $|A|=4$. Then $|\operatorname{adj}(\operatorname{adj}A)|$ equals (A) $16$ (B) $64$ (C) $4096$ (D) $256$

Chain $|\operatorname{adj}A|=|A|^2=16$, and the adjoint of a $3\times3$ matrix with determinant $16$ has determinant $16^2$.
Answer (D) $256=4^4$.
⏱ Shortcut $|\operatorname{adj}(\operatorname{adj}A)|=|A|^{(n-1)^2}$. (A) is one step only; (C) $=4^6$ uses $|A|^{n}$ at each step.

E2. JEE Main · Numerical Let $A=\begin{bmatrix}1&0&2\\0&2&1\\1&1&k\end{bmatrix}$ with $|\operatorname{adj}A|=25$. Find the sum of all possible values of $k$. Give the answer to the nearest integer.

Determinant Along row $1$: $|A|=1(2k-1)-0+2(0-2)=2k-5$.
Adjoint $|\operatorname{adj}A|=|A|^2=(2k-5)^2=25$, so $2k-5=\pm5$: $k=5$ or $k=0$.
Answer $5+0=5$.
⏱ Shortcut The two values of $k$ are symmetric about $\tfrac52$ (where $|A|=0$), so their sum is $5$ without solving.

E3. JEE Main · MCQ The system $x-2y+z=1$, $\ 2x+y-3z=4$, $\ 3x-y+\lambda z=\mu$ has no solution if (A) $\lambda=-2$, $\mu=5$ (B) $\lambda\ne-2$ (C) $\lambda=-2$, $\mu\ne5$ (D) $\lambda=2$, $\mu\ne5$

$\Delta$ $\begin{vmatrix}1&-2&1\\2&1&-3\\3&-1&\lambda\end{vmatrix}=(\lambda-3)+2(2\lambda+9)+(-2-3)=5\lambda+10$, zero only for $\lambda=-2$.
Combine For $\lambda=-2$ the left side of equation $3$ is the sum of the first two: $(x-2y+z)+(2x+y-3z)=3x-y-2z$. So it needs $\mu=1+4=5$; for $\mu\ne5$ it contradicts them.
Answer (C). ((A) gives infinitely many solutions; (B) a unique one; (D) has $\Delta=20\ne0$.)
⏱ Shortcut Find the combination of rows that matches the coefficients ($R_3=R_1+R_2$) — it gives both critical values at once, without computing any $\Delta_i$.

E4. JEE Main · Numerical Let $A=\begin{bmatrix}2&1\\3&2\end{bmatrix}$ and suppose $A^{-1}=\alpha A+\beta I$. Find $\alpha+\beta$. Give the answer to the nearest integer.

Inverse $|A|=4-3=1$, so $A^{-1}=\begin{bmatrix}2&-1\\-3&2\end{bmatrix}$.
Compare $\alpha A+\beta I=\begin{bmatrix}2\alpha+\beta&\alpha\\3\alpha&2\alpha+\beta\end{bmatrix}$. The $(1,2)$ entries give $\alpha=-1$; then $-2+\beta=2$ gives $\beta=4$.
Answer $-1+4=3$.
⏱ Shortcut $A^2-(\operatorname{tr}A)A+|A|I=O$ gives $A^2-4A+I=O$, so $A^{-1}=4I-A$ at sight.

E5. JEE Main · MCQ $A$ and $B$ are invertible $3\times3$ matrices with $|A|=2$ and $|B|=3$. Then $\big|\operatorname{adj}(B^{-1}A^{-1})\big|$ equals (A) $\tfrac1{36}$ (B) $\tfrac16$ (C) $36$ (D) $\tfrac1{216}$

Inside $B^{-1}A^{-1}=(AB)^{-1}$, with determinant $\tfrac1{|A||B|}=\tfrac16$.
Adjoint $|\operatorname{adj}M|=|M|^2$ for order $3$: $\big(\tfrac16\big)^2$.
Answer (A) $\tfrac1{36}$.
⏱ Shortcut (B) forgets the adjoint, (D) uses $|M|^3$. The adjoint always contributes the power $n-1$.

E6. JEE Main · Numerical Find the sum of the squares of all real $k$ for which the system $kx-y+2z=0$, $\ x+y=0$, $\ 3x-3y+kz=0$ has a non-trivial solution. Give the answer to the nearest integer.

Condition Non-trivial solutions exist exactly when $\Delta=0$ (Theorem 3.17).
Expand Along row $2$ (it has a zero): $\Delta=\begin{vmatrix}k&-1&2\\1&1&0\\3&-3&k\end{vmatrix}=-1\cdot\begin{vmatrix}-1&2\\-3&k\end{vmatrix}+1\cdot\begin{vmatrix}k&2\\3&k\end{vmatrix}=-(-k+6)+(k^2-6)=k^2+k-12$.
Answer $k^2+k-12=(k-3)(k+4)=0$: $k=3$ or $-4$, and $9+16=25$.
Check $k=3$: from $x+y=0$, $y=-x$; the first equation gives $3x+x+2z=0$, $z=-2x$; the third: $3x+3x-6x=0$ ✓. So $(1,-1,-2)$ is a non-trivial solution.
🔬 Research–Teaching NexusResearch-tutored · optional, about 45 minutes

Research question. In 1929 the mathematician Lester Hill designed a cipher that encrypts pairs of letters by multiplying them by a matrix. How does it work, why must the key matrix be invertible "modulo 26", and how can a matrix inverse also break it?

Why it matters. Modern ciphers such as AES still contain a matrix-multiplication step that mixes letters together; understanding why a mixing matrix must be invertible — and why a purely linear cipher is weak — is the first lesson of cryptography.

What to do.

  1. Number the letters A $=0$, B $=1$, …, Z $=25$. Take the key $K=\begin{bmatrix}5&8\\3&7\end{bmatrix}$. Split a message into pairs, write each pair as a column $P$, and compute $C=KP$, replacing every entry by its remainder on division by $26$. Encrypt "MATH".
  2. Decryption needs a matrix $K'$ with $K'K\equiv I$ (mod $26$). Adapt Theorem 3.13: $|K|=11$, and $11\cdot19=209=8\cdot26+1$, so "$\tfrac1{11}$" is $19$ modulo $26$. Show that $K'=19\operatorname{adj}K$ (reduced mod $26$) works, and decrypt your ciphertext.
  3. Why would the key $\begin{bmatrix}2&1\\4&5\end{bmatrix}$ (determinant $6$) be a bad choice? Find two different pairs of letters that it encrypts to the same pair.
  4. Known-plaintext attack: suppose a spy learns that two plaintext pairs $P_1$, $P_2$ were encrypted to $C_1$, $C_2$. Explain how the matrix equation $K\,[P_1\ P_2]=[C_1\ C_2]$ reveals $K$, and try it on your own example.

Tools: Paper and a calculator, or a spreadsheet with MOD(); optionally a few lines of Python.

Hand in: Your encryption and decryption of a short message, the two colliding pairs for the bad key, and a paragraph explaining why invertibility (mod $26$) is essential and why the attack in step 4 works.

Going further. A key works exactly when $|K|$ shares no factor with $26$. How many of the $26^4$ possible $2\times2$ keys have a determinant that is even? What does that suggest about how many keys are usable?

Instructor note: $\operatorname{adj}K=\begin{bmatrix}7&-8\\-3&5\end{bmatrix}$, so $K'=19\operatorname{adj}K\equiv\begin{bmatrix}133&-152\\-57&95\end{bmatrix}\equiv\begin{bmatrix}3&4\\21&17\end{bmatrix}$ (mod $26$); check $K'K\equiv I$. A key with even determinant (like $6$) is not invertible mod $26$ and maps different plaintexts to the same ciphertext. Step 4 is the classic weakness of linear ciphers: if $[P_1\ P_2]$ is invertible mod $26$, then $K=[C_1\ C_2][P_1\ P_2]^{-1}$.

🧪 Self-check quiz

0/5 correct

Q1. The inverse of $\begin{bmatrix}2&1\\5&3\end{bmatrix}$ is

Q2. $A$ is a $3\times3$ matrix with $|A|=3$. Then $|\operatorname{adj}A|$ is

Q3. For invertible matrices $A$, $B$ of the same order, $(AB)^{-1}$ equals

Q4. For a system $AX=B$ with $|A|=0$ and $(\operatorname{adj}A)B\ne O$,

Q5. A homogeneous system $AX=O$ with $|A|\ne0$ has