Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

The lower-limit line has a clopen basis, is regular, and is Lindelöf under countable choice

Statement

The lower-limit line has a basis of clopen sets and is regular. Assuming the Axiom of Countable Choice, it is Lindelöf.

Facts & Assumptions

Given: The lower-limit line and, for the Lindelöf assertion, the Axiom of Countable Choice.

[F1]
[L2]

Q is countably infinite and is dense in R (Q is countably infinite, The rationals embed densely in the reals).

[A1]

The Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1

Each [a,b) is clopen: its complement is (−∞,a)∪[b,∞), a union of lower-limit basic intervals. Hence the line is regular by [L1].

F1L1
1.2

Let U be an open cover and let O be the union of the usual intervals (a,b) for which [a,b) lies in a member of U. The rational-endpoint intervals [p,q) contained in members of U cover O; they form an at most countable family by [L2].

F1L2
1.3

Put D=R∖O. For x∈D, some [x,bx) lies in a member of U, and [x,bx)∩D={x}. The first rational qx∈(x,bx) in a fixed enumeration exists, and the intervals (x,qx) are pairwise disjoint; their first rationals rx are therefore distinct. Thus x↦rx injects D into Q, so D is at most countable.

F1L2
2.1

By [A1], choose one member of U covering each point of the at most countable set D. Together with one covering member for each rational-endpoint interval used in step 1.2, these form an at most countable subcover of U.

A1L2step 1.2step 1.3
3.1

Therefore the lower-limit line is Lindelöf under countable choice.

F2step 2.1∎

Depends on

Used by

Dependency tree · two levels

50 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