Two Complexity Results in Descriptive Set Theory - Hyperfinite and Hyper-Hyperfinite Equivalence Relations
Centre International de Rencontres Mathématiques via YouTube
AI Engineer - Learn how to integrate AI into software applications
Lead AI-Native Products with Microsoft's Agentic AI Program
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Explore two significant complexity results in descriptive set theory through this 54-minute mathematical lecture that addresses major open problems in the field. Examine the characterization of hyperfinite equivalence relations, one of descriptive set theory's most challenging unsolved questions, and investigate whether every hyper-hyperfinite equivalence relation is hyperfinite. Discover a surprising connection between these problems, as the speaker demonstrates how a negative answer to the latter question would necessarily imply a negative answer to the former. Learn about recent developments that link Borel amenability to complexity theory, providing new insights into these fundamental mathematical structures. Gain understanding of advanced concepts in set theory and their interconnections through rigorous mathematical analysis presented at the XVIII International Workshop in Set Theory.
Syllabus
Zoltan Vidnyanszky: Two complexity results
Taught by
Centre International de Rencontres Mathématiques