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.

Unbounded Borel functional calculus: domains, products, spectral mapping

Statement

Assume the Axiom of Choice. Let T be a self-adjoint operator with spectral projection valued measure E on R acting on a complex Hilbert space H (Spectral theorem for unbounded self-adjoint operators (PVM form)) and let f,g:R→C be Borel. Write u(T)=u(E), with the truncation definition below. If H={0}, use its unique PVM and unique full-domain operator directly. Then:

  1. f(T)∗=f‾(T);
  2. f(T)g(T) has domain D(g(T))∩D((fg)(T)) and equals the restriction of (fg)(T) to that domain, and its closure is (fg)(T);
  3. on D(f(T))∩D(g(T)) the sum f(T)+g(T) equals the restriction of (f+g)(T), and the closure of f(T)+g(T) is (f+g)(T);
  4. the spectrum of f(T) is the essential range {z∈C:E(f−1(Bε(z)))≠0 for every ε>0} of f with respect to E;
  5. if f is continuous then that essential range is the closure of f(σ(T)), with the closure redundant when f(σ(T)) is closed.

Facts & Assumptions

[A1]

For every finite-valued measurable u, u(E) has domain Du={x:∫∣u∣2 dEx<∞}, is densely defined and closed, and satisfies ∥u(E)x∥2=∫∣u∣2 dEx and u(E)∗=u‾(E). It is the norm limit of um(E)x, where um=u1{∣u∣≤m}. Bounded approximants dominated by C∣u∣ and converging pointwise to u converge on Du (The unbounded PVM integral is densely defined, closed and normal, Integral of a measurable function against a projection-valued measure).

[A2]

On nonzero H the bounded measurable PVM calculus is linear, unital, multiplicative and adjoint preserving, and ∥h(E)x∥2=∫∣h∣2 dEx. The scalar measure Ex is finite with total mass ∥x∥2 (Bounded borel pvm integral, Pvm integral is a star homomorphism, Scalar and complex measures from a pvm).

[A3]

Dominated convergence holds for an integrable majorant, and monotone convergence holds for increasing nonnegative measurable functions (Dominated convergence, Monotone convergence for the integral).

[A4]

A spectral PVM represents T as the integral of the identity function with its exact squared-integrability domain; the cited spectral theorem assumes nonzero H and AC (Spectral theorem for unbounded self-adjoint operators (PVM form), The Axiom of Choice). The resolvent convention is (zI−S)−1, required bounded and everywhere defined (Resolvent and spectrum of an unbounded operator).

[A5]

