operator-theory
npx machina-cli add skill parcadei/Continuous-Claude-v3/operator-theory --openclawOperator Theory
When to Use
Use this skill when working on operator-theory problems in functional analysis.
Decision Tree
-
Bounded operator verification
- ||Tx|| <= M||x|| for some M
- Operator norm: ||T|| = sup{||Tx|| : ||x|| = 1}
z3_solve.py prove "operator_bounded"
-
Adjoint operator
- <Tx, y> = <x, Ty> defines T
- For matrices: T* = conjugate transpose
sympy_compute.py simplify "<Tx, y> - <x, T*y>"
-
Spectral Theory
- Spectrum: sigma(T) = {lambda : T - lambda*I not invertible}
- Self-adjoint: spectrum is real
z3_solve.py prove "self_adjoint_real_spectrum"
-
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
-
Spectral Theorem
- Self-adjoint compact: T = sum(lambda_n * P_n)
- eigenvalues -> 0, eigenvectors form orthonormal basis
Tool Commands
Z3_Bounded_Operator
uv run python -m runtime.harness scripts/z3_solve.py prove "norm(Tx) <= M*norm(x)"
Sympy_Adjoint
uv run python -m runtime.harness scripts/sympy_compute.py simplify "<Tx, y> - <x, T_star_y>"
Z3_Spectral
uv run python -m runtime.harness scripts/z3_solve.py prove "self_adjoint implies real_spectrum"
Sympy_Compact
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' kl 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.
Source
git clone https://github.com/parcadei/Continuous-Claude-v3/blob/main/.claude/skills/math/functional-analysis/operator-theory/SKILL.mdView on GitHub Overview
This skill provides practical strategies for solving operator-theory problems in functional analysis. It covers bounded operators, adjoints, spectra, compact operators, and the spectral theorem, with concrete steps and example commands.
How This Skill Works
Follow a decision-tree workflow: verify boundedness and compute the operator norm, determine the adjoint, analyze the spectrum (especially for self-adjoint operators), study compact operators via finite-rank approximations, and apply the spectral theorem for decompositions. Technical steps leverage norm inequalities, inner products, spectrum definitions, and operator decompositions, using dedicated tool scripts to verify properties.
When to Use It
- When you need to confirm an operator is bounded and compute ||T||
- When you must verify the adjoint relationship <Tx, y> = <x, T*y> and identify T*
- When exploring spectral properties and real spectra for self-adjoint operators
- When studying compact operators and approximating them by finite-rank operators
- When applying the spectral theorem to self-adjoint or compact operators to obtain a decomposition
Quick Start
- Step 1: Identify whether T is bounded by verifying ||Tx|| <= M||x|| and compute ||T||
- Step 2: Determine the adjoint using the inner-product relation, and if needed, use T* = conjugate transpose for matrices
- Step 3: Analyze the spectrum and, if applicable, apply the spectral theorem for decomposition
Best Practices
- Check boundedness first: establish ||Tx|| <= M||x|| and determine the operator norm ||T||
- Use the adjoint relation to derive T* and, for matrices, use the conjugate transpose as needed
- Analyze the spectrum sigma(T) and verify real spectrum for self-adjoint operators
- If compact, exploit approximation by finite-rank operators and consider norm ||T - T_n||
- Apply the spectral theorem to obtain T = sum lambda_n P_n with eigenvalues tending to 0 and ONB of eigenvectors
Example Use Cases
- Determine if a differential or integral operator is bounded on a given function space and compute its norm
- Compute the adjoint of a linear operator and verify the inner-product relation
- Check the spectrum of a self-adjoint operator and confirm it lies on the real axis
- Approximate a compact operator by finite-rank operators and compare convergence of norms
- Diagonalize a self-adjoint compact operator using the spectral theorem to obtain an orthonormal basis