The transitive closure is the least transitive set containing every member of . It is obtained by taking the union of all finite iterates of the union operation starting from .
For an infinite cardinal number , consists of the sets for which , where is transitive closure. The entire transitive membership ancestry is bounded, not only the size of . These collections are transitive sets. At the elements are the hereditarily countable sets.
The hereditarily small set structure fails the Axiom of power set at . Every subset of belongs to , but their full power set has cardinality at least by the Cantor theorem, so cannot itself be hereditarily smaller than .
Let and . Call small when it injects into some , and let contain exactly the sets all of whose hereditary members are small. Then every and the set belong to , but does not. Consequently fails the Axiom of union.
A set is hereditarily countable when its transitive closure is countable. These sets form the transitive set and all have rank below .
A set is reasonable when every member of is countable. In ZFC this is equivalent to being hereditarily countable.
Articles by others on the same topic
Transitive closure is a concept from graph theory, specifically related to directed graphs (digraphs) or relations. Essentially, the transitive closure of a directed graph is a new graph that contains the same vertices as the original graph, with additional edges that represent the transitive relations between those vertices.