Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31
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 countable choice, a metrizable space is second countable if and only if it is separable if and only if it is Lindelöf

Statement

Assuming ACω\mathrm{AC}_\omega, a metrizable space is second countable iff it is separable iff it is Lindelöf.

Facts & Assumptions

Proof

technique · direct
1.1

Suppose DD is at most countable and dense. If D=D=\varnothing, then X=X=\varnothing and the empty family is a basis. Otherwise the family B={B(d,1/n):dD, n1}\mathcal B=\{B(d,1/n):d\in D,\ n\ge1\} is at most countable. It is a basis: if xUx\in U with UU open, choose ε>0\varepsilon>0 with B(x,ε)UB(x,\varepsilon)\subseteq U, then choose nn with 2/n<ε2/n<\varepsilon and dDB(x,1/n)d\in D\cap B(x,1/n). Now xB(d,1/n)B(x,2/n)Ux\in B(d,1/n)\subseteq B(x,2/n)\subseteq U. Thus separability implies second countability.

given
1.2

[L1] gives second countable implies Lindelöf.

L1
1.3

Suppose XX is Lindelöf. For each n1n\ge1, the radius-1/n1/n balls cover XX. Using [A1], choose an at most countable set DnD_n of centres whose radius-1/n1/n balls cover XX. Then D=n1DnD=\bigcup_{n\ge1}D_n is at most countable by [L2]. It is dense: for xUx\in U open, choose ε>0\varepsilon>0 with B(x,ε)UB(x,\varepsilon)\subseteq U and nn with 1/n<ε1/n<\varepsilon; some dDnd\in D_n has xB(d,1/n)x\in B(d,1/n), so dB(x,ε)Ud\in B(x,\varepsilon)\subseteq U. Thus Lindelöf implies separable.

A1L2given
2.1

The three implications prove the equivalence.

step 1.1step 1.2step 1.3

Depends on

Used by

Dependency tree · next 3 levels

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