Alphabeta Math
Session-authored (Fable 5 assisted)
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.

14 results · all verified · 13 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 XX be a set, let Tdisc=P(X)\mathcal{T}_{\mathrm{disc}} = \mathcal{P}(X) be the discrete topology and Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\} the indiscrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), and let AXA \subseteq X. Then:

  1. In the discrete space every subset is clopen, and int(A)=A=A,A=\operatorname{int}(A) = A = \overline{A}, \qquad \partial A = \varnothing for every AA (Interior, closure, boundary, exterior, derived set and isolated point in a topological space). The singletons {{x}:xX}\{\, \{x\} : x \in 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=XAX,A={A=XA,\operatorname{int}(A) = \begin{cases} X & A = X \\ \varnothing & A \ne X \end{cases}, \qquad \overline{A} = \begin{cases} \varnothing & A = \varnothing \\ X & A \ne \varnothing \end{cases}, so A=X\partial A = X for every AA other than \varnothing and XX.
  3. Maps out of a discrete space and into an indiscrete space are all continuous. For any topological space YY, every function (X,Tdisc)Y(X, \mathcal{T}_{\mathrm{disc}}) \to Y is continuous, and every function Y(X,Tind)Y \to (X, \mathcal{T}_{\mathrm{ind}}) is continuous.
  4. The other two directions are restrictive. A function f:Y(X,Tdisc)f : Y \to (X, \mathcal{T}_{\mathrm{disc}}) is continuous exactly when f1[{x}]f^{-1}[\{x\}] is open in YY for every xXx \in X; and a function g:(X,Tind)Yg : (X, \mathcal{T}_{\mathrm{ind}}) \to Y is continuous exactly when g1[V]{,X}g^{-1}[V] \in \{\varnothing, X\} for every open VYV \subseteq 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 XX is finer than Tind\mathcal{T}_{\mathrm{ind}} and coarser than Tdisc\mathcal{T}_{\mathrm{disc}}.

Facts & Assumptions

Given: A set XX with the two topologies above, a subset AXA \subseteq X, a topological space YY, and functions f:YXf : Y \to X and g:XYg : X \to Y.

[A1]

Tdisc=P(X)\mathcal{T}_{\mathrm{disc}} = \mathcal{P}(X) and Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[A2]

int(A)\operatorname{int}(A) is the largest open subset of AA and A\overline{A} the smallest closed superset of AA; A=Aint(A)\partial A = \overline{A} \setminus \operatorname{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)f(\overline{A}) \subseteq \overline{f(A)}, clauses (b) and (d), Continuity of a map of topological spaces at a point and globally).

[L2]

A family B\mathcal{B} of subsets of XX is a basis for a topology exactly when it covers XX 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 XX 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 XX, 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 XX, which is Tdisc\mathcal{T}_{\mathrm{disc}}.

A1L2
1.3

In the indiscrete topology the open subsets of AA are \varnothing always and XX exactly when A=XA = X; so int(A)=X\operatorname{int}(A) = X if A=XA = X and int(A)=\operatorname{int}(A) = \varnothing otherwise.

A1A2
1.4

In the indiscrete topology the closed sets are \varnothing and XX, so the closed supersets of AA are XX always and \varnothing exactly when A=A = \varnothing; hence A=\overline{A} = \varnothing if A=A = \varnothing and A=X\overline{A} = X otherwise.

A1A2
1.5

For any function hh out of the discrete space and any open VV in the target, h1[V]h^{-1}[V] is a subset of XX and hence open; for any function hh into the indiscrete space, the only open sets of the target are \varnothing and XX, whose preimages are \varnothing and the whole source, both open.

A1L1
2.1

For f:Y(X,Tdisc)f : Y \to (X,\mathcal{T}_{\mathrm{disc}}): the singletons form a basis by step 1.2, so by clause (d) of [L1] continuity of ff is exactly the openness of every f1[{x}]f^{-1}[\{x\}]. For g:(X,Tind)Yg : (X,\mathcal{T}_{\mathrm{ind}}) \to Y: by clause (b) continuity is exactly the condition that each g1[V]g^{-1}[V] be open in the indiscrete topology, that is a member of {,X}\{\varnothing, X\}.

step 1.2A1L1
2.2

By step 1.1 every AXA \subseteq X is open and closed in the discrete topology, so int(A)=A\operatorname{int}(A) = A and A=A\overline{A} = A by [A2], whence A=\partial A = \varnothing; 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}A \notin \{\varnothing, X\} they give A=X=X\partial A = X \setminus \varnothing = 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-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27Open item page →

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

Example

