How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A nonempty countable set has a padded enumeration in ZF
Statement
In , every nonempty at most countable set (Finite, countably infinite, countable, uncountable) is the range of a sequence (The natural numbers (von Neumann)). The empty set is treated separately and is not asserted to be the range of an -indexed sequence.
Conventions. contains , and a natural number is the set of its predecessors. A sequence in is a function with domain and values in .
Facts & Assumptions
Given: A nonempty at most countable set .
A nonempty set is at most countable if and only if there is a surjection ; the forward direction is the one used here and its proof is explicit in the cited item (A nonempty set is at most countable iff it is a surjective image of , Injection, surjection, bijection).
is at most countable exactly when is finite, that is for some , or countably infinite, that is (Finite, countably infinite, countable, uncountable).
and exactly when , for (The natural numbers (von Neumann)).
Proof
Assume is nonempty and at most countable; by [L1] it suffices to produce a surjection explicitly from the two alternatives of [L2].
Case 1: assume is countably infinite, so that there is a bijection ; case 2: assume is finite, so that there is with a bijection .
In case 1, take ; it is a function and it is surjective, so its range is ; no choice was used, since was already given.
In case 2, since is nonempty and is bijective, : otherwise by [L3], contradicting that has an element.
In case 2, continuing, define by the two clauses for and for ; this is well defined because and by step 2.2 and [L3], so is available as the constant value.
In case 2, continuing, has range : if then for some because is surjective, and then by step 3.1; conversely every value of is a value of , hence lies in .
Every nonempty at most countable therefore falls under case 1 or case 2 and is the range of the explicitly defined sequence of step 2.1 or of step 4.1; no choice principle was used in either case.
Remarks
-
Why the statement separates the empty set. The cited equivalence of [L1] requires : there is no function from onto . The downstream Baire theorem therefore disposes of the empty ambient space before invoking this lemma, rather than manufacturing a sequence into the empty set.
-
The padding is what makes the finite case a sequence. A finite bijection is not defined on the whole of ; repeating its value at is the canonical way to extend it, and it needs the one fact that is nonempty.
Depends on
Used by
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Marianne Morillon, Axiom of Choice (standard reference, not scraped)