Index Ai Academy
Foundation · Vectors and matrices

Matrices as movements of space

Stretches, flips, shears and rotations; columns as landing spots; chaining; a layer moving data.

About 42 minutes · Free lesson

What it covers6

Why it matters

So far a matrix has been a table, and multiplying by it a calculation. There's a second way to see it that makes much of linear algebra click: a matrix is a movement. Multiply every point of the plane by the same 2 × 2 matrix and the whole plane stretches, flips, slants or turns, with straight lines staying straight and the origin staying put. Read this way, a matrix's columns tell you at a glance what it does, two movements in a row are one matrix product, and a layer of a neural network is a movement of all its data at once, chosen during training so that the next step finds the data easier to sort.

What you'll be able to do

  • See a 2 × 2 matrix as a movement of the plane: a stretch, flip, shear or rotation
  • Read a matrix's columns as where the two unit arrows land, and write a rotation with cos θ and sin θ
  • Apply a matrix to many points at once, and chain two movements by multiplying their matrices
  • See a layer as a movement of the data that can make two groups easier to split, and move a batch of points with PyTorch's points @ M.T
Quick check
Have a guess before you start. The point (3, 1) is turned a quarter turn counterclockwise around the origin. Where does it land?
  1. (−3, −1)
  2. (3, −1)
  3. (1, 3)
  4. (−1, 3)
Show the answer

(−1, 3)

A quarter turn counterclockwise sends (x, y) to (−y, x): (3, 1) goes to (−1, 3).

The math: what a matrix does to the plane

Purpose. See what a matrix does, not just what it holds.

Multiply every point (x, y) by a 2 × 2 matrix and the whole plane moves. Four basic movements:

  • Stretch: [[2, 0], [0, 1]] doubles every x and keeps y, pulling the plane sideways.
  • Flip: [[1, 0], [0, −1]] keeps x and negates y, a mirror in the x-axis: (2, 3) goes to (2, −3).
  • Shear: [[1, 1], [0, 1]] adds y to x, slanting squares into parallelograms: (1, 2) goes to (3, 2).
  • Rotation: [[0, −1], [1, 0]] turns everything a quarter turn counterclockwise: (3, 1) goes to (−1, 3).

The origin never moves, since anything times (0, 0) is (0, 0), and straight lines stay straight.

Quick check
From lesson 55: what is [[1, 1], [0, 1]] times (1, 2)?
  1. (3, 2)
  2. (2, 3)
  3. (1, 3)
  4. (1, 2)
Show the answer

(3, 2)

Row 1: 1 + 2 = 3. Row 2: 0 + 2 = 2. The shear slid the point 2 to the right, by its height.

The picture. Here is that quarter turn applied to one point, worked as the matrix-vector product it is. The drawing shows the point (3, 1) as an arrow from the origin. Row 1 of R gives the new x: a dashed upright line that the moved point must sit on. Row 2 gives the new y, a dashed flat line, and the moved point is the arrow to where the two lines cross.

Try it now

Then set point p to 1, 0 and press Use these numbers: it lands on (0, 1), R's first column. And 0, 1 lands on (−1, 0), its second.

The columns are where the unit arrows land. Multiply a matrix by (1, 0) and you get its first column; by (0, 1), its second. So to read any 2 × 2 matrix, look at its columns: they're where the two unit arrows, the "right" arrow and the "up" arrow, end up. Every other point follows, because (x, y) is x of the first arrow plus y of the second.

Rotation by any angle. Turning the right arrow by θ lands it on (cos θ, sin θ), from lesson 43, and the up arrow on (−sin θ, cos θ). Those are the columns:

Rθ=(cos⁡θ−sin⁡θsin⁡θcos⁡θ)R_\theta = \begin{pmatrix} \cos\theta & -\sin\theta \\ \sin\theta & \cos\theta \end{pmatrix}

In plain words: to turn by θ, build the matrix from cos θ and sin θ like this. At θ = 90°, it's [[0, −1], [1, 0]].

Two movements in a row are one matrix product. First stretch with S, then rotate with R: the point p goes to R(Sp), which is (RS)p. So the combined movement is the single matrix RS, and the order matters (lesson 56): the matrix applied first sits on the right. Stretching x then rotating sends (1, 1) to (−1, 2); rotating then stretching x sends it to (−2, 1).

What a 2 × 2 matrix can't do: shift. Moving every point 3 right and 2 down would move the origin, and a matrix never moves the origin. The trick is to add a third coordinate fixed at 1: (4, 5) becomes (4, 5, 1), and the 3 × 3 matrix [[1, 0, 3], [0, 1, −2], [0, 0, 1]] sends it to (7, 3, 1). Lesson 109 uses the same trick to fold a neuron's bias into its weights.

