The automorphism group of countable recursively saturated models of Peano arithmetic and strong cuts

Abstract: In this paper, we extend the concept of a Lascar generic automorphism in the setting of models of Peano arithmetic ($\mathrm{PA}$) to the subgroup of the automorphism group of a countable recursively saturated model $\mathcal{M}$ of $\mathrm{PA}$ that fixes pointwise a strong cut $I$ of $\mathcal{M}$, denoted by $(\mathrm{Aut}(\mathcal{M}))<em>{(I)}$. Then, we prove that: (1) $(\mathrm{Aut}(\mathcal{M}))</em>{(I)}$ has the small index property. (2) The cofinality of $(\mathrm{Aut}(\mathcal{M}))<em>{(I)}$ is uncountable. (3) Any nontrivial normal subgroup of $(\mathrm{Aut}(\mathcal{M}))</em>{(I)}$ is meagre in it. In particular, the infinite cyclic group $\mathbb{Z}$ is not a homomorphic image of $(\mathrm{Aut}(\mathcal{M}))_{(I)}$.

• The paper establishes that the automorphism subgroup fixing a strong cut in recursively saturated PA models has the small index property and robust definability features.
• It generalizes classical results by applying a back-and-forth construction and adapting Lascar generic automorphisms to analyze normal subgroup rigidity and meagerness.
• It characterizes uncountable cofinality in automorphism groups, linking model-theoretic strength of cuts with topological group properties.

Automorphism Groups of Countable Recursively Saturated Models of Peano Arithmetic and Strong Cuts

Overview

This paper provides a detailed analysis of the subgroup structure and topological dynamics of automorphism groups associated with countable recursively saturated models of Peano arithmetic (PA), focusing on subgroups that pointwise fix a strong cut. The research systematically generalizes results known for automorphism groups of arithmetically saturated models to broader recursively saturated contexts with respect to strong cuts, establishing key properties such as the small index property (SIP), uncountable cofinality, and rigidity of normal subgroup structure. Furthermore, it introduces and extensively studies a variant of Lascar generic automorphisms adapted to this setting.

Background and Definitions

A countable recursively saturated model $M$ of PA possesses a rich automorphism group $G = \operatorname{Aut}(M)$. A cut $I \subseteq M$ is strong if every coded function $f$ with domain containing $I$ has a uniform bound above $I$ precisely tracking when $f(i)$ leaves $I$. The subgroup $G_{(I)}$ comprises automorphisms fixing $I$ pointwise.

Lascar generics, originally motivated by topological dynamics and strong amalgamation properties, play a central role in characterizing the topological and algebraic structure of automorphism groups. The concept of a Lascar generic automorphism is adapted to the context of $G = \operatorname{Aut}(M)$0, considering existential closure and extension procedures within the fixed cut.

Main Results

1. Small Index Property for $G = \operatorname{Aut}(M)$1

Theorem: If $G = \operatorname{Aut}(M)$2 is a countable recursively saturated model of PA and $G = \operatorname{Aut}(M)$3 is a strong cut, then $G = \operatorname{Aut}(M)$4 has the small index property.

This generalizes Lascar’s classical result for arithmetically saturated models (where the standard cut is strong) to any strong cut in recursively saturated models. The proof constructs a "Lascar generic system" for $G = \operatorname{Aut}(M)$5 and then adapts the tree-based back-and-forth argument to show that any subgroup of index less than $G = \operatorname{Aut}(M)$6 is open in the natural topology. This result ensures that the abstract group structure of $G = \operatorname{Aut}(M)$7 reflects its topological structure, and subgroups of small index have robust definability properties.

2. Structure of Normal Subgroups and Meagerness

Theorem: Any nontrivial normal subgroup of $G = \operatorname{Aut}(M)$8 is meagre in $G = \operatorname{Aut}(M)$9 unless it is the whole group. In particular, $I \subseteq M$0 is not a homomorphic image of $I \subseteq M$1.

This is achieved by generalizing Kaye’s Galois correspondence for normal subgroups of $I \subseteq M$2 to $I \subseteq M$3 and deploying the structure theory of invariant cuts and closed normal subgroups. The key is to analyze fixed-point sets of Lascar $I \subseteq M$4-generic automorphisms and show that such automorphisms cover all of $I \subseteq M$5 up to a meagre set. The proof rules out nontrivial continuous homomorphisms to $I \subseteq M$6, with implications for the action of $I \subseteq M$7 on trees (in connection with Serre’s property FA).

3. Uncountable Cofinality Characterization

Theorem: For $I \subseteq M$8 a cut not $I \subseteq M$9-coded from above, $f$0 is strong in $f$1 if and only if $f$2 has uncountable cofinality.

This generalizes the Kossak-Schmerl result for standard cuts, linking model-theoretic strength of a cut with the inability to exhaust $f$3 as a countable union of proper subgroups. The authors use combinatorial closure and explicit construction arguments within recursively saturated models to establish equivalence.

Technical Development

The paper introduces refined versions of existentially closed automorphisms ("$f$4-e.c.") and adapts the notion of Lascar generics to tuples of automorphisms in $f$5. A Lascar generic system is constructed for $f$6, and all requisite closure, density, and conjugacy conditions are verified using definability arguments, recursive types, and satisfaction classes.

A back-and-forth construction is designed over $f$7-small elementary submodels to realize desired automorphism tuples, leveraging recursive saturation and the Overspill Principle. The framework is robust, allowing for generic automorphisms with prescribed behavior on any finite part of the model outside $f$8. This is essential for the tree-based independence argument in the proof of SIP and for understanding the density and meagerness of normal subgroups.

The generalization of Kaye's Galois correspondence demonstrates that every closed normal subgroup of $f$9 corresponds to fixing an invariant cut above $I$0 that is closed under exponentiation. The paper rules out nontrivial open or large normal subgroups, yielding precise rigidity results for these automorphism groups.

Implications and Future Directions

These results enhance the understanding of how algebraic/topological properties of automorphism groups encode deep model-theoretic information about arithmetic models and their cuts. The small index property and the rigidity of normal subgroups suggest strong recoverability of the model (and especially the cut $I$1) from the group structure, supporting Scott’s and Lascar’s perspectives in automorphism group theory.

The work suggests multiple directions for future research:

• Extending the genericity criteria: Characterizing when $I$2 admits a comeagre conjugacy class, possibly using advanced coloring and digraph techniques as in Schmerl's theorem.
• Property FA and group actions: Completing the characterization of fixed-point properties and tree actions, leveraging the established properties of $I$3.
• Invariants and isomorphism types: Determining to what extent models can be reconstructed from their automorphism groups over strong cuts, and whether the correspondence can be made categorical under additional invariants (e.g., standard system).
• Uncountable and nonstandard models: Investigating the structure of automorphism groups for larger or more arbitrary models of PA beyond countable recursively saturated ones.

Conclusion

The paper extends central results on the structure and dynamics of automorphism groups of countable recursively saturated models of PA to settings determined by strong cuts, establishing the small index property, characterizing normal subgroups, and linking model-theoretic strength to group-theoretic cofinality. The techniques developed demonstrate the deep interplay between definability, model saturation, and topological group theory, and provide a toolkit for further exploration of automorphism groups in arithmetic and beyond.