Index Ai Academy
Foundation · Vectors and matrices

Perpendicular directions: bases and coordinates

Orthonormal directions, coordinates as dot products, rebuilding a vector, and taking a direction out.

About 35 minutes · Free lesson

What it covers6

Why it matters

Every vector so far was written in the usual axes: (4, 3) means 4 along x and 3 along y. Any two perpendicular directions, each 1 long, can serve as axes instead, and the same arrow then gets new numbers, its coordinates along them. Reading each one takes a single dot product. This matters because SVD and PCA, later in this module, hand back perpendicular unit directions. And researchers who study what a model has learned often find an idea stored as a direction in its vectors: how much of the idea a word has is its coordinate along that direction. This lesson tests directions, reads coordinates, rebuilds vectors from them, and takes a direction out.

What you'll be able to do

  • Test a set of vectors for being orthonormal: each 1 long, every pair perpendicular
  • Find a vector's coordinates in an orthonormal basis with one dot product each, and rebuild the vector from them
  • Say why orthonormal directions keep lengths and angles, and why reading coordinates and rebuilding undo each other
  • Take one direction out of a vector, and read how much of a made-up idea each word vector holds, in NumPy and PyTorch
Quick check
Have a guess before you start. Turn your map so that its "east" points along the unit arrow (0.6, 0.8). How far east does the arrow (3, 4) reach now?
  1. 4
  2. 5
  3. 3
  4. 7
Show the answer

5

(3, 4) is 5 × (0.6, 0.8): it points exactly along the new east, so all of its length, 5, is eastward. As a dot product: 3 × 0.6 + 4 × 0.8 = 1.8 + 3.2 = 5.

The math: new axes from perpendicular directions

Purpose. Describe a vector by how far it reaches along directions you choose.

The usual axes point along e₁ = (1, 0) and e₂ = (0, 1). Writing v = (4, 3) means 4 steps along e₁ plus 3 along e₂:

v=4 e1+3 e2\mathbf{v} = 4\,\mathbf{e}_1 + 3\,\mathbf{e}_2

In plain words: a vector's numbers are amounts of the axis directions, added up.

A set of directions that builds every vector this way, each in exactly one way, is a basis (plural bases), and the amounts are the vector's coordinates in it. Any two directions that don't lie on one line make a basis of the plane. The usual axes have two extra properties: each is 1 long, and they meet at a right angle. Directions like that are orthonormal: "ortho" for right-angled, "normal" for length 1. Turn the usual axes and you get other orthonormal pairs, like q₁ = (0.6, 0.8) and q₂ = (−0.8, 0.6).

Quick check
From the last lesson: the shadow of v on b is v · b ÷ ‖b‖ long. How long is it when b is 1 unit long?
  1. 1
  2. ‖v‖
  3. v · b
  4. v · b ÷ 2
Show the answer

v · b

Dividing by ‖b‖ = 1 changes nothing, so the shadow is just v · b. That's why unit directions make every coordinate a single dot product.

Coordinates are shadows. The test for orthonormal, then the two formulas this lesson runs on:

qi⋅qi=1qi⋅qj=0    (i≠j)\mathbf{q}_i \cdot \mathbf{q}_i = 1 \qquad \mathbf{q}_i \cdot \mathbf{q}_j = 0 \;\; (i \ne j)
ci=v⋅qiv=∑ici qic_i = \mathbf{v} \cdot \mathbf{q}_i \qquad \mathbf{v} = \sum_i c_i\,\mathbf{q}_i

In plain words: each direction dotted with itself gives 1 (it's 1 long) and dotted with any other gives 0 (they're perpendicular). Then v's coordinate along each direction is one dot product: the length of its shadow on that direction's line. Each direction times its coordinate, all added, builds v back.

For q₁ = (0.6, 0.8) and q₂ = (−0.8, 0.6): q₁ · q₁ = 0.36 + 0.64 = 1, q₂ · q₂ = 0.64 + 0.36 = 1, and q₁ · q₂ = −0.48 + 0.48 = 0. They pass.

