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.
Equivalent Dedekind-finiteness tests in the basic Cohen model
Statement
For the basic Cohen set , the following are equivalent in ZF: has a countably infinite subset, there is an injection , and is in bijection with a proper subset. Their negations all hold in the basic Cohen model.
Facts & Assumptions
Given: The hypotheses, objects, and conventions in the Statement.
The basic Cohen model has an infinite Dedekind-finite set of reals proves that is infinite and Dedekind-finite.
Dedekind infinitude is equivalent to a countable subset gives the choice-free equivalence between Dedekind infinitude, an injection from , and a countably infinite subset.
Proof
If is countably infinite, a displayed bijection followed by inclusion is an injection . Conversely, the range of an injection is a subset of bijective with . These are explicit maps and require no simultaneous choices.
From an injection , define by and off . The two pieces are disjoint, and the inverse sends to and fixes the complement, so is a bijection onto a proper subset.
Conversely, if is a bijection, choose the single witness and recursively put . Injectivity of and the fact that is not in its range show by cancellation that the are distinct. Thus injects into . This uses one existential witness and recursion, not Countable Choice.
F1 rules out the proper-subset bijection. By step 1.1, step 1.2, step 1.3 it therefore rules out an -injection and a countably infinite subset as well. Both implications of every equivalence have been accounted for in ZF.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Karagila, Forcing & Symmetric Extensions, discussion after Theorem 10.25, p. 51 (standard reference, not scraped)