Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Under choice, χ(x,X)\chi(x,X) and χ(X)\chi(X) are well-defined cardinals

Statement

Assuming choice, every χ(x,X)\chi(x,X) and the raw supremum χ(X)\chi(X) are well-defined cardinals.

Facts & Assumptions

[L2]

Every nonempty set of ordinals, and hence every nonempty set of cardinals, has a least member (Trichotomy and well-ordering of the ordinals).

[L3]

Cardinals are initial ordinals, a set of ordinals has union as its least upper bound, and mutual injections give a bijection (Cardinal (initial ordinal) and cardinality, Basic closure properties of ordinals, The Schröder-Bernstein theorem).

Proof

technique · direct
1.1

The neighbourhood filter at xx is a local base, so local-base cardinalities form a nonempty set.

given
2.1

The candidate cardinalities are ordinals, so their nonempty set has a least member, namely χ(x,X)\chi(x,X).

step 1.1L1L2
3.1

Let K={χ(x,X):xX}K=\{\chi(x,X):x\in X\} and δ=K\delta=\bigcup K. This is an ordinal and the least ordinal upper bound of KK by [L3]. It is a cardinal: if β<δ\beta<\delta and βδ\beta\approx\delta, choose κK\kappa\in K with β<κδ\beta<\kappa\le\delta. Then βκδβ\beta\preceq\kappa\preceq\delta\approx\beta, so [L3] gives βκ\beta\approx\kappa, contradicting that κ\kappa is a cardinal. Thus δ\delta is the cardinal supremum χ(X)\chi(X).

L3

Depends on

Used by

Cited to discharge well-definedness by Under choice, weight w(X), density d(X), local character χ(x,X), and character χ(X) as raw cardinal minima and a supremum.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 64 results over 22 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources