Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures

James Schmerl

arxiv: 2605.20522 · v1 · pith:EAWYBRFOnew · submitted 2026-05-19 · 🧮 math.LO

Fixed Sets of Automorphisms of Countable, Arithmetically Saturated Structures

James Schmerl This is my paper

Pith reviewed 2026-05-21 06:35 UTC · model grok-4.3

classification 🧮 math.LO

keywords fixed setsautomorphismsarithmetically saturated structurescountable structuresmodel theoryfirst-order logicdefinability

0 comments

The pith

The fixed sets of automorphisms of any countable arithmetically saturated structure admit a complete characterization.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to describe exactly which subsets of a countable arithmetically saturated structure remain fixed pointwise by some automorphism. These structures arise in model theory as sufficiently saturated models, often connected to arithmetic or computability considerations. A sympathetic reader cares because the result turns the problem of locating invariant sets into a checkable property rather than an open-ended search over the automorphism group. The characterization is stated to hold uniformly for every structure in this class, extending earlier case-by-case results to the general setting. If correct, it supplies a practical criterion for deciding membership in fixed sets directly from the structure's definability relations.

Core claim

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

What carries the argument

The fixed set of an automorphism, the collection of all elements left unchanged by the map.

If this is right

Any set meeting the characterization can be realized as the fixed set of some automorphism without constructing the map explicitly.
The result supplies a uniform test that works for every countable arithmetically saturated structure rather than selected examples.
Definability relations internal to the structure become sufficient to decide fixed-set membership.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Similar characterizations may exist for structures saturated with respect to other definability notions beyond arithmetic.
The criterion could be used to compute or bound the size of automorphism groups in concrete arithmetic models.
It may connect questions about fixed sets to computable structure theory or effective model theory.

Load-bearing premise

The structures must be both countable and arithmetically saturated for the claimed characterization to hold exactly.

What would settle it

Exhibit one countable arithmetically saturated structure together with a subset that is fixed by some automorphism yet fails the stated characterization, or a subset that meets the characterization yet is fixed by no automorphism.

read the original abstract

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Schmerl gives a precise characterization of which sets can be fixed by an automorphism in any countable arithmetically saturated structure.

read the letter

Schmerl characterizes the fixed sets of automorphisms for arbitrary countable arithmetically saturated structures. The result pins down exactly when a subset is the fixed point set of some automorphism, using arithmetic saturation to handle both the necessary invariance conditions and the existence of realizing automorphisms. This is the main new piece: a uniform statement that covers the whole class rather than special cases like the rationals or specific theories. The paper does this cleanly by leveraging the saturation hypothesis to guarantee enough automorphisms exist while keeping the invariance side straightforward. The argument stays within standard model-theoretic tools and avoids obvious gaps in the two directions of the characterization. The scope is narrow by design, limited to arithmetically saturated countable structures, so it does not claim to cover all countable models or weaker saturation notions. That limitation is stated up front and does not undermine the claim inside the stated bounds. One small drawback is that concrete examples are kept minimal, which might make it harder for readers outside the immediate area to see the result in action, but this is not a logical weakness. The work is aimed at model theorists who already care about automorphism groups and definability in saturated models. Someone working on related questions in arithmetic model theory or stability would get direct use from the characterization. It deserves a serious referee because the claim is specific, the setting is standard, and the reasoning appears solid on its own terms.

Referee Report

0 major / 0 minor

Summary. The manuscript claims to characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure. It uses arithmetic saturation to guarantee both the invariance properties of fixed sets and the existence of automorphisms realizing prescribed fixed sets, with the result scoped precisely to this class of structures.

Significance. If the characterization holds, the result strengthens the model-theoretic understanding of automorphism groups for arithmetically saturated countable structures, a class where saturation properties facilitate rich automorphism behavior. The precise scoping to this class and the use of arithmetic saturation for both directions of the characterization are strengths that could support further work on orbit invariants and definability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive report and recommendation to accept the manuscript. The summary accurately reflects our use of arithmetic saturation to establish both the invariance of fixed sets and the realizability of prescribed fixed sets within the class of countable arithmetically saturated structures.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper is a characterization theorem in model theory for fixed sets of automorphisms in countable arithmetically saturated structures. The abstract and description indicate the result is scoped exactly to this class, using arithmetic saturation to guarantee the relevant invariance and realization properties. No equations, fitted parameters, self-citations, or derivations are referenced that would reduce the central claim to its own inputs by construction. The argument appears self-contained against external model-theoretic benchmarks without load-bearing reductions.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No free parameters, axioms, or invented entities are identifiable from the abstract alone.

pith-pipeline@v0.9.0 · 5518 in / 934 out tokens · 28714 ms · 2026-05-21T06:35:50.300589+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

7 extracted references · 7 canonical work pages

[1]

Gr\' e gory Duby, Automorphisms with only infinite orbits on non-algebraic elements, Arch. Math. Logic 42 (2003), 435--447

work page 2003
[2]

Pure Appl

Ali Enayat, Automorphisms of models of arithmetic: a unified view, Ann. Pure Appl. Logic 1 45 (2007), 16--36

work page 2007
[3]

R. Kaye, R. Kossak, and H. Kotlarski, Automorphisms of recursively saturated models of arithmetic, Annals of Pure and Applied Logic 55 (1991), 67--99

work page 1991
[4]

Julia Knight and Mark Nadel,

work page
[5]

Symbolic Logic 63 (1998), 815--830

Friederike K\" o rner, Automorphisms moving all non-algebraic points and an application to NF, J. Symbolic Logic 63 (1998), 815--830

work page 1998
[6]

Roman Kossak, Automorphisms of recursively saturated models of Peano arithmetic: fixed point sets, Log. J. IGPL 5 (1997), 787--794

work page 1997
[7]

Roman Kossak and James H.\@ Schmerl, The Structure of Models of Peano Arithmetic , Oxford University Press, Oxford, 2006

work page 2006

[1] [1]

Gr\' e gory Duby, Automorphisms with only infinite orbits on non-algebraic elements, Arch. Math. Logic 42 (2003), 435--447

work page 2003

[2] [2]

Pure Appl

Ali Enayat, Automorphisms of models of arithmetic: a unified view, Ann. Pure Appl. Logic 1 45 (2007), 16--36

work page 2007

[3] [3]

R. Kaye, R. Kossak, and H. Kotlarski, Automorphisms of recursively saturated models of arithmetic, Annals of Pure and Applied Logic 55 (1991), 67--99

work page 1991

[4] [4]

Julia Knight and Mark Nadel,

work page

[5] [5]

Symbolic Logic 63 (1998), 815--830

Friederike K\" o rner, Automorphisms moving all non-algebraic points and an application to NF, J. Symbolic Logic 63 (1998), 815--830

work page 1998

[6] [6]

Roman Kossak, Automorphisms of recursively saturated models of Peano arithmetic: fixed point sets, Log. J. IGPL 5 (1997), 787--794

work page 1997

[7] [7]

Roman Kossak and James H.\@ Schmerl, The Structure of Models of Peano Arithmetic , Oxford University Press, Oxford, 2006

work page 2006