Receber por email
← Voltar para o catálogo

connectedness

Estratégias de resolução de problemas para conectividade em topologia

3.8kestrelas
Atualizado há 9 meses

Ver no GitHub ↗ Licença: MIT

Como adicionar

/plugin marketplace add parcadei/Continuous-Claude-v3

O comando exato pode variar conforme o repositório. Confira o README no GitHub.

Para o autor da skill

Cole no README do seu repo

Mostra que sua skill está catalogada na Skillteca, gera backlink e tráfego rastreável.

[![Skillteca](https://www.skillteca.com.br/api/badge/connectedness/svg)](https://www.skillteca.com.br/skills/connectedness)

Skills relacionadas

Ver todas de Automação →

Alerta por categoria

Receba novas skills de Automação toda segunda

1 email curto, só com as skills novas de Automação. 4 minutos de leitura, sem spam, cancela com 1 clique.

Você confirma o email no primeiro envio. Sem spam. Cancela com 1 clique.

Ler descrição completa

Connectedness

When to Use

Use this skill when working on connectedness problems in topology.

Decision Tree

  1. Is X connected?
  2. Strategy 1 - Contradiction:
  3. Assume X = U union V where U, V are disjoint, non-empty, and open
  4. Derive a contradiction
  5. Strategy 2 - Path connectedness:
  6. Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y
  7. Strategy 3 - Fan lemma:
  8. If {A_i} are connected sharing a common point, then union A_i is connected
  1. Connectedness Proofs
  2. Show no separation exists
  3. z3_solve.py prove "no_separation"
  4. Use intermediate value theorem for R subsets
  1. Path Connectedness
  2. Construct explicit path: f(t) = (1-t)x + ty for convex sets
  3. sympy_compute.py simplify "(1-t)*x + t*y" to verify path
  1. Components
  2. Connected component: maximal connected subset containing x
  3. 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.

Compartilhar X LinkedIn