Skip to main content
skill CX Codex

hilbert-spaces — Claude Code skill: functional analysis theorems

A skill for Claude Code that solves functional analysis problems involving Hilbert spaces. Use it for orthogonal decomposition, projection theorems, Riesz representation, and computations on orthonormal bases.

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

What hilbert-spaces does

The skill automates calculations and proofs needed in functional analysis. It covers five core strategies: orthogonal decomposition of closed subspaces, projection onto convex sets, Riesz representation for linear functionals, Parseval's identity, and Bessel's inequality. Each strategy has a command: sympy_compute.py handles symbolic computation with inner products and coefficient sums, while z3_solve.py proves existence and uniqueness theorems. The skill requires Python and works with Bash for running scripts. It checks orthogonality of vectors, computes functional norms from their representation, or finds the sum of squared expansion coefficients.

What it helps with

  • decompose a vector into components in a subspace and its orthogonal complement
  • prove unique nearest point exists for a closed convex set
  • express a bounded linear functional as an inner product
  • calculate vector norm from coefficients in an orthonormal basis
  • verify Bessel's inequality for a finite set of elements

Example prompts for the agent

  • Compute the norm of a functional with z3_solve.py prove "bounded_linear_functional iff inner_product_form"
  • Expand vector x in an orthonormal basis and verify Parseval's identity using sympy_compute.py sum "abs(<x, e_n>)**2" --var n --from 1 --to oo
  • Show that x - P_M(x) belongs to the orthogonal complement with z3_solve.py prove "x - P_M(x) in M_perp"

How to install hilbert-spaces

1Skills CLI (Vercel)

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

2Manually: put the files in place

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

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

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

Questions about hilbert-spaces

How do I install hilbert-spaces in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill hilbert-spaces -a claude-code, then read the documentation in ~/.claude/skills/hilbert-spaces/SKILL.md.

What does the hilbert-spaces skill do?

It automates proofs and computations in functional analysis: finds projections, computes functional representations, checks orthogonality, and calculates norms from expansion coefficients.

Which tools does the skill use?

Two main tools: sympy_compute.py for symbolic computation with inner products and sums, and z3_solve.py for proving existence and uniqueness theorems.

Source text

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

# Hilbert Spaces

## When to Use

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

## Decision Tree


1. **Orthogonal decomposition**
   - For closed subspace M: H = M + M^perp (direct sum)
   - Every x = P_M(x) + P_{M^perp}(x)
   - `sympy_compute.py simplify "x - projection"`

2. **Projection Theorem**
   - For closed convex C, unique nearest point exists
   - P_C is nonexpansive: ||P_C(x) - P_C(y)|| <= ||x - y||
   - `z3_solve.py prove "projection_exists_unique"`

3. **Riesz Representation**
   - Every f in H* has form f(x) = <x, y_f> for unique y_f
   - ||f|| = ||y_f||
   - `z3_solve.py prove "riesz_representation"`

4. **Parseval's Identity**
   - For orthonormal basis {e_n}: ||x||^2 = sum|<x, e_n>|^2
   - `sympy_compute.py sum "abs(<x, e_n>)**2"`

5. **Bessel's Inequality**
   - sum|<x, e_n>|^2 <= ||x||^2 for any orthonormal set


## Tool Commands

### Sympy_Inner_Product
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "<x + y, z> == <x,z> + <y,z>"
```

### Z3_Projection
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "x - P_M(x) in M_perp"
```

### Z3_Riesz
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "bounded_linear_functional iff inner_product_form"
```

### Sympy_Parseval
```bash
uv run python -m runtime.harness scripts/sympy_compute.py sum "abs(<x, e_n>)**2" --var n --from 1 --to oo
```

## Key Techniques

*From indexed textbooks:*

- [Introductory Functional Analysis with Applications] This proves that A is dense in H, and since A is countable, H is separable. For using Hilbert spaces in applications one must know what total orthonormal set or sets to choose in a specific situation and how to investigate properties of the elements of such sets. For certain function spaces this problem will be considered in the next section, Which 3.
- [Introductory Functional Analysis with Applications] Sx, y) = (Tx, y), we see that Sx = Tx by Lemma 3. SxI + {3SX2, y) Inner Product Spaces. Hilbert Spaces (Space R3) Show that any linear functional f on R3 can be represented by a dot product: (Space f) Show that every bounded linear functional f on 12 can be represented in the fonn f(x) = L gj~ ~ j=1 If z is any fixed element of an inner product space X, show that f(x) = (x, z) defines a bounded linear functional f on X, of norm Ilzll.
- [Introductory Functional Analysis with Applications] HILBERT SPACES In a normed space we can add vectors and mUltiply vectors by scalars, just as in elementary vector algebra. Furthermore, the norm on such a space generalizes the elementary concept of the length of a vector. However, what is still missing in a general normed space, and what we would like to have if possible, is an analogue of the familiar dot product and resulting formulas, notably and the condition for orthogonality (perpendicularity) a· b=O which are important tools in many applications.
- [Introductory Functional Analysis with Applications] Inner product spaces are special normed spaces, as we shall see. Historically they are older than general normed spaces. Their theory is richer and retains many features of Euclidean space, a central concept being orthogonality.
- [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 Science and research →

From the same set161

The whole set →
groups Structures problem-solving in group theory. Activates when the agent needs to verify group axioms, test subgroups, or prove homomorphisms. CX Codex +1 ★ 3,951repo stars agentic-workflow The agentic-workflow skill organizes implementation work into research, planning, validation, coding, and review. Separate agents handle each stage in the background. CX Codex +1 ★ 3,951repo stars graph-algorithms graph-algorithms — a Claude Code skill with a decision tree for graph algorithm problems: traversals, shortest paths, spanning trees, network flow, and spectral analysis. Runs Z3 and SymPy via uv run from inside the agent. CX Codex +1 ★ 3,951repo stars residues A Claude Code skill for solving residue problems in complex analysis. Computes residues at poles, identifies pole order, and applies the residue theorem through SymPy and Z3. CX Codex +1 ★ 3,951repo stars debug-agent debug-agent — a subagent that investigates root causes by exploring the codebase, analyzing logs, finding patterns, and writing a detailed report with fix recommendations. CX Codex ★ 3,951repo stars interpolation Guides Claude Code through selecting and running numerical interpolation workflows, from Lagrange polynomials to SciPy splines. CX Codex +1 ★ 3,951repo stars gradient-methods gradient-methods is a Claude Code skill that helps choose gradient-based optimization methods and step sizes, and diagnose convergence in minimization problems. CX Codex +1 ★ 3,951repo stars aegis aegis is a Claude Code subagent that finds code vulnerabilities and assesses security risks. It checks a supplied threat model and writes its findings to a project file. CX Codex ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open