Transitive set

<h2 id="examples">Examples</h2>
Using the definition of <a href="/facts/Ordinal_number/GelFLjJt">ordinal numbers</a> suggested by <a href="/facts/John_von_Neumann/aUk6urof">John von Neumann</a>, ordinal numbers are defined as <a href="/facts/Hereditary_property/J64xYUGG">hereditarily</a> 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 
 
 
 
 
 V
 
 α
 
 
 
 
 {\displaystyle V_{\alpha }}
 
 and 
 
 
 
 
 L
 
 α
 
 
 
 
 {\displaystyle L_{\alpha }}
 
 leading to the construction of the <a href="/facts/Von_Neumann_universe/EhkJAxXc">von Neumann universe</a> 
 
 
 
 V
 
 
 {\displaystyle V}
 
 and <a href="/facts/G%C3%B6del%27s_constructible_universe/pxU0cmL3">Gödel's constructible universe</a> 
 
 
 
 L
 
 
 {\displaystyle L}
 
 are transitive sets. The <a href="/facts/Universe_(mathematics)/v2oJnu4e">universes</a> 
 
 
 
 V
 
 
 {\displaystyle V}
 
 and 
 
 
 
 L
 
 
 {\displaystyle L}
 
 themselves are transitive classes.
This is a complete list of all finite transitive sets with up to 20 brackets:<a class="footnote-ref" id="fnref:1" href="#fn:1">1</a>

