The generator of a strongly continuous unitary group is densely defined #
For a strongly continuous one-parameter unitary group U, the averages
B_f ψ = ∫ f(τ) U(τ) ψ dτ against smooth compactly supported f lie in the domain of the
generator, and averaging against an approximate identity recovers ψ; so the generator's
domain is dense (blueprint §10.4.4, Lemma lmm:hall-10.18). Averages are written as
convolutions f ⋆ g_ψ with g_ψ(x) = U(-x) ψ, to use Mathlib's convolution calculus.
Main definitions #
average U f ψ— the averageB_f ψ = ∫ f(τ) U(τ) ψ dτ.
Main statements #
average_eq_convolution—U(t) B_f ψ = (f ⋆ g_ψ)(-t).average_mem_generator_domain—B_f ψ ∈ Dom(A)forC¹compactly supportedf.tendsto_average_bump— averages against bumps shrinking to0tend toψ.hasDenseDomain_generator— the generator is densely defined.
The average B_f ψ = ∫ f(τ) U(τ)ψ dτ of the orbit of a vector ψ against a real weight function f.
Averaging the orbit τ ↦ U(τ)ψ against a smooth bump f smooths it in the group parameter: the
average lies in the domain of the generator when f is continuously differentiable with compact
support (average_mem_generator_domain), and it tends to ψ as f concentrates at τ = 0
(tendsto_average_bump). These two facts give density of the generator's domain
(hasDenseDomain_generator). This is the one-parameter case of Gårding's smoothing argument.
Implementation note: the integral is Mathlib's Bochner integral for Lebesgue measure on ℝ,
which is 0 when the integrand is not integrable or H is not complete. The results that use the
average assume U strongly continuous and f a compactly supported C¹ weight or a bump function.
To use Mathlib's convolution calculus, the average is rewritten as a convolution f ⋆ g_ψ with
g_ψ(x) = U(−x)ψ (average_eq_convolution, which holds for every f).
Blueprint: lmm:averaging-translate
Instances For
Averages are convolutions: with g_ψ(x) = U(-x) ψ, U(t) B_f ψ = (f ⋆ g_ψ)(-t); in
particular B_f ψ = (f ⋆ g_ψ)(0). The blueprint takes f continuous with compact support
and U strongly continuous, to make the integrals Bochner integrable; the identity holds for
every f, both sides being Bochner integrals of the same function up to the unitary U(t),
so those hypotheses are omitted.
Blueprint reference: lmm:averaging-translate.
Averages against continuously differentiable compactly supported weights lie in the domain of the generator.
Blueprint reference: lmm:averaging-in-generator-domain.
Averages against an approximate identity recover the vector: if φ i are bump functions at
0 whose outer radii tend to 0 along l, the averages of ψ against their normalisations
tend to ψ. The blueprint's f_n, with outer radius 1/n, is the case l = atTop.
Blueprint reference: lmm:averaging-approximates.
The infinitesimal generator of a strongly continuous one-parameter unitary group has dense domain.
Density is what makes the generator A an unbounded operator in the usual sense
(Unbounded.HasDenseDomain), with a well-defined adjoint A*; the proof of Stone's theorem
uses it to show that A is essentially self-adjoint (isEssentiallySelfAdjoint_generator). The
proof here approximates any ψ by averages B_f ψ of its orbit against narrow bump functions f:
each average lies in Dom(A), and the averages tend to ψ as the bumps shrink to τ = 0.
Implementation note: H is assumed complete, so that the Bochner integrals defining the averages
are not the junk value 0. The bumps are Mathlib's normalised ContDiffBump functions at 0 with
inner radius 1/(2(n + 1)) and outer radius 1/(n + 1), the blueprint's f_n reindexed from 0. The
average in Dom(A) is average_mem_generator_domain, via the derivative of a convolution; the
approximation is tendsto_average_bump, via
ContDiffBump.convolution_tendsto_right_of_continuous.
Blueprint: lmm:hall-10.18