Transitive set

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

  • whenever x ∈ A, and y ∈ x, then y ∈ A.
  • whenever x ∈ A, and x is not an urelement, then x is a subset of A.

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

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 Vα and Lα leading to the construction of the von Neumann universe V and Gödel's constructible universe L are transitive sets. The universes L and V themselves are transitive classes.

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

Properties

A set X is transitive if and only if , where is the union of all elements of X that are sets, . If X is transitive, then is transitive. If X and Y are transitive, then X∪Y∪{X,Y} is transitive. In general, if X is a class all of whose elements are transitive sets, then is transitive.

A set X 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 X is the smallest (with respect to inclusion) transitive set that contains X. Suppose one is given a set X, then the transitive closure of X is

Proof. Denote and . Then we claim that the set

is transitive, and whenever is a transitive set containing 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 whence . This completes the proof.

Note that this is the set of all of the objects related to X 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.

Transitive models of set theory

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.[2]

gollark: JS has various fun fake array things.
gollark: Correction: you need `add-number` from `npm` to add numbers.
gollark: Wait, no, jQuery isn't trendy any more.
gollark: Besides, this is a stupid meme, you need jQuery to add numbers.
gollark: Nobody uses it because it's bad and ES6 has saner syntax for it.

See also

References
  1. "Number of rooted identity trees with n nodes (rooted trees whose automorphism group is the identity group)". OEIS.
  2. Goldblatt (1998) p.161
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.