E(B∩C)=E(B)E(C), projection values are contractive, and E is strongly countably additive with E(R)=I (Projection valued measure). Rational intervals form a countable base of R, by countability and density of the rationals (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

Proof

technique · direct

Given: The self-adjoint operator and spectral PVM in the statement, under AC.

1.1A1A2A4A5

For H={0} all integrals are the unique full-domain operator by [A1]. Sums, products, adjoints and closures are that operator; its resolvent is all C and its spectrum is empty. Every spectral projection is zero, so every essential range here is empty, as is f(σ(T)). Thus all claims hold. Henceforth H≠{0}, and all bounded calculus uses have the hypothesis required by [A2].

1.2A1A2A3A5

For bounded Borel h and arbitrary x∈H, bounded multiplication gives E(B)h(E)=(1Bh)(E), so Eh(E)x(B)=∫B∣h∣2 dEx. For x∈Dg, truncate g: norm convergence and boundedness of E(B) give Eg(E)x(B)=lim⁡mEgm(E)x(B)=∫B∣g∣2 dEx by monotone convergence. Hence dEg(E)x=∣g∣2dEx, including when g is unbounded.

1.3A1A2A3

We will also use a dominated approximation with a general square-integrable majorant. Fix x∈Du and bounded Borel h. Comparing with um using [A2] and then passing m→∞ gives ∥h(E)x−u(E)x∥2=∫∣h−u∣2 dEx; the scalar limit is dominated by 2∥h∥∞2+2∣u∣2. Therefore if bounded hn→u pointwise and ∣hn∣≤G with ∫G2 dEx<∞, then u is square integrable and hn(E)x→u(E)x, by dominated convergence with ∣hn−u∣2≤4G2.

2.1A1A2step 1.3

For x∈Df∩Dg, x∈Df+g since ∣f+g∣2≤2∣f∣2+2∣g∣2. Bounded linearity and step 1.3 applied to fm+gm with G=∣f∣+∣g∣ show f(E)x+g(E)x=(f+g)(E)x. In particular Du−z=Du and (u−z)(E)=u(E)−zI, since constants are integrable against finite Ex.

2.2A1A2step 1.2

If h is bounded and x∈Dg, step 1.2 shows h(E)x∈Dg, while x∈Dhg. The bounded identities h(E)gm(E)x=gm(E)h(E)x=(hgm)(E)x pass to limits: the last uses [A1] with target hg since ∣hgm∣≤∣hg∣. Thus h(E)g(E)x=g(E)h(E)x=(hg)(E)x for x∈Dg.

3.1A1A2A3A5step 1.2step 2.2

The definition of composition and step 1.2 yield D(f(E)g(E))=Dg∩Dfg. For x in that domain, step 2.2 gives fm(E)g(E)x=(fmg)(E)x. The left side tends to f(E)g(E)x by [A1]. To control the right side without pretending fmg bounded, note that (fmg)(E)x=E({∣f∣≤m})(fg)(E)x: apply step 2.2 with g there replaced by fg and the bounded indicator. The projections converge strongly to I, since their complementary squared norms are integrals of decreasing indicators against finite scalar measures. Hence the right side tends to (fg)(E)x, proving the product value.

3.2A1A2A3A5step 1.2step 2.1

For x∈Df+g use xm=E({∣f∣≤m,∣g∣≤m})x. Step 1.2 shows xm∈Df∩Dg, and gives xm→x and ∥(f+g)(E)(xm−x)∥2=∫{∣f∣>m}∪{∣g∣>m}∣f+g∣2 dEx→0. Step 2.1 and closedness in [A1] prove the sum closure. These cutoff ranges also show the sum domain dense.

4.1A1A2A3A5step 1.2step 3.1

For x∈Dfg put xm=E({∣g∣≤m})x. Step 1.2 shows xm∈Dg∩Dfg. The same step and dominated convergence give xm→x and ∥(fg)(E)(xm−x)∥2=∫{∣g∣>m}∣fg∣2 dEx→0. Thus every point of the graph of (fg)(E) is a limit of graph points of f(E)g(E). The reverse graph inclusion follows from step 3.1 and closedness in [A1], proving the product closure. The composition domain is dense as well: the ranges of E({∣f∣≤m,∣g∣≤m}), contained in that domain, approximate every vector by the same indicator estimate.

4.2A1A2A4step 2.1step 2.2step 3.1

Suppose E({∣f−z∣<ε})=0 for some ε>0. Define the Borel function w piecewise: w(λ)=1/(z−f(λ)) when ∣f(λ)−z∣≥ε, and w(λ)=0 otherwise. It is bounded by 1/ε, and (z−f)w=1 off an E-null set. By the domain and value identities of step 3.1, (z−f)(E)w(E) has domain all H and equals I; w(E)(z−f)(E) has domain Dz−f and equals the identity there. Null-set invariance is supplied by [A1]. By step 2.1, Dz−f=Df and (z−f)(E)=zI−f(E) (linearity with constants, or multiplication by −1 in step 2.2). Thus w(E) is its bounded inverse and z∈ρ(f(E)) in the convention of [A4]. Only the inverse is asserted bounded.

5.1A1A4A5step 2.1step 4.2

Conversely suppose E({∣f−z∣<ε})≠0 for every ε>0. Using AC in [A4], choose unit xn in the range of E({∣f−z∣<1/n}) for each n≥1. The scalar measure of xn is supported there by [A5], and ∣f∣≤∣z∣+1/n there, so xn∈Df. Hence ∥(zI−f(E))xn∥2=∫∣z−f∣2 dExn≤1/n2 by [A1] and step 2.1. A bounded inverse with bound C would give 1≤C/n for every n, impossible. This proves the essential-range formula.

6.1A4A5step 4.2step 5.1

Apply steps 4.2 and 5.1 to u(λ)=λ, which represents T by [A4]. Nonreal z have a ball disjoint from R, so σ(T)⊆R; for real λ, membership in σ(T) is equivalent to every interval about λ having nonzero projection. The union U of all rational intervals with zero projection is exactly R∖σ(T), by the rational base in [A5] and projection monotonicity from E(B∩C)=E(B)E(C). Enumerate pairs of a fixed rational enumeration by increasing sums of their indices, giving an enumeration of rational intervals. In that enumeration retain such intervals and replace the rest by the empty set. Disjointify this sequence by subtracting previous intervals. Each resulting set has zero projection, and their union is U, so strong countable additivity gives E(U)=0. In particular U is open and measurable.

7.1A1A5step 3.1step 4.1step 3.2step 4.2step 5.1step 6.1∎

Let f be continuous. If z∉f(σ(T))‾, a ball about z has preimage contained in U of step 6.1, so that preimage has zero projection. Conversely, for z∈f(σ(T))‾ and ε>0, choose λ∈σ(T) with ∣f(λ)−z∣<ε/2. Continuity supplies an interval about λ whose image lies in Bε(z); its projection is nonzero by step 6.1, so the whole preimage has nonzero projection. This proves the continuous spectral-mapping formula. The adjoint identity is [A1], and steps 3.1, 4.1, 3.2, 4.2 and 5.1 prove the remaining claims.

Depends on

Used by

Dependency tree · two levels

100 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