Skip to main content
skill CX Codex

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

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a claude-code
Open on GitHub

What 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-code

2Manually: put the files in place

~/.claude/skills/connectedness/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/connectedness/

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

Similar skills

All skills for AI and ML →

From the same set161

The whole set →
banach-spaces Tackles problems in functional analysis involving Banach spaces. Includes strategies for proving key theorems: completeness, Hahn-Banach, open mapping, closed graph, and uniform boundedness principle. CX Codex +1 ★ 3,951repo stars contour-integrals contour-integrals — a Claude Code skill for solving contour integral problems in complex analysis. It guides you through choosing the right contour, locating poles, and applying the residue theorem to evaluate definite integrals. CX Codex +1 ★ 3,951repo stars arbiter arbiter runs unit and integration tests, investigates failures, and checks an implementation against acceptance criteria. Saves its report in the project. CX Codex ★ 3,951repo stars convex-optimization Skill for tackling convex optimization problems. Includes convexity verification, problem classification, and solution methods based on KKT conditions. CX Codex +1 ★ 3,951repo stars analytic-functions analytic-functions is a Claude Code skill for checking analyticity, verifying Cauchy-Riemann equations, and computing power series and analytic continuations. It activates for theory of functions questions. CX Codex +1 ★ 3,951repo stars math-intuition-builder math-intuition-builder develops mathematical understanding by guiding you through concrete examples, diagrams, and analogies before diving into calculation. Useful when you need solid intuition before solving a problem. CX Codex +1 ★ 3,951repo stars constrained-optimization Guides Claude Code through constrained optimization problems. It classifies constraints, formulates Lagrangians, and checks KKT optimality conditions. CX Codex +1 ★ 3,951repo stars integration-theory integration-theory — a Claude Code skill for solving measure-theoretic integration problems. Covers simple functions, monotone and dominated convergence, Fatou's lemma, and Fubini—Tonelli via sympy_compute.py and z3_solve.py commands. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open