Skip to content
Back to skills

Compactness

ASecurity

Problem-solving strategies for compactness in topology

  • 3,935 stars
  • 0 votes
  • 0 copies
  • 0 views
  • Added February 7, 2026
researchpythongobashdocumentation

Security analysis

A100/100

Scanned February 12, 2026

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

Installs into .claude/skills of the current project.

Are you the author of Compactness?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for Compactness
[![Security: A — Skills Directory](https://www.skillsdirectory.com/api/skills/parcadei-compactness/badge)](https://www.skillsdirectory.com/skills/parcadei-compactness)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
---
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.

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…