Nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$ in Cohen models

This paper establishes that nontrivial automorphisms of the Boolean algebra $\mathcal{P}(\omega)/\mathrm{Fin}$ exist in Cohen extensions of a $\mathsf{CH}$ model for any number of added reals $\kappa < \aleph_\omega$, and extends this result to $\kappa \geq \aleph_\omega$ under additional hypotheses involving sage Davies trees.

The Gist

Here is an explanation of the paper "Nontrivial Automorphisms of P(ω)/Fin in Cohen Models" using simple language and creative analogies.

The Big Picture: A Puzzle with Infinite Pieces

Imagine you have a giant, infinite puzzle made of numbers. Specifically, imagine the set of all natural numbers (1, 2, 3...). Now, imagine you can group these numbers into sets (like "all even numbers" or "all prime numbers").

In mathematics, there is a special structure called P(ω)/Fin. Think of this as a "super-organizer" for these infinite groups. It treats two groups as "the same" if they differ by only a finite number of items (e.g., the set of all even numbers is considered the same as the set of all even numbers except 2 and 4, because you only removed two items).

An automorphism is a way of rearranging this super-organizer without breaking its rules. It's like shuffling the deck of cards, but the deck is infinite, and the rules of the game must stay exactly the same.

• Trivial Automorphisms: These are the "boring" shuffles. They happen because you just renamed the numbers (e.g., swapping 1 and 2 everywhere). They are predictable and simple.
• Nontrivial Automorphisms: These are the "wild" shuffles. They rearrange the infinite groups in complex, unpredictable ways that cannot be explained by just renaming the numbers.

The Question: If we take our mathematical universe and add a massive amount of new, random information (called "Cohen reals"), do these "wild" shuffles appear?

The Setting: The "Cohen Model"

The authors are working in a specific scenario called the Cohen Model. Imagine your current universe is a quiet library (satisfying the Continuum Hypothesis, or CH). Then, you decide to add a huge number of new, random books to the library.

• κ (Kappa): This is the number of new books you add.
• The Goal: The authors want to know if, after adding these books, the library's "super-organizer" (P(ω)/Fin) suddenly develops complex, wild shuffles (nontrivial automorphisms).

The Old Problem: Why was this hard?

For a long time, mathematicians knew this happened if you added 2 new books (specifically, $\aleph_2$ books). The proof relied on a special property of the library when it was small: the new books were arranged in a way that made it easy to find "gaps" to fill.

However, when you try to add 3 or more new books (like $\aleph_3$ or $\aleph_4$), the library gets too messy. The special "gap-filling" trick stops working. It's like trying to solve a puzzle where the pieces keep changing shape as you add more of them. Previous methods failed for these larger numbers.

The New Solution: The "Sage Davies Tree"

The authors, Will Brian and Alan Dow, found a new way to solve this. They used a mathematical structure called a Sage Davies Tree.

The Analogy: The Construction Crew
Imagine you are building a skyscraper (the new mathematical universe).

• The Problem: You need to build the skyscraper floor by floor, but you need to make sure that every time you add a new floor, you have the right tools to rearrange the furniture (the automorphisms) without breaking anything.
• The Old Way: For small buildings, you could just look at the blueprint and guess the next step.
• The New Way (Sage Davies Tree): The authors use a "Sage Davies Tree" as a master construction crew.
  • This crew is a sequence of teams ($M_0, M_1, M_2...$) that grow larger and larger.
  • Each team is smart enough to see the whole picture of the floors built so far.
  • Crucially, these teams are "countably closed," meaning they are organized enough to handle infinite lists of tasks without getting confused.

By using this tree, the authors can prove that no matter how many books (Cohen reals) you add, you can always find a "fresh" set of tools (new random numbers) that are completely independent of the old ones. This allows them to perform the "wild shuffle" (create a nontrivial automorphism) at every step of the construction.

The Main Results

1. For "Small" Infinities ($\kappa < \aleph_\omega$):
   The authors prove that if you add any number of books less than a certain huge limit, wild shuffles definitely exist. In fact, there are as many of them as mathematically possible ($2^\kappa$). This is a solid proof that doesn't require any extra assumptions.

