algebra20

Lattice Zoo

T₄ — the Tamari lattice on four leaves

PureMath + AI non-modularsemidistributiveassociahedron

Contributed by Tom Hanika

((ab)c)d(a(bc))d(ab)(cd)a((bc)d)a(b(cd))

The Tamari lattice T4T_4 — using the convention that the subscript counts leaves — has five elements: the five rooted binary trees with four leaves, or equivalently the five ways to parenthesise the product abcda \cdot b \cdot c \cdot d. The cover relation is a single right rotation at some internal node:

((xy)z)    (x(yz)).((x \cdot y) \cdot z) \;\longmapsto\; (x \cdot (y \cdot z)).

As a lattice, T4T_4 on five elements is isomorphic to the pentagon N5N_5 — an instructive coincidence at the smallest non-trivial size. What distinguishes T4T_4 as an object of study is not its small incarnation but the family it belongs to: the Tamari lattices TnT_n are the 1-skeleta of the associahedra, polytopes that organise the combinatorics of associativity, and they reappear throughout algebraic topology, category theory, and the theory of cluster algebras.

Where it appears

  • The 1-skeleton of the Stasheff associahedron Kn+1K_{n+1} is the Hasse diagram of TnT_n (leaves convention).
  • Right rotations on binary trees show up in self-balancing search trees; the Tamari order makes that informal “rotate to the right” notion into a partial order.
  • In categorical algebra, coherence morphisms for an associative operation are organised by the associahedron — so TnT_n is the smallest combinatorial witness of “associativity up to homotopy.”

A larger Tamari lattice, T5T_5 on fourteen elements, is the 3-dimensional associahedron K5K_5; we draw the smaller cousin here for clarity.