- Axiom of infinity
In

axiomatic set theory and the branches oflogic ,mathematics , andcomputer science that use it, the**axiom of infinity**is one of theaxiom s ofZermelo-Fraenkel set theory .**Formal statement**In the

formal language of the Zermelo-Fraenkel axioms, the axiom reads::$exist\; mathbf\{I\}\; ,\; (\; empty\; in\; mathbf\{I\}\; ,\; and\; ,\; forall\; x\; in\; mathbf\{I\}\; ,\; (\; ,\; (\; x\; cup\; \{x\}\; )\; in\; mathbf\{I\}\; )\; )\; .$In words, there is a set

**I**(the set which is postulated to be infinite), such that theempty set is in**I**and such that whenever any "x" is a member of**I**, the set formed by taking the union of "x" with its singleton {"x"} is also a member of**I**. Such a set is sometimes called an inductive set.**Interpretation and consequences**This axiom is closely related to the standard construction of the naturals in set theory, in which the "successor" of "x" is defined as "x" ∪ {"x"}. If "x" is a set, then it follows from the other axioms of set theory that this successor is also a uniquely defined set. Successors are used to define the usual set-theoretic encoding of the

natural number s. In this encoding, zero is the empty set::0 = {}.

The number 1 is the successor of 0:

:1 = 0 ∪ {0} = {} ∪ {0} = {0}.

Likewise, 2 is the successor of 1:

:2 = 1 ∪ {1} = {0} ∪ {1} = {0,1},

and so on. A consequence of this definition is that every natural number is equal to the set of all preceding natural numbers.

This construction forms the natural numbers. However, the other axioms are insufficient to prove the existence of the set of all natural numbers. Therefore its existence is taken as an axiom — the axiom of infinity. This axiom asserts that there is a set

**I**that contains 0 and is closed under the operation of taking the successor; that is, for each element of**I**, the successor of that element is also in**I**.Thus the essence of the axiom is:

:There is a set,

**I**, that includes all the natural numbers.The axiom of infinity is also one of the

von Neumann-Bernays-Gödel axioms .**Extracting the natural numbers from the infinite set**The infinite set

**I**is a superset of the natural numbers. To show that the natural numbers themselves constitute a set, theaxiom schema of specification can be applied to remove unwanted elements, leaving the set**N**of all natural numbers. This set is unique by theaxiom of extensionality .To extract the natural numbers, we need a definition of which sets are natural numbers. The natural numbers can be defined in a way which does not assume any axioms except the

axiom of extensionality and the axiom of induction — a natural number is either zero or a successor and each of its elements is either zero or a successor of another of its elements. In formal language, the definition says::$forall\; n\; (n\; in\; mathbf\{N\}\; iff\; (\; [n\; =\; empty\; ,,or,,\; exist\; k\; (\; n\; =\; k\; cup\; \{k\}\; )]\; ,,and,,\; forall\; m\; in\; n\; [m\; =\; empty\; ,,or,,\; exist\; k\; in\; n\; (\; m\; =\; k\; cup\; \{k\}\; )]\; )).$

Or, even more formally:

:$forall\; n\; (n\; in\; mathbf\{N\}\; iff\; (\; [forall\; k\; in\; n(ot)\; or\; exist\; k\; in\; n(\; forall\; j\; in\; k(j\; in\; n)\; and\; forall\; j\; in\; n(j=k\; lor\; j\; in\; k))]\; and$

::$forall\; m\; in\; n\; [forall\; k\; in\; m(ot)\; or\; exist\; k\; in\; n(k\; in\; m\; and\; forall\; j\; in\; k(j\; in\; m)\; and\; forall\; j\; in\; m(j=k\; lor\; j\; in\; k))]\; )).$Here, $ot$ denotes the

logical constant "false", so $forall\; k\; in\; n(ot)$ is a formula that holds only if "n" is the empty set.**Independence**If

ZFC is consistent, then the axiom of infinity cannot be derived from the other axioms. Indeed, using theVon Neumann universe we can make a model of the axioms where the axiom of infinity is replaced by its negation. It is $V\_omega\; !$, the class ofhereditarily finite set s, with the inherited element relation.The cardinality of the set of natural numbers,

aleph null ($aleph\_0$), has many of the properties of a large cardinal. Thus the axiom of infinity is sometimes regarded as the first "large cardinal axiom".**References***

Paul Halmos (1960) "Naive Set Theory". Princeton, NJ: D. Van Nostrand Company. Reprinted 1974 by Springer-Verlag. ISBN 0-387-90092-6.

*Thomas Jech (2003) "Set Theory: The Third Millennium Edition, Revised and Expanded". Springer-Verlag. ISBN 3-540-44085-2.

*Kenneth Kunen (1980) "Set Theory: An Introduction to Independence Proofs". Elsevier. ISBN 0-444-86839-9.

*Wikimedia Foundation.
2010.*

### Look at other dictionaries:

**Inductive set (axiom of infinity)**— In the context of the axiom of infinity, an inductive set (also known as a successor set) is a set X with the property that, for every x in X, the successor x of x is also an element of X. An example of an inductive set is the set of natural… … Wikipedia**Infinity**— In mathematics, infinity is often used in contexts where it is treated as if it were a number (i.e., it counts or measures things: an infinite number of terms ) but it is a different type of number from the real numbers. Infinity is related to… … Wikipedia**Axiom of empty set**— In set theory, the axiom of empty set is one of the axioms of Zermelo–Fraenkel set theory and one of the axioms of Kripke–Platek set theory. Formal statement In the formal language of the Zermelo–Fraenkel axioms, the axiom reads::exist x, forall… … Wikipedia**Axiom schema of replacement**— In set theory, the axiom schema of replacement is a schema of axioms in Zermelo Fraenkel set theory (ZFC) that asserts that the image of any set under any definable mapping is also a set. It is necessary for the construction of certain infinite… … Wikipedia**Axiom of regularity**— In mathematics, the axiom of regularity (also known as the axiom of foundation) is one of the axioms of Zermelo Fraenkel set theory and was introduced by harvtxt|von Neumann|1925. In first order logic the axiom reads::forall A (exists B (B in A)… … 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**infinity, axiom of**— Axiom needed in Russell s development of set theory to ensure that there are enough sets for the purposes of mathematics. In the theory of types, if there were only finitely many objects of the lowest type, then there would only be finite sets at … Philosophy dictionary**infinity**— /in fin i tee/, n., pl. infinities. 1. the quality or state of being infinite. 2. something that is infinite. 3. infinite space, time, or quantity. 4. an infinite extent, amount, or number. 5. an indefinitely great amount or number. 6. Math. a.… … Universalium**Axiom of determinacy**— The axiom of determinacy (abbreviated as AD) is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962. It refers to certain two person games of length ω with perfect information. AD states that every such game in… … Wikipedia**Infinity-Borel set**— In set theory, a subset of a Polish space X is infin; Borel if itcan be obtained by starting with the open subsets of X, and transfinitely iterating the operations of complementation and wellordered union (but see the caveat below). Formal… … Wikipedia