OctoInformBeta

Thompson's group F is nonamenable

Thompson’s group FF is the discrete group of increasing piecewise linear homeomorphisms of [0,1][0,1] with finitely many pieces, dyadic rational breakpoints and slopes in 2ℤ2^{\mathbb{Z}}, with multiplication hg=h∘ghg=h\circ g. A discrete group GG is amenable if there is a positive linear functional M:ℓ∞(G;ℝ)→ℝM:\ell^\infty(G;\mathbb{R})\to\mathbb{R} such that M(1)=1M(1)=1 and M(g↦φ(hg))=M(φ)M(g\mapsto\varphi(hg))=M(\varphi) for every h∈Gh\in G and every bounded real-valued function φ\varphi on GG. The amenability question for FF asks whether such a mean exists.

The preprint proves that FF is nonamenable. Beyond the results of the Lean library, the preprint derives that, for every ε>0\varepsilon>0, there exist a separable complex Hilbert space HH and a representation π:F→GL(H)\pi:F\to\mathrm{GL}(H) with sup⁡g∈F∥π(g)∥≤1+ε\sup_{g\in F}\|\pi(g)\|\leq1+\varepsilon for which no bounded invertible operator S:H→HS:H\to H makes every Sπ(g)S−1S\pi(g)S^{-1} unitary.

Lean has checked every result of the Lean library, so the Lean library is the reference for the results on these pages. Each result is stated as in the Lean library and linked to its Lean declaration. Where the preprint states a result differently, its statement is given beside the Lean library’s statement. The Lean library proves the existence of a Lipschitz self-map of a real Hilbert unit ball that moves every point by a distance of at least 1/21/2. The preprint is a guide only to the order and names of the results.

The Lean library: Thompson

Thompson is a Lean library: 22 items, in three groups. Each has a page written by OctoInform, listed below.

§1. Introduction 4 items
  1. §1 (setting): Thompson's group and invariant means Thompson’s group and invariant means.
  2. §1 (displayed): the forward Følner implication Invariant means yield finite Følner sets.
  3. Theorem 1.1 Thompson’s group admits no invariant mean.
  4. Lemma 1.2 Uniform displacement on a Hilbert ball.
§2. Recursive colors and finite averages 12 items
  1. §2.1 (setting): basic intervals, partitions and normalized restriction Dyadic subdivisions at a chosen scale.
  2. §2.1 (displayed): composition of restrictions, equation (2.1) Normalized restrictions compose through affine charts.
  3. Lemma 2.1 Uniform dyadic grids eventually have basic images.
  4. §2.1 (setting): internal intervals and affine transport Internal intervals and affine transport.
  5. Lemma 2.2 Separated internal pairs admit affine transport.
  6. §2.1 (displayed): exact covariance, equation (2.2) Normalized restrictions under affine interval transport.
  7. §2.2 (setting): the recursive coloring Coloring partitions by recursive restriction.
  8. §2.2 (setting): parents, descendants and globally defined colors Recursive colors at admissible group elements.
  9. §2.3 (setting): the fixed transport set and boundary defect Fixed transports and a common dyadic level.
  10. §2.3 (displayed): finite translation and correlation comparisons Boundary bounds for finite color averages.
  11. Proposition 2.3 A fixed finite set forces boundary expansion.
  12. §2.3 (proof of Proposition 2.3): variance and displacement Variance and displacement constrain finite correlations.
Appendix A. An explicit map with positive displacement 6 items
  1. A (setting): the concrete Hilbert ball A concrete ball of square-integrable functions.
  2. Proposition A.1 A Lipschitz map with positive displacement.
  3. A (setting): the radial oscillating curve Radial motion along a Hilbert space oscillator.
  4. Lemma A.2 The oscillating curve has a tubular neighborhood.
  5. Lemma A.3 Lipschitz tangent rotations for an explicit curve.
  6. A (proof of Proposition A.1): correction and normalization A correction bounded away from zero.

No item matches.