Quick check
A matrix has columns (2, 0) and (0, 2). What does it do to the plane?
  1. Rotates by 90°
  2. Doubles x and leaves y alone
  3. Flips across the x-axis
  4. Doubles everything, in both directions
Show the answer

Doubles everything, in both directions

The right arrow lands on (2, 0) and the up arrow on (0, 2): both twice as long, same directions.

In your own words
In your own words: why are a matrix's columns enough to know what it does to every point?

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

In Python: move many points at once

Purpose. Apply a matrix to a whole shape, and chain movements with @.

Put the points side by side as the columns of a 2 × n matrix. One product moves them all:

import numpy as np

R = np.array([[0, -1],
              [1, 0]])
square = np.array([[0, 1, 1, 0],
                   [0, 0, 1, 1]])
print((R @ square).tolist())
It runs right here in your browser, with nothing to install.

The four corners of the unit square, (0, 0), (1, 0), (1, 1) and (0, 1), land on (0, 0), (0, 1), (−1, 1) and (−1, 0): the square has turned a quarter turn about the origin. Each column of the answer is one moved point.

Code flow. One product moved all four corners. To see that it's four matrix-vector products side by side, step through a loop that moves one corner at a time: square[:, c] is column c, one corner (lesson 53), and moved[:, c] = … writes the moved corner into column c of an array of 0s. Then compare with the single R @ square.

Chaining, and the order. Multiply the matrices first, applied-first on the right:

import numpy as np

S = np.array([[2, 0], [0, 1]])
R = np.array([[0, -1], [1, 0]])
p = np.array([1, 1])
print((R @ S @ p).tolist(), (S @ R @ p).tolist())

R @ S @ p stretches first, then rotates; S @ R @ p rotates first. The answers differ. A named mistake: writing the matrices in the order you do them, S @ R for "stretch then rotate". The one done first goes nearest the point, on the right.

Worked example

Worked example: rotate a shape by any angle

Build the rotation matrix for 30° and turn the three corners of a triangle with it.

import math
import numpy as np

def rotation(deg):
    t = math.radians(deg)
    return np.array([[math.cos(t), -math.sin(t)],
                     [math.sin(t), math.cos(t)]])

tri = np.array([[2, 0, 0],
                [0, 2, 0]])
print(np.round(rotation(30) @ tri, 3).tolist())
print(np.round(rotation(90) @ tri, 3).tolist())
print(math.cos(math.radians(90)))
In the lesson you can change this and run it.

rotation turns degrees into radians (lesson 42) and builds R_θ from cos and sin. The triangle's corners are its columns. At 30°, (2, 0) goes to (1.732, 1): two units along the 30° line. At 90° the matrix is [[0, −1], [1, 0]] up to float noise: the last line shows cos 90° as 6.123233995736766e-17, a tiny number instead of 0, which np.round tidies to 0.

Quick check
What does this print?
import numpy as np

F = np.array([[1, 0], [0, -1]])
H = np.array([[1, 1], [0, 1]])
p = np.array([2, 3])
print((H @ F @ p).tolist())
  1. [-1, 3]
  2. [2, -3]
  3. [-1, -3]
  4. [5, -3]
Show the answer

[-1, -3]

F acts first: (2, 3) becomes (2, −3). Then H adds y to x: (2 + (−3), −3) = (−1, −3).

Quick check
Two quarter turns in a row. What does this print?
import numpy as np

R = np.array([[0, -1], [1, 0]])
print((R @ R).tolist(), (R @ R @ np.array([2, 1])).tolist())
  1. [[0, 1], [-1, 0]] [1, -2]
  2. [[-1, 0], [0, -1]] [2, 1]
  3. [[1, 0], [0, 1]] [2, 1]
  4. [[-1, 0], [0, -1]] [-2, -1]
Show the answer

[[-1, 0], [0, -1]] [-2, -1]

Two quarter turns make a half turn, [[−1, 0], [0, −1]], which sends (2, 1) to (−2, −1).

Drill

Stretch, then turn

Fix the lines so combo is the single matrix for "stretch x by 3, then rotate a quarter turn", moved is the square's corners moved by it (as a list), and side_ok checks that the moved square's first side runs from (0, 0) to (0, 3).

import numpy as np

S = np.array([[3, 0], [0, 1]])
R = np.array([[0, -1], [1, 0]])
square = np.array([[0, 1, 1, 0],
                   [0, 0, 1, 1]])
