Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

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 ι\iota for the canonical natural so that 1/(n+1)1/(n+1) means 1/ι(n+1)1/\iota(n+1) with nNn \in \mathbb{N} and N\mathbb{N} containing 00 (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), put

T  :=  {0}{1n+1:nN}[0,1],C  :=  ([0,1]×{0})    (T×[0,1])T \;:=\; \{0\} \cup \Bigl\{\tfrac{1}{n+1} : n \in \mathbb{N}\Bigr\} \subseteq [0,1], \qquad C \;:=\; \bigl([0,1] \times \{0\}\bigr) \;\cup\; \bigl(T \times [0,1]\bigr)

as a subspace of R2\mathbb{R}^2 with the product topology (For n1n \ge 1 the product topology on nn copies of the usual topology of R\mathbb{R} is the metric topology of dd_\infty on Rn\mathbb{R}^n, and hence also of d1d_1 and d2d_2, so Rn\mathbb{R}^n as a product and Rn\mathbb{R}^n 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 CC is path-connected, hence connected, and CC is not locally connected at any point (0,t)(0,t) with t>0t > 0.

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

Facts & Assumptions

Given: R2\mathbb{R}^2 with the product topology and the comb CC above, with π0\pi_0 the first projection.

Counterexample

technique · direct
1.1

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

A1A2
1.2

For t>0t > 0 and η:=t/2>0\eta := t/2 > 0 put Ut:=C(R×(tη, t+η))U_t := C \cap \bigl(\mathbb{R} \times (t - \eta,\ t + \eta)\bigr), an open subset of CC containing (0,t)(0,t); every point of UtU_t has second coordinate >tη=t/2>0> t - \eta = t/2 > 0, so UtU_t contains no point of the base and π0[Ut]T\pi_0[U_t] \subseteq T.

A1
1.3

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

A3A5
2.1

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

step 1.1A2
2.2

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

step 1.2step 1.3A1A3
3.1

But VV is open in CC and contains (0,t)(0,t), so by [A1] there is η>0\eta' > 0 with C((η,η)×(tη,t+η))VC \cap \bigl((-\eta',\eta') \times (t-\eta', t+\eta')\bigr) \subseteq V; by [A5] there is k1k \ge 1 with 1/k<η1/k < \eta', and with n:=k1Nn := k-1 \in \mathbb{N} the point (1/(n+1),t)(1/(n+1), t) lies in that trace, hence in VV, while its first coordinate is not 00. This contradicts step 2.2.

step 2.2A1A5A6
4.1

So no such VV exists and CC fails to be locally connected at (0,t)(0,t) for every t>0t > 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>0t > 0 is used. At (0,0)(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 UtU_t 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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 144 results over 23 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources