hilbert-spaces
Problem-solving strategies for hilbert spaces in functional analysis
Best use case
hilbert-spaces is best used when you need a repeatable AI agent workflow instead of a one-off prompt.
Problem-solving strategies for hilbert spaces in functional analysis
Teams using hilbert-spaces should expect a more consistent output, faster repeated execution, less prompt rewriting.
When to use this skill
- You want a reusable workflow that can be run more than once with consistent structure.
When not to use this skill
- You only need a quick one-off answer and do not need a reusable workflow.
- You cannot install or maintain the underlying files, dependencies, or repository context.
Installation
Claude Code / Cursor / Codex
Manual Installation
- Download SKILL.md from GitHub
- Place it in
.claude/skills/hilbert-spaces/SKILL.mdinside your project - Restart your AI agent — it will auto-discover the skill
How hilbert-spaces Compares
| Feature / Agent | hilbert-spaces | Standard Approach |
|---|---|---|
| Platform Support | Not specified | Limited / Varies |
| Context Awareness | High | Baseline |
| Installation Complexity | Unknown | N/A |
Frequently Asked Questions
What does this skill do?
Problem-solving strategies for hilbert spaces in functional analysis
Where can I find the source code?
You can find the source code on GitHub using the link provided at the top of the page.
SKILL.md Source
# 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.Related Skills
vector-spaces
Problem-solving strategies for vector spaces in linear algebra
banach-spaces
Problem-solving strategies for banach spaces in functional analysis
workflow-router
Goal-based workflow orchestration - routes tasks to specialist agents based on user goals
wiring
Wiring Verification
websocket-patterns
Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.
visual-verdict
Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS/REVISE/FAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.
verification-loop
Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.
vector-db-patterns
Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.
variant-analysis
Find similar vulnerabilities across a codebase after discovering one instance. Uses pattern matching, AST search, Semgrep/CodeQL queries, and manual tracing to propagate findings. Adapted from Trail of Bits. Use after finding a bug to check if the same pattern exists elsewhere.
validate-agent
Validation agent that validates plan tech choices against current best practices
tracing-patterns
OpenTelemetry setup, span context propagation, sampling strategies, Jaeger queries
tour
Friendly onboarding tour of Claude Code capabilities for users asking what it can do.