Corona Rigidity
Ilijas Farah, Saeed Ghasemi, Andrea Vaccaro, Alessandro Vignati
TL;DR
This survey develops a unifying framework for rigidity of Borel quotient structures across Boolean algebras and $ ext{C}^*$-algebras, highlighting the recurring dichotomy that CH enables many nontrivial automorphisms while forcing axioms enforce topological and algebraic triviality of liftings. Central to the analysis are liftings, notions of topological versus algebraic triviality, and Ulam-stability linking approximate morphisms to genuine ones, connected through reduced products, corona algebras, and Čech–Stone remainders. The text synthesizes model-theoretic saturation results (under CH) with forcing-axiom techniques (e.g., OCA, MA, PFA) to explain when nontrivial automorphisms exist or are eliminated, and extends these ideas to large coronas, uniform Roe coronas, and Higson coronas. The work underscores deep interactions among set theory, model theory, and operator algebras, identifies major open problems, and outlines a meta-theory for rigidity applicable across commutative and noncommutative contexts, including endomorphisms and extension theory. Overall, it provides a broad, interoperable framework to study when quotient structures admit Borel liftings and when such liftings are forced to be algebraically (and thus structurally) trivial, with wide implications for dynamics, classification, and coarse geometry.
Abstract
We give a unified overview of the study of the effects of additional set theoretic axioms on quotient structures. Our focus is on rigidity, measured in terms of existence (or rather non-existence) of suitably non-trivial automorphisms of the quotients in question. A textbook example for the study of this topic is the Boolean algebra $\mathcal{P}(\mathbb{N})/\text{Fin}$, whose behavior is the template around which this survey revolves: Forcing axioms imply that all of its automorphisms are trivial, in the sense that they are induced by almost permutations of $\mathbb{N}$, while under the Continuum Hypothesis this rigidity fails and $\mathcal{P}(\mathbb{N})/\text{Fin}$ admits uncountably many non-trivial automorphisms. We consider far-reaching generalisations of this phenomenon and present a wide variety of situations where analogous patterns persist, focusing mainly (but not exclusively) on the categories of Boolean algebras, Čech-Stone remainders, and $\mathrm{C}^\ast$-algebras. We survey the state of the art and the future prospects of this field, discussing the major open problems and outlining the main ideas of the proofs whenever possible.
