Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 plane: the product of two half-open-interval lines has the rectangles [a,b)×[c,d) as a basis and Q×Q as a countable dense subset

Example

Let B:={[a,b):a,bR, 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 for a topology TS on R (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); the space S:=(R,TS) is the Sorgenfrey line, and TS is finer than the usual topology (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).
  2. The Sorgenfrey plane is S×S with the product topology (The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). The rectangles [a,b)×[c,d)(a<b, c<d) form a basis for it.
  3. Q×Q is a dense subset of S×S (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, A product of two at most countable sets is at most countable, Finite, countably infinite, countable, uncountable). So the Sorgenfrey plane has a countable dense subset.

The word separable is not used here: it is not defined at this point in the reading order, and claim 3 says in full what it would abbreviate. Claim 1 restates, and reproves from the basis criterion, the construction of the Sorgenfrey line; the level-8 worked example of that line is linked in the remarks rather than depended on, since it lives on an examples page.

Facts & Assumptions

Given: The family B above; the Sorgenfrey line S; the product S×S with the product topology; reals a<b, c<d and points x,yR.

[A1]

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

[A2]

A basis for the product topology on a product of two spaces is the family of boxes U×V with U open in the first factor and V open in the second (The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

[L1]

A family is a basis for a topology on a set exactly when it covers the set and every point of an intersection of two members lies in a member inside that intersection; the topology is then the family of unions of its members, and is unique (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).

[L4]

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

[L5]

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, Every nonempty finite set of reals has a maximum and a minimum); a topology is a family of subsets of the underlying set (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

Verification

technique · direct
1.1

B covers R: for xR one has x<x+1, so [x,x+1)B and x[x,x+1).

A1L5
1.2

B satisfies the intersection condition: for x[a,b)[c,d) put a:=max{a,c} and b:=min{b,d}, available by [L5]; then [a,b)[c,d)=[a,b), and ax<b gives a<b, so this is a member of B containing x.

A1L5
1.3

Every bounded open interval is a union of members of B: (a,b)={[t,b):a<t<b}, since every s(a,b) lies in [s,b) and every such [t,b) lies in (a,b).

A1
1.4

Every nonempty [a,b)B contains a rational, by [L4] applied to a<b: a rational p with a<p<b satisfies p[a,b).

A1L4
2.1

By steps 1.1 and 1.2 with [L1], B is a basis for a unique topology TS on R.

step 1.1step 1.2L1
3.1

TS is finer than the usual topology: a set open in the usual topology is a union of bounded open intervals by [L2], and each of those is a union of members of B by step 1.3, hence lies in TS by [L1]. With step 2.1 this is claim 1.

step 1.3step 2.1L1L2
3.2

The rectangles [a,b)×[c,d) form a basis for S×S: they are boxes with open factors, hence open by [A2] and step 2.1; and given a box U×V with U,VTS and (x,y)U×V, step 2.1 and [L1] supply [a,b)U containing x and [c,d)V containing y, whence (x,y)[a,b)×[c,d)U×V. So every basic open box of S×S is a union of such rectangles, and [L1] applies. This is claim 2.

step 2.1A2L1L5
4.1

Q×Q meets every nonempty rectangle [a,b)×[c,d): by step 1.4 there are rationals p[a,b) and r[c,d), and (p,r) lies in the rectangle. By step 3.2 and [L3] the set Q×Q is therefore dense in S×S; and it is at most countable by [L4]. This is claim 3.

step 1.4step 3.2L3L4

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 143 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