<ul><li>
 
 
 
 {
 }
 ,
 
 
 {\displaystyle \{\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 }
 ,
 
 
 {\displaystyle \{\{\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\},\{\{\}\}\},\{\{\{\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\}\},\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\},\{\{\{\}\}\}\}\},\{\{\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\{\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\{\}\}\}\},\{\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\{\}\}\},\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\}\},\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\{\{\}\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\{\}\}\}\},\{\{\},\{\{\},\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\{\}\}\}\},\{\{\},\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\{\},\{\{\}\}\}\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\{\}\}\},\{\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\},\{\{\{\}\}\}\}\},\{\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\{\}\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\},\{\{\{\}\}\}\},\{\{\{\}\},\{\{\},\{\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\}\},\{\{\{\}\}\}\},\{\{\},\{\{\}\},\{\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\{\},\{\{\}\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\},\{\{\{\}\},\{\{\},\{\{\}\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 {
 {
 }
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\{\{\}\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 }
 ,
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\{\},\{\{\}\}\}\},\{\{\},\{\{\}\}\}\},}
 
</li>
<li>
 
 
 
 {
 {
 }
 ,
 {
 {
 }
 }
 ,
 {
 {
 {
 }
 }
 }
 ,
 {
 {
 {
 {
 }
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 }
 }
 }
 ,
 {
 {
 }
 ,
 {
 {
 {
 }
 }
 }
 }
 }
 .
 
 
 {\displaystyle \{\{\},\{\{\}\},\{\{\{\}\}\},\{\{\{\{\}\}\}\},\{\{\},\{\{\}\}\},\{\{\},\{\{\{\}\}\}\}\}.}
 
</li></ul>
<h2 id="properties">Properties</h2>
A set 
 
 
 
 X
 
 
 {\displaystyle X}
 
 is transitive if and only if 
 
 
 
 ⋃
 X
 ⊆
 X
 
 
 {\textstyle \bigcup X\subseteq X}
 
, where 
 
 
 
 ⋃
 X
 
 
 {\textstyle \bigcup X}
 
 is the <a href="/facts/Union_(set_theory)/KVVXKfWl">union</a> of all elements of 
 
 
 
 X
 
 
 {\displaystyle X}
 
 that are sets, 
 
 
 
 ⋃
 X
 =
 {
 y
 ∣
 ∃
 x
 ∈
 X
 :
 y
 ∈
 x
 }
 
 
 {\textstyle \bigcup X=\{y\mid \exists x\in X:y\in x\}}
 
. 
If 
 
 
 
 X
 
 
 {\displaystyle X}
 
 is transitive, then 
 
 
 
 ⋃
 X
 
 
 {\textstyle \bigcup X}
 
 is transitive.
If 
 
 
 
 X
 
 
 {\displaystyle X}
 
 and 
 
 
 
 Y
 
 
 {\displaystyle Y}
 
 are transitive, then 
 
 
 
 X
 ∪
 Y
 
 
 {\displaystyle X\cup Y}
 
 and 
 
 
 
 X
 ∪
 Y
 ∪
 {
 X
 ,
 Y
 }
 
 
 {\displaystyle X\cup Y\cup \{X,Y\}}
 
 are transitive. In general, if 
 
 
 
 Z
 
 
 {\displaystyle Z}
 
 is a class all of whose elements are transitive sets, then 
 
 
 
 ⋃
 Z
 
 
 {\textstyle \bigcup Z}
 
 and 
 
 
 
 Z
 ∪
 ⋃
 Z
 
 
 {\textstyle Z\cup \bigcup Z}
 
 are transitive. (The first sentence in this paragraph is the case of 
 
 
 
 Z
 =
 {
 X
 ,
 Y
 }
 
 
 {\displaystyle Z=\{X,Y\}}
 
.)
A set 
 
 
 
 X
 
 
 {\displaystyle X}
 
 that does not contain urelements is transitive if and only if it is a subset of its own <a href="/facts/Power_set/FVuf8PDD">power set</a>, 
 
 
 
 X
 ⊆
 
 
 P
 
 
 (
 X
 )
 .
 
 
 {\textstyle X\subseteq {\mathcal {P}}(X).}
 
 The power set of a transitive set without urelements is transitive.

<h2 id="transitive-closure">Transitive closure</h2>
The transitive closure of a set 
 
 
 
 X
 
 
 {\displaystyle X}
 
 is the smallest (with respect to inclusion) transitive set that includes 
 
 
 
 X
 
 
 {\displaystyle X}
 
 (i.e. 
 
 
 
 X
 ⊆
 TC
 ⁡
 (
 X
 )
 
 
 {\textstyle X\subseteq \operatorname {TC} (X)}
 
).<a class="footnote-ref" id="fnref:2" href="#fn:2">2</a> Suppose one is given a set 
 
 
 
 X
 
 
 {\displaystyle X}
 
, then the transitive closure of 
 
 
 
 X
 
 
 {\displaystyle X}
 
 is

 
 
 
 TC
 ⁡
 (
 X
 )
 =
 ⋃
 
 {
 
 X
 ,
 
 ⋃
 X
 ,
 
 ⋃
 ⋃
 X
 ,
 
 ⋃
 ⋃
 ⋃
 X
 ,
 
 ⋃
 ⋃
 ⋃
 ⋃
 X
 ,
 …
 
 }
 
 .
 
 
 {\displaystyle \operatorname {TC} (X)=\bigcup \left\{X,\;\bigcup X,\;\bigcup \bigcup X,\;\bigcup \bigcup \bigcup X,\;\bigcup \bigcup \bigcup \bigcup X,\ldots \right\}.}

Proof. Denote 
 
 
 
 
 X
 
 0
 
 
 =
 X
 
 
 {\textstyle X_{0}=X}
 
 and 
 
 
 
 
 X
 
 n
 +
 1
 
 
 =
 ⋃
 
 X
 
 n
 
 
 
 
 {\textstyle X_{n+1}=\bigcup X_{n}}
 
. Then we claim that the set

 
 
 
 T
 =
 TC
 ⁡
 (
 X
 )
 =
 
 ⋃
 
 n
 =
 0
 
 
 ∞
 
 
 
 X
 
 n
 
 
 
 
 {\displaystyle T=\operatorname {TC} (X)=\bigcup _{n=0}^{\infty }X_{n}}

is transitive, and whenever 
 
 
 
 
 T
 
 1
 
 
 
 
 {\textstyle T_{1}}
 
 is a transitive set including 
 
 
 
 X
 
 
 {\textstyle X}
 
 then 
 
 
 
 T
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle T\subseteq T_{1}}
 
.
Assume 
 
 
 
 y
 ∈
 x
 ∈
 T
 
 
 {\textstyle y\in x\in T}
 
. Then 
 
 
 
 x
 ∈
 
 X
 
 n
 
 
 
 
 {\textstyle x\in X_{n}}
 
 for some 
 
 
 
 n
 
 
 {\textstyle n}
 
 and so 
 
 
 
 y
 ∈
 ⋃
 
 X
 
 n
 
 
 =
 
 X
 
 n
 +
 1
 
 
 
 
 {\textstyle y\in \bigcup X_{n}=X_{n+1}}
 
. Since 
 
 
 
 
 X
 
 n
 +
 1
 
 
 ⊆
 T
 
 
 {\textstyle X_{n+1}\subseteq T}
 
, 
 
 
 
 y
 ∈
 T
 
 
 {\textstyle y\in T}
 
. Thus 
 
 
 
 T
 
 
 {\textstyle T}
 
 is transitive.
Now let 
 
 
 
 
 T
 
 1
 
 
 
 
 {\textstyle T_{1}}
 
 be as above. We prove by induction that 
 
 
 
 
 X
 
 n
 
 
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle X_{n}\subseteq T_{1}}
 
 for all 
 
 
 
 n
 
 
 {\displaystyle n}
 
