A CH obstruction to a prescribed categoricity threshold
Assuming the continuum hypothesis, there is an abstract elementary class in a countable finitary relational language such that , has at least two nonisomorphic models of cardinality , and putting , the class is categorical in every cardinal ; in particular, is a categoricity cardinal from which downward transfer to fails.
The proof of Theorem 1.1 follows directly from Theorems 3.13, 4.5, and 5.10 together with standard cardinal arithmetic under CH.
“Theorem 1.1. Assume the continuum hypothesis. There is an abstract elementary class K in a countable finitary relational language such that (i) LS(K) = \aleph_0; (ii) K has at least two nonisomorphic models of cardinality \beth_{\omega_2} = H(K); (iii) putting \Lambda = \beth_{(2^{\aleph_1})^+}, the class K is categorical in every cardinal \mu \ge \Lambda. In particular, \lambda = \Lambda^+ > H(K) is a categoricity cardinal from which downward transfer to H(K) fails.” · Show in paper