Index Ai Academy
Foundation · Vectors and matrices

Determinant and inverse

The area factor ad − bc, singular matrices, undoing a matrix, and redundant features.

About 42 minutes · Free lesson

What it covers6

Why it matters

Lesson 58 showed a matrix as a movement of the plane. Two questions follow. How much does the movement grow or shrink areas? And can it be undone, so every point can be sent back where it came from? One number answers both, the determinant. It's the area factor, and when it's 0 the plane has been squashed flat onto a line, which no matrix can unsquash. When it isn't 0, the undoing matrix, the inverse, exists, and it's how a system of equations gets its one answer. In ML, a zero determinant is the warning sign of two features that say the same thing, which leaves a model with no single best answer.

What you'll be able to do

  • Compute a 2 × 2 determinant, ad − bc, and see it as the area of the parallelogram the unit square lands on
  • Know that a determinant of 0 means the plane is flattened and nothing can undo it
  • Find a 2 × 2 inverse by hand, with np.linalg.inv and with torch.linalg.inv, and check that A⁻¹A = I
  • Spot a redundant feature from a zero determinant: a problem with no single answer
Quick check
Have a guess before you start. A matrix doubles every x and triples every y. A square of area 1 is moved by it. What is its new area?
  1. 5
  2. 1
  3. 9
  4. 6
Show the answer

6

The square becomes a 2-by-3 rectangle: area 2 × 3 = 6.

The math: the area factor, and undoing

Purpose. Can a movement be undone? First, how much does it scale area?

The determinant of a 2 × 2 matrix is one number:

det⁡(abcd)=ad−bc\det \begin{pmatrix} a & b \\ c & d \end{pmatrix} = ad - bc

In plain words: multiply down the main diagonal, multiply across the other diagonal, and subtract.

It's the factor by which the matrix scales every area. diag(3, 2) has determinant 3 × 2 − 0 × 0 = 6, so the unit square becomes a rectangle of area 6. A shear, [[1, 1], [0, 1]], has determinant 1: it slants squares but keeps their area. A rotation also has determinant 1.

Quick check
From lesson 58: what does [[1, 0], [0, −1]] do to the plane?
  1. Rotates it a quarter turn
  2. Shears it
  3. Doubles it
  4. Flips it across the x-axis
Show the answer

Flips it across the x-axis

It keeps x and negates y: a mirror. Its determinant is −1: areas keep their size, and the minus sign says the plane was flipped over.

A negative determinant means the plane was flipped over, like a page turned face down; its size still tells the area factor. A zero determinant means areas become 0: the whole plane is squashed onto a line or a point.

The picture. Watch [[2, 1], [1, 3]] two ways at once: as boxes of numbers, and as a drawing on a grid. The drawing starts from the unit square, 1 by 1, with two of its sides drawn as the unit arrows: the thick one along x, the thin one along y. The first step shows what the main diagonal alone would do, stretch the square 2 across and 3 up. The second slants the arrows onto A's columns, (2, 1) and (1, 3), where lesson 58 showed the unit arrows land, and the square lands on a parallelogram. Its area is the determinant. The last step runs the inverse, which sends the parallelogram home.

Try it now

Then set the matrix to 1 2 on the first line and 2 4 on the second, and press Use these numbers: the second row is twice the first, both arrows land on one line, the determinant is 0, and there's no inverse.

Symbols and formula. The inverse A⁻¹ undoes A: applying A and then A⁻¹ puts every point back.

A−1A=AA−1=I(abcd)−1=1ad−bc(d−b−ca)A^{-1}A = AA^{-1} = I \qquad \begin{pmatrix} a & b \\ c & d \end{pmatrix}^{-1} = \frac{1}{ad - bc}\begin{pmatrix} d & -b \\ -c & a \end{pmatrix}

In plain words: swap a and d, flip the signs of b and c, and divide everything by the determinant.

For [[2, 1], [1, 3]]: swap to [[3, −1], [−1, 2]] and divide by 5, giving [[0.6, −0.2], [−0.2, 0.4]]. When the determinant is 0 the formula would divide by 0, and no inverse exists. Such a matrix is called singular.

Quick check
What is the determinant of [[4, 7], [2, 6]]?
  1. −10
  2. 38
  3. 10
  4. 24
Show the answer

10

4 × 6 − 7 × 2 = 24 − 14 = 10.

