Matrices — Operations and Determinants

A matrix is a rectangular array of numbers; matrix operations (addition, scalar multiplication, multiplication, transposition, inversion) combine matrices, and the determinant is a single scalar computed from a square matrix that measures invertibility and signed volume scaling. Key result: a square matrix is invertible if and only if its determinant is nonzero. Applies to: solving linear systems, transformations of the plane and space, computer graphics, statistics. Who/when: developed by Cayley, Sylvester, Cramer, Leibniz, and Laplace from the 17th to 19th centuries.

A matrix is a rectangular arrangement of numbers in $m$ rows and $n$ columns, written $A = [a_{ij}]$ , where $a_{ij}$ is the entry in row $i$ , column $j$ . Matrices encode linear systems, geometric transformations, and tables of data, and the algebra of matrices (how to add, scale, and multiply them) mirrors the composition of those transformations. The determinant, defined only for square matrices, collapses all entries into one number that tells you whether the matrix can be "undone" (inverted) and, geometrically, by what factor it scales areas or volumes. A surprising fact: matrix multiplication is not commutative — $A B$ and $B A$ are usually different, and may not even have the same size — which makes matrices behave very differently from ordinary numbers.

The Core Insight

A matrix is a linear transformation in disguise. Every operation on matrices corresponds to an operation on transformations: addition combines transformations, multiplication composes them (do one, then the other), and the determinant measures how much the transformation stretches or flips space. When the determinant is zero, the transformation crushes space into a lower dimension and cannot be reversed — that single number captures the entire question of solvability.

Formal Statement

Matrix and Basic Notation

An $m \times n$ matrix $A$ over the real numbers is an array of $mn$ entries arranged in $m$ rows and $n$ columns:

A = a_{11} a_{21} ⋮ a_{m 1} a_{12} a_{22} ⋮ a_{m 2} \dots \dots ⋱ \dots a_{1 n} a_{2 n} ⋮ a_{mn}

⟳this is a definition;

a_{ij}

denotes the entry in row

i

(

1 \leq i \leq m

) and column

j

