Trivial automorphisms
Ilijas Farah, Saharon Shelah

TL;DR
This paper demonstrates the relative consistency of all automorphisms of certain Boolean algebra quotients being trivial, using advanced forcing techniques, and explores implications for the structure of the Calkin algebra.
Contribution
It proves the consistency of trivial automorphisms for quotients over Borel ideals and analyzes the automorphism structure of the Calkin algebra under set-theoretic assumptions.
Findings
All automorphisms of $P()/Fin$ are trivial.
The Calkin algebra admits outer automorphisms.
The dominating number equals $\u00051$ and $2^{\u00051}>2^{0}$.
Abstract
We prove that the statement `For all Borel ideals I and J on , every isomorphism between Boolean algebras and has a continuous representation' is relatively consistent with ZFC. In this model every isomorphism between and any other quotient over a Borel ideal is trivial for a number of Borel ideals I on . We can also assure that the dominating number is equal to and that . Therefore the Calkin algebra has outer automorphisms while all automorphisms of are trivial. Proofs rely on delicate analysis of names for reals in a countable support iteration of suslin proper forcings.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Advanced Differential Equations and Dynamical Systems · Rings, Modules, and Algebras
