connectedness

GitHub

提供拓扑学中连通性问题的解决策略,包括矛盾法、路径连通性及扇引理。支持使用Z3和Sympy工具进行证明验证与路径计算。

.claude/skills/math/topology/connectedness/SKILL.md parcadei/Continuous-Claude-v3

触发场景

求解拓扑空间连通性问题 验证集合的路径连通性 使用自动化工具证明无分离存在

安装

npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -g -y
更多选项

非标准路径

npx skills add https://github.com/parcadei/Continuous-Claude-v3/tree/main/.claude/skills/math/topology/connectedness -g -y

不安装直接使用

npx skills use parcadei/Continuous-Claude-v3@connectedness

指定 Agent (Claude Code)

npx skills add parcadei/Continuous-Claude-v3 --skill connectedness -a claude-code -g -y

安装 repo 全部 skill

npx skills add parcadei/Continuous-Claude-v3 --all -g -y

预览 repo 内 skill

npx skills add parcadei/Continuous-Claude-v3 --list

SKILL.md

Frontmatter
{
    "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

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.

版本历史

  • d07ff4b 当前 2026-08-20 12:49

同 Skill 集合

.claude/plugins/braintrust-tracing/skills/trace-claude-code/SKILL.md
.claude/skills/agentica-claude-proxy/SKILL.md
.claude/skills/agentica-infrastructure/SKILL.md
.claude/skills/agentica-prompts/SKILL.md
.claude/skills/agentica-sdk/SKILL.md
.claude/skills/agentica-server/SKILL.md
.claude/skills/archive/leann-search/SKILL.md
.claude/skills/ast-grep-find/SKILL.md
.claude/skills/braintrust-tracing/SKILL.md
.claude/skills/cli-reference/SKILL.md
.claude/skills/commit/SKILL.md
.claude/skills/compound-learnings/SKILL.md
.claude/skills/continuity_ledger/SKILL.md
.claude/skills/create_handoff/SKILL.md
.claude/skills/dead-code/SKILL.md
.claude/skills/debug-hooks/SKILL.md
.claude/skills/debug/SKILL.md
.claude/skills/describe_pr/SKILL.md
.claude/skills/discovery-interview/SKILL.md
.claude/skills/explore/SKILL.md
.claude/skills/firecrawl-scrape/SKILL.md
.claude/skills/fix/SKILL.md
.claude/skills/github-search/SKILL.md
.claude/skills/help/SKILL.md
.claude/skills/hook-developer/SKILL.md
.claude/skills/implement_plan_micro/SKILL.md
.claude/skills/implement_plan/SKILL.md
.claude/skills/implement_task/SKILL.md
.claude/skills/loogle-search/SKILL.md
.claude/skills/math-help/SKILL.md
.claude/skills/math-router/SKILL.md
.claude/skills/math-unified/SKILL.md
.claude/skills/math/abstract-algebra/fields/SKILL.md
.claude/skills/math/abstract-algebra/groups/SKILL.md
.claude/skills/math/abstract-algebra/rings/SKILL.md
.claude/skills/math/category-theory/categories-functors/SKILL.md
.claude/skills/math/category-theory/limits-colimits/SKILL.md
.claude/skills/math/category-theory/natural-transformations/SKILL.md
.claude/skills/math/complex-analysis/analytic-functions/SKILL.md
.claude/skills/math/complex-analysis/contour-integrals/SKILL.md
.claude/skills/math/complex-analysis/residues/SKILL.md
.claude/skills/math/functional-analysis/banach-spaces/SKILL.md
.claude/skills/math/functional-analysis/hilbert-spaces/SKILL.md
.claude/skills/math/functional-analysis/operator-theory/SKILL.md
.claude/skills/math/graph-number-theory/graph-algorithms/SKILL.md
.claude/skills/math/graph-number-theory/modular-arithmetic/SKILL.md
.claude/skills/math/graph-number-theory/prime-numbers/SKILL.md
.claude/skills/math/information-theory/channel-capacity/SKILL.md
.claude/skills/math/information-theory/entropy/SKILL.md
.claude/skills/math/information-theory/source-coding/SKILL.md

元信息

文件数
0
版本
d07ff4b
Hash
a5f84e71
收录时间
2026-08-20 12:49

首页 - Wiki
Copyright © 2011-2026 iteam. Current version is 2.155.2. UTC+08:00, 2026-11-03 16:48
浙ICP备14020137号-1