The Digest.

ICTP Mathematics · Video summary

The Action

This talk explores the complexity of classifying dynamical systems, revealing that many common equivalence relations are non-Borel, implying inherent difficulty in their complete classification.

The Action Watch on YouTube ↗

Key takeaways

Chapters

The digest

High Level Overview

This lecture explores the deep mathematical problem of classifying dynamical systems via isomorphism relations and shows that these classification problems are often non-Borel—meaning inherently complex and resistant to simpler classification schemes. Focusing on the use of tree structures and reductions, it connects descriptive set theory with dynamical systems, particularly minimal subshifts and measure-preserving transformations, to reveal the limits of possible classification. The talk is aimed at researchers interested in ergodic theory, descriptive set theory, topological dynamics, and complexity theory in mathematics.

Keep reading in The Digest

The full 7-minute article, 17 more sections, and every new episode from ICTP Mathematics and the creators you follow.

  1. Structured Deep Dive
  2. Background: Reductions Between Equivalence Relations
  3. Non-Borel Sets and Ill-Founded Trees
  4. Encoding Trees into Dynamical Systems
  5. Cantor Space and Dynamics
  6. Complexity Results on Measure-Preserving Systems
  7. Recent Advances and Extensions
  8. Countable Borel Equivalence Relations and Maximal Complexity
  9. When Is Conjugacy Relation Borel?
  10. Open Problems and Further Directions
  11. Key Frameworks, Models, or Mental Maps
  12. 1. Borel Reduction of Equivalence Relations
  13. 2. Encoding Ill-Founded Trees into Dynamical Systems
  14. 3. Orbit Equivalence Relations from Group Actions
  15. 4. Hierarchy of Countable Borel Equivalence Relations
  16. Practical Implications & Takeaways
  17. Action-Oriented Summary
Read the full digest — free

More from ICTP Mathematics

All ICTP Mathematics summaries →