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

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₁,...,a_k are hereditarily finite, then so is {a₁,...,a_k}.

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

Representation

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

• ${\displaystyle \{\}}$ (i.e. ${\displaystyle \emptyset }$, the Neumann ordinal "0")
• ${\displaystyle \{\{\}\}}$ (i.e. ${\displaystyle \{\emptyset \}}$ or ${\displaystyle \{0\}}$, the Neumann ordinal "1")
• ${\displaystyle \{\{\{\}\}\}}$
• ${\displaystyle \{\{\{\{\}\}\}\}}$ and then also ${\displaystyle \{\{\},\{\{\}\}\}}$ (i.e. ${\displaystyle \{0,1\}}$, the Neumann ordinal "2"),
• ${\displaystyle \{\{\{\{\{\}\}\}\}\}}$, ${\displaystyle \{\{\{\},\{\{\}\}\}\}}$ as well as ${\displaystyle \{\{\},\{\{\{\}\}\}\}}$,
• ... sets represented with ${\displaystyle 6}$ bracket pairs, e.g. ${\displaystyle \{\{\{\{\{\{\}\}\}\}\}\}}$. There are six such sets
• ... sets represented with ${\displaystyle 7}$ bracket pairs, e.g. ${\displaystyle \{\{\{\{\{\{\{\}\}\}\}\}\}\}}$. There are twelve such sets
• ... sets represented with ${\displaystyle 8}$ bracket pairs, e.g. ${\displaystyle \{\{\{\{\{\{\{\{\}\}\}\}\}\}\}\}}$ or ${\displaystyle \{\{\},\{\{\}\},\{\{\},\{\{\}\}\}\}}$ (i.e. ${\displaystyle \{0,1,2\}}$, the Neumann ordinal "3")
• ... etc.

In this way, the number of sets with ${\displaystyle n}$ bracket pairs is ^[1] ${\displaystyle 1,1,1,2,3,6,12,25,52,113,247,548,1226,2770,6299,14426,\dots }$

Discussion

The set ${\displaystyle \{\{\},\{\{\{\}\}\}\}}$ is an example for such a hereditarily finite set and so is the empty set ${\displaystyle \{\}}$, as noted. On the other hand, the sets ${\displaystyle \{7,{\mathbb {N} },\pi \}}$ or ${\displaystyle \{3,\{{\mathbb {N} }\}\}}$ 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 ${\displaystyle {\mathbb {N} }=\{0,1,2,\dots \}}$.

The class of all hereditarily finite sets is denoted by ${\displaystyle H_{\aleph _{0}}}$, meaning that the cardinality of each member is smaller than ${\displaystyle \aleph _{0}}$. (Analogously, the class of hereditarily countable sets is denoted by ${\displaystyle H_{\aleph _{1}}}$.) It can also be denoted by ${\displaystyle V_{\omega }}$, which denotes the ${\displaystyle \omega }$th stage of the von Neumann universe. ^[2]

The class ${\displaystyle H_{\aleph _{0}}}$ is countable.

Models

Ackermann coding

In 1937, Wilhelm Ackermann introduced an encoding of hereditarily finite sets as natural numbers. ^{[3] [4] [5]} It is defined by a function ${\displaystyle f\colon H_{\aleph _{0}}\to \omega }$ that maps each hereditarily finite set to a natural number, given by the following recursive definition:

${\displaystyle f(a)=\sum _{b\in a}2^{f(b)}}$

For example, the empty set ${\displaystyle \{\}}$ 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 ${\displaystyle a,b,c,\dots }$ is mapped to ${\displaystyle 2^{f(a)}+2^{f(b)}+2^{f(c)}+\ldots }$.

The inverse of ${\displaystyle f}$, which maps natural numbers back to sets, is

${\displaystyle f^{-1}(i)=\{f^{-1}(j)\mid j\in \omega ,{\text{BIT}}(i,j)=1\}}$

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, ${\displaystyle (\mathbb {N} ,{\text{BIT}}^{\top })}$ (where ${\displaystyle {\text{BIT}}^{\top }}$ is the converse relation of BIT, swapping its two arguments) models Zermelo–Fraenkel set theory ${\displaystyle {\mathsf {ZF}}}$ without the axiom of infinity. Here, each natural number models a set, and the BIT relation models the membership relation between sets.

Graph models

The class ${\displaystyle H_{\aleph _{0}}}$ 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 ${\displaystyle \{\dots \}}$ 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. ${\displaystyle \{t,t,s\}=\{t,s\}}$, trivializing the permutation of the two subgraphs of shape ${\displaystyle t}$). 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.

Axiomatizations

Theories of finite sets

In the common axiomatic set theory approaches, the empty set ${\displaystyle \{\}}$ also represents the first von Neumann ordinal number, denoted ${\displaystyle 0}$. All finite von Neumann ordinals are indeed hereditarily finite and, thus, so is the class of sets representing the natural numbers. In other words, ${\displaystyle H_{\aleph _{0}}}$ includes each element in the standard model of natural numbers and a set theory expressing ${\displaystyle H_{\aleph _{0}}}$ must contain all of those.

Now note that Robinson arithmetic can already be interpreted in ${\displaystyle {\mathsf {ST}}}$, the very small sub-theory of ${\displaystyle {\mathsf {Z}}^{-}}$ with its axioms given by Extensionality, Empty Set and Adjunction. ${\displaystyle H_{\aleph _{0}}}$ has a constructive axiomatization involving these axioms and e.g. Set induction and Replacement.

Axiomatically characterizing the theory of hereditarily finite sets, 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 ${\displaystyle {\mathsf {ZF}}}$.

ZF

${\displaystyle ~V_{4}~}$ represented with circles in place of curly brackets     

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₀ the empty set, then V_ω can be obtained by setting V₁ = ℘(V₀), V₂ = ℘(V₁),..., V_k = ℘(V_k−1),... and so on.

Thus, V_ω can be expressed as ${\displaystyle V_{\omega }=\bigcup _{k=0}^{\infty }V_{k}}$ 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 ⁿ⁻¹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.

See also

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

References

1. "A004111 - Oeis".
2. "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 ${\displaystyle V_{\omega }}$ to show its place in the von Neumann hierarchy of pure sets.
3. Ackermann, Wilhelm (1937). "Die Widerspruchsfreiheit der allgemeinen Mengenlehre". Mathematische Annalen . 114: 305–315. doi:10.1007/bf01594179. S2CID   120576556 . Retrieved 2012-01-09.
4. Kirby, Laurence (2009). "Finitary Set Theory". Notre Dame Journal of Formal Logic. 50 (3): 227–244. doi: 10.1215/00294527-2009-009 .
5. 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.