Undoing solves equations. The system 2x + y = 5 and x + 3y = 10 is A times (x, y) = (5, 10), with A = [[2, 1], [1, 3]]. Multiply both sides by A⁻¹ and the unknowns stand alone: (x, y) = A⁻¹(5, 10) = (0.6 × 5 − 0.2 × 10, −0.2 × 5 + 0.4 × 10) = (1, 3). Check: 2 + 3 = 5 and 1 + 9 = 10. When A is singular, a system like this has either no answer or endless answers, never exactly one (lesson 60).

In your own words
In your own words: why can't a matrix with determinant 0 be undone?

Write a sentence or two, then compare it with a good answer in the lesson.

In Python: np.linalg.det and np.linalg.inv

Purpose. Let NumPy compute both, and check the result.

import numpy as np

A = np.array([[2, 1], [1, 3]])
print(np.linalg.det(A), round(np.linalg.det(A), 6))
A_inv = np.linalg.inv(A)
print(np.round(A_inv, 3).tolist())
print(np.allclose(A @ A_inv, np.eye(2)))
It runs right here in your browser, with nothing to install.

np.linalg.det prints 5.000000000000001: it computes the determinant a general way that leaves float noise, so round it or compare with np.allclose. The last line is the check that matters: A times its inverse should be the identity.

Code flow. NumPy hides the work, so step through it done by hand, one line at a time: the determinant from the two diagonals, then the inverse by swapping, flipping and dividing, then the check. A[0, 0] is the entry in row 0, column 0 (lesson 53). The arrays show as boxes, like the flow's, rounded to four places, so check looks exactly like the identity. The last line prints check[0, 1] in full: not 0, but a tiny negative number in e-notation, a hair away from it. That's why the same line asks np.allclose and not ==.

A named mistake: inverting a singular matrix. np.linalg.inv on [[1, 2], [2, 4]] can't work. On a full install it stops with "LinAlgError: Singular matrix"; the NumPy in this browser hands back a matrix of nan ("not a number") instead. Either way, check the determinant first, with a small tolerance, because float noise can leave a "zero" determinant as a tiny nonzero number:

import numpy as np

S = np.array([[1, 2], [2, 4]])
print(abs(np.linalg.det(S)) < 1e-9)

Solving a system. np.linalg.solve(A, b) finds x with A x = b directly, which is faster and more accurate than computing the inverse first. For our system it gives (1, 3).

Worked example

Worked example: invert and verify three matrices

For each matrix, check the determinant; if it isn't zero, invert and confirm A⁻¹A = I.

import numpy as np

mats = [np.array([[4, 7], [2, 6]]), np.array([[3, 1], [5, 2]]), np.array([[1, 2], [2, 4]])]
for A in mats:
    d = np.linalg.det(A)
    if abs(d) < 1e-9:
        print(A.tolist(), "singular: no inverse")
    else:
        A_inv = np.linalg.inv(A)
        print(A.tolist(), round(d, 6), np.allclose(A_inv @ A, np.eye(2)))
In the lesson you can change this and run it.

The first two have determinants 10 and 1, so each has an inverse, and multiplying gives back the identity. The third has rows that repeat each other (row 2 is twice row 1), its determinant is 0, and the code reports it instead of letting np.linalg.inv fail. Checking first, with a tolerance, is the safe pattern.

Quick check
What does this print?
import numpy as np

A = np.array([[2, 1], [1, 3]])
x = np.linalg.solve(A, np.array([5, 10]))
print(np.round(x, 6).tolist())
  1. [5.0, 10.0]
  2. [1.0, 3.0]
  3. [2.5, 3.33]
  4. [3.0, 1.0]
Show the answer

[1.0, 3.0]

x = 1 and y = 3 solve 2x + y = 5 and x + 3y = 10.

Determinants multiply. Chaining two movements multiplies their area factors: det(SH) = det(S) × det(H). A stretch with determinant 6 followed by a shear with determinant 1 scales areas by 6 overall. It also explains why an inverse has determinant 1 ÷ det(A): A⁻¹A = I, and the identity's determinant is 1.

Quick check
What does this print?
import numpy as np

S = np.array([[2, 0], [0, 3]])
H = np.array([[1, 1], [0, 1]])
print(round(np.linalg.det(S), 6), round(np.linalg.det(H), 6), round(np.linalg.det(S @ H), 6))
  1. 5.0 1.0 5.0
  2. 6.0 1.0 6.0
  3. 6.0 1.0 7.0
  4. 6.0 2.0 12.0
