Skip to content
Skip to page content
soylai.com

Matrices — chapter notes

6 sections 4 min readBeta

1. Order, entries and types

A matrix with mm rows and nn columns has order m×nm \times n; aija_{ij} is the entry in row ii, column jj. A matrix with mnmn entries can be arranged in as many orders as mnmn has divisors.

  • Row / column matrix: one row / one column. Zero matrix OO: every entry 00.
  • Square (m=nm = n): diagonal (off-diagonal entries 00), scalar (diagonal, all diagonal entries equal, kIkI), identity InI_n (scalar with k=1k = 1), upper / lower triangular (zero below / above the diagonal).

ISC 2027 uses matrices of order at most 33.

Every example is checked against its condition by the build.
TypeConditionExample
Rowone row[4−17]\begin{bmatrix} 4 & -1 & 7 \end{bmatrix}
Columnone column[29]\begin{bmatrix} 2 \\ 9 \end{bmatrix}
Zeroevery entry 00[0000]\begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}
Diagonalsquare; aij=0a_{ij} = 0 for i≠ji \ne j[600−2]\begin{bmatrix} 6 & 0 \\ 0 & -2 \end{bmatrix}
Scalardiagonal, equal diagonal entries[3003]\begin{bmatrix} 3 & 0 \\ 0 & 3 \end{bmatrix}
Identityscalar with diagonal entries 11[100010001]\begin{bmatrix} 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1 \end{bmatrix}
Upper triangularsquare; aij=0a_{ij} = 0 for i>ji > j[15203−4006]\begin{bmatrix} 1 & 5 & 2 \\ 0 & 3 & -4 \\ 0 & 0 & 6 \end{bmatrix}
Lower triangularsquare; aij=0a_{ij} = 0 for i<ji < j[2071]\begin{bmatrix} 2 & 0 \\ 7 & 1 \end{bmatrix}
Choose the most specific name the question asks for.
If a matrix is…then it is also…
identityscalar and diagonal
scalardiagonal
diagonalupper and lower triangular
square zerodiagonal, scalar and both triangular

Formulas

  • Notation
    A=[aij]m×nA = [a_{ij}]_{m \times n}

Key terms

Order

Rows ×\times columns.

Scalar matrix

A diagonal matrix kIkI with all diagonal entries equal.

2. Equality and transpose

A=BA = B when they have the same order and aij=bija_{ij} = b_{ij} for every i,ji, j: one matrix equation gives several ordinary equations.

