logic-foundations / Model theory; abstract elementary classes

The prescribed Hanf threshold in Shelah's categoricity conjecture is not provable in ZFC

Theorem 1.1 (assuming CH): there is an AEC KK in a countable finitary relational language with LS(K)=ℵ0LS(K)=\aleph_0, at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2}=H(K), and categorical in every cardinal ≥Λ=ℶ(2ℵ1)+\ge\Lambda=\beth_{(2^{\aleph_1})^+}. So categoricity at Λ+\Lambda^+ does not transfer down to H(K)H(K), and the prescribed-threshold form is not a theorem of ZFC (if ZFC is consistent). The same class is eventually categorical, so this is compatible with the qualitative conjecture. It does not decide whether the prescribed form can hold under other hypotheses (for example failure of CH), and it does not concern the ℶω1\beth_{\omega_1} threshold for Lω1,ωL_{\omega_1,\omega}.

22Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

logic-foundationsSep 24, 2026Significance 22/100Registry: contested

The prescribed Hanf threshold in Shelah's categoricity conjecture is not provable in ZFC

Prior state unknown→disproved

Theorem 1.1 (assuming CH): there is an AEC KK in a countable finitary relational language with LS(K)=ℵ0LS(K)=\aleph_0, at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2}=H(K), and categorical in every cardinal ≥Λ=ℶ(2ℵ1)+\ge\Lambda=\beth_{(2^{\aleph_1})^+}. So categoricity at Λ+\Lambda^+ does not transfer down to H(K)H(K), and the prescribed-threshold form is not a theorem of ZFC (if ZFC is consistent). The same cl…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review! Disputed

Research memory

Claims and attempts

Scoped claims

Disputed

Theorem 1.1 (assuming CH): there is an AEC KK in a countable finitary relational language with LS(K)=ℵ0LS(K)=\aleph_0, at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2}=H(K), and categorical in every cardinal ≥Λ=ℶ(2ℵ1)+\ge\Lambda=\beth_{(2^{\aleph_1})^+}. So categoricity at Λ+\Lambda^+ does not transfer down to H(K)H(K), and the prescribed-threshold form is not a theorem of ZFC (if ZFC is consistent). The same class is eventually categorical, so this is compatible with the qualitative conjecture. It does not decide whether the prescribed form can hold under other hypotheses (for example failure of CH), and it does not concern the ℶω1\beth_{\omega_1} threshold for Lω1,ωL_{\omega_1,\omega}.

This result conflicts with a published theorem. The release's manuscript states that its construction contradicts Espindola's published Theorem 4.1, which claims categoricity transfer at this bound. Until the conflict is settled in public, the entry is Contested. Theorem 1.1 (assuming CH): there is an AEC KK in a countable finitary relational language with LS(K)=ℵ0LS(K)=\aleph_0, at least two nonisomorphic models of cardinality ℶω2=H(K)\beth_{\omega_2}=H(K), and categorical in every cardinal ≥Λ=ℶ(2ℵ1)+\ge\Lambda=\beth_{(2^{\aleph_1})^+}. So categoricity at Λ+\Lambda^+ does not transfer down to H(K)H(K), and the prescribed-threshold form is not a theorem of ZFC (if ZFC is consistent). The same class is eventually categorical, so this is compatible with the qualitative conjecture. It does not decide whether the prescribed form can hold under other hypotheses (for example failure of CH), and it does not concern the ℶω1\beth_{\omega_1} threshold for Lω1,ωL_{\omega_1,\omega}.

Recorded attempts

Evidence graph

Connected research record

The prescribed Hanf threshold in Shelah's categoricity conjecture is not provable in ZFC — Mathematical Frontier Network