Index Ai Academy
Foundation · Transposition of formulas

Rearranging inequalities: when the sign flips

The four moves on an inequality, negatives and reciprocals that flip it, logs below 1, and sample sizes.

About 35 minutes · Free lesson

What it covers6

Why it matters

Many questions ask "at least" or "at most", not "exactly": how many steps until the learning rate is small enough, or how many test examples keep an error bar under 2 points. Each is a formula set against a target. You rearrange it like an equation, with one extra job: keep track of which way the sign points. Most moves keep it. A few flip it, and this lesson names every one.

What you'll be able to do

  • Rearrange an inequality with the four moves, flipping the sign whenever you multiply or divide by a negative
  • Handle a letter of unknown sign by splitting into cases, or by using a known sign such as t > 0
  • Track the direction through reciprocals, squares, roots and logs, with the condition each one needs
  • Turn |x − a| < k into the range a − k < x < a + k, and round a boundary the right way to a whole number
  • Solve formula targets in training: steps until a decayed rate is small, a test-set size, clipping and a safe step size
Quick check
Have a guess before you start. 1/x < 1/4, and x is positive. Which x make it true?
  1. x < 4
  2. x > 4
  3. x < 1/4
  4. x > 1/4
Show the answer

x > 4

Try x = 8: 1/8 < 1/4 is true. Try x = 2: 1/2 < 1/4 is false. A bigger positive number has a smaller reciprocal, so taking 1 over both sides flips the sign: x > 4.

The math: rearrange, and track the direction

Purpose. Make a letter the subject of an inequality, and know at every step whether the sign stays or flips.

An inequality compares two sides with <, ≤, > or ≥. Transposing it, making a letter its subject, uses the same opposites as an equation. The four moves are adding, taking away, multiplying and dividing both sides by the same number:

Move on both sidesThe sign
add or take away any numberstays
multiply or divide by a positive numberstays
multiply or divide by a negative numberflips
multiply by 0not allowed: both sides become 0

Why the flip? Multiplying by −1 mirrors the number line around 0. So 3 < 5, but −3 > −5.

Take 7 − 2x ≥ 1. Take 7 from both sides: −2x ≥ −6. Divide by −2, a negative, so the sign flips: x ≤ 3.

Check it twice. Swap the sign for = to get the boundary, x = 3. Then test a number on each side. With x = 0: 7 ≥ 1 is true, and 0 ≤ 3. With x = 4: 7 − 8 = −1, and −1 ≥ 1 is false.

Quick check
From an earlier lesson: 2 < 5. Multiply both sides by −1. Which statement is true?
  1. −2 < −5
  2. −2 = −5
  3. 2 > 5
  4. −2 > −5
Show the answer

−2 > −5

−2 sits to the right of −5 on the number line, so it's bigger. Multiplying by a negative reverses the order, so < becomes >.

Watch the boundary of 7 − 2x ≥ 1 built from x = 3, then peeled back. The way back runs "− 7" then "÷ −2". Ask at each step: does this move keep the sign, or flip it?

Try it now

Change the × −2 to × 2 and press Use these numbers: the way back now divides by a positive, and nothing flips.

Symbols and formula. The two flipping rules, for numbers a < b:

c<0  ⇒  ca>cb,0<a<b  ⇒  1a>1bc < 0 \;\Rightarrow\; ca > cb, \qquad 0 < a < b \;\Rightarrow\; \frac{1}{a} > \frac{1}{b}

In plain words: multiplying by a negative flips the sign. Taking 1 over both sides flips it too, when both sides are positive.

A letter of unknown sign. In 12/t ≤ 3, you want to multiply by t. But is t positive or negative? Split into cases. If t > 0, the sign stays: 12 ≤ 3t, so t ≥ 4. If t < 0, it flips: 12 ≥ 3t, so t ≤ 4, and every negative t fits that. So 12/t ≤ 3 means t < 0 or t ≥ 4.

Often you know the sign already. A time, a count, a length or a speed is positive. Say so (t > 0), and you need only the first case: t ≥ 4. Never divide by a letter without knowing its sign.

Quick check
Solve 6/x > 2. Nothing is known about the sign of x.
  1. x > 3
  2. x < 3
  3. x < 0 or x > 3
  4. 0 < x < 3
