Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passverified 2026-08-05 (gpt-5.6-sol-codex-subscription)
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.

Assuming the Axiom of Choice, 2κ=∣P(κ)∣, and Cantor's theorem in cardinal form: κ<2κ

Statement

Assume the Axiom of Choice (The Axiom of Choice), so that every set has a cardinality (The well-ordering theorem, A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used). Let κ be a cardinal (Cardinal (initial ordinal) and cardinality) and read 2={0,1} as a cardinal. Then:

(a) 2κ=∣P(κ)∣ (Cardinal sum κ⊕λ, product κ⊗λ and exponentiation κλ, and why they are written apart from the ordinal operations), and more generally 2∣A∣=∣P(A)∣ for every set A;

(b) κ<2κ.

Clause (b) is Cantor's theorem: A≺P(A) transcribed into cardinal arithmetic. The underlying combinatorial fact — that there is no surjection A→P(A) — is a theorem of ZF and needs no choice at all; what the Axiom of Choice buys here is only the right to write ∣P(A)∣ and 2κ as cardinals in the first place.

Facts & Assumptions

Given: The Axiom of Choice, a cardinal κ, and a set A.

[L1]
[L2]

There is no surjection A→P(A), and A≺P(A), that is A⪯P(A) and A≉P(A) (Cantor's theorem: A≺P(A), Equinumerous sets, A≈B and A⪯B).

[L3]

For a well-orderable X, X≈∣X∣, the value is a cardinal, and equinumerous sets receive the same one (A set equinumerous with some ordinal has a least such ordinal, that ordinal is a cardinal, and equinumerous sets get the same one; no choice principle is used).

[L5]

For cardinals, κ≤λ if and only if κ⪯λ; and A⪯B with both well-orderable gives ∣A∣≤∣B∣ (claim (a) of Commutativity, associativity, distributivity and monotonicity of ⊕ and ⊗, the unit laws, the two exponent laws, and κ≤λ if and only if κ injects into λ).

[L6]

Assuming the Axiom of Choice every set is well-orderable, hence has a cardinality (The Axiom of Choice, The well-ordering theorem).

[L7]

Ordinals satisfy trichotomy, and a map with a two-sided inverse is a bijection (Trichotomy and well-ordering of the ordinals, Injection, surjection, bijection).

Proof

technique · direct
1.1

The map χ:P(κ)→κ2 sending S to its characteristic function, χS(ξ)=1 for ξ∈S and χS(ξ)=0 otherwise, has the two-sided inverse h↦h−1[{1}], so it is a bijection and P(κ)≈κ2.

L7
1.2

By [L2], κ⪯P(κ) and κ≉P(κ).

L2
2.1

Claim (a): by [L6] both P(κ) and κ2 have cardinalities, equal by step 1.1 and [L3], so ∣P(κ)∣=∣κ2∣=2κ by [L1]; and for an arbitrary set A, A≈∣A∣ by [L3] gives P(A)≈P(∣A∣) by [L4], hence ∣P(A)∣=2∣A∣.

step 1.1L1L3L4L6
2.2

By [L5] applied to step 1.2, κ=∣κ∣≤∣P(κ)∣; and κ≠∣P(κ)∣, since otherwise κ≈∣P(κ)∣≈P(κ) by [L3], contradicting step 1.2.

step 1.2L3L5L6
3.1

Therefore κ<∣P(κ)∣=2κ by trichotomy, which with step 2.1 is claim (b).

step 2.1step 2.2L7∎

Remarks

Why 2 and not some other base. The characteristic function of a subset takes two values, so the power set is the function space with base 2; that is the whole content of step 1.1, and it is why 2κ rather than P is the object cardinal arithmetic manipulates. For infinite κ, any base μ with 2≤μ gives the same value once μ≤2κ, by monotonicity, the second exponent law and Hessenberg: κ⊗κ=κ for every infinite cardinal κ, proved in ZF from the canonical well-order of κ×κ, and the companion page computes one such case; for finite κ the bases genuinely differ, 32=9≠4=22.

No fixed point. Clause (b) holds for every cardinal, so no cardinal satisfies 2κ=κ and the hierarchy of cardinals never terminates. The corresponding statement one level up — that α↦ℵα has no fixed point — is false, and the companion page exhibits one; the two operations behave quite differently, and it is the power operation, not the successor operation, that is unboundedly expansive.

Where the Axiom of Choice is and is not spent. Cantor's theorem: A≺P(A) is choice free, and so is step 1.1. The hypothesis is used only to know that a set has a cardinality: at P(κ) and at κ2 for clause (b), and again at A and P(A) in the general form of clause (a). In ZF alone, P(ω) may fail to be well-orderable, and then 2ℵ0 is not an ordinal and the inequality of clause (b) has no cardinal to compare κ with — while the underlying statement "there is no surjection ω→P(ω)" remains a theorem.

Depends on

Used by

Dependency tree · two levels

35 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