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.

8 results · all verified · 5 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full by a delegated reviewing agent on the owner's instruction; the judge is an additional, independent cross-model AI review of the proofs. The 3 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Connectedness: 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-adaptedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)Open item page →

Every convex subset of Rn, in particular every ball and Rn itself, is path-connected and hence connected

Example

Let nN with n1 and give Rn the product topology, which is the metric topology of d (For n1 the product topology on n copies of the usual topology of R is the metric topology of d on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, Rn as the set of functions nR, and d1, d2, d are metrics on it, 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). Recall that Rn is a real vector space under coordinatewise operations (Vector space over a field, A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

A subset CRn is convex when

x,yC  and  t[0,1](1t)x+tyC

(Intervals of R: the nine order-convex forms, nondegeneracy, and length). Then:

  1. Every convex CRn is path-connected (Paths, path-connected spaces and path components), hence connected (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Every path-connected space is connected, and every path component lies inside a component).
  2. Every ball is convex, in each of the norms 1, 2, (The p-norms xp for rational p1, and x, Open ball, closed ball and sphere in a metric space); so every ball of Rn is path-connected and connected.
  3. Rn itself is convex, hence path-connected and connected, and so is every half-space {x:xkc}, and every box k<nJk with each Jk an order-convex subset of R.

Facts & Assumptions

Given: Rn with n1, its product topology, and a convex subset CRn.

[A3]

A path in a subset A from x to y is a continuous γ:[0,1]A with γ(0)=x, γ(1)=y; A is path-connected when every pair of its points is joined by one (Paths, path-connected spaces and path components, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A6]

Rn is a real vector space, so it is closed under the scalar multiples and sums forming (1t)x+ty (Vector space over a field); and an order-convex JR contains every real lying between two of its elements (Intervals of R: the nine order-convex forms, nondegeneracy, and length).

Verification

technique · direct
1.1

Let x,yC and define γ:[0,1]Rn by γ(t):=(1t)x+ty, so that the k-th component is txk+t(ykxk), an affine map of R into R.

A2
1.2

Every ball is convex: for x,yB(c,r) and t[0,1], (1t)x+tyc=(1t)(xc)+t(yc)(1t)xc+tyc<(1t)r+tr=r, using [A5] and 1t0, t0.

A5
1.3

Rn is convex, since (1t)x+ty is an element of Rn for all x,y and t; a box k<nJk with each Jk order-convex is convex, since (1t)xk+tyk lies between xk and yk and hence in Jk; and a half-space {x:xkc} is convex for the same reason.

A6
2.1

γ is continuous into Rn by [A1] and step 1.1, each component being continuous by [A2]; and γ takes values in C by convexity, so it is continuous into the subspace C by [A1].

step 1.1A1A2
3.1

γ(0)=x and γ(1)=y, so γ is a path in C from x to y by [A3]. As x,yC were arbitrary, C is path-connected; and it is connected by [A4]. This is claim 1.

step 1.1step 2.1A3A4
4.1

Claims 2 and 3 follow from claim 1 together with steps 1.2 and 1.3, each of the sets listed there being convex.

step 1.2step 1.3step 3.1

Remarks

  • The path is the straight segment and nothing more is needed. Convexity is exactly the hypothesis that the segment between two points of the set stays in the set, so the definition of the path writes itself; the only work is that the segment is a continuous map, which is [A1] plus the continuity of an affine map of one real variable.

  • Convexity is far from necessary. A circle is path-connected and not convex, and so is any set obtained from a convex one by bending it. Nothing above asserts a converse.

  • The hypothesis n1 comes from d. is a maximum over n terms and is undefined at n=0 (The p-norms xp for rational p1, and x, Rn as the set of functions nR, and d1, d2, d are metrics on it). At n=0 the product is a one-point space, which is path-connected outright.

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

The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies placed in the connectedness hierarchy

Example

Let X be a set carrying one of the six topologies of The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies. The table records where each sits, with connectedness as in Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, local connectedness as in Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point and path-connectedness as in Paths, path-connected spaces and path components.

topologyconnectedlocally connectedpath-connectedcomponents
discreteonly if X has at most one pointyesonly if X has at most one pointthe singletons
indiscreteyesyesyesX
cofinite, X infiniteyesyesnot decided hereX
cocountable, X uncountableyesyesnot decided hereX
particular point pyesyesyesX
SierpinskiyesyesyesS

Sierpinski space is the particular-point topology on a two-point set (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), so its row is an instance of the row above it and is not verified separately.

The component column reads at nonempty X; the empty space is connected and has no components at all, there being no points (The components of a space are its maximal connected subsets, they partition it, and each of them is closed).

Two entries are deliberately left open. No item among this page's declared prerequisites settles whether the cofinite topology on an infinite X, or the cocountable topology on an uncountable X, is path-connected, so the table says nothing either way.

Facts & Assumptions

Given: A set X carrying one of the six standard topologies.

[A2]

The open sets are: all subsets (discrete); and X (indiscrete); and the sets of finite complement (cofinite); and the sets of at most countable complement (cocountable); and the sets containing p (particular point). A union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable).

[A3]

X is locally connected when every open U and every xU admit an open connected V with xVU; a component of X is the largest connected set through a point, and the components partition X (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point, Connected components, quasicomponents, and totally disconnected spaces, The components of a space are its maximal connected subsets, they partition it, and each of them is closed).

[A5]

A nonempty set is at most countable exactly when some surjection N it exists; there is a bijection NN×N; R is uncountable (A nonempty set is at most countable iff it is a surjective image of N, N×NN, R is uncountable (Cantor's nested intervals, 1874), Finite, countably infinite, countable, uncountable).

Verification

technique · direct
1.1

Discrete. If X has two distinct points x,y then ({x},X{x}) is a separation by [A2] and [A1], so X is disconnected; every connected subset therefore has at most one point, the subspace topology on a subset again being discrete, so the components are the singletons by [A3], and X is not path-connected, a path being in particular a connected image. Every singleton is open and connected, so X is locally connected by [A3].

A1A2A3
1.2

Indiscrete. The only open sets are and X by [A2], so no two nonempty open sets are disjoint and X is connected by [A1]; hence, for nonempty X, its only component is X by [A3], and X itself is an open connected set containing every point, so X is locally connected by [A3].

A1A2A3
1.3

Indiscrete, path-connectedness. Every function γ:[0,1]X is continuous by [A4], the preimages of and X being and [0,1]; so for x,yX the function with γ(0)=x and γ(t)=y for t>0 is a path from x to y, and X is path-connected.

A2A4
1.4

Cofinite, X infinite. Let U,V be nonempty open sets, with complements CU, CV finite by [A2]. Then X(UV)=CUCV is finite by [A2], so UV, X being infinite. Hence no separation exists and X is connected by [A1].

A1A2
1.5

Cocountable, X uncountable, and X a subset of R or any uncountable set. Suppose (U,V) were a separation. By [A2] the complements of U and of V are at most countable, and those complements are V and U respectively, so both U and V are nonempty and at most countable with UV=X.

A1A2
1.6

Particular point p. Every nonempty open set contains p by [A2], so two nonempty open sets meet and X is connected by [A1]; its only component is X by [A3].

A1A2A3
2.1

In the situation of step 1.5, [A5] gives surjections f,g:NU and NV, and h:N×NX with h(0,k):=f(k) and h(m,k):=g(k) for m0 is onto UV=X; composing with a bijection NN×N from [A5] shows X at most countable, contrary to hypothesis. So the cocountable topology on an uncountable X is connected.

step 1.5A5
2.2

Particular point is locally connected and path-connected. Every nonempty open U contains p and carries as a subspace the particular-point topology on U with the same p, hence is connected by step 1.6, so [A3] is witnessed by U itself. For x,yX define γ(0):=x, γ(1):=y and γ(t):=p for 0<t<1; the preimage of an open V is if V=, and otherwise contains (0,1) and is one of (0,1), [0,1), (0,1], [0,1], all open in [0,1] by [A6]. So γ is continuous by [A4] and is a path from x to y.

step 1.6A2A3A4A6
3.1

Cofinite and cocountable are locally connected. A nonempty open U carries as a subspace the cofinite, respectively cocountable, topology on U by [A2] and [A1]; U is infinite, respectively uncountable, its complement being finite, respectively at most countable, while X is not. So U is connected by step 1.4, respectively step 2.1, and being open and containing each of its points it witnesses [A3].

step 1.4step 2.1A1A2A3
4.1

Sierpinski space is the particular-point topology on a two-point set with particular point its open point, by [A2], so steps 1.6 and 2.2 apply to it verbatim; and every nonempty connected space has its whole underlying set as its unique component by [A3]. This completes the table.

step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1A2A3

Remarks

  • Connectedness is cheap when there are few open sets. Four of the six topologies are connected for the same structural reason: no two nonempty open sets are disjoint. That is immediate for the indiscrete and particular-point topologies, and for the cofinite and cocountable ones it is the statement that the ambient set is not a union of two small sets.

  • Local connectedness here is never informative. In every connected case above, every nonempty open subspace is again of the same kind and hence connected, so local connectedness holds for free. A space where local connectedness carries information must have open sets that are not themselves connected, which is what happens in R2 and its subspaces.

  • Why two cells are left blank. A path in the cofinite or cocountable topology is a continuous map out of [0,1], and deciding whether a non-constant one exists needs machinery this page's declared prerequisites do not supply: for the cofinite case a comparison of X with the cardinality of R, and for the cocountable case an argument about the image of a dense countable subset. Neither is available here, so the honest entry is that the question is not settled.

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

The zigzag curve and its closure worked out: the components, the path components, and the points at which local connectedness fails

Example

Let G be the graph of the zigzag function and G=G({0}×[0,1]) its closure in R2 (The graph of the piecewise-linear map oscillating between 0 and 1 on the intervals [1/(n+2),1/(n+1)] is path-connected, its closure adds the segment {0}×[0,1], and that closure is connected, is not path-connected because no path joins the segment to the graph, and is not locally connected, claim 2). Write Σ:={0}×[0,1] for the added segment. Then, in the space G with its 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):

  1. One component. G is connected, so it has exactly one component, namely G itself, and exactly one quasicomponent, also G (Connected components, quasicomponents, and totally disconnected spaces, The components of a space are its maximal connected subsets, they partition it, and each of them is closed, Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space).
  2. Two path components, namely G and Σ (Paths, path-connected spaces and path components).
  3. G is open in G and Σ is closed in it; neither is clopen, since G is connected.
  4. Local connectedness holds at every point of G and fails at every point of Σ (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point). So the set of points at which G fails to be locally connected is exactly Σ.

Claim 2 is the sharp form of "not path-connected": the failure is not that some pair of points is unjoined but that the space splits into exactly two path classes, one of which is the whole added segment.

Facts & Assumptions

Given: G, Σ={0}×[0,1] and G=GΣ as subspaces of R2.

[L1]

G is path-connected, connected and locally connected; G=GΣ; G is connected; no path in G joins a point of Σ to a point of G; and G is not locally connected at any point of Σ (The graph of the piecewise-linear map oscillating between 0 and 1 on the intervals [1/(n+2),1/(n+1)] is path-connected, its closure adds the segment {0}×[0,1], and that closure is connected, is not path-connected because no path joins the segment to the graph, and is not locally connected, claims 1, 2, 3, 4, 5).

[A2]

The path components partition the space and each is path-connected; a path-connected subset containing x lies inside the path component of x (Paths, path-connected spaces and path components).

Verification

technique · direct
1.1

G is connected by [L1], so the largest connected subset containing any of its points is G itself; by [A1] it is therefore the unique component, and by [A1] the unique quasicomponent contains it and is contained in the space, hence equals it. This is claim 1.

L1A1
1.2

Σ={0}×[0,1] is path-connected: for (0,s),(0,u)Σ the map t(0,s+t(us)) is continuous into R2 by [A3] and takes values in Σ, since s+t(us) lies between s and u, hence in [0,1].

A3
2.1

Σ is closed in R2 by [A4], being a product of two closed subsets of R; hence Σ=ΣG is closed in G by [A4], and G=GΣ is open in G. This is claim 3, the "not clopen" half following from claim 1, a clopen proper nonempty subset being impossible in a connected space.

step 1.1A4
2.2

G and Σ are path-connected subsets of G by [L1] and step 1.2, so each lies inside a single path component by [A2]; and no path joins a point of one to a point of the other by [L1], so the two lie in different path components. Since GΣ=G, the path components are exactly G and Σ. This is claim 2.

step 1.2L1A2
3.1

Local connectedness holds at every point of G: let pG and let U be open in G with pU. Then UG is open in G by step 2.1, hence open in G by [A5], G being open; G is locally connected by [L1], so there is V open in G and connected with pVUG; and V is open in G by [A5].

step 2.1L1A5
4.1

Local connectedness fails at every point of Σ by [L1]; with step 3.1 this shows the failure set is exactly Σ, which is claim 4.

step 3.1L1A5

Remarks

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

Q as a subspace of R: every component is a single point, no point is isolated, and the space is not locally connected anywhere

Example

Let Q=QR be the copy of the rationals inside R (Both Q and RQ are dense in R, and every nonempty open subset of R is uncountable) with the subspace topology of the usual 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, The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). Then:

  1. Every component is a single point: C(q)={q} for every qQ, so Q is totally disconnected (Connected components, quasicomponents, and totally disconnected spaces).
  2. No point is isolated: {q} is not open in Q, so the topology is not discrete (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
  3. Q is not locally connected at any of its points.
  4. The components are closed and not open. They are closed by The components of a space are its maximal connected subsets, they partition it, and each of them is closed and not open by claim 2, so Q is a space in which every component fails to be clopen.

Q is countably infinite (Q is countably infinite) while its complement in R is uncountable (The irrationals are uncountable); it is the abundance of the complement, not the scarcity of Q, that drives claim 1.

Facts & Assumptions

Given: R with its usual topology and the subspace QR.

[A2]

The subspace topology is transitive, so a subset of Q carries the same topology whether taken inside Q or inside R; the open sets of Q are the traces UQ with U open in 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).

[A5]

C(q) is the largest connected subset containing q; the components partition the space and each is closed; a space is totally disconnected when every component is a singleton (Connected components, quasicomponents, and totally disconnected spaces, The components of a space are its maximal connected subsets, they partition it, and each of them is closed, Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[A6]

X is locally connected at x when every open Ux contains an open connected V with xVU (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point).

Verification

technique · direct
1.1

Let EQ be a connected subset of Q. By [A2] the space E is the same as a subspace of R, so E is a connected subset of R and hence order-convex by [A1].

A1A2
1.2

Let qQ and let W be open in Q with qW. By [A2] and [A4] there is r>0 with (qr,q+r)QW, and (q,q+r) is a nonempty open interval, hence contains a rational qq by [A3]; so W{q}.

A2A3A4
2.1

E has at most one point: if p,uE with p<u then order-convexity from step 1.1 puts every real of [p,u] into EQ, whereas (p,u) contains an irrational by [A3]. Hence every connected subset of Q is empty or a singleton, and C(q)={q} by [A5]; this is claim 1, and with [A5] it also gives claim 4's closedness half.

step 1.1A3A5
2.2

No singleton is open in Q, by step 1.2 applied with W={q}; so the topology is not discrete by [A7], which is claim 2, and the components of claim 1 are not open, which completes claim 4.

step 1.2A7
3.1

Q is not locally connected at any q: take U:=Q, which is open and contains q; a connected V with qVU is a singleton by step 2.1, hence V={q}, which is not open by step 2.2. So no open connected V exists and [A6] fails at q. This is claim 3.

step 2.1step 2.2A6

Remarks

  • Total disconnectedness and discreteness come apart here, and the two steps that separate them are step 2.1 and step 2.2. The first says the irrationals block every interval, so no connected set can span two rationals; the second says the rationals themselves are everywhere, so no rational is isolated. A space can be shredded into points without those points being separated.

  • Local connectedness fails for a structural reason, not a delicate one. In any totally disconnected space the only candidates for a connected neighbourhood are singletons, so local connectedness at x is equivalent to {x} being open. Hence a totally disconnected space is locally connected exactly when it is discrete, and step 3.1 is that observation applied to Q.

  • The same argument applies to the irrationals. Nothing in steps 1.1 and 2.1 used countability of Q; only that its complement meets every interval. The irrationals have that property too by [A3], so they are totally disconnected and not discrete as well, and they are uncountable (The irrationals are uncountable).

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

In the subspace of R2 made of the vertical unit segments over 1/(n+1) together with the two points (0,0) and (0,1), the component of (0,0) is a singleton while its quasicomponent is {(0,0),(0,1)}

Statement refuted

Refuted: that the component and the quasicomponent of a point always agree. Every quasicomponent is a closed union of components, so each component is contained in a quasicomponent, and the quasicomponents partition the space proves only the inclusion C(x)Q(x) and asserts no converse; the inclusion can be strict.

Witness. In R2 with the product topology (For n1 the product topology on n copies of the usual topology of R is the metric topology of d on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), and writing ι for the canonical natural so that 1/(n+1) means 1/ι(n+1) with nN and N containing 0 (The canonical natural ι(n)=n1F of a field), put

Sn:={1n+1}×[0,1](nN),a:=(0,0),b:=(0,1),

X  :=  {a,b}    nNSn,

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

C(a)={a}andQ(a)={a,b}

(Connected components, quasicomponents, and totally disconnected spaces), so the inclusion is strict.

Facts & Assumptions

Given: R2 with the product topology and the subspace X above, with π0,π1 the two projections.

Counterexample

technique · direct
1.1

Each Sn is a connected subset of X: it is the image of [0,1], connected by [A2], under t(1/(n+1),t), whose components are a constant map and the identity, both continuous by [A1].

A1A2
1.2

Write P:=π0[X]={0}{1/(k+1):kN} and, for kN, μk:=12(1/(k+2)+1/(k+1)), which satisfies 1/(k+2)<μk<1/(k+1) and lies in no P, being strictly between two consecutive members of P and strictly positive. No subset of P with two distinct points is order-convex: given p<q in P, if p=0 and q=1/(m+1) take k:=m, and if p=1/(n+1) and q=1/(m+1) with m<n take k:=n1, which is a natural number since n1; in both cases p1/(k+2)<μk<1/(k+1)q, so μk lies strictly between p and q and outside P.

A2A6
1.3

Each Sn is clopen in X: with δ:=12(1n+11n+2)>0, the trace on X of the open strip (1/(n+1)δ, 1/(n+1)+δ)×R is exactly Sn, so Sn is open in X; and the trace of the closed strip [1/(n+1)δ, 1/(n+1)+δ]×R is also exactly Sn, so Sn is closed in X by [A5].

A1A5
1.4

bQ(a). Let K be clopen in X with aK. Since K is open, [A1] gives ε>0 with X((ε,ε)×(ε,ε))K; by [A6] there is k1 with 1/k<ε, and putting n:=k1N the point (1/(n+1),0) lies in that trace, hence in K. The same holds for every mn, since 1/(m+1)1/(n+1)<ε.

A1A6
2.1

C(a)={a}. Let EX be connected with aE. Then π0[E] is a connected subset of R by [A1] and [A2], hence order-convex, and it lies inside π0[X]; by step 1.2 it has at most one point, so π0[E]={0} and E{a,b}. But {a} is the trace on {a,b} of the open set R×(1/2,1/2), so {a} and {b} are both open in the subspace {a,b}; a connected E containing a therefore cannot contain b, and E={a}. Hence C(a)={a} by [A3].

step 1.2A1A2A3
2.2

Q(a){a,b}: for each n the set XSn is clopen by step 1.3 and contains a, so Q(a)XSn by [A3]; intersecting over all n leaves Q(a)XnSn={a,b}.

step 1.3A3
2.3

Each such Sm is connected by step 1.1 and meets K at (1/(m+1),0), so SmK by [A4]; in particular (1/(m+1),1)K for every mn.

step 1.1step 1.4A4
3.1

Every basic open set containing b=(0,1) contains, for large enough m, the point (1/(m+1),1): such a set includes (η,η)×(1η,1+η) for some η>0, and [A6] supplies mn with 1/(m+1)<η. So bK by [A5], and K being closed in X gives bK. As K was an arbitrary clopen set containing a, this shows bQ(a).

step 2.3A5A6
4.1

With step 2.2 and aQ(a) from [A3], Q(a)={a,b}, while C(a)={a} by step 2.1. So C(a)Q(a) and the two notions differ.

step 2.1step 2.2step 3.1A3

Remarks

  • Why no clopen set can separate a from b. A clopen set containing a must, by openness, catch a point of Sn for every large n; being clopen it must then swallow each of those whole segments, by [A4]; and being closed it must contain the limit of their top endpoints, which is b. The segments act as a ladder that is invisible to connectedness — no connected set climbs it, since π0 would have to be order-convex — and unavoidable for clopen sets.

  • The two points are essential and so are the segments. Removing b makes Q(a)={a}; replacing the segments by single points makes X totally separated, because each column becomes clopen on its own and no ladder survives. This is why the witness needs sets that are connected and shrinking towards the limit, not merely a sequence of points.

  • The space has no isolated ladder rung near the limit. By step 1.3 each Sn is clopen, so X is not connected; the failure recorded here is not about X being connected but about the two ways of measuring how X falls apart giving different answers at a.

ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

The long ray is connected and locally connected, every proper initial segment is order-convex and connected, and, assuming countable choice, no at most countable subset is cofinal

Example

Let R=ω1×[0,1) be the closed long ray with its lexicographic order and its order topology (The closed long ray ω1×[0,1) under the lexicographic order, and the long line, with the order topology, The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua), and let 0R=(0,0) be its least element. For xR write [0R,x]:={yR:yx} for the initial segment up to x. Then:

  1. R is connected, and its unique component is R (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Connected components, quasicomponents, and totally disconnected spaces).
  2. Every initial segment [0R,x] is order-convex and connected, and so is every open ray and every interval of R.
  3. R is locally connected (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point).
  4. Assuming the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), no at most countable subset of R is cofinal in R, that is, every at most countable subset has a strict upper bound (Finite, countably infinite, countable, uncountable).

Claim 4 is the order-theoretic analogue, transported to R, of the statement that no at most countable subset of ω1 is cofinal in ω1 (Assuming countable choice: every at most countable subset of ω1 is bounded below ω1, so no at most countable subset of ω1 is cofinal in it, and a supremum of at most countably many at most countable ordinals is at most countable, Cofinal subset of an ordinal); here a subset DR is called cofinal when for every xR there is yD with xy.

Path-connectedness is not asserted. Whether R is path-connected is not settled by any item among this page's declared prerequisites, and nothing here claims it either way. Consequently the path components of R are not computed.

Facts & Assumptions

Given: The closed long ray R with its order topology, and a subset DR.

[A2]

R has a least element 0R and no greatest element: for (α,s)R the element (α+,0) is strictly above it, and α+ω1 (The closed long ray ω1×[0,1) under the lexicographic order, and the long line, with the order topology, Basic closure properties of ordinals, The first uncountable ordinal ω1:=(ω)).

[A3]

The order topology has as a basis the whole space, the open rays R<b and R>a, and the open intervals (a,b); each of these is order-convex, as is every set of the form [0R,x] and every interval (The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua, Basis and subbasis for a topology, and the topology generated by a family of sets, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A4]

The component of a point is the largest connected subset containing it (Connected components, quasicomponents, and totally disconnected spaces).

Verification

technique · direct
1.1

R is connected by [A1], so the largest connected subset containing any point is R itself and the unique component is R by [A4]. This is claim 1.

A1A4
1.2

Every set of the form [0R,x], every open ray and every interval of R is order-convex by [A3], hence connected by [A1]. This is claim 2.

A1A3
2.1

R is locally connected: let U be open with xU. By [A3] there is a basic set B with xBU, and every basic set is order-convex, hence connected by [A1]; B is open, being basic. So [A5] is witnessed by B, and this is claim 3.

step 1.2A1A3A5
3.1

For claim 4 let DR be at most countable. By [A1] it has an upper bound uR, and by [A2] there is vR with u<v; then yu<v for every yD, so v is a strict upper bound and D is not cofinal, no yD satisfying vy.

A1A2

Remarks

  • Local connectedness is immediate here and is not a deep property of R. Every basic open set of an order topology is order-convex, and in a linear continuum every order-convex set is connected. So any linear continuum is locally connected, and R inherits that with no reference to ω1.

  • What distinguishes R from an ordinary half-line is claim 4 alone. The first three claims hold verbatim for [0,)R, which is also a linear continuum with a least element and no greatest. In [0,) the at most countable set of canonical naturals is cofinal; in R no at most countable set is, and that is the whole content of the word long.

  • The choice cost is inherited and is not spent again here. Claim 4 uses claim 3 of The long ray is a linear continuum, hence connected; every one of its at most countable subsets is bounded above, assuming countable choice, whose own statement carries ACω; the argument above adds only the passage from an upper bound to a strict one, which needs nothing beyond R having no greatest element.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

The comb space is path-connected and fails to be locally connected at every point of the limit tooth strictly above the base, so path-connectedness does not imply local connectedness

Statement refuted

Refuted: that a path-connected space is locally connected. Neither Every path-connected space is connected, and every path component lies inside a component nor any statement on the page it belongs to asserts this, and it is false.

Witness, the comb space. Writing ι for the canonical natural so that 1/(n+1) means 1/ι(n+1) with nN and N containing 0 (The canonical natural ι(n)=n1F of a field), put

T  :=  {0}{1n+1:nN}[0,1],C  :=  ([0,1]×{0})    (T×[0,1])

as a subspace of R2 with the product topology (For n1 the product topology on n copies of the usual topology of R is the metric topology of d on Rn, and hence also of d1 and d2, so Rn as a product and Rn as a metric space are one space, 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). Then C is path-connected, hence connected, and C is not locally connected at any point (0,t) with t>0.

The base [0,1]×{0} is the spine of the comb, the sets {c}×[0,1] for cT are its teeth, and the failure occurs along the limit tooth {0}×[0,1] above the base.

Facts & Assumptions

Given: R2 with the product topology and the comb C above, with π0 the first projection.

Counterexample

technique · direct
1.1

Every point of C is joined by a path in C to the origin (0,0). For (x,0) on the base, t((1t)x,0) is continuous by [A1] and stays in the base; for (c,u) on a tooth with cT, the map t(c,(1t)u) is continuous by [A1], stays in {c}×[0,1]C and joins (c,u) to (c,0), which lies on the base.

A1A2
1.2

For t>0 and η:=t/2>0 put Ut:=C(R×(tη, t+η)), an open subset of C containing (0,t); every point of Ut has second coordinate >tη=t/2>0, so Ut contains no point of the base and π0[Ut]T.

A1
1.3

No subset of T with two distinct points is order-convex: for p<q in T there is a real strictly between them and outside T, namely the midpoint of 1/(k+2) and 1/(k+1) for a suitable k, since between consecutive members of T there is no member of T and every element of T other than 0 is some 1/(k+1).

A3A5
2.1

By step 1.1 and [A2] any two points of C are joined to each other through (0,0), so C is path-connected and hence connected.

step 1.1A2
2.2

Let t>0 and suppose V is open in C, connected, with (0,t)VUt. Then π0[V] is a connected subset of R by [A1] and [A3], hence order-convex, and π0[V]T by step 1.2; so π0[V] has at most one point by step 1.3, and containing 0 it equals {0}. Hence V{0}×[0,1].

step 1.2step 1.3A1A3
3.1

But V is open in C and contains (0,t), so by [A1] there is η>0 with C((η,η)×(tη,t+η))V; by [A5] there is k1 with 1/k<η, and with n:=k1N the point (1/(n+1),t) lies in that trace, hence in V, while its first coordinate is not 0. This contradicts step 2.2.