The transpose A′A' (order n×mn \times m) has (A′)ij=aji(A')_{ij} = a_{ji}.

  • (A′)′=A(A')' = A,   (A+B)′=A′+B′\;(A + B)' = A' + B',   (kA)′=kA′\;(kA)' = kA'
  • (AB)′=B′A′(AB)' = B'A' — the order reverses.
Each law is checked by the build on sample matrices.
LawIn words
(A′)′=A(A')' = Atransposing twice changes nothing
(A+B)′=A′+B′(A + B)' = A' + B'transpose each term
(kA)′=kA′(kA)' = kA'scalars pass through
(AB)′=B′A′(AB)' = B'A'reverse the order
Row $i$ of $A$ becomes column $i$ of $A'$.
AAA′A'Orders
[14−3205]\begin{bmatrix} 1 & 4 & -3 \\ 2 & 0 & 5 \end{bmatrix}[1240−35]\begin{bmatrix} 1 & 2 \\ 4 & 0 \\ -3 & 5 \end{bmatrix}2×3  →  3×22 \times 3 \;\to\; 3 \times 2

Formulas

  • Reversal law
    (AB)′=B′A′(AB)' = B'A'

Key terms

Transpose

Rows of AA written as columns, written A′A'.

3. Symmetric and skew-symmetric matrices

  • Symmetric: A′=AA' = A (aij=ajia_{ij} = a_{ji}).
  • Skew-symmetric: A′=−AA' = -A (aij=−ajia_{ij} = -a_{ji}; every diagonal entry is 00).

For any square AA: A+A′A + A' is symmetric and A−A′A - A' is skew-symmetric, since (A+A′)′=A′+A(A + A')' = A' + A and (A−A′)′=−(A−A′)(A - A')' = -(A - A'). Hence

A=12(A+A′)+12(A−A′).A = \tfrac12 (A + A') + \tfrac12 (A - A').

This split is unique. The only matrix that is both symmetric and skew-symmetric is OO.

Look across the leading diagonal.
TypeConditionExample
SymmetricA′=AA' = A, so aij=ajia_{ij} = a_{ji}[14−2407−273]\begin{bmatrix} 1 & 4 & -2 \\ 4 & 0 & 7 \\ -2 & 7 & 3 \end{bmatrix}
Skew-symmetricA′=−AA' = -A, so aij=−ajia_{ij} = -a_{ji} and aii=0a_{ii} = 0[05−1−5021−20]\begin{bmatrix} 0 & 5 & -1 \\ -5 & 0 & 2 \\ 1 & -2 & 0 \end{bmatrix}
$P + Q = A$, with $P$ symmetric and $Q$ skew-symmetric.
StepMatrix
A′A'[5−134]\begin{bmatrix} 5 & -1 \\ 3 & 4 \end{bmatrix}
A+A′A + A'[10228]\begin{bmatrix} 10 & 2 \\ 2 & 8 \end{bmatrix}
P=12(A+A′)P = \tfrac12 (A + A')[5114]\begin{bmatrix} 5 & 1 \\ 1 & 4 \end{bmatrix}
A−A′A - A'[04−40]\begin{bmatrix} 0 & 4 \\ -4 & 0 \end{bmatrix}
Q=12(A−A′)Q = \tfrac12 (A - A')[02−20]\begin{bmatrix} 0 & 2 \\ -2 & 0 \end{bmatrix}

Formulas

  • Unique split
    A=12(A+A′)+12(A−A′)A = \tfrac12 (A + A') + \tfrac12 (A - A')

Key terms

Symmetric matrix

A′=AA' = A.

Skew-symmetric matrix

A′=−AA' = -A; zero diagonal.

4. Addition, scalar multiplication and multiplication

  • A±BA \pm B (same order): add or subtract corresponding entries; A+B=B+AA + B = B + A.
  • kAkA: multiply every entry by kk.
  • ABAB is defined when the number of columns of AA equals the number of rows of BB; if AA is m×nm \times n and BB is n×pn \times p, then ABAB is m×pm \times p and (AB)ij(AB)_{ij} = row ii of AA times column jj of BB.
  • Multiplication is associative and distributes over addition; AI=IA=AAI = IA = A.
  • In a matrix polynomial, a constant cc becomes cIcI.
$AB = \begin{bmatrix} 2 & 10 \\ -4 & 9 \end{bmatrix}$, a $2 \times 2$ matrix.
Entry of ABABRow of AA times column of BBValue
(1,1)(1, 1)2(1)+1(0)+0(5)2(1) + 1(0) + 0(5)22
(1,2)(1, 2)2(4)+1(2)+0(1)2(4) + 1(2) + 0(1)1010
(2,1)(2, 1)1(1)+3(0)+(−1)(5)1(1) + 3(0) + (-1)(5)−4-4
(2,2)(2, 2)1(4)+3(2)+(−1)(1)1(4) + 3(2) + (-1)(1)99
Inner numbers must match; outer numbers give the order.
AABBABABBABA
2×32 \times 33×23 \times 22×22 \times 23×33 \times 3
2×32 \times 33×43 \times 42×42 \times 4not defined
1×31 \times 33×13 \times 11×11 \times 13×33 \times 3

Formulas

  • Row times column
    (AB)ij=∑kaikbkj(AB)_{ij} = \sum_k a_{ik} b_{kj}

Key terms

Compatible for multiplication

Columns of the first = rows of the second.

5. Non-commutativity and zero products

  • In general AB≠BAAB \ne BA (one may not even be defined, or they may have different orders).
  • So (A+B)2=A2+AB+BA+B2(A + B)^2 = A^2 + AB + BA + B^2 and (A+B)(A−B)=A2−AB+BA−B2(A + B)(A - B) = A^2 - AB + BA - B^2.
  • AB=OAB = O is possible with A≠OA \ne O and B≠OB \ne O; so AB=ACAB = AC does not give B=CB = C unless AA is invertible.
$A = \begin{bmatrix} 1 & 3 \\ 0 & 2 \end{bmatrix}$, $B = \begin{bmatrix} 2 & 0 \\ 1 & 1 \end{bmatrix}$: $AB \ne BA$.
Product
ABAB[5322]\begin{bmatrix} 5 & 3 \\ 2 & 2 \end{bmatrix}
BABA[2615]\begin{bmatrix} 2 & 6 \\ 1 & 5 \end{bmatrix}
Unlike numbers, $AB = O$ does not force $A = O$ or $B = O$.
AABBABAB
[3−6−12]\begin{bmatrix} 3 & -6 \\ -1 & 2 \end{bmatrix}[2412]\begin{bmatrix} 2 & 4 \\ 1 & 2 \end{bmatrix}[0000]\begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}

Formulas

  • Expanding with care
    (A+B)2=A2+AB+BA+B2(A + B)^2 = A^2 + AB + BA + B^2

Key terms

Non-commutative

ABAB and BABA need not be equal.

6. Singular, non-singular and invertible matrices

  • A 2×22 \times 2 matrix [abcd]\begin{bmatrix} a & b \\ c & d \end{bmatrix} is singular if ad−bc=0ad - bc = 0 (one row a multiple of the other) and non-singular otherwise. (The general determinant comes in the next chapter.)
  • A square matrix AA is invertible if AB=BA=IAB = BA = I for some BB; then B=A−1B = A^{-1}. Only square matrices can be invertible; singular matrices are not.
  • Uniqueness: if BB and CC are inverses, B=BI=B(AC)=(BA)C=IC=CB = BI = B(AC) = (BA)C = IC = C.
  • To verify an inverse, check both AB=IAB = I and BA=IBA = I. To find one: solve AB=IAB = I entry by entry, or use a matrix equation such as A2−3A+2I=O⇒A−1=12(3I−A)A^2 - 3A + 2I = O \Rightarrow A^{-1} = \tfrac12 (3I - A).
A zero value means singular: one row is a multiple of the other.
Matrixad−bcad - bcType
[4263]\begin{bmatrix} 4 & 2 \\ 6 & 3 \end{bmatrix}00singular
[4236]\begin{bmatrix} 4 & 2 \\ 3 & 6 \end{bmatrix}1818non-singular
[0110]\begin{bmatrix} 0 & 1 \\ 1 & 0 \end{bmatrix}−1-1non-singular
$A^{-1} = \begin{bmatrix} 2 & -1 \\ -5 & 3 \end{bmatrix}$; check $BA = I$ too.
Column of BBEquations from AB=IAB = ISolution
first: p,rp, r3p+r=1,  5p+2r=03p + r = 1,\; 5p + 2r = 0p=2,  r=−5p = 2,\; r = -5
second: q,sq, s3q+s=0,  5q+2s=13q + s = 0,\; 5q + 2s = 1q=−1,  s=3q = -1,\; s = 3
A matrix equation can hand you the inverse.
StepResult
A2A^2[73−6−2]\begin{bmatrix} 7 & 3 \\ -6 & -2 \end{bmatrix}
A2−3A+2IA^2 - 3A + 2I[0000]\begin{bmatrix} 0 & 0 \\ 0 & 0 \end{bmatrix}
A(3I−A)A(3I - A)[2002]\begin{bmatrix} 2 & 0 \\ 0 & 2 \end{bmatrix}
A−1=12(3I−A)A^{-1} = \tfrac12 (3I - A)12[0−123]\frac{1}{2}\begin{bmatrix} 0 & -1 \\ 2 & 3 \end{bmatrix}

Formulas

  • Inverse
    AA−1=A−1A=IAA^{-1} = A^{-1}A = I

Key terms

Invertible matrix

A square matrix with an inverse.

Singular (2 × 2)

ad−bc=0ad - bc = 0.

Exam tips

How ISC marks are awarded

  • Construct or equate (2 marks): the entries or equations, then the result.
  • Products (2–3 marks): each entry carries method; state the order first.
  • Symmetric + skew split (3–5 marks): A′A', PP, QQ, and the check P+Q=AP + Q = A.
  • Inverse (3–5 marks): the method (equations from AB=IAB = I or a matrix equation), A−1A^{-1}, and a check by multiplying back.
  • Section D (5 marks): set in parts such as 2 + 3 or 3 + 2; label each part.

Common mistakes

  • Writing the order as columns ×\times rows.
  • Multiplying corresponding entries instead of rows by columns.
  • Assuming AB=BAAB = BA, or expanding (A+B)2(A + B)^2 as A2+2AB+B2A^2 + 2AB + B^2.
  • Writing a constant cc instead of cIcI in a matrix equation.
  • Cancelling AA from AB=ACAB = AC when AA is not invertible.
  • Checking only AB=IAB = I when asked to verify an inverse.