Show the answer

6.0 1.0 6.0

det S = 2 × 3 = 6, a shear's determinant is 1, and determinants multiply: 6 × 1 = 6.

Drill

An inverse that checks first

Fix safe_inv(A) so it returns None when the determinant is 0 (within 1e-9), and otherwise the inverse. Then set ok to whether safe_inv(B) @ B is the identity.

import numpy as np

def safe_inv(A):
    return np.linalg.inv(A)

B = np.array([[4, 7], [2, 6]])
ok = False
print(safe_inv(B), ok)
In the lesson, your code is checked as you write it.
In your own words
Why compare the determinant with a tiny number like 1e-9 instead of with exactly 0?

Write a sentence or two, then compare it with a good answer in the lesson.

In AI and ML: a zero determinant means no single answer

Purpose. Know when a problem has exactly one answer.

Fitting a model's weights often comes down to solving a system built from the data matrix X, through the square matrix XᵀX (lesson 101). If XᵀX is singular, there's no single best set of weights. That happens when one feature repeats another: say, one column is a length in meters and another the same length in centimeters.

det⁡(XTX)=0  ⟺  a feature is redundant\det(X^{\mathsf{T}}X) = 0 \iff \text{a feature is redundant}

In plain words: if one column of X is a copy, or a multiple, of another, XᵀX squashes space flat, and the weights can't be pinned down.

import numpy as np

X = np.array([[1, 2], [2, 4], [3, 6]])
X2 = np.array([[1, 2], [2, 1], [3, 5]])
print((X.T @ X).tolist(), abs(np.linalg.det(X.T @ X)) < 1e-9)
print((X2.T @ X2).tolist(), round(np.linalg.det(X2.T @ X2), 6))

In X the second feature is always twice the first, and XᵀX is singular. In X2 neither feature is a multiple of the other, and the determinant is 59.

Quick check
Why is there no single best weight for each feature when feature 2 is always twice feature 1?
  1. Weight can move between the twin features freely
  2. There are too many examples
  3. The features are too small
  4. The determinant is negative, so it flips
Show the answer

Weight can move between the twin features freely

w₁x + w₂(2x) = (w₁ + 2w₂)x, so only w₁ + 2w₂ matters: endless pairs give the same predictions.

What libraries do about it. Real data rarely makes a determinant exactly 0, but near-copies make it tiny, and then the weights swing wildly with small changes in the data. Two fixes are common: drop one of the twin features, or add a small penalty on the weights (regularization), which makes the matrix comfortably invertible again. Both start from noticing that the determinant is near zero.

In PyTorch. The same check in the real tool, then the weights themselves. torch.linalg has the three calls of this lesson: det, inv and solve. Here y holds a target for each example, made as 2 × feature 1 + 1 × feature 2, and the best weights solve the system XᵀX w = Xᵀy (lesson 101 shows where it comes from). torch.round(…, decimals=4) tidies float noise, like np.round.

import torch

X2 = torch.tensor([[1.0, 2.0], [2.0, 1.0], [3.0, 5.0]])
y = torch.tensor([4.0, 5.0, 11.0])
G = X2.T @ X2
print(G.tolist(), round(torch.linalg.det(G).item(), 4))
w = torch.linalg.solve(G, X2.T @ y)
print(torch.round(w, decimals=4), torch.round(torch.linalg.inv(G) @ X2.T @ y, decimals=4))

The first line is the same XᵀX and the same determinant, 59, that the NumPy cell printed. It isn't 0, so the weights have one best value, and solve finds it: 2 and 1, the recipe y was made from. The inverse gets the same answer the long way; like np.linalg.solve, torch.linalg.solve is faster and more accurate, so it's the one to use.

Drill

Find the redundant feature

Three data tables are in tables. Set flags to a list with True for each table whose XᵀX is singular (determinant within 1e-9 of 0), in order.

import numpy as np

tables = [np.array([[1.5, 4.5], [2.2, 6.6], [3.1, 9.3]]),
          np.array([[1, 0], [0, 1], [1, 1]]),
          np.array([[2, 5], [4, 1], [1, 3]])]
flags = []
for X in tables:
    flags.append(np.linalg.det(X) == 0)
