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.
Source: parcadei/Continuous-Claude-v3 → .claude/skills/math/topology/connectedness/SKILL.md
1---
2name: connectedness
3description: "Problem-solving strategies for connectedness in topology"
4allowed-tools: "[Bash, Read]"
5category: general-purpose
6source_repo: parcadei/Continuous-Claude-v3
7source_path: ".claude/skills/math/topology/connectedness/SKILL.md"
8source_url: https://github.com/parcadei/Continuous-Claude-v3/blob/HEAD/.claude/skills/math/topology/connectedness/SKILL.md
9metadata:
10 source: https://skillmd.com/skills/parcadei/connectedness
11---
12
13
14# Connectedness
15
16## When to Use
17
18Use this skill when working on connectedness problems in topology.
19
20## Decision Tree
21
22
231. **Is X connected?**
24 - Strategy 1 - Contradiction:
25 * Assume X = U union V where U, V are disjoint, non-empty, and open
26 * Derive a contradiction
27 - Strategy 2 - Path connectedness:
28 * Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y
29 - Strategy 3 - Fan lemma:
30 * If {A_i} are connected sharing a common point, then union A_i is connected
31
322. **Connectedness Proofs**
33 - Show no separation exists
34 - `z3_solve.py prove "no_separation"`
35 - Use intermediate value theorem for R subsets
36
373. **Path Connectedness**
38 - Construct explicit path: f(t) = (1-t)x + ty for convex sets
39 - `sympy_compute.py simplify "(1-t)*x + t*y"` to verify path
40
414. **Components**
42 - Connected component: maximal connected subset containing x
43 - Path component: maximal path-connected subset containing x
44
45
46## Tool Commands
47
48### Z3_No_Separation
49```bash
50uv run python -m runtime.harness scripts/z3_solve.py prove "no_separation"
51```
52
53### Sympy_Path
54```bash
55uv run python -m runtime.harness scripts/sympy_compute.py simplify "(1-t)*x + t*y"
56```
57
58### Z3_Ivt
59```bash
60uv run python -m runtime.harness scripts/z3_solve.py prove "intermediate_value"
61```
62
63## Key Techniques
64
65*From indexed textbooks:*
66
67- [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.
68- [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.
69- [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.
70- [Topology (Munkres, James Raymond) (Z-Library)] TheunionofacollectionofconnectedsubspacesofXthathaveapointincommonisconnected. Let{Aα}beacollectionofconnectedsubspacesofaspaceX;letpbeapointofAα. WeprovethatthespaceY=Aαisconnected.
71- [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).
72
73## Cognitive Tools Reference
74
75See `.claude/skills/math-mode/SKILL.md` for full tool documentation.
76
77---
78
79**Source:** [`parcadei/Continuous-Claude-v3`](https://github.com/parcadei/Continuous-Claude-v3) → `.claude/skills/math/topology/connectedness/SKILL.md`