# Hereditarily finite set

In mathematics and set theory, **hereditarily finite sets** are defined as finite sets whose elements are all hereditarily finite sets. In other words, the set itself is finite, and all of its elements are finite sets, recursively all the way down to the empty set.

## Formal definition[edit]

A recursive definition of well-founded hereditarily finite sets is as follows:

*Base case*: The empty set is a hereditarily finite set.*Recursion rule*: If*a*_{1},...,*a*_{k}are hereditarily finite, then so is {*a*_{1},...,*a*_{k}}.

and only sets that can be built by a finite number of applications of these two rules are hereditarily finite.

The set is an example for such a hereditarily finite set and so is the empty set .
On the other hand, the sets or are examples of finite sets that are not *hereditarily* finite. For example, the first cannot be hereditarily finite since it contains at least one infinite set as an element, when .

## Discussion[edit]

The class of hereditarily finite sets is denoted by , meaning that the cardinality of each member is smaller than . (Analogously, the class of hereditarily *countable* sets is denoted by .)

It can also be denoted by , which denotes the th stage of the von Neumann universe.^{[1]}

The class is countable.

### Ackermann coding[edit]

In 1937, Wilhelm Ackermann introduced an encoding of hereditarily finite sets as natural numbers.^{[2]}^{[3]}^{[4]}
It is defined by a function that maps each hereditarily finite set to a natural number, given by the following recursive definition:

For example, the empty set contains no members, and is therefore mapped to an empty sum, that is, the number zero. On the other hand, a set with distinct members is mapped to .

The inverse of , which maps natural numbers back to sets, is

where BIT denotes the BIT predicate.

The Ackermann coding can be used to construct a model of finitary set theory in the natural numbers. More precisely, (where is the converse relation of BIT, swapping its two arguments) models Zermelo–Fraenkel set theory without the axiom of infinity. Here, each natural number models a set, and the BIT relation models the membership relation between sets.

### Representation[edit]

This class of sets is naturally ranked by the number of bracket pairs necessary to represent the sets:

- (i.e. , the Neumann ordinal "0")
- (i.e. or , the Neumann ordinal "1")
- and then also (i.e. , the Neumann ordinal "2"),
- , as well as ,
- ... sets represented with bracket pairs, e.g. . There are six such sets
- ... sets represented with bracket pairs, e.g. . There are twelve such sets
- ... sets represented with bracket pairs, e.g. or (i.e. , the Neumann ordinal "3")
- ... etc.

In this way, the number of sets with bracket pairs is^{[5]}

## Axiomatizations[edit]

### Theories of finite sets[edit]

The set also represents the first von Neumann ordinal number, denoted . And indeed all finite von Neumann ordinals are in and thus the class of sets representing the natural numbers, i.e it includes each element in the standard model of natural numbers. Robinson arithmetic can already be interpreted in , the very small sub-theory of with its axioms given by Extensionality, Empty Set and Adjunction.

Indeed, has a constructive axiomatizations involving these axiom and e.g. Set induction and Replacement.

Their models then also fulfill the axioms consisting of the axioms of Zermelo–Fraenkel set theory without the axiom of infinity. In this context, the negation of the axiom of infinity may be added, thus proving that the axiom of infinity is not a consequence of the other axioms of .

### ZF[edit]

The hereditarily finite sets are a subclass of the Von Neumann universe. Here, the class of all well-founded hereditarily finite sets is denoted *V*_{ω}. Note that this is also a set in this context.

If we denote by ℘(*S*) the power set of *S*, and by *V*_{0} the empty set, then *V*_{ω} can be obtained by setting
*V*_{1} = ℘(*V*_{0}), *V*_{2} = ℘(*V*_{1}),..., *V*_{k} = ℘(*V*_{k−1}),... and so on.

Thus, *V*_{ω} can be expressed as and all its elements are finite.

We see, again, that there are only countably many hereditarily finite sets: *V _{n}* is finite for any finite

*n*, its cardinality is

^{n−1}2 (see tetration), and the union of countably many finite sets is countable.

Equivalently, a set is hereditarily finite if and only if its transitive closure is finite.

## Graph models[edit]

The class can be seen to be in exact correspondence with a class of rooted trees, namely those without non-trivial symmetries (i.e. the only automorphism is the identity): The root vertex corresponds to the top level bracket and each edge leads to an element (another such set) that can act as a root vertex in its own right. No automorphism of this graph exist, corresponding to the fact that equal branches are identified (e.g. , trivializing the permutation of the two subgraphs of shape ). This graph model enables an implementation of ZF without infinity as data types and thus an interpretation of set theory in expressive type theories.

Graph models exist for ZF and also set theories different from Zermelo set theory, such as non-well founded theories. Such models have more intricate edge structure.

In graph theory, the graph whose vertices correspond to hereditarily finite sets and edges correspond to set membership is the Rado graph or random graph.

## See also[edit]

- Hereditary set
- Hereditarily countable set
- Hereditary property
- Rooted trees
- Constructive set theory
- Finite set

## References[edit]

**^**"hereditarily finite set".*nLab*. nLab. January 2023. Retrieved January 28, 2023.The set of all (well-founded) hereditarily finite sets (which is infinite, and not hereditarily finite itself) is written to show its place in the von Neumann hierarchy of pure sets.

**^**Ackermann, Wilhelm (1937). "Die Widerspruchsfreiheit der allgemeinen Mengenlehre".*Mathematische Annalen*.**114**: 305–315. doi:10.1007/bf01594179. S2CID 120576556. Retrieved 2012-01-09.**^**Kirby, Laurence (2009). "Finitary Set Theory".*Notre Dame Journal of Formal Logic*.**50**(3): 227–244. doi:10.1215/00294527-2009-009.**^**Omodeo, Eugenio G.; Policriti, Alberto; Tomescu, Alexandru I. (2017). "3.3: The Ackermann encoding of hereditarily finite sets".*On Sets and Graphs: Perspectives on Logic and Combinatorics*. Springer. pp. 70–71. doi:10.1007/978-3-319-54981-1. ISBN 978-3-319-54980-4. MR 3558535.**^**"A004111 - Oeis".