, thus proving that 
 
 
 
 T
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle T\subseteq T_{1}}
 
: The base case holds since 
 
 
 
 
 X
 
 0
 
 
 =
 X
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle X_{0}=X\subseteq T_{1}}
 
. Now assume 
 
 
 
 
 X
 
 n
 
 
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle X_{n}\subseteq T_{1}}
 
. Then 
 
 
 
 
 X
 
 n
 +
 1
 
 
 =
 ⋃
 
 X
 
 n
 
 
 ⊆
 ⋃
 
 T
 
 1
 
 
 
 
 {\textstyle X_{n+1}=\bigcup X_{n}\subseteq \bigcup T_{1}}
 
. But 
 
 
 
 
 T
 
 1
 
 
 
 
 {\textstyle T_{1}}
 
 is transitive so 
 
 
 
 ⋃
 
 T
 
 1
 
 
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle \bigcup T_{1}\subseteq T_{1}}
 
, hence 
 
 
 
 
 X
 
 n
 +
 1
 
 
 ⊆
 
 T
 
 1
 
 
 
 
 {\textstyle X_{n+1}\subseteq T_{1}}
 
. This completes the proof.
Note that this is the set of all of the objects related to 
 
 
 
 X
 
 
 {\displaystyle X}
 
 by the <a href="/facts/Transitive_closure/HEtgYGM4">transitive closure</a> of the membership relation, since the union of a set can be expressed in terms of the <a href="/facts/Composition_of_relations/tD8joBlo">relative product</a> of the membership relation with itself.
The transitive closure of a set can be expressed by a first-order formula: 
 
 
 
 x
 
 
 {\displaystyle x}
 
 is a transitive closure of 
 
 
 
 y
 
 
 {\displaystyle y}
 
 <a href="/facts/Iff/bYSxGJ66">iff</a> 
 
 
 
 x
 
 
 {\displaystyle x}
 
 is an intersection of all transitive <a href="/facts/Superset/SJGERmbA">supersets</a> of 
 
 
 
 y
 
 
 {\displaystyle y}
 
 (that is, every transitive superset of 
 
 
 
 y
 
 
 {\displaystyle y}
 
 contains 
 
 
 
 x
 
 
 {\displaystyle x}
 
 as a subset).

