Depth

Series — page 5

A field says what an essay is about. A series follows one idea essay by essay — from the question that introduces it to the one that assumes all the others.
The directions the map leaves alone. Unit vectors and their images under the map. On the two marked lines the image points the same way as the original, stretched by 3.00 and 1.00.

Eigenvectors

  1. 1 The directions a map leaves alone
  2. 2 The polynomial whose roots are the stretches
  3. 3 The same map in a better basis
  4. 4 Symmetry forces a right angle
  5. 5 What a map does to a circle
  6. +3 more
8 essays · algebra
Euclid's algorithm on a 34 by 13 rectangle. The rectangle is tiled by peeling off the largest square that fits, again and again, until nothing is left.

Euclidean algorithm

  1. 1 The oldest algorithm, drawn as a tiling
  2. 2 A fraction that never closes
  3. 3 The player who meets the first long run
  4. 4 The remainders that count the roots
  5. 5 What the signs allow
  6. +3 more
8 essays · geometry
The tower ℚ ⊂ ℚ(√2) ⊂ ℚ(√2, √3). A tower of field extensions with the degree of each step, beside the multiplication table of the basis.

Field extensions

  1. 1 A tower whose degrees multiply
  2. 2 Seven powers in a space of six
  3. 3 The integers a field contains
  4. 4 How a polynomial breaks modulo the primes
  5. 5 Units that form a lattice
  6. +3 more
8 essays · algebra
The subgroups of a polynomial's symmetries, against the fields they name. Two lattices side by side, one of the subgroups of the symmetry group of the cube roots of two and the other of the fields between the rationals and the splitting field, drawn so that one is the other turned upside down.

Galois correspondence

  1. 1 The lattice that runs the other way
  2. 2 The group that will not come apart
  3. 3 Three ways to pair four roots
  4. 4 The quintics that have a formula
  5. 5 Three real roots and no real radicals
  6. +3 more
8 essays · algebra
A square cut into 7 pieces and a remainder. A square divided by cutting off a fixed fraction of what is left, over and over, so that the pieces are the terms of a geometric series and the uncut corner is the tail.

Geometric series

  1. 1 The sum that fits in one square
  2. 2 The series everything else is measured against
  3. 3 The repair at the boundary
  4. 4 A geometric series whose ratio is a matrix
  5. 5 A series that converges to minus one
  6. +3 more
8 essays · analysis
A wheel of 5 rim regions needs 4 colours. A hub touching 5 rim regions arranged in a ring. The rim is odd, so the whole map needs 4 colours and no fewer.

Graph colouring

  1. 1 Four colours, and a proof nobody can read
  2. 2 Five colours, and a chain that can be followed
  3. 3 Counting the colourings
  4. 4 Seven regions on a doughnut
  5. 5 The order decides the colours
  6. +3 more
8 essays · discrete
A closed walk on the 3-cube changing one place at a time. The corners of a 3-dimensional cube with a path through every one of them exactly once, each step moving along an edge, and the last corner one step from the first.

Hamiltonian cycles

  1. 1 A walk that changes one thing at a time
  2. 2 Every place changes back
  3. 3 The walk through the middle levels
  4. 4 The symmetric graphs no tour can close
  5. 5 Half the neighbours forces a tour
  6. +3 more
8 essays · discrete
The dot product as a shadow. Two vectors and the shadow the first casts on the second. The shadow is 2.425 long and b is 4.123, so the dot product is 10.000.

Inner product

  1. 1 The dot product is a shadow
  2. 2 The square that cannot be negative
  3. 3 One subtraction clears a direction
  4. 4 The nearest point of a flat thing
  5. 5 Moving a map across a product
  6. +3 more
8 essays · algebra
A linear map redrawing the plane. The integer grid before and after a linear transformation; the shaded unit square becomes a parallelogram whose area is the determinant.

Linear maps

  1. 1 A matrix is a picture of what happens to the grid
  2. 2 What a map throws away
  3. 3 Counted across and counted down
  4. 4 The cycles and the cuts
  5. 5 Two graphs the eigenvalues cannot tell apart
  6. +3 more
8 essays · algebra
A rule for moving between 3 states. 3 states drawn as circles with an arrow for every move the rule allows, labelled with its chance; a dashed loop is the chance of staying put.

Markov chains

  1. 1 The rule that forgets where it came from
  2. 2 The chain that stops
  3. 3 The chain that runs the same backwards
  4. 4 The time spent and the share held
  5. 5 Where the shares have nowhere to go
  6. +3 more
