Alphabeta Math
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.

✓ 13 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Topological Spaces and Continuity: Examples and Counterexamples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The discrete and indiscrete topologies, their closures and interiors, and their continuous maps in each direction

Example

Let X be a set, let Tdisc=P(X) be the discrete topology and Tind={∅,X} the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and let A⊆X. Then:

  1. In the discrete space every subset is clopen, and int⁡(A)=A=A‾,∂A=∅ for every A (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). The singletons { {x}:x∈X } form a basis (Basis and subbasis for a topology, and the topology generated by a family of sets).
  2. In the indiscrete space int⁡(A)={XA=X∅A≠X,A‾={∅A=∅XA≠∅, so ∂A=X for every A other than ∅ and X.
  3. Maps out of a discrete space and into an indiscrete space are all continuous. For any topological space Y, every function (X,Tdisc)→Y is continuous, and every function Y→(X,Tind) is continuous.
  4. The other two directions are restrictive. A function f:Y→(X,Tdisc) is continuous exactly when f−1[{x}] is open in Y for every x∈X; and a function g:(X,Tind)→Y is continuous exactly when g−1[V]∈{∅,X} for every open V⊆Y.

The two topologies are the extreme points of the comparison order (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison): every topology on X is finer than Tind and coarser than Tdisc.

Facts & Assumptions

Given: A set X with the two topologies above, a subset A⊆X, a topological space Y, and functions f:Y→X and g:X→Y.

[A1]
[A2]

int⁡(A) is the largest open subset of A and A‾ the smallest closed superset of A; ∂A=A‾∖int⁡(A); a set is closed exactly when its complement is open (Interior, closure, boundary, exterior, derived set and isolated point in a topological space, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L1]

A map is continuous exactly when preimages of open sets are open, and exactly when preimages of the members of any fixed basis are open, a basis being a subbasis for the topology it generates (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾, clauses (b) and (d), Continuity of a map of topological spaces at a point and globally).

[L2]

A family B of subsets of X is a basis for a topology exactly when it covers X 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 subfamilies (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).

Verification

technique · direct
1.1

In the discrete topology every subset of X is open by [A1], so every subset is also closed, its complement being open; hence every subset is clopen.

A1A2
1.2

The singletons cover X, and the intersection of two distinct singletons is empty while the intersection of a singleton with itself is that singleton; so the family of singletons satisfies the basis criterion, and the topology it generates consists of all unions of singletons, that is of all subsets of X, which is Tdisc.

A1L2
1.3

In the indiscrete topology the open subsets of A are ∅ always and X exactly when A=X; so int⁡(A)=X if A=X and int⁡(A)=∅ otherwise.

A1A2
1.4

In the indiscrete topology the closed sets are ∅ and X, so the closed supersets of A are X always and ∅ exactly when A=∅; hence A‾=∅ if A=∅ and A‾=X otherwise.

A1A2
1.5

For any function h out of the discrete space and any open V in the target, h−1[V] is a subset of X and hence open; for any function h into the indiscrete space, the only open sets of the target are ∅ and X, whose preimages are ∅ and the whole source, both open.

A1L1
2.1

For f:Y→(X,Tdisc): the singletons form a basis by step 1.2, so by clause (d) of [L1] continuity of f is exactly the openness of every f−1[{x}]. For g:(X,Tind)→Y: by clause (b) continuity is exactly the condition that each g−1[V] be open in the indiscrete topology, that is a member of {∅,X}.

step 1.2A1L1
2.2

By step 1.1 every A⊆X is open and closed in the discrete topology, so int⁡(A)=A and A‾=A by [A2], whence ∂A=∅; with step 1.2 this is claim 1.

step 1.1step 1.2A2
2.3

Steps 1.3 and 1.4 are claim 2, and for A∉{∅,X} they give ∂A=X∖∅=X.

step 1.3step 1.4A2
3.1

Step 1.5 is claim 3 and step 2.1 is claim 4.

step 1.5step 2.1∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint

Example

Let X be an infinite set with the cofinite topology Tcof, whose open sets are ∅ together with the sets of finite complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable). Then:

  1. Closures. For A⊆X, A‾={AA finiteXA infinite,int⁡(A)={AX∖A finite∅X∖A infinite.
  2. A subset is dense if and only if it is infinite (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets); in particular every infinite subset is dense, and no finite subset is.
  3. No two nonempty open sets are disjoint. If U,V∈Tcof are nonempty then U∩V≠∅.
  4. Every singleton is closed, so points are distinguishable by closed sets; nevertheless claim 3 says distinct points are never separated by disjoint open sets, so the space is as far from Hausdorff as a space with closed points can be.

Facts & Assumptions

Given: An infinite set X with the cofinite topology, subsets A,U,V⊆X and points of X.

[A1]

The open sets of Tcof are ∅ together with the sets whose complement is finite; the closed sets are X together with the finite subsets of X (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[A2]

A subset of a finite set is finite, and a union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies); "infinite" means "not finite" (Finite, countably infinite, countable, uncountable).

[L2]

A is dense exactly when it meets every nonempty open set, equivalently when A‾=X (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets).

Verification

technique · direct
1.1

If A is finite then A is closed by [A1], so A‾=A by [L1].

A1L1
1.2

If A is infinite then no finite set contains A, since a subset of a finite set is finite; so the only closed superset of A is X and A‾=X.

A1A2L1
1.3

If X∖A is finite then A is open by [A1], so int⁡(A)=A.

A1L1
1.4

If X∖A is infinite then no nonempty open U satisfies U⊆A: such a U would have X∖U finite and X∖A⊆X∖U, making X∖A finite by [A2]. Hence int⁡(A)=∅.

A1A2L1
1.5

Let U,V be nonempty open sets; then X∖U and X∖V are finite, so X∖(U∩V)=(X∖U)∪(X∖V) is finite by [A2], and U∩V cannot be empty, for otherwise X=X∖(U∩V) would be finite, contradicting the hypothesis on X.

givenA1A2L3
1.6

Each singleton {x} is finite, hence closed by [A1].

A1
2.1

Steps 1.1 to 1.4 give claim 1.

step 1.1step 1.2step 1.3step 1.4
2.2

If A is infinite then A‾=X by step 1.2, so A is dense by [L2]; if A is finite then A≠X, since X is infinite, and A‾=A≠X by step 1.1, so A is not dense. Hence the dense subsets are exactly the infinite ones, which is claim 2.

step 1.1step 1.2givenL2
3.1

Step 1.5 is claim 3, and step 1.6 with claim 3 is claim 4.

step 1.5step 1.6∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant

Example

Give R the cocountable topology Tcoc, whose open sets are ∅ together with the sets whose complement is at most countable (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable). Then:

  1. The closed sets are exactly the at most countable subsets of R together with R itself, and these two families are disjoint, R being uncountable (R is uncountable (Cantor's nested intervals, 1874)). In particular every singleton is closed.
  2. Closures. For A⊆R, A‾={AA at most countableRA uncountable.
  3. A sequence converges if and only if it is eventually constant (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure), and then it converges to its eventual value and to no other point.

Claim 3 is what makes this space the standard witness that sequences can be blind to a topology: the convergent sequences are the same as in the discrete topology, while the topology itself is very far from discrete by claim 2.

Facts & Assumptions

Given: R with the cocountable topology, a subset A⊆R, a sequence (xk) in R and points p,q∈R. Write R:={ xk:k∈N } for the range of (xk).

[A1]

The open sets of Tcoc are ∅ together with the sets of at most countable complement; a set is closed exactly when its complement is open (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[A2]

xk→p means that for every neighbourhood N of p there is K with xk∈N for all k≥K; a neighbourhood of p is a set containing an open set containing p, and every point lies in each of its neighbourhoods (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L2]

Every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L3]

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

A set F⊆R is closed exactly when R∖F is open, that is exactly when R∖F=∅, giving F=R, or R∖(R∖F)=F is at most countable. So the closed sets are R together with the at most countable sets, and R is not among the latter by [L1].

A1L1
1.2

A singleton is finite, hence at most countable, hence closed.

A1L1
1.3

Assume xk→p. The map k↦xk is a surjection N→R and R≠∅, so R is at most countable by [L3]; hence S:=R∖{p} is at most countable by [L2], and U:=R∖S is open by [A1] and contains p.

assume-hypA1L2L3
1.4

Conversely, if (xk) is eventually constant with value q, say xk=q for all k≥K0, then for every neighbourhood N of q one has q∈N and hence xk∈N for all k≥K0; so xk→q.

A2
2.1

If A is at most countable then A is closed by step 1.1, so A‾=A by [L4].

step 1.1L4
2.2

If A is uncountable then no at most countable set contains A, since a subset of an at most countable set is at most countable by [L2]; so the only closed superset of A is R and A‾=R.

step 1.1L2L4
2.3

By [A2] applied to the neighbourhood U of step 1.3 there is K with xk∈U for all k≥K; and xk∈R together with xk∉S=R∖{p} forces xk=p. So (xk) is eventually constant with value p.

step 1.3A2
2.4

Suppose (xk) is eventually constant with value q, say xk=q for all k≥K0, and let p≠q. The set N:=R∖{q} is open by [A1], its complement {q} being finite, and p∈N, so N is a neighbourhood of p; but xk=q∉N for every k≥K0, so no tail of the sequence lies in N and xk↛p. Hence the eventual value is the only limit.

step 1.4A1A2
3.1

Claim 1 is step 1.1 with step 1.2, claim 2 is steps 2.1 and 2.2, and claim 3 is steps 2.3, 1.4 and 2.4.

step 1.1step 1.2step 2.1step 2.2step 2.3step 1.4step 2.4∎

Remarks

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

Sierpinski space and the particular-point topology, with their closures and their continuous maps

Example

Let X be a set, let p∈X, and give X the particular-point topology Tp={∅}∪{ U⊆X:p∈U } (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then, for A⊆X:

  1. Closed sets. The closed subsets of (X,Tp) are X together with the sets not containing p.
  2. Interior and closure (Interior, closure, boundary, exterior, derived set and isolated point in a topological space): int⁡(A)={Ap∈A∅p∉A,A‾={Xp∈AAp∉A. In particular {p} is dense (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and is the smallest dense subset, while X∖{p} has empty interior.
  3. No two nonempty open sets are disjoint, since every nonempty open set contains p.
  4. Sierpinski space is the case of a two-point set. With S={a,b}, a≠b, and particular point b, the topology is TSier={∅,{b},S}; here {b}‾=S and {a}‾={a}, so b is the open point and a the closed point.
  5. Continuous maps into Sierpinski space are exactly the open subsets of the source. For a topological space Y, the assignment f↦f−1[{b}] is a bijection from the set of continuous maps Y→(S,TSier) onto the topology of Y (For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A‾)⊆f(A)‾).

Facts & Assumptions

Given: A set X with a point p∈X and the particular-point topology Tp; a subset A⊆X; the two-point set S={a,b} with a≠b and particular point b; and a topological space Y with topology TY.

[A2]

int⁡(A) is the largest open subset of A and A‾ the smallest closed superset of A (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Verification

technique · direct
1.1

F⊆X is closed exactly when X∖F is open, that is exactly when X∖F=∅, giving F=X, or p∈X∖F, that is p∉F; this is claim 1.

A1
1.2

If p∈A then A is open by [A1], so int⁡(A)=A; if p∉A then no nonempty open set is contained in A, every such set containing p, so int⁡(A)=∅.

A1A2
1.3

Two nonempty open sets both contain p, so their intersection contains p and is nonempty; this is claim 3.

A1
1.4

For S={a,b} with particular point b, the subsets containing b are {b} and S, so Tb={∅,{b},S}, which is TSier.

A1
2.1

If p∉A then A is closed by step 1.1, so A‾=A; if p∈A then no closed set other than X contains A, a closed proper subset omitting p by step 1.1, so A‾=X.

step 1.1A2
2.2

Let f:Y→S be any function; by [L2] and step 1.4, f is continuous exactly when f−1[∅]=∅, f−1[S]=Y and f−1[{b}] are all open in Y, and the first two always are; so f is continuous exactly when f−1[{b}]∈TY.

step 1.4L2
3.1

Steps 1.2 and 2.1 give claim 2; in particular {p}‾=X makes {p} dense by [L1], and it is contained in every dense set, since a set A with p∉A has A‾=A≠X whenever p∉A. Also int⁡(X∖{p})=∅ by step 1.2.

step 1.2step 2.1L1
3.2

By step 1.4 and step 2.1 applied to S: {b}‾=S since b is the particular point, and {a}‾={a} since b∉{a}; this is claim 4.

step 2.1step 1.4
3.3

The assignment f↦f−1[{b}] of step 2.2 is injective, since f is determined by f−1[{b}] — its value is b there and a elsewhere — and surjective onto TY, since for U∈TY the function taking the value b on U and a off U is continuous by step 2.2 and has f−1[{b}]=U; this is claim 5.

step 2.2L2
4.1

Claims 1, 2, 3, 4 and 5 are established by step 1.1, step 3.1, step 1.3, step 3.2 and step 3.3 respectively.

step 1.1step 1.3step 3.1step 3.2step 3.3∎

Remarks

  • Sierpinski space is the smallest space that is not indiscrete and not discrete, and claim 5 is why it matters: it represents the notion "open set" as a mapping problem, in the same way that a two-element set represents "subset". Every topology on Y is recovered as the set of continuous maps Y→S.

  • When X has at least two points, the particular-point topology separates distinct points only in the weakest sense. Any two distinct points are distinguished by an open set: if one of them is p, then {p} is open and contains p but not the other; and if neither is p, then {x,p} is open and contains x but not y. It is not Hausdorff: every two nonempty open sets meet at p, and {p} is dense by claim 2. When X={p}, by contrast, the topology is discrete and the separation axioms hold vacuously. In every case the space is first countable, since {{x,p}} is a one-element neighbourhood base at x: any neighbourhood of x contains an open set containing x, which contains p as well.

  • A comparison with the cofinite topology. When X is infinite, both have the property that any two nonempty open sets meet (On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint), but the particular-point topology achieves it with a single point doing all the work. When X has at least two points, its particular point p is not closed, whereas every point is closed in the cofinite topology.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The order topology on a totally ordered set, with the open rays as a subbasis, and its agreement with the usual topology of R

Example

Let (L,≤) be a totally ordered set (Partial order and partially ordered set) with at least two elements. For a∈L write

L<a:={ t∈L:t<a },L>a:={ t∈L:a<t }

for the open rays, and let SL be the family of all open rays. The order topology on L is Tord:=⟨SL⟩, the topology generated by SL (Basis and subbasis for a topology, and the topology generated by a family of sets). Then:

  1. A basis. By 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 finite intersections of open rays form a basis for Tord, and every such intersection is L itself (the empty intersection), an open ray, or an open interval (a,b):=L>a∩L<b. So BL:={L}∪SL∪{ (a,b):a,b∈L } is a basis for the order topology.
  2. On R the order topology is the usual topology. Taking L=R with its order (Order on the reals, Ordered field), Tord=TdR, the metric topology of dR(x,y)=∣x−y∣ (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). The rays and intervals of claim 1 are then exactly the intervals of that shape in the sense of Intervals of R: the nine order-convex forms, nondegeneracy, and length.

Claim 2 identifies the order topology of R with a topology already in the library rather than introducing a second one.

Facts & Assumptions

Given: A totally ordered set (L,≤) with at least two elements, the family SL of its open rays, and R with its order and its usual metric dR(x,y)=∣x−y∣.

[A1]

≤ is reflexive, antisymmetric, transitive and total, and s<t abbreviates s≤t with s≠t (Partial order and partially ordered set); on R this is the order of Order on the reals and Ordered field.

[L1]

⟨S⟩ is the coarsest topology containing S, and a family is a basis for a topology exactly when the topology is the family of unions of its subfamilies (Basis and subbasis for a topology, and the topology generated by a family of sets).

Verification

technique · direct
1.1

An intersection of finitely many open rays is L when there are none; when there are some, group them into the lower rays L<b1,…,L<bm and the upper rays L>a1,…,L>an. Since ≤ is total, a nonempty finite set of elements of L has a least and a greatest member, so the intersection of the lower rays is L<b with b least among the bi, and that of the upper rays is L>a with a greatest among the aj; the whole intersection is therefore L, a single ray, or L>a∩L<b=(a,b).

A1L2
1.2

In R every open ray is open in the usual topology: if x<b then r:=b−x>0 and (x−r, x+r)⊆(−∞,b), since t<x+r=b; symmetrically, if a<x then r:=x−a>0 and (x−r, x+r)⊆(a,∞).

A1L3
1.3

In R every ball is an intersection of two open rays: (x−r, x+r)=R>x−r∩R<x+r, directly from the definitions of the two rays and of the interval.

A1L3
2.1

By step 1.1 and [L2] the family BL of claim 1 is a basis for Tord, since it is exactly the family of finite intersections of open rays; this is claim 1.

step 1.1L1L2
2.2

By step 1.2 the usual topology of R contains SR, so it contains Tord=⟨SR⟩, the latter being the coarsest such topology.

step 1.2L1
3.1

Conversely, let U be open in the usual topology of R; for each x∈U there is r>0 with (x−r,x+r)⊆U, and (x−r,x+r) is an intersection of two open rays by step 1.3, hence a member of BR and so open in Tord; therefore U is a union of members of Tord and so lies in Tord.

step 1.3step 2.1L1L3L4
4.1

Steps 2.2 and 3.1 give the two inclusions, so the order topology of R is its usual topology, which is claim 2.

step 2.1step 2.2step 3.1∎

Remarks

  • All three descriptions of R's topology name one collection of open sets. Claim 2 identifies the order topology with the metric topology of dR, and Which results on this page use the order of R and therefore have no general-topological analogue records that the metric topology and the order-native topology built earlier in this library are in turn the same collection. Nothing below uses that third description; it is named so that a reader moving between the pages knows there is one topology and not two.

  • The hypothesis that L has at least two elements is what keeps the rays from being useless: on a one-point set every ray is empty and the order topology is the only topology there is. Nothing else in claim 1 uses it.

  • The order topology is not always metrizable, and the order alone does not decide the matter. Claim 2 is a statement about R and is proved from the specific fact that the balls of dR are the bounded open intervals; no general theorem is being invoked, and none is available here.

  • The Sorgenfrey line is not the order topology of the usual order on R (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). It is generated by the half-open intervals [a,b), which are not unions of open rays and open intervals, so it is strictly finer than the order topology of that order; the order it comes from is the same order, which shows that "generated by intervals" is not the same as "the order topology". Whether some other total order on R has the Sorgenfrey topology as its order topology is a different question, and nothing here or elsewhere in this library answers it.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-31↗ rests on later materialOpen item page →

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).

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

Closure and complement generate at most fourteen sets from any subset, and (0,1)∪(1,2)∪{3}∪([4,5]∩Q) attains fourteen

Example

Let X be a topological space and write, for A⊆X,

k(A):=A‾,c(A):=X∖A,

the closure and the complement (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). Words in the two symbols act on P(X) by composition, the empty word acting as the identity. Then:

  1. The relation. As operators on P(X), cc=1,kk=k,kckckck=kck.
  2. At most fourteen. For every A⊆X the family of sets obtainable from A by applying words in k and c has at most fourteen members, namely the images of A under the fourteen words 1, c, k, kc, ck, ckc, kck, kckc, ckck, ckckc, kckck, kckckc, ckckck, ckckckc.
  3. Fourteen is attained. In R with its 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) the set A:=(0,1)∪(1,2)∪{3}∪([4,5]∩Q) produces fourteen pairwise distinct sets. Seven of them are A,kA=[0,2]∪{3}∪[4,5],kckA=(−∞,0]∪[2,4]∪[5,∞), kckckA=[0,2]∪[4,5],kcA=(−∞,0]∪{1}∪[2,∞),kckcA=[0,2],kckckcA=(−∞,0]∪[2,∞), and the other seven are their complements.

Facts & Assumptions

Given: A topological space X and a subset A⊆X; and, for claim 3, R with its usual topology and the set A displayed above. Write i:=ckc, so that i(A)=int⁡(A) by Interior, closure, boundary, exterior, derived set and isolated point in a topological space.

[A1]

A‾ is the smallest closed superset of A; A⊆A‾; A‾ is closed and a set is closed exactly when it equals its closure; X∖int⁡(A)=X∖A‾, so i=ckc is the interior operator (Interior, closure, boundary, exterior, derived set and isolated point in a topological space, A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set).

[L2]

Strictly between any two reals lies a rational (The rationals embed densely in the reals); Q is at most countable (Q is countably infinite), every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable), and a nondegenerate open interval is uncountable (Every nondegenerate interval of R is uncountable).

[L3]

A two-element set of reals has a maximum and a minimum, the order being total (Maximum and minimum of a set).

Verification

technique · direct
1.1

cc=1 and kk=k hold by [A3].

A3
1.2

For an open B⊆X: B⊆kB by [A3], and B=iB because B is open, so monotonicity of i gives B=iB⊆ikB and monotonicity of k gives kB⊆kikB; conversely ikB⊆kB gives kikB⊆kkB=kB. Hence kikB=kB for every open B.

A1A2A3
1.3

In R, for a<b the interval (a,b) is open: for x∈(a,b) put r:=min⁡{x−a, b−x}>0 by [L3]; then (x−r,x+r)⊆(a,b). The rays (−∞,b) and (a,∞) are open by the same computation with one of the two bounds omitted.

L1L3
1.4

In R, for a<b and any x∈[a,b] and any r>0, the interval J:=(max⁡{a, x−r}, min⁡{b, x+r}) is nonempty: its left endpoint is below its right endpoint because a<b, a≤x<x+r and x−r<x≤b and x−r<x+r. Every point of J lies in [a,b]∩(x−r,x+r).

L1L3
1.5

No nonempty open subset of R is contained in Q: it would contain a ball (x−r,x+r), which is uncountable by [L2], whereas a subset of Q is at most countable by [L2].

L1L2
2.1

In R, for a≤b the interval [a,b] is closed, its complement being (−∞,a)∪(b,∞), a union of two open sets; likewise (−∞,b] and [a,∞) are closed, and a singleton {t} is closed, its complement being (−∞,t)∪(t,∞).

step 1.3A1L1
2.2

By step 1.4 and [L2] the set J contains a rational, and being a nonempty open interval it is uncountable by [L2] while Q is at most countable, so J also contains a point outside Q. Hence for every x∈[a,b] and every r>0 the ball (x−r,x+r) meets both [a,b]∩Q and [a,b]∖Q.

step 1.4L2
2.3

Claim 1: by step 1.2 applied to the open set B:=iA one gets kikiA=kiA for every A, that is kiki=ki as operators; substituting i=ckc turns ki into kckc and gives kckckckc=kckc; composing on the right with c and using cc=1 gives kckckck=kck.

step 1.1step 1.2A1
3.1

Consequently [a,b]∩Q‾=[a,b]=[a,b]∖Q‾ for a<b: each closure is contained in [a,b], which is closed by step 2.1, and contains [a,b] by step 2.2 together with the neighbourhood criterion for the closure.

step 2.1step 2.2A1L1
3.2

Likewise (a,b)‾=[a,b] for a<b: the inclusion ⊆ holds because [a,b] is closed and contains (a,b), and ⊇ because for x∈[a,b] and r>0 the nonempty interval J of step 1.4 meets (a,b), being contained in (a,b) except possibly for its endpoints, which it excludes. The same argument gives (a,∞)‾=[a,∞) and (−∞,b)‾=(−∞,b].

step 2.1step 1.4A1L1
3.3

Claim 2: using cc=1 and kk=k, every word in k and c equals an alternating word, one with no two adjacent equal letters. An alternating word of length at least 8 contains kckckck as a block of seven consecutive letters — the first seven if it begins with k, the second through eighth if it begins with c — and replacing that block by kck shortens it by four. Iterating, every word equals an alternating word of length at most 7. There are exactly two alternating words of each length from 1 to 7 and one of length 0, and the length-7 word beginning with k is kckckck=kck by claim 1; the remaining fourteen are those listed in the statement.

step 1.1step 2.3
4.1

In R with A=(0,1)∪(1,2)∪{3}∪([4,5]∩Q): by [A2] the closure of the four-term union is the union of the four closures, which by steps 2.1, 3.1 and 3.2 are [0,1], [1,2], {3} and [4,5]; hence kA=[0,2]∪{3}∪[4,5].

step 2.1step 3.1step 3.2A2
4.2

cA=(−∞,0]∪{1}∪[2,3)∪(3,4)∪([4,5]∖Q)∪(5,∞). Here [2,3)‾=[2,3], because [2,3] is closed and contains [2,3) while monotonicity gives [2,3]=(2,3)‾⊆[2,3)‾; the other five closures are (−∞,0], {1}, [3,4], [4,5] and [5,∞) by steps 2.1, 3.1 and 3.2. So by [A2] the closure of the six-term union is (−∞,0]∪{1}∪[2,3]∪[3,4]∪[4,5]∪[5,∞)=(−∞,0]∪{1}∪[2,∞), that is kcA=(−∞,0]∪{1}∪[2,∞).

step 2.1step 3.1step 3.2A2
5.1

ckA=(−∞,0)∪(2,3)∪(3,4)∪(5,∞), and its closure is (−∞,0]∪[2,4]∪[5,∞) by [A2] and steps 3.2 and 2.1; so kckA=(−∞,0]∪[2,4]∪[5,∞).

step 2.1step 3.2step 4.1A2
5.2

ckcA=(0,1)∪(1,2), whose closure is [0,2] by [A2] and step 3.2; so kckcA=[0,2]. Then ckckcA=(−∞,0)∪(2,∞), whose closure is (−∞,0]∪[2,∞) by [A2] and step 3.2; so kckckcA=(−∞,0]∪[2,∞).

step 3.2step 4.2A2
6.1

ckckA=(0,2)∪(4,5), whose closure is [0,2]∪[4,5] by [A2] and step 3.2; so kckckA=[0,2]∪[4,5].

step 3.2step 5.1A2
7.1

The seven sets A, kA, kckA, kckckA, kcA, kckcA, kckckcA have the following membership pattern at the five test points 0, 1, 3, 9/2, 6, writing 1 for "belongs" and 0 for "does not": A gives (0,0,1,1,0), since 9/2 is a rational in [4,5]; kA gives (1,1,1,1,0); kckA gives (1,0,1,0,1); kckckA gives (1,1,0,1,0); kcA gives (1,1,1,1,1); kckcA gives (1,1,0,0,0); kckckcA gives (1,0,1,1,1).

step 4.1step 5.1step 6.1step 4.2step 5.2L2
8.1

The remaining seven words of claim 2 are the complements of these seven — the list of fourteen words consists of the seven above and those seven preceded by c — so their patterns are the bitwise complements (1,1,0,0,1), (0,0,0,0,1), (0,1,0,1,0), (0,0,1,0,1), (0,0,0,0,0), (0,0,1,1,1), (0,1,0,0,0). The fourteen patterns are pairwise distinct, so the fourteen sets are, and claim 3 holds.

step 3.3step 7.1∎

Remarks

  • Where each axiom is spent. Claim 1 is the whole content of the bound: the reduction in claim 2 is combinatorics on words once cc=1, kk=k and kckckck=kck are available. The proof of the last of these uses only that the interior of a set is open, that k and i are monotone and that k is idempotent — that is, the Kuratowski axioms of Kuratowski: operators satisfying c(∅)=∅, A⊆c(A), c(c(A))=c(A) and c(A∪B)=c(A)∪c(B) correspond bijectively to topologies and nothing about R.

  • Fourteen, not fifteen. There are fifteen alternating words of length at most seven; exactly one of them, kckckck, collapses. That single collapse is the entire difference between the true bound and the naive one, which is why the identity of claim 1 is the theorem here.

  • Why this particular set. The four pieces of A are chosen to exercise the four ways a set can fail to be closed or open: an interval missing an interior point, an isolated point, a dense-with-empty-interior piece, and the gap between the pieces. Removing any one of them lowers the count.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

In the cocountable topology on R the sequential closure of [0,1] is [0,1] while its closure is all of R

Statement refuted

Refuted: that the sequential closure of a subset of a topological space equals its closure. The sequential closure is contained in the closure, continuity implies sequential continuity, and sequential limits need not be unique asserts only the inclusion seqcl⁡(A)⊆A‾, and asserts it without any hypothesis; the witness below shows that the inclusion can be as far from an equality as it is possible to be, the two sides differing by all but a bounded interval.

Witness. Give R the cocountable topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant) and take A:=[0,1] (Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then seqcl⁡(A)=[0,1]⊊R=A‾.

Facts & Assumptions

Given: R with the cocountable topology, and the set A=[0,1]={ t∈R:0≤t≤1 }.

[A1]

seqcl⁡(A) is the set of points to which some sequence with all terms in A converges (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L1]

In the cocountable topology on R a sequence converges if and only if it is eventually constant, and it then converges to its eventual value and to no other point (In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant, claim 3).

[L2]

Counterexample

technique · direct
1.1

0<1 by [L3], so [0,1] is a nondegenerate closed interval and is uncountable by [L3].

L3
1.2

Let (xk) be a sequence with xk∈[0,1] for every k and suppose xk→p in the cocountable topology. By [L1] the sequence is eventually constant with value p, so p=xK for some index K, and xK∈[0,1]; hence p∈[0,1].

A1L1
1.3

Conversely every a∈[0,1] lies in seqcl⁡([0,1]), the constant sequence with value a having all its terms in [0,1] and converging to a by [L1].

A1L1
2.1

By steps 1.2 and 1.3, seqcl⁡([0,1])=[0,1].

step 1.2step 1.3
2.2

By step 1.1 the set [0,1] is uncountable, so [0,1]‾=R by [L2].

step 1.1L2
3.1

The inclusion [0,1]⊆R is strict, since 2∉[0,1]; so by steps 2.1 and 2.2 the sequential closure of [0,1] is strictly smaller than its closure, and the inclusion of [L4] cannot in general be improved to an equality.

step 2.1step 2.2L4∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The identity from the cocountable topology on R to the usual topology is sequentially continuous and not continuous

Statement refuted

Facts & Assumptions

Given: R carrying Tcoc as source and TR as target, and the identity function between them.

[A1]

The open sets of Tcoc are ∅ together with the sets of at most countable complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

In (R,Tcoc) a sequence converges if and only if it is eventually constant, and then to its eventual value (In the cocountable topology on R the closed sets are the countable sets and R, and a sequence converges iff it is eventually constant, claim 3).

[L4]

For a<b the interval (a,b) is uncountable (Every nondegenerate interval of R is uncountable), and every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

Counterexample

technique · direct
1.1

V:=B(0,1)=(−1,1) is open in the usual topology, the radius 1 being positive by [L5].

L2L5
1.2

1<1+1 by [L5], so (1, 1+1) is uncountable by [L4], and it is contained in R∖(−1,1), a point x>1 satisfying neither x<1 nor −1<x<1.

L4L5
1.3

Let (xk) be a sequence converging to p in (R,Tcoc); by [L1] it is eventually constant with value p, say xk=p for all k≥K.

L1
2.1

R∖(−1,1) is not at most countable, since otherwise its subset (1, 1+1) would be at most countable by [L4], contradicting step 1.2. Hence V=(−1,1) is nonempty and has a complement that is not at most countable, so V∉Tcoc.

step 1.2A1L4
2.2

The image sequence id(xk)=xk of step 1.3 is eventually equal to p, so for every neighbourhood N of p in the usual topology one has p∈N and hence xk∈N for all k≥K; that is id(xk)→id(p) in the usual topology. As (xk) and p were arbitrary, id is sequentially continuous.

step 1.3L3
3.1

id−1[V]=V is open in the target by step 1.1 and not open in the source by step 2.1, so id is not continuous; with step 2.2 the witness is established and the claim of FALSE: a sequentially continuous map between topological spaces is continuous is refuted.

step 1.1step 2.1step 2.2L3∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

In the indiscrete topology every sequence converges to every point, and in the cofinite topology on an infinite set an injective sequence converges to every point

Statement refuted

Refuted: that a convergent sequence in a topological space has exactly one limit, and hence that the notation lim⁡kxk denotes at that generality (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

Witnesses.

  1. Let X carry the indiscrete topology and have at least two points (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then every sequence in X converges to every point of X.
  2. Let X be infinite with the cofinite topology and let (xk) be an injective sequence in X (Injection, surjection, bijection). Then (xk) converges to every point of X.
  3. Claim 2 is instantiated without any choice principle by X:=N with the cofinite topology and the sequence xk:=k, which is injective outright and whose index set is infinite (The natural numbers N (von Neumann), The pigeonhole principle on N).

No appeal is made to "every infinite set has a countably infinite subset". That statement is not a theorem of ZF, and claim 2 is a conditional statement about a sequence that is given; claim 3 supplies such a sequence explicitly on N rather than extracting one from an arbitrary infinite set.

Facts & Assumptions

Given: A set X with at least two points carrying the indiscrete topology; an infinite set X carrying the cofinite topology, a point p∈X and an injective sequence (xk) in X; and N with the cofinite topology and the sequence xk=k.

[A1]

xk→p means that for every neighbourhood N of p there is K∈N with xk∈N for all k≥K; a neighbourhood of p contains an open set containing p (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[A2]

In the indiscrete topology the only open sets are ∅ and X; in the cofinite topology the open sets are ∅ together with the sets of finite complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

A subset of a finite set is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies); ≈ is symmetric and transitive, and an injection restricts to a bijection onto its image (Equinumerous sets, A≈B and A⪯B, Injection, surjection, bijection).

[L3]

A subset of N that is not bounded above is countably infinite (Every subset of an at most countable set is at most countable); no finite set is countably infinite, since N≉n for every natural n (The pigeonhole principle on N, claim 4, Finite, countably infinite, countable, uncountable).

[L5]

In the cofinite topology on an infinite set no two nonempty open sets are disjoint (On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint, claim 3).

Counterexample

technique · direct
1.1

Claim 1 is [L1]: in the indiscrete topology the only neighbourhood of any point is X itself, so every sequence is eventually in every neighbourhood of every point. With at least two points, some sequence therefore has two distinct limits.

A1A2L1
1.2

Let X be infinite with the cofinite topology, let p∈X, let (xk) be injective, and let N be a neighbourhood of p; fix an open U with p∈U⊆N, so U≠∅ and F:=X∖U is finite.

A1A2choose
1.3

The index set S:={ k∈N:xk∈F } is finite: the injectivity of (xk) makes k↦xk a bijection of S onto its image, which is a subset of the finite set F and hence finite, so S is finite as well.

givenL2
2.1

A finite subset of N is bounded above: if it were not, it would be countably infinite by [L3], and no finite set is countably infinite. So S is bounded above, say by K∈N.

step 1.3L3
3.1

For every k with k>K one has k∉S, that is xk∉F, that is xk∈U⊆N; so (xk) is eventually in N. As N was an arbitrary neighbourhood of p, xk→p, and as p was arbitrary this proves claim 2.

step 1.2step 2.1A1
4.1

Claim 3: N is infinite by [L4], the sequence xk=k is injective, being the identity function of N, and N has at least two points; so claim 2 applies and (k)k∈N converges in the cofinite topology on N to every natural number at once.

step 3.1L4
5.1

By steps 1.1 and 4.1 there are topological spaces in which a sequence has more than one limit; the notation lim⁡kxk therefore does not denote in a general topological space, and the uniqueness available for sequences of reals and in metric spaces is a property of those settings and not of convergence as such. Both spaces also fail to separate their points by disjoint open sets, in the second case by [L5].

step 1.1step 4.1L5∎

Remarks

  • Uniqueness of limits is a separation property, not a fact about sequences. In both witnesses distinct points fail to have disjoint neighbourhoods: in the indiscrete topology the only neighbourhood of any point is the whole space, and in the cofinite topology on an infinite set any two nonempty open sets meet (On an infinite set the cofinite topology has every infinite subset dense and no two nonempty open sets disjoint). Where distinct points are separated by disjoint open sets — in particular in every metric space (Distinct points of a metric space have disjoint balls around them) — the argument that a sequence cannot be eventually inside two disjoint sets restores uniqueness (A sequence in a metric space has at most one limit).

  • Why claim 2 is stated for a given injective sequence. The proof uses the sequence itself; infinitude of the underlying set supplies no canonical enumeration. Claim 3 avoids any selection issue by naming N and the identity sequence, for which injectivity is immediate.

  • A sequence in the cofinite topology need not be injective to have many limits, and need not have many limits if it is not: a constant sequence converges only to its value there, since singletons are closed. Injectivity is used in exactly one place, step 1.3, to make each finite set catch only finitely many indices.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

The identity from the discrete topology on R to the usual topology is a continuous bijection that is not a homeomorphism

Statement refuted

Refuted: that every continuous bijection of topological spaces is a homeomorphism (FALSE: every continuous bijection of topological spaces is a homeomorphism).

Witness. Let P(R) be the discrete topology on R (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) and TR its 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). The identity id:(R,P(R))⟶(R,TR) is a continuous bijection, is not an open map, and is therefore not a homeomorphism (A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces).

The two-point witness inlined in the refutation of FALSE: every continuous bijection of topological spaces is a homeomorphism shows that the failure occurs in the smallest possible space; the present one shows that it occurs between two topologies on R that both arise in practice.

Facts & Assumptions

Given: R carrying the discrete topology as source and the usual topology as target, and the identity function between them.

[A1]

The discrete topology on R is P(R): every subset is open (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L2]

A continuous bijection is a homeomorphism if and only if it is an open map (A continuous bijection is a homeomorphism iff it is open iff it is closed, and homeomorphy is an equivalence relation on spaces, claim 1).

Counterexample

technique · direct
1.1

id is a bijection of R onto R, being the identity function of the set R.

given
1.2

id is continuous: for any open V of the target the preimage id−1[V]=V is a subset of R and hence open in the discrete topology.

A1L1
1.3

{0} is open in the discrete topology by [A1].

A1
1.4

{0} is not open in the usual topology: for any r>0 the ball (−r,r) contains the point 1/n for a natural n≥1 with 1/n<r supplied by [L4], and 1/n>0, so 1/n∈(−r,r) and 1/n≠0; hence no ball around 0 lies inside {0}.

L3L4
2.1

By steps 1.3 and 1.4 the image id[{0}]={0} of an open set is not open, so id is not an open map; with steps 1.1 and 1.2 it is a continuous bijection, so by [L2] it is not a homeomorphism, and equivalently its inverse is not continuous.

step 1.1step 1.2step 1.3step 1.4L1L2∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

R covered by its closed singletons: every restriction of the indicator of {0} is continuous and the map is not, so the closed pasting lemma needs finiteness

Statement refuted

Refuted: that continuity may be checked on an arbitrary closed cover. Claim 3 of Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous allows only finitely many closed pieces, and the restriction is not removable.

Witness. Give R its 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) and let

F:={ {t}:t∈R }

be the family of its singletons, a cover of R by closed sets. Let f:R→R be the indicator of {0}, that is f(0)=1 and f(t)=0 for t≠0. Then every restriction f∣{t} is continuous for the subspace topology (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), and f is not continuous (Continuity of a map of topological spaces at a point and globally).

Facts & Assumptions

Given: R with its usual topology, the cover F by singletons, and the function f above.

[L3]

0<1 and hence 1<1+1 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities); consequently 1∈(0, 1+1) and 0∉(0, 1+1).

Counterexample

technique · direct
1.1

F covers R, each t∈R lying in {t}, and each member is closed by [L4].

givenL4
1.2

For every t∈R the subspace {t} carries only the two subsets ∅ and {t}, both of which are open in it by [A2]; hence every function out of {t} has open preimages and is continuous, and in particular f∣{t} is.

A2A1
1.3

V:=B(1,1)=(0, 1+1) is a ball, hence open in R by [L1], and f−1[V]={0}: indeed f(0)=1∈V by [L3], while f(t)=0∉V for t≠0, again by [L3].

L1L3
1.4

{0} is not open in the usual topology: for any r>0 the ball (−r,r) contains the point 1/n for a natural n≥1 with 1/n<r given by [L2], and 1/n>0, so 1/n∈(−r,r)∖{0}; hence no ball around 0 lies inside {0}.

L1L2
2.1

By step 1.3 and step 1.4 the preimage under f of the open set V is not open, so f is not continuous by [A1]; by steps 1.1 and 1.2 the family F is a closed cover of R every restriction to which is continuous. So claim 3 of Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous fails without the hypothesis that the cover be finite.

step 1.1step 1.2step 1.3step 1.4A1∎

Remarks

  • Why an infinite closed cover is useless and an infinite open cover is not. The proof of claim 3 of Continuity may be checked on any open cover, and on any finite closed cover; composites of continuous maps are continuous writes f−1[F] as a union of sets closed in R and concludes that it is closed; only finite unions of closed sets are closed (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and here f−1[R∖V] is the union of the uncountably many closed sets {t}, t≠0, which is R∖{0}, not closed. The open-cover version has no such restriction because arbitrary unions of open sets are open.

  • The singleton cover trivialises every function. For any spaces X and Y and any f:X→Y, the restriction of f to a one-point subspace is continuous, so the singleton cover certifies nothing whatever. The witness is therefore the sharpest form of the failure rather than a delicate example, and the map f could be replaced by any discontinuous function.

  • A two-piece closed cover of R would have detected the discontinuity. For instance (−∞,0] and [0,∞) are closed and cover R, and f restricted to (−∞,0] is already discontinuous at 0 by the argument of step 1.4 carried out inside that subspace.

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

In R the interiors of Q and of its complement are both empty while the interior of their union is everything

Statement refuted

Refuted: that int⁡(A∪B)=int⁡(A)∪int⁡(B). Claim 3 of Interior commutes with finite intersections and closure with finite unions, while the two reverse combinations are inclusions only and both fail for infinite families; the space is the disjoint union of interior, boundary and exterior asserts only the inclusion int⁡(A)∪int⁡(B)⊆int⁡(A∪B), and the gap can be the whole space.

Witness. In R with its 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) take A:=Q, the image of the rationals in R, and B:=R∖Q. Then

int⁡(A)=int⁡(B)=∅,int⁡(A∪B)=int⁡(R)=R.

Facts & Assumptions

Given: R with its usual topology, the set Q⊆R of rationals and its complement R∖Q.

[L2]

For a<b the interval (a,b) is uncountable (Every nondegenerate interval of R is uncountable, Finite, countably infinite, countable, uncountable); Q is at most countable (Q is countably infinite) and every subset of an at most countable set is at most countable (Every subset of an at most countable set is at most countable).

[L3]

Strictly between any two reals lies a rational (The rationals embed densely in the reals).

Counterexample

technique · direct
1.1

A nonempty open subset of R contains a ball (x−r, x+r) with r>0, and x−r<x+r, so that ball is uncountable by [L2].

L1L2
1.2

No nonempty open subset of R is contained in R∖Q: such a set would contain a ball (x−r, x+r), and by [L3] there is a rational strictly between x−r and x+r, which lies in that ball and not in R∖Q.

L1L3
1.3

Q∪(R∖Q)=R, which is open, so int⁡(Q∪(R∖Q))=R.

A1
2.1

No nonempty open subset of R is contained in Q: such a set would contain an uncountable ball by step 1.1, while every subset of Q is at most countable by [L2].

step 1.1L2
3.1

By step 2.1 the only open subset of Q is ∅, so int⁡(Q)=∅; by step 1.2 the same holds for R∖Q, so int⁡(R∖Q)=∅.

step 2.1step 1.2A1
4.1

By steps 3.1 and 1.3 the left side of the inclusion of [L4] is ∅∪∅=∅ and the right side is R, so the inclusion is strict and the identity fails as badly as it can.

step 3.1step 1.3L4∎

Remarks

CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)verified 2026-08-03 (gpt-5.6-sol-codex-subscription)Open item page →

The indiscrete topology on a two-point set is induced by no metric

Statement refuted

Refuted: that every topology is induced by some metric (FALSE: every topology is induced by some metric).

Witness. Let X={a,b} with a≠b, carrying the indiscrete topology Tind={∅,X} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). No metric d on X satisfies Td=Tind (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement), so (X,Tind) is not metrizable.

Facts & Assumptions

Given: The set X={a,b} with a≠b and the topology Tind={∅,X}; and a hypothetical metric d on X with Td=Tind.

[L1]

In any metric space, distinct points p≠q satisfy B(p,r)∩B(q,r)=∅ for r:=d(p,q)/2>0, and these two balls are open and contain p and q respectively (Distinct points of a metric space have disjoint balls around them, Open ball, closed ball and sphere in a metric space).

Counterexample

technique · direct
1.1

Suppose d is a metric on X with Td=Tind.

assume-hyp
1.2

Since a≠b, [L1] gives r:=d(a,b)/2>0 and two disjoint sets U:=B(a,r) and V:=B(b,r), open in (X,d), with a∈U and b∈V.

givenL1
2.1

By the supposition of step 1.1 the sets U and V are open in Tind, so each is ∅ or X by [A1]; and a∈U, b∈V make both nonempty, so U=V=X.

step 1.1step 1.2A1
3.1

Then U∩V=X, which contains a and is therefore nonempty, contradicting the disjointness of step 1.2. So no such metric exists, and (X,Tind) is not metrizable, which refutes the claim.

step 1.2step 2.1A2∎

Remarks

Sources