Index Ai Academy
Foundation · Vectors and matrices

Solving systems by elimination

Augmented matrices, row moves, back-substitution, the three outcomes, and fitting weights.

About 45 minutes · Free lesson

What it covers6

Why it matters

Lesson 22 solved two equations in two unknowns by eliminating one letter. Real problems have more: three unknowns, ten, a thousand. Elimination scales up by writing only the numbers, in a matrix, and following one method: clear the numbers below the diagonal, row by row, until the matrix is a staircase, then read the answer off from the bottom up. It's the method behind np.linalg.solve, it shows plainly when a system has no answer or endless ones, and it answers a question at the heart of ML: which weights make a model fit these examples exactly, and what to do when no weights can.

What you'll be able to do

  • Write a system of equations as an augmented matrix [A | b]
  • Use row moves to reach a staircase, then substitute back up to the answer
  • Tell the three outcomes apart: one solution, none, or infinitely many
  • Solve for a model's weights exactly, in NumPy and PyTorch, and see why more examples than weights needs a best fit instead
Quick check
Have a guess before you start. x + y = 5 and x − y = 1. What are x and y?
  1. x = 4, y = 1
  2. x = 3, y = 2
  3. x = 2, y = 3
  4. x = 5, y = 0
Show the answer

x = 3, y = 2

Adding the equations eliminates y: 2x = 6, so x = 3, and then y = 2.

The math: row moves down to a staircase

Purpose. Many equations, many unknowns, one method.

Write each equation as a row of its coefficients, with the right-hand side after a bar. The system

x + y + z = 6, 2x + 3y + z = 11, x + 3y + 4z = 19

becomes the augmented matrix:

(11162311113419)\left(\begin{array}{ccc|c} 1 & 1 & 1 & 6 \\ 2 & 3 & 1 & 11 \\ 1 & 3 & 4 & 19 \end{array}\right)

In plain words: each row is one equation; each column before the bar is one unknown.

Three row moves keep the solution the same: swap two rows; multiply a row by a nonzero number; add a multiple of one row to another. Each is something you could do to the equations themselves without changing what solves them.

Quick check
From lesson 22: in 3x + 2y = 12 and x − 2y = 4, what single move eliminates y?
  1. Subtract the second from the first
  2. Multiply the first by 2
  3. Swap the equations
  4. Add the two equations
Show the answer

Add the two equations

2y and −2y cancel when added: 4x = 16, so x = 4. A row move is the same idea, written on rows of numbers.

The order of attack. Work column by column, left to right. Use each diagonal entry (the pivot) to make zeros in every row below it, so finished work is never disturbed. Each step is labeled the way people write it: R₂ − 2R₁ → R₂ means "replace row 2 with row 2 minus twice row 1". The flow names the unknowns x₁, x₂ and x₃ for x, y and z.

The picture. Above the number boxes, the flow draws [A | b] as a table, one row per equation: the coefficients are shaded, darker for bigger numbers, the right sides are written plain, and an answer row waits underneath. Each row move lights the row it changes and the pivot it uses, and the cleared cell turns pale, so the staircase of zeros shows as it forms. Then the answers fill in, bottom row first.

Try it now

Then set the equations to 0 1 1 5, 1 1 1 6 and 2 3 1 11, one per line, and press Use these numbers: the first pivot is 0, so the flow swaps two rows before it clears anything.

Symbols and formula. After elimination the left part is upper triangular (lesson 57), a staircase:

(111601−1−100515)⇒z=3,  y=−1+z=2,  x=6−y−z=1\left(\begin{array}{ccc|c} 1 & 1 & 1 & 6 \\ 0 & 1 & -1 & -1 \\ 0 & 0 & 5 & 15 \end{array}\right) \quad\Rightarrow\quad z = 3, \; y = -1 + z = 2, \; x = 6 - y - z = 1

In plain words: read the bottom row first, then put each answer into the row above. This is back-substitution.

The three outcomes. Elimination always ends in one of three ways:

  • One solution: every column has a pivot, as above.
  • No solution: a row reads 0 0 0 | 5, which says 0 = 5. The equations contradict each other.
  • Infinitely many: a row turns into all zeros, 0 0 0 | 0. One equation was a mix of the others, so an unknown is left free.
Quick check
Elimination leaves the row 0 0 | 4. What does that mean?
  1. x = 4
  2. Infinitely many solutions
  3. y = 0
  4. No solution: the row says 0 = 4
Show the answer

No solution: the row says 0 = 4

A row of zero coefficients with a nonzero right side says 0 = 4, which can't be true.

Two unknowns, as lines. With two unknowns you can see what a row move does. Each equation is a line of points, and the answer is where the lines cross (lesson 22). Here are the two equations from the opening question, x + y = 5 and x − y = 1, with x and y named x₁ and x₂ as before. Watch the row move swing the second line about the crossing until it lies flat, with no x₁ left in it. Then back-substitution reads x₂ off the flat line, and x₁ at the crossing.

