For a countable complete superstable theory , Tanović (2013) proved that if and the generic type of every infinite simple group definable in of -rank below is eventually strongly non-isolated (ESN), then has countable models. The paper asks whether the generic type of every simple superstable group is at least eventually non-isolated (its Question 1) and conjectures the strong ESN property for generics of simple superstable groups of -rank (its Conjecture 2). Both remain open: the August 2025 survey by Pillay and Tanović re-poses Question 1 verbatim as an open problem, and the unconditional rank-threshold conjecture (Tanović 2007) is still proved only for trivial and one-based theories. This record asks for a determination of the isolation status of generics of simple superstable groups; an affirmative answer to the strong form below would make the threshold theorem unconditional via Theorem 1, yielding the statement that every superstable theory with few countable models has Lascar rank strictly below .
Background
For a complete first-order theory in a countable language, denotes the number of countable models of up to isomorphism; it is always at most . Vaught's conjecture predicts that is either countable or , and theories with are said to have few countable models. The conjecture is confirmed for -stable theories (Shelah–Harrington–Makkai 1984) and for superstable theories of finite -rank (Buechler 2008), but remains open for superstable theories in general.
A theory is stable if over every parameter set there are only as many complete types as the cardinality of that set (informally: the theory has few types), and superstable if a stronger iteration of this condition holds; superstability sits one step below -stability in the stability hierarchy. In a superstable theory, complete types carry the Lascar rank , an ordinal-valued rank measuring the depth of forking — forking being the stability-theoretic notion of dependence between a type and a parameter set. is the supremum of over all complete types; ordinals are compared via Cantor normal form, and is the first limit of the monomials . Throughout one works in , the canonical expansion of by imaginary sorts (quotients by definable equivalence relations), so that sets and groups interpretable in become definable.
A stable group is a group definable, possibly with parameters, in a stable theory. A generic type of a stable group is a complete type over the group whose finitely many left translates cover ; in a connected stable group the generic is unique up to translation, and the -rank of is by definition the -rank of its generic type. A simple group is a group with no nontrivial proper normal subgroups; the groups considered here are infinite simple groups definable in .
A type (a complete type over the finite or small parameter set ) is isolated if a single formula generates it. The following isolation notions drive the countable-models theory: is eventually non-isolated (eni) if some nonforking extension of over a finite set is non-isolated; is strongly non-isolated if, for every finite and every , the types over almost orthogonal to are dense in (almost orthogonal meaning that any realization of one is forking-independent of any realization of the other over ); and is eventually strongly non-isolated (ESN) if some nonforking extension of over a finite set is strongly non-isolated. ESN implies eni, and the two notions coincide for types of -rank 1. A strongly regular type — a non-algebraic type whose distinct realizations are pairwise dependent, a higher-rank analogue of a strongly minimal type — that is not eni is called NENI. Tanović (2007) proved a dichotomy: a type is ESN if and only if it is orthogonal to every NENI type whose domain is a finite extension of its own domain; and that the existence of an infinite family of regular ESN types over finite domains with -ranks forces .
Tanović (2007) conjectured that implies — equivalently, that a superstable theory with few countable models has — and proved it for trivial theories and for one-based theories (one-basedness is a global local-modularity condition; complete theories of modules over a fixed ring are one-based). Low and Pillay (1992) had shown that a superstable, non--stable theory with few countable models must contain a definable group with locally modular regular generic types; in particular, a superstable theory with no infinite definable groups satisfies Vaught's conjecture. Definable groups are therefore the locus of the remaining difficulty.
The 2013 paper analyzes geometrically how the required ESN families can fail to exist. If they do fail, then — via internally isolated types, their Grassmannian types (types of names of -dimensional subspaces of the pregeometry induced on the locus of a regular type ), and binding groups (type-definable automorphism groups of the locus of a type) — a hypothetical NENI type of -rank produces a type-definable group acting transitively, indeed 2-transitively, whose -connected component (a standard connected-component construction for superstable groups) has trivial center; classical stable-group theory then yields a simple, -connected group or a -connected field of -rank about . The field case is closed inside the paper: the generic type of a superstable field of -rank below is ESN, by a vector-space dimension-counting argument over definable subfields. For simple groups the analogous statement is unknown beyond finite rank: a simple group of finite -rank is -categorical but not -categorical (a classical fact recalled in the paper), which makes its generic type ENI and, at rank 1, ESN; at infinite rank no structure theory of comparable strength is known. Theorem 1 of the paper states: if is superstable, , and the generic type of every simple group definable in of -rank smaller than is ESN, then . The paper asks its Question 1 (is every such generic at least eventually non-isolated?) and poses Conjecture 2 (the generic of a simple superstable group of -rank is ESN). The question was re-posed verbatim as an open problem (Problem 1) in the August 2025 survey by Pillay and Tanović, which notes that the -rank bound for theories with few countable models would follow without any one-basedness assumption given an affirmative answer.
Problem Statement
Let be a complete, superstable theory in a countable language, having infinite models, and work in . The problem, posed in the source paper, has a core question and a strong refinement. The two sub-questions have different domains — (1) concerns every infinite simple group definable in , whereas (2) is restricted to groups of monomial -rank — so neither sub-question implies the other. An affirmative answer to the strong form for groups of -rank below supplies exactly the missing hypothesis of the paper's Theorem 1:
(1) Question 1 (weak form). Is the generic type of every infinite simple group definable in eventually non-isolated — that is, does some nonforking extension of the generic type over a finite parameter set fail to be isolated?
(2) Conjecture 2 (strong form). Is the generic type of every simple superstable group of -rank (a single monomial term of Cantor normal form) eventually strongly non-isolated (ESN)?
An affirmative answer to (2) for groups of -rank below supplies exactly the instances of the hypothesis of Theorem 1 of the source paper that its proof consumes — the proof applies the hypothesis only to the simple, -connected groups of monomial -rank produced by its Proposition 3.4, the finite-rank instances being the case the paper itself recalls as classically settled — and would thereby immediately yield the unconditional rank-threshold statement: every countable complete superstable theory with has — equivalently, every superstable theory with fewer than countable models has (the conjecture from Tanović's 2007 paper, currently established only for trivial and one-based theories).
Determine the truth of (1) and (2). An affirmative answer to (2) for groups of -rank below would make the threshold theorem unconditional via Theorem 1.
References
- Predrag Tanović, "Simple groups and the number of countable models", Archive for Mathematical Logic 52 (2013) 779–791. DOI: 10.1007/s00153-013-0343-x. https://doi.org/10.1007/s00153-013-0343-x (preprint arXiv:1304.7099, https://arxiv.org/abs/1304.7099)
- Predrag Tanović, "Non-isolated types in stable theories", Annals of Pure and Applied Logic 145 (2007) 1–15. DOI: 10.1016/j.apal.2006.05.014. https://doi.org/10.1016/j.apal.2006.05.014
- Anand Pillay and Predrag Tanović, "The number of countable models of first-order theories" (2025), expository survey submitted to the Journal of Open Mathematical Problems. arXiv:2508.06854. https://arxiv.org/abs/2508.06854
- Steven Buechler, "Vaught's conjecture for superstable theories of finite rank", Annals of Pure and Applied Logic 155 (2008) 135–172. DOI: 10.1016/j.apal.2008.03.004. https://doi.org/10.1016/j.apal.2008.03.004
- Lee Fong Low and Anand Pillay, "Superstable theories with few countable models", Archive for Mathematical Logic 31 (1992) 457–465. DOI: 10.1007/BF01277487. https://doi.org/10.1007/BF01277487
- S. Shelah, L. Harrington and M. Makkai, "A proof of Vaught's conjecture for ω-stable theories", Israel Journal of Mathematics 49 (1984) 259–280. DOI: 10.1007/BF02760651. https://doi.org/10.1007/BF02760651
- Michael C. Laskowski and Danielle S. Ulrich, "Equivalents of NOTOP", Journal of Symbolic Logic, published online 2025, pp. 1–33. DOI: 10.1017/jsl.2025.10135. https://doi.org/10.1017/jsl.2025.10135 (preprint arXiv:2505.00844, https://arxiv.org/abs/2505.00844)
- Dejan Ilić, Slavko Moconja and Predrag Tanović, "Groups with finitely many countable models", Publications de l'Institut Mathématique 97 (2015) 33–41. DOI: 10.2298/PIM140318001I. https://doi.org/10.2298/PIM140318001I