Skip to main content
skill CX Codex

compactness — Claude Code skill: topology and proofs

A skill for solving compactness problems in topology. Checks whether spaces are compact, applies the Heine-Borel and Tychonoff theorems, and computes consequences of compactness.

MIT ★ 3,951 updated 2026-01-26

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill compactness -a claude-code
Open on GitHub

What compactness does

The skill provides a decision tree for compactness analysis: testing closed and bounded sets in R^n via the Heine-Borel theorem, finding convergent subsequences in metric spaces, and verifying finite subcovers in general spaces. Built-in commands automate checks using z3_solve.py for boundedness proofs and sympy_compute.py for sequence limits and function extrema on compact sets.

Works with Bash and Read, relies on Z3 for formal verification and SymPy for computational analysis. Covers finite products of compact spaces under Tychonoff and key theorems: continuous images of compact sets are compact, continuous real functions on compact spaces attain their maximum and minimum.

What it helps with

  • prove a set is compact or determine it is not compact
  • find the maximum or minimum of a function on a closed interval
  • verify convergence of a sequence in a metric space
  • apply Tychonoff theorem to products of spaces

Example prompts for the agent

  • Check if a subset of R^n is compact given that it is closed and bounded
  • Find the maximum of f(x) = x^2 on the interval [−1, 1]
  • Prove that a finite product of compact spaces remains compact

How to install compactness

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill compactness -a claude-code

2Manually: put the files in place

~/.claude/skills/compactness/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/compactness/

Step by step, with commands for each platform: How to install skills in Claude Code: five ways

Questions about compactness

How do I install compactness in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill compactness -a claude-code, then check ~/.claude/skills/compactness/SKILL.md to verify the installation.

What does the compactness skill do?

It provides a decision tree for analyzing compactness, automates checks for closed and bounded sets, and computes limits of sequences and extrema of functions on compact sets.

What tools does this skill use?

Bash for command execution, Read for file access, Z3 for proving boundedness and closure properties, and SymPy for computing sequence limits and function maxima.

Source text

SKILL.md · MIT
---
name: compactness
description: "Problem-solving strategies for compactness in topology"
allowed-tools: [Bash, Read]
---

# Compactness

## When to Use

Use this skill when working on compactness problems in topology.

## Decision Tree


1. **Is X compact?**
   - If X subset R^n: Is X closed AND bounded? (Heine-Borel)
   - If X is metric: Does every sequence have convergent subsequence?
   - General: Does every open cover have finite subcover?
   - `z3_solve.py prove "bounded_and_closed"`

2. **Compactness Tests**
   - Heine-Borel (R^n): closed + bounded = compact
   - Sequential: every sequence has convergent subsequence
   - `sympy_compute.py limit "a_n" --var n` to check convergence

3. **Product Spaces**
   - Tychonoff: product of compact spaces is compact
   - Finite products preserve compactness directly

4. **Consequences of Compactness**
   - Continuous image of compact is compact
   - Continuous real function on compact attains max/min
   - `sympy_compute.py maximum "f(x)" --var x --domain "[a,b]"`


## Tool Commands

### Z3_Bounded_Closed
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "bounded_and_closed"
```

### Sympy_Limit
```bash
uv run python -m runtime.harness scripts/sympy_compute.py limit "a_n" --var n --at oo
```

### Sympy_Maximum
```bash
uv run python -m runtime.harness scripts/sympy_compute.py maximum "f(x)" --var x --domain "[a,b]"
```

## Key Techniques

*From indexed textbooks:*

- [Topology (Munkres, James Raymond) (Z-Library)] CompactSpaces163 164ConnectednessandCompactnessCh. Itisnotasnaturalorintuitiveastheformer;somefamiliaritywithitisneededbeforeitsusefulnessbecomesapparent. AcollectionAofsubsetsofaspaceXissaidtocoverX,ortobeacoveringofX,iftheunionoftheelementsofAisequaltoX.
- [Real Analysis (Halsey L. Royden, Patr... (Z-Library)] If X contains more than one point, show that the only possible extreme points of B have norm 1. If X = Lp[a, b], 1 < p < ∞, show that every unit vector in B is an extreme point of B. If X = L∞[a, b], show that the extreme points of B are those functions f ∈ B such that |f | = 1 almost everywhere on [a, b].
- [Topology (Munkres, James Raymond) (Z-Library)] ShowthatinthenitecomplementtopologyonR,everysubspaceiscom-pact. IfRhasthetopologyconsistingofallsetsAsuchthatR−AiseithercountableorallofR,is[0,1]acompactsubspace? ShowthataniteunionofcompactsubspacesofXiscompact.
- [Real Analysis (Halsey L. Royden, Patr... (Z-Library)] The Eberlein-ˇSmulian Theorem . Metrizability of Weak Topologies . X is reexive; (ii) B is weakly compact; (iii) B is weakly sequentially compact.
- [Topology (Munkres, James Raymond) (Z-Library)] SupposethatYiscompactandA={Aα}α∈JisacoveringofYbysetsopeninX. Thenthecollection{Aα∩Y|α∈J}isacoveringofYbysetsopeninY;henceanitesubcollection{Aα1∩Y,. Aαn}isasubcollectionofAthatcoversY.

## Cognitive Tools Reference

See `.claude/skills/math-mode/SKILL.md` for full tool documentation.

© parcadei · MIT · parcadei/Continuous-Claude-v3

Similar skills

All skills for Science and research →

From the same set161

The whole set →
agent-context-isolation agent-context-isolation is a Claude Code skill for routing background-agent results through files. It keeps full agent transcripts out of the main conversation context. CX Codex +1 ★ 3,951repo stars fields A skill for working with fields in abstract algebra. It verifies field axioms, computes minimal polynomials, and solves algebraic equations using Bash and Read tools. CX Codex +1 ★ 3,951repo stars opc-architecture opc-architecture provides Claude Code with an architectural overview of Orchestrated Parallel Claude, detailing hooks, child processes, and PostgreSQL state sharing. CX Codex +1 ★ 3,951repo stars modular-code The modular-code skill guides Python file splits around meaningful boundaries. Use it when a file mixes concerns or has become awkward to navigate and test. CX Codex +1 ★ 3,951repo stars source-coding source-coding — a skill for information theory problems: optimal coding, Shannon entropy, Huffman codes, and data compression. Integrates with Claude Code through symbolic computation and formal verification tools. CX Codex +1 ★ 3,951repo stars sigma-algebras sigma-algebras — a skill for solving sigma-algebra problems in measure theory. CX Codex +1 ★ 3,951repo stars validate-agent Subagent validates technical decisions in a plan against current best practices and past precedent. Run it before implementation to catch outdated approaches and risks. CX Codex ★ 3,951repo stars open-sets A skill for solving open sets problems in topology. Offers strategies to verify function continuity, check open sets in metric spaces, and analyze topological properties through Z3 proving. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open