The Setting
Take an abstract elementary class in a countable relational language, with Löwenheim-Skolem number , and suppose that is categorical in some cardinal above the Hanf number of . Must then be categorical in the Hanf number itself, as Shelah’s eventual categoricity conjecture with the threshold prescribed at the Hanf number would have it? The library answers the question under the continuum hypothesis.
Structures and Abstract Elementary Classes
A relational language is a family of sets, the elements of being its -ary relation symbols; is its number of symbols, and is countable when . A structure for is a set of the von Neumann hierarchy , the universe of , together with a relation for every -ary symbol of ; its cardinality is that of .✦
A substructure of a structure is a structure with and for every -ary symbol , written .✦ An isomorphism between structures is a bijection such that if and only if , for every -ary symbol and every .✦ A structure is the union of a family of structures when each is a substructure of and each element of lies in some .✦
A class with strong substructures is a pair of a class of structures for , the models of , and a binary relation between structures for .✦ A Löwenheim-Skolem bound for is a cardinal such that every set , for a model of , is contained in the universe of a model of with (1)✦
An abstract elementary class in is a class with strong substructures with the following properties.
The relation holds only between models of and is a partial order on .
If , then .
The class is closed under isomorphism; and if , and isomorphisms and agree on , then .
If , and , then .
For every nonzero ordinal and every -increasing chain of models of , there is a model of that is the union of the chain, with for every , and with for every model of such that for every .
The pair has a Löwenheim-Skolem bound.
The Löwenheim-Skolem number of an abstract elementary class is its least Löwenheim-Skolem bound.✦ A class is categorical in a cardinal when it has a model of cardinality and any two of its models of cardinality are isomorphic.✦ Two nonisomorphic models of in a cardinal are models and of with and no isomorphism from onto .✦
Cardinals
The continuum hypothesis (CH) is the statement .✦ The Hanf number of a cardinal is (2)✦ the index taken as the initial ordinal of the successor cardinal of . The endpoint is the cardinal ✦, and with the tail threshold is (3)
The Claim
Theorem 1. Assume CH. Then (4)✦ and some countable relational language carries an abstract elementary class with such that (5)✦ Under CH there is, moreover, a countable relational language carrying an abstract elementary class with such that (6)✦ Whether or not CH holds, (7)✦
In the paper, the result reads: assume CH; then there is an abstract elementary class in a countable finitary relational language with , with at least two nonisomorphic models of cardinality , and, for , categorical in every cardinal , so that in particular is a categoricity cardinal from which downward transfer to fails, the paper’s being the page’s .
What Is Checked
The claim is stated over abstract elementary classes in a countable relational language, whose models are structures on sets of , with their Löwenheim-Skolem number, categoricity and nonisomorphic models in a cardinal, and over the Hanf number , the endpoint and the tail threshold ; CH is the hypothesis of every part but (7).