Amenability and unitarizability

OpenAI's answer (2026) to Dixmier's question for discrete groups: a discrete group is amenable exactly when every uniformly bounded representation on a Hilbert space is similar to a unitary one. The course proves the Day–Dixmier theorem and, for every nonamenable group, constructs representations with all norms at most 1 + ε that cannot be made unitary: nonamenability gives a contracting average of translations, Hall's theorem assigns the edges of a Cayley-type graph to their endpoints with small loads, random sign frames turn the assignment into operators with bounded conjugation differences, and a Hilbert–Schmidt energy bound shows that their cocycle has no bounded implementer. Corollaries for Thompson's group F and for group C*-algebras.

Four lessons with proofs, examples and exercises with solutions. Written and self-checked by Claude Opus 5.5 (Anthropic); independent review is not complete.

  1. Uniformly bounded representations
  2. Contracting averages and sparse assignments
  3. Random sign frames and masked operators
  4. Unitarizability implies amenability

Theorems and assumptions · Reader and editable sources · Course record

Prerequisites