nLab transitive set

Transitive sets

Transitive sets


In unsorted material set theory, a pure set SS is called transitive if abSa\in b\in S implies that aSa\in S. Note that this does not mean that \in is a transitive binary relation on SS itself. (In fact, assuming the axiom of foundation, \in is a transitive relation on SS precisely when SS is a von Neumann ordinal number.)

Transitive sets are a natural place to look for inner model?s of a material set theory: that is, sets SS such that SS together with the restriction of \in to SS satisfies some or all of the axioms of the set theory. This is especially so because of Mostowski's collapsing lemma that any extensional well-founded relation is isomorphic to a transitive set.

Transitive closures

In ZFC, one can prove that every pure set xx is contained in a least transitive pure set, called its transitive closure. This can be defined as the set of all yy such that there is a chain y=x nx 0=xy = x_n \in \cdots \in x_0 = x for some natural number nn. The proof that this set exists requires the axiom of replacement and the property of induction for unbounded formulas (which follows from the axiom of separation). In set theories that are too weak to prove the existence of transitive closures in this way, their existence is sometimes assumed explicitly, as the axiom of transitive closure.

Modeling pure sets

Given the existence of transitive closures, pure sets can be identified with subsets of transitive sets, and hence (given Mostowski’s lemma) with subsets of extensional well-founded relations. This latter characterization is completely structural, and thus can be used to model pure sets in structural set theory.

Last revised on October 24, 2022 at 21:25:01. See the history of this page for a list of all contributions to it.