Questions: Natural Numbers in Set Theory: Iterative Construction

Question 1

In the von Neumann construction of natural numbers, what is the set-theoretic definition of 3?

• A. 3 = {3} — a set containing only the symbol 3
• B. 3 = {1, 2, 3} — a set containing its first three positive integers
• C. 3 = {∅, {∅}, {∅, {∅}}} — the set containing 0, 1, and 2
• D. 3 = {{{∅}}} — three layers of nesting around the empty set

Answer: (C)

In the von Neumann construction: 0 = ∅, 1 = {∅}, 2 = {∅, {∅}}, 3 = {∅, {∅}, {∅, {∅}}}. Each natural number is the set of all natural numbers that came before it: 3 contains exactly 0, 1, and 2 as elements. Option D (triply nested) is sometimes confused with this but represents a different encoding. The key feature is that each n contains exactly n elements — which is how 'n-element set' and 'the number n' coincide in this construction.

Question 2

In the von Neumann construction, how is the ordering n < m encoded in set-theoretic terms?

• A. n < m if and only if n has fewer elements than m
• B. n < m if and only if n is a subset of m
• C. n < m if and only if n is an element of m (n ∈ m)
• D. n < m if and only if n ∪ {n} = m

Answer: (C)

The von Neumann construction encodes ordering as membership: n < m if and only if n ∈ m. Since each number is the set of all smaller numbers, 2 ∈ 3 (because 3 = {0, 1, 2} contains 2), and this means 2 < 3. This double-duty — being both a number and the set of smaller numbers — means membership and less-than coincide. Option B (subset) also holds for von Neumann ordinals but is strictly weaker; ⊂ corresponds to ≤. Option D describes the successor operation (n+1 = n ∪ {n}), which is related but not the definition of ordering.

Question 3

In the von Neumann construction, the natural number 2 is defined as the set {1, 2}, containing its two immediate predecessors expressed as integers.

• T. True
• F. False

Answer: False

The von Neumann construction builds numbers from pure set theory, using only ∅ and set operations — there are no pre-existing integers to reference. The number 2 is defined as {∅, {∅}}, which is the set containing 0 (= ∅) and 1 (= {∅}). Writing {1, 2} would be circular — it uses the numbers being defined. The construction's power is that it builds the counting numbers from nothing but the empty set and the successor operation n+1 = n ∪ {n}.

Question 4

In the von Neumann construction of natural numbers, n < m if and only if n ∈ m — membership encodes the less-than ordering.

• T. True
• F. False

Answer: True

Each von Neumann natural number n is defined as the set of all natural numbers less than n. Therefore, if k < n, then k is one of the elements of n — i.e., k ∈ n. This encoding is not a coincidence but a design feature: it makes the ordering derivable from pure set membership, without needing an additional 'less than' primitive. This same principle extends to von Neumann ordinals, where α < β iff α ∈ β, even for infinite ordinals.

Question 5

Why does the von Neumann construction define each natural number as the set of all natural numbers smaller than it, rather than using some simpler representation like n = {n-1}?

Model answer: The design encodes ordering directly into membership — n < m iff n ∈ m — which makes the less-than relation derivable from pure set theory without additional axioms. It also gives each number n exactly n elements, aligning cardinality with number, and extends seamlessly to infinite ordinals: ω = {0, 1, 2, 3, ...} is the set of all finite ordinals, with the same membership-as-ordering rule. A simpler encoding like n = {n-1} would create a chain but lose this cardinality alignment and would not extend cleanly to transfinite ordinals.

The von Neumann construction is canonical in ZFC precisely because it simultaneously encodes arithmetic, ordering, and cardinality in a single consistent structure. The 'set of all predecessors' design also makes induction natural: to prove a property holds for all n, you prove it holds for ∅ (base case) and that if it holds for n, it holds for n ∪ {n} (inductive step). The construction earns its complexity by doing multiple jobs at once while remaining uniquely determined by the axioms.