Definition
In mathematical logic and set theory, a transitive model is a structure $M = \langle X, \in^{M} \rangle$ such that the underlying set $X$ is transitive (i.e., for every $a, b$, if $a \in b$ and $b \in X$, then $a \in X$) and the membership relation $\in^{M}$ coincides with the standard set‑theoretic membership $\in$ restricted to $X$. Consequently, every element of an element of $M$ is itself an element of $M$. Transitive models are frequently employed as inner models of Zermelo–Fraenkel set theory (ZF) or its extensions.
Overview
Transitive models serve as a central tool in the study of consistency and independence results in set theory. Because the ambient universe $V$ of all sets satisfies the axiom of foundation, transitivity guarantees that the model does not contain “non‑well‑founded” objects relative to the ambient universe. This property simplifies the interpretation of formulas: the truth of a first‑order statement in a transitive model can often be evaluated using the same semantics as in $V$. Notable examples include Gödel’s constructible universe $L$, which is a transitive class model of ZF + Choice, and various inner models built using large‑cardinal hypotheses. Transitive models also appear in recursion theory, where a transitive recursive model is a recursively presented model whose domain is a transitive set of natural numbers.
Etymology/Origin
The adjective transitive derives from the Latin transitivus, meaning “passing across”. In set‑theoretic terminology, a set $X$ is called transitive when the membership relation “passes through” elements of its elements, i.e., closure under the $\in$ relation. The phrase model follows the standard usage in mathematical logic for a structure interpreting a formal language.
Characteristics
| Feature | Description |
|---|---|
| Domain | A transitive set (or class) $X$ such that $\forall a,b,(a\in b\land b\in X \rightarrow a\in X)$. |
| Membership relation | Identical to the ambient $\in$; formally $\in^{M} = \in!\upharpoonright! X$. |
| Closure properties | Closed under all basic set‑forming operations that are definable in the language, e.g., pairing, union, powerset (if the model satisfies the corresponding axioms). |
| Elementarity | Frequently considered as elementary submodels of $V$ (i.e., $M \prec V$), though transitivity alone does not guarantee elementarity. |
| Foundational compliance | Satisfies the Axiom of Foundation automatically because any descending $\in$-chain in $M$ is also a descending chain in $V$. |
| Typical examples | Gödel’s constructible universe $L$; the hereditarily countable sets $H_{\omega_1}$; inner models derived from large cardinal embeddings. |
| Limitations | Not every model of set theory can be made transitive; certain consistency proofs require non‑transitive models (e.g., countable, non‑standard models of ZF). |
Related Topics
- Model theory – the broader study of structures interpreting formal languages.
- Inner model – a transitive class containing all ordinals that satisfies ZF or ZFC.
- Constructible universe (L) – the canonical transitive model built via Gödel’s definability hierarchy.
- Elementary submodel – a substructure preserving the truth of all first‑order formulas; many transitive models are elementary submodels of $V$.
- Non‑standard model – models of set theory that are not transitive and may contain “ill‑founded” sets.
- Reflection principle – a principle often proven using transitive sets that approximate the universe.
Transitive models thus constitute a foundational concept for analyzing the internal consistency and relative strength of set‑theoretic axioms.