[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6NVN9J98EX71GP5ST4JP15X":3,"skill-same:01M6NVN9J98EX71GP5ST4JP15X":55},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":16,"categories":17,"keywords":18,"publishedAt":26,"linkOnly":27,"markdownContent":28,"markdownBody":29,"frontMatter":30,"refName":33,"commitSha":34,"skillDirectory":35,"forksCount":14,"repositoryHtmlUrl":36,"repositoryHomepageUrl":6,"ownerHtmlUrl":37,"ownerBlogUrl":38,"ownerDescription":39,"updatedAt":40,"install":41,"resources":54},"01M6NVN9J98EX71GP5ST4JP15X","connectedness",null,"Problem-solving strategies for connectedness in topology","rubicanjr\u002FFinCognis","rubicanjr","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F234912519?v=4","01M6NT156NND8J474G34SB3923","Rubi","01M6NT15B70RWXE1N3YV0BZY8A",0,"MIT","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Ftopology\u002Fconnectedness\u002FSKILL.md",[],[5,19,20,21,22,23,24,25],"topology","Bash","read","problem-solving","strategies","problem","for","2026-11-10 10:12:30",false,"---\nname: connectedness\ndescription: \"Problem-solving strategies for connectedness in topology\"\nallowed-tools: [Bash, Read]\n---\n\n# Connectedness\n\n## When to Use\n\nUse this skill when working on connectedness problems in topology.\n\n## Decision Tree\n\n\n1. **Is X connected?**\n   - Strategy 1 - Contradiction:\n     * Assume X = U union V where U, V are disjoint, non-empty, and open\n     * Derive a contradiction\n   - Strategy 2 - Path connectedness:\n     * Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y\n   - Strategy 3 - Fan lemma:\n     * If {A_i} are connected sharing a common point, then union A_i is connected\n\n2. **Connectedness Proofs**\n   - Show no separation exists\n   - `z3_solve.py prove \"no_separation\"`\n   - Use intermediate value theorem for R subsets\n\n3. **Path Connectedness**\n   - Construct explicit path: f(t) = (1-t)x + ty for convex sets\n   - `sympy_compute.py simplify \"(1-t)*x + t*y\"` to verify path\n\n4. **Components**\n   - Connected component: maximal connected subset containing x\n   - Path component: maximal path-connected subset containing x\n\n\n## Tool Commands\n\n### Z3_No_Separation\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"no_separation\"\n```\n\n### Sympy_Path\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"(1-t)*x + t*y\"\n```\n\n### Z3_Ivt\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"intermediate_value\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [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.\n- [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.\n- [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.\n- [Topology (Munkres, James Raymond) (Z-Library)] TheunionofacollectionofconnectedsubspacesofXthathaveapointincommonisconnected. Let{Aα}beacollectionofconnectedsubspacesofaspaceX;letpbeapointofAα. WeprovethatthespaceY=Aαisconnected.\n- [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).\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n","# Connectedness\n\n## When to Use\n\nUse this skill when working on connectedness problems in topology.\n\n## Decision Tree\n\n\n1. **Is X connected?**\n   - Strategy 1 - Contradiction:\n     * Assume X = U union V where U, V are disjoint, non-empty, and open\n     * Derive a contradiction\n   - Strategy 2 - Path connectedness:\n     * Show for all x,y in X, exists continuous path f: [0,1] -> X with f(0)=x, f(1)=y\n   - Strategy 3 - Fan lemma:\n     * If {A_i} are connected sharing a common point, then union A_i is connected\n\n2. **Connectedness Proofs**\n   - Show no separation exists\n   - `z3_solve.py prove \"no_separation\"`\n   - Use intermediate value theorem for R subsets\n\n3. **Path Connectedness**\n   - Construct explicit path: f(t) = (1-t)x + ty for convex sets\n   - `sympy_compute.py simplify \"(1-t)*x + t*y\"` to verify path\n\n4. **Components**\n   - Connected component: maximal connected subset containing x\n   - Path component: maximal path-connected subset containing x\n\n\n## Tool Commands\n\n### Z3_No_Separation\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"no_separation\"\n```\n\n### Sympy_Path\n```bash\nuv run python -m runtime.harness scripts\u002Fsympy_compute.py simplify \"(1-t)*x + t*y\"\n```\n\n### Z3_Ivt\n```bash\nuv run python -m runtime.harness scripts\u002Fz3_solve.py prove \"intermediate_value\"\n```\n\n## Key Techniques\n\n*From indexed textbooks:*\n\n- [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.\n- [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.\n- [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.\n- [Topology (Munkres, James Raymond) (Z-Library)] TheunionofacollectionofconnectedsubspacesofXthathaveapointincommonisconnected. Let{Aα}beacollectionofconnectedsubspacesofaspaceX;letpbeapointofAα. WeprovethatthespaceY=Aαisconnected.\n- [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).\n\n## Cognitive Tools Reference\n\nSee `.claude\u002Fskills\u002Fmath-mode\u002FSKILL.md` for full tool documentation.\n",{"name":5,"description":7,"allowed-tools":31},[20,32],"Read","main","70e1c350500ee750987420bbae48837afa906b7e","skills\u002Fmath\u002Ftopology\u002Fconnectedness","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis","https:\u002F\u002Fgithub.com\u002Frubicanjr","linktr.ee\u002Ffinanskodu","Industrial Engineer & CIO @FinansKodu. Architecting AI-driven financial agents and autonomous workflows. 🏗️ Building systems, not just prompts.","2026-06-09 13:50:15",{"source":8,"skillName":5,"commands":42,"prompt":52,"zipAvailable":53},[43,46,49],{"tool":44,"command":45},"npx","npx skills add rubicanjr\u002FFinCognis --skill connectedness",{"tool":47,"command":48},"bunx","bunx skills add rubicanjr\u002FFinCognis --skill connectedness",{"tool":50,"command":51},"pnpm","pnpm dlx skills add rubicanjr\u002FFinCognis --skill connectedness","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fmath\u002Ftopology\u002Fconnectedness\u002FSKILL.md",true,[],[56,77,86,105,134,153],{"skillNo":57,"name":58,"nameZh":6,"description":59,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":60,"categories":61,"keywords":67,"publishedAt":26},"01M6NWS9DAXJTADT4T5MB49X8W","workflow-router","Goal-based workflow orchestration - routes tasks to specialist agents based on user goals","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fworkflow-router\u002FSKILL.md",[62],{"categoryNo":63,"categoryName":64,"taxonomyType":65,"taxonomyTypeDesc":66},"01JBSEEDCAT000000000000023","Skill与智能体开发","SCENARIO","使用场景",[68,69,70,71,72,73,74,75,76],"workflow router","workflow","router","orchestration","goals","goal","user","workflow orchestration","tasks",{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":26},"01M6NWS3RETSC0SHP16HP66E14","wiring","Wiring Verification","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwiring\u002FSKILL.md",[],[79,84,85],"verification","false",{"skillNo":87,"name":88,"nameZh":6,"description":89,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":90,"categories":91,"keywords":95,"publishedAt":26},"01M6NWS0XW9CVQZBDA1EGW0TWC","websocket-patterns","Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fwebsocket-patterns\u002Fskill.md",[92],{"categoryNo":93,"categoryName":94,"taxonomyType":65,"taxonomyTypeDesc":66},"01JBSEEDCAT000000000000015","视觉设计",[96,97,98,99,100,101,102,23,103,104],"websocket","patterns","websocket patterns","design","protocol","management","message","binary","connection",{"skillNo":106,"name":107,"nameZh":6,"description":108,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":109,"categories":110,"keywords":115,"publishedAt":26},"01M6NWRDQDX9ZNETAWRRMQWV52","visual-verdict","Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS\u002FREVISE\u002FFAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvisual-verdict\u002FSKILL.md",[111,114],{"categoryNo":112,"categoryName":113,"taxonomyType":65,"taxonomyTypeDesc":66},"01JBSEEDCAT000000000000009","前端开发",{"categoryNo":63,"categoryName":64,"taxonomyType":65,"taxonomyTypeDesc":66},[116,117,118,119,120,121,122,123,124,25,125,126,127,99,128,129,130,131,132,133],"visual","verdict","visual verdict","ui","across","revise","comparison","correctness","implementing","fixes","dimensions","frontend","development","qa","screenshot","returns","use","frontend development",{"skillNo":135,"name":136,"nameZh":6,"description":137,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":138,"categories":139,"keywords":140,"publishedAt":26},"01M6NWR8HSNRS7MNDK2J02QYMN","verification-loop","Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fverification-loop\u002FSKILL.md",[],[141,142,84,143,144,145,146,147,148,149,150,151,152],"verification loop","loop","lint","review","security","pr","system","diff","build","tests","diff review","types",{"skillNo":154,"name":155,"nameZh":6,"description":156,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":12,"repositoryNo":13,"starsCount":14,"licenseSpdxId":15,"licenseFileUrl":6,"sourceHtmlUrl":157,"categories":158,"keywords":159,"publishedAt":26},"01M6NWR4HHSFR0VR5EXFRWA747","vector-db-patterns","Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.","https:\u002F\u002Fgithub.com\u002Frubicanjr\u002FFinCognis\u002Fblob\u002Fmain\u002Fskills\u002Fvector-db-patterns\u002Fskill.md",[],[160,161,162,163,97,164,165,166,167,23,168,169,170,171,172,25,173,174],"vector db patterns","vector db","db","vector","semantic search","search","embedding strategies","algorithms","chunking","semantic","retrieval","embedding","Hybrid Search","hybrid","rag"]