Abstract elementary class explained

In model theory, a discipline within mathematical logic, an abstract elementary class, or AEC for short, is a class of models with a partial order similar to the relation of an elementary substructure of an elementary class in first-order model theory. They were introduced by Saharon Shelah.[1]

Definition

\langleK,\precK\rangle

, for

K

a class of structures in some language

L=L(K)

, is an AEC if it has the following properties:

\precK

is a partial order on

K

.

M\precKN

then

M

is a substructure of

N

.

K

is closed under isomorphisms, and if

M,N,M',N'\inK,

f\colonM\simeqM',

g\colonN\simeqN',

f\subseteqg,

and

M\precKN,

then

M'\precKN'.

M1\precKM3,

M2\precKM3,

and

M1\subseteqM2,

then

M1\precKM2.

\gamma

is an ordinal and

\{M\alpha\mid\alpha<\gamma\}\subseteqK

is a chain (i.e.

\alpha<\beta<\gamma\impliesM\alpha\precKM\beta

), then:

cup\alpha<\gammaM\alpha\inK

M\alpha\precKN

, for all

\alpha<\gamma

, then

cup\alpha<\gammaM\alpha\precKN

\mu\ge|L(K)|+\aleph0

, such that if

A

is a subset of the universe of

M

, then there is

N

in

K

whose universe contains

A

such that

\|N\|\leq|A|+\mu

and

N\precKM

. We let

\operatorname{LS}(K)

denote the least such

\mu

and call it the Löwenheim–Skolem number of

K

.

Note that we usually do not care about the models of size less than the Löwenheim–Skolem number and often assume that there are none (we will adopt this convention in this article). This is justified since we can always remove all such models from an AEC without influencing its structure above the Löwenheim–Skolem number.

A

K

-embedding is a map

f:MN

for

M,N\inK

such that

f[M]\precKN

and

f

is an isomorphism from

M

onto

f[M]

. If

K

is clear from context, we omit it.

Examples

The following are examples of abstract elementary classes:[2]

\operatorname{Mod}(T)

of models of T together with elementary substructure forms an AEC with Löwenheim–Skolem number |T|.

\phi

is a sentence in the infinitary logic
L
\omega1,\omega
, and

l{F}

is a countable fragment containing

\phi

, then

\langle\operatorname{Mod}(T),\precl{F

} \rangle is an AEC with Löwenheim–Skolem number

\aleph0

. This can be generalized to other logics, like

L\kappa,

, or
L
\omega1,\omega

(Q)

, where

Q

expresses "there exists uncountably many".

\aleph1

-saturated models of T, together with elementary substructure, is an AEC with Löwenheim–Skolem number
\aleph0
2
.

Common assumptions

AECs are very general objects and one usually make some of the assumptions below when studying them:

K

has amalgamation if for any triple

M0,M1,M2\inK

with

M0\precKM1

,

M0\precKM2

, there is

N\inK

and embeddings of

M1

and

M2

inside

N

that fix

M0

pointwise.

Note that in elementary classes, joint embedding holds whenever the theory is complete, while amalgamation and no maximal models are well-known consequences of the compactness theorem. These three assumptions allow us to build a universal model-homogeneous monster model

ak{C}

, exactly as in the elementary case.

Another assumption that one can make is tameness.

Shelah's categoricity conjecture

Shelah introduced AECs to provide a uniform framework in which to generalize first-order classification theory. Classification theory started with Morley's categoricity theorem, so it is natural to ask whether a similar result holds in AECs. This is Shelah's eventual categoricity conjecture. It states that there should be a Hanf number for categoricity:

For every AEC K there should be a cardinal

\mu

depending only on

\operatorname{LS}(K)

such that if K is categorical in some

λ\geq\mu

(i.e. K has exactly one (up to isomorphism) model of size

λ

), then K is categorical in

\theta

for all

\theta\ge\mu

.

Shelah also has several stronger conjectures: The threshold cardinal for categoricity is the Hanf number of pseudoelementary classes in a language of cardinality LS(K). More specifically when the class is in a countable language and axiomaziable by an

L
\omega1,\omega
sentence the threshold number for categoricity is
\beth
\omega1
. This conjecture dates back to 1976.

Several approximations have been published (see for example the results section below), assuming set-theoretic assumptions (such as the existence of large cardinals or variations of the generalized continuum hypothesis), or model-theoretic assumptions (such as amalgamation or tameness). As of 2014, the original conjecture remains open.

Results

The following are some important results about AECs. Except for the last, all results are due to Shelah.

K

is
\operatorname{PC}
2\operatorname{LS(K)
}: it is a reduct of a class of models of a first-order theory omitting at most

2\operatorname{LS(K)}

types.

K

which has a model of size
\beth
(2\operatorname{LS(K)

)+}

has models of arbitrarily large sizes.

λ

and

λ+

and

2λ<

λ+
2
, then K has amalgamation for models of size

λ

.
\operatorname{PC}
\aleph0
AEC with Löwenheim–Skolem number

\aleph0

and K is categorical in

\aleph0

and

\aleph1

, then K has a model of size

\aleph2

. In particular, no sentence of
L
\omega1,\omega

(Q)

can have exactly one uncountable model.

λ

, then K is categorical in all high-enough

\mu\leλ

.

See also

References

Notes and References

  1. .
  2. , Section 1.
  3. , Theorem 3.4.
  4. , Corollary 3.5. Note that there is a typo there and that
    2\operatorname{LS(K)
    2
    } should be replaced by

    2\operatorname{LS(K)}

    .
  5. , Theorem 4.3.
  6. , Theorem 5.1.
  7. .
  8. This is due to Will Boney, but combines results of many people, including Grossberg, Makkai, Shelah, and VanDieren. A proof appears in, Theorem 7.5.