Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)judge 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.

For the lower-limit line, χ=d=L=c=0\chi=d=L=c=\aleph_0 and w=20w=2^{\aleph_0} under choice

Example

Assume Choice and let SS be the lower-limit line. At xx, the intervals [x,x+1/n)[x,x+1/n) form a countable local base. No finite family is a local base: the intersection of finitely many neighbourhoods is still a neighbourhood and contains some y>xy>x, whereas [x,y)[x,y) cannot contain any member of a finite local base contained in that intersection. Hence χ(S)=0\chi(S)=\aleph_0.

The rationals are countable and meet every nonempty half-open interval, so d(S)0d(S)\le\aleph_0; no finite set is dense, since a short half-open interval can avoid it. The published lower-limit-line lemma gives Lindelöfness, while the cover {[n,n):n1}\{[-n,n):n\ge1\} has no finite subcover, so d(S)=L(S)=0d(S)=L(S)=\aleph_0. Density bounds cellularity above, and the disjoint family {[n,n+1):nZ}\{[n,n+1):n\in\mathbb Z\} bounds it below, giving c(S)=0c(S)=\aleph_0.

All half-open intervals form a basis of cardinality at most R2=R|\mathbb R|^2=|\mathbb R|. Conversely, well order any basis and assign to each xx its first member BxB_x with xBx[x,x+1)x\in B_x\subseteq[x,x+1); if x<yx<y, then ByB_y cannot contain xx, so BxByB_x\ne B_y. Thus w(S)=R=20w(S)=|\mathbb R|=2^{\aleph_0}.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 190 results over 32 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