2. For "Huge" Infinities ($\kappa \ge \aleph_\omega$):
   If you add a truly massive number of books, the proof still works, but only if the original library (the ground model) had a very specific, orderly structure (called a Sage Davies Tree).

   • The Catch: This structure usually exists if we assume some standard rules of set theory (like SCH and $\square_\lambda$).
   • The Result: If those rules hold, then even with a massive number of new books, wild shuffles appear.

Why Does This Matter?

This paper solves a decades-old puzzle. It shows that the "wild shuffles" of infinite sets are not a fluke of small numbers; they are a robust feature of the mathematical universe, even when we throw massive amounts of randomness at it.

• The "Near-Saturation" Analogy: In the past, mathematicians thought the $\aleph_2$ case was special because the library was "almost full" in a way that made shuffling easy. The authors show that even when the library is "too full" (for larger $\kappa$), the Sage Davies Tree acts like a magical key that unlocks the ability to shuffle anyway.

Summary in One Sentence

By using a clever mathematical "construction crew" (Sage Davies Trees), the authors proved that even when you add a huge amount of random chaos to the universe of numbers, the underlying structure of infinite sets still allows for complex, unpredictable rearrangements.

Technical Summary

Here is a detailed technical summary of the paper "Nontrivial Automorphisms of $P(\omega)/\text{Fin}$ in Cohen Models" by Will Brian and Alan Dow.

1. Problem Statement

The central problem addressed in this paper is the existence of nontrivial automorphisms of the Boolean algebra $P(\omega)/\text{Fin}$ (the power set of natural numbers modulo finite sets) within Cohen models.

• Context: A "Cohen model" is obtained by forcing with $Fn(\kappa, 2)$ (adding $\kappa$ mutually generic Cohen reals) over a ground model satisfying the Continuum Hypothesis (CH).
• The Question: Does the extension $V[G]$ contain automorphisms of $P(\omega)/\text{Fin}$ that are not induced by almost permutations of $\omega$ (trivial automorphisms)?
• Previous State of Knowledge:
  • Shelah and Steprāns (1993) proved that in the $\aleph_2$-Cohen model, nontrivial automorphisms exist.
  • Their proof relied on specific structural properties of the $\aleph_2$-Cohen model (specifically, a "near-saturation" allowing CH-like recursive constructions).
  • It was unknown whether this result generalizes to $\kappa \ge \aleph_3$, particularly for singular cardinals or when $\kappa \ge \aleph_\omega$, because the specific structural features of the $\aleph_2$ case fail in larger models.

2. Methodology

The authors develop a unified framework to extend the Shelah-Steprāns argument to arbitrary cardinals $\kappa \ge \aleph_2$. The core methodology involves three main components:

A. Sage Davies Trees

The authors utilize sage Davies trees, a combinatorial structure introduced by R.O. Davies and refined in later literature.

• Definition: A sequence $\langle M_\alpha : \alpha < \kappa \rangle$ of elementary submodels of a large fragment of the set-theoretic universe ($H_\theta$) satisfying specific coherence and covering properties.
• Key Property: These trees allow the construction of sequences of submodels that behave like a "tree" of elementary submodels, providing a way to enumerate and control the extension process.
• Existence:
  • For $\kappa < \aleph_\omega$, such trees exist in ZFC.
  • For $\kappa \ge \aleph_\omega$, their existence requires additional hypotheses, specifically the Singular Cardinals Hypothesis (SCH) and the square principle ($\square_\lambda$) for limit cardinals $\lambda$ of countable cofinality.

B. Preservation of Structure in the Extension

The paper analyzes how a sage Davies tree in the ground model $V$ transforms after adding $\kappa$ Cohen reals.

• Theorem 2.1: The authors prove that while the sequence $\langle M_\alpha[G] : \alpha < \kappa \rangle$ is no longer a sage Davies tree in the strict sense, it retains enough structure to be useful.
• Crucial Insight: For each $\alpha$, the model $M_\alpha[G]$ contains $\aleph_1$ "fresh" Cohen reals that are mutually generic over the previous stages. Furthermore, for any new element $r$ in $M_\alpha[G]$, there exist countable sets $L_r, U_r$ in the previous stage that form an $(\omega, \omega)$-gap around $r$.

C. Recursive Construction via Gap Filling

The construction of automorphisms relies on the fact that $P(\omega)/\text{Fin}$ is countably saturated.

• The Gap Mechanism: To extend a partial automorphism $\Phi$ from a subalgebra $B_\alpha$ to a new element $b$, one must find an image $y$ such that if $b$ cuts the domain in a gap $(L, U)$, then $y$ cuts the image domain in the gap $(\Phi[L], \Phi[U])$.
• The Solution: The "fresh" Cohen reals provided by the sage Davies tree structure act as generic filters for the countable poset that fills these gaps. This allows the authors to recursively extend automorphisms through $\kappa$ stages, maintaining control over the construction.

3. Key Contributions and Results

The paper establishes the Main Theorem, which resolves the existence of nontrivial automorphisms for various $\kappa$:

Case 1: $\kappa < \aleph_\omega$ (ZFC Result)

• Result: If $\kappa < \aleph_\omega$, then in the $\kappa$-Cohen model, every automorphism of $P(\omega)/\text{Fin}$ in the ground model extends to $2^\kappa$ distinct automorphisms in the extension.
• Significance: This is a theorem of ZFC. Since $\kappa \ge \aleph_2$, $2^\kappa > \mathfrak{c}$, implying the existence of$2^\mathfrak{c}$ nontrivial automorphisms.

Case 2: $\kappa \ge \aleph_\omega$ (Conditional Result)

• Result: If $\kappa$ is a regular cardinal and a sage Davies tree of length $\kappa$ exists (which follows from SCH + $\square_\lambda$), then every ground model automorphism extends to $2^\kappa$ automorphisms.
• Result for Singular $\kappa$: If $\kappa$ is singular and a sage Davies tree of length $\nu = \kappa^\omega$ exists, then nontrivial automorphisms exist (though the paper does not prove the full $2^\kappa$ extension in this specific singular case without further assumptions).

Case 3: The $\aleph_2$ Case

• The paper confirms and generalizes the Shelah-Steprāns result, showing their argument is a special case of the sage Davies tree framework.

4. Technical Significance

1. Generalization of Shelah-Steprāns: The paper successfully overcomes the barrier that prevented the extension of the $\aleph_2$ proof to higher cardinals. It replaces the ad-hoc "near-saturation" of the $\aleph_2$ model with the robust combinatorial tool of sage Davies trees.
2. Maximal Number of Automorphisms: For regular $\kappa$, the authors prove the existence of the maximum possible number of automorphisms ($2^\mathfrak{c}$), not just the existence of some nontrivial ones.
3. Handling Singular Cardinals: The paper provides a novel method for handling singular cardinals (specifically when $\kappa^\omega > \kappa$) by utilizing generalized almost disjoint families derived from the sage Davies tree structure to generate the necessary generic reals.
4. Consistency Strength Analysis: The authors clarify the boundary between ZFC and large cardinal hypotheses.
   • The result for $\kappa < \aleph_\omega$ is absolute (ZFC).
   • The result for $\kappa \ge \aleph_\omega$ relies on SCH and $\square$. The paper notes that the failure of these principles (which would be required to construct a model where the result fails) has high consistency strength (involving inner models with Woodin cardinals or measurable cardinals of high Mitchell order).

5. Open Questions

The paper concludes by highlighting several open problems:

• ZFC for Large $\kappa$: Can the existence of nontrivial automorphisms for $\kappa \ge \aleph_\omega$ be proved in ZFC alone, or is the SCH/$\square$ hypothesis necessary?
• Triviality in Large Models: Is it consistent (relative to large cardinals) that all automorphisms are trivial in a $\kappa$-Cohen model for some $\kappa \ge \aleph_\omega$?
• Random Reals: The behavior of automorphisms in models obtained by adding random reals (as opposed to Cohen reals) remains completely open.

Summary

Brian and Dow provide a definitive answer for Cohen models with $\kappa < \aleph_\omega$ and a conditional answer for larger $\kappa$. By introducing the machinery of sage Davies trees into the context of Cohen forcing, they demonstrate that the "gap-filling" technique used for $\aleph_2$ can be systematically scaled up, provided the ground model possesses sufficient combinatorial structure (SCH + $\square$). This work significantly deepens the understanding of the automorphism group of $P(\omega)/\text{Fin}$ in forcing extensions.