End extension

Template:Short description In model theory and set theory, which are disciplines within mathematics, a model $𝔅=⟨B,F⟩$ of some axiom system of set theory $T$ in the language of set theory is an end extension of $𝔄=⟨A,E⟩$, in symbols $𝔄{\subseteq }_{\text{end}}𝔅$, if

1. $𝔄$ is a substructure of $𝔅$, (i.e., $A\subseteq B$ and $E=F{|}_A$), and
2. $b\in A$ whenever $a\in A$ and $bFa$ hold, i.e., no new elements are added by $𝔅$ to the elements of $A$.

The second condition can be equivalently written as $\{b\in A:bEa\}=\{b\in B:bFa\}$ for all $a\in A$.

For example, $⟨B,\in ⟩$ is an end extension of $⟨A,\in ⟩$ if $A$ and $B$ are transitive sets, and $A\subseteq B$.

A related concept is that of a top extension (also known as rank extension), where a model $𝔅=⟨B,F⟩$ is a top extension of a model $𝔄=⟨A,E⟩$ if $𝔄{\subseteq }_{\text{end}}𝔅$ and for all $a\in A$ and $b\in B\setminus A$, we have $rank(b)>rank(a)$, where $rank(\cdot )$ denotes the rank of a set.

Existence

Keisler and Morley showed that every countable model of ZF has an end extension which is also an elementary extension. If the elementarity requirement is weakened to being elementary for formulae that are ${\mathrm{\Sigma }}_n$ on the Lévy hierarchy, every countable structure in which ${\mathrm{\Sigma }}_n$-collection holds has a ${\mathrm{\Sigma }}_n$-elementary end extension.