Connectedness
When to Use
Use this skill when working on connectedness problems in topology.
Decision Tree
Is X connected?
- Strategy 1 - Contradiction:
- Assume X = U union V where U, V are disjoint, non-empty, and open
- Derive a contradiction
- Strategy 2 - Path connectedness:
- Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y
- Strategy 3 - Fan lemma:
- If {A_i} are connected sharing a common point, then union A_i is connected
Connectedness Proofs
- Show no separation exists
z3_solve.py prove "no_separation"
- Use intermediate value theorem for R subsets
Path Connectedness
- Construct explicit path: f(t) = (1-t)x + ty for convex sets
sympy_compute.py simplify "(1-t)*x + t*y" to verify path
Components
- Connected component: maximal connected subset containing x
- Path component: maximal path-connected subset containing x
Tool Commands
Z3_No_Separation
uv run python -m runtime.harness scripts/z3_solve.py prove "no_separation"
Sympy_Path
uv run python -m runtime.harness scripts/sympy_compute.py simplify "(1-t)*x + t*y"
Z3_Ivt
uv run python -m runtime.harness scripts/z3_solve.py prove "intermediate_value"
Key Techniques
From indexed textbooks:
- [Introduction to Topological Manifolds... (Z-Library)] Connectedness One of the most important elementary facts about continuous functions is the intermediate value theorem: If f is a continuous real-valued function dened on a closed bounded interval [a, b], then f takes on every value be- tween f (a) and f (b). The key idea here is the “connectedness” of intervals. In this section we generalize this concept to topological spaces.
- [Topology (Munkres, James Raymond) (Z-Library)] A b× lb× cb×0π1(A)×0π1(A)×0 156ConnectednessandCompactnessCh. DenetheunitballBninRnbytheequationBn={x|x≤1},wherex=(x1,. Theunitballispathconnected;givenanytwopointsxandyofBn,thestraight-linepathf:[0,1]→Rndenedbyf(t)=(1−t)x+tyliesinBn.
- [Introduction to Topological Manifolds... (Z-Library)] Thanks are due also to Mary Sheetz, who did an excellent job producing some of the illustrations under the pressures of time and a nicky author. My debt to the authors of several other textbooks will be obvious to anyone who knows those books: William Massey’s Algebraic Topology: An Introduction [Mas89], Allan Sieradski’s An Introduction to Topology and Homotopy [Sie92], Glen Bredon’s Topology and Geometry, and James Munkres’s Topology: A First Course [Mun75] and Elements of Algebraic Topology [Mun84] are foremost among them. Finally, I would like to thank my wife, Pm, for her forbearance and unagging support while I was spending far too much time with this book Preface and far too little with the family; without her help I unquestionably could not have done it.
- [Topology (Munkres, James Raymond) (Z-Library)] TheunionofacollectionofconnectedsubspacesofXthathaveapointincommonisconnected. Let{Aα}beacollectionofconnectedsubspacesofaspaceX;letpbeapointofAα. WeprovethatthespaceY=Aαisconnected.
- [Introduction to Topological Manifolds... (Z-Library)] Conversely, if X is disconnected, we can write X = U ∪ V where U and V are nonempty, open, and disjoint. This implies that U is open, closed, not empty, and not equal to X. Main Theorem on Connectedness).
Cognitive Tools Reference
See .claude/skills/math-mode/SKILL.md for full tool documentation.
1---2name: connectedness3description: Problem-solving strategies for connectedness in topology4---5
6# Connectedness
7
8## When to Use
9
10Use this skill when working on connectedness problems in topology.
11
12## Decision Tree
13
14
151. **Is X connected?**
16 - Strategy 1 - Contradiction:
17 * Assume X = U union V where U, V are disjoint, non-empty, and open
18 * Derive a contradiction
19 - Strategy 2 - Path connectedness:
20 * Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y
21 - Strategy 3 - Fan lemma:
22 * If {A_i} are connected sharing a common point, then union A_i is connected
23
242. **Connectedness Proofs**
25 - Show no separation exists
26 - `z3_solve.py prove "no_separation"`
27 - Use intermediate value theorem for R subsets
28
293. **Path Connectedness**
30 - Construct explicit path: f(t) = (1-t)x + ty for convex sets
31 - `sympy_compute.py simplify "(1-t)*x + t*y"` to verify path
32
334. **Components**
34 - Connected component: maximal connected subset containing x
35 - Path component: maximal path-connected subset containing x
36
37
38## Tool Commands
39
40### Z3_No_Separation
41```bash
42uv run python -m runtime.harness scripts/z3_solve.py prove "no_separation"
43```
44
45### Sympy_Path
46```bash
47uv run python -m runtime.harness scripts/sympy_compute.py simplify "(1-t)*x + t*y"
48```
49
50### Z3_Ivt
51```bash
52uv run python -m runtime.harness scripts/z3_solve.py prove "intermediate_value"
53```
54
55## Key Techniques
56
57*From indexed textbooks:*
58
59- [Introduction to Topological Manifolds... (Z-Library)] Connectedness One of the most important elementary facts about continuous functions is the intermediate value theorem: If f is a continuous real-valued function dened on a closed bounded interval [a, b], then f takes on every value be- tween f (a) and f (b). The key idea here is the “connectedness” of intervals. In this section we generalize this concept to topological spaces.
60- [Topology (Munkres, James Raymond) (Z-Library)] A b× lb× cb×0π1(A)×0π1(A)×0 156ConnectednessandCompactnessCh. DenetheunitballBninRnbytheequationBn={x|x≤1},wherex=(x1,. Theunitballispathconnected;givenanytwopointsxandyofBn,thestraight-linepathf:[0,1]→Rndenedbyf(t)=(1−t)x+tyliesinBn.
61- [Introduction to Topological Manifolds... (Z-Library)] Thanks are due also to Mary Sheetz, who did an excellent job producing some of the illustrations under the pressures of time and a nicky author. My debt to the authors of several other textbooks will be obvious to anyone who knows those books: William Massey’s Algebraic Topology: An Introduction [Mas89], Allan Sieradski’s An Introduction to Topology and Homotopy [Sie92], Glen Bredon’s Topology and Geometry, and James Munkres’s Topology: A First Course [Mun75] and Elements of Algebraic Topology [Mun84] are foremost among them. Finally, I would like to thank my wife, Pm, for her forbearance and unagging support while I was spending far too much time with this book Preface and far too little with the family; without her help I unquestionably could not have done it.
62- [Topology (Munkres, James Raymond) (Z-Library)] TheunionofacollectionofconnectedsubspacesofXthathaveapointincommonisconnected. Let{Aα}beacollectionofconnectedsubspacesofaspaceX;letpbeapointofAα. WeprovethatthespaceY=Aαisconnected.
63- [Introduction to Topological Manifolds... (Z-Library)] Conversely, if X is disconnected, we can write X = U ∪ V where U and V are nonempty, open, and disjoint. This implies that U is open, closed, not empty, and not equal to X. Main Theorem on Connectedness).
64
65## Cognitive Tools Reference
66
67See `.claude/skills/math-mode/SKILL.md` for full tool documentation.