OctoInformBeta

Amenability, unitarizability, and strong Ulam stability

Let GG be a discrete group and HH a complex Hilbert space. A representation π\pi of GG on HH is uniformly bounded if |π|:=sup⁡g∈G∥π(g)∥<∞|\pi|:=\sup_{g\in G}\|\pi(g)\|<\infty. It is unitarizable if a bounded invertible operator SS on HH makes Sπ(g)S−1S\pi(g)S^{-1} unitary for every g∈Gg\in G. The group GG is unitarizable if every uniformly bounded representation of GG on every complex Hilbert space is unitarizable. The group GG is amenable if there is a positive linear functional m:ℓ∞(G)→ℂm:\ell^\infty(G)\to\mathbb C satisfying m(1)=1m(1)=1 and m(x↦f(g−1x))=m(f)m(x\mapsto f(g^{-1}x))=m(f) for every f∈ℓ∞(G)f\in\ell^\infty(G) and g∈Gg\in G. The unitarizability problem asks whether every unitarizable discrete group is amenable.

Pytlik and Szwarc constructed explicit uniformly bounded nonunitarizable representations of free groups. Osin constructed finitely generated nonunitarizable groups containing no nonabelian free subgroup.

The preprint proves that a discrete group is amenable if and only if it is unitarizable. For every nonamenable discrete group GG and every ε>0\varepsilon>0, the preprint constructs a nonunitarizable representation π\pi with |π|≤1+ε|\pi|\le1+\varepsilon. When GG is countable, the Hilbert space of this representation may be chosen separable. Beyond the Lean library, the preprint derives that these representations admit no bounded complex-linear unital algebra-homomorphism extension from the complex group algebra ℂ[G]\mathbb C[G] to either the full group C*C^*-algebra C*(G)C^*(G) or the reduced group C*C^*-algebra Cr*(G)C_r^*(G).

The results on these pages are those of the Lean library Unitarizability, each stated as in the Lean library and linked to its Lean declaration. Lean has checked every result of the Lean library, so the Lean library is the reference. Where the preprint states a result differently, the page gives the Lean library’s statement beside the preprint’s statement. The preprint is a guide only, giving the results their order and their names.

The Lean library: Unitarizability

Unitarizability is a Lean library: 18 items, in five groups. Each has a page written by OctoInform, listed below.

Section 1. Introduction 3 items
  1. Section 1: amenability and unitarizability Means and similarities define amenability and unitarizability.
  2. Theorem 1.1 Amenability characterizes unitarizable discrete groups.
  3. Section 1: bounded operator cocycles and triangular representations Unitarizing triangular representations makes cocycles inner.
Section 2. An invariant-kernel obstruction 3 items
  1. Section 2: fibre-valued translations, blocks, rows, columns and energy Translation invariance makes blocks depend on differences.
  2. Lemma 2.1 Row and column bounds constrain the commutant distance.
  3. Proposition 2.2 An invariant kernel obstruction to unitarizability.
Section 3. Sparse assignments from nonamenability 3 items
  1. Section 3: regular averages, product labels and endpoint loads Regular translations and labelled endpoint loads.
  2. Lemma 3.1 Nonamenability supplies contracting regular averages.
  3. Proposition 3.2 Convolution bounds yield sparse endpoint assignments.
Section 4. Finite-dimensional weights and sparse block operators 7 items
  1. Section 4: synthesis operators and frame parameters Synthesis bounds for small vector subfamilies.
  2. Lemma 4.1 Unit vectors with controlled subfamily synthesis.
  3. Section 4.1: rank-one weighted masked operators Finite rank-one weights give bounded masked operators.
  4. Lemma 4.2 Synthesis bounds control masked operators.
  5. Section 4.2: operators associated to an endpoint assignment Endpoint assignments determine masked operators.
  6. Corollary 4.3 Sparse assignments control rows and columns.
  7. Proposition 4.4 Sparse operators have bounded translation differences.
Section 5. Proof of the main theorem 2 items
  1. Section 5: dimension ratio, collision energy and rescaling Energy growth and rescaling obstruct unitarizability.
  2. Section 5: the amenable direction Amenable groups admit unitarizing similarities.

No item matches.