Skip to main content
skill CX Codex

operator-theory — Claude Code skill: functional analysis problem solving

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.

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 operator-theory -a claude-code
Open on GitHub

What operator-theory does

This skill addresses core operator theory challenges. It covers bounded operator checks via operator norms, adjoint construction, spectral analysis, and compact operator theory. Each task has a dedicated command: z3_solve.py prove for formal reasoning, sympy_compute.py simplify for symbolic manipulation, sympy_compute.py limit for asymptotic analysis.

Inside is a decision tree spanning five main directions with pre-built Bash commands. It runs through uv run python -m runtime.harness with parameters passed directly. To verify a bounded operator, you write z3_solve.py prove "norm(Tx) <= M*norm(x)"; for spectral results, z3_solve.py prove "self_adjoint implies real_spectrum".

Requires Python, the uv dependency installer, and the parcadei/Continuous-Claude-v3 repository checked out locally. The skill uses Bash and Read tools only.

What it helps with

  • verify that an operator is bounded and compute its norm
  • compute the adjoint of a linear operator from an inner product condition
  • prove that the spectrum of a self-adjoint operator is real
  • approximate a compact operator by finite-rank operators
  • construct the spectral decomposition of a self-adjoint compact operator

Example prompts for the agent

  • Verify that operator T is bounded with norm at most M
  • Simplify the adjoint expression for T*
  • Prove that a self-adjoint operator has a real spectrum

How to install operator-theory

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill operator-theory -a claude-code

2Manually: put the files in place

~/.claude/skills/operator-theory/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/operator-theory/

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

Questions about operator-theory

How do I install operator-theory in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill operator-theory -a claude-code, then open ~/.claude/skills/operator-theory/SKILL.md.

What does the operator-theory skill do?

It provides solution strategies for functional analysis: bounded operator checks, adjoint operators, spectral theory, compact operators and their spectra.

What do I need to use this skill?

Python, the uv dependency installer, and a local copy of the parcadei/Continuous-Claude-v3 repository. The skill invokes Z3 and SymPy via Bash commands.

Source text

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

# Operator Theory

## When to Use

Use this skill when working on operator-theory problems in functional analysis.

## Decision Tree


1. **Bounded operator verification**
   - ||Tx|| <= M||x|| for some M
   - Operator norm: ||T|| = sup{||Tx|| : ||x|| = 1}
   - `z3_solve.py prove "operator_bounded"`

2. **Adjoint operator**
   - <Tx, y> = <x, T*y> defines T*
   - For matrices: T* = conjugate transpose
   - `sympy_compute.py simplify "<Tx, y> - <x, T*y>"`

3. **Spectral Theory**
   - Spectrum: sigma(T) = {lambda : T - lambda*I not invertible}
   - Self-adjoint: spectrum is real
   - `z3_solve.py prove "self_adjoint_real_spectrum"`

4. **Compact operators**
   - T compact if T(bounded set) has compact closure
   - Approximable by finite-rank operators
   - `sympy_compute.py limit "||T - T_n||" --var n`

5. **Spectral Theorem**
   - Self-adjoint compact: T = sum(lambda_n * P_n)
   - eigenvalues -> 0, eigenvectors form orthonormal basis


## Tool Commands

### Z3_Bounded_Operator
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "norm(Tx) <= M*norm(x)"
```

### Sympy_Adjoint
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "<Tx, y> - <x, T_star_y>"
```

### Z3_Spectral
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "self_adjoint implies real_spectrum"
```

### Sympy_Compact
```bash
uv run python -m runtime.harness scripts/sympy_compute.py limit "norm(T - T_n)" --var n --at oo
```

## Key Techniques

*From indexed textbooks:*

- [Introductory Functional Analysis with Applications] Spectral theory is one of the main branches of modern functional analysis and its applications. Roughly speaking, it is concerned with certain inverse operators, their general properties and their relations to the original operators. Such inverse operators arise quite naturally in connection with the problem of solving equations (systems of linear algebraic equations, differential equations, integral equations).
- [Introductory Functional Analysis with Applications] Unbounded linear operators in Hilb,ert spaces will be considered in Chap. Brief orientation about main content of Chap. We begin with finite dimensional vector spaces.
- [Introductory Functional Analysis with Applications] Most unbounded linear operators occurring in practical problems are closed or have closed linear extensions (Sec. Unbounded Linear Operators in Hilbert Space The spectrum of a self-adjoint linear operator is real, also in the unbounded case (d. T is obtained by means of the Cayley transform U= (T- iI)(T+ iI)-1 of T (d.
- [Introductory Functional Analysis with Applications] Compact Operators and Their Spectrum is called a degenerate kernel. Here we may assume each of the two sets {ab· . If an equation (1) with such a kernel has a solution x, show that it must be of the form n x(s' = ji(s) + lot L cjaj(s), j~l and the unknown constants must satisfy cj - n lot L ajkCk = Yj' k~l where j= 1,···, n.
- [Introductory Functional Analysis with Applications] As indicated before, our key to the application of complex analysis to spectral theory will be Theorem 7. The theorem states that for every value AoEp(n the resolvent R>. TE B(X, X) on a complex Banach space X has a power series repre- sentation (4) R>.

## 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 →
lebesgue-measure A skill for measure theory tasks focused on Lebesgue measure. Provides decision trees and computational tools to work through outer measure construction, the Carathéodory criterion, and properties of measurable sets. CX Codex +1 ★ 3,951repo stars second-order-odes second-order-odes guides Claude Code through analytical and numerical workflows for solving second-order ordinary differential equations. CX Codex +1 ★ 3,951repo stars 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 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 banach-spaces 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. 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

Project sponsors

Companies that keep this analytics open