Log in

A measurable-group-theoretic solution to von Neumann’s problem

  • Published:
Inventiones mathematicae Aims and scope

Abstract

We give a positive answer, in the measurable-group-theory context, to von Neumann’s problem of knowing whether a non-amenable countable discrete group contains a non-cyclic free subgroup. We also get an embedding result of the free-group von Neumann factor into restricted wreath product factors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Germany)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Benjamini, I., Schramm, O.: Percolation beyond Z d, many questions and a few answers. Electron. Commun. Probab. 1(8), 71–82 (1996) (electronic)

    MATH  MathSciNet  Google Scholar 

  2. Benjamini, I., Lyons, R., Peres, Y., Schramm, O.: Uniform spanning forests. Ann. Probab. 29(1), 1–65 (2001)

    MATH  MathSciNet  Google Scholar 

  3. Gaboriau, D.: Coût des relations d’équivalence et des groupes. Invent. Math. 139(1), 41–98 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gaboriau, D.: Invariant percolation and harmonic Dirichlet functions. Geom. Funct. Anal. 15(5), 1004–1051 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Häggström, O., Peres, Y.: Monotonicity of uniqueness for percolation on Cayley graphs: all infinite clusters are born simultaneously. Probab. Theory Relat. Fields 113(2), 273–285 (1999)

    Article  MATH  Google Scholar 

  6. Hjorth, G.: A lemma for cost attained. Ann. Pure Appl. Log. 143(1–3), 87–102 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  7. Kechris, A.S., Miller, B.D.: Topics in Orbit Equivalence. Lecture Notes in Mathematics, vol. 1852. Springer, Berlin (2004)

    MATH  Google Scholar 

  8. Lyons, R., Schramm, O.: Indistinguishability of percolation clusters. Ann. Probab. 27(4), 1809–1836 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lyons, R., Peres, Y., Schramm, O.: Minimal spanning forests. Ann. Probab. 34(5), 1665–1692 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ol’šanskiĭ, A.J.: On the question of the existence of an invariant mean on a group. Usp. Mat. Nauk 35(4(214)), 199–200 (1980)

    Google Scholar 

  11. Pak, I., Smirnova-Nagnibeda, T.: On non-uniqueness of percolation on nonamenable Cayley graphs. C. R. Acad. Sci. Paris Sér. I Math. 330(6), 495–500 (2000)

    MATH  MathSciNet  Google Scholar 

  12. Pichot, M.: Quasi-périodicité et théorie de la mesure. Ph.D. Thesis, Ecole Normale Supérieure de Lyon (2005)

  13. Timár, Á.: Ends in free minimal spanning forests. Ann. Probab. 34(3), 865–869 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. von Neumann, J.: Zur allgemeinen Theorie des Maßes. Fundam. Math. 13, 73–116 (1929)

    MATH  Google Scholar 

  15. Whyte, K.: Amenability, bi-Lipschitz equivalence, and the von Neumann conjecture. Duke Math. J. 99(1), 93–112 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Wilson, D.B.: Generating random spanning trees more quickly than the cover time. In: Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, PA, 1996, pp. 296–303. ACM, New York (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Damien Gaboriau.

Additional information

D. Gaboriau’s research was supported by CNRS.

R. Lyons’ research was supported partially by NSF grant DMS-0705518 and Microsoft Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gaboriau, D., Lyons, R. A measurable-group-theoretic solution to von Neumann’s problem. Invent. math. 177, 533–540 (2009). https://doi.org/10.1007/s00222-009-0187-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00222-009-0187-5

Mathematics Subject Classification (2000)

Navigation