Series

Linear maps — the series

7 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. 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.

    A matrix is a picture of what happens to the grid

    Four numbers in a box is not an object anyone has intuitions about. The same four numbers, shown as an instruction for redrawing the plane, are.

    part 1 · algebra
  2. A whole line arrives at the origin. A linear map whose determinant is zero, drawn before and after. One line of the plane is sent to the origin and the whole plane is sent onto another line; the dimension lost and the dimension kept add to two.

    What a map throws away

    A linear map redraws the grid, and the determinant measures how much it stretches area. When that measurement comes out zero the map has flattened the plane onto a line — and the question worth asking is not how much was lost but how much survived, because the two always add to what there was.

    part 2 · algebra
  3. 2 independent rows and 2 independent columns. An array of 3 rows and 4 columns beside its transpose, with the independent rows of each shaded, showing the same count on both.

    Counted across and counted down

    A rectangular array has a number of independent rows and a number of independent columns. The two are counted in different spaces, from different objects, by computations that share nothing — and they are always the same number, which is why 'rank' is one word.

    part 3 · algebra
  4. 2 independent cycles and 3 independent cuts, on 5 edges. A small graph beside its incidence matrix, with the matrix's rank and nullity given and shown to be the number of independent cuts and the number of independent cycles.

    The cycles and the cuts

    The count that splits a map's source into what dies and what survives has nothing to do with graphs. Apply it to a matrix built from a graph's edges and points and it says that a graph's independent cycles and its independent cuts add to its number of edges — a theorem about drawings, obtained from an array.

    part 4 · algebra
  5. Two different graphs with the same adjacency matrix eigenvalues. a star with four arms: adjacency matrix eigenvalues 2, 0³, −2; a square and a lone point: adjacency matrix eigenvalues 2, 0³, −2. The characteristic polynomials are identical.

    Two graphs the eigenvalues cannot tell apart

    A graph's matrix has eigenvalues, and they count a surprising amount of the drawing: its edges, its triangles, every closed walk of every length. They do not count everything. A star with four arms and a square beside a lone point have the same eigenvalues exactly, although one of them is in two pieces — and on six points ten of the 156 graphs have a twin of this kind.

    part 5 · algebra
  6. A loop that is a hole, and the same loop filled in. a hollow triangle: 3 points, 3 edges, 0 triangles; holes in each dimension 1, 1, 0; a filled triangle: 3 points, 3 edges, 1 triangles; holes in each dimension 1, 0, 0.

    A hole is a cycle that bounds nothing

    A hollow triangle and a filled one have the same three edges and the same loop round them. In one the loop is the edge of something and in the other it is not, and that difference — a cycle that is not a boundary — is what a hole is. Counting holes is rank and nullity applied twice, and the Euler characteristic is what is left when the two applications cancel.

    part 6 · algebra
  7. Every magic square of order three is a point in a space of three. Basis J, U = (1,-1,0,-1,0,1,0,1,-1), V = (0,-1,1,1,0,-1,-1,1,0); Lo Shu = 5J − 3U + V; dimension of the order-3 magic space 3.

    The magic squares are a space

    A magic square is a grid whose rows, columns and diagonals share one sum. The conditions are linear, so the squares form a space: three-dimensional for order three, eight-dimensional for order four, n² − 2n in general. Inside the space of order three the eight classical squares are eight points with coordinates ±1 and ±3. Of the 880 squares of order four, 640 are singular matrices, and the search finds the reason: a symmetry of the rows and columns that carries every number to the one it adds to seventeen with.

    part 7 · algebra

All series