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.
No injection of a power set into finite sequences
Statement
In ZF, if , there is no injection .
Facts & Assumptions
Canonical finite-sequence coding from a supplied well-order: A supplied infinite well-order defines a bijection from its set to its finite sequences.
Transfinite recursion: Specified class rules recurse on set ordinals.
Hartogs: an ordinal that does not inject into a given set: The ordinal cannot inject into .
Proof
Given: The objects and hypotheses in the statement.
Suppose is injective. For an infinite well-ordered subset of , let be the uniformly defined bijection. Put . The inverse here is used only at points in the range, where it is unique.
If for some , the definition would give iff . Hence . Its finite sequence has a first coordinate outside ; let be that value. This rule is unique and definable from and the given order. The sequence cannot be empty, since the empty sequence belongs to .
Seed a well-order with the image of a supplied injection . Recursively for append , where consists of the seed followed by previously appended elements in index order. At limits take the union of these extending well-orders. Each stage is an infinite well-ordered subset of , so the rule always yields a fresh point. Thus the appended points inject into , a contradiction.
Depends on
Used by
Dependency tree · two levels
16 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
- Caicedo, Some choiceless results (3), §6 theorem and complete diagonal proof (standard reference, not scraped)
- Carneiro, Theorem 2 and canonical-construction discussion, pp.3–4 (standard reference, not scraped)