step 2.2A1A5A6
4.1

So no such V exists and C fails to be locally connected at (0,t) for every t>0, by [A4], while being path-connected and connected by step 2.1.

step 2.1step 3.1A4

Remarks

  • The comb and the zigzag closure fail in different ways, which is why both are on this page. The zigzag closure is connected and not path-connected; the comb is path-connected and still not locally connected. So local connectedness is not implied even by the strongest of the three global conditions, and the three properties are genuinely independent.

  • Where the hypothesis t>0 is used. At (0,0) the comb is locally connected: small neighbourhoods of the origin contain a piece of the base together with the bottoms of nearby teeth, and that set is path-connected by the argument of step 1.1. The failure needs the point to sit strictly above the base, so that the small neighbourhood Ut of step 1.2 misses the base entirely and the teeth become disconnected from one another.

  • Deleting the base is what makes it a counterexample and not a curiosity. Without the base the teeth are disjoint clopen segments and the space is disconnected; with the base they are welded at the bottom, so a path may always descend, travel and climb. Local connectedness fails precisely because that detour is not available inside a small neighbourhood high above the base.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)Open item page →

RN in the box topology is disconnected, the bounded and the unbounded sequences forming a separation, although every factor is connected and the product topology is connected

Statement refuted

Refuted: that a product of connected spaces is connected in the box topology. A product of connected spaces is connected in the product topology, and that argument is a theorem of ZF; for an infinite index set it is the assertion that the product of nonempty spaces is nonempty that uses the Axiom of Choice proves this for the product topology only, and the restriction is not a matter of convenience.

Witness. Let RN:=nNR, each factor carrying the usual topology (The absolute value makes R a metric space: d(x,y)=xy is a metric, its open balls are the intervals (xr,x+r), and it is unbounded, 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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and give it the box topology T (The product set iIXi of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). A point of RN is a sequence of reals (Sequences of reals: bounded, eventually, frequently, tails, subsequences). Put

B  :=  {xRN:x is bounded},V  :=  {xRN:x is unbounded}

(Sequences of reals: bounded, eventually, frequently, tails, subsequences, Lower bound, bounded below, bounded set). Then (B,V) is a separation of RN in the box topology (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets), while every factor R is connected and RN is connected in the product topology (A product of connected spaces is connected in the product topology, and that argument is a theorem of ZF; for an infinite index set it is the assertion that the product of nonempty spaces is nonempty that uses the Axiom of Choice).

Facts & Assumptions

Given: RN=nNR with the box topology, and the sets B and V above.

[A2]

A sequence of reals x is bounded when there is MR with xnM for every nN, and unbounded otherwise (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Lower bound, bounded below, bounded set).

[A6]

For every real ε>0 there is a natural k1 with 1/k<ε; the canonical naturals of R are unbounded above (For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε, The canonical natural ι(n)=n1F of a field).

Counterexample

technique · direct
1.1

B and V are disjoint and cover RN, a sequence being bounded or unbounded and not both, by [A2].

A2
1.2

Both are nonempty: the constant sequence xn:=0 is bounded by M=0, and the sequence yn:=ι(n) of canonical naturals is unbounded by [A6], no real bounding all of them.

A2A6
2.1

B is open in the box topology. Let xB with bound M, and let W:=n(xn1, xn+1), a box, hence open by [A1]. For yW one has ynxn<1, so ynxn+1M+1 for every n by [A3]; hence yB and WB.

step 1.1A1A2A3
2.2

V is open in the box topology. Let xV and take the same box W:=n(xn1, xn+1), open by [A1]. For yW and any MR, unboundedness of x gives n with xn>M+1, and then ynxn1>M by [A3]; so no M bounds y, that is yV and WV.

step 1.1A1A2A3
3.1

By steps 1.1, 1.2, 2.1 and 2.2 the pair (B,V) is a separation of RN in the box topology, so that space is disconnected by [A4]; whereas every factor is connected and the same product is connected in the product topology by [A5].

step 1.1step 1.2step 2.1step 2.2A4A5

Remarks

Sources