Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck pass
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.

R\mathbb{R} with the half-open intervals [a,b)[a,b) as a basis is not compact and, assuming the Axiom of Countable Choice, is Lindel"of, while its square is not Lindel"of, the antidiagonal being an uncountable closed discrete subspace

Example

Let B:={[a,b):a,bR, a<b}\mathcal{B}_\ell := \{\, [a,b) : a, b \in \mathbb{R},\ a < b \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) and let R\mathbb{R}_\ell be R\mathbb{R} carrying the topology for which B\mathcal{B}_\ell is a basis (Basis and subbasis for a topology, and the topology generated by a family of sets, 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). Then:

  1. B\mathcal{B}_\ell is a basis for a topology on R\mathbb{R}.
  2. R\mathbb{R}_\ell is not compact (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right).
  3. R\mathbb{R}_\ell is Lindelöf (Countably compact, Lindel"of, sequentially compact, limit point compact and σ\sigma-compact spaces, and relatively compact subsets), assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).
  4. R×R\mathbb{R}_\ell \times \mathbb{R}_\ell with the product topology (The product set iIXi\prod_{i \in I} X_i 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) is not Lindelöf: the antidiagonal Δ:={(x,x):xR}\Delta := \{\, (x,-x) : x \in \mathbb{R} \,\} is an uncountable subset that is closed and carries the discrete topology as a subspace.

So Lindelöfness is not preserved by products, even by the product of a space with itself.

This is the same space that appears elsewhere in the library under the name Sorgenfrey line, re-minted here because the published treatment lives on a page whose items may not be cited from anywhere; nothing below depends on that treatment.

Facts & Assumptions

Given: R\mathbb{R} with its order, the family B\mathcal{B}_\ell of half-open intervals [a,b)={t:at<b}[a,b) = \{t : a \le t < b\} with a<ba<b, the space R\mathbb{R}_\ell, and the product R×R\mathbb{R}_\ell \times \mathbb{R}_\ell.

[L1]

A family B\mathcal{B} of subsets of a set XX is a basis for a unique topology exactly when it covers XX and every point of an intersection of two members lies in a member inside that intersection; the topology consists of the sets UU such that every xUx \in U has BBB \in \mathcal{B} with xBUx \in B \subseteq 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, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L3]

The order of Order on the reals makes R\mathbb{R} a totally ordered field (The reals form a totally ordered field) with the least-upper-bound property (The Cauchy-sequence reals have the least-upper-bound property), hence a complete ordered field (Complete ordered field (least-upper-bound property)); for every real tt there is therefore nNn \in \mathbb{N} with t<ι(n)t < \iota(n) (Every complete ordered field is Archimedean, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field); and for reals c<dc<d there is a rational strictly between them (ℚ is dense in every Archimedean ordered field).

[L4]

A set is at most countable when it is finite or countably infinite (Finite, countably infinite, countable, uncountable); Q\mathbb{Q} is countably infinite (Q\mathbb{Q} is countably infinite) and R\mathbb{R} is uncountable (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)); every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable); if AA and BB are at most countable then so is A×BA \times B (A product of two at most countable sets is at most countable); and a nonempty set is at most countable iff it is a surjective image of N\mathbb{N}, an injection back into N\mathbb{N} being obtained from any such surjection (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}). The union of two at most countable sets is then at most countable, by interleaving two such surjections.

[L6]