print(flags)
In the lesson, your code is checked as you write it.
In your own words
A data set has a column of prices in dollars and another of the same prices in cents. What would you do before fitting a model, and why?

Write a sentence or two, then compare it with a good answer in the lesson.

Goes deeper in

Practice what you just read

  • 5 code examples you can edit and run
  • a practice exercise that checks your code
  • a 5-question quiz
  • 9 review cards for spaced repetition

Try a quiz question

What does a determinant of 0 tell you about a 2 × 2 matrix?

  1. It squashes the plane flat: no inverse
  2. It leaves the plane unchanged
  3. It flips the plane over
  4. It doubles every area

Answer it at the end of the lesson to see if you're right, and why.

Before this lesson

Keep learning

Where this lesson leads.

575 lessons in thirteen phases. 176 are free without an account, and a free account opens the rest. See every lesson.

Foundation · about 96 hours of study

Foundation math

From whole numbers to the math inside a neural network: each idea by hand, in Python, and in AI 118 lessons All free
  1. Numbers and place value FreeWhat a digit's place is worth, the number line, and Python as a calculator that never tires.36 min
  2. Multiplying and dividing: groups FreeEqual groups, quotient and remainder, and cutting training data into batches.35 min
  3. Order of operations, and names for numbers FreeBrackets, powers, then multiply and divide, then add and subtract; variables hold numbers.36 min
  4. Numbers below zero FreeThe number line through zero, sign rules, distance from zero, and an error's direction and size.37 min
  5. Fractions: equal parts, equal fractions, adding FreePieces of a whole, equal fractions, and re-cutting to add; accuracy as a fraction.45 min
  6. Multiplying and dividing fractions FreeA share of a share, dividing by flipping, and why chances in a row get small.35 min
  7. Decimals and rounding FreeFractions in place value, rounding, and why 0.1 + 0.2 isn't exactly 0.3.36 min
  8. Percentages FreePer hundred, percent change, percentage points, and the accuracy and error rates of models.35 min
  9. Ratios, rates and proportion FreeSharing in a ratio, rates per unit, scaling, and splitting data 80/10/10.35 min
  10. Powers and roots FreeRepeated multiplying, the laws of exponents, square roots, and squared error.43 min
  11. Very big and very small numbers FreePowers of ten, e-notation like 3e-4, orders of magnitude, and a model's size in memory.36 min
  12. Bits, bytes and floats: how numbers are stored FreeBase 2, what n bits can hold, a float as sign, power and digits, and a tensor's memory.35 min
  13. Review: find the slip (numbers) FreeBroken calculations to fix, mixed practice from the whole module, and its formula sheet.34 min
  14. Letters for numbers FreeVariables, terms and like terms, substitution, and a model's formula as a Python function.41 min
  15. Expanding and factoring FreeBrackets as areas, pulling out common factors, and a squared error expanded into a bowl.41 min
  16. Solving equations: keep the balance FreeThe same move on both sides, undoing steps in reverse, and running a model's formula backward.41 min
  17. Rearranging a formula FreeMaking any letter the subject, round-trip checks, and planning a training run.36 min
  18. Inequalities and true-or-false FreeRanges, flipping the sign, if and elif, and the thresholds, clips and ReLU inside a model.42 min
  19. Functions: a rule from input to output Freef(x) notation, tables and graphs, domain and range, loops over lists, and loss as a function.42 min
  20. Chaining and undoing functions Freeg(f(x)), inverses that undo, scaling and unscaling, and a network as a chain.42 min
  21. Straight lines: slope and intercept FreeRise over run, the line through two points, and a model's weight and bias as slope and intercept.42 min
  22. Two equations, two unknowns FreeSubstitution and elimination, where lines cross, and why models are fitted, not solved.42 min
  23. Quadratics: bowls and their lowest point FreeRoots by factoring and by formula, the discriminant, the vertex, and the best weight of a model.42 min
  24. Exponentials: growth and decay FreeThe same factor each step, the number e, and decaying learning rates.43 min
  25. Logarithms: the power question FreeTo what power?, the laws of logs, and adding log-probabilities instead of multiplying.45 min
  26. Sequences and Σ FreeArithmetic and geometric sequences, Σ as a loop that adds, and mean squared error.40 min
  27. Weighted and moving averages FreeWeights that add to 1, a window average, the exponential moving average, and smoothing a loss curve.35 min
  28. Sets, and reading the symbols FreeSets, union and intersection, ℝⁿ and f : ℝⁿ → ℝᵐ, and reading a paper's first equation.41 min
  29. Review: find the slip (algebra) FreeBroken algebra and code to fix, mixed practice from the whole module, and its formula sheet.34 min
  30. Transposing step by step: undo in reverse order FreeA formula's layers, the opposite of each, peeling from the outside in, conditions, and round-trip checks.35 min
  31. Formulas with fractions: clear them first FreeClearing denominators, cross-multiplying, a letter in the bottom, and reciprocal formulas like 1/R = 1/R₁ + 1/R₂.35 min
  32. When the letter appears twice: collect and factor FreeGathering the letter on one side, factoring it out, dividing by the bracket, and rearranging precision and F1.35 min
  33. Squares, roots and powers FreeSquare roots with ±, squaring to undo a root, cube and nth roots, and the √d inside attention.40 min
  34. When the letter is squared and plain: quadratics FreeRearranging into ax² + bx + c = 0, the formula, completing the square, and choosing the root that fits.35 min
  35. Letters in the power: exponentials and logarithms FreeTaking logs to bring a power down, exponentiating to free a letter, and the logit that undoes the sigmoid.40 min
  36. Rearranging inequalities: when the sign flips FreeThe four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.35 min
  37. Inverse functions, lines and scaling FreeUndoing a function by making x the subject, domains that allow it, line forms, and unscaling predictions.40 min
  38. Sequences and sums: find n, a, d and r FreeEvery letter of the arithmetic and geometric formulas as the subject, and an average's window from its decay.40 min
  39. Combining formulas: substitute and eliminate FreePutting one formula inside another to remove a letter, and sizing a training run from a time or money budget.35 min
  40. Review: rearrange anything (algebra) FreeBroken rearrangements to fix, mixed practice from the whole algebra block, a strategy chart, and its formula sheet.35 min
  41. Coordinates and distance FreePoints as (x, y), Pythagoras, distance in any number of coordinates, and nearest neighbors.42 min
  42. Angles, degrees and radians FreeMeasuring a turn, converting units, arcs, and the angle between two arrows.36 min
  43. Sine and cosine FreeAcross and up: right triangles, the unit circle, and directions and rotations.42 min
  44. Waves: height, speed and shift FreeAmplitude, period and phase, sampling a wave, and position codes in transformers.37 min
  45. Review: find the slip (shapes and waves) FreeBroken geometry and code to fix, mixed practice from the module, and its formula sheet.29 min
  46. Angles, triangles and waves: rearranging with sin, cos and tan FreeSides and angles from SOH CAH TOA, principal values, arcs, polar coordinates, and a wave's time and period.45 min
  47. Vectors: lists of numbers that point FreeA list, a point and an arrow; components, dimension, NumPy arrays, and data as vectors.42 min
  48. Adding and scaling vectors FreeComponent-wise sums, scalar multiples, mixes, and the weight update w − ηg.43 min
  49. Length and distance: norms FreeL2, L1 and max norms, unit vectors, distance, and the norms inside losses and clipping.42 min
  50. The dot product FreeMultiply in pairs and add; a·a as squared length; a @ b; one neuron as a dot product.43 min
  51. Angle, cosine similarity and projection FreeDirection without length, perpendicular vectors, shadows, and search by meaning.45 min
  52. Perpendicular directions: bases and coordinates FreeOrthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.35 min
  53. Matrices: tables of numbers FreeRows, columns and entries; two-dimensional arrays and slices; a data set as a matrix.41 min
  54. Adding, scaling and transposing matrices FreeEntry-by-entry sums and scalings, the transpose, mean images, and tables turned around.36 min
  55. A matrix times a vector FreeEach row dotted with the vector, the size rule, A @ x, and a layer acting on one example.42 min
  56. Matrix multiplication FreeRow meets column, the size rule, order matters, and a batch through a layer: X W + b.45 min
  57. Identity, diagonal, triangular and symmetric FreeFour patterns and their jobs: rescaling, distance tables, and the causal mask.37 min
  58. Matrices as movements of space FreeStretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.42 min
  59. Determinant and inverse FreeThe area factor ad − bc, singular matrices, undoing a matrix, and redundant features.42 min
  60. Solving systems by elimination FreeAugmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.45 min
  61. Independence, span and rank FreeRedundant vectors, span, rank, outer products, and low-rank updates like LoRA.42 min
  62. Eigenvectors: directions that only stretch FreeAv = λv, checking candidates, np.linalg.eig, and the main direction of a data cloud.41 min
  63. SVD and PCA: the important directions first FreeA matrix as pieces by size, the best rank-k copy, compression, and PCA maps of data.45 min
  64. Tensors, shapes and broadcasting FreeAxes and shapes, reshape, axis=, broadcasting, and shapes through a small model.43 min
  65. One-hot vectors and lookup tables: embeddings FreeA one-hot row picks a table's row, a sentence looked up as vectors, and a score for every word.35 min
  66. Sliding dot products: convolution FreeA small pattern slid along a list and over a grid, output sizes, stride and padding, and shared weights.40 min
  67. Review: find the slip (vectors and matrices) FreeShape slips to fix, mixed practice from the module, and its formula sheet with shapes.36 min
  68. Vector equations: rearranging with arrows FreeSolving for a vector or a scale, recovering a gradient from two weight snapshots, and an angle from a dot product.40 min
  69. Matrix equations: multiply by the inverse, on the correct side FreeNo dividing by a matrix: inverses from the left or right, order, transposes, and the normal equations.40 min
  70. Rates of change FreeChange over change, secants, rates from readings with np.diff, and reading a loss curve.41 min
  71. Limits: what a value heads toward FreeApproaching from both sides, holes, corners and jumps, epsilon, and judging activations.37 min
  72. The derivative: slope at a point FreeShrinking secants, f′(x) and dy/dx, Δy ≈ f′Δx, and which way a weight should move.45 min
  73. Derivative rules FreeConstants, powers, multiples, sums, eˣ and ln x, checked numerically, and a squared error's slope.41 min
  74. The product rule and the chain rule FreeProducts and chains of functions, forward then backward, and one neuron's dL/dw.45 min
  75. Lowest points and curvature Freef′ = 0, the second-derivative test, tables, local and global minima, and convex losses.43 min
  76. Standing in for a curve near a point FreeTangent lines, a curvature term, growing error, and why learning rates must be small.37 min
  77. Partial derivatives FreeOne input at a time, ∂, nudging in Python, and the two slopes of a line's loss.41 min
  78. The gradient FreeAll the slopes as a vector, steepest climb and descent, a numerical gradient, and the loss gradient.42 min
  79. Gradient descent FreeStepping against the gradient, the learning rate, a training loop, and fitting a line.45 min
  80. Faster descent: momentum and Adam FreeMomentum and Adam by hand, the bias correction, and three optimizers down one narrow valley.40 min
  81. The chain rule with many paths: backpropagation by hand FreeGraphs, multiply along paths and add across them, gradient checks, and a 2-2-1 network by hand.45 min
  82. Automatic differentiation: how PyTorch finds every slope FreeA tape of steps walked backward, and requires_grad, backward(), .grad, zero_grad() and no_grad().40 min
  83. Jacobians and Hessians FreeSlopes of vector functions, a layer's Jacobian, second partials, and bowls, domes and saddles.42 min
  84. Integrals: adding up thin slices FreeStrip and trapezoid sums, summing undoes differencing, probability as area, and AUC.43 min
  85. Review: find the slip (calculus) FreeCalculus slips to fix, mixed practice from the module, and its formula sheet.36 min
  86. Rearranging in calculus: slopes, steps and constants FreeSetting a slope to zero, Newton's step, the chain rule turned around, constants from a point, and learning rates.45 min
  87. Counting: choices, orders and groups FreeThe counting principle, factorials, ordered picks and groups, and why attention's cost grows with the square of the length.43 min
  88. Probability: from counts to chances FreeEqually likely outcomes, the complement, distributions, seeded simulation, and a next-word model.43 min
  89. Combining events: and, or, independent FreeThe or rule, independence, probability trees, drawing with and without replacement, and chains of steps.42 min
  90. Conditional probability and Bayes' rule FreeConditionals from tables, why P(A | B) isn't P(B | A), Bayes' rule, and precision and recall.45 min
  91. Random variables and distributions FreeUncertain numbers, the probability of a range, sampling by slices, and sampling versus argmax.42 min
  92. Expected value, variance and standard deviation FreeProbability-weighted averages, spread in the data's own units, and a training loss as an expected value.42 min
  93. Bernoulli, binomial, uniform and normal FreeYes-or-no trials, counts of yeses, the 68-95-99.7 rule, z-scores, and an accuracy's error bar.45 min
  94. Two variables at once: covariance and correlation FreeJoint tables and marginals, covariance, correlation, the covariance matrix, and features that carry the same information.45 min
  95. Review: find the slip (probability) FreeProbability slips to fix, mixed practice from the module, and its formula sheet.36 min
  96. Probability formulas: solve for the missing chance FreeConditionals, Bayes' rule for the prior, the or rule, expected values, variance, and z-scores turned around.45 min
  97. Describing data: center, spread and scale FreeMean, median and mode, variance and standard deviation, percentiles, outliers, and standardizing features.42 min
  98. Samples, the law of large numbers and the central limit theorem FreeSamples and populations, the standard error σ/√n, the bell of averages, and error bars on test scores.43 min
  99. Is the difference real? Comparing two models FreePaired differences, a bootstrap interval, what a p-value is and isn't, and why many tries make lucky wins.40 min
  100. Maximum likelihood FreeLikelihoods as products, log-likelihoods as sums, grid search, underflow, and the negative log-likelihood loss.45 min
  101. Linear regression: the best line FreeResiduals, least squares by formula, three roads to one line, the matrix form, and train versus test error.45 min
  102. Logistic regression: a line that answers yes or no FreeThe sigmoid, the log loss, its slope p − y, a training loop, and choosing a threshold.45 min
  103. Scoring a classifier: confusion table, precision, recall, F1 FreeThe four cells, accuracy, precision, recall and F1, and what moving a threshold does to each.35 min
  104. Softmax: scores into probabilities FreeExponentiate and share out, shifting and temperature, the safe softmax, and a classifier's last step.43 min
  105. Surprise, entropy and cross-entropy FreeSurprise in bits, entropy, cross-entropy and KL divergence, perplexity, and a language model's loss.45 min
  106. KL divergence: how far one distribution is from another FreeKL by hand, cross-entropy as entropy plus KL, why it isn't symmetric, and a soft-target loss.35 min
  107. Review: find the slip (statistics and information) FreeStatistics slips to fix, mixed practice from the module, and its formula sheet.38 min
  108. Statistics and information: n, z, logits and bits FreeSample sizes from error bars, inputs from probabilities, logit gaps from softmax, and chances from bits and losses.40 min
  109. One neuron, start to finish FreeWeighted sum, activation, loss, slopes and update, by hand and in code, and what one straight line can and can't split.45 min
  110. A layer and a small network as matrices FreeTwo layers on a batch, the shape of every matrix, adding a hidden unit, and XOR solved.45 min
  111. Training a small network FreeThe backward pass in matrix form, gradient checks, a full training loop, and reading loss curves.45 min
  112. The same network in PyTorch Freenn.Sequential with the NumPy weights loaded, the same loss and slopes, then SGD and mini-batches.45 min
  113. Attention as matrix math FreeScaled dot-product scores, the causal mask, a row-by-row softmax, and blending value vectors.45 min
  114. Residual connections and layer norm FreeAdding the input back and why its slope keeps learning alive, layer norm by hand, and add and norm.40 min
  115. A transformer block, start to finish FreeA sentence through embeddings, attention, add and norm, a small network and next-word scores, every shape named.45 min
  116. Planning a model: rearranging the formulas of a working network FreeLayer widths from parameter counts, sizes from memory and compute, the attention scale, and a training plan.40 min
  117. Final test: transpose any formula FreeSlips to fix from every topic, mixed practice of every kind of rearranging, the strategy chart and the full sheet.45 min
  118. Capstone: a sign reader from the formulas FreeBuild, train and test a trail-sign classifier with NumPy alone, and report its accuracy with an error bar.45 min
Part of a free course 118 lessons

The Foundation Math For Ai & ML: from arithmetic to attention

Learn the math behind AI from arithmetic up: numbers, algebra, vectors and matrices, calculus, probability and statistics, each shown as numbers moving and checked in Python, ending with a network you build and train from the formulas.

Never trained an AI? Teach a small one to write, right in your browser. It takes about 20 seconds and needs no account. Teach it to write