Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31↗ rests on later material
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 Sorgenfrey line: R with the half-open intervals [a,b) as a basis is strictly finer than the usual topology, is first countable, has a countable dense subset, and its sequences converge only from the right

Example

Let B:={ [a,b):a,b∈R, a<b } be the family of bounded half-open intervals of R (Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then:

  1. B is a basis (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) for a topology TS on R. The space (R,TS) is the Sorgenfrey line, also called the lower limit topology.
  2. TS is strictly finer than the usual topology (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded): every set open in the usual topology is in TS, and [0,1) is in TS and is not open in the usual topology.
  3. The Sorgenfrey line is first countable (First countable space: a countable neighbourhood base at every point): for x∈R the family { [x, x+1/(k+1)):k∈N } is an at most countable neighbourhood base at x.
  4. It has an at most countable dense subset, namely the rationals: Q is dense in (R,TS) (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and is at most countable (Q is countably infinite, Finite, countably infinite, countable, uncountable).
  5. Sequences converge only from the right. For a sequence (xk) in R and x∈R, xk→x in TS (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure) if and only if for every real ε>0 there is K∈N with x≤xk<x+ε for all k≥K. In particular the sequence yk:=x−1/(k+1) converges to x in the usual topology and does not converge to x in TS.

At this point in the reading order, separability has not yet been defined; the later definition Separability: the existence of an at most countable dense subset ↗ abbreviates claim 4.

Facts & Assumptions

Given: R with its order and its usual metric dR(x,y)=∣x−y∣, the family B above, points x,a,b,c,d∈R and a sequence (xk) in R. Here 1/(k+1) abbreviates the inverse of the canonical natural (k+1)⋅1R.

[A1]

[a,b)={ t∈R:a≤t<b } (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[L1]

A family is a basis for a topology on R exactly when it covers R and every point of an intersection of two members lies in a member inside that intersection; the topology is then { U:every x∈U has a member B with x∈B⊆U } (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, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L3]

For every real ε>0 there is a natural n≥1 with 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε); for n≥1 the canonical natural is positive (Canonical naturals are positive and strictly increasing) and 0<u<v gives 0<1/v<1/u (Inverses of positives are positive, and reciprocation reverses order); every nonzero natural is a successor (Every nonzero natural number is a successor).

[L4]

0<1 (The multiplicative identity is positive), and adding a constant preserves strict inequality (Order is preserved by adding a constant and by adding inequalities); the order of R is total, so a two-element set of reals has a maximum and a minimum (Maximum and minimum of a set).

[L5]

Strictly between any two reals lies a rational (The rationals embed densely in the reals); Q is at most countable (Q is countably infinite, Finite, countably infinite, countable, uncountable).

[L6]

A is dense exactly when it meets every nonempty basic open set (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); a neighbourhood of x contains a basic open set containing x, and every point lies in each of its neighbourhoods (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L7]

xk→x means that for every neighbourhood N of x there is K with xk∈N for all k≥K (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure); a nonempty set admitting a surjection from N is at most countable (A nonempty set is at most countable iff it is a surjective image of N).

Verification

technique · direct
1.1

B covers R: for x∈R one has x<x+1 by [L4], so [x, x+1)∈B and x∈[x,x+1).

A1L4
1.2

Let x∈[a,b)∩[c,d) and put a′:=max⁡{a,c} and b′:=min⁡{b,d}, which exist by [L4]. Then [a,b)∩[c,d)=[a′,b′), since a≤t and c≤t together say a′≤t and t<b with t<d says t<b′; and a′≤x<b′ gives a′<b′, so [a′,b′)∈B and x∈[a′,b′)⊆[a,b)∩[c,d).

A1L4
1.3

For x∈R and real r>0: x<x+r by [L4], and [x, x+r)⊆(x−r, x+r), since x−r<x≤t<x+r.

A1L2L4
1.4

For every k∈N the real 1/(k+1) is positive by [L3], so [x, x+1/(k+1))∈B by [L4] and contains x.

A1L3L4
1.5

[0,1)∈B, since 0<1 by [L4].

A1L4
1.6

Every nonempty member [a,b) of B meets Q: by [L5] there is a rational q with a<q<b, and then q∈[a,b).

A1L5
1.7

The same sequence converges to x in the usual topology: given r>0, [L3] gives n≥1 with 1/n<r and n=m+1; for k≥m the canonical naturals satisfy 0<(m+1)⋅1R≤(k+1)⋅1R, so 1/(k+1)≤1/(m+1)<r by [L3], and ∣yk−x∣=1/(k+1)<r, that is yk∈B(x,r).

L2L3L4
2.1

By steps 1.1 and 1.2 the family B satisfies the two basis conditions of [L1], so it is a basis for the topology TS described there; this is claim 1.

step 1.1step 1.2L1
2.2

[0,1) is not open in the usual topology: for any r>0, [L3] gives a natural n≥1 with 1/n<r, and −1/n satisfies −r<−1/n<0, so −1/n∈(−r,r) while −1/n∉[0,1); hence no ball around 0 lies inside [0,1).

step 1.5L2L3L4
2.3

The family { [x, x+1/(k+1)):k∈N } is nonempty and is the image of the surjection k↦[x, x+1/(k+1)) from N, hence at most countable.

step 1.4L7
2.4

By step 1.6 the set Q meets every nonempty basic open set, so it is dense by [L6]; with [L5] it is at most countable, which is claim 4.

step 1.6L5L6
3.1

Every set U open in the usual topology lies in TS: for x∈U take r>0 with (x−r,x+r)⊆U, and then x∈[x, x+r)⊆U by step 1.3, with [x,x+r)∈B.

step 1.3step 2.1L1L2
3.2

Let N be a neighbourhood of x in TS and take [a,b)∈B with x∈[a,b)⊆N, so a≤x<b and b−x>0; by [L3] fix a natural n≥1 with 1/n<b−x and write n=m+1 with m∈N. Then x+1/(m+1)<b, so [x, x+1/(m+1))⊆[x,b)⊆[a,b)⊆N.

step 2.1A1L3L4L6
3.3

For every real ε>0 the set [x, x+ε) is a member of B containing x, hence a neighbourhood of x in TS.

step 2.1A1L4L6
4.1

By steps 3.1 and 2.2 the topology TS contains the usual topology and contains [0,1), which the usual topology does not; so TS is strictly finer, which is claim 2.

step 1.5step 3.1step 2.2
4.2

By steps 1.4, 3.2 and 2.3 the family of claim 3 consists of neighbourhoods of x, is at most countable, and has a member inside every neighbourhood of x; so it is an at most countable neighbourhood base at x, and x was arbitrary. This is claim 3.

step 1.4step 3.2step 2.3L6
4.3

If xk→x in TS and ε>0, then by step 3.3 the set [x,x+ε) is a neighbourhood of x, so there is K with xk∈[x,x+ε), that is x≤xk<x+ε, for all k≥K.

step 3.3L7
4.4

Conversely, assume the ε condition and let N be a neighbourhood of x; take [a,b)∈B with x∈[a,b)⊆N and apply the condition with ε:=b−x>0, obtaining K with x≤xk<b for all k≥K; since a≤x≤xk, this gives xk∈[a,b)⊆N for all k≥K. So xk→x.

step 2.1step 3.2A1L6L7
5.1

The sequence yk=x−1/(k+1) satisfies yk<x for every k, since 1/(k+1)>0; so no term lies in [x,x+1), and by step 4.3 with ε=1 the sequence does not converge to x in TS.

step 4.3L3L4
6.1

Steps 4.3 and 4.4 give the equivalence of claim 5, and steps 5.1 and 1.7 give the sequence it names; with steps 4.1, 4.2, 2.4 and 2.1 all five claims are proved.

step 2.1step 4.1step 4.2step 2.4step 4.3step 4.4step 5.1step 1.7∎

Remarks

  • The Sorgenfrey line is first countable and has an at most countable dense subset, and it is nevertheless not metrizable. That is not proved here: the standard argument uses a second-countability or a Baire-type input that is not available at this point in the reading order. Claims 3 and 4 are stated for what they are, and no metrizability verdict is drawn from them.

  • Where the asymmetry comes from. The basis members are closed on the left and open on the right, so a neighbourhood of x always contains a whole interval to the right of x and need contain nothing to its left. Claim 5 is the exact expression of that, and it is why [0,1), which is neither open nor closed in the usual topology, is open here — and also closed, its complement being the union of the basic sets [b,b+1) for b≥1 together with [a,0) for a<0.

  • The index shift is the usual one. The neighbourhood base uses radii 1/(k+1) for k∈N rather than 1/k, because N contains 0 (The four live convention forks of general topology and which side this library takes on each).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

83 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