CO

connectedness

Provides logical strategies and verification tools for topology problems involving connectedness.

Install

mkdir -p .claude/skills/connectedness && curl -L -o skill.zip "https://agentskills.codes/api/skills/download/2681" && unzip -o skill.zip -d .claude/skills/connectedness && rm skill.zip

Installs to .claude/skills/connectedness

Activation

This is the description your AI agent reads to decide when to run this skill — the better it matches your request, the more reliably it fires.

Problem-solving strategies for connectedness in topology
56 charsno explicit “when” trigger
Advanced

Key capabilities

  • Prove a set is connected using contradiction
  • Demonstrate path connectedness for a set
  • Apply the fan lemma for connected sets
  • Show no separation exists for connectedness proofs
  • Use the intermediate value theorem for R subsets
  • Construct explicit paths for convex sets

How it works

This skill provides strategies and tool commands to prove connectedness by contradiction, demonstrate path connectedness, or apply the fan lemma, using Z3 and SymPy for logical assertions and path simplification.

Inputs & outputs

You give it
topological space or set X
You get back
proof of connectedness, path connectedness, or identification of components

When to use connectedness

  • Prove set connectedness
  • Verify path connectedness
  • Simplify path equations
  • Evaluate topological separation

About this skill

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.

Limitations

  • Applies to connectedness problems in topology
  • Requires understanding of topological concepts like open sets and continuous paths
  • Proof strategies are specific to connectedness, path connectedness, and components

How it compares

This skill offers structured strategies and automated tools for topological proofs, contrasting with manual derivation or intuitive reasoning.

Compared to similar skills

connectedness side by side with the closest alternatives in the catalog.

SkillInstallsUpdatedSafetyDifficulty
connectedness (this skill)27moReviewAdvanced
literature-review5592moReviewAdvanced
openalex-database487moReviewIntermediate
annas-archive-ebooks227moReviewBeginner

Try saying

Example prompts that trigger this skill in your AI assistant.

You might also like

literature-review

K-Dense-AI

Conduct comprehensive, systematic literature reviews using multiple academic databases (PubMed, arXiv, bioRxiv, Semantic Scholar, etc.). This skill should be used when conducting systematic literature reviews, meta-analyses, research synthesis, or comprehensive literature searches across biomedical, scientific, and technical domains. Creates professionally formatted markdown documents and PDFs with verified citations in multiple citation styles (APA, Nature, Vancouver, etc.).

5591,298

openalex-database

davila7

Query and analyze scholarly literature using the OpenAlex database. This skill should be used when searching for academic papers, analyzing research trends, finding works by authors or institutions, tracking citations, discovering open access publications, or conducting bibliometric analysis across 240M+ scholarly works. Use for literature searches, research output analysis, citation analysis, and academic database queries.

48202

annas-archive-ebooks

ratacat

Use when needing to look up book content, find a book by title/author, download an ebook, or reference material from a published book. Triggers on book lookups, ebook downloads, "find the book", "get the PDF/EPUB of". Downloads produce PDF/EPUB/MOBI files - use ebook-extractor skill to convert to text.

22177

scientific-critical-thinking

davila7

Evaluate research rigor. Assess methodology, experimental design, statistical validity, biases, confounding, evidence quality (GRADE, Cochrane ROB), for critical analysis of scientific claims.

1888

biorxiv-database

lifangda

Efficient database search tool for bioRxiv preprint server. Use this skill when searching for life sciences preprints by keywords, authors, date ranges, or categories, retrieving paper metadata, downloading PDFs, or conducting literature reviews.

780

gpt-researcher

assafelovic

GPT Researcher is an autonomous deep research agent that conducts web and local research, producing detailed reports with citations. Use this skill when helping developers understand, extend, debug, or integrate with GPT Researcher - including adding features, understanding the architecture, working with the API, customizing research workflows, adding new retrievers, integrating MCP data sources, or troubleshooting research pipelines.

1464

Search skills

Search the agent skills registry