Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck 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 with the half-open intervals [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,b∈R, a<b } (Intervals of R: the nine order-convex forms, nondegeneracy, and length) and let Rℓ be R carrying the topology for which Bℓ 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ℓ is a basis for a topology on R.
  2. Rℓ 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ℓ is Lindelöf (Countably compact, Lindel"of, sequentially compact, limit point compact and σ-compact spaces, and relatively compact subsets), assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)).
  4. Rℓ×Rℓ with the product topology (The product set ∏i∈IXi 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):x∈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 with its order, the family Bℓ of half-open intervals [a,b)={t:a≤t<b} with a<b, the space Rℓ, and the product Rℓ×Rℓ.

[L1]

A family B of subsets of a set X is a basis for a unique topology exactly when it covers X and every point of an intersection of two members lies in a member inside that intersection; the topology consists of the sets U such that every x∈U has B∈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, 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 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 t there is therefore n∈N with t<ι(n) (Every complete ordered field is Archimedean, The canonical natural ι(n)=n⋅1F of a field); and for reals c<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 is countably infinite (Q is countably infinite) and R is uncountable (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 A and B are at most countable then so is A×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, an injection back into N being obtained from any such surjection (A nonempty set is at most countable iff it is a surjective image of 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)n∈N of nonempty sets there is f on N with f(n)∈Yn (The Axiom of Countable Choice (ACω)).

[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ℓ covers R, since x∈[x,x+1); and [a,b)∩[c,d) is [max⁡{a,c},min⁡{b,d}) when that is nonempty and ∅ otherwise, so it is a member of Bℓ or empty. By [L1] the family is a basis for exactly one topology, and a set is open in Rℓ exactly when each of its points has a half-open interval around it inside it.

L1L3
2.1

Claim 2: the family { [−ι(n),ι(n)):n∈N, n≥1 } consists of members of Bℓ, hence of open sets, and covers R by [L3]; the members increase with n, so a finite subfamily has union [−ι(N),ι(N)) for the largest index N occurring, which omits ι(N). So Rℓ is not compact.

L3L5step 1.1
2.2

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

L5step 1.1construct
2.3

In Rℓ×Rℓ the antidiagonal Δ is discrete as a subspace: for x∈R the basic set [x,x+1)×[−x,−x+1) meets Δ only in (x,−x), since a point (y,−y) in it satisfies x≤y and −x≤−y, that is y≤x. By [L7] each singleton of Δ is therefore open in the subspace.

L2L3L7step 1.1
2.4

Δ is closed in Rℓ×Rℓ: let (u,v) have u+v≠0. If u+v>0, every point (y1,y2) of [u,u+1)×[v,v+1) has y1+y2≥u+v>0, so the box misses Δ. If u+v<0, put δ:=−(u+v)/2>0; every point of [u,u+δ)×[v,v+δ) has y1+y2 at least u+v and less than u+v+2δ=0, so again the box misses Δ. So the complement of Δ is open.

L2L3step 1.1
3.1

R∖C is at most countable. Fix a surjection N→Q ([L4]) and for x∉C let r(x) be the rational of least index with x<r(x) and [x,r(x))∈D; such rationals exist, since D covers gives [a,b)∈D with a≤x<b, a rational q with x<q<b by [L3] then has [x,q)⊆[a,b) and so [x,q)∈D. Nothing is selected, the least index being determined by x. The map r is injective on R∖C: if x<y lay outside C with r(x)=r(y)=q, then [x,q)∈D gives (x,q)⊆C and x<y<q puts y in C. So R∖C injects into Q, hence is equinumerous with a subset of Q and at most countable by [L4].

L3L4step 2.2
3.2

C is covered by the at most countable family DQ:={ [p,q)∈D:p,q∈Q }, at most countable because [p,q)↦(p,q) injects it into Q×Q, which is at most countable by [L4], as is therefore the image subset: given x∈C there is [a,b)∈D with a<x<b, and [L3] gives rationals p,q with a<p<x<q<b, whence [p,q)⊆[a,b) lies in D and contains x.

L3L4step 2.2
4.1

So D0:=DQ∪{ [x,r(x)):x∈R∖C } is an at most countable subfamily of D by [L4] and covers R by steps 3.1 and 3.2. Every member of D lies inside some member of A, so [L6] applied to an indexing of D0 by N supplies one member of A for each member of D0, and those form an at most countable subcover of A. Hence Rℓ is Lindelöf: claim 3.

L4L5L6step 3.1step 3.2
5.1

Δ is uncountable, being in bijection with R under x↦(x,−x) and R being uncountable by [L4]. Were Rℓ×Rℓ Lindelöf, its closed subspace Δ would be too: given a cover of Δ by traces of ambient open sets, adjoining the complement of Δ gives an ambient open cover, an at most countable subcover of it traces back to an at most countable subcover of Δ. But Δ 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ℓ is not Lindelöf: claim 4.

L4L5L7step 2.3step 2.4∎

Remarks

What fails in the product. Lindelöfness of Rℓ 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) 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ℓ is finer than the usual topology of R, since every (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 · two levels

86 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