Result 240, Mathematical logic

Shelah's eventual categoricity and the prescribed-threshold obstruction

Proves Shelah's eventual categoricity conjecture in ZFC: for each bound on the Löwenheim–Skolem number, a uniform threshold makes categoricity of an abstract elementary class in one cardinal above that threshold imply categoricity throughout the same tail. Categoricity means uniqueness up to isomorphism at a given cardinality. Under the continuum hypothesis, a proposed specific Hanf threshold need not suffice.

Lean formalization Proof

The bigger picture

Why it matters

When does uniqueness at one infinite size force uniqueness at every sufficiently large size? The manuscripts claim an answer for broad families of mathematical structures, while showing that a proposed starting point can be too low.

What changes?

The eventual-categoricity manuscript reports a ZFC proof for abstract elementary classes, families of structures with a coherent notion of substructure. Categoricity means uniqueness up to isomorphism, or structural identity, at a given size. For each infinite bound on the Löwenheim-Skolem number, which controls sizes of submodels containing specified elements, it claims a uniform threshold depending only on that bound. Categoricity at any one cardinal at or above this threshold forces categoricity at every cardinal at or above it.

What does that help mathematicians do?

Under the continuum hypothesis, the threshold-obstruction manuscript constructs a class with countable Löwenheim-Skolem number that is categorical in every sufficiently large size, yet has multiple nonisomorphic models at beth indexed by omega two. This equals the proposed bound, beth indexed by the successor cardinal of the continuum. Thus, assuming ZFC is consistent, that prescribed-threshold claim is not provable in ZFC: eventual uniqueness does not guarantee downward transfer to this particular size.

Are there practical applications?

The immediate value is foundational: the claimed theorem would let researchers establish uniqueness across an entire range of infinite sizes from uniqueness at just one sufficiently large size, using standard set-theoretic axioms. This is a structural reduction, not an algorithm for testing uniqueness. The obstruction also explains why an eventual classification theorem must be distinguished from a sharper claim about where classification begins.

This section was generated by GPT-6 Astra Medium. This explanation is based on the result summary and manuscript abstracts below. This context is separate from OpenAI's source text.

2 manuscripts

A CH obstruction to a prescribed categoricity threshold

September 24, 2026 31 pages Main result formalized in Lean

Assuming the continuum hypothesis, we construct an abstract elementary class with Löwenheim–Skolem number ℵ0 that is categorical in every sufficiently large cardinal but has at least two nonisomorphic models of cardinality ℶω2\beth_{\omega_2}. Thus categoricity does not transfer down to the proposed bound ℶ(2ℵ0)+\beth_{(2^{\aleph_0})^+}, which equals ℶω2\beth_{\omega_2} under CH. Consequently, if ZFC is consistent, the prescribed-threshold form of Shelah's categoricity conjecture is not provable in ZFC.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:A-CH-Obstruction-to-a-Prescribed-Categoricity-Threshold-September-24-2026,
  author = {{OpenAI}},
  title = {{A CH obstruction to a prescribed categoricity threshold}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/A-CH-Obstruction-to-a-Prescribed-Categoricity-Threshold-September-24-2026/paper.pdf}{OAI:A-CH-Obstruction-to-a-Prescribed-Categoricity-Threshold-September-24-2026}},
  year = {2026}
}

Eventual categoricity for abstract elementary classes

September 24, 2026 121 pages

We prove Shelah's eventual categoricity conjecture for abstract elementary classes in ZFC. For each infinite bound on the Löwenheim–Skolem number there is a uniform threshold such that categoricity in any one cardinal at or above that threshold implies categoricity in every cardinal at or above the same threshold.

PDF LaTeX source
Cite (BibTeX) 
@misc{OAI:Eventual-Categoricity-for-Abstract-Elementary-Classes-September-24-2026,
  author = {{OpenAI}},
  title = {{Eventual categoricity for abstract elementary classes}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Eventual-Categoricity-for-Abstract-Elementary-Classes-September-24-2026/paper.pdf}{OAI:Eventual-Categoricity-for-Abstract-Elementary-Classes-September-24-2026}},
  year = {2026}
}

Lean formalization

OpenAI's note on what the formalization covers, from lean/docs/240.md.

Shelah's eventual categoricity and the prescribed-threshold obstruction

The following describes the scope of the Lean formalization related to the following accompanying paper(s):

Scope

Under the continuum hypothesis, the formalized result refutes the proposed transfer of categoricity down to the Hanf threshold. It gives an abstract elementary class in a countable relational language, with Löwenheim–Skolem number ℵ0\aleph_0, that has two nonisomorphic models at ℶω2=h(ℵ0)\beth_{\omega_2}=h(\aleph_0) but is categorical in every cardinal at least ℶ(2ℵ1)+\beth_{(2^{\aleph_1})^+}.

No amalgamation, joint embedding, tameness, or absence-of-maximal-models assumption is imposed. The later canonical-point obstruction and the separate eventual-categoricity theorem are not included.

Comparator links

Result Comparator statement
CH categoricity-threshold obstruction CHObstruction.lean

Data from github.com/openai/math at commit adc7f12, committed October 6, 2026 at 21:58 UTC, last checked for changes about 11 hours ago. Titles, subjects, summaries, abstracts and Lean notes are OpenAI's; page counts are read from the PDFs. The map, related results, search, kinds of results and the named-problem index are Emergent Mind's, built with text embeddings and an LLM, and may contain errors.

An Emergent Mind Labs project. Emergent Mind is not affiliated with OpenAI. None of these results has been peer reviewed. Cite the manuscripts themselves, using the BibTeX on each result's page.