Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 ω⪯X, there is no injection P(X)→Seq⁡(X).

Facts & Assumptions

[F1]

Canonical finite-sequence coding from a supplied well-order: A supplied infinite well-order defines a bijection from its set to its finite sequences.

[F2]

Transfinite recursion: Specified class rules recurse on set ordinals.

[F3]

Hartogs: an ordinal that does not inject into a given set: The ordinal h(X) cannot inject into X.

Proof

Given: The objects and hypotheses in the statement.

1.1F1

Suppose G:P(X)→Seq⁡(X) is injective. For an infinite well-ordered subset (Y,<) of X, let H:Y→Seq⁡(Y) be the uniformly defined bijection. Put D={y∈Y:H(y)∈ran⁡(G) and y∉G−1(H(y))}. The inverse here is used only at points in the range, where it is unique.

2.1step 1.1

If G(D)=H(y) for some y∈Y, the definition would give y∈D iff y∉D. Hence G(D)∉Seq⁡(Y). Its finite sequence has a first coordinate outside Y; let a(Y,<) be that value. This rule is unique and definable from G and the given order. The sequence cannot be empty, since the empty sequence belongs to Seq⁡(Y).

3.1F2F3step 2.1∎

Seed a well-order with the image of a supplied injection ω→X. Recursively for ξ<h(X) append a(Yξ,<ξ), where Yξ 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 X, so the rule always yields a fresh point. Thus the appended points inject h(X) into X, 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