Concept

Kernel

The set of inputs a linear map sends to nothing, which is a subspace of the space it started from. Its dimension is the nullity, and it plus the rank is the dimension of the source — so what a map destroys and what it keeps always add to what it was given.

Named by 5 essays across 2 fields — each of them below, with the objects they name alongside it.

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.

algebra · Linear maps

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.

algebra · Linear maps

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.

algebra · Linear maps

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.

algebra · Linear maps

A Lights Out board and the presses that clear it. A 5 by 5 board with 11 lights on, cleared by 7 presses; it has four solutions in all.

The boards on which every light goes out

In Lights Out, pressing a light toggles it and its neighbours, and the goal is to turn every light off. Over the field with two elements the puzzle is a system of linear equations, and whether every pattern can be cleared depends only on whether one matrix is invertible. On a 3 × 3 board it is; on 5 × 5 a quarter of patterns can be cleared; on 39 × 39 one in four billion. Which sizes fail is decided by a common factor of two polynomials.

computation · Finite fields

Named alongside it

The objects these essays reach for when they reach for this one.

Rank Matrix Basis Dimension Image Linearity Nullity Boundary Chebyshev polynomial Counting two ways Determinant Euler characteristic

All concepts