Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 108 tok/s Pro
Kimi K2 207 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Conjugating trivial automorphisms of $\mathcal P(\mathbb N)/\mathrm{Fin}$ (2410.08789v3)

Published 11 Oct 2024 in math.LO, math.DS, math.GN, and math.OA

Abstract: A trivial automorphism of the Boolean algebra $\mathcal P(\mathbb N) / \mathrm{Fin}$ is an automorphism induced by the action of some function $\mathbb N \rightarrow \mathbb N$. In models of forcing axioms all automorphisms are trivial, and therefore two trivial automorphisms are conjugate if and only if they have the same (modulo finite) cycle structure. We show that the Continuum Hypothesis implies that two trivial automorphisms are conjugate if and only if there are neither first-order obstructions nor index obstructions for their conjugacy. This is equivalent to given trivial automorphisms being conugate in some forcing extension of the universe. To each automorphism $\alpha$ of $\mathcal P(\mathbb N) / \mathrm{Fin}$ we associate the first-order structure $\mathfrak{A}_\alpha=(\mathcal P(\mathbb N) / \mathrm{Fin},\alpha)$ and compute the existential theories of these structures. These results are applied to resolve a question of Braga, Farah, and Vignati and prove that there are coarse metric spaces $X$ and $Y$ such that the isomorphism between their uniform Roe coronas is independent from $\mathsf{ZFC}$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.