(

1 \leq j \leq n

A matrix with $m = n$ is square. The main diagonal consists of entries $a_{ii}$ . The identity matrix $I_{n}$ has $a_{ii} = 1$ and $a_{ij} = 0$ for $i \neq = j$ .

Addition and Scalar Multiplication

For two matrices $A = [a_{ij}]$ and $B = [b_{ij}]$ of the same size $m \times n$ , and a scalar $c \in R$ :

(A + B)_{ij} = a_{ij} + b_{ij}, (c A)_{ij} = c a_{ij}

⟳addition and scaling act entrywise; the sizes must match for addition.

Matrix Multiplication

If $A$ is $m \times n$ and $B$ is $n \times p$ (the inner dimensions must agree), the product $A B$ is the $m \times p$ matrix with entries:

(A B)_{ij} = k = 1 \sum n a_{ik} b_{k j}

⟳entry

(i, j)

is the dot product of row

i

A

with column

j

B

Transpose

The transpose $A^{T}$ of an $m \times n$ matrix $A$ is the $n \times m$ matrix obtained by swapping rows and columns:

(A^{T})_{ij} = a_{j i}

⟳reflect entries across the main diagonal; row

i

becomes column

i

Determinant

The determinant $det (A)$ of a square $n \times n$ matrix is a scalar. For $2 \times 2$ and $3 \times 3$ matrices:

det [a c b d] = a d - b c

⟳signed area of the parallelogram spanned by the rows

(a, b)

and

(c, d)

det a d g b e h c f i = a (e i - f h) - b (d i - f g) + c (d h - e g)

⟳cofactor (Laplace) expansion along the first row; alternating signs

+, -, +

In general, the cofactor expansion along row $i$ is:

det (A) = j = 1 \sum n (- 1)^{i + j} a_{ij} M_{ij}

⟳

M_{ij}

is the

minor — the determinant of the $(n - 1) \times (n - 1)$ matrix formed by deleting row $i$ and column $j$ .

Invertibility Criterion

A square matrix $A$ has an inverse $A^{- 1}$ satisfying $A A^{- 1} = A^{- 1} A = I$ if and only if $det (A) \neq = 0$ . When it exists, for the $2 \times 2$ case:

A^{- 1} = \frac{1}{det ( A )} [d - c - b a], A = [a c b d]

⟳swap diagonal entries, negate off-diagonal entries, divide by the determinant; verify by direct multiplication that

A A^{- 1} = I

Key Determinant Properties

For square $n \times n$ matrices $A$ , $B$ :

det (A B) = det (A) det (B), det (A^{T}) = det (A), det (I_{n}) = 1

⟳multiplicativity follows from the volume-scaling interpretation — composing transformations multiplies their scaling factors.

Why It Holds / Derivation

The 2×2 Inverse Formula

We verify equation [8] directly by multiplication.

Let $A = [a c b d]$ with $det (A) = a d - b c \neq = 0$ .

Define the candidate $B = \frac{1}{a d - b c} [d - c - b a]$ .

Compute $A B$ using equation [3]:

A B = \frac{1}{a d - b c} [a c b d] [d - c - b a] = \frac{1}{a d - b c} [a d - b c c d - c d - ab + ab - c b + a d] .

Simplify: the off-diagonal terms vanish, the diagonal terms equal $a d - b c$ :

A B = \frac{1}{a d - b c} [a d - b c 0 0 a d - b c] = [1001] = I .

A symmetric computation gives $B A = I$ . Hence $B = A^{- 1}$ .

If $det (A) = 0$ , division is impossible and no inverse exists — confirming the criterion. $■$

Multiplicativity Sketch: det(AB) = det(A)det(B)

Interpret a matrix as a linear transformation of $R^{n}$ ; $det$ is the signed factor by which it scales $n$ -dimensional volume.

The product $A B$ represents applying $B$ first, then $A$ (composition).

Volume scaling under composition multiplies: scale by $det (B)$ , then by $det (A)$ .

Therefore the total scaling is $det (A) det (B)$ , giving $det (A B) = det (A) det (B)$ . $■$

Arthur Cayley | 1821–1895

The English mathematician Arthur Cayley is credited with founding the systematic theory of matrices in his 1858 Memoir on the Theory of Matrices. He introduced matrix multiplication as we use it today, defined the identity and inverse, and recognized matrices as objects with their own algebra — not merely shorthand for systems of equations. He stated (and verified in low dimensions) what is now the Cayley–Hamilton theorem: every square matrix satisfies its own characteristic equation. Working closely with his friend James Joseph Sylvester (who coined the word "matrix" in 1850), Cayley transformed scattered computational tricks into a unified abstract subject.

Building Intuition

Think of a $2 \times 2$ matrix as a machine that bends the plane. The columns of $A$ tell you where the basis arrows $(1, 0)$ and $(0, 1)$ land after the transformation. The determinant is the area of the parallelogram those two landing-arrows span — and its sign tells you whether orientation was preserved (positive) or flipped like a mirror (negative). If the two columns point along the same line, the parallelogram collapses to a sliver of zero area: the determinant is $0$ , the plane is squashed onto a line, and information is lost forever — that is exactly why you cannot invert. Multiplication composes machines: $A B$ means "first run $B$ , then run $A$ ," which is why order matters and why scaling factors multiply.

Geometric meaning of the 2×2 determinant: the area of the parallelogram spanned by the matrix's columns

Worked Examples

Multiplying Two Matrices

Given:

A = [1324]

(

2 \times 2

B = [5768]

(

2 \times 2

). Find

A B

. Steps (apply equation [3], dot rows of

A

with columns of

B

$(A B)_{11} = 1 \cdot 5 + 2 \cdot 7 = 5 + 14 = 19$
$(A B)_{12} = 1 \cdot 6 + 2 \cdot 8 = 6 + 16 = 22$
$(A B)_{21} = 3 \cdot 5 + 4 \cdot 7 = 15 + 28 = 43$
$(A B)_{22} = 3 \cdot 6 + 4 \cdot 8 = 18 + 32 = 50$

Check non-commutativity:

B A = [23313446] \neq = A B

A B = [19432250]

Determinant and Inverse, with a System Solved by Cramer's Rule

Given: Solve

{2 x + 3 y = 8 1 x + 4 y = 9

, i.e.

A x = b

with

A = [2134]

b = [89]

. Step 1 — Determinant (equation [5]):

det (A) = 2 \cdot 4 - 3 \cdot 1 = 8 - 3 = 5 \neq = 0

, so a unique solution exists. Step 2 — Cramer's Rule. Replace column 1 with

b

for

x

, column 2 for

y

x = \frac{det [ 8 9 3 4 ]}{5} = \frac{8 \cdot 4 - 3 \cdot 9}{5} = \frac{32 - 27}{5} = \frac{5}{5} = 1.

y = \frac{det [ 2 1 8 9 ]}{5} = \frac{2 \cdot 9 - 8 \cdot 1}{5} = \frac{18 - 8}{5} = \frac{10}{5} = 2.

Step 3 — Verify with the original equations:

2 (1) + 3 (2) = 8

✓,

1 (1) + 4 (2) = 9

✓.

x = 1, y = 2

Common Misconceptions

Matrix multiplication is not commutative. In general

A B \neq = B A

, and one product may be defined while the other is not (dimensions). Also:

A B = 0

does not imply

A = 0

B = 0

— there are nonzero "zero divisors." And there is no "matrix division"; you multiply by the inverse

A^{- 1}

(when it exists), being careful about whether you multiply on the left (

A^{- 1} B

) or the right (

B A^{- 1}

), since these differ.

Let $A = [0010]$ . Then $A \neq = 0$ , yet $A^{2} = [0010] [0010] = [0000] = 0$ . A nonzero matrix can square to the zero matrix — impossible for ordinary nonzero numbers. Note $det (A) = 0 \cdot 0 - 1 \cdot 0 = 0$ , so $A$ is non-invertible, consistent with Theorem (Invertibility Criterion).

Connections

Matrices are the computational engine behind several neighbouring topics. Solving $A x = b$ links directly to Systems of Linear Equations and Gaussian Elimination. The determinant's role as a signed area/volume connects to Vectors and the Cross Product (the $3 \times 3$ determinant formula for the cross product) and to Linear Transformations. Eigenvalues, found by solving $det (A - λ I) = 0$ , lead into Eigenvalues and Eigenvectors. The transpose and dot product underpin Inner Product Spaces, and matrix powers connect to Markov Chains.

Real-World Applications

Computer graphics & video games — $2 \times 2$ , $3 \times 3$ , and $4 \times 4$ matrices rotate, scale, and translate objects; the determinant's sign detects whether a transformation flips orientation (mirroring).
Cryptography (Hill cipher) — messages are encrypted by multiplying letter-vectors by an invertible matrix mod 26; decryption requires the modular inverse, which exists only when the determinant is coprime to 26.
Engineering & structural analysis — systems of force-balance equations are solved as $A x = b$ ; a zero determinant signals a mechanism that is unstable or statically indeterminate.
Google's PageRank — the web is encoded as a giant stochastic matrix; the ranking is its dominant eigenvector.
Economics (Leontief input–output models) — inter-industry dependencies form a matrix; total production solves $(I - A)^{- 1} d$ .
Statistics & machine learning — covariance matrices, least-squares regression $(X^{T} X)^{- 1} X^{T} y$ , and neural-network layers are all matrix operations.
Robotics — joint rotations compose by matrix multiplication to compute an arm's end-effector position (forward kinematics).

Historical Development

c. 200 BCE — The Chinese text Nine Chapters on the Mathematical Art solves systems of linear equations using array (matrix-like) elimination, predating Western methods by centuries.
1683 — Seki Takakazu in Japan and 1693 — Gottfried Leibniz in Europe independently introduce determinants while studying systems of equations.
1750 — Gabriel Cramer publishes Cramer's Rule, expressing solutions of linear systems as ratios of determinants.
1812 — Augustin-Louis Cauchy proves the multiplication theorem $det (A B) = det (A) det (B)$ and gives the modern definition of determinant.
1850 — James Joseph Sylvester coins the word "matrix" (Latin for "womb"), viewing it as a source from which determinants are born.
1858 — Arthur Cayley's Memoir on the Theory of Matrices establishes matrix algebra, multiplication, inverses, and the identity matrix.
1878 — Ferdinand Georg Frobenius unifies and extends the theory, developing rank, eigenvalues, and the characteristic polynomial.
20th century — Matrices become foundational to quantum mechanics (Heisenberg's 1925 matrix mechanics), numerical computing, and data science.

Subtleties & Limits

While matrix theory is fully understood mathematically, efficient computation remains an active research frontier. Naïve matrix multiplication of two $n \times n$ matrices costs $O (n^{3})$ operations; Strassen (1969) achieved $O (n^{2.807})$ , and the current record is roughly $O (n^{2.371})$ — but whether multiplication can be done in essentially $O (n^{2})$ time (the matrix multiplication exponent $ω = 2$ question) is unknown. Likewise, computing large determinants is numerically delicate: cofactor expansion is hopelessly slow ( $n!$ terms), and floating-point cancellation can make $det$ near zero indistinguishable from zero, so in practice the determinant is rarely used directly to test invertibility — conditioning and LU decomposition are used instead.