Skip to main content
skill CX Codex

banach-spaces — Claude Code skill: functional analysis theorems

A skill for Claude Code that tackles problems in functional analysis involving Banach spaces. Includes strategies for proving key theorems: completeness, Hahn-Banach, open mapping, closed graph, and uniform boundedness principle.

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 banach-spaces -a claude-code
Open on GitHub

What banach-spaces does

The skill operates within Claude Code and structures the approach to analyzing Banach spaces. The core tool is z3_solve.py, which automates proofs of completeness, existence of extensions for linear functionals, and related results. A companion tool, sympy_compute.py, simplifies norms in normed vector spaces.

Workflow covers two categories: verifying that a space is Banach (confirming every Cauchy sequence converges) and applying five central functional analysis theorems. Each theorem maps to a Z3 command for automated proof generation.

Requires Python, Z3, and SymPy libraries. Installation runs through uv and npx skills.

What it helps with

  • verify completeness of a normed vector space
  • prove existence of a bounded linear functional extension
  • derive bounded inverse from surjective bounded operator
  • establish operator boundedness via closed graph property
  • simplify norm of a vector linear combination

Example prompts for the agent

  • Prove every Cauchy sequence in space X converges using z3_solve.py prove "cauchy_sequence implies convergent"
  • Check that a surjective bounded operator T: X → Y is open: uv run python -m runtime.harness scripts/z3_solve.py prove "T_surjective_bounded implies T_open"
  • Simplify the norm alpha*x + beta*y via uv run python -m runtime.harness scripts/sympy_compute.py simplify "norm(alpha*x + beta*y)"

How to install banach-spaces

1Skills CLI (Vercel)

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

2Manually: put the files in place

~/.claude/skills/banach-spaces/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/banach-spaces/

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

Questions about banach-spaces

How do I install banach-spaces in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill banach-spaces -a claude-code, then open ~/.claude/skills/banach-spaces/SKILL.md to access the skill documentation.

What does banach-spaces do?

The skill provides tools for Banach space problems in functional analysis: checking completeness, proving theorems of Hahn-Banach, open mapping, closed graph, and uniform boundedness via Z3 commands.

What dependencies does banach-spaces need?

Python, Z3, and SymPy libraries. The skill uses uv for environment management and npx skills for installation. Permitted tools are Bash and Read.

Source text

SKILL.md · MIT
---
name: banach-spaces
description: "Problem-solving strategies for banach spaces in functional analysis"
allowed-tools: [Bash, Read]
---

# Banach Spaces

## When to Use

Use this skill when working on banach-spaces problems in functional analysis.

## Decision Tree


1. **Verify Banach space**
   - Complete normed vector space
   - Check: every Cauchy sequence converges
   - `z3_solve.py prove "completeness"`

2. **Hahn-Banach Theorem**
   - Extend bounded linear functionals
   - Separate convex sets
   - `z3_solve.py prove "extension_exists"`

3. **Open Mapping Theorem**
   - Surjective bounded operator between Banach spaces is open
   - Consequence: bounded inverse exists
   - `z3_solve.py prove "open_mapping"`

4. **Closed Graph Theorem**
   - T: X -> Y has closed graph implies T bounded
   - Strategy: verify graph closure, conclude boundedness
   - `z3_solve.py prove "closed_graph_implies_bounded"`

5. **Uniform Boundedness Principle**
   - Pointwise bounded family of operators is uniformly bounded
   - Application: prove operator families are bounded


## Tool Commands

### Z3_Completeness
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "cauchy_sequence implies convergent"
```

### Z3_Open_Mapping
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "T_surjective_bounded implies T_open"
```

### Z3_Closed_Graph
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "graph_closed implies T_bounded"
```

### Sympy_Norm
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "norm(alpha*x + beta*y)"
```

## Key Techniques

*From indexed textbooks:*

- [Introductory Functional Analysis with Applications] If (X, d) is a pseudometric space, we call a set B(xo; r) = {x E X I d(x, xo) < r} an open ball in X with center Xo and radius r. Note that this is analogous to 1. What are open balls of radius 1 in Prob.
- [Measure, Integration  Real Analysis (... (Z-Library)] Section 5C Lebesgue Integration on Rn 11 Suppose E is a subset of Rm Rn and Rm : (x, y) x E for some y . Dene f : R2 R by = (0, 0), (a) Prove that D1(D2 f ) and D2(D1 f ) exist everywhere on R2. Show that D1(D2 f ) (c) Explain why (b) does not violate 5.
- [Real Analysis (Halsey L. Royden, Patr... (Z-Library)] The Hahn-Banach Theorem has a rather humble nature. The only mathematical con- cepts needed for its statement are linear spaces and linear, subadditive, and positively homogeneous functionals. Besides Zorn’s Lemma, its proof relies on nothing more than the rudimentary properties of the real numbers.
- [Introductory Functional Analysis with Applications] If in a normed space X, absolute convergence of any series always implies convergence of that series, show that X is complete. Show that in a Banach space, an absolutely convergent series is convergent. Schauder basis) Show that if a normed space has a Schauder basis, it is separable.
- [Introductory Functional Analysis with Applications] What are the adjoints of a zero operator 0 and an identity operator I? Annihllator) Let X and Y be normed spaces, T: X - Y a bounded linear operator and -M = (¥t( T), the closure of the range of T. Fundamental Theorems for Normed and Banach Spaces To complete this discussion, we should also list some of the main differences between the adjoint operator T X of T: X ~ Y and the Hilbert-adjoint operator T* of T: Hi ~ H 2 , where X, Yare normed spaces and Hi> H2 are Hilbert spaces.

## 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 AI and ML →

From the same set161

The whole set →
math-model-selector The math-model-selector skill helps identify a mathematical framework when you have a problem but aren’t sure how to formalize it. Use it to choose a direction before working through the calculations. CX Codex +1 ★ 3,951repo stars first-order-odes first-order-odes — a skill for classifying and solving first-order differential equations. Guides you through equation type detection, selects a solution method, and provides commands for both analytical and numerical solving. CX Codex +1 ★ 3,951repo stars operator-theory operator-theory — a skill for Claude Code with strategies for functional analysis: bounded operator verification, spectral theory, compact operators. Runs Z3 and SymPy for proofs and computations. CX Codex +1 ★ 3,951repo stars root-finding root-finding is a Claude Code skill that selects a numerical method for finding equation or system roots based on available derivatives and a known interval. CX Codex +1 ★ 3,951repo stars contour-integrals contour-integrals — a Claude Code skill for solving contour integral problems in complex analysis. It guides you through choosing the right contour, locating poles, and applying the residue theorem to evaluate definite integrals. CX Codex +1 ★ 3,951repo stars arbiter arbiter runs unit and integration tests, investigates failures, and checks an implementation against acceptance criteria. Saves its report in the project. CX Codex ★ 3,951repo stars convex-optimization Skill for tackling convex optimization problems. Includes convexity verification, problem classification, and solution methods based on KKT conditions. CX Codex +1 ★ 3,951repo stars connectedness A skill for Claude Code with strategies for connectedness problems in topology. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open