In your own words
In your own words: why does adding a multiple of one equation to another not change the solution?

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

In Python: row moves, then np.linalg.solve

Purpose. Do the moves as array lines once, then let NumPy do them.

Each row move is one line on a row of the array:

import numpy as np

M = np.array([[1.0, 1, 1, 6],
              [2, 3, 1, 11],
              [1, 3, 4, 19]])
M[1] = M[1] - 2 * M[0]
M[2] = M[2] - M[0]
M[2] = M[2] - 2 * M[1]
print(M.tolist())
z = M[2, 3] / M[2, 2]
y = (M[1, 3] - M[1, 2] * z) / M[1, 1]
x = (M[0, 3] - M[0, 1] * y - M[0, 2] * z) / M[0, 0]
print(x, y, z)
It runs right here in your browser, with nothing to install.

The 1.0 makes the whole array decimals, so later divisions aren't cut to whole numbers. M[1] = M[1] - 2 * M[0] is R₂ − 2R₁ → R₂, and the last three lines are back-substitution, bottom row first.

Code flow. Step through the same lines one at a time. M shows as a grid of boxes, the same rows as the flow's: watch each row move rewrite one row and leave a zero under the diagonal, then z, y and x come out, bottom row first.

One call. np.linalg.solve(A, b) runs elimination for you, on the coefficients A and the right side b kept apart. Always check the answer by putting it back: A @ x should equal b.

import numpy as np

A = np.array([[1, 1, 1], [2, 3, 1], [1, 3, 4]])
b = np.array([6, 11, 19])
x = np.linalg.solve(A, b)
print(np.round(x, 6).tolist(), np.allclose(A @ x, b))

A named mistake: solving a system with no single answer. When A is singular (lesson 59), np.linalg.solve can't give one answer, whether the system has no solution or infinitely many. A full install stops with "Singular matrix"; the NumPy in this browser returns nan ("not a number"). Check abs(np.linalg.det(A)) < 1e-9 first, then work out which of the two it is by eliminating by hand.

Worked example

Worked example: solve and verify three systems

Solve three systems, skipping any whose matrix is singular, and confirm each answer by putting it back.

import numpy as np

systems = [(np.array([[3, 1], [1, 2]]), np.array([9, 8])),
           (np.array([[1, 1, 1], [0, 2, 1], [1, 0, 3]]), np.array([6, 7, 10])),
           (np.array([[1, 2], [2, 4]]), np.array([3, 7]))]
for A, b in systems:
    if abs(np.linalg.det(A)) < 1e-9:
        print("singular: no single answer")
    else:
        x = np.linalg.solve(A, b)
        print(np.round(x, 6).tolist(), np.allclose(A @ x, b))
In the lesson you can change this and run it.

The first system gives (2, 3) and the second (1, 2, 3), each confirmed by A @ x. The third has a second row that's twice the first on the left, but 7 isn't twice 3 on the right, so it has no solution; the determinant test catches it before solve would fail. Each item of systems is a tuple of (A, b), unpacked by the for line.

Quick check
What does this print?
import numpy as np

A = np.array([[2, 1], [1, -1]])
b = np.array([7, 2])
x = np.linalg.solve(A, b)
print(np.round(x, 6).tolist(), np.allclose(A @ x, b))
  1. [3.0, 1.0] False
  2. [3.0, 1.0] True
  3. [1.0, 3.0] True
  4. [7.0, 2.0] True
Show the answer

[3.0, 1.0] True

2x + y = 7 and x − y = 2: adding gives 3x = 9, so x = 3 and y = 1. Putting them back reproduces b.

When a pivot is 0. If the number on the diagonal is 0 when you reach it, it can't clear the rows below. The first row move fixes it: swap in a lower row that has a nonzero number in that column. Software goes further and swaps on purpose to use the biggest number available as the pivot, because dividing by tiny pivots magnifies float errors. That's one reason to trust np.linalg.solve over a hand-written loop on real data. Your own loop is still worth writing once: it's the clearest way to see each row move happen, and to check a small answer by hand.

Quick check
What does this print?
import numpy as np

M = np.array([[1.0, 2, 4], [2, 5, 9]])
M[1] = M[1] - 2 * M[0]
print(M.tolist())
  1. [[1.0, 2.0, 4.0], [4.0, 9.0, 17.0]]
  2. [[1.0, 2.0, 4.0], [2.0, 5.0, 9.0]]
  3. [[1.0, 2.0, 4.0], [0.0, 1.0, 1.0]]
  4. [[0.0, 1.0, 1.0], [2.0, 5.0, 9.0]]
Show the answer