Let XX be an infinite set with the cofinite topology Tcof\mathcal{T}_{\mathrm{cof}}, whose open sets are \varnothing 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 AXA \subseteq X, A={AA finiteXA infinite,int(A)={AXA finiteXA infinite.\overline{A} = \begin{cases} A & A \text{ finite} \\ X & A \text{ infinite,} \end{cases} \qquad \operatorname{int}(A) = \begin{cases} A & X \setminus A \text{ finite} \\ \varnothing & X \setminus A \text{ infinite.} \end{cases}
  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,VTcofU, V \in \mathcal{T}_{\mathrm{cof}} are nonempty then UVU \cap V \ne \varnothing.
  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 XX with the cofinite topology, subsets A,U,VXA, U, V \subseteq X and points of XX.

[A1]

The open sets of Tcof\mathcal{T}_{\mathrm{cof}} are \varnothing together with the sets whose complement is finite; the closed sets are XX together with the finite subsets of XX (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).

[L1]

int(A)\operatorname{int}(A) is the largest open subset of AA, A\overline{A} the smallest closed superset of AA (Interior, closure, boundary, exterior, derived set and isolated point in a topological space); a set is closed exactly when it equals its closure (A point lies in the closure of AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set, claim 2).

[L2]

AA is dense exactly when it meets every nonempty open set, equivalently when A=X\overline{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 AA is finite then AA is closed by [A1], so A=A\overline{A} = A by [L1].

A1L1
1.2

If AA is infinite then no finite set contains AA, since a subset of a finite set is finite; so the only closed superset of AA is XX and A=X\overline{A} = X.

A1A2L1
1.3

If XAX \setminus A is finite then AA is open by [A1], so int(A)=A\operatorname{int}(A) = A.

A1L1
1.4

If XAX \setminus A is infinite then no nonempty open UU satisfies UAU \subseteq A: such a UU would have XUX \setminus U finite and XAXUX \setminus A \subseteq X \setminus U, making XAX \setminus A finite by [A2]. Hence int(A)=\operatorname{int}(A) = \varnothing.

A1A2L1
1.5

Let U,VU, V be nonempty open sets; then XUX \setminus U and XVX \setminus V are finite, so X(UV)=(XU)(XV)X \setminus (U \cap V) = (X \setminus U) \cup (X \setminus V) is finite by [A2], and UVU \cap V cannot be empty, for otherwise X=X(UV)X = X \setminus (U \cap V) would be finite, contradicting the hypothesis on XX.

givenA1A2L3
1.6

Each singleton {x}\{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 AA is infinite then A=X\overline{A} = X by step 1.2, so AA is dense by [L2]; if AA is finite then AXA \ne X, since XX is infinite, and A=AX\overline{A} = A \ne X by step 1.1, so AA 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\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant

Example

Give R\mathbb{R} the cocountable topology Tcoc\mathcal{T}_{\mathrm{coc}}, whose open sets are \varnothing 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\mathbb{R} together with R\mathbb{R} itself, and these two families are disjoint, R\mathbb{R} being uncountable (R\mathbb{R} is uncountable (Cantor's nested intervals, 1874)). In particular every singleton is closed.
  2. Closures. For ARA \subseteq \mathbb{R}, A={AA at most countableRA uncountable.\overline{A} = \begin{cases} A & A \text{ at most countable} \\ \mathbb{R} & A \text{ uncountable.} \end{cases}
  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\mathbb{R} with the cocountable topology, a subset ARA \subseteq \mathbb{R}, a sequence (xk)(x_k) in R\mathbb{R} and points p,qRp, q \in \mathbb{R}. Write R:={xk:kN}R := \{\, x_k : k \in \mathbb{N} \,\} for the range of (xk)(x_k).

[A1]

The open sets of Tcoc\mathcal{T}_{\mathrm{coc}} are \varnothing 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]

xkpx_k \to p means that for every neighbourhood NN of pp there is KK with xkNx_k \in N for all kKk \ge K; a neighbourhood of pp is a set containing an open set containing pp, 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\mathbb{N} is at most countable (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}).

Verification

technique · direct
1.1

A set FRF \subseteq \mathbb{R} is closed exactly when RF\mathbb{R} \setminus F is open, that is exactly when RF=\mathbb{R} \setminus F = \varnothing, giving F=RF = \mathbb{R}, or R(RF)=F\mathbb{R} \setminus (\mathbb{R} \setminus F) = F is at most countable. So the closed sets are R\mathbb{R} together with the at most countable sets, and R\mathbb{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 xkpx_k \to p. The map kxkk \mapsto x_k is a surjection NR\mathbb{N} \to R and RR \ne \varnothing, so RR is at most countable by [L3]; hence S:=R{p}S := R \setminus \{p\} is at most countable by [L2], and U:=RSU := \mathbb{R} \setminus S is open by [A1] and contains pp.

assume-hypA1L2L3
1.4

Conversely, if (xk)(x_k) is eventually constant with value qq, say xk=qx_k = q for all kK0k \ge K_0, then for every neighbourhood NN of qq one has qNq \in N and hence xkNx_k \in N for all kK0k \ge K_0; so xkqx_k \to q.

A2
2.1

If AA is at most countable then AA is closed by step 1.1, so A=A\overline{A} = A by [L4].

step 1.1L4
2.2

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

step 1.1L2L4
2.3

By [A2] applied to the neighbourhood UU of step 1.3 there is KK with xkUx_k \in U for all kKk \ge K; and xkRx_k \in R together with xkS=R{p}x_k \notin S = R \setminus \{p\} forces xk=px_k = p. So (xk)(x_k) is eventually constant with value pp.

step 1.3A2
2.4

Suppose (xk)(x_k) is eventually constant with value qq, say xk=qx_k = q for all kK0k \ge K_0, and let pqp \ne q. The set N:=R{q}N := \mathbb{R} \setminus \{q\} is open by [A1], its complement {q}\{q\} being finite, and pNp \in N, so NN is a neighbourhood of pp; but xk=qNx_k = q \notin N for every kK0k \ge K_0, so no tail of the sequence lies in NN and xk↛px_k \not\to 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 XX be a set, let pXp \in X, and give XX the particular-point topology Tp={}{UX:pU}\mathcal{T}_p = \{\varnothing\} \cup \{\, U \subseteq X : p \in U \,\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then, for AXA \subseteq X:

  1. Closed sets. The closed subsets of (X,Tp)(X, \mathcal{T}_p) are XX together with the sets not containing pp.
  2. Interior and closure (Interior, closure, boundary, exterior, derived set and isolated point in a topological space): int(A)={ApApA,A={XpAApA.\operatorname{int}(A) = \begin{cases} A & p \in A \\ \varnothing & p \notin A, \end{cases} \qquad \overline{A} = \begin{cases} X & p \in A \\ A & p \notin A. \end{cases} In particular {p}\{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}X \setminus \{p\} has empty interior.
  3. No two nonempty open sets are disjoint, since every nonempty open set contains pp.
  4. Sierpinski space is the case of a two-point set. With S={a,b}S = \{a,b\}, aba \ne b, and particular point bb, the topology is TSier={,{b},S}\mathcal{T}_{\mathrm{Sier}} = \{\varnothing, \{b\}, S\}; here {b}=S\overline{\{b\}} = S and {a}={a}\overline{\{a\}} = \{a\}, so bb is the open point and aa the closed point.
  5. Continuous maps into Sierpinski space are exactly the open subsets of the source. For a topological space YY, the assignment ff1[{b}]f \mapsto f^{-1}[\{b\}] is a bijection from the set of continuous maps Y(S,TSier)Y \to (S, \mathcal{T}_{\mathrm{Sier}}) onto the topology of YY (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)f(\overline{A}) \subseteq \overline{f(A)}).

Facts & Assumptions

Given: A set XX with a point pXp \in X and the particular-point topology Tp\mathcal{T}_p; a subset AXA \subseteq X; the two-point set S={a,b}S = \{a,b\} with aba \ne b and particular point bb; and a topological space YY with topology TY\mathcal{T}_Y.

[A1]

Tp\mathcal{T}_p consists of \varnothing together with the subsets of XX containing pp; 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]

int(A)\operatorname{int}(A) is the largest open subset of AA and A\overline{A} the smallest closed superset of AA (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Verification

technique · direct
1.1

FXF \subseteq X is closed exactly when XFX \setminus F is open, that is exactly when XF=X \setminus F = \varnothing, giving F=XF = X, or pXFp \in X \setminus F, that is pFp \notin F; this is claim 1.

A1
1.2

If pAp \in A then AA is open by [A1], so int(A)=A\operatorname{int}(A) = A; if pAp \notin A then no nonempty open set is contained in AA, every such set containing pp, so int(A)=\operatorname{int}(A) = \varnothing.

A1A2
1.3

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

A1
1.4

For S={a,b}S = \{a,b\} with particular point bb, the subsets containing bb are {b}\{b\} and SS, so Tb={,{b},S}\mathcal{T}_b = \{\varnothing, \{b\}, S\}, which is TSier\mathcal{T}_{\mathrm{Sier}}.

A1
2.1

If pAp \notin A then AA is closed by step 1.1, so A=A\overline{A} = A; if pAp \in A then no closed set other than XX contains AA, a closed proper subset omitting pp by step 1.1, so A=X\overline{A} = X.

step 1.1A2
2.2

Let f:YSf : Y \to S be any function; by [L2] and step 1.4, ff is continuous exactly when f1[]=f^{-1}[\varnothing] = \varnothing, f1[S]=Yf^{-1}[S] = Y and f1[{b}]f^{-1}[\{b\}] are all open in YY, and the first two always are; so ff is continuous exactly when f1[{b}]TYf^{-1}[\{b\}] \in \mathcal{T}_Y.

step 1.4L2
3.1

Steps 1.2 and 2.1 give claim 2; in particular {p}=X\overline{\{p\}} = X makes {p}\{p\} dense by [L1], and it is contained in every dense set, since a set AA with pAp \notin A has A=AX\overline{A} = A \ne X whenever pAp \notin A. Also int(X{p})=\operatorname{int}(X \setminus \{p\}) = \varnothing by step 1.2.

step 1.2step 2.1L1
3.2

By step 1.4 and step 2.1 applied to SS: {b}=S\overline{\{b\}} = S since bb is the particular point, and {a}={a}\overline{\{a\}} = \{a\} since b{a}b \notin \{a\}; this is claim 4.

step 2.1step 1.4
3.3

The assignment ff1[{b}]f \mapsto f^{-1}[\{b\}] of step 2.2 is injective, since ff is determined by f1[{b}]f^{-1}[\{b\}] — its value is bb there and aa elsewhere — and surjective onto TY\mathcal{T}_Y, since for UTYU \in \mathcal{T}_Y the function taking the value bb on UU and aa off UU is continuous by step 2.2 and has f1[{b}]=Uf^{-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 YY is recovered as the set of continuous maps YSY \to S.

  • When XX 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 pp, then {p}\{p\} is open and contains pp but not the other; and if neither is pp, then {x,p}\{x,p\} is open and contains xx but not yy. It is not Hausdorff: every two nonempty open sets meet at pp, and {p}\{p\} is dense by claim 2. When X={p}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}}\{\{x,p\}\} is a one-element neighbourhood base at xx: any neighbourhood of xx contains an open set containing xx, which contains pp as well.

  • A comparison with the cofinite topology. When XX 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 XX has at least two points, its particular point pp 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\mathbb{R}

Example

Let (L,)(L, \le) be a totally ordered set (Partial order and partially ordered set) with at least two elements. For aLa \in L write

L<a:={tL:t<a},L>a:={tL:a<t}L_{<a} := \{\, t \in L : t < a \,\}, \qquad L_{>a} := \{\, t \in L : a < t \,\}

for the open rays, and let SL\mathcal{S}_L be the family of all open rays. The order topology on LL is Tord:=SL\mathcal{T}_{\mathrm{ord}} := \langle \mathcal{S}_L \rangle, the topology generated by SL\mathcal{S}_L (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\mathcal{T}_{\mathrm{ord}}, and every such intersection is LL itself (the empty intersection), an open ray, or an open interval (a,b):=L>aL<b(a,b) := L_{>a} \cap L_{<b}. So BL:={L}SL{(a,b):a,bL}\mathcal{B}_L := \{L\} \cup \mathcal{S}_L \cup \{\, (a,b) : a, b \in L \,\} is a basis for the order topology.
  2. On R\mathbb{R} the order topology is the usual topology. Taking L=RL = \mathbb{R} with its order (Order on the reals, Ordered field), Tord=TdR\mathcal{T}_{\mathrm{ord}} = \mathcal{T}_{d_{\mathbb{R}}}, the metric topology of dR(x,y)=xyd_{\mathbb{R}}(x,y) = |x-y| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(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\mathbb{R}: the nine order-convex forms, nondegeneracy, and length.

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

Facts & Assumptions

Given: A totally ordered set (L,)(L,\le) with at least two elements, the family SL\mathcal{S}_L of its open rays, and R\mathbb{R} with its order and its usual metric dR(x,y)=xyd_{\mathbb{R}}(x,y) = |x-y|.

[A1]

\le is reflexive, antisymmetric, transitive and total, and s<ts < t abbreviates sts \le t with sts \ne t (Partial order and partially ordered set); on R\mathbb{R} this is the order of Order on the reals and Ordered field.

[L1]

S\langle \mathcal{S} \rangle is the coarsest topology containing S\mathcal{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).

[L2]

The finite intersections of S\mathcal{S}, the empty intersection being the whole set, form a basis for S\langle \mathcal{S} \rangle (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, claim 2).

Verification

technique · direct
1.1

An intersection of finitely many open rays is LL when there are none; when there are some, group them into the lower rays L<b1,,L<bmL_{<b_1}, \dots, L_{<b_m} and the upper rays L>a1,,L>anL_{>a_1}, \dots, L_{>a_n}. Since \le is total, a nonempty finite set of elements of LL has a least and a greatest member, so the intersection of the lower rays is L<bL_{<b} with bb least among the bib_i, and that of the upper rays is L>aL_{>a} with aa greatest among the aja_j; the whole intersection is therefore LL, a single ray, or L>aL<b=(a,b)L_{>a} \cap L_{<b} = (a,b).

A1L2
1.2

In R\mathbb{R} every open ray is open in the usual topology: if x<bx < b then r:=bx>0r := b - x > 0 and (xr, x+r)(,b)(x - r,\ x + r) \subseteq (-\infty, b), since t<x+r=bt < x + r = b; symmetrically, if a<xa < x then r:=xa>0r := x - a > 0 and (xr, x+r)(a,)(x-r,\ x+r) \subseteq (a, \infty).

A1L3
1.3

In R\mathbb{R} every ball is an intersection of two open rays: (xr, x+r)=R>xrR<x+r(x-r,\ x+r) = \mathbb{R}_{>x-r} \cap \mathbb{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\mathcal{B}_L of claim 1 is a basis for Tord\mathcal{T}_{\mathrm{ord}}, 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\mathbb{R} contains SR\mathcal{S}_{\mathbb{R}}, so it contains Tord=SR\mathcal{T}_{\mathrm{ord}} = \langle \mathcal{S}_{\mathbb{R}} \rangle, the latter being the coarsest such topology.

step 1.2L1
3.1

Conversely, let UU be open in the usual topology of R\mathbb{R}; for each xUx \in U there is r>0r > 0 with (xr,x+r)U(x-r, x+r) \subseteq U, and (xr,x+r)(x-r,x+r) is an intersection of two open rays by step 1.3, hence a member of BR\mathcal{B}_{\mathbb{R}} and so open in Tord\mathcal{T}_{\mathrm{ord}}; therefore UU is a union of members of Tord\mathcal{T}_{\mathrm{ord}} and so lies in Tord\mathcal{T}_{\mathrm{ord}}.

step 1.3step 2.1L1L3L4
4.1

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

step 2.1step 2.2step 3.1

Remarks

  • All three descriptions of R\mathbb{R}'s topology name one collection of open sets. Claim 2 identifies the order topology with the metric topology of dRd_{\mathbb{R}}, and Which results on this page use the order of R\mathbb{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 LL 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\mathbb{R} and is proved from the specific fact that the balls of dRd_{\mathbb{R}} 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\mathbb{R} (The Sorgenfrey line: R\mathbb{R} with the half-open intervals [a,b)[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)[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\mathbb{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\mathbb{R} with the half-open intervals [a,b)[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,bR, a<b}\mathcal{B} := \{\, [a,b) : a, b \in \mathbb{R},\ a < b \,\} be the family of bounded half-open intervals of R\mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Then:

  1. B\mathcal{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\mathcal{T}_{\mathrm{S}} on R\mathbb{R}. The space (R,TS)(\mathbb{R}, \mathcal{T}_{\mathrm{S}}) is the Sorgenfrey line, also called the lower limit topology.
  2. TS\mathcal{T}_{\mathrm{S}} 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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded): every set open in the usual topology is in TS\mathcal{T}_{\mathrm{S}}, and [0,1)[0,1) is in TS\mathcal{T}_{\mathrm{S}} 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 xRx \in \mathbb{R} the family {[x, x+1/(k+1)):kN}\{\, [x,\ x + 1/(k+1)) : k \in \mathbb{N} \,\} is an at most countable neighbourhood base at xx.
  4. It has an at most countable dense subset, namely the rationals: Q\mathbb{Q} is dense in (R,TS)(\mathbb{R}, \mathcal{T}_{\mathrm{S}}) (Dense, nowhere dense and codense subsets of a topological space, and the criterion by basic open sets) and is at most countable (Q\mathbb{Q} is countably infinite, Finite, countably infinite, countable, uncountable).
  5. Sequences converge only from the right. For a sequence (xk)(x_k) in R\mathbb{R} and xRx \in \mathbb{R}, xkxx_k \to x in TS\mathcal{T}_{\mathrm{S}} (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\varepsilon > 0 there is KNK \in \mathbb{N} with xxk<x+εx \le x_k < x + \varepsilon for all kKk \ge K. In particular the sequence yk:=x1/(k+1)y_k := x - 1/(k+1) converges to xx in the usual topology and does not converge to xx in TS\mathcal{T}_{\mathrm{S}}.

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\mathbb{R} with its order and its usual metric dR(x,y)=xyd_{\mathbb{R}}(x,y) = |x-y|, the family B\mathcal{B} above, points x,a,b,c,dRx, a, b, c, d \in \mathbb{R} and a sequence (xk)(x_k) in R\mathbb{R}. Here 1/(k+1)1/(k+1) abbreviates the inverse of the canonical natural (k+1)1R(k+1) \cdot 1_{\mathbb{R}}.

[A1]

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

[L1]

A family is a basis for a topology on R\mathbb{R} exactly when it covers R\mathbb{R} and every point of an intersection of two members lies in a member inside that intersection; the topology is then {U:every xU has a member B with xBU}\{\, U : \text{every } x \in U \text{ has a member } B \text{ with } x \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).

[L3]

For every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon); for n1n \ge 1 the canonical natural is positive (Canonical naturals are positive and strictly increasing) and 0<u<v0 < u < v gives 0<1/v<1/u0 < 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<10 < 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\mathbb{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\mathbb{Q} is at most countable (Q\mathbb{Q} is countably infinite, Finite, countably infinite, countable, uncountable).

[L6]

AA 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 xx contains a basic open set containing xx, 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]

xkxx_k \to x means that for every neighbourhood NN of xx there is KK with xkNx_k \in N for all kKk \ge 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\mathbb{N} is at most countable (A nonempty set is at most countable iff it is a surjective image of N\mathbb{N}).

Verification

technique · direct
1.1

B\mathcal{B} covers R\mathbb{R}: for xRx \in \mathbb{R} one has x<x+1x < x + 1 by [L4], so [x, x+1)B[x,\ x+1) \in \mathcal{B} and x[x,x+1)x \in [x, x+1).

A1L4
1.2

Let x[a,b)[c,d)x \in [a,b) \cap [c,d) and put a:=max{a,c}a' := \max\{a,c\} and b:=min{b,d}b' := \min\{b,d\}, which exist by [L4]. Then [a,b)[c,d)=[a,b)[a,b) \cap [c,d) = [a',b'), since ata \le t and ctc \le t together say ata' \le t and t<bt < b with t<dt < d says t<bt < b'; and ax<ba' \le x < b' gives a<ba' < b', so [a,b)B[a',b') \in \mathcal{B} and x[a,b)[a,b)[c,d)x \in [a',b') \subseteq [a,b) \cap [c,d).

A1L4
1.3

For xRx \in \mathbb{R} and real r>0r > 0: x<x+rx < x + r by [L4], and [x, x+r)(xr, x+r)[x,\ x+r) \subseteq (x-r,\ x+r), since xr<xt<x+rx - r < x \le t < x + r.

A1L2L4
1.4

For every kNk \in \mathbb{N} the real 1/(k+1)1/(k+1) is positive by [L3], so [x, x+1/(k+1))B[x,\ x + 1/(k+1)) \in \mathcal{B} by [L4] and contains xx.

A1L3L4
1.5

[0,1)B[0,1) \in \mathcal{B}, since 0<10 < 1 by [L4].

A1L4
1.6

Every nonempty member [a,b)[a,b) of B\mathcal{B} meets Q\mathbb{Q}: by [L5] there is a rational qq with a<q<ba < q < b, and then q[a,b)q \in [a,b).

A1L5
1.7

The same sequence converges to xx in the usual topology: given r>0r > 0, [L3] gives n1n \ge 1 with 1/n<r1/n < r and n=m+1n = m+1; for kmk \ge m the canonical naturals satisfy 0<(m+1)1R(k+1)1R0 < (m+1) \cdot 1_{\mathbb{R}} \le (k+1) \cdot 1_{\mathbb{R}}, so 1/(k+1)1/(m+1)<r1/(k+1) \le 1/(m+1) < r by [L3], and ykx=1/(k+1)<r|y_k - x| = 1/(k+1) < r, that is ykB(x,r)y_k \in B(x,r).

L2L3L4
2.1

By steps 1.1 and 1.2 the family B\mathcal{B} satisfies the two basis conditions of [L1], so it is a basis for the topology TS\mathcal{T}_{\mathrm{S}} described there; this is claim 1.

step 1.1step 1.2L1
2.2

[0,1)[0,1) is not open in the usual topology: for any r>0r > 0, [L3] gives a natural n1n \ge 1 with 1/n<r1/n < r, and 1/n-1/n satisfies r<1/n<0-r < -1/n < 0, so 1/n(r,r)-1/n \in (-r, r) while 1/n[0,1)-1/n \notin [0,1); hence no ball around 00 lies inside [0,1)[0,1).

step 1.5L2L3L4
2.3

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

step 1.4L7
2.4

By step 1.6 the set Q\mathbb{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 UU open in the usual topology lies in TS\mathcal{T}_{\mathrm{S}}: for xUx \in U take r>0r > 0 with (xr,x+r)U(x-r,x+r) \subseteq U, and then x[x, x+r)Ux \in [x,\ x+r) \subseteq U by step 1.3, with [x,x+r)B[x,x+r) \in \mathcal{B}.

step 1.3step 2.1L1L2
3.2

Let NN be a neighbourhood of xx in TS\mathcal{T}_{\mathrm{S}} and take [a,b)B[a,b) \in \mathcal{B} with x[a,b)Nx \in [a,b) \subseteq N, so ax<ba \le x < b and bx>0b - x > 0; by [L3] fix a natural n1n \ge 1 with 1/n<bx1/n < b - x and write n=m+1n = m+1 with mNm \in \mathbb{N}. Then x+1/(m+1)<bx + 1/(m+1) < b, so [x, x+1/(m+1))[x,b)[a,b)N[x,\ x+1/(m+1)) \subseteq [x, b) \subseteq [a,b) \subseteq N.

step 2.1A1L3L4L6
3.3

For every real ε>0\varepsilon > 0 the set [x, x+ε)[x,\ x+\varepsilon) is a member of B\mathcal{B} containing xx, hence a neighbourhood of xx in TS\mathcal{T}_{\mathrm{S}}.

step 2.1A1L4L6
4.1

By steps 3.1 and 2.2 the topology TS\mathcal{T}_{\mathrm{S}} contains the usual topology and contains [0,1)[0,1), which the usual topology does not; so TS\mathcal{T}_{\mathrm{S}} 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 xx, is at most countable, and has a member inside every neighbourhood of xx; so it is an at most countable neighbourhood base at xx, and xx was arbitrary. This is claim 3.

step 1.4step 3.2step 2.3L6
4.3

If xkxx_k \to x in TS\mathcal{T}_{\mathrm{S}} and ε>0\varepsilon > 0, then by step 3.3 the set [x,x+ε)[x, x+\varepsilon) is a neighbourhood of xx, so there is KK with xk[x,x+ε)x_k \in [x, x+\varepsilon), that is xxk<x+εx \le x_k < x + \varepsilon, for all kKk \ge K.

step 3.3L7
4.4

Conversely, assume the ε\varepsilon condition and let NN be a neighbourhood of xx; take [a,b)B[a,b) \in \mathcal{B} with x[a,b)Nx \in [a,b) \subseteq N and apply the condition with ε:=bx>0\varepsilon := b - x > 0, obtaining KK with xxk<bx \le x_k < b for all kKk \ge K; since axxka \le x \le x_k, this gives xk[a,b)Nx_k \in [a,b) \subseteq N for all kKk \ge K. So xkxx_k \to x.

step 2.1step 3.2A1L6L7
5.1

The sequence yk=x1/(k+1)y_k = x - 1/(k+1) satisfies yk<xy_k < x for every kk, since 1/(k+1)>01/(k+1) > 0; so no term lies in [x,x+1)[x, x+1), and by step 4.3 with ε=1\varepsilon = 1 the sequence does not converge to xx in TS\mathcal{T}_{\mathrm{S}}.

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 xx always contains a whole interval to the right of xx and need contain nothing to its left. Claim 5 is the exact expression of that, and it is why [0,1)[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)[b, b+1) for b1b \ge 1 together with [a,0)[a, 0) for a<0a < 0.

  • The index shift is the usual one. The neighbourhood base uses radii 1/(k+1)1/(k+1) for kNk \in \mathbb{N} rather than 1/k1/k, because N\mathbb{N} contains 00 (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)(0,1) \cup (1,2) \cup \{3\} \cup ([4,5] \cap \mathbb{Q}) attains fourteen

Example

Let XX be a topological space and write, for AXA \subseteq X,

k(A):=A,c(A):=XA,k(A) := \overline{A}, \qquad c(A) := X \setminus 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)\mathcal{P}(X) by composition, the empty word acting as the identity. Then:

  1. The relation. As operators on P(X)\mathcal{P}(X), cc=1,kk=k,kckckck=kck.c c = 1, \qquad k k = k, \qquad k c k c k c k = k c k .
  2. At most fourteen. For every AXA \subseteq X the family of sets obtainable from AA by applying words in kk and cc has at most fourteen members, namely the images of AA under the fourteen words 1, c, k, kc, ck, ckc, kck, kckc, ckck, ckckc, kckck, kckckc, ckckck, ckckckc.1,\ c,\ k,\ kc,\ ck,\ ckc,\ kck,\ kckc,\ ckck,\ ckckc,\ kckck,\ kckckc,\ ckckck,\ ckckckc .
  3. Fourteen is attained. In R\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded) the set A:=(0,1)(1,2){3}([4,5]Q)A := (0,1) \cup (1,2) \cup \{3\} \cup \big([4,5] \cap \mathbb{Q}\big) produces fourteen pairwise distinct sets. Seven of them are A,kA=[0,2]{3}[4,5],kckA=(,0][2,4][5,),A,\quad kA = [0,2] \cup \{3\} \cup [4,5],\quad kckA = (-\infty,0] \cup [2,4] \cup [5,\infty), kckckA=[0,2][4,5],kcA=(,0]{1}[2,),kckcA=[0,2],kckckcA=(,0][2,),kckckA = [0,2] \cup [4,5],\quad kcA = (-\infty,0] \cup \{1\} \cup [2,\infty),\quad kckcA = [0,2],\quad kckckcA = (-\infty,0] \cup [2,\infty), and the other seven are their complements.

Facts & Assumptions

Given: A topological space XX and a subset AXA \subseteq X; and, for claim 3, R\mathbb{R} with its usual topology and the set AA displayed above. Write i:=ckci := ckc, so that i(A)=int(A)i(A) = \operatorname{int}(A) by Interior, closure, boundary, exterior, derived set and isolated point in a topological space.

[A1]

A\overline{A} is the smallest closed superset of AA; AAA \subseteq \overline{A}; A\overline{A} is closed and a set is closed exactly when it equals its closure; Xint(A)=XAX \setminus \operatorname{int}(A) = \overline{X \setminus A}, so i=ckci = 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 AA iff every basic neighbourhood of it meets AA; the closure is the smallest closed superset and equals AA together with its derived set).

[A2]

kk and ii are monotone, and AB=AB\overline{A \cup B} = \overline{A} \cup \overline{B} for two sets, hence for finitely many by iteration (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, claims 1 and 2).

[A3]

Closure satisfies the Kuratowski axioms k=k\varnothing = \varnothing, AkAA \subseteq kA, kk=kkk = k and k(AB)=kAkBk(A \cup B) = kA \cup kB (Kuratowski: operators satisfying c()=c(\varnothing) = \varnothing, Ac(A)A \subseteq c(A), c(c(A))=c(A)c(c(A)) = c(A) and c(AB)=c(A)c(B)c(A \cup B) = c(A) \cup c(B) correspond bijectively to topologies, claim 1); and cc=1cc = 1 because complementation is an involution (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L2]

Strictly between any two reals lies a rational (The rationals embed densely in the reals); Q\mathbb{Q} is at most countable (Q\mathbb{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\mathbb{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=1cc = 1 and kk=kkk = k hold by [A3].

A3
1.2

For an open BXB \subseteq X: BkBB \subseteq kB by [A3], and B=iBB = iB because BB is open, so monotonicity of ii gives B=iBikBB = iB \subseteq ikB and monotonicity of kk gives kBkikBkB \subseteq kikB; conversely ikBkBikB \subseteq kB gives kikBkkB=kBkikB \subseteq kkB = kB. Hence kikB=kBkikB = kB for every open BB.

A1A2A3
1.3

In R\mathbb{R}, for a<ba < b the interval (a,b)(a,b) is open: for x(a,b)x \in (a,b) put r:=min{xa, bx}>0r := \min\{x - a,\ b - x\} > 0 by [L3]; then (xr,x+r)(a,b)(x-r, x+r) \subseteq (a,b). The rays (,b)(-\infty,b) and (a,)(a,\infty) are open by the same computation with one of the two bounds omitted.

L1L3
1.4

In R\mathbb{R}, for a<ba < b and any x[a,b]x \in [a,b] and any r>0r > 0, the interval J:=(max{a, xr}, min{b, x+r})J := (\max\{a,\ x-r\},\ \min\{b,\ x+r\}) is nonempty: its left endpoint is below its right endpoint because a<ba < b, ax<x+ra \le x < x + r and xr<xbx - r < x \le b and xr<x+rx - r < x + r. Every point of JJ lies in [a,b](xr,x+r)[a,b] \cap (x-r, x+r).

L1L3
1.5

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

L1L2
2.1

In R\mathbb{R}, for aba \le b the interval [a,b][a,b] is closed, its complement being (,a)(b,)(-\infty,a) \cup (b,\infty), a union of two open sets; likewise (,b](-\infty,b] and [a,)[a,\infty) are closed, and a singleton {t}\{t\} is closed, its complement being (,t)(t,)(-\infty,t) \cup (t,\infty).

step 1.3A1L1
2.2

By step 1.4 and [L2] the set JJ contains a rational, and being a nonempty open interval it is uncountable by [L2] while Q\mathbb{Q} is at most countable, so JJ also contains a point outside Q\mathbb{Q}. Hence for every x[a,b]x \in [a,b] and every r>0r > 0 the ball (xr,x+r)(x-r,x+r) meets both [a,b]Q[a,b] \cap \mathbb{Q} and [a,b]Q[a,b] \setminus \mathbb{Q}.

step 1.4L2
2.3

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

step 1.1step 1.2A1
3.1

Consequently [a,b]Q=[a,b]=[a,b]Q\overline{[a,b] \cap \mathbb{Q}} = [a,b] = \overline{[a,b] \setminus \mathbb{Q}} for a<ba < b: each closure is contained in [a,b][a,b], which is closed by step 2.1, and contains [a,b][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]\overline{(a,b)} = [a,b] for a<ba < b: the inclusion \subseteq holds because [a,b][a,b] is closed and contains (a,b)(a,b), and \supseteq because for x[a,b]x \in [a,b] and r>0r > 0 the nonempty interval JJ of step 1.4 meets (a,b)(a,b), being contained in (a,b)(a,b) except possibly for its endpoints, which it excludes. The same argument gives (a,)=[a,)\overline{(a,\infty)} = [a,\infty) and (,b)=(,b]\overline{(-\infty,b)} = (-\infty,b].

step 2.1step 1.4A1L1
3.3

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

step 1.1step 2.3
4.1

In R\mathbb{R} with A=(0,1)(1,2){3}([4,5]Q)A = (0,1) \cup (1,2) \cup \{3\} \cup ([4,5] \cap \mathbb{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][0,1], [1,2][1,2], {3}\{3\} and [4,5][4,5]; hence kA=[0,2]{3}[4,5]kA = [0,2] \cup \{3\} \cup [4,5].

step 2.1step 3.1step 3.2A2
4.2

cA=(,0]{1}[2,3)(3,4)([4,5]Q)(5,)cA = (-\infty,0] \cup \{1\} \cup [2,3) \cup (3,4) \cup ([4,5] \setminus \mathbb{Q}) \cup (5,\infty). Here [2,3)=[2,3]\overline{[2,3)} = [2,3], because [2,3][2,3] is closed and contains [2,3)[2,3) while monotonicity gives [2,3]=(2,3)[2,3)[2,3] = \overline{(2,3)} \subseteq \overline{[2,3)}; the other five closures are (,0](-\infty,0], {1}\{1\}, [3,4][3,4], [4,5][4,5] and [5,)[5,\infty) 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,)(-\infty,0] \cup \{1\} \cup [2,3] \cup [3,4] \cup [4,5] \cup [5,\infty) = (-\infty,0] \cup \{1\} \cup [2,\infty), that is kcA=(,0]{1}[2,)kcA = (-\infty,0] \cup \{1\} \cup [2,\infty).

step 2.1step 3.1step 3.2A2
5.1

ckA=(,0)(2,3)(3,4)(5,)ckA = (-\infty,0) \cup (2,3) \cup (3,4) \cup (5,\infty), and its closure is (,0][2,4][5,)(-\infty,0] \cup [2,4] \cup [5,\infty) by [A2] and steps 3.2 and 2.1; so kckA=(,0][2,4][5,)kckA = (-\infty,0] \cup [2,4] \cup [5,\infty).

step 2.1step 3.2step 4.1A2
5.2

ckcA=(0,1)(1,2)ckcA = (0,1) \cup (1,2), whose closure is [0,2][0,2] by [A2] and step 3.2; so kckcA=[0,2]kckcA = [0,2]. Then ckckcA=(,0)(2,)ckckcA = (-\infty,0) \cup (2,\infty), whose closure is (,0][2,)(-\infty,0] \cup [2,\infty) by [A2] and step 3.2; so kckckcA=(,0][2,)kckckcA = (-\infty,0] \cup [2,\infty).

step 3.2step 4.2A2
6.1

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

step 3.2step 5.1A2
7.1

The seven sets AA, kAkA, kckAkckA, kckckAkckckA, kcAkcA, kckcAkckcA, kckckcAkckckcA have the following membership pattern at the five test points 00, 11, 33, 9/29/2, 66, writing 11 for "belongs" and 00 for "does not": AA gives (0,0,1,1,0)(0,0,1,1,0), since 9/29/2 is a rational in [4,5][4,5]; kAkA gives (1,1,1,1,0)(1,1,1,1,0); kckAkckA gives (1,0,1,0,1)(1,0,1,0,1); kckckAkckckA gives (1,1,0,1,0)(1,1,0,1,0); kcAkcA gives (1,1,1,1,1)(1,1,1,1,1); kckcAkckcA gives (1,1,0,0,0)(1,1,0,0,0); kckckcAkckckcA gives (1,0,1,1,1)(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 cc — so their patterns are the bitwise complements (1,1,0,0,1)(1,1,0,0,1), (0,0,0,0,1)(0,0,0,0,1), (0,1,0,1,0)(0,1,0,1,0), (0,0,1,0,1)(0,0,1,0,1), (0,0,0,0,0)(0,0,0,0,0), (0,0,1,1,1)(0,0,1,1,1), (0,1,0,0,0)(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

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\mathbb{R} the sequential closure of [0,1][0,1] is [0,1][0,1] while its closure is all of R\mathbb{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\operatorname{seqcl}(A) \subseteq \overline{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\mathbb{R} the cocountable topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, In the cocountable topology on R\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant) and take A:=[0,1]A := [0,1] (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length). Then seqcl(A)=[0,1]R=A.\operatorname{seqcl}(A) = [0,1] \subsetneq \mathbb{R} = \overline{A} .

Facts & Assumptions

Given: R\mathbb{R} with the cocountable topology, and the set A=[0,1]={tR:0t1}A = [0,1] = \{\, t \in \mathbb{R} : 0 \le t \le 1 \,\}.

[A1]

seqcl(A)\operatorname{seqcl}(A) is the set of points to which some sequence with all terms in AA 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\mathbb{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\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant, claim 3).

[L2]

In the cocountable topology on R\mathbb{R} the closure of an uncountable set is R\mathbb{R} (In the cocountable topology on R\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant, claim 2).

Counterexample

technique · direct
1.1

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

L3
1.2

Let (xk)(x_k) be a sequence with xk[0,1]x_k \in [0,1] for every kk and suppose xkpx_k \to p in the cocountable topology. By [L1] the sequence is eventually constant with value pp, so p=xKp = x_K for some index KK, and xK[0,1]x_K \in [0,1]; hence p[0,1]p \in [0,1].

A1L1
1.3

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

A1L1
2.1

By steps 1.2 and 1.3, seqcl([0,1])=[0,1]\operatorname{seqcl}([0,1]) = [0,1].

step 1.2step 1.3
2.2

By step 1.1 the set [0,1][0,1] is uncountable, so [0,1]=R\overline{[0,1]} = \mathbb{R} by [L2].

step 1.1L2
3.1

The inclusion [0,1]R[0,1] \subseteq \mathbb{R} is strict, since 2[0,1]2 \notin [0,1]; so by steps 2.1 and 2.2 the sequential closure of [0,1][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\mathbb{R} to the usual topology is sequentially continuous and not continuous

Statement refuted

Refuted: that a sequentially continuous map of topological spaces is continuous (FALSE: a sequentially continuous map between topological spaces is continuous).

Witness. Let Tcoc\mathcal{T}_{\mathrm{coc}} be the cocountable topology on R\mathbb{R} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, In the cocountable topology on R\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant) and TR\mathcal{T}_{\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded). The identity id:(R,Tcoc)(R,TR)\mathrm{id} : (\mathbb{R}, \mathcal{T}_{\mathrm{coc}}) \longrightarrow (\mathbb{R}, \mathcal{T}_{\mathbb{R}}) is sequentially continuous (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure) and is not continuous (Continuity of a map of topological spaces at a point and globally).

This is the witness inlined in the refutation of FALSE: a sequentially continuous map between topological spaces is continuous, recorded here with the convergent sequences of the source identified once and for all in In the cocountable topology on R\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant rather than re-derived.

Facts & Assumptions

Given: R\mathbb{R} carrying Tcoc\mathcal{T}_{\mathrm{coc}} as source and TR\mathcal{T}_{\mathbb{R}} as target, and the identity function between them.

[A1]

The open sets of Tcoc\mathcal{T}_{\mathrm{coc}} are \varnothing together with the sets of at most countable complement (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[L1]

In (R,Tcoc)(\mathbb{R}, \mathcal{T}_{\mathrm{coc}}) a sequence converges if and only if it is eventually constant, and then to its eventual value (In the cocountable topology on R\mathbb{R} the closed sets are the countable sets and R\mathbb{R}, and a sequence converges iff it is eventually constant, claim 3).

[L4]

For a<ba < b the interval (a,b)(a,b) is uncountable (Every nondegenerate interval of R\mathbb{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)V := B(0,1) = (-1,1) is open in the usual topology, the radius 11 being positive by [L5].

L2L5
1.2

1<1+11 < 1+1 by [L5], so (1, 1+1)(1,\ 1+1) is uncountable by [L4], and it is contained in R(1,1)\mathbb{R} \setminus (-1,1), a point x>1x > 1 satisfying neither x<1x < 1 nor 1<x<1-1 < x < 1.

L4L5
1.3

Let (xk)(x_k) be a sequence converging to pp in (R,Tcoc)(\mathbb{R}, \mathcal{T}_{\mathrm{coc}}); by [L1] it is eventually constant with value pp, say xk=px_k = p for all kKk \ge K.

L1
2.1

R(1,1)\mathbb{R} \setminus (-1,1) is not at most countable, since otherwise its subset (1, 1+1)(1,\ 1+1) would be at most countable by [L4], contradicting step 1.2. Hence V=(1,1)V = (-1,1) is nonempty and has a complement that is not at most countable, so VTcocV \notin \mathcal{T}_{\mathrm{coc}}.

step 1.2A1L4
2.2

The image sequence id(xk)=xk\mathrm{id}(x_k) = x_k of step 1.3 is eventually equal to pp, so for every neighbourhood NN of pp in the usual topology one has pNp \in N and hence xkNx_k \in N for all kKk \ge K; that is id(xk)id(p)\mathrm{id}(x_k) \to \mathrm{id}(p) in the usual topology. As (xk)(x_k) and pp were arbitrary, id\mathrm{id} is sequentially continuous.

step 1.3L3
3.1

id1[V]=V\mathrm{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\mathrm{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 limkxk\lim_k x_k denotes at that generality (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

Witnesses.

  1. Let XX carry the indiscrete topology and have at least two points (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Then every sequence in XX converges to every point of XX.
  2. Let XX be infinite with the cofinite topology and let (xk)(x_k) be an injective sequence in XX (Injection, surjection, bijection). Then (xk)(x_k) converges to every point of XX.
  3. Claim 2 is instantiated without any choice principle by X:=NX := \mathbb{N} with the cofinite topology and the sequence xk:=kx_k := k, which is injective outright and whose index set is infinite (The natural numbers N\mathbb{N} (von Neumann), The pigeonhole principle on N\mathbb{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\mathbb{N} rather than extracting one from an arbitrary infinite set.

Facts & Assumptions

Given: A set XX with at least two points carrying the indiscrete topology; an infinite set XX carrying the cofinite topology, a point pXp \in X and an injective sequence (xk)(x_k) in XX; and N\mathbb{N} with the cofinite topology and the sequence xk=kx_k = k.

[A1]

xkpx_k \to p means that for every neighbourhood NN of pp there is KNK \in \mathbb{N} with xkNx_k \in N for all kKk \ge K; a neighbourhood of pp contains an open set containing pp (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 \varnothing and XX; in the cofinite topology the open sets are \varnothing 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); \approx is symmetric and transitive, and an injection restricts to a bijection onto its image (Equinumerous sets, ABA \approx B and ABA \preceq B, Injection, surjection, bijection).

[L3]

A subset of N\mathbb{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\mathbb{N} \not\approx n for every natural nn (The pigeonhole principle on N\mathbb{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 XX 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 XX be infinite with the cofinite topology, let pXp \in X, let (xk)(x_k) be injective, and let NN be a neighbourhood of pp; fix an open UU with pUNp \in U \subseteq N, so UU \ne \varnothing and F:=XUF := X \setminus U is finite.

A1A2choose
1.3

The index set S:={kN:xkF}S := \{\, k \in \mathbb{N} : x_k \in F \,\} is finite: the injectivity of (xk)(x_k) makes kxkk \mapsto x_k a bijection of SS onto its image, which is a subset of the finite set FF and hence finite, so SS is finite as well.

givenL2
2.1

A finite subset of N\mathbb{N} is bounded above: if it were not, it would be countably infinite by [L3], and no finite set is countably infinite. So SS is bounded above, say by KNK \in \mathbb{N}.

step 1.3L3
3.1

For every kk with k>Kk > K one has kSk \notin S, that is xkFx_k \notin F, that is xkUNx_k \in U \subseteq N; so (xk)(x_k) is eventually in NN. As NN was an arbitrary neighbourhood of pp, xkpx_k \to p, and as pp was arbitrary this proves claim 2.

step 1.2step 2.1A1
4.1

Claim 3: N\mathbb{N} is infinite by [L4], the sequence xk=kx_k = k is injective, being the identity function of N\mathbb{N}, and N\mathbb{N} has at least two points; so claim 2 applies and (k)kN(k)_{k \in \mathbb{N}} converges in the cofinite topology on N\mathbb{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 limkxk\lim_k x_k 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. Extracting an injective sequence from an arbitrary infinite set is exactly the statement "every infinite set has a countably infinite subset", which is not provable in ZF (FALSE: every infinite set has a countably infinite subset, in ZF). Claim 3 avoids the issue by naming N\mathbb{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\mathbb{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)\mathcal{P}(\mathbb{R}) be the discrete topology on R\mathbb{R} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) and TR\mathcal{T}_{\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded). The identity id:(R,P(R))(R,TR)\mathrm{id} : (\mathbb{R}, \mathcal{P}(\mathbb{R})) \longrightarrow (\mathbb{R}, \mathcal{T}_{\mathbb{R}}) 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\mathbb{R} that both arise in practice.

Facts & Assumptions

Given: R\mathbb{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\mathbb{R} is P(R)\mathcal{P}(\mathbb{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\mathrm{id} is a bijection of R\mathbb{R} onto R\mathbb{R}, being the identity function of the set R\mathbb{R}.

given
1.2

id\mathrm{id} is continuous: for any open VV of the target the preimage id1[V]=V\mathrm{id}^{-1}[V] = V is a subset of R\mathbb{R} and hence open in the discrete topology.

A1L1
1.3

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

A1
1.4

{0}\{0\} is not open in the usual topology: for any r>0r > 0 the ball (r,r)(-r,r) contains the point 1/n1/n for a natural n1n \ge 1 with 1/n<r1/n < r supplied by [L4], and 1/n>01/n > 0, so 1/n(r,r)1/n \in (-r,r) and 1/n01/n \ne 0; hence no ball around 00 lies inside {0}\{0\}.

L3L4
2.1

By steps 1.3 and 1.4 the image id[{0}]={0}\mathrm{id}[\{0\}] = \{0\} of an open set is not open, so id\mathrm{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\mathbb{R} covered by its closed singletons: every restriction of the indicator of {0}\{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\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded) and let

F:={{t}:tR}\mathcal{F} := \{\, \{t\} : t \in \mathbb{R} \,\}

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

Facts & Assumptions

Given: R\mathbb{R} with its usual topology, the cover F\mathcal{F} by singletons, and the function ff above.

[A2]

The subspace topology on SRS \subseteq \mathbb{R} has as open sets the traces USU \cap S with UU open in R\mathbb{R} (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); a topology on SS always contains \varnothing and SS (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[L3]

0<10 < 1 and hence 1<1+11 < 1+1 (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities); consequently 1(0, 1+1)1 \in (0,\ 1+1) and 0(0, 1+1)0 \notin (0,\ 1+1).

Counterexample

technique · direct
1.1

F\mathcal{F} covers R\mathbb{R}, each tRt \in \mathbb{R} lying in {t}\{t\}, and each member is closed by [L4].

givenL4
1.2

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

A2A1
1.3

V:=B(1,1)=(0, 1+1)V := B(1,1) = (0,\ 1+1) is a ball, hence open in R\mathbb{R} by [L1], and f1[V]={0}f^{-1}[V] = \{0\}: indeed f(0)=1Vf(0) = 1 \in V by [L3], while f(t)=0Vf(t) = 0 \notin V for t0t \ne 0, again by [L3].

L1L3
1.4

{0}\{0\} is not open in the usual topology: for any r>0r > 0 the ball (r,r)(-r,r) contains the point 1/n1/n for a natural n1n \ge 1 with 1/n<r1/n < r given by [L2], and 1/n>01/n > 0, so 1/n(r,r){0}1/n \in (-r,r) \setminus \{0\}; hence no ball around 00 lies inside {0}\{0\}.

L1L2
2.1

By step 1.3 and step 1.4 the preimage under ff of the open set VV is not open, so ff is not continuous by [A1]; by steps 1.1 and 1.2 the family F\mathcal{F} is a closed cover of R\mathbb{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 f1[F]f^{-1}[F] as a union of sets closed in R\mathbb{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 f1[RV]f^{-1}[\mathbb{R} \setminus V] is the union of the uncountably many closed sets {t}\{t\}, t0t \ne 0, which is R{0}\mathbb{R} \setminus \{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 XX and YY and any f:XYf : X \to Y, the restriction of ff 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 ff could be replaced by any discontinuous function.

  • A two-piece closed cover of R\mathbb{R} would have detected the discontinuity. For instance (,0](-\infty,0] and [0,)[0,\infty) are closed and cover R\mathbb{R}, and ff restricted to (,0](-\infty,0] is already discontinuous at 00 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\mathbb{R} the interiors of Q\mathbb{Q} and of its complement are both empty while the interior of their union is everything

Statement refuted

Refuted: that int(AB)=int(A)int(B)\operatorname{int}(A \cup B) = \operatorname{int}(A) \cup \operatorname{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(AB)\operatorname{int}(A) \cup \operatorname{int}(B) \subseteq \operatorname{int}(A \cup B), and the gap can be the whole space.

Witness. In R\mathbb{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\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded) take A:=QA := \mathbb{Q}, the image of the rationals in R\mathbb{R}, and B:=RQB := \mathbb{R} \setminus \mathbb{Q}. Then

int(A)=int(B)=,int(AB)=int(R)=R.\operatorname{int}(A) = \operatorname{int}(B) = \varnothing, \qquad \operatorname{int}(A \cup B) = \operatorname{int}(\mathbb{R}) = \mathbb{R} .

Facts & Assumptions

Given: R\mathbb{R} with its usual topology, the set QR\mathbb{Q} \subseteq \mathbb{R} of rationals and its complement RQ\mathbb{R} \setminus \mathbb{Q}.

[L2]

For a<ba < b the interval (a,b)(a,b) is uncountable (Every nondegenerate interval of R\mathbb{R} is uncountable, Finite, countably infinite, countable, uncountable); Q\mathbb{Q} is at most countable (Q\mathbb{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).

[L4]

int(A)int(B)int(AB)\operatorname{int}(A) \cup \operatorname{int}(B) \subseteq \operatorname{int}(A \cup B) in every topological space (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, claim 3).

Counterexample

technique · direct
1.1

A nonempty open subset of R\mathbb{R} contains a ball (xr, x+r)(x-r,\ x+r) with r>0r > 0, and xr<x+rx - r < x + r, so that ball is uncountable by [L2].

L1L2
1.2

No nonempty open subset of R\mathbb{R} is contained in RQ\mathbb{R} \setminus \mathbb{Q}: such a set would contain a ball (xr, x+r)(x-r,\ x+r), and by [L3] there is a rational strictly between xrx - r and x+rx + r, which lies in that ball and not in RQ\mathbb{R} \setminus \mathbb{Q}.

L1L3
1.3

Q(RQ)=R\mathbb{Q} \cup (\mathbb{R} \setminus \mathbb{Q}) = \mathbb{R}, which is open, so int(Q(RQ))=R\operatorname{int}(\mathbb{Q} \cup (\mathbb{R} \setminus \mathbb{Q})) = \mathbb{R}.

A1
2.1

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

step 1.1L2
3.1

By step 2.1 the only open subset of Q\mathbb{Q} is \varnothing, so int(Q)=\operatorname{int}(\mathbb{Q}) = \varnothing; by step 1.2 the same holds for RQ\mathbb{R} \setminus \mathbb{Q}, so int(RQ)=\operatorname{int}(\mathbb{R} \setminus \mathbb{Q}) = \varnothing.

step 2.1step 1.2A1
4.1

By steps 3.1 and 1.3 the left side of the inclusion of [L4] is =\varnothing \cup \varnothing = \varnothing and the right side is R\mathbb{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}X = \{a,b\} with aba \ne b, carrying the indiscrete topology Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\} (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). No metric dd on XX satisfies Td=Tind\mathcal{T}_d = \mathcal{T}_{\mathrm{ind}} (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)(X,\mathcal{T}_{\mathrm{ind}}) is not metrizable.

Facts & Assumptions

Given: The set X={a,b}X = \{a,b\} with aba \ne b and the topology Tind={,X}\mathcal{T}_{\mathrm{ind}} = \{\varnothing, X\}; and a hypothetical metric dd on XX with Td=Tind\mathcal{T}_d = \mathcal{T}_{\mathrm{ind}}.

[L1]

In any metric space, distinct points pqp \ne q satisfy B(p,r)B(q,r)=B(p,r) \cap B(q,r) = \varnothing for r:=d(p,q)/2>0r := d(p,q)/2 > 0, and these two balls are open and contain pp and qq 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 dd is a metric on XX with Td=Tind\mathcal{T}_d = \mathcal{T}_{\mathrm{ind}}.

assume-hyp
1.2

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

givenL1
2.1

By the supposition of step 1.1 the sets UU and VV are open in Tind\mathcal{T}_{\mathrm{ind}}, so each is \varnothing or XX by [A1]; and aUa \in U, bVb \in V make both nonempty, so U=V=XU = V = X.

step 1.1step 1.2A1
3.1

Then UV=XU \cap V = X, which contains aa and is therefore nonempty, contradicting the disjointness of step 1.2. So no such metric exists, and (X,Tind)(X, \mathcal{T}_{\mathrm{ind}}) is not metrizable, which refutes the claim.

step 1.2step 2.1A2

Remarks

Sources