3.1 Matrices and Matrix Algebra
A matrix is a rectangular array of numbers that can be added, scaled and multiplied — row by column. This section builds the algebra of matrices, the types of matrices JEE Main asks about, the transpose with its symmetric and skew-symmetric parts, and the traces and powers of square matrices.
A bakery has two outlets. On Saturday outlet P sold $40$ loaves, $25$ cakes and $60$ buns; outlet Q sold $35$ loaves, $30$ cakes and $50$ buns. A loaf costs $\text{₹}\,30$, a cake $\text{₹}\,120$ and a bun $\text{₹}\,10$. To find each outlet's takings you multiply every count by its price and add: P takes $40\cdot30+25\cdot120+60\cdot10=\text{₹}\,4800$ and Q takes $35\cdot30+30\cdot120+50\cdot10=\text{₹}\,5150$. Write the counts as a rectangular table with one row per outlet and the prices as a column, and this "multiply along a row, down a column, and add" becomes a single operation — the product of two matrices. The same operation rotates and stretches pictures on a screen, moves money between accounts in an economic model and tracks a population from one year to the next.
Matrices are the arithmetic of tables. In this section we define them and name the types that appear in JEE Main questions, learn to add, scale and multiply them — and see which rules of ordinary arithmetic survive and which do not ($AB$ need not equal $BA$, and $AB=O$ does not force $A=O$ or $B=O$). Then we meet the transpose, symmetric and skew-symmetric matrices, the trace, and the special matrices whose powers follow a pattern. JEE Main questions on this part of the unit test exactly these skills: a product or a power computed quickly, a property of the transpose used correctly, a count of symmetric or skew-symmetric matrices.
Matrices, Order and Types
A matrix is a rectangular array of numbers (or expressions) arranged in rows and columns. A matrix with $m$ rows and $n$ columns has order $m\times n$ (read "$m$ by $n$") and $mn$ entries (elements). The entry in row $i$ and column $j$ is written $a_{ij}$, and the whole matrix $A=[a_{ij}]_{m\times n}$:
$$A=\begin{bmatrix}a_{11}&a_{12}&\cdots&a_{1n}\\a_{21}&a_{22}&\cdots&a_{2n}\\\vdots&\vdots& &\vdots\\a_{m1}&a_{m2}&\cdots&a_{mn}\end{bmatrix}.$$Two matrices are equal, $A=B$, when they have the same order and every entry of $A$ equals the corresponding entry of $B$: $a_{ij}=b_{ij}$ for all $i$, $j$.
So a matrix equation between two $2\times2$ matrices is really four ordinary equations, one per position. The first index is always the row and the second the column: in $A=\begin{bmatrix}5&-1&0\\2&7&3\end{bmatrix}$, of order $2\times3$, we have $a_{12}=-1$ and $a_{21}=2$. A matrix is not a number — it has no single "value" — but a square matrix will have one special number attached to it, its determinant, in Section 3.2.
- A row matrix has one row ($1\times n$); a column matrix has one column ($m\times1$).
- The zero matrix $O$ has every entry $0$ (of any order).
- A square matrix has $m=n$; its entries $a_{11},a_{22},\dots,a_{nn}$ form the principal diagonal.
- A square matrix is diagonal if $a_{ij}=0$ whenever $i\ne j$; scalar if it is diagonal with all diagonal entries equal ($a_{ii}=k$); the identity matrix $I_n$ (or $I$) is the scalar matrix with $k=1$.
- A square matrix is upper triangular if $a_{ij}=0$ whenever $i\gt j$ (everything below the diagonal is $0$) and lower triangular if $a_{ij}=0$ whenever $i\lt j$.
The types are nested: identity $\Rightarrow$ scalar $\Rightarrow$ diagonal $\Rightarrow$ both upper and lower triangular. Conversely, a matrix that is both upper and lower triangular is diagonal. Notice that "diagonal", "scalar", "identity" and "triangular" are only defined for square matrices, while a zero matrix can have any order.
$$\underbrace{\begin{bmatrix}3&0&0\\0&-1&0\\0&0&5\end{bmatrix}}_{\text{diagonal}}\qquad\underbrace{\begin{bmatrix}2&0\\0&2\end{bmatrix}}_{\text{scalar }=2I_2}\qquad\underbrace{\begin{bmatrix}1&4&-2\\0&3&7\\0&0&6\end{bmatrix}}_{\text{upper triangular}}$$Which one of these statements is true?
Addition, Scalar Multiples and the Product
If $A=[a_{ij}]$ and $B=[b_{ij}]$ have the same order, their sum is $A+B=[a_{ij}+b_{ij}]$ — add entry by entry. For a number (scalar) $k$, the scalar multiple is $kA=[k\,a_{ij}]$ — multiply every entry by $k$. Then $-A=(-1)A$ and $A-B=A+(-B)$. Matrices of different orders cannot be added.
For matrices $A$, $B$, $C$ of the same order and scalars $k$, $l$:
$(A+B)+C=A+(B+C)$
$(k+l)A=kA+lA$
Proof. Each rule is the corresponding rule for real numbers applied in every position: for example the $(i,j)$ entry of $k(A+B)$ is $k(a_{ij}+b_{ij})=ka_{ij}+kb_{ij}$, which is the $(i,j)$ entry of $kA+kB$. $\blacksquare$ So matrix equations of the form $2X+A=B$ are solved exactly like number equations: $X=\tfrac12(B-A)$.
Multiplication is different, and it is the operation of the bakery: each outlet's takings come from a row of counts times the column of prices. We use the summation sign: $\sum_{k=1}^{n}a_kb_k$ means $a_1b_1+a_2b_2+\dots+a_nb_n$.
Let $A=[a_{ik}]$ be $m\times n$ and $B=[b_{kj}]$ be $n\times p$ — the number of columns of $A$ equals the number of rows of $B$. Then $AB$ is the $m\times p$ matrix whose $(i,j)$ entry is row $i$ of $A$ times column $j$ of $B$:
$$(AB)_{ij}=a_{i1}b_{1j}+a_{i2}b_{2j}+\dots+a_{in}b_{nj}=\sum_{k=1}^{n}a_{ik}b_{kj}.$$If the inner numbers differ, $AB$ is not defined. Memory aid: $(m\times\underline{n})(\underline{n}\times p)=m\times p$ — the inner numbers must match and the outer numbers give the order.
For the bakery, with $S$ the $2\times3$ sales matrix and $P$ the $3\times1$ price column,
$$SP=\begin{bmatrix}40&25&60\\35&30&50\end{bmatrix}\begin{bmatrix}30\\120\\10\end{bmatrix}=\begin{bmatrix}4800\\5150\end{bmatrix},$$a $(2\times3)(3\times1)=2\times1$ column of takings. The product $PS$ is not defined: $P$ has $1$ column and $S$ has $2$ rows.
Whenever the products and sums below are defined, and $k$ is a scalar:
$(A+B)C=AC+BC$
$I_mA=A=AI_n$ for $A$ of order $m\times n$
But, in general: (i) $AB$ may be defined while $BA$ is not; (ii) even for square matrices $AB\ne BA$; (iii) $AB=O$ is possible with $A\ne O$ and $B\ne O$; (iv) $AB=AC$ with $A\ne O$ does not imply $B=C$.
Proof of associativity. Let $A$, $B$, $C$ be $m\times n$, $n\times p$, $p\times q$. The $(i,j)$ entry of $(AB)C$ is $\sum_{l}\big(\sum_{k}a_{ik}b_{kl}\big)c_{lj}=\sum_k\sum_l a_{ik}b_{kl}c_{lj}$, and the $(i,j)$ entry of $A(BC)$ is $\sum_k a_{ik}\big(\sum_l b_{kl}c_{lj}\big)$ — the same double sum of all products $a_{ik}b_{kl}c_{lj}$, added in a different order. The distributive laws follow in the same way from $a(b+c)=ab+ac$. $\blacksquare$ Because of associativity we may write $ABC$ without brackets — but we may not change the order of the factors. Two square matrices with $AB=BA$ are said to commute; for them, and only for them, $(A+B)^2=A^2+2AB+B^2$, since in general
$$(A+B)^2=A^2+AB+BA+B^2,\qquad (A+B)(A-B)=A^2-AB+BA-B^2.$$$A$ is $2\times3$ and $B$ is $3\times2$. Computing $AB$ entry by entry takes a certain number of multiplications of numbers; so does computing $BA$. How many in each case?
$A$ is a $3\times2$ matrix and $B$ is a $2\times4$ matrix. Which statement is correct?
Transpose, Symmetric and Skew-symmetric Matrices
The transpose of an $m\times n$ matrix $A=[a_{ij}]$ is the $n\times m$ matrix $A^{T}$ (also written $A'$) obtained by turning rows into columns: $(A^{T})_{ij}=a_{ji}$. For example $\begin{bmatrix}1&2&3\\4&5&6\end{bmatrix}^{T}=\begin{bmatrix}1&4\\2&5\\3&6\end{bmatrix}$.
Whenever the operations are defined:
$$(A^{T})^{T}=A,\qquad (A\pm B)^{T}=A^{T}\pm B^{T},\qquad (kA)^{T}=kA^{T},$$ $$(AB)^{T}=B^{T}A^{T}\quad\text{(the order reverses)},\qquad (ABC)^{T}=C^{T}B^{T}A^{T}.$$Proof of the reversal law. Let $A$ be $m\times n$ and $B$ be $n\times p$. First the orders: $(AB)^{T}$ is $p\times m$, and $B^{T}A^{T}$ is $(p\times n)(n\times m)=p\times m$ — while $A^{T}B^{T}$ need not even be defined. Now the entries:
$$\big((AB)^{T}\big)_{ij}=(AB)_{ji}=\sum_{k}a_{jk}b_{ki}=\sum_k (B^{T})_{ik}(A^{T})_{kj}=(B^{T}A^{T})_{ij}.$$For three factors, $(ABC)^{T}=\big((AB)C\big)^{T}=C^{T}(AB)^{T}=C^{T}B^{T}A^{T}$. $\blacksquare$ Think of putting on socks and then shoes: to undo it you take off the shoes first. The same reversal will appear for inverses in Section 3.3.
A square matrix $A$ is symmetric if $A^{T}=A$, i.e. $a_{ij}=a_{ji}$ for all $i$, $j$ (it is a mirror image of itself in the principal diagonal), and skew-symmetric if $A^{T}=-A$, i.e. $a_{ij}=-a_{ji}$ for all $i$, $j$.
- Every diagonal entry of a skew-symmetric matrix is $0$.
- Every square matrix $A$ can be written in exactly one way as a symmetric matrix plus a skew-symmetric matrix: $$A=\underbrace{\tfrac12\big(A+A^{T}\big)}_{\text{symmetric}}+\underbrace{\tfrac12\big(A-A^{T}\big)}_{\text{skew-symmetric}}.$$
- For every matrix $A$ (any order), $AA^{T}$ and $A^{T}A$ are symmetric.
- If $A$ and $B$ are symmetric of the same order, then $AB+BA$ is symmetric, $AB-BA$ is skew-symmetric, and $AB$ is symmetric if and only if $AB=BA$.
- If $A$ is symmetric (skew-symmetric), so is $P^{T}AP$ for every square $P$ of the same order.
Proofs. (1) $a_{ii}=-a_{ii}$ gives $a_{ii}=0$. (2) $\big(A+A^{T}\big)^{T}=A^{T}+A$ and $\big(A-A^{T}\big)^{T}=A^{T}-A=-\big(A-A^{T}\big)$; the two halves add up to $A$. For uniqueness, suppose $A=S+K$ with $S$ symmetric and $K$ skew. Transposing, $A^{T}=S-K$; adding and subtracting the two equations gives $S=\tfrac12(A+A^{T})$ and $K=\tfrac12(A-A^{T})$ — there was no other choice. (3) $(AA^{T})^{T}=(A^{T})^{T}A^{T}=AA^{T}$ by the reversal law. (4) $(AB)^{T}=B^{T}A^{T}=BA$, so $(AB+BA)^{T}=BA+AB$ and $(AB-BA)^{T}=BA-AB$; and $AB$ is symmetric exactly when $AB=(AB)^{T}=BA$. (5) $(P^{T}AP)^{T}=P^{T}A^{T}P$, which is $\pm P^{T}AP$ when $A^{T}=\pm A$. $\blacksquare$
$A$ and $B$ are symmetric matrices of the same order. Then $AB-BA$ is
Trace, Special Square Matrices and Powers
For a square matrix $A$ of order $n$, the trace is the sum of its diagonal entries, $\operatorname{tr}A=a_{11}+a_{22}+\dots+a_{nn}$. Powers are repeated products: $A^0=I$, $A^1=A$, $A^{k+1}=A^kA$. A square matrix $A$ is
- idempotent if $A^2=A$;
- nilpotent if $A^k=O$ for some positive integer $k$ (the least such $k$ is its index);
- involutory if $A^2=I$;
- orthogonal if $AA^{T}=A^{T}A=I$.
For square matrices $A$, $B$ of order $n$ and a scalar $k$:
$$\operatorname{tr}(A+B)=\operatorname{tr}A+\operatorname{tr}B,\quad \operatorname{tr}(kA)=k\operatorname{tr}A,\quad \operatorname{tr}A^{T}=\operatorname{tr}A,$$ $$\operatorname{tr}(AB)=\operatorname{tr}(BA),\qquad \operatorname{tr}\big(AA^{T}\big)=\sum_{i,j}a_{ij}^2\ \text{(the sum of the squares of all entries)}.$$The last two also hold for rectangular $A$ ($m\times n$) and $B$ ($n\times m$).
Proof. The first three are immediate. For the product, $\operatorname{tr}(AB)=\sum_i(AB)_{ii}=\sum_i\sum_k a_{ik}b_{ki}$, and $\operatorname{tr}(BA)=\sum_k\sum_i b_{ki}a_{ik}$ — the same numbers added in a different order. Finally $(AA^{T})_{ii}=\sum_j a_{ij}a_{ij}=\sum_j a_{ij}^2$ (row $i$ times itself), and adding over $i$ gives every entry squared once. $\blacksquare$ A neat consequence: there are no square matrices with $AB-BA=I$, because the left side has trace $0$ and the right side has trace $n$.
For a square matrix $A$ and non-negative integers $p$, $q$: $A^pA^q=A^{p+q}$ and $(A^p)^q=A^{pq}$. If $AB=BA$, then $(AB)^n=A^nB^n$ and the binomial expansion holds:
$$(A+B)^n=A^n+\tbinom n1A^{n-1}B+\tbinom n2A^{n-2}B^2+\dots+B^n,\qquad \tbinom n2=\tfrac{n(n-1)}{2}.$$In particular, if $N^2=O$ then $(I+N)^n=I+nN$; if $N^3=O$ then $(I+N)^n=I+nN+\tfrac{n(n-1)}{2}N^2$.
Why. Expanding $(A+B)^n$ gives a sum of products of $n$ factors, each $A$ or $B$. When $AB=BA$ the factors in each product can be shuffled into the form $A^{n-r}B^r$, and the number of products that shuffle to $A^{n-r}B^r$ is the number $\tbinom nr$ of ways of choosing which $r$ of the $n$ brackets supply a $B$ — exactly as for numbers (Chapter 5 studies these coefficients). $I$ commutes with every matrix, so the theorem always applies to $I+N$; and when $N^2=O$ every term from $N^2$ onwards vanishes. Without $AB=BA$ the expansion is false: already $(A+B)^2=A^2+AB+BA+B^2$. $\blacksquare$
$N=\begin{bmatrix}2&-4\\1&-2\end{bmatrix}$ has no zero entry. What is $N^2$?
1. Order matters. $AB\ne BA$ in general, so $(A+B)^2\ne A^2+2AB+B^2$ and $(A+B)(A-B)\ne A^2-B^2$ unless $A$ and $B$ commute. Use the binomial theorem only for commuting matrices — $I$ and $kI$ commute with everything, which is why $(I+N)^n$ and $(2I+N)^n$ are safe.
2. No cancelling, no zero-product rule. $AB=O$ does not give $A=O$ or $B=O$, and $AB=AC$ does not give $B=C$ (Example 2). Cancelling is allowed only when $A$ has an inverse (Section 3.3).
3. The transpose reverses products. $(AB)^{T}=B^{T}A^{T}$, never $A^{T}B^{T}$.
4. $A^2$ is not "square every entry". $\begin{bmatrix}2&-4\\1&-2\end{bmatrix}^2=O$. Only for diagonal matrices do powers act entry by entry.
5. Counting symmetric and skew-symmetric matrices. Free entries: $\tfrac{n(n+1)}2$ for symmetric, $\tfrac{n(n-1)}2$ for skew-symmetric (diagonal forced to $0$). For skew-symmetric matrices the allowed set must contain $0$ and the negatives of its members: with entries from $\{0,1,2\}$, the only skew-symmetric matrix is $O$.
6. $kA$ scales every entry. So $\operatorname{tr}(kA)=k\operatorname{tr}A$ — but beware Section 3.2, where the determinant of $kA$ is $k^n|A|$.
$A$ is a square matrix with $A^2=A$. Then $(I-A)^2$ equals
Exercises
All matrices have real entries. $I$ is the identity and $O$ the zero matrix of the appropriate order.
- 1 Construct the $3\times2$ matrix $A=[a_{ij}]$ with $a_{ij}=i+2j$.
- 2 How many different orders can a matrix with $24$ entries have?
- 3 Find $a$, $b$, $c$, $d$ if $\begin{bmatrix}a-b&2a+c\\2a-b&3c+d\end{bmatrix}=\begin{bmatrix}-1&5\\0&13\end{bmatrix}$.
- 4 Name every type from Definition 3.2 that fits: (a) $\begin{bmatrix}3&0&0\\0&3&0\\0&0&3\end{bmatrix}$ (b) $\begin{bmatrix}0&0\\0&0\end{bmatrix}$ (c) $\begin{bmatrix}1&2&3\end{bmatrix}$ (d) $\begin{bmatrix}1&0\\4&5\end{bmatrix}$.
- 5 How many $3\times3$ diagonal matrices have their diagonal entries from $\{1,2,3,4,5\}$?
- 6 How many $3\times3$ upper triangular matrices have every entry from $\{0,1\}$?
- 7 True or false: (a) every identity matrix is a scalar matrix; (b) every scalar matrix is diagonal; (c) a matrix that is both upper and lower triangular is diagonal; (d) a square matrix whose diagonal entries are all $0$ is the zero matrix.
- 8 Find $x$ and $y$ if $\begin{bmatrix}x^2&y\\3&x+y\end{bmatrix}=\begin{bmatrix}4&x\\3&-4\end{bmatrix}$.
- 1 Find $2A-3B+C$.
- 2 Find the matrix $X$ with $2X+A=B$.
- 3 Find $AB$ and $BA$. Do $A$ and $B$ commute?
- 4 Verify that $A(B+C)=AB+AC$.
- 5 Show that $A^2-A+6I=O$.
- 6 Find $\begin{bmatrix}1&2&3\end{bmatrix}\begin{bmatrix}4\\5\\6\end{bmatrix}$ and $\begin{bmatrix}4\\5\\6\end{bmatrix}\begin{bmatrix}1&2&3\end{bmatrix}$.
- 7 Find all $x$ with $\begin{bmatrix}x&1\end{bmatrix}\begin{bmatrix}1&2\\3&0\end{bmatrix}\begin{bmatrix}x\\-2\end{bmatrix}=\begin{bmatrix}0\end{bmatrix}$.
- 8 For $M=\begin{bmatrix}1&-1\\-1&1\end{bmatrix}$, show that $M^2=2M$ and find $k$ with $M^5=kM$.
- 9 School P buys $120$ notebooks, $200$ pens and $30$ bags; school Q buys $80$ notebooks, $150$ pens and $45$ bags. A notebook costs $\text{₹}\,40$, a pen $\text{₹}\,10$ and a bag $\text{₹}\,350$. Write the bills as a matrix product and find each school's bill.
- 1 For $A=\begin{bmatrix}1&2&-3\\0&4&5\end{bmatrix}$ find $AA^{T}$ and $A^{T}A$, check that both are symmetric, and find $\operatorname{tr}(AA^{T})$.
- 2 Write $\begin{bmatrix}3&-1\\5&2\end{bmatrix}$ as the sum of a symmetric and a skew-symmetric matrix.
- 3 $\begin{bmatrix}0&x&3\\-2&0&y\\z&5&0\end{bmatrix}$ is skew-symmetric. Find $x+y+z$.
- 4 $\begin{bmatrix}2&a&3\\4&5&b\\c&-1&7\end{bmatrix}$ is symmetric. Find $a$, $b$, $c$.
- 5 Prove that for every square matrix $A$, $A+A^{T}$ is symmetric and $A-A^{T}$ is skew-symmetric.
- 6 Prove that if $A$ is skew-symmetric, then $A^3$ is skew-symmetric and $A^4$ is symmetric.
- 7 Prove that if $A$ is symmetric, then $B^{T}AB$ is symmetric for every square $B$ of the same order.
- 8 How many $3\times3$ matrices with every entry from $\{-1,0,1\}$ are (a) symmetric, (b) skew-symmetric?
- 9 $A$ is the $3\times3$ skew-symmetric matrix with $a_{12}=2$, $a_{13}=-1$, $a_{23}=4$. Find $\operatorname{tr}(AA^{T})$.
- 1 For $A=\begin{bmatrix}1&0\\2&1\end{bmatrix}$ find $A^n$, and the $n$ for which $A^n=\begin{bmatrix}1&0\\50&1\end{bmatrix}$.
- 2 Show that $A=\begin{bmatrix}3&-6\\1&-2\end{bmatrix}$ is idempotent and find $(I+A)^5$. Give its $(1,1)$ entry.
- 3 Let $N=\begin{bmatrix}0&2&1\\0&0&3\\0&0&0\end{bmatrix}$. Show that $N$ is nilpotent of index $3$ and find the $(1,3)$ entry of $(I+N)^4$.
- 4 Show that $A=\begin{bmatrix}4&3\\-5&-4\end{bmatrix}$ is involutory and find $A^{2027}$.
- 5 For $R=\begin{bmatrix}\cos\theta&-\sin\theta\\\sin\theta&\cos\theta\end{bmatrix}$ show that $R^2$ is the same matrix with $2\theta$ in place of $\theta$. Assuming $R^n$ has $n\theta$ in place of $\theta$, find the least positive $n$ with $R^n=I$ when $\theta=40^\circ$.
- 6 Prove that there are no $2\times2$ matrices $A$, $B$ with $AB-BA=I$.
- 7 For $J=\begin{bmatrix}1&1\\1&1\end{bmatrix}$, find the sum of all the entries of $J+J^2+J^3+\dots+J^6$.
- 8 How many $2\times2$ matrices with every entry from $\{0,1\}$ satisfy $A^2=O$?
E1. JEE Main · MCQ If $A=\begin{bmatrix}2&-1\\3&-2\end{bmatrix}$, then $A^{51}$ equals (A) $I$ (B) $-A$ (C) $A$ (D) $2^{25}A$
E2. JEE Main · Numerical Let $A=\begin{bmatrix}1&1&1\\0&1&1\\0&0&1\end{bmatrix}$. For a positive integer $n$, the $(1,3)$ entry of $A^n$ is $55$. Find $n$. Give the answer to the nearest integer.
E3. JEE Main · MCQ $A$ is a symmetric and $B$ a skew-symmetric matrix, both of order $3$. Which of the following is skew-symmetric? (A) $AB+BA$ (B) $AB-BA$ (C) $A^2+B^2$ (D) $BAB$
E4. JEE Main · Numerical Find the number of $3\times3$ matrices $A$, with every entry from $\{-1,0,1\}$, for which $\operatorname{tr}\big(AA^{T}\big)=2$. Give the answer to the nearest integer.
E5. JEE Main · MCQ $A$ and $B$ are square matrices of the same order with $AB=A$ and $BA=B$. Then $A^2+B^2$ equals (A) $O$ (B) $I$ (C) $AB$ (D) $A+B$
E6. JEE Main · Numerical Let $A=\begin{bmatrix}3&-1\\2&1\end{bmatrix}$ and suppose $A^2=\alpha A+\beta I$ for real numbers $\alpha$, $\beta$. Find $\alpha^2+\beta^2$. Give the answer to the nearest integer.
Research question. Wildlife managers protect endangered species with limited money. For an animal whose life has three stages — young, juvenile, adult — is it better to protect the young or the adults? A matrix answers this.
Why it matters. Population ecologists describe a stage-structured population by a column $X_t$ (the numbers in each stage in year $t$) and a Leslie matrix $L$ of birth and survival rates, so that $X_{t+1}=LX_t$ and $X_t=L^tX_0$. Studies of sea turtles, whales and forest trees used exactly this model to show that protecting the stage with the highest "leverage" matters far more than protecting the most visible one.
What to do.
- Take $L=\begin{bmatrix}0&4&3\\0.5&0&0\\0&0.25&0\end{bmatrix}$: each juvenile produces $4$ young a year and each adult $3$; half the young survive to become juveniles; a quarter of the juveniles survive to become adults. Start from $X_0=\begin{bmatrix}100\\40\\20\end{bmatrix}$.
- In a spreadsheet compute $X_1=LX_0$, $X_2=LX_1$, …, $X_{12}$ (one matrix product per year). Record the total population and the ratio total$(t+1)$/total$(t)$.
- The ratio settles down. Estimate its limit $\lambda$ and the long-run proportions of young, juveniles and adults.
- Now spend a "conservation budget": raise one survival rate by $0.1$ (either $0.5\to0.6$ or $0.25\to0.35$) and repeat. Which change raises the long-run growth rate more?
Tools: A spreadsheet (MMULT does a matrix product) or a few lines of Python.
Hand in: Your table of $X_t$, the limiting ratio, the stage proportions, and a short recommendation to a wildlife agency based on your two experiments.
Going further. If you replace $L$ by $kL$, how do the populations change? Show that the long-run ratio $\lambda$ satisfies $\lambda^3=0.5\cdot4\,\lambda+0.5\cdot0.25\cdot3$, and check your estimate against it.
🧪 Self-check quiz
Q1. $A$ is a $2\times3$ matrix and $B$ is a $3\times4$ matrix. The order of $AB$ is
Q2. For square matrices $A$, $B$ of the same order, $(A+B)^2=A^2+2AB+B^2$ holds exactly when
Q3. The number of $2\times2$ skew-symmetric matrices with every entry from $\{-2,-1,0,1,2\}$ is
Q4. For matrices $A$, $B$, $C$ for which $ABC$ is defined, $(ABC)^{T}$ equals
Q5. If $A=\begin{bmatrix}2&0&0\\0&-1&0\\0&0&3\end{bmatrix}$, then $A^3$ is