Best use case
open-sets is best used when you need a repeatable AI agent workflow instead of a one-off prompt.
Problem-solving strategies for open sets in topology
Teams using open-sets should expect a more consistent output, faster repeated execution, less prompt rewriting.
When to use this skill
- You want a reusable workflow that can be run more than once with consistent structure.
When not to use this skill
- You only need a quick one-off answer and do not need a reusable workflow.
- You cannot install or maintain the underlying files, dependencies, or repository context.
Installation
Claude Code / Cursor / Codex
Manual Installation
- Download SKILL.md from GitHub
- Place it in
.claude/skills/open-sets/SKILL.mdinside your project - Restart your AI agent — it will auto-discover the skill
How open-sets Compares
| Feature / Agent | open-sets | Standard Approach |
|---|---|---|
| Platform Support | Not specified | Limited / Varies |
| Context Awareness | High | Baseline |
| Installation Complexity | Unknown | N/A |
Frequently Asked Questions
What does this skill do?
Problem-solving strategies for open sets in topology
Where can I find the source code?
You can find the source code on GitHub using the link provided at the top of the page.
SKILL.md Source
# Open Sets
## When to Use
Use this skill when working on open-sets problems in topology.
## Decision Tree
1. **Is f: X -> Y continuous?**
- For metric spaces: x_n -> x implies f(x_n) -> f(x)?
- For general spaces: f^(-1)(open) = open?
- For products: Check each coordinate function
- `z3_solve.py prove "preimage_open"`
2. **Open Set Verification**
- For metric spaces: for all x in U, exists epsilon > 0 with B(x,epsilon) subset U
- `z3_solve.py prove "ball_contained"` with epsilon witnesses
3. **Topological Properties**
- Interior: int(A) = largest open subset of A
- Closure: cl(A) = smallest closed superset of A
- Boundary: bd(A) = cl(A) \ int(A)
4. **Continuity Tests**
- Epsilon-delta: for all epsilon > 0, exists delta > 0: d(x,a) < delta implies d(f(x),f(a)) < epsilon
- `z3_solve.py prove "epsilon_delta_bound"`
## Tool Commands
### Z3_Preimage_Open
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "preimage_open"
```
### Z3_Epsilon_Delta
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "ForAll(eps, Exists(delta, d(x,a) < delta implies d(f(x),f(a)) < eps))"
```
### Z3_Ball_Contained
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "ball_contained"
```
## Key Techniques
*From indexed textbooks:*
- [Introduction to Topological Manifolds... (Z-Library)] Show that every local homeomorphism is an open map. Show that every homeomorphism is a local homeomorphism. Show that a bijective continuous open map is a homeomorphism.
- [Introduction to Topological Manifolds... (Z-Library)] The key motivation behind the denition of this new kind of space is the open set criterion for continuity (Lemma A. Appendix), which shows that continuous functions between metric spaces can be detected knowing only the open sets. Motivated by this observation, we make the following denition.
- [Introduction to Topological Manifolds... (Z-Library)] Suppose X is a set, and B is any collection of subsets of X whose union equals X. Let T be the collection of all unions of nite inter- sections of elements of B. Note that the empty set is the union of the empty collection of sets.
- [Introduction to Topological Manifolds... (Z-Library)] The product topology is “associative” in the sense that the three prod- uct topologies X1 × X2 × X3, (X1 × X2) × X3, and X1 × (X2 × X3) on the set X1 × X2 × X3 are all equal. For any i and any points xj ∈ Xj, j = i, the map fi : Xi → X1 × · · × Xn given by fi(x) = (x1, . If for each i, Bi is a basis for the topology of Xi, then the set {B1 × · · · × Bn : Bi ∈ Bi} is a basis for the product topology on X1 × · · · × Xn.
- [Introduction to Topological Manifolds... (Z-Library)] Here are some examples of closed subsets of familiar topological spaces. Any closed interval [a, b] ⊂ R is a closed set, as are the half-innite closed intervals [a, ∞) and (−∞, b]. Every subset of a discrete space is closed.
## Cognitive Tools Reference
See `.claude/skills/math-mode/SKILL.md` for full tool documentation.Related Skills
workflow-router
Goal-based workflow orchestration - routes tasks to specialist agents based on user goals
wiring
Wiring Verification
websocket-patterns
Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.
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/REVISE/FAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.
verification-loop
Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.
vector-db-patterns
Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.
variant-analysis
Find similar vulnerabilities across a codebase after discovering one instance. Uses pattern matching, AST search, Semgrep/CodeQL queries, and manual tracing to propagate findings. Adapted from Trail of Bits. Use after finding a bug to check if the same pattern exists elsewhere.
validate-agent
Validation agent that validates plan tech choices against current best practices
tracing-patterns
OpenTelemetry setup, span context propagation, sampling strategies, Jaeger queries
tour
Friendly onboarding tour of Claude Code capabilities for users asking what it can do.
tldr-stats
Show full session token usage, costs, TLDR savings, and hook activity
tldr-router
Map code questions to the optimal tldr command by detecting intent and routing to the right analysis layer.