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.

Continuous functional calculus under resolvent convergence

Statement

Assume the Axiom of Choice. Let An,A be self-adjoint operators on a complex Hilbert space H and suppose AnA in the strong resolvent sense. Then f(An)xf(A)x for every bounded continuous f:RC and every xH. If AnA in the norm resolvent sense, then f(An)f(A)0 for every bounded continuous f with limt+f(t)=limtf(t). In both cases the conclusion does not depend on the nonreal parameter used in the definition of convergence.

Facts & Assumptions

[A1]

On nonzero complex H, AC supplies the spectral PVM of each self-adjoint S, representing S as the integral of the identity on its squared-integrability domain. The unbounded calculus has the exact product domain D(g(S))D((fg)(S)), and sums and products agree with their pointwise counterparts on their domains (Spectral theorem for unbounded self-adjoint operators (PVM form), Unbounded Borel functional calculus: domains, products, spectral mapping).

[A2]

The bounded PVM calculus is linear, unital, multiplicative and conjugation preserving, satisfies h(S)h and h(S)x2=h2dExS, and ExS(R)=x2. Its Countable Choice assumptions are supplied by AC (Bounded borel pvm integral, Pvm integral is a star homomorphism, Scalar and complex measures from a pvm, The Axiom of Choice).

[A3]

RS(z)=(zIS)1 exists for nonreal z with RS(z)1/Imz. Convergence is initially assumed at one fixed nonreal parameter only (Resolvent of a self-adjoint operator: nonreal resolvents and the estimate, Resolvent and spectrum of an unbounded operator, Norm and strong resolvent convergence).

[A4]

For fixed nonreal z, the linear span of rkrj, k+j1, r(λ)=(λz)1, is uniformly dense in C0(R) (The resolvent star algebra is dense in C_0(R)). Only its function-algebra density assertion is used; parameter independence is proved below.

[A5]

Scalar dominated convergence holds with an integrable majorant (Dominated convergence). Operator norm bounds give BxBx and, by applying this twice, BCBC (A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Proof

technique · direct

Given: AC, the self-adjoint operators and convergence at a fixed nonreal z in the indicated mode.

1.1

If H={0}, all operators, resolvents and bounded functions of them are the unique full-domain operator, so all assertions hold. Suppose H{0}. For nonreal w put qw(λ)=(wλ)1. Both qw and λqw are bounded on the real line. The product-domain rule in [A1] shows that qw(S) maps H into D(S) and (wIS)qw(S)=I on H, while qw(S)(wIS)=I on D(S). Thus qw(S)=RS(w) with the convention of [A3]. The bounded calculus agrees with its unbounded truncation definition because the truncations are eventually the same bounded function.

A1A2A3given
2.1

Put d=zw. The scalar identity (1+dqw)qz=qw=qz(1+dqw) and [A2] give these identities for each single operator S. Define Dn(v)=RAn(v)RA(v) and F=I+dRA(w), which is independent of n. Expanding the product using the preceding identities yields Dn(w)=(I+dRAn(w))Dn(z)F: its two terms are RAn(w)F and (I+dRAn(w))RA(w), whose mixed terms cancel. The left factor has norm at most C=1+d/Imw. Consequently Dn(w)xCDn(z)Fx0 in the strong case, since Fx is fixed, and Dn(w)CDn(z)F0 in the norm case. This proves parameter independence without taking a strong limit on a varying vector.

A2A3A5step 1.1
3.1

In particular convergence holds at z and z, and r(An)=RAn(z), r(An)=RAn(z), with the analogous formulas for A. Both sequences are uniformly bounded. If BnB and CnC strongly and supnBnK, then (BnCnBC)xK(CnC)x+(BnB)Cx0. In the norm case the same inequality with operator norms proves convergence of products when the factors are uniformly bounded. Iteration and finite linear combinations, using [A2], therefore prove convergence for every polynomial in r,r with zero constant term.

A2A3A5step 1.1step 2.1
4.1

Given fC0(R) and δ>0, choose one such polynomial p with fp<δ by [A4]. The bounded calculus gives (f(An)f(A))x2δx+(p(An)p(A))x. For fixed p the last term tends to zero by step 3.1; since δ is arbitrary, strong convergence follows for each x (including x=0 directly). The operator-norm inequality is f(An)f(A)2δ+p(An)p(A), proving the norm version as well.

A2A4A5step 3.1
5.1

In the norm case, if f has a common finite limit L at both ends, then g=fLC0(R). Unital linearity gives f(An)f(A)=g(An)g(A), so step 4.1 proves the assertion.

A2step 4.1
5.2

For the strong case let f be any bounded continuous function and set M=f. For integers m1 define χm(λ)=min(1,max(0,m+1λ)). These are continuous, compactly supported, between zero and one, equal to one on [m,m], and converge pointwise to one. Thus (Iχm(A))x2=1χm2dExA0 by dominated convergence with majorant 1, integrable against the finite measure of mass x2. For fixed m, both χm and fχm belong to C0(R), so their calculi converge strongly by step 4.1.

A2A5step 4.1
6.1

Bounded multiplicativity and linearity give the exact four-term decomposition f(An)f(A)=f(An)(Iχm(A))+f(An)(χm(A)χm(An))+(fχm)(An)(fχm)(A)+f(A)(χm(A)I). Applying it to x, its norm is at most 2M(Iχm(A))x+M(χm(A)χm(An))x+((fχm)(An)(fχm)(A))x. If M=0 the claim is immediate. Otherwise choose m so that the first term is less than half a prescribed positive error, using step 5.2, and then n so that the other two together are less than its other half. This proves strong convergence for bounded continuous f.

A2A5step 5.2
7.1

Step 2.1 proves independence of every nonreal parameter, step 5.1 the norm conclusion and step 6.1 the strong conclusion. AC supplies the spectral and countable-choice calculus hypotheses; the cutoffs are explicit. The zero Hilbert space and zero function have been treated in steps 1.1 and 6.1; no limit at either infinity is required in the strong case.

A1A2A3step 1.1step 2.1step 5.1step 6.1

Source notes

Teschl, Theorem 6.31 and its proof, pp.179-180, gives the polynomial approximation and four-term cutoff route, with Corollary 6.32 giving parameter independence. Here the latter is proved first using a resolvent-difference factorization with a fixed right factor. The library convention is (zIS)1, so r(S)=RS(z). No general continuity of adjoints for strongly convergent bounded operators is assumed.

Depends on

Used by

Dependency tree · two levels

71 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