smithery/parcadei

compactness

Problem-solving strategies for compactness in topology

Installation

$ npx skills add smithery/parcadei --skill compactness

Also in this package

Other skills from smithery/parcadei · top by installs.

npx skills add smithery/parcadei

Browse all from smithery/parcadei

More details

Agent compatibility

Declared targets from SKILL.md / docs. Unmarked agents are not listed — the skill may still install via the CLI.

Claude Code Declared
Cursor Not declared
Codex Not declared
GitHub Copilot Not declared
Windsurf Not declared
Gemini CLI Not declared
Cline Not declared
OpenCode Not declared

Skill metadata

Parsed from SKILL.md frontmatter.

Allowed toolsBash, Read
Declared agents claude-code

Package contents

Files included with this skill beyond the listing page.

  • skill md SKILL.md 2,948 B
  • docs SUMMARY.md 73 B

History

  1. First recorded snapshot · 0 installs

SKILL.md

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? - z3solve.py prove "boundedand_closed"

  1. Compactness Tests

- Heine-Borel (R^n): closed + bounded = compact - Sequential: every sequence has convergent subsequence - sympycompute.py limit "an" --var n to check convergence

  1. Product Spaces

- Tychonoff: product of compact spaces is compact - Finite products preserve compactness directly

  1. 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

Z3BoundedClosed

uv run python -m runtime.harness scripts/z3_solve.py prove "bounded_and_closed"

Sympy_Limit

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

Sympy_Maximum

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.