Now liveThe Skillselion MCP - thousands of ranked skills, loaded into your agent mid-task. No install.Get it →
parcadei avatar

Connectedness

  • 1 installs
  • 3.9k repo stars
  • Updated January 26, 2026
  • parcadei/continuous-claude-v3

Guides Claude through topology connectedness problems using separation contradiction, path-connectedness, and connected components via sympy and z3.

About

A decision-tree skill for proving connectedness in topology, wiring z3 for no-separation proofs and sympy to verify paths. A developer uses it when they want Claude to reason about path-connectedness and connected components.

  • Separation contradiction and path-connectedness strategies
  • Explicit path construction for convex sets

Connectedness by the numbers

  • 1 all-time installs (skills.sh)
  • Ranked #1,803 of 2,064 Data Science & ML skills by installs in the Skillselion catalog
  • Data as of Aug 5, 2026 (Skillselion catalog sync)
npx skills add https://github.com/parcadei/continuous-claude-v3 --skill connectedness

Add your badge

Show developers this skill is listed on Skillselion. Paste this into your README.

Listed on Skillselion
Installs1
repo stars3.9k
Last updatedJanuary 26, 2026
Repositoryparcadei/continuous-claude-v3

What it does

Guides Claude through topology connectedness problems using separation contradiction, path-connectedness, and connected components via sympy and z3.

Files

SKILL.mdMarkdownGitHub ↗

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

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.

Related skills

Data Science & MLagentsresearch

This week in AI coding

Five minutes, every Monday - the tools, releases and tactics for developers.

unsubscribe anytime.