Transitive Set

Definition

A set $X$ is transitive iff every element of an element of $X$ is itself an element of $X$: $\forall x\in X.\forall y\in x.y\in X.$

Equivalently, every element of $X$ is a subset of $X$: $\forall x\in X.x\subseteq X.$

Or equivalently, the union $\bigcup X\subseteq X$.

Motivation

Transitivity captures the idea that a set is “downward closed” under membership: if you can reach an element by following $\in$ from inside $X$, that element is already in $X$. This makes transitive sets well-behaved containers — they do not “point outside themselves.”

Examples

• $\varnothing$ is vacuously transitive.
• $\{\varnothing \}$ is transitive: its only element is $\varnothing$, which has no elements to check.
• $\{\varnothing ,\{\varnothing \}\}$ is transitive: elements are $\varnothing$ and $\{\varnothing \}$; the elements of $\{\varnothing \}$ are just $\varnothing$, which is already in the set.
• The set $\omega =\mathbb{N}$ (in the von Neumann construction) is transitive: every natural number $n=\{0,1,\dots ,n-1\}$ is a subset of $\omega$.
• Every ordinal is a transitive set (this is part of the definition of a von Neumann ordinal).

A non-example: $\{\{\varnothing \}\}$ is not transitive, because $\{\varnothing \}\in \{\{\varnothing \}\}$ but $\varnothing \notin \{\{\varnothing \}\}$.

Role in the Definition of Ordinals

In the von Neumann construction, an ordinal is defined as a transitive set that is well-ordered by the membership relation $\in$. Transitivity ensures that the elements of an ordinal are exactly the smaller ordinals, giving the recursive structure: $\alpha =\{\beta \mid \beta <\alpha \}.$

This makes ordinals simultaneously sets of ordinals and ordinals themselves, with membership and the ordinal ordering coinciding.

Transitive Closure

Every set $X$ can be enlarged to a transitive set by taking its transitive closure $\mathrm{TC}(X)$: the smallest transitive set containing $X$ as a subset. It can be constructed explicitly by iterating the union operation: $\mathrm{TC}(X)=X\cup \bigcup X\cup \bigcup \bigcup X\cup \cdots ={\bigcup }_{n\in \omega }{\bigcup }^{n}X,$ where ${\bigcup }^{0}X=X$ and ${\bigcup }^{n+1}X=\bigcup ({\bigcup }^{n}X)$.

The transitive closure exists for every set (using the axiom of infinity and replacement) and is unique.

Connection to the Axiom of Foundation

The axiom of foundation (regularity) ensures that $\in$ is well-founded on every transitive set. Together with transitivity, this means that any transitive set is well-ordered by $\in$ iff it is an ordinal.

$\in$-induction — provable from foundation — is most naturally stated and applied over transitive sets: if $P$ holds for all elements of all elements of $X$ (i.e. all members of $\bigcup X$), then $P$ holds for all elements of $X$.

Transitive Models

In set theory, a transitive model of ZF is a transitive set $M$ that satisfies the axioms of ZF when membership is interpreted as the actual $\in$ relation. Transitivity ensures that the model’s notion of membership agrees with the ambient universe, making such models particularly well-behaved.

Related Concepts

• Ordinal
• Set Theory
• Axiom of Foundation
• Well-founded Relation
• Well-Ordering
• Subset
• Replacement (Set Theory)
• Axiom of Infinity