[[1.0, 2.0, 4.0], [0.0, 1.0, 1.0]]

R₂ − 2R₁ → R₂: 2 − 2 = 0, 5 − 4 = 1 and 9 − 8 = 1. The new row says y = 1, and then x + 2 = 4 gives x = 2.

Drill

Solve, or say why not

Fix solve_or_none(A, b) so it returns None when A is singular (determinant within 1e-9 of 0) and otherwise the solution. Then set ok to whether the solution of the first system reproduces its b.

import numpy as np

def solve_or_none(A, b):
    return np.linalg.inv(A) * b

A1 = np.array([[1, 1, 1], [2, 3, 1], [1, 3, 4]])
b1 = np.array([6, 11, 19])
ok = False
print(solve_or_none(A1, b1), ok)
In the lesson, your code is checked as you write it.
In your own words
Why put the answer back into the equations even when NumPy found it?

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

In AI and ML: weights that fit exactly, or best

Purpose. "Which weights fit these examples?" is a system of equations.

A model's weights are its unknowns, and every example it must get right is one equation about them. With exactly as many examples as weights, elimination can pin the weights down.

Suppose tent rentals follow rentals = w₁ × temperature + w₂ × hikers + w₃. Three days give three equations in the three weights:

(204125213061)(w1w2w3)=(424668)\begin{pmatrix} 20 & 4 & 1 \\ 25 & 2 & 1 \\ 30 & 6 & 1 \end{pmatrix} \begin{pmatrix} w_1 \\ w_2 \\ w_3 \end{pmatrix} = \begin{pmatrix} 42 \\ 46 \\ 68 \end{pmatrix}

In plain words: each row is one day, and the weights must make all three days come out right at once.

import numpy as np

days = np.array([[20, 4, 1], [25, 2, 1], [30, 6, 1]])
rentals = np.array([42, 46, 68])
w = np.linalg.solve(days, rentals)
print(np.round(w, 6).tolist(), np.allclose(days @ w, rentals))

The weights are 2 rentals per degree, 3 per hiker, and −10: they fit all three days exactly. The column of 1s is what lets w₃ act as a constant, the trick from lesson 58 that folds a bias into the weights.

Quick check
A fourth day is added: 28 degrees, 5 hikers, 62 rentals. The weights (2, 3, −10) predict 61. What happens if you try to fit all four days exactly?
  1. The fourth day is ignored
  2. There are infinitely many answers
  3. The weights simply change to fit all four
  4. No exact answer: 4 equations disagree on 3 weights
Show the answer

No exact answer: 4 equations disagree on 3 weights

With more equations than unknowns, the days usually contradict each other. The best you can do is the weights that miss by the least: a best fit, in lesson 101.

In PyTorch. The same fit in the real tool, with its loss. torch.linalg.solve takes the same two arguments as NumPy's. F.mse_loss is the loss from the model map: it squares each miss and averages them. torch.round(…, decimals=4) tidies float noise, like np.round.

import torch
import torch.nn.functional as F

days = torch.tensor([[20.0, 4, 1], [25, 2, 1], [30, 6, 1]])
rentals = torch.tensor([42.0, 46, 68])
w = torch.linalg.solve(days, rentals)
print(torch.round(w, decimals=4), round(F.mse_loss(days @ w, rentals).item(), 4))

four = torch.tensor([[20.0, 4, 1], [25, 2, 1], [30, 6, 1], [28, 5, 1]])
print(round(F.mse_loss(four @ w, torch.tensor([42.0, 46, 68, 62])).item(), 4))

The weights are 2, 3 and −10, the same as the NumPy cell printed, and the loss is 0: they fit all three days exactly. Add the fourth day and the same weights miss it by 1, so the loss over four days is 1² ÷ 4 = 0.25.

More examples than weights. Real data has thousands of days and a handful of weights, so no weights make the loss 0 and elimination would report "no solution". Models take the weights with the smallest loss instead, the least-squares fit of lesson 101. Training a neural network chases the same thing in a far bigger system, by small steps instead of elimination.

Drill

Fit, then test on a new day

Solve for w from the three days below, then set pred to its prediction for the new day (28, 5) and leftover to the actual 62 minus pred, both rounded to 6 places.

import numpy as np

days = np.array([[20, 4, 1], [25, 2, 1], [30, 6, 1]])
rentals = np.array([42, 46, 68])
w = np.zeros(3)
new_day = np.array([28, 5, 1])
pred = 0
leftover = 0
print(w, pred, leftover)
In the lesson, your code is checked as you write it.
In your own words
Why does a model with three weights usually miss some of a thousand examples?

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

Which is NOT a row move that keeps a system's solution?

  1. Add a number to one entry of a row
  2. Swap two rows
  3. Multiply a row by a nonzero number
  4. Add a multiple of one row to another

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