Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Stone's theorem: unitary groups and self-adjoint generators

Statement

Assume the Axiom of Choice. The map T↦U(t)=eitT, computed by the Borel functional calculus of T (Unbounded Borel functional calculus: domains, products, spectral mapping), is a bijection from the set of self-adjoint operators on H onto the set of strongly continuous one-parameter unitary groups on H. Its inverse assigns to U its generator G and the self-adjoint operator T=−iG; here D(T)=D(G) is exactly the set of vectors at which t↦U(t)x is differentiable at 0, and 1t(U(t)x−x)→iTx for x∈D(T).

Facts & Assumptions

[A1]

For every self-adjoint T, U(t)=eitT is a strongly continuous one-parameter unitary group with generator G=iT and D(G)=D(T) (A self-adjoint operator generates a strongly continuous unitary group).

[A2]

The generator G of a strongly continuous unitary group is densely defined and skew-adjoint, so S:=−iG is self-adjoint with D(S)=D(G) (The generator of a unitary group is closed and skew-adjoint, Infinitesimal generator of a unitary group).

[A3]

If x∈D(G) then U(t)x∈D(G), GU(t)x=U(t)Gx, and t↦U(t)x is differentiable with derivative U(t)Gx (Laplace resolvents of a unitary group, Infinitesimal generator of a unitary group).

[A4]

A skew-symmetric operator G satisfies Re⁡⟨Gw,w⟩=0 for w∈D(G), because ⟨Gw,w⟩=−⟨w,Gw⟩=−⟨Gw,w⟩‾. The generator in [A2] is skew-adjoint and hence skew-symmetric. The generator of a unitary group is closed and skew-adjoint Hilbert space

Proof

technique · direct

Given: A self-adjoint T, and a strongly continuous unitary group U with generator G.

1.1A1

Applying [A1] to T produces a strongly continuous unitary group with generator iT, so the map T↦eitT is well defined, and its derivative at 0 exists exactly on D(T) where it equals iTx.

1.2A1A2

Applying [A2] to U produces the self-adjoint operator S=−iG with D(S)=D(G); applying [A1] to S gives the strongly continuous unitary group V(t)=eitS, whose generator is iS=G.

2.1A2A3A4step 1.2

Uniqueness for a fixed generator: if U,V are strongly continuous unitary groups with the same generator G and x∈D(G), then w(t):=U(t)x−V(t)x is differentiable with w′(t)=Gw(t) by [A3], so ddt∥w(t)∥2=2Re⁡⟨w(t),Gw(t)⟩=0 by [A4], and w(0)=0 gives w≡0 on D(G); since D(G) is dense by [A2] and U(t),V(t) are isometries, U(t)=V(t) for every t.

3.1step 1.1step 1.2step 2.1

Hence U=V in step 1.2, that is U(t)=eitT for the self-adjoint T=S=−iG; combined with step 1.1 this makes T↦eitT a bijection with the stated inverse.

4.1A1step 3.1∎

The derivative characterisation is the one from [A1] applied to the self-adjoint T=−iG: the limit exists exactly on D(T)=D(G) and equals iTx.

Depends on

Used by

Dependency tree · two levels

58 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