Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-02
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.

Under choice, the lower-limit line is regular and separable but not second countable and therefore not metrizable

Example

Assume the Axiom of Choice. The lower-limit line is regular and separable, but not second countable and hence not metrizable.

Facts & Assumptions

Given: The lower-limit topology on R\mathbb R and the Axiom of Choice.

[L2]

The rationals are countable and meet every nonempty usual interval, hence every [a,b)[a,b) (Q\mathbb{Q} is countably infinite, The rationals embed densely in the reals).

[L3]

Under choice, a metrizable space is second countable exactly when it is separable (Assuming countable choice, a metrizable space is second countable if and only if it is separable if and only if it is Lindelöf).

Verification

technique · contradiction
1.1

By [L1] the space is regular, and by [L2] the countable set Q\mathbb Q is dense, so it is separable.

L1L2
1.2

Suppose (Bn)nN(B_n)_{n\in\mathbb N} is a basis. For each real xx, the basis condition for [x,x+1)[x,x+1) yields a least-index Bm(x)B_{m(x)} with xBm(x)[x,x+1)x\in B_{m(x)}\subseteq[x,x+1).

assume-contra
2.1

If m(x)=m(y)m(x)=m(y) and x<yx<y, then xBm(y)[y,y+1)x\in B_{m(y)}\subseteq[y,y+1), impossible. Thus xm(x)x\mapsto m(x) injects R\mathbb R into N\mathbb N, contradicting R\mathbb{R} is uncountable (Cantor's nested intervals, 1874).

step 1.2
3.1

Therefore the lower-limit line is not second countable. If it were metrizable, its separability from step 1.1 and [L3] would make it second countable, another contradiction.

L3step 1.1step 2.1discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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