connectedness — Claude Code skill: topology problem-solving
A skill for Claude Code with strategies for connectedness problems in topology.
MIT ★ 3,951 updated 2026-01-26
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a claude-codeWhat connectedness does
The skill provides three core strategies: proof by contradiction (assume a separation and derive a contradiction), path connectedness (show a continuous path exists between any two points), and the fan lemma (the union of connected sets sharing a common point is connected). It works with Bash and Read tools, offering commands to check separations via Z3, compute explicit paths with SymPy, and apply the intermediate value theorem.
Includes ready-to-use commands: z3_solve.py prove "no_separation" to verify no separation exists, sympy_compute.py simplify "(1-t)*x + t*y" to build convex paths, and z3_solve.py prove "intermediate_value" for IVT application. The skill draws on classical topology textbooks and assumes familiarity with basic connected space concepts.
What it helps with
- prove a topological space is connected
- construct a continuous path between two points
- identify connected components of a set
- apply the intermediate value theorem
- show the union of connected sets is connected
Example prompts for the agent
- Verify connectivity by assuming a separation and deriving a contradiction
- Build an explicit path f(t) = (1-t)x + ty for a convex set
- Simplify a path expression with
sympy_compute.py simplify "(1-t)*x + t*y"
How to install connectedness
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a claude-code2Manually: put the files in place
~/.claude/skills/connectedness/SKILL.mdCopy the whole skill folder; for one project use .claude/skills/connectedness/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a codex2Manually: put the files in place
.agents/skills/connectedness/SKILL.mdFor all projects use ~/.agents/skills/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a cursor2Manually: put the files in place
.cursor/skills/connectedness/SKILL.mdCursor also reads .agents/skills/ and .claude/skills/
1GitHub CLI
gh skill install parcadei/Continuous-Claude-v3 .claude/skills/math/topology/connectedness2Manually: put the files in place
.github/skills/connectedness/SKILL.md1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a gemini-cli2Platform CLI
gemini skills install https://github.com/parcadei/Continuous-Claude-v3 --path .claude/skills/math/topology/connectednessManually: put the files in place
.devin/skills/connectedness/SKILL.mdThe legacy .windsurf/skills/ path still works
Claude.ai
Zip the folder and upload it in Settings → Capabilities → Skills
Step by step, with commands for each platform: How to install skills in Claude Code: five ways
Questions about connectedness
How do I install connectedness for Claude Code?
Run npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a claude-code, then open ~/.claude/skills/connectedness/SKILL.md.
What does the connectedness skill do?
It offers strategies for topology connectedness problems: proof by contradiction, path construction, and the fan lemma for unions of connected sets.
What tools does connectedness use?
Bash and Read. It relies on Z3 for proofs, SymPy for path computation, and the intermediate value theorem for value analysis.
Source text
SKILL.md · MIT
---
name: connectedness
description: "Problem-solving strategies for connectedness in topology"
allowed-tools: [Bash, Read]
---
# Connectedness
## When to Use
Use this skill when working on connectedness problems in topology.
## Decision Tree
1. **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
2. **Connectedness Proofs**
- Show no separation exists
- `z3_solve.py prove "no_separation"`
- Use intermediate value theorem for R subsets
3. **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
4. **Components**
- Connected component: maximal connected subset containing x
- Path component: maximal path-connected subset containing x
## Tool Commands
### Z3_No_Separation
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "no_separation"
```
### Sympy_Path
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "(1-t)*x + t*y"
```
### Z3_Ivt
```bash
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.
© parcadei · MIT · parcadei/Continuous-Claude-v3