hilbert-spaces

hilbert-spaces is a skill for Claude Code from parcadei/Continuous-Claude-v3. It costs 15 tokens per session (1,077 once invoked), scanned A, original, MIT.

A guide to Hilbert spaces, complete spaces of vectors with an inner product that defines angles and lengths. It covers orthogonal decompositions, projections, the Riesz representation theorem, and inequalities for orthonormal sets.

In plain words
What is it for?
Use it to find projections, decompose vectors into perpendicular parts, represent linear functions with inner products, and apply Parseval's identity or Bessel's inequality.
Why use it?
It organizes common proof strategies for approximation, projection, and representation problems in infinite-dimensional spaces.

Skill for Claude Code

Written for Claude Code: allowed-tools in frontmatter. Also seen: reads .claude/ paths.

Good fit Use it to find projections, decompose vectors into perpendicular parts, represent linear functions with inner products, and apply Parseval's identity or Bessel's inequality.

Compare 6 skills from other repositories ↓
Install with agentmods
npx agentmods add skills/parcadei/continuous-claude-v3/hilbert-spaces
About the project

Continuous-Claude-v3 is a Claude Code development environment that preserves working context between sessions, coordinates specialized agents, and stores project knowledge through ledgers, handoffs, and analysis tools. It is for people using Claude Code on ongoing or complex software work. Its catalogue entries are the skills, agents, hooks, plugin, and setting that provide its workflows and orchestration.

parcadei/Continuous-Claude-v3 · 3,937 stars · on GitHub

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

Any agent
npx skills add parcadei/Continuous-Claude-v3 --skill hilbert-spaces
Clone the repo
git clone --depth 1 https://github.com/parcadei/Continuous-Claude-v3

Made for: Claude Code.

Wrote this? Show the measurements

A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.

agentmods badge for hilbert-spaces

README.md
[![agentmods](https://agentmods.dev/badge/skills/parcadei/continuous-claude-v3/hilbert-spaces/github.svg)](https://agentmods.dev/skills/parcadei/continuous-claude-v3/hilbert-spaces)
Your own site
<a href="https://agentmods.dev/skills/parcadei/continuous-claude-v3/hilbert-spaces"><img src="https://agentmods.dev/badge/skills/parcadei/continuous-claude-v3/hilbert-spaces/github.svg" alt="Measured on agentmods" height="20"></a>

Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.

agentmods 80×15 button for hilbert-spaces

Your own site · 80×15
<a href="https://agentmods.dev/skills/parcadei/continuous-claude-v3/hilbert-spaces"><img src="https://agentmods.dev/badge/skills/parcadei/continuous-claude-v3/hilbert-spaces.svg" alt="Reviewed on agentmods" width="80" height="20"></a>
Per session 15 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 1,077 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. A grade says what 26 rules found in the file — not that it is safe. Third-party audits
  • NVIDIA SkillSpector warn 7 Sept 2026
SkillSpector: 1 finding, up to medium

These are SkillSpector’s own severities. On a checked sample its high-severity flags on skills were ~96% false positives — a documented command, a public API, a “never do X” rule — so we show them as a caution to read, not a verdict. Why →

  • medium Agent Snooping · line 73
    Skill enumerates or reads other installed skills. Access to other skills' SKILL.md files or the skills directory reveals prompt instructions, capabilities, and secrets that should be invisible to peer skills.
    Fix: Remove all code or instructions that list or read other skills' files or directories. Skills should operate independently; cross-skill access is a privilege escalation.
How audits are shown
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5.1 $0.00015 $0.01077
Opus 5 $0.00008 $0.00539
Sonnet 5 $0.00003 $0.00215
Haiku 4.5 $0.00002 $0.00108

Measured 6d ago against content hash b5fb94f1442f, method: parsed. Prices are Anthropic first-party input rates as of 2026-09-09, from the pricing page.

Security

Grade A, and why

hilbert-spaces scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 6d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

.claude/skills/math/functional-analysis/hilbert-spaces/SKILL.md · 74 lines

How it starts

The opening of the file, as written. The whole thing — 74 lines — stays where its author put it; the contents beside it link to each section on GitHub.

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

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

Z3_Projection

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

Z3_Riesz

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

Sympy_Parseval

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.

Read the full file on GitHub · 74 lines

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 6d ago First seen · 74 lines · 15 tokens per session scan A b5fb94f1442f

Subscribe to this mod's changes

hilbert-spaces is a skill published in the GitHub repository parcadei/Continuous-Claude-v3 (3,937 stars, last pushed 7mo ago), licensed MIT. It adds 15 tokens to every session and 1,077 once invoked, about $0.0001 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-09-03.

Related

Other skills, from other repositories

tooluniverse-organic-chemistry

Organic chemistry reasoning guide for reaction product prediction, mechanism analysis (electrophilic/nucleophilic substitution, addition, elimination, pericyclic, radical), and spectroscopy interpretation (1H/13C NMR, IR, MS). Reasons from first principles (electron flow, kinetic vs thermodynamic) rather than…

mims-harvard/ToolUniverse · 86 tokens

scaffold-exercises

Scaffold a graded problem set with sections, problems, worked solutions, and short "why this matters" explainers across analytical, empirical, and coding types. Use when user says "make a problem set on X", "scaffold exercises for this lecture", "create practice problems", "generate homework with a solution key"…

pedrohcgs/claude-code-my-workflow · 101 tokens

assess-holistic-health

Conduct temperament-based health assessment from Hildegard von Bingen's Causae et Curae. Evaluates the four temperaments (sanguine, choleric, melancholic, phlegmatic), elemental correspondences (air, fire, earth, water), and provides dietary and lifestyle recommendations for rebalancing. Use when understanding…

pjt222/agent-almanac · 113 tokens

derive-theoretical-result

Derive a theoretical result step-by-step from first principles or established theorems, with every step explicitly justified and special cases checked. Use when deriving a formula or theorem from first principles, proving a mathematical statement by logical deduction, re-deriving a textbook result for verification or…

pjt222/agent-almanac · 86 tokens

analyze-prime-numbers

Analyze prime numbers using primality tests, factorization algorithms, prime distribution analysis, and sieve methods. Covers trial division, Miller-Rabin, Sieve of Eratosthenes, and the Prime Number Theorem. Use when determining whether an integer is prime or composite, finding prime factorizations, counting or…

pjt222/agent-almanac · 91 tokens

construct-geometric-figure

Perform a ruler-and-compass construction with step-by-step justification for each operation, producing a constructible geometric figure from given elements. Covers classical Euclidean constructions including perpendicular bisectors, angle bisectors, parallel lines, regular polygons, and tangent lines. Use when given…

pjt222/agent-almanac · 92 tokens