An exposition on the supersimplicity of certain expansions of the additive group of the integers
Pith reviewed 2026-05-23 04:35 UTC · model grok-4.3
The pith
Expansions of the additive group of the integers by generic, square-free, or prime predicates are supersimple.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The additive group of the integers expanded by a generic predicate is supersimple; the same holds when the predicate is the set of square-free integers, and when the predicate is the set of primes provided Dickson's conjecture is true.
What carries the argument
Supersimplicity, the model-theoretic notion that a theory has no infinite dividing chains for types and satisfies a finite character for forking independence.
If this is right
- The expanded structures admit a well-behaved notion of independence that behaves like non-forking in stable theories.
- Definable sets in these expansions cannot encode arbitrary orderings or other unstable configurations.
- The square-free and prime cases inherit the same independence calculus as the generic case once the relevant conjecture is granted.
Where Pith is reading between the lines
- The same technique might apply to other sparse subsets of the integers whose characteristic functions avoid certain arithmetic progressions.
- If supersimplicity holds for primes unconditionally, it would give a model-theoretic route to consequences of Dickson's conjecture inside simple theories.
Load-bearing premise
The original arguments for each cited case are correct and, for the primes, Dickson's conjecture holds.
What would settle it
An explicit type over a finite set in one of these expansions that divides infinitely often without a corresponding independence relation would refute the claim.
read the original abstract
In this short note, we present a self-contained exposition of the supersimplicity of certain expansions of the additive group of the integers, such as adding a generic predicate (due to Chatzidakis and Pillay), a predicate for the square-free integers (due to Bhardwaj and Tran) or a predicate for the prime integers (due to Kaplan and Shelah, assuming Dickson's conjecture).
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript is a short note providing a self-contained exposition of the supersimplicity of three specific expansions of the additive group of the integers: (Z, +, P) where P is a generic predicate (due to Chatzidakis-Pillay), where P is the set of square-free integers (due to Bhardwaj-Tran), and where P is the set of primes (due to Kaplan-Shelah, conditional on Dickson's conjecture).
Significance. As an exposition rather than a source of new theorems, the paper's value lies in consolidating and presenting prior results from the model theory literature in a unified, accessible form. It explicitly attributes the results to the cited authors and flags the external number-theoretic hypothesis for the primes case. If the exposition is accurate, it may aid readers working on simple theories and expansions of abelian groups, but it does not advance new mathematical claims.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript as a self-contained exposition of existing results on supersimplicity, and for the recommendation to accept.
Circularity Check
Exposition of external results; no circularity in derivation chain
full rationale
The manuscript is explicitly framed as a self-contained exposition of supersimplicity results already established in the cited external papers (Chatzidakis-Pillay, Bhardwaj-Tran, Kaplan-Shelah). No new derivations, fitted parameters, self-definitions, or load-bearing self-citations are introduced. The only external hypothesis (Dickson's conjecture) is stated as such and is independent of the paper's content. All load-bearing steps trace to prior independent work rather than reducing to the present text by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Dickson's conjecture
Reference graph
Works this paper leans on
-
[1]
Baur, Elimination of Quantifiers for Modules, Israel J
W. Baur, Elimination of Quantifiers for Modules, Israel J. Math. 25 (1976), 64--70
work page 1976
-
[2]
N. Bhardwaj and C-M. Tran, The additive groups of Z and Q with predicates for being square-free , J. Symb. Log. 86 , (2021), 1324--1349
work page 2021
-
[3]
Z. Chatzidakis and A. Pillay, Generic structures and simple theories, Ann. Pure Appl. Logic 95 (1998), 71--92
work page 1998
-
[4]
I. Kaplan and S. Shelah, Decidability and classification of the theory of integers with primes, J. Symb. Log. 82 (2017), 1041--1050
work page 2017
- [5]
-
[6]
S. Shelah, Classification Theory and the number of non-isomorphic models, Studies in Logic and the Foundations of Mathematics 92 , (1990), Amsterdam: North-Holland. xxxiv, 705 p
work page 1990
-
[7]
K. Tent and M. Ziegler, A course in model theory, Lecture Notes in Logic 40 , (2012), Cambridge: Cambridge University Press, x, 248 p
work page 2012
-
[8]
F. O. Wagner, Simple theories, Mathematics and its Applications 503 , (2000), Dordrecht: Kluwer Academic Publishers. xi, 260 p
work page 2000
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.