OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.1: An abstract elementary class with LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0, categorical from Λ=ℶ(2ℵ1)+\Lambda = \beth_{(2^{\aleph_1})^+} on, with two nonisomorphic models in h(ℵ0)h(\aleph_0)

The continuum hypothesis blocks categoricity transfer to the Hanf number.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Take an abstract elementary class KK in a countable relational language, with Löwenheim-Skolem number ℵ0\aleph_0, and suppose that KK is categorical in some cardinal above the Hanf number of ℵ0\aleph_0. Must KK 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 LL is a family (Ln)n∈ℕ(L_n)_{n \in \mathbb{N}} of sets, the elements of LnL_n being its nn-ary relation symbols; |L||L| is its number of symbols, and LL is countable when |L|≤ℵ0|L| \leq \aleph_0. A structure MM for LL is a set |M||M| of the von Neumann hierarchy VV, the universe of MM, together with a relation RM⊆|M|nR^M \subseteq |M|^n for every nn-ary symbol RR of LL; its cardinality ∥M∥\|M\| is that of |M||M|.✦

A substructure of a structure NN is a structure MM with |M|⊆|N||M| \subseteq |N| and RM=RN∩|M|nR^M = R^N \cap |M|^n for every nn-ary symbol RR, written M⊆NM \subseteq N.✦ An isomorphism f:M≅Nf\colon M \cong N between structures is a bijection f:|M|→|N|f\colon |M| \to |N| such that a‾∈RM\bar a \in R^M if and only if f(a‾)∈RNf(\bar a) \in R^N, for every nn-ary symbol RR and every a‾∈|M|n\bar a \in |M|^n.✦ A structure UU is the union of a family (Mi)i∈I(M_i)_{i \in I} of structures when each MiM_i is a substructure of UU and each element of |U||U| lies in some |Mi||M_i|.✦

A class with strong substructures is a pair (K,≤K)(K, \leq_K) of a class KK of structures for LL, the models of KK, and a binary relation ≤K\leq_K between structures for LL.✦ A Löwenheim-Skolem bound for (K,≤K)(K, \leq_K) is a cardinal θ≥ℵ0+|L|\theta \geq \aleph_0 + |L| such that every set A⊆|M|A \subseteq |M|, for MM a model of KK, is contained in the universe of a model NN of KK with N≤KMand∥N∥≤|A|+θ.N \leq_K M \qquad\text{and}\qquad \|N\| \leq |A| + \theta.(1)✦

An abstract elementary class in LL is a class with strong substructures (K,≤K)(K, \leq_K) with the following properties.

  1. The relation ≤K\leq_K holds only between models of KK and is a partial order on KK.

  2. If M≤KNM \leq_K N, then M⊆NM \subseteq N.

  3. The class KK is closed under isomorphism; and if M≤KNM \leq_K N, and isomorphisms e:M≅M′e\colon M \cong M' and f:N≅N′f\colon N \cong N' agree on |M||M|, then M′≤KN′M' \leq_K N'.

  4. If M0⊆M1M_0 \subseteq M_1, M0≤KM2M_0 \leq_K M_2 and M1≤KM2M_1 \leq_K M_2, then M0≤KM1M_0 \leq_K M_1.

  5. For every nonzero ordinal γ\gamma and every ≤K\leq_K-increasing chain (Mi)i<γ(M_i)_{i < \gamma} of models of KK, there is a model UU of KK that is the union of the chain, with Mi≤KUM_i \leq_K U for every ii, and with U≤KNU \leq_K N for every model NN of KK such that Mi≤KNM_i \leq_K N for every ii.

  6. The pair (K,≤K)(K, \leq_K) has a Löwenheim-Skolem bound.

The Löwenheim-Skolem number LS(K)\mathrm{LS}(K) of an abstract elementary class KK is its least Löwenheim-Skolem bound.✦ A class KK is categorical in a cardinal μ\mu when it has a model of cardinality μ\mu and any two of its models of cardinality μ\mu are isomorphic.✦ Two nonisomorphic models of KK in a cardinal μ\mu are models MM and NN of KK with ∥M∥=∥N∥=μ\|M\| = \|N\| = \mu and no isomorphism from MM onto NN.✦

Cardinals

The continuum hypothesis (CH) is the statement 2ℵ0=ℵ12^{\aleph_0} = \aleph_1.✦ The Hanf number of a cardinal κ\kappa is h(κ)=ℶ(2κ)+,h(\kappa) = \beth_{(2^\kappa)^+},(2)✦ the index (2κ)+(2^\kappa)^+ taken as the initial ordinal of the successor cardinal of 2κ2^\kappa. The endpoint is the cardinal ℶω2\beth_{\omega_2}✦, and with ξ=2ℵ1\xi = 2^{\aleph_1} the tail threshold is Λ=ℶξ+,\Lambda = \beth_{\xi^+},(3)

The Claim

Theorem 1. Assume CH. Then ℶω2=h(ℵ0),\beth_{\omega_2} = h(\aleph_0),(4)✦ and some countable relational language LL carries an abstract elementary class KK with LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0 such that K has two nonisomorphic models in ℶω2 and is categorical in every cardinal μ≥Λ.K \text{ has two nonisomorphic models in } \beth_{\omega_2} \text{ and is categorical in every cardinal } \mu \geq \Lambda.(5)✦ Under CH there is, moreover, a countable relational language LL carrying an abstract elementary class KK with LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0 such that h(ℵ0)<Λ+ and K is categorical in Λ+ but not in h(ℵ0).h(\aleph_0) < \Lambda^+ \text{ and } K \text{ is categorical in } \Lambda^+ \text{ but not in } h(\aleph_0).(6)✦ Whether or not CH holds, ℶω2<Λ.\beth_{\omega_2} < \Lambda.(7)✦

In the paper, the result reads: assume CH; then there is an abstract elementary class KK in a countable finitary relational language with LS(K)=ℵ0\mathrm{LS}(K) = \aleph_0, with at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2} = H(K), and, for Λ=ℶ(2ℵ1)+\Lambda = \beth_{(2^{\aleph_1})^+}, categorical in every cardinal μ≥Λ\mu \geq \Lambda, so that in particular λ=Λ+>H(K)\lambda = \Lambda^+ > H(K) is a categoricity cardinal from which downward transfer to H(K)H(K) fails, the paper’s H(K)H(K) being the page’s h(ℵ0)h(\aleph_0).

What Is Checked

The claim is stated over abstract elementary classes in a countable relational language, whose models are structures on sets of VV, with their Löwenheim-Skolem number, categoricity and nonisomorphic models in a cardinal, and over the Hanf number h(ℵ0)h(\aleph_0), the endpoint ℶω2\beth_{\omega_2} and the tail threshold Λ\Lambda; CH is the hypothesis of every part but (7).