The picture. Step through v = (4, 3) in these turned axes. The drawing shows q₁ and q₂ as short arrows, with their lines dashed across the plane like a second pair of axes. The flow checks the two directions, drops v's shadow onto each line, then lays the two shadows tip to tail to rebuild v, and last compares the lengths.

Try it now

Then set directions q to 1, 1 and -1, 1 (one direction per line) and press Use these numbers. The two are perpendicular, but each is about 1.41 long, and the rebuild lands at (8, 6), twice v.

Why it works, and what it keeps. The two shadows meet at a right angle, so with v they make a right triangle, the flow's last picture. By Pythagoras, ‖v‖² = c₁² + c₂²: here 4.8² + 1.4² = 23.04 + 1.96 = 25 = 5². So the coordinates c = (4.8, −1.4) are exactly as long as v. Dot products are kept too, and so are angles, because a cosine is built from dot products and lengths. (4, 3) and (0, 5) have a cosine of 0.6, and so do their coordinates, (4.8, −1.4) and (4, 3), since (0, 5) · q₁ = 4 and (0, 5) · q₂ = 3. Turning the axes moves the numbers, never the arrows.

Quick check
Which pair of directions is orthonormal?
  1. (1, 1) and (−1, 1)
  2. (0, 1) and (−1, 0)
  3. (0.6, 0.8) and (0.8, 0.6)
  4. (1, 0) and (2, 0)
Show the answer

(0, 1) and (−1, 0)

(0, 1) · (0, 1) = 1, (−1, 0) · (−1, 0) = 1, and (0, 1) · (−1, 0) = 0: both 1 long, and perpendicular. They're the usual axes turned a quarter turn.

Reading undoes rebuilding. Rebuild v from its coordinates, then read its first coordinate back. Dot each piece of the rebuild with q₁ on its own: 4.8q₁ = (2.88, 3.84) gives 2.88 × 0.6 + 3.84 × 0.8 = 4.8, and −1.4q₂ = (1.12, −0.84) gives 1.12 × 0.6 + (−0.84) × 0.8 = 0. So the first coordinate comes back as exactly 4.8.

(c1q1+c2q2)⋅q1=c1 (q1⋅q1)+c2 (q2⋅q1)=c1×1+c2×0=c1(c_1\mathbf{q}_1 + c_2\mathbf{q}_2) \cdot \mathbf{q}_1 = c_1\,(\mathbf{q}_1 \cdot \mathbf{q}_1) + c_2\,(\mathbf{q}_2 \cdot \mathbf{q}_1) = c_1 \times 1 + c_2 \times 0 = c_1

In plain words: the 1 and the 0 are the orthonormal test. Because every direction passes it, reading the coordinates of a rebuilt vector gives back the coordinates you built it from, and rebuilding from the coordinates you read gives back v. Each job undoes the other.

You'll see this written as… From lesson 53 on, the directions stand side by side as the columns of one table, Q. The rebuild is written Qc, reading is written Qᵀv (Qᵀ, "Q transpose", is Q turned so the directions are its rows), and the orthonormal test is QᵀQ = I, the identity: 1s down the diagonal, 0s elsewhere. So for orthonormal columns, the transpose is the inverse. This lesson needs none of that: just dot products.

Quick check
In the basis q₁ = (0, 1), q₂ = (−1, 0), what are the coordinates of v = (2, 5)?
  1. (5, 2)
  2. (−2, 5)
  3. (2, 5)
  4. (5, −2)
Show the answer

(5, −2)

c₁ = (2, 5) · (0, 1) = 5 and c₂ = (2, 5) · (−1, 0) = −2. Check: 5 × (0, 1) + (−2) × (−1, 0) = (0, 5) + (2, 0) = (2, 5).

The named mistake: directions that aren't 1 long. (1, 1) and (−1, 1) are perpendicular, but each is √2 long, so each dot product comes out √2 times too big, and the rebuild multiplies by √2 again. It lands at twice v. Divide each direction by its length first (lesson 49).

