How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Cayley transform of a self-adjoint operator
Definition
Assume Countable Choice (The Axiom of Countable Choice ()). Let be a self-adjoint operator on . By Resolvent of a self-adjoint operator: nonreal resolvents and the estimate the points lie in , so and are bijections of onto with bounded inverses, and is a bounded everywhere defined operator, the Cayley transform of . In the resolvent convention of Resolvent and spectrum of an unbounded operator one has
Its properties, with proofs. Writing :
- is isometric. For put , so that with ; then , and the symmetry computation of Resolvent of a self-adjoint operator: nonreal resolvents and the estimate gives .
- is unitary, with . Using and the adjoint rule for the self-adjoint one gets ; the elementary resolvent identity then gives , as follows also from applying the computation of item 1 to and to and using that a surjective isometry of onto is unitary (A bounded linear operator between normed spaces). Concretely for by direct substitution, and both sides are continuous.
- , and , as maps on . Indeed is injective with inverse , while for .
- Domain recovery. : by item 3, .
Depends on
- Resolvent of a self-adjoint operator: nonreal resolvents and the estimate
- Range criterion for self-adjointness
- Resolvent and spectrum of an unbounded operator
- Symmetric, self-adjoint and essentially self-adjoint operators
- A bounded linear operator between normed spaces
- Unbounded linear operators: domain, graph and extension
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
28 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Gerald Teschl, Mathematical Methods in Quantum Mechanics, second edition (standard reference, not scraped)
- Theo Buehler and Dietmar A. Salamon, Functional Analysis (standard reference, not scraped)