In
set theory, a branch of
mathematics, a
set is called transitive if either of the following equivalent conditions hold:
* whenever
, and
, then
.
* whenever
, and
is not an
urelement, then
is a
subset of
.
Similarly, a
class is transitive if every element of
is a subset of
.
Examples
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
universe
The universe is all of space and time and their contents, including planets, stars, galaxies, and all other forms of matter and energy. The Big Bang theory is the prevailing cosmological description of the development of the universe. A ...
s
and
themselves are transitive classes.
This is a complete list of all finite transitive sets with up to 20 brackets:
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
Properties
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.
Transitive closure
The transitive closure of a set
is the smallest (with respect to inclusion) transitive set that includes
(i.e.
). 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
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false.
The connective is bicondi ...
is an intersection of all transitive
supersets of
(that is, every transitive superset of
contains
as a subset).
Transitive models of set theory
Transitive classes are often used for construction of
interpretation
Interpretation may refer to:
Culture
* Aesthetic interpretation, an explanation of the meaning of a work of art
* Allegorical interpretation, an approach that assumes a text should not be interpreted literally
* Dramatic Interpretation, an event ...
s 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.
[Goldblatt (1998) p.161]
See also
*
End extension
*
Transitive relation
*
Supertransitive class
References
*
*
*
{{Mathematical logic
Set theory