8 essays · probability
The rotation number against the parameter at K = 1. The measured rotation number of a circle map plotted against its parameter, forming a staircase that is flat over an interval at each simple rational.

Mode locking

  1. 1 The staircase that is flat almost everywhere
  2. 2 How a lock comes apart
  3. 3 A rotation in different coordinates
  4. 4 A whole interval of speeds
  5. 5 The last circle to break
  6. +3 more
8 essays · dynamics
A line, a point, and many parallels. A disc whose lines are arcs meeting the boundary at right angles, showing several lines through one point that never meet a given line.

Models

  1. 1 Two worlds that both obey the rules
  2. 2 An infinite tree has an infinite path
  3. 3 A number larger than every number
  4. 4 A countable field that passes for the line
  5. 5 Two lists that are one order
  6. +3 more
8 essays · logic
The basins of Newton's method on z³ = 1. The complex plane coloured by which cube root of one Newton's method converges to from each starting point.

Newton basins

  1. 1 Where Newton's method goes instead
  2. 2 An area that never finishes
  3. 3 Covering rather than avoiding
  4. 4 A double root halves the error instead of squaring it
  5. 5 A cubic method that is Newton's in disguise
  6. +3 more
8 essays · dynamics
The nine-point grid, and the lines they force. 9 points with all 20 of their connecting lines drawn. The 12 carrying exactly two points are drawn solid and the rest faintly; the count is computed from the coordinates rather than read off the drawing.

Ordinary lines

  1. 1 The line with only two points on it
  2. 2 Three ordinary lines from a count
  3. 3 The fewest ordinary lines a polygon allows
  4. 4 At least as many lines as points
  5. 5 Rows of three, planted on a cubic
  6. +3 more
8 essays · geometry
Whole-number points on x² − 2y² = 1. The branch of the hyperbola x² − 2y² = 1 in the first quadrant, with the whole-number points on it marked and labelled, and the lattice drawn faintly behind.

Pell

  1. 1 One solution that makes all the others
  2. 2 A method that is allowed to miss
  3. 3 Why the expansion has to repeat
  4. 4 Two families of solutions, and a box that holds both
  5. 5 Sixty needs two digits and sixty-one needs ten
  6. +3 more
8 essays · number
The permutation (1 3 4 2) drawn as 4 strings, crossing 3 times. A permutation drawn as strings running from a row of numbered pegs to another, with every place two strings cross marked, and the crossing count checked against the number of pairs that are out of order.

Permutation parity

  1. 1 The crossings that will not come out even
  2. 2 The only bit that survives
  3. 3 The puzzle that is exactly half solvable
  4. 4 When the label may be a matrix
  5. 5 Thirty-one moves from solved
  6. +3 more
8 essays · algebra
j is one more than i, counting round — as a grid, with both quantifier readings. A grid of marks for a relation, with the row and column facts the two quantifier orders ask about.

Quantifiers

  1. 1 Every row, or one column
  2. 2 Six sentences from two quantifiers
  3. 3 A quantifier is a shadow
  4. 4 Arithmetic with addition alone
  5. 5 A machine that carries one bit
  6. +3 more
8 essays · logic
The quaternion multiplication table, from i² = j² = k² = ijk = −1. A four-by-four multiplication table of the quaternion units, with the row giving the left factor, every entry computed from Hamilton's rule, and the pair that differs between the two orders marked.

Quaternions

  1. 1 A multiplication that remembers the order
  2. 2 A rotation of four-space takes two of them
  3. 3 The identity that multiplies sums of squares
  4. 4 The integers among the quaternions
  5. 5 What is lost at eight
  6. +3 more
8 essays · algebra
Six people, and the trio that cannot be avoided. The fifteen pairs among six people, coloured at random. Whatever the colouring, three people are all mutual acquaintances or all mutual strangers — here 1, 2, 5.

Ramsey theory

  1. 1 Six people at a party
  2. 2 Eighteen people, and the seventeen that escape
  3. 3 The colouring nobody has ever seen
  4. 4 Three in a row on the number line
  5. 5 The sequence that cannot avoid a staircase
  6. +3 more
8 essays · discrete
A resolution refutation of four clauses on three variables. A derivation tree: the given clauses at the top, each later clause obtained by cancelling one variable between two clauses above it, ending in the empty clause.

Resolution

  1. 1 A proof with one rule
  2. 2 Two literals make an arrow
  3. 3 A failed search is a proof
  4. 4 A contradiction that is only a sum
  5. 5 Two terms made equal, and no more
  6. +3 more
8 essays · logic

All essays