OctoInformBeta

Shelah's eventual categoricity and the prescribed-threshold obstruction

Let KK be an abstract elementary class, with Löwenheim-Skolem number LS(K)\mathrm{LS}(K). The class KK is categorical in a cardinal κ\kappa when it has a model of cardinality κ\kappa and any two of its models of cardinality κ\kappa are isomorphic. For an infinite cardinal κ\kappa, let h(κ)=ℶ(2κ)+h(\kappa)=\beth_{(2^\kappa)^+}, where the beth hierarchy starts at ℶ0=ℵ0\beth_0=\aleph_0 and the successor cardinal (2κ)+(2^\kappa)^+ is identified with its initial ordinal. Put H(K)=h(LS(K))H(K)=h(\mathrm{LS}(K)). The prescribed-threshold form of Shelah’s categoricity conjecture asserts that every abstract elementary class KK categorical in some cardinal λ≥H(K)\lambda\ge H(K) is categorical in every cardinal μ≥H(K)\mu\ge H(K), with no assumption such as amalgamation or tameness. Its qualitative form, eventual categoricity, asks for a cardinal χ(κ)\chi(\kappa), depending only on the infinite cardinal κ\kappa, such that if LS(K)≤κ\mathrm{LS}(K)\le\kappa and KK is categorical in some λ≥χ(κ)\lambda\ge\chi(\kappa), then KK is categorical in every μ≥χ(κ)\mu\ge\chi(\kappa).

For complete first-order theories in a countable language, Morley proved that categoricity in one uncountable cardinal implies categoricity in every uncountable cardinal. The exact formulation of the prescribed-threshold form, with the threshold H(K)H(K) included in both inequalities, appears in Šaroch and Trlifaj. By Shelah, a model of KK of cardinality H(K)H(K) gives arbitrarily large models of KK. Vasey proved that, when KK has amalgamation and is LS(K)\mathrm{LS}(K)-tame, categoricity in a successor cardinal λ≥H(K)\lambda\ge H(K) implies categoricity in every μ≥H(K)\mu\ge H(K). Espindola claimed the transfer at the prescribed threshold for arbitrary abstract elementary classes.

Let Λ=ℶ(2ℵ1)+\Lambda=\beth_{(2^{\aleph_1})^+}. Under CH, the preprint constructs an abstract elementary class KK in a countable finitary relational language with LS(K)=ℵ0\mathrm{LS}(K)=\aleph_0 that has two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2}=H(K) and is categorical in every cardinal μ≥Λ\mu\ge\Lambda. In particular, the prescribed-threshold form fails under CH: KK is categorical in Λ+>H(K)\Lambda^+>H(K) and not in H(K)H(K). From this theorem and Gödel’s relative consistency of CH, the preprint derives a corollary that the Lean library does not contain: if ZFC is consistent, the prescribed-threshold form is not provable in ZFC.

The Lean library Categoricity proves this theorem, with h(ℵ0)h(\aleph_0) in place of H(K)H(K). As the preprint does, the Lean library takes CH as a hypothesis of this theorem. Without CH, the Lean library proves ℶω2<Λ\beth_{\omega_2}<\Lambda. Lean has checked every result of the Lean library, so the Lean library is the reference: where the preprint states a result differently, the statement on these pages is the Lean library’s, with the preprint’s beside it. The preprint is a guide only: it gives the results their order and their names.

The Lean library: Categoricity

Categoricity is a Lean library: 35 items, in five groups. Each has a page written by OctoInform, listed below.

§1. Introduction 2 items
  1. AECs, categoricity, the Hanf function and the two cardinals The continuum hypothesis, the Hanf function and categoricity.
  2. Theorem 1.1 The continuum hypothesis blocks categoricity transfer to the Hanf number.
§2. Countable diagrams and their tests 6 items
  1. Colors S = 2^ω/=* Colors are binary sequences up to finitely many changes.
  2. Definition 2.1 Valid diagrams on labels and their quotients.
  3. Lemma 2.2 Under the continuum hypothesis, colors code diagrams of positive arity.
  4. Restriction of diagrams Diagrams restrict along injections of positions, and restrictions compose.
  5. Definition 2.3 The full subsequence test for colorings of tuples.
  6. Lemma 2.4 Restriction along an injection gives an injective map of quotients.
§3. The abstract elementary class 13 items
  1. Definition 3.1 When a class of structures is abstract elementary.
  2. Definition 3.2 Basic structures in normal form and their coded copies.
  3. Definition 3.3 Basic inclusion as a map of normal forms.
  4. Lemma 3.4 Base orders of normal forms have at most ℵ1\aleph_1 points.
  5. Lemma 3.5 The size of a normal form and of its coded structure.
  6. Lemma 3.6 Tests along a map match the target’s off countable sets.
  7. Definition 3.7 Objects and strong substructures of the class KK.
  8. Lemma 3.8 Arrays of bits as normal forms, realized on ordinals.
  9. Lemma 3.9 Strong substructure in the array class is a coherent order.
  10. Lemma 3.10 Under the continuum hypothesis, the array class is closed under directed unions.
  11. Lemma 3.11 Small sets lie in small dense convex suborders.
  12. Lemma 3.12 Every subset lies in a small strong substructure.
  13. Theorem 3.13 The array class is an abstract elementary class.
§4. Two models at the prescribed endpoint 6 items
  1. Lemma 4.1 An ω2\omega_2-sequence of functions on ω1\omega_1 increasing modulo countable sets.
  2. Lemma 4.2 A copy of Vω2V_{\omega_2} has cardinality ℶω2\beth_{\omega_2}.
  3. Lemma 4.3 Nonempty finite sets have countable closures growing with the set.
  4. The bad sets F_X and the diagrams D_{t,β} Tagged membership diagrams of tuples from Vω2V_{\omega_2}.
  5. Lemma 4.4 Each tuple fails the test at only countably many tags.
  6. Theorem 4.5 Under the continuum hypothesis, KK has two nonisomorphic models at ℶω2\beth_{\omega_2}.
§5. A bound on uncountable base orders and categoricity on a tail 8 items
  1. Lemma 5.1 Ordinal tags bound the ranks of the Mostowski collapse.
  2. Lemma 5.2 Under the continuum hypothesis no color pattern passes every test.
  3. Lemma 5.4 The tail threshold is a strong limit of cofinality ξ+\xi^+.
  4. Lemma 5.5 Large homogeneous sets below a strong limit cardinal.
  5. Lemma 5.6 Large sets realize one color pattern at every finite size.
  6. Proposition 5.7 Objects with uncountable base have fewer than Λ\Lambda index points.
  7. Lemma 5.9 Countable base orders and equinumerous index sets give isomorphic structures.
  8. Theorem 5.10 Under the continuum hypothesis the class KK is categorical on a tail.

No item matches.