Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 and the Axiom of Choice.

[L2]

The rationals are countable and meet every nonempty usual interval, hence every [a,b) (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 is dense, so it is separable.

L1L2
1.2

Suppose (Bn)n∈N is a basis. For each real x, the basis condition for [x,x+1) yields a least-index Bm(x) with x∈Bm(x)⊆[x,x+1).

assume-contra
2.1

If m(x)=m(y) and x<y, then x∈Bm(y)⊆[y,y+1), impossible. Thus x↦m(x) injects R into N, contradicting 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 · two levels

59 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