Taking a direction out. Subtract v's part along a unit direction q, and what's left has no shadow on q at all:

v⊥=v−(v⋅q) q\mathbf{v}_{\perp} = \mathbf{v} - (\mathbf{v} \cdot \mathbf{q})\,\mathbf{q}

In plain words: find how far v reaches along q, step that far back along q, and you're left with the part of v that's perpendicular to q. The ⊥ sign means perpendicular.

For v = (4, 3) and q₁: 4.8 × (0.6, 0.8) = (2.88, 3.84), and (4, 3) − (2.88, 3.84) = (1.12, −0.84). That's exactly −1.4 × q₂, the other coordinate's part: in an orthonormal basis, taking one direction out leaves the others.

In your own words
In your own words: why does a unit direction make a coordinate just one dot product, and what goes wrong if a direction is 2 long?

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

In Python: coordinates, rebuilds and removals

Purpose. Check a basis, read coordinates, rebuild, and take a direction out, one dot product at a time.

The math part's numbers, one line each:

import numpy as np

v = np.array([4.0, 3.0])
q1 = np.array([0.6, 0.8])
q2 = np.array([-0.8, 0.6])
print(round(q1 @ q1, 6), round(q2 @ q2, 6), round(q1 @ q2, 6))
c1 = v @ q1
c2 = v @ q2
print(round(c1, 6), round(c2, 6))
print(np.round(c1 * q1 + c2 * q2, 6))

The checks print 1.0, 1.0 and 0.0, the coordinates 4.8 and −1.4, and the rebuild [4. 3.]: v again. The rounding hides float noise in the last digit, as in lesson 51.

Code flow. The same work as two loops: one reads the coordinates, one rebuilds. np.zeros(2) starts as two 0s. Step through and watch the boxes of c fill with 4.8 and −1.4, then rebuilt grow one direction at a time.

You'll see this written as one table. Code that works with many directions keeps them as the columns of one table, Q, and does each job in one line. You'll learn these lines properly in lesson 54 (.T, the transpose) and lesson 55 (@ between a table and a vector). For now, read them as shorthand for the loops you just stepped through: nothing later in this lesson needs them.

import numpy as np

Q = np.array([[0.6, 0.8], [-0.8, 0.6]]).T
v = np.array([4.0, 3.0])
print(np.round(Q.T @ Q, 6))
c = Q.T @ v
print(np.round(c, 6), np.round(Q @ c, 6))

Q.T @ Q is the table of every qᵢ · qⱼ: 1s and 0s. Q.T @ v is both coordinates, 4.8 and −1.4, and Q @ c is the rebuild, [4. 3.]: the stepper's numbers again.

Quick check
What does this print?
import numpy as np

v = np.array([2, 5])
q1 = np.array([0, 1])
q2 = np.array([-1, 0])
print(v @ q1, v @ q2)
  1. 5 -2
  2. 2 5
  3. -2 5
  4. 5 2
Show the answer

5 -2

v @ q1 = 2 × 0 + 5 × 1 = 5 and v @ q2 = 2 × (−1) + 5 × 0 = −2: the coordinates from the math part's check.

Lengths and angles, kept. Here are the math part's claims in code: v = (4, 3) and w = (0, 5), read in the turned axes, and their lengths and the cosine of the angle between them, before and after.

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

q1 = np.array([0.6, 0.8])
q2 = np.array([-0.8, 0.6])
v = np.array([4.0, 3.0])
w = np.array([0.0, 5.0])
cv = np.array([v @ q1, v @ q2])
cw = np.array([w @ q1, w @ q2])
print(np.round(cv, 6), np.round(cw, 6))
print(round(np.linalg.norm(v), 6), round(np.linalg.norm(cv), 6))
print(round(cosine(v, w), 3), round(cosine(cv, cw), 3))

w's coordinates are (4, 3), both lengths are 5.0, and the cosine is 0.6 both ways: the arrows didn't move, only the axes.

