FreeSlides
Slide deck with story arc and timing
- 499499 downloads
- 205205 likes
- 225225 saves
- Claude Code
- Codex
- Cursor
- and 3 more
Every premium and members-only resource for $9.99/month, as a no-commitment subscription. See the plans
Use this resource to prove that a set is compact in topology
New
Free
In a terminal, from the folder you want:
npx --yes palatekit@latest install topology-compactness-proofsWith no option, the skill goes to ~/.agents/skills/; add --agent claude-code (or codex, cursor…) to target an agent.
First time: connect the CLI with
npx --yes palatekit@latest loginThe agent steers the compactness proof toward Heine-Borel, the sequential criterion or Tychonoff's theorem for products, then checks bounds and limits with SymPy and Z3. You get a structured proof.
Mostly picked by
Updated November 2, 2026
You say
“Prove that the interval [0,1] is compact.”

Skill published by parcadei under the MIT license, delivered in its original version.
Listed unmodified
« compactness » (parcadei, MIT) livré dans sa version d'origine : fiche en français et en anglais par PalateKit.
–
No ratings yet
Loading reviews…