Countable choice: for every family (Yn)nN(Y_n)_{n \in \mathbb{N}} of nonempty sets there is ff on N\mathbb{N} with f(n)Ynf(n) \in Y_n (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

[L7]

The open sets of a subspace are the traces of the ambient open sets, and its closed sets the traces of the ambient closed sets (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).

Verification

technique · direct
1.1

Claim 1: B\mathcal{B}_\ell covers R\mathbb{R}, since x[x,x+1)x \in [x, x+1); and [a,b)[c,d)[a,b) \cap [c,d) is [max{a,c},min{b,d})[\max\{a,c\}, \min\{b,d\}) when that is nonempty and \varnothing otherwise, so it is a member of B\mathcal{B}_\ell or empty. By [L1] the family is a basis for exactly one topology, and a set is open in R\mathbb{R}_\ell exactly when each of its points has a half-open interval around it inside it.

L1L3
2.1

Claim 2: the family {[ι(n),ι(n)):nN, n1}\{\, [-\iota(n), \iota(n)) : n \in \mathbb{N},\ n \ge 1 \,\} consists of members of B\mathcal{B}_\ell, hence of open sets, and covers R\mathbb{R} by [L3]; the members increase with nn, so a finite subfamily has union [ι(N),ι(N))[-\iota(N), \iota(N)) for the largest index NN occurring, which omits ι(N)\iota(N). So R\mathbb{R}_\ell is not compact.

L3L5step 1.1
2.2

For claim 3 let A\mathcal{A} be an open cover of R\mathbb{R}_\ell and let D\mathcal{D} be the family of members of B\mathcal{B}_\ell contained in some member of A\mathcal{A}; by step 1.1 the family D\mathcal{D} covers R\mathbb{R}. Put C:={(a,b):[a,b)D}C := \bigcup \{\, (a,b) : [a,b) \in \mathcal{D} \,\}.

L5step 1.1construct
2.3

In R×R\mathbb{R}_\ell \times \mathbb{R}_\ell the antidiagonal Δ\Delta is discrete as a subspace: for xRx \in \mathbb{R} the basic set [x,x+1)×[x,x+1)[x, x+1) \times [-x, -x+1) meets Δ\Delta only in (x,x)(x,-x), since a point (y,y)(y,-y) in it satisfies xyx \le y and xy-x \le -y, that is yxy \le x. By [L7] each singleton of Δ\Delta is therefore open in the subspace.

L2L3L7step 1.1
2.4

Δ\Delta is closed in R×R\mathbb{R}_\ell \times \mathbb{R}_\ell: let (u,v)(u,v) have u+v0u + v \ne 0. If u+v>0u + v > 0, every point (y1,y2)(y_1,y_2) of [u,u+1)×[v,v+1)[u,u+1) \times [v,v+1) has y1+y2u+v>0y_1 + y_2 \ge u+v > 0, so the box misses Δ\Delta. If u+v<0u+v < 0, put δ:=(u+v)/2>0\delta := -(u+v)/2 > 0; every point of [u,u+δ)×[v,v+δ)[u, u+\delta) \times [v, v+\delta) has y1+y2y_1 + y_2 at least u+vu+v and less than u+v+2δ=0u+v+2\delta = 0, so again the box misses Δ\Delta. So the complement of Δ\Delta is open.

L2L3step 1.1
3.1

RC\mathbb{R} \setminus C is at most countable. Fix a surjection NQ\mathbb{N} \to \mathbb{Q} ([L4]) and for xCx \notin C let r(x)r(x) be the rational of least index with x<r(x)x < r(x) and [x,r(x))D[x, r(x)) \in \mathcal{D}; such rationals exist, since D\mathcal{D} covers gives [a,b)D[a,b) \in \mathcal{D} with ax<ba \le x < b, a rational qq with x<q<bx < q < b by [L3] then has [x,q)[a,b)[x,q) \subseteq [a,b) and so [x,q)D[x,q) \in \mathcal{D}. Nothing is selected, the least index being determined by xx. The map rr is injective on RC\mathbb{R} \setminus C: if x<yx < y lay outside CC with r(x)=r(y)=qr(x) = r(y) = q, then [x,q)D[x,q) \in \mathcal{D} gives (x,q)C(x,q) \subseteq C and x<y<qx < y < q puts yy in CC. So RC\mathbb{R} \setminus C injects into Q\mathbb{Q}, hence is equinumerous with a subset of Q\mathbb{Q} and at most countable by [L4].

L3L4step 2.2
3.2

CC is covered by the at most countable family DQ:={[p,q)D:p,qQ}\mathcal{D}_{\mathbb{Q}} := \{\, [p,q) \in \mathcal{D} : p, q \in \mathbb{Q} \,\}, at most countable because [p,q)(p,q)[p,q) \mapsto (p,q) injects it into Q×Q\mathbb{Q} \times \mathbb{Q}, which is at most countable by [L4], as is therefore the image subset: given xCx \in C there is [a,b)D[a,b) \in \mathcal{D} with a<x<ba < x < b, and [L3] gives rationals p,qp, q with a<p<x<q<ba < p < x < q < b, whence [p,q)[a,b)[p,q) \subseteq [a,b) lies in D\mathcal{D} and contains xx.

L3L4step 2.2
4.1

So D0:=DQ{[x,r(x)):xRC}\mathcal{D}_0 := \mathcal{D}_{\mathbb{Q}} \cup \{\, [x, r(x)) : x \in \mathbb{R} \setminus C \,\} is an at most countable subfamily of D\mathcal{D} by [L4] and covers R\mathbb{R} by steps 3.1 and 3.2. Every member of D\mathcal{D} lies inside some member of A\mathcal{A}, so [L6] applied to an indexing of D0\mathcal{D}_0 by N\mathbb{N} supplies one member of A\mathcal{A} for each member of D0\mathcal{D}_0, and those form an at most countable subcover of A\mathcal{A}. Hence R\mathbb{R}_\ell is Lindelöf: claim 3.

L4L5L6step 3.1step 3.2
5.1

Δ\Delta is uncountable, being in bijection with R\mathbb{R} under x(x,x)x \mapsto (x,-x) and R\mathbb{R} being uncountable by [L4]. Were R×R\mathbb{R}_\ell \times \mathbb{R}_\ell Lindelöf, its closed subspace Δ\Delta would be too: given a cover of Δ\Delta by traces of ambient open sets, adjoining the complement of Δ\Delta gives an ambient open cover, an at most countable subcover of it traces back to an at most countable subcover of Δ\Delta. But Δ\Delta is discrete by step 2.3, so its singletons form an open cover admitting only itself as a subcover, and that family is uncountable. So R×R\mathbb{R}_\ell \times \mathbb{R}_\ell is not Lindelöf: claim 4.

L4L5L7step 2.3step 2.4

Remarks

What fails in the product. Lindelöfness of R\mathbb{R}_\ell rests on the rationals being dense and at most countable, so that a cover can be thinned to countably many rational-endpoint intervals plus countably many exceptional points. In the square each point (x,x)(x,-x) of the antidiagonal has a basic box around it meeting the antidiagonal in that point alone, and there are uncountably many such points; no countability of the rationals helps, because those boxes are pairwise distinct and each of them isolates one antidiagonal point, so an at most countable subfamily of the cover they generate can reach only at most countably many of them.

Neither compactness nor Lindelöfness is what separates the topologies. R\mathbb{R}_\ell is finer than the usual topology of R\mathbb{R}, since every (a,b)(a,b) is a union of half-open intervals, and both spaces are Lindelöf and not compact; the difference shows up only in the square.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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