Show the answer

0 < x < 3

Case x > 0: multiply by x, sign stays: 6 > 2x, so x < 3. Together: 0 < x < 3. Case x < 0: the sign flips, 6 < 2x, so x > 3, which can't happen when x < 0. Check x = 1: 6 > 2 is true.

Squares and roots keep the sign only when both sides are 0 or more. 3 < 5 gives 9 < 25. But −5 < 3 gives 25 > 9: squaring broke it. So square both sides only when both are ≥ 0, and take square roots on the same terms. With no sign known, x² < 9 means −3 < x < 3, both roots kept, as in lesson 33.

Logs keep the sign when the log's base is above 1, as for ln (base e) and log₁₀. ln is increasing: a bigger number has a bigger log. Both sides must be positive, or the log doesn't exist. So 2ⁿ ≥ 1000 gives n·ln 2 ≥ ln 1000, and n ≥ 9.97.

The trap comes next. Take 0.9ⁿ ≤ 0.5. Logs keep the sign: n·ln 0.9 ≤ ln 0.5. Now divide by ln 0.9. It's about −0.105, a negative, because 0.9 is below 1. So the sign flips:

n≥ln⁡0.5ln⁡0.9≈6.58n \ge \frac{\ln 0.5}{\ln 0.9} \approx 6.58

Check it: 0.9⁶ ≈ 0.531, still above 0.5, while 0.9⁷ ≈ 0.478 is below. So n ≥ 7 whole steps.

Quick check
Solve 0.8ⁿ < 0.1 for n.
  1. n < −10.32
  2. n < 10.32
  3. n > 10.32
  4. n > −10.32
Show the answer

n > 10.32

Take logs: n·ln 0.8 < ln 0.1. ln 0.8 ≈ −0.223 is negative, so dividing by it flips: n > ln 0.1/ln 0.8 ≈ 10.32. Check: 0.8¹¹ ≈ 0.086, below 0.1.

Distance inequalities. |x − a| means the distance from x to a. So |x − a| < k says x is less than k away from a, on either side:

∣x−a∣<k  ⟺  a−k<x<a+k|x - a| < k \iff a - k < x < a + k

A bolt must be 20 mm long, give or take 0.5 mm: |x − 20| ≤ 0.5 means 19.5 ≤ x ≤ 20.5. Backward, the range 19.5 ≤ x ≤ 20.5 has center 20 and half-width 0.5. With a three-part range, do each move to all three parts:

Named mistakes.

  • Dividing by a negative and keeping the sign.
  • Dividing by a letter whose sign you don't know.
  • Squaring both sides when one side might be negative.
  • Dividing by ln γ with γ below 1, and forgetting the flip.
  • Writing |x − 20| ≤ 0.5 as x ≤ 20.5, and losing the lower end.
In your own words
List the moves that flip an inequality, and say what each one needs to be true.

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

In Python: test both sides of the boundary

Purpose. Python can't rearrange for you, but it can catch a wrong direction in a second.

Write the original and your rearranged version as two functions that return True or False. Then test points on both sides of the boundary, and the boundary itself. They must agree everywhere.

def original(x):
    return 7 - 2 * x >= 1

def rearranged(x):
    return x <= 3

for x in [-10, 0, 2.9, 3, 3.1, 50]:
    print(x, original(x), rearranged(x))
It runs right here in your browser, with nothing to install.

Every row agrees. If you had kept the sign as x ≥ 3, every row but one would disagree. The boundary row, 3, can't tell the two apart: x ≤ 3 and x ≥ 3 both include it. Only points on either side can.

Whole numbers round by the direction. "At most" rounds down, with math.floor. "At least" rounds up, with math.ceil.

Python also checks the numbers from the math part: the boundaries, ln 0.9, and the powers on each side.

import math

print(round(math.log(1000) / math.log(2), 2), round(math.log(0.9), 3))
print(round(0.9 ** 6, 3), round(0.9 ** 7, 3))
print(round(math.log(0.1) / math.log(0.8), 2), round(0.8 ** 11, 3))
print(round(math.log(0.05) / math.log(0.6), 2))
Worked example

Worked example: a budget and a bouncing ball

