Hereditarily finite set

Hereditarily finite set
Loupe light.svg

In mathematics and set theory, hereditarily finite sets are defined recursively as finite sets consisting of 0 or more hereditarily finite sets.

Formal definition

A recursive definition of a hereditarily finite set goes as follows:

Base case: The empty set is a hereditarily finite set.
Recursion rule: If a1,...,ak are hereditarily finite, then so is {a1,...,ak}.

The set of all hereditarily finite sets is denoted Vω. If we denote P(S) for the power set of S, Vω can also be constructed by first taking the empty set written V0, then V1 = P(V0), V2 = P(V1),..., Vk = P(Vk−1),... Then

\bigcup_{k=0}^\infty V_k = V_\omega.

Discussion

The hereditarily finite sets are a subclass of the Von Neumann universe. They are a model of the axioms consisting of the axioms of set theory with the axiom of infinity replaced by its negation, thus proving that the axiom of infinity is not a consequence of the other axioms of set theory.

Notice that there are countably many hereditarily finite sets, since Vn is finite for any finite n (its cardinality is n−12, 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. Vω is also symbolized by H_{\aleph_0}, meaning hereditarily of cardinality less than \aleph_0.

See also


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Hereditarily countable set — In set theory, a set is called hereditarily countable if and only if it is a countable set of hereditarily countable sets. This inductive definition is in fact well founded and can be expressed in the language of first order set theory. A set is… …   Wikipedia

  • Finite set — In mathematics, a set is called finite if there is a bijection between the set and some set of the form {1, 2, ..., n} where n is a natural number. (The value n = 0 is allowed; that is, the empty set is finite.) An infinite set is a set which is… …   Wikipedia

  • General set theory — (GST) is George Boolos s (1998) name for a three axiom fragment of the canonical axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano… …   Wikipedia

  • Code (set theory) — In set theory, a code for a hereditarily countable set is a set such that there is an isomorphism between (ω,E) and (X, ) where X is the transitive closure of {x}. If X is finite (with cardinality n), then use n×n instead of ω×ω and (n,E) instead …   Wikipedia

  • Ordinal definable set — In mathematical set theory, a set S is said to be ordinal definable if, informally, it can be defined in terms of a finite number of ordinals by a first order formula. Ordinal definable sets were introduced by Gödel (1965). A drawback to this… …   Wikipedia

  • Axiom of pairing — In axiomatic set theory and the branches of logic, mathematics, and computer science that use it, the axiom of pairing is one of the axioms of Zermelo Fraenkel set theory. Formal statement In the formal language of the Zermelo Frankel axioms, the …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • Hereditary property — In mathematics, a hereditary property is a property of an object, that inherits to all its subobjects, where the term subobject depends on the context. These properties are particularly considered in topology and graph theory. Contents 1 In… …   Wikipedia

  • Grothendieck universe — In mathematics, a Grothendieck universe is a set U with the following properties:# If x is an element of U and if y is an element of x , then y is also an element of U . ( U is a transitive set.) # If x and y are both elements of U , then { x , y …   Wikipedia

  • Universe (mathematics) — In mathematical logic, the universe of a structure (or model ) is its domain.In mathematics, and particularly in applications to set theory and the foundations of mathematics, a universe or universal class (or if a set, universal set – not to be… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”