Get the FREE Ultimate OpenClaw Setup Guide →

hilbert-spaces

npx machina-cli add skill parcadei/Continuous-Claude-v3/hilbert-spaces --openclaw
Files (1)
SKILL.md
3.9 KB

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.

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.

Source

git clone https://github.com/parcadei/Continuous-Claude-v3/blob/main/.claude/skills/math/functional-analysis/hilbert-spaces/SKILL.mdView on GitHub

Overview

Provides practical strategies for tackling problems in Hilbert spaces within functional analysis. It highlights a decision-tree approach centered on orthogonal decomposition, projection, Riesz representation, Parseval's identity, and Bessel's inequality, and shows how to translate ideas into concrete computations.

How This Skill Works

Identify the problem type (subspace M, closed convex set C, or an orthonormal basis). Apply the corresponding theory to obtain projections, representations, or coefficient relations, and verify results with symbolic tools. The workflow yields decompositions, nearest-point guarantees, and norm identities in a reproducible way.

When to Use It

  • Decomposing a vector x relative to a closed subspace M: express x as P_M(x) + P_{M^⊥}(x).
  • Finding the unique nearest point to x in a closed convex set C using the projection theorem, with P_C nonexpansive.
  • Representing a bounded linear functional via the Riesz representation theorem in a Hilbert space.
  • Computing norms or coefficients using Parseval's identity with an orthonormal basis {e_n}.
  • Bounding sums of squared coefficients with Bessel's inequality for any orthonormal set.

Quick Start

  1. Step 1: Identify the Hilbert space H and the relevant subspace M or closed convex set C, or an available orthonormal basis.
  2. Step 2: Choose the technique from the decision tree (orthogonal decomposition, projection, Riesz, Parseval, or Bessel) and set up the computation.
  3. Step 3: Run the relevant tool commands to verify or compute results: use Sympy_Inner_Product to test inner products, Z3_Projection to prove projection properties, Z3_Riesz to verify the functional form, and Sympy_Parseval to compute Parseval sums.

Best Practices

  • Compute the projections P_M(x) and P_{M^⊥}(x) to obtain the orthogonal decomposition when a subspace is involved.
  • Use the projection theorem to justify existence of a nearest point to x in closed convex sets and rely on nonexpansiveness for stability.
  • Apply the Riesz representation to convert bounded functionals into inner products with a unique y_f and ensure ||f|| = ||y_f||.
  • For Parseval, verify coefficients with an ONB to recover or bound norms via the sum of squares.
  • Use Bessel's inequality as a quick check for convergence or energy bounds when only part of an orthonormal set is used.

Example Use Cases

  • Decomposing a signal in L2 to separate components using orthogonal subspaces.
  • Computing Fourier coefficients and applying Parseval to relate signal energy to coefficient sums.
  • Solving nearest-point problems in convex optimization via projections onto closed convex sets.
  • Projecting quantum states onto subspaces corresponding to observable measurements.
  • Estimating FEM error and guiding adaptive approximations using subspace projections and energy bounds.

Frequently Asked Questions

Add this skill to your agents
Sponsor this space

Reach thousands of developers