<h2 id="transitive-models-of-set-theory">Transitive models of set theory</h2>
Transitive classes are often used for construction of <a href="/facts/Relative_interpretation/9UIHHBw8">interpretations</a> of set theory in itself, usually called <a href="/facts/Inner_model/9WKoWvCe">inner models</a>. The reason is that properties defined by <a href="/facts/Bounded_quantifier/Q0Y7aTkG">bounded formulas</a> are <a href="/facts/Absoluteness_(mathematical_logic)/rNkAooUb">absolute</a> for transitive classes.<a class="footnote-ref" id="fnref:3" href="#fn:3">3</a>
A transitive set (or class) that is a model of a <a href="/facts/Theory_(mathematical_logic)/mYe5gQpI">formal system</a> 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 <a href="/facts/Non-standard_analysis/lEpNpWMB">non-standard analysis</a>, the non-standard universes satisfy strong transitivity. Here, a class 
 
 
 
 
 
 C
 
 
 
 
 {\displaystyle {\mathcal {C}}}
 
 is defined to be strongly transitive if, for each set 
 
 
 
 S
 ∈
 
 
 C
 
 
 
 
 {\displaystyle S\in {\mathcal {C}}}
 
, there exists a transitive superset 
 
 
 
 T
 
 
 {\displaystyle T}
 
 with 
 
 
 
 S
 ⊆
 T
 ⊆
 
 
 C
 
 
 
 
 {\displaystyle S\subseteq T\subseteq {\mathcal {C}}}
 
. A strongly transitive class is automatically transitive. This strengthened transitivity assumption allows one to conclude, for instance, that 
 
 
 
 
 
 C
 
 
 
 
 {\displaystyle {\mathcal {C}}}
 
 contains the domain of every <a href="/facts/Binary_relation/r9BwGgaK">binary relation</a> in 
 
 
 
 
 
 C
 
 
 
 
 {\displaystyle {\mathcal {C}}}
 
.<a class="footnote-ref" id="fnref:4" href="#fn:4">4</a>

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/End_extension/uqI0pE1W">End extension</a></li>
<li><a href="/facts/Transitive_relation/9r90y50r">Transitive relation</a></li>
<li><a href="/facts/Supertransitive_class/3nmVqBKr">Supertransitive class</a></li></ul>

<ul><li>Ciesielski, Krzysztof (1997), Set theory for the working mathematician, London Mathematical Society Student Texts, vol. 39, Cambridge: <a href="/facts/Cambridge_University_Press/fgEBSSRq">Cambridge University Press</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-521-59441-3, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0938.03067">0938.03067</a></li>
<li><a href="/facts/Robert_Goldblatt/PU9g6qaY">Goldblatt, Robert</a> (1998), Lectures on the hyperreals. An introduction to nonstandard analysis, <a href="/facts/Graduate_Texts_in_Mathematics/VTIfY29j">Graduate Texts in Mathematics</a>, vol. 188, New York, NY: <a href="/facts/Springer-Verlag/nAesf6nT">Springer-Verlag</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-387-98464-X, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0911.03032">0911.03032</a></li>
<li><a href="/facts/Thomas_Jech/E4JQu4Mk">Jech, Thomas</a> (2008) [originally published in 1973], The Axiom of Choice, <a href="/facts/Dover_Publications/RwjvlSFv">Dover Publications</a>, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-486-46624-8, <a href="/facts/Zbl_(identifier)/P6rFxKKx">Zbl</a> <a href="https://zbmath.org/?format=complete&q=an:0259.02051">0259.02051</a></li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">"Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group).", OEIS <a href="https://oeis.org/A004111" target="_blank">https://oeis.org/A004111</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Ciesielski, Krzysztof (1997), Set theory for the working mathematician, Cambridge: Cambridge University Press, p. 164, ISBN 978-1-139-17313-1, OCLC 817922080 <a href="978-1-139-17313-1" target="_blank">978-1-139-17313-1</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Viale, Matteo (November 2003), "The cumulative hierarchy and the constructible universe of ZFA", Mathematical Logic Quarterly, 50 (1), Wiley: 99–103, doi:10.1002/malq.200310080 <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Goldblatt (1998) p.161 <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
</ol>

Transitive set open-in-new

Transitive set