combo = S @ R
moved = (combo * square).tolist()
side_ok = False
print(combo.tolist(), moved, side_ok)
In the lesson, your code is checked as you write it.
In your own words
Why does the matrix applied first go on the right in R @ S @ p?

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

In AI and ML: a layer moves the data

Purpose. A layer moves every data point at once, so that the next step can sort them.

A layer's weight matrix is a movement like these, applied to all the examples together. Training chooses the movement. A good one carries tangled groups to places where a simple rule splits them. Here two groups of three points sit on either side of the line y = x, so no rule on x alone can separate them:

M=(1−111)M(xy)=(x−yx+y)M = \begin{pmatrix} 1 & -1 \\ 1 & 1 \end{pmatrix} \qquad M \begin{pmatrix} x \\ y \end{pmatrix} = \begin{pmatrix} x - y \\ x + y \end{pmatrix}

In plain words: the new first coordinate is x − y, which is negative for every point above the line and positive for every point below it.

import numpy as np

A = np.array([[1, 2, 3], [2, 3, 4]])
B = np.array([[2, 3, 4], [1, 2, 3]])
M = np.array([[1, -1], [1, 1]])
print(A[0].tolist(), B[0].tolist())
print((M @ A).tolist())
print((M @ B).tolist())

Each group's points are the columns. Before the move, group A's x values (1, 2, 3) overlap group B's (2, 3, 4). After it, group A's new x is −1 for every point and group B's is 1, while the new y is 3, 5 and 7 in both: "is the new x below 0?" sorts them perfectly. The picture shows the move.

Quick check
Scaling features by diag(1, 0.1) is also a movement. What does it do to the plane?
  1. Flips it
  2. Squashes its height to a tenth
  3. Shifts it down by 0.1
  4. Rotates it slightly
Show the answer

Squashes its height to a tenth

The columns are (1, 0) and (0, 0.1): the right arrow stays, the up arrow shrinks to a tenth.

In PyTorch. Real data comes the other way around: one point per row, the way a batch holds one example per row (lesson 56). So the six points are the rows of a 6 × 2 tensor, points. Moving rows needs M turned around and on the right: points @ M.T does to each row what M @ p does to a column. That's exactly what nn.Linear(2, 2, bias=False) computes: a layer with 2 inputs, 2 outputs and no bias, here loaded with M.

import torch
import torch.nn as nn

M = torch.tensor([[1.0, -1.0], [1.0, 1.0]])
points = torch.tensor([[1.0, 2.0], [2.0, 3.0], [3.0, 4.0], [2.0, 1.0], [3.0, 2.0], [4.0, 3.0]])
moved = points @ M.T
print(moved[:, 0].tolist())

layer = nn.Linear(2, 2, bias=False)
with torch.no_grad():
    layer.weight.copy_(M)
print(torch.equal(layer(points), moved))

The new x column holds −1 for group A's three points and 1 for group B's, the numbers the NumPy cell printed, now as decimals. torch.equal says the layer gives exactly the same moved points: a layer's weights are a movement of the data.

Quick check
A batch of 50 points is the rows of P, a 50 × 2 tensor, and M is 2 × 2. Which line moves every point by M?
  1. P * M
  2. M.T @ P
  3. M @ P
  4. P @ M.T
Show the answer

P @ M.T

Each row p needs M p, and a row times Mᵀ gives exactly that: P @ M.T is 50 × 2, one moved point per row.

Why movements matter. One straight cut, like "is the new x below 0?", is all a single neuron can make. A layer first moves the data so that one cut is enough. Deep networks stack many such movements, with a bend between them (lesson 110), until even badly tangled groups come apart. Rescaling features, as in lesson 57, is the simplest movement of all: a diagonal one that makes every feature count about equally.

Drill

Did the move help?

Two groups of points are the columns of A and B. split_before should say whether every x of A is below every x of B, but its test is wrong: fix it. Then set newA and newB to each group's first coordinate after M, as lists, and split to the same test on them.

import numpy as np

A = np.array([[1, 3, 2], [3, 4, 5]])
B = np.array([[2, 4, 3], [0, 1, 1]])
M = np.array([[1, -1], [1, 1]])
split_before = min(A[0].tolist()) < max(B[0].tolist())
newA = A[0].tolist()
newB = B[0].tolist()
split = False
print(split_before, newA, newB, split)
In the lesson, your code is checked as you write it.
In your own words
A layer's movement made two groups easy to split. What did training have to find?

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

A matrix's first column is (0, 1) and its second is (−1, 0). What does it do?

  1. Rotates a quarter turn counterclockwise
  2. Flips everything across the x-axis
  3. Doubles everything
  4. Shears sideways

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