Consider the function f: ℕ → {0, 2, 4, 6, ...} defined by f(n) = 2n. What does this tell us about whether ℕ is finite?
Aℕ must be finite because we can define a total function from it to another set
BThis proves ℕ is infinite, because f is an injection from ℕ into a proper subset of itself
CThis proves ℕ is infinite, but only because {0, 2, 4, ...} is itself an infinite set
DThis is inconclusive because f is a bijection between ℕ and the evens, not an injection into a proper subset
The injection characterization of finiteness says a set is finite if and only if NO injection maps it into a proper subset of itself. Here, f is an injection from ℕ into {0, 2, 4, ...}, which is a proper subset of ℕ. This witnesses that ℕ is infinite — specifically, Dedekind-infinite. Option C is a circular argument (it uses the infinitude of the evens to prove the infinitude of ℕ, which begs the question). Option D is wrong: f is injective, and the evens are a proper subset of ℕ.
Question 2 Multiple Choice
Which of the following is the correct rigorous set-theoretic definition of a finite set?
AA set whose elements can all be listed in a finite table without running out of space
BA set with strictly fewer elements than the natural numbers
CA set S for which there exists a bijection between S and {1, 2, ..., n} for some natural number n, or S is empty
DA set that cannot be put in correspondence with any proper subset of itself in any way
Option C (0-indexed: answer 2) is the standard definition. It uses bijection — a function that is both injective (no repetitions) and surjective (no omissions) — to make counting precise. Option D describes Dedekind-finiteness, which is equivalent to option C in standard ZFC set theory but may differ in models lacking the axiom of choice. Options A and B rely on pre-theoretical intuitions that the formal definition is meant to replace.
Question 3 True / False
Dedekind-finiteness (no injection into a proper subset) and Tarski-finiteness (bijects with some {1,...,n}) are equivalent in standard set theory but may diverge in models of set theory without the axiom of choice.
TTrue
FFalse
Answer: True
In ZFC (with the axiom of choice), the two definitions are provably equivalent. But in choiceless set theory, there exist models with sets that are Dedekind-finite (no injection into a proper subset) yet not Tarski-finite (no bijection with any {1,...,n}). This subtle divergence is invisible in everyday mathematics but reveals that the two definitions capture genuinely different structural properties.
Question 4 True / False
The everyday claim 'a set is finite if it has n elements for some natural number n' is not circular because the natural numbers exist independently of set theory.
TTrue
FFalse
Answer: False
In axiomatic set theory (ZFC), the natural numbers must themselves be constructed from sets — they do not exist as a prior foundation. The standard definition is ω = {∅, {∅}, {∅,{∅}}, ...} (von Neumann ordinals). Since ℕ is built inside set theory, a definition of finiteness that presupposes ℕ would be circular. The injection characterization avoids this by using only the structural concepts of set membership and functions.
Question 5 Short Answer
Why does the formal set-theoretic definition of finiteness avoid saying 'a set is finite if it has a definite number of elements,' and what does the injection characterization capture instead?
Think about your answer, then reveal below.
Model answer: The phrase 'a definite number of elements' presupposes the natural numbers, but in axiomatic set theory the natural numbers are themselves constructed from sets — they are not available as a prior foundation. The injection characterization is self-contained: a set S is finite if no injection maps S into any proper subset of S. This captures the key structural property that distinguishes finite sets — you cannot match every element of S to a strictly smaller collection — without needing to count.
The injection characterization also connects directly to the pigeonhole principle: if you try to assign each element of a finite set to a proper subset, you must create a collision. For infinite sets like ℕ, this fails: the map n ↦ 2n injects all of ℕ into the even numbers, a proper subset, with no collision. The formal definition makes this distinction precise and axiom-system-independent.