Math 2.0

Abstract harmonic analysis Amenability and invariant means Counterexample

Ol'shanskii's counterexample to the von Neumann conjecture

Builds on Tarski monster groupAmenable groupFree groupvon Neumann conjecture

Counterexample

Let pp be a large prime and let GG be a Tarski monster group for pp of the kind constructed by Ol'shanskii. So GG is infinite, and every subgroup of GG other than {1}\set{1} and GG is cyclic of order pp. Ol'shanskii proved in 1980 that such groups can be chosen not amenable. On the other hand, GG has no subgroup isomorphic to the free group F2F_2. So GG is a non-amenable group without free subgroups of rank 22, and the von Neumann conjecture fails.

Remarks

Why GG has no free subgroup: every element g≠1g \ne 1 of GG lies in a proper nontrivial subgroup, which is cyclic of order pp, so gp=1g^p = 1. A free group of rank 22 has elements of infinite order, so it cannot embed in GG. The non-amenability is the hard part; the proof uses Grigorchuk's cogrowth criterion, a form of Kesten's criterion.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Amenable group concept
  2. Free group concept
  3. Subgroup concept
  4. Tarski monster group object
  5. von Neumann conjecture conjecture
  6. Ol'shanskii's counterexample to the von Neumann conjecture counterexample

Further reading

  1. Web https://en.wikipedia.org/wiki/Von_Neumann_conjecture
About this page
TagXA7YE70A6P
URIm2://XA7YE70A6P
Kindcounterexample
WritingW0 stub
MSC43A07, 20F50, 20F65
UsesTarski monster group, Amenable group, Free group, von Neumann conjecture
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)
  • edge refutes or not_instance_of out (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.