connectedness
npx machina-cli add skill parcadei/Continuous-Claude-v3/connectedness --openclawConnectedness
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
- Strategy 1 - Contradiction:
-
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
git clone https://github.com/parcadei/Continuous-Claude-v3/blob/main/.claude/skills/math/topology/connectedness/SKILL.mdView on GitHub Overview
This skill provides practical strategies to test and establish connectedness, path-connectedness, and components in topological spaces. It uses a decision-tree approach (contradiction, path construction, and fan lemma), shows how to apply computational tools, and clarifies the difference between connected and path components to structure rigorous proofs.
How This Skill Works
Begin by diagnosing X with a decision tree: try a contradiction via a separation, establish path-connectedness by constructing explicit paths, or apply the fan lemma for unions of connected sets sharing a point. Use tools like Z3 to prove no_separation and Sympy to verify paths, and distinguish between the connected component and the path component containing a reference point.
When to Use It
- You are solving a topology problem and need to decide if a set X is connected.
- You want to prove connectedness by showing there is no separation X = U ∪ V with U,V open, nonempty, and disjoint.
- You need to demonstrate path-connectedness by constructing a continuous path between any two points x and y in X.
- You suspect a union of connected subspaces sharing a common point is connected (fan lemma) and want to justify it.
- You are verifying connectivity with computational tools (e.g., checking for separation or applying the intermediate value theorem on real subsets).
Quick Start
- Step 1: Frame X and choose a strategy (contradiction, path, or fan lemma).
- Step 2: If convex or a clear path exists, construct f(t) = (1-t)x + ty and ensure f(t) ∈ X for t ∈ [0,1].
- Step 3: Run the tool commands: uv run python -m runtime.harness scripts/z3_solve.py prove "no_separation"; uv run python -m runtime.harness scripts/sympy_compute.py simplify "(1-t)*x + t*y"; uv run python -m runtime.harness scripts/z3_solve.py prove "intermediate_value".
Best Practices
- Frame the question X, then apply the decision-tree strategies (contradiction, path, fan lemma) to test connectedness.
- If X is convex, construct the explicit path f(t) = (1-t)x + ty and verify it stays in X.
- Use Z3 to prove 'no_separation' and Z3_Ivt to check the intermediate value theorem on real subsets.
- When possible, verify explicit paths with Sympy's simplify on expressions like (1-t)x + ty.
- Distinguish and locate the connected component and the path component containing your reference point x.
Example Use Cases
- The unit interval [a,b] is connected via the intermediate value property.
- A convex subset of R^n is path-connected by straight-line segments.
- A collection of connected subspaces with a common point has a connected union (Fan lemma).
- Recognizing disconnection in a subset of R by writing it as a union of two nonempty opens.
- Using Z3 to certify there is no separation in a constructed topological space.