Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedaudited 2026-09-22
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 (ACω)). Let T be a self-adjoint operator on H. By Resolvent of a self-adjoint operator: nonreal resolvents and the estimate the points ±i lie in ρ(T), so T+i and T−i are bijections of D(T) onto H with bounded inverses, and CT:=(T−i)(T+i)−1∈B(H) is a bounded everywhere defined operator, the Cayley transform of T. In the resolvent convention RT(z)=(z−T)−1 of Resolvent and spectrum of an unbounded operator one has (T+i)−1=−RT(−i),CT=I+2iRT(−i)=I−2i(T+i)−1.

Its properties, with proofs. Writing C:=CT:

  1. C is isometric. For x∈H put y:=(T+i)−1x, so that x=(T+i)y with y∈D(T); then Cx=(T−i)y, and the symmetry computation ∥(T∓i)y∥2=∥Ty∥2+∥y∥2 of Resolvent of a self-adjoint operator: nonreal resolvents and the estimate gives ∥Cx∥=∥x∥.
  2. C is unitary, with C−1=C∗=(T+i)(T−i)−1. Using C=I−2i(T+i)−1 and the adjoint rule ((T+i)−1)∗=((T+i)∗)−1=(T−i)−1 for the self-adjoint T one gets C∗=I+2i(T−i)−1=(T+i)(T−i)−1; the elementary resolvent identity then gives C∗C=CC∗=I, as follows also from applying the computation of item 1 to C and to C∗ and using that a surjective isometry of H onto H is unitary (A bounded linear operator between normed spaces). Concretely C∗Cx=x for x∈D(T) by direct substitution, and both sides are continuous.
  3. ker⁡(I−C)={0}, and I−C=2i(T+i)−1, I+C=2T(T+i)−1 as maps on H. Indeed I−C=2i(T+i)−1 is injective with inverse (2i)−1(T+i), while (I+C)(T+i)x=(T+i)x+(T−i)x=2Tx for x∈D(T).
  4. Domain recovery. ran⁡(I−C)=D(T): by item 3, ran⁡(I−C)=ran⁡(2i(T+i)−1)=D(T).

Depends on

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