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

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.

[L2]

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

Proof

technique · direct
1.1

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

F1L1
1.2

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

F1L2
1.3

Put D=ROD=\mathbb R\setminus O. For xDx\in D, some [x,bx)[x,b_x) lies in a member of U\mathcal U, and [x,bx)D={x}[x,b_x)\cap D=\{x\}. The first rational qx(x,bx)q_x\in(x,b_x) in a fixed enumeration exists, and the intervals (x,qx)(x,q_x) are pairwise disjoint; their first rationals rxr_x are therefore distinct. Thus xrxx\mapsto r_x injects DD into Q\mathbb Q, so DD is at most countable.

F1L2
2.1

By [A1], choose one member of U\mathcal U covering each point of the at most countable set DD. Together with one covering member for each rational-endpoint interval used in step 1.2, these form an at most countable subcover of U\mathcal 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 · next 3 levels

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