Concept

Word metric

The distance between two group elements, counted as the fewest generators needed to get from one to the other. It turns a group into a geometric object whose large-scale features — growth, the shape of balls, the size of their boundaries — do not depend on the generators chosen.

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

The dihedral group of a 4-sided shape, drawn as a map. A Cayley graph: one dot per motion of the shape, with one arrow per generator, so that multiplying by a generator is following an arrow of that colour.

The group drawn as a map

A multiplication table says everything about a group and shows nothing; lay the same information out as one dot per element and one arrow per generator, and multiplying becomes walking, distance becomes a word length, and the group acquires a shape.

algebra · Cayley graph
The ball around the identity, in 3 groups. A table of the number of group elements within each distance of the identity, one row per group, with the growth type each row exhibits beside it.

How fast the ball fills

Count the elements within r steps of doing nothing. The count grows like a polynomial in some groups and like a power of three in others, the distinction survives every change of generating set, and which polynomial degrees are possible is a theorem nobody expected.

algebra · Cayley graph
The share of a ball that is its own edge. A plot of the proportion of each ball formed by its outermost shell against the radius, one line per group — falling towards nothing for the lattice groups and holding steady for the free group.

The edge that is as big as the ball

In a lattice the boundary of a large ball is a negligible fraction of it. In a tree it is two thirds of it at every size — and that single ratio, not the group's size, is what decides whether a set can be cut into pieces and reassembled into two copies of itself.

algebra · Cayley graph
The free group on two generators with its middle removed: 4 pieces. The Cayley graph of the free group on two generators, with the elements within 0 steps of the identity greyed out and the remaining elements coloured by which connected piece they fall in.

What is left when the middle is taken out

Cut a finite piece out of a group's picture and count the parts of what remains that run off forever. The integers leave two, the plane one, a tree more with every cut — and no group anywhere leaves exactly three, because a third end is always the first of infinitely many.

algebra · Cayley graph
One lattice, 3 generating sets, 3 shapes of ball. Lattice points reached within a fixed number of steps in the integers squared, for one step along either axis, axis steps and one diagonal, a king's moves, each drawn inside the polygon spanned by its steps and scaled by the radius.

The polygon a lattice becomes from far away

Walk the grid of whole-number points with a fixed set of moves and the places reachable in r moves fill a shape. With axis steps it is a diamond, add a diagonal and it is a hexagon, move like a knight and it is a ragged thing full of holes — which, seen from far enough away, is an octagon exactly. The generators decide the polygon, and the polygon decides the count.

algebra · Cayley graph

Named alongside it

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

Cayley graphGrowth rateFree groupGroup actionInvariantCyclic groupEnds of a groupGenerating setQuasi isometryAxiom of choiceConnectednessConvex hull

All concepts