Article thumbnail

THE COMPLEXITY OF CLASSIFICATION PROBLEMS IN ERGODIC THEORY

By Alexander S. Kechris, Robin and D. Tucker-drob

Abstract

The last two decades have seen the emergence of a theory of set theoretic complexity of classification problems in mathematics. In these lectures we will discuss recent developments concerning the application of this theory to classification problems in ergodic theory. The first lecture will be devoted to a general introduction to this area. The next two lectures will give the basics of Hjorth’s theory of turbulence, a mixture of topological dynamics and descriptive set theory, which is a basic tool for proving strong non-classification theorems in various areas of mathematics. In the last three lectures, we will show how these ideas can be applied in proving a strong non-classification theorem for orbit equivalence. Given a countable group Γ, two free, measure-preserving, ergodic actions of Γ on standard probability spaces are called orbit equivalent if, roughly speaking, they have the same orbit spaces. More precisely this means that there is an isomorphism of the underlying measure space

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.210.8072
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.caltech.edu/pa... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.