In set theory, a branch of mathematics, a set is called **transitive** if either of the following equivalent conditions hold:

Similarly, a class is transitive if every element of is a subset of .

Using the definition of ordinal numbers suggested by John von Neumann, ordinal numbers are defined as hereditarily transitive sets: an ordinal number is a transitive set whose members are also transitive (and thus ordinals). The class of all ordinals is a transitive class.

Any of the stages and leading to the construction of the von Neumann universe and Gödel's constructible universe are transitive sets. The universes and themselves are transitive classes.

This is a complete list of all finite transitive sets with up to 20 brackets:^{[1]}

A set is transitive if and only if , where is the union of all elements of that are sets, .

If is transitive, then is transitive.

If and are transitive, then and are transitive. In general, if is a class all of whose elements are transitive sets, then and are transitive. (The first sentence in this paragraph is the case of .)

A set that does not contain urelements is transitive if and only if it is a subset of its own power set, The power set of a transitive set without urelements is transitive.

The **transitive closure** of a set is the smallest (with respect to inclusion) transitive set that includes (i.e. ).^{[2]} Suppose one is given a set , then the transitive closure of is

Proof. Denote and . Then we claim that the set

is transitive, and whenever is a transitive set including then .

Assume . Then for some and so . Since , . Thus is transitive.

Now let be as above. We prove by induction that for all , thus proving that : The base case holds since . Now assume . Then . But is transitive so , hence . This completes the proof.

Note that this is the set of all of the objects related to by the transitive closure of the membership relation, since the union of a set can be expressed in terms of the relative product of the membership relation with itself.

The transitive closure of a set can be expressed by a first-order formula: is a transitive closure of iff is an intersection of all transitive supersets of (that is, every transitive superset of contains as a subset).

Transitive classes are often used for construction of interpretations of set theory in itself, usually called inner models. The reason is that properties defined by bounded formulas are absolute for transitive classes.

A transitive set (or class) that is a model of a formal system of set theory is called a *transitive model* of the system (provided that the element relation of the model is the restriction of the true element relation to the universe of the model). Transitivity is an important factor in determining the absoluteness of formulas.

In the superstructure approach to non-standard analysis, the non-standard universes satisfy *strong transitivity*. Here, a class is defined to be strongly transitive if, for each set , there exists a transitive superset with . A strongly transitive class is automatically transitive. This strengthened transitivity assumption allows one to conclude, for instance, that contains the domain of every binary relation in .^{[3]}

**^**"Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group)".*OEIS*.**^**Ciesielski, Krzysztof (1997).*Set theory for the working mathematician*. Cambridge: Cambridge University Press. p. 164. ISBN 978-1-139-17313-1. OCLC 817922080.**^**Goldblatt (1998) p.161

- Ciesielski, Krzysztof (1997),
*Set theory for the working mathematician*, London Mathematical Society Student Texts, vol. 39, Cambridge: Cambridge University Press, ISBN 0-521-59441-3, Zbl 0938.03067 - Goldblatt, Robert (1998),
*Lectures on the hyperreals. An introduction to nonstandard analysis*, Graduate Texts in Mathematics, vol. 188, New York, NY: Springer-Verlag, ISBN 0-387-98464-X, Zbl 0911.03032 - Jech, Thomas (2008) [originally published in 1973],
*The Axiom of Choice*, Dover Publications, ISBN 0-486-46624-8, Zbl 0259.02051

Overview | ||
---|---|---|

Axioms | ||

Operations | - Cartesian product
- Complement (i.e. set difference)
- De Morgan's laws
- Disjoint union
- Identities
- Intersection
- Power set
- Symmetric difference
- Union
| |

- Concepts
- Methods
| ||

Set types | ||

Theories | ||

- Paradoxes
- Problems
| ||

Set theorists |

General | |||||||||
---|---|---|---|---|---|---|---|---|---|

Theorems (list) and paradoxes | |||||||||

Logics |
| ||||||||

Set theory |
| ||||||||

Formal systems (list), language and syntax |
| ||||||||

Proof theory | |||||||||

Model theory | |||||||||

Computability theory | |||||||||

Related | |||||||||