Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge 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 topology on R, with the half-open intervals [a,b) as a basis

Definition

Let Bℓ={[a,b):a,b∈R, a<b}. The lower-limit topology Tℓ on R is the topology having Bℓ as a basis. The resulting space is the lower-limit line.

This basis is well defined. It covers R, because x∈[x,x+1) for every x. If x∈[a,b)∩[c,d), then x∈[max⁡(a,c),min⁡(b,d)), whose right endpoint exceeds x and which lies inside the intersection. Thus the two basis conditions of A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis hold, so Bℓ determines a unique topology.

The lower-limit topology is finer than the usual topology: if x∈(a,b), then [x,(x+b)/2) is a lower-limit basic interval containing x and contained in (a,b). No equality with the usual topology is asserted here. The half-open intervals use the interval convention of Intervals of R: the nine order-convex forms, nondegeneracy, and length, and opens are exactly unions of basis members by Basis and subbasis for a topology, and the topology generated by a family of sets.

Depends on

Used by

Dependency tree · two levels

8 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