The named mistake, in code. (1, 1) and (−1, 1) are perpendicular, but each is √2 long:

import numpy as np

v = np.array([4.0, 3.0])
q1 = np.array([1.0, 1.0])
q2 = np.array([-1.0, 1.0])
c1 = v @ q1
c2 = v @ q2
print(c1, c2, c1 * q1 + c2 * q2)
q1 = q1 / np.linalg.norm(q1)
q2 = q2 / np.linalg.norm(q2)
print(np.round((v @ q1) * q1 + (v @ q2) * q2, 6))

The coordinates come out as 7.0 and −1.0, each √2 times too big, and the rebuild lands at [8. 6.], twice v. Dividing each direction by its length makes the pair orthonormal, and the rebuild is v again.

Worked example

Worked example: a basis in three dimensions

Three perpendicular unit directions in 3D, each a third of a whole-number arrow. Check them, read the coordinates of (6, 3, 0), rebuild it, and compare lengths.

import numpy as np

qs = [np.array([1.0, 2.0, 2.0]) / 3,
      np.array([2.0, 1.0, -2.0]) / 3,
      np.array([2.0, -2.0, 1.0]) / 3]
for i in range(3):
    print(round(qs[i] @ qs[0], 6), round(qs[i] @ qs[1], 6), round(qs[i] @ qs[2], 6))
v = np.array([6.0, 3.0, 0.0])
c = np.zeros(3)
rebuilt = np.zeros(3)
for i in range(3):
    c[i] = v @ qs[i]
    rebuilt = rebuilt + c[i] * qs[i]
print(np.round(c, 6), np.round(rebuilt, 6))
print(round(np.linalg.norm(v), 4), round(np.linalg.norm(c), 4))
In the lesson you can change this and run it.

The first three lines are the table of every qᵢ · qⱼ: 1s down the diagonal, 0s elsewhere. Each direction is 1 long, since (1 + 4 + 4) ÷ 9 = 1, and each pair is perpendicular. The coordinates are 4, 5 and 2, and the loop rebuilds (6, 3, 0). Both lengths are 6.7082, because 4² + 5² + 2² = 45 = 6² + 3² + 0²: Pythagoras with one more side. The code is the 2D code with a third direction, and it would be the same for three hundred.

Taking a direction out, in code. The math part's formula, one line, and a check that nothing of q is left: np.isclose(x, 0) says whether x is 0 apart from float noise.

import numpy as np

v = np.array([4.0, 3.0])
q = np.array([0.6, 0.8])
rest = v - (v @ q) * q
print(np.round(rest, 6), np.isclose(rest @ q, 0))

What's left is (1.12, −0.84), and its dot product with q is 0. Note the brackets: (v @ q) * q is a vector, how far v reaches along q times q. v - (v @ q) alone would subtract one number from every entry.

Quick check
What does this print?
import numpy as np

v = np.array([3.0, 4.0])
q = np.array([1.0, 0.0])
print(v - (v @ q) * q)
  1. [0. 4.]
  2. [0. 1.]
  3. [-0. 4.]
  4. [3. 0.]
Show the answer

[0. 4.]

v @ q = 3, so the line subtracts 3 × (1, 0) = (3, 0) and leaves (0, 4): taking out the across direction keeps only the up part.

Drill

Check a basis, read and rebuild

Fix the three functions. is_orthonormal(qs) should check that every direction is 1 long and every pair is perpendicular (allow 1e-9 of float noise). coords(v, qs) should give one dot product per direction, and rebuild(c, qs) the sum of each direction times its coordinate. There's one slip in each.

import numpy as np

def is_orthonormal(qs):
    for i in range(len(qs)):
        if abs(qs[i] @ qs[i] - 1) > 1e-9:
            return False
    return True

def coords(v, qs):
    c = np.zeros(len(qs))
    for i in range(len(qs)):
        c[i] = v @ qs[0]
    return c

def rebuild(c, qs):
    total = np.zeros(len(qs[0]))
    for i in range(len(qs)):
        total = total + c[i]
    return total

qs = [np.array([0.6, 0.8]), np.array([-0.8, 0.6])]
v = np.array([4.0, 3.0])
print(is_orthonormal(qs), coords(v, qs), rebuild(coords(v, qs), qs))
In the lesson, your code is checked as you write it.
In your own words
Your rebuild of (4, 3) came back exactly. What about the directions made sure it would, and what would you check first if a rebuild missed?

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

In AI and ML: an idea as a direction

Purpose. Read how much of an idea each word vector holds, then take the idea out.

Researchers who study what a model has learned, a field called interpretability, often find an idea stored as a direction in its vectors: a word holds the idea to the extent its vector reaches along that direction. That reach is this lesson's coordinate, one dot product with a unit direction.

Here are the camp log's six words from lesson 51, three numbers each, and a made-up "tent" direction: the shelter idea that tent and tarp share. A simple way to make such a direction is to add the vectors of words that have the idea and make the sum 1 long.

import numpy as np

names = ["tent", "tarp", "stove", "kettle", "map", "compass"]
vecs = [np.array([0.9, 0.1, 0.0]), np.array([0.8, 0.0, 0.2]), np.array([0.1, 0.9, 0.0]),
        np.array([0.0, 0.8, 0.1]), np.array([0.1, 0.0, 0.9]), np.array([0.0, 0.1, 0.8])]
t = vecs[0] + vecs[1]
t = t / np.linalg.norm(t)
print(np.round(t, 3))
for i in range(len(names)):
    print(names[i], round(vecs[i] @ t, 3))

t is (0.991, 0.058, 0.117): mostly the first number, shelter. tent holds the most of it, 0.898, then tarp, 0.816. The cooking words hold little: stove 0.152 and kettle 0.058.

Quick check
map scores 0.204 along the tent direction, more than stove's 0.152. Why?
  1. map is a kind of shelter, like a tent
  2. Dot products favor longer vectors
  3. 0.204 was rounded up from 0.152
  4. t picks up tarp's bit of finding the way
Show the answer

t picks up tarp's bit of finding the way

t is tent plus tarp, made 1 long, and tarp has 0.2 in its third number, finding the way. So t carries 0.117 there, and map's big third number, 0.9, picks that up. A made-up direction carries whatever its example words carry.

Taking the idea out. Remove t from every word with the math part's formula, then compare pairs of words by cosine before and after:

import numpy as np

def cosine(a, b):
    return (a @ b) / (np.linalg.norm(a) * np.linalg.norm(b))

vecs = [np.array([0.9, 0.1, 0.0]), np.array([0.8, 0.0, 0.2]), np.array([0.1, 0.9, 0.0]),
        np.array([0.0, 0.8, 0.1]), np.array([0.1, 0.0, 0.9]), np.array([0.0, 0.1, 0.8])]
t = (vecs[0] + vecs[1]) / np.linalg.norm(vecs[0] + vecs[1])
cleaned = []
for v in vecs:
    cleaned.append(v - (v @ t) * t)
print(round(cleaned[1] @ t, 6) == 0, np.round(cleaned[1], 3))
print(round(np.linalg.norm(vecs[0]), 3), round(np.linalg.norm(cleaned[0]), 3))
print(round(cosine(vecs[0], vecs[1]), 3), round(cosine(cleaned[0], cleaned[1]), 3))
print(round(cosine(vecs[2], vecs[3]), 3), round(cosine(cleaned[2], cleaned[3]), 3))

Nothing of t is left in tarp (True). Taking the idea out shrinks tent from 0.906 long to 0.115: the idea was nearly all of it. tent and tarp were 0.964 alike, and what's left of them scores −1.0, exactly opposite. That's no accident: t was built from these two words alone, so what's left of tent and what's left of tarp add up to nothing, and only how they differ remains. stove and kettle hardly change, 0.986 before and 0.991 after: taking one direction out leaves everything perpendicular to it alone.

Researchers use this move in two ways. To test whether a model relies on an idea, they take the idea's direction out of the model's vectors and see what the model now gets wrong. To strip an unwanted idea, such as gender, from words that shouldn't carry it, they take its direction out of those words' vectors: an early way to reduce bias in word vectors. One direction rarely holds all of an idea, though, so traces of it can stay in what's left.

Quick check
After the tent direction is taken out, tent and tarp score −1.0. Why exactly opposite?
  1. Any two short vectors have a cosine of −1
  2. Taking a direction out always turns words around
  3. t came from just these two, so their leftovers add to nothing
  4. tent and tarp pointed opposite ways from the start
Show the answer

t came from just these two, so their leftovers add to nothing

t points along tent + tarp. Take it out of both and the two leftovers add up to (tent + tarp) with its own direction taken out, which is nothing. Two arrows that add to nothing point exactly opposite ways.

In PyTorch. The same lines on tensors, with the six words as the rows of one table, as in lesson 51's search. F.normalize(..., dim=0) makes the tent direction 1 long, words @ t reads every word's amount at once (one dot product per row), and the removal line is the NumPy one. The last four lines meet a tool from lesson 63: torch.linalg.svd takes the table of words apart into three pieces, named here U, S and Vh. The rows of Vh are three directions in the words' own 3-number space, the kind PCA reads data along, and the last two lines give them this lesson's test. abs keeps float noise from printing as −0.0.

import torch
import torch.nn.functional as F

words = torch.tensor([[0.9, 0.1, 0.0], [0.8, 0.0, 0.2], [0.1, 0.9, 0.0],
                      [0.0, 0.8, 0.1], [0.1, 0.0, 0.9], [0.0, 0.1, 0.8]])
t = F.normalize(words[0] + words[1], dim=0)
print(torch.round(words @ t, decimals=3))
tarp = words[1] - (words[1] @ t) * t
print(round((tarp @ t).item(), 6) == 0)
U, S, Vh = torch.linalg.svd(words)
d1, d2, d3 = Vh[0], Vh[1], Vh[2]
print(round((d1 @ d1).item(), 4), round((d2 @ d2).item(), 4), round((d3 @ d3).item(), 4))
print(round(abs((d1 @ d2).item()), 4), round(abs((d1 @ d3).item()), 4), round(abs((d2 @ d3).item()), 4))

The amounts are the NumPy cell's numbers, 0.898 for tent down to 0.058 for kettle, and nothing of t is left in tarp. SVD's three directions pass the test: each is 1 long, and every pair is perpendicular. They're an orthonormal basis that SVD found from the words alone.

Drill

Take an idea out

Fix amount(v, t), how far v reaches along the direction t, and remove(v, t), v with that direction taken out. t may not be 1 long, so both must make it 1 long first. Then set cleaned to tarp with the tent direction removed.

import numpy as np

def amount(v, t):
    return v @ t

def remove(v, t):
    t = t / np.linalg.norm(t)
    return v - (v @ t)

tent = np.array([0.9, 0.1, 0.0])
tarp = np.array([0.8, 0.0, 0.2])
t = tent + tarp
cleaned = tarp
print(round(amount(tarp, t), 3), np.round(cleaned, 3))
In the lesson, your code is checked as you write it.
In your own words
Taking a direction out of every word vector removes one idea. What does it keep, and what can it lose by accident?

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

Goes deeper in

  • Eigenvectors (intuition): the directions a matrix only stretches, which come out orthonormal for symmetric matrices.
  • SVD and PCA: orthonormal directions ranked by how much of the data lies along each.
  • Interpretability: looking inside models, often by reading their vectors along directions.

Practice what you just read

  • 9 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 makes a set of directions orthonormal?

  1. Each is 1 long, and every pair is perpendicular
  2. Each is perpendicular to the vector you're reading
  3. Their numbers add up to 1
  4. Each number is between −1 and 1

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