Two whole-number answers from one boundary each: the most nights $100 buys at $15 plus $8 a night, and the first bounce at or below 0.1 m.

import math

def most_nights(budget, fee, nightly):
    return math.floor((budget - fee) / nightly)

def bounces_until(h0, ratio, low):
    return math.ceil(math.log(low / h0) / math.log(ratio))

n = most_nights(100, 15, 8)
b = bounces_until(2, 0.6, 0.1)
print(n, 15 + 8 * n, 15 + 8 * (n + 1))
print(b, round(2 * 0.6 ** b, 4), round(2 * 0.6 ** (b - 1), 4))
In the lesson you can change this and run it.

The budget is "at most", so it rounds down. 10 nights cost $95, and an 11th would make $103. The ball is "at least", because of the flip: ln(0.05) and ln 0.6 are both negative, the boundary is 5.86, and n ≥ 5.86 rounds up to 6. The second line checks it: 0.0933 m after 6 bounces, but still 0.1555 m after 5.

Quick check
What does this print?
import math

b = math.log(0.5) / math.log(0.9)
print(round(b, 2), 0.9 ** 6 <= 0.5, 0.9 ** 7 <= 0.5)
  1. 6.58 False True
  2. 6.58 True False
  3. 6.58 True True
  4. -6.58 False True
Show the answer

6.58 False True

Both logs are negative, so b ≈ 6.58 is positive. 0.9⁶ ≈ 0.531 is still above 0.5, and 0.9⁷ ≈ 0.478 is below. So 0.9ⁿ ≤ 0.5 needs n ≥ 6.58, the flipped direction.

Quick check
You rearranged an inequality and want to test it in Python. Which test can catch a missed flip?
  1. A point on each side of the boundary
  2. The boundary value on its own
  3. Printing the rearranged rule
  4. Rounding the boundary up
Show the answer

A point on each side of the boundary

x ≤ 3 and x ≥ 3 share the boundary 3, so only points on either side tell them apart.

Drill

Fix the direction slips

x_limit(c) should give the largest x with 7 − 2x ≥ c, and most_nights the most whole nights a budget buys. Each has one direction slip. Fix both.

import math

def x_limit(c):
    return (c - 7) / 2

def most_nights(budget, fee, nightly):
    return math.ceil((budget - fee) / nightly)

print(x_limit(1), most_nights(100, 15, 8))
In the lesson, your code is checked as you write it.
In your own words
Why can't checking only the boundary value catch a missed flip?

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

In AI and ML: schedules, test sets, clipping and safe steps

Purpose. Training and evaluation are planned with "at least" and "at most". Each plan is an inequality turned around.

Steps until a decayed learning rate is small. Many training runs multiply the learning rate (the size of each training step) by a factor γ below 1 every step: lr = lr₀γᵗ. When is lr₀γᵗ ≤ target?

  1. Divide by lr₀, which is positive: γᵗ ≤ target/lr₀. The sign stays.
  2. Take ln, which is increasing: t·ln γ ≤ ln(target/lr₀). The sign stays.
  3. Divide by ln γ, which is negative since γ < 1. The sign flips.

So t ≥ ln(target/lr₀)/ln γ. lesson 35 gave this formula; the flip is why it says "at least" and rounds up. With lr₀ = 0.1, γ = 0.95 and a target of 0.001, t ≥ ln 0.01/ln 0.95 ≈ 89.78, so 90 steps.

Quick check
A run starts at lr₀ = 0.2 and multiplies by γ = 0.9 each step. Which is right for lr₀γᵗ ≤ 0.002?
  1. t ≥ ln 0.002/ln 0.9
  2. t ≥ ln 0.01/ln 0.9
  3. t ≥ 0.01/0.9
  4. t ≤ ln 0.01/ln 0.9
Show the answer

t ≥ ln 0.01/ln 0.9

Divide by 0.2: 0.9ᵗ ≤ 0.01. Take logs: t·ln 0.9 ≤ ln 0.01. ln 0.9 is negative, so dividing flips: t ≥ ln 0.01/ln 0.9 ≈ 43.7, so 44 steps.

The test-set size for an error bar. An accuracy p, measured on n test examples, wobbles by about √(p(1 − p)/n). That's its standard error, which you'll meet properly in lesson 98. To keep it at or below a margin E:

  1. Both sides are 0 or more, so square: p(1 − p)/n ≤ E². The sign stays.
  2. Divide by p(1 − p), a positive number: 1/n ≤ E²/(p(1 − p)). The sign stays.
  3. Take 1 over both sides, both positive. The sign flips: n ≥ p(1 − p)/E².

An accuracy near 0.8, with an error bar of 0.02 (2 points), needs n ≥ 0.16/0.0004 = 400 test examples.

Gradient clipping. Training takes steps along a gradient g. A rare huge g can wreck a run, so it's often clipped to |g| ≤ c, which means −c ≤ g ≤ c (clipping by value). With c = 5, a gradient of 7.5 becomes 5 and −12 becomes −5.

A safe step size. A standard result, taken as given here: for a bowl-shaped loss whose curvature (how fast its slope changes) is at most L, gradient descent with step η settles when 0 < η < 2/L. You can see it in the simplest bowl, (L/2)w², where each step multiplies w by (1 − ηL). It shrinks while |1 − ηL| < 1, so −1 < 1 − ηL < 1. Take 1 away: −2 < −ηL < 0. Divide by −L (L > 0), flipping both signs: 0 < η < 2/L. With L = 4, any step between 0 and 0.5 is safe.

A float trap. An accuracy near 0.95 with a 1-point error bar needs n ≥ 0.0475/0.0001 = 475. Python computes 475.0000000000004, a hair over, and math.ceil makes it 476. So round off that dust before you round up or down: math.ceil(round(x, 9)).

import math

def steps_until(target, lr0, gamma):
    return math.ceil(math.log(target / lr0) / math.log(gamma))

def test_size(p, E):
    return math.ceil(round(p * (1 - p) / E ** 2, 9))

def clip(g, c):
    if g > c:
        return c
    if g < -c:
        return -c
    return g

def max_step(L):
    return 2 / L

print(round(math.log(0.01) / math.log(0.95), 2), steps_until(0.001, 0.1, 0.95))
print(round(math.log(0.01) / math.log(0.9), 2), steps_until(0.002, 0.2, 0.9))
print(test_size(0.8, 0.02), test_size(0.5, 0.05), test_size(0.95, 0.01))
p, E = 0.95, 0.01
print(p * (1 - p) / E ** 2, math.ceil(p * (1 - p) / E ** 2))
print(clip(7.5, 5), clip(-12, 5), clip(2, 5), max_step(4))
Quick check
What does this print?
import math

def test_size(p, E):
    return math.ceil(round(p * (1 - p) / E ** 2, 9))

print(test_size(0.5, 0.05), test_size(0.5, 0.025))
  1. 100 200
  2. 10 20
  3. 100 400
  4. 400 100
Show the answer

100 400

0.25/0.0025 = 100, and 0.25/0.000625 = 400. E is squared on the bottom, so halving the error bar needs four times the test examples.

Drill

Plan the run

steps_until rounds the wrong way, and test_size forgets a square. Fix both, so the first gives the first whole step with lr₀γᵗ ≤ target, and the second the fewest test examples for an error bar of at most E.

import math

def steps_until(target, lr0, gamma):
    return math.floor(math.log(target / lr0) / math.log(gamma))

def test_size(p, E):
    return math.ceil(round(p * (1 - p) / E, 9))

print(steps_until(0.001, 0.1, 0.95), test_size(0.8, 0.02))
In the lesson, your code is checked as you write it.
In your own words
Nothing in lr₀γᵗ ≤ target says "at least". Why does the answer for t say t ≥ …?

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

Goes deeper in

Practice what you just read

  • 4 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

Someone squares both sides of x < 3 to get x² < 9. When is that step safe?

  1. Only when x ≥ 0
  2. For every x
  3. Only when x ≤ 0
  4. Never

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.

Part of a free course 19 lessons

Transposition of Formulas: algebraic manipulation in every topic

Learn to make any letter of any formula the subject: layers undone in reverse order, fractions, a letter that appears twice, powers, roots, quadratics, logs, inequalities, trigonometry, vectors, matrices, calculus, probability, statistics and the formulas inside AI models, each checked in Python.

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