Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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.

CC spectral calculus on a Hilbert space with a fixed countable dense sequence

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with a specified norm-dense sequence (dj)j≥1, with inner product linear in the first argument. Let A be a densely defined self-adjoint operator on H. There is a unique regular projection-valued Borel measure E on R representing A, with E(R)=I, strong countable additivity, and the exact domain and norm identity

D(A)={h:∫Rλ2dμh(λ)<∞},∥Ah∥2=∫λ2dμh,μh(B)=⟨E(B)h,h⟩.

Here regular means that every finite positive scalar measure μh is inner regular by compact sets and outer regular by open sets. Every bounded Borel function b has a uniquely determined bounded operator b(A), with ∥b(A)∥≤sup⁡∣b∣, (bc)(A)=b(A)c(A) and b‾(A)=b(A)∗. Every possibly unbounded complex Borel function b has a closed densely defined multiplication realization with exact domain {h:∫∣b∣2dμh<∞} when b is finite valued; its truncations converge on that domain. In particular eitA is a strongly continuous unitary group and

lim⁡t→0eitAh−ht=iAh⟺h∈D(A).

Regular representing PVMs and this calculus transport under unitary intertwiners. An isometry intertwining the two strongly continuous groups has a reducing closed range and intertwines their PVMs. These conclusions use the specified countable dense sequence and CC, with no general AC spectral theorem, Gelfand representation, Riesz-Markov theorem or Stone existence theorem as a premise.

Facts & Assumptions

Given: CC, H, its specified dense sequence (dj), and A=A∗ with its exact dense domain.

[F1]

The actual Stieltjes supplier Assuming countable choice, a nondecreasing right-continuous function defines a Borel measure on R assumes CC and a finite-real-valued nondecreasing right-continuous function F:R→R, and supplies a Borel measure with μF((a,b])=F(b)−F(a), finite on compact sets. Its Statement does not assert regularity or uniqueness; those needed properties are proved below. The CC use is through its premeasure extension argument.

[F2]

The actual resolvent supplier Resolvent of a self-adjoint operator: nonreal resolvents and the estimate assumes CC and self-adjointness, and proves that A−z is a bijection from D(A) onto H for Im⁡z≠0, with inverse norm at most ∣Im⁡z∣−1, using symmetry, closedness and double orthogonal complement. Denote the inverse of A−z by Qz to avoid the supplier's alternative z−A sign convention.

[F3]

The actual orthogonal-decomposition supplier Orthogonal decomposition by a closed subspace assumes CC and a closed linear subspace of a real or complex Hilbert space, and gives the unique orthogonal decomposition. Its projection is linear and contractive by uniqueness and the Pythagorean identity. All recursive choices below are uniquely specified operations, apart from independent countable choices explicitly permitted by CC.

[F4]

Dominated convergence applies to measurable complex sequences converging almost everywhere with one integrable nonnegative majorant; Fatou's lemma applies to arbitrary nonnegative measurable sequences. Neither assumes arbitrary AC. These are used below with explicitly displayed dominators or nonnegative functions.

Proof

1.1givenconstructalgebra

Finite positive moment approximants: first let U be any unitary on H and fix x∈H. For N≥0 define qN(θ)=∥∑j=0Ne−ijθUjx∥2/(2π(N+1)) for 0≤θ≤2π. These nonnegative continuous densities define finite measures νN on R supported in [0,2π]. Expansion of the squared norm and ⟨Ujx,Ulx⟩=⟨Uj−lx,x⟩ give total mass M=∥x∥2 and ∫einθdνN=(1−∣n∣/(N+1))⟨Unx,x⟩ when ∣n∣≤N, and zero for the other integer Fourier coefficients. This is a finite sum identity and uses no spectral representation.

2.1F1step 1.1constructalgebra

Actual scalar measure existence: enumerate Q=(rj). Write FN(t)=νN((−∞,t]). For each bounded real sequence use the following canonical subsequence operation: start in [0,M] (if M=0 all measures are zero); repeatedly bisect the current closed interval and retain its first half containing infinitely many remaining indices, then choose the least eligible increasing index at each stage. The nested intervals have lengths tending to zero, so the selected values converge. Apply this uniquely specified operation to FN(r1), then to FN(r2) within the previous subsequence, and so forth, and take increasing diagonal indices. The resulting sequence Nj tends to infinity and FNj(q) converges to G(q) for every rational q. Put F(t)=inf⁡q∈Q,q>tG(q). Monotonicity of G gives monotonicity of F; if tn↓t, any rational q>t eventually satisfies q>tn, so F(tn)≤G(q) and hence F(tn)→F(t). Also F(t)=0 for t<0 and F(t)=M for t≥2π. Thus [F1] applies to this bounded finite-valued function and supplies a measure ν; continuity from below applied to expanding intervals shows ν(R)=M and support in [0,2π]. For a continuity point t of F, rational bounds q−<t<q+ show FNj(q−)≤FNj(t)≤FNj(q+); taking limits and then taking rational bounds toward t gives FNj(t)→F(t). Here sup⁡q<tG(q)=F(t−) and inf⁡q>tG(q)=F(t) follow directly from the definition and rational interpolation. A monotone bounded function has at most countably many jumps: the points with jump at least 1/n are finite, because the sum of any finite set of jumps is at most M, and their increasing order provides a canonical enumeration. Consequently finite partitions of an interval containing [0,2π] can have arbitrarily small mesh and only continuity-point interior endpoints; finite choices suffice for each partition, and CC suffices for a sequence of partitions. Upper/lower step bounds and uniform continuity of a continuous test function show ∫g dνNj→∫g dν. In particular the pushforward μx under θ↦eiθ satisfies ∫zndμx=⟨Unx,x⟩ for every integer n. This is a construction from [F1], not an invocation of a measure representation theorem.

3.1F1step 2.1constructalgebra

Regularity and its precise choice cost: every finite Borel measure on a compact metric space X is regular by the following direct argument. For closed C, the open sets {dist⁡(x,C)<1/n} decrease to C, so their measures decrease to μ(C); for open O≠X, the compact sets {dist⁡(x,X∖O)≥1/n} increase to O, so their measures increase to μ(O); O=X uses X itself. Let R be the Borel sets B such that for every ε>0 there are compact C⊆B⊆O open with μ(O∖C)<ε. Closed and open sets are in R, complements exchange the pair (C,O) with (X∖O,X∖C), and countable unions remain in R: choose pairs for each Bj with errors less than ε2−j−2 by CC, use O=⋃Oj, and choose a finite initial union of the Cj whose measure is within ε/2 of the full union, by continuity from below. Thus R contains the Borel sigma-algebra. Apply this first to the restriction of ν to [0,2π] and then to its compact continuous pushforward; pushforward regularity follows by compact images for inner approximation, and complements for outer approximation. The measure μx is therefore regular. The same argument on R uses compact truncation [−n,n] to make the omitted mass small before applying the compact-metric construction. It also applies to every finite measure used subsequently. No unspecified regularity property of [F1] is assumed.

4.1F4step 2.1step 3.1constructalgebra

Fejer approximation and uniqueness: for continuous g on S1 let ΦN(t)=∣∑j=0Neijt∣2/(N+1) and put gN(eiθ)=(2π)−1∫−ππΦN(t)g(ei(θ−t))dt. Finite expansion makes gN a Laurent polynomial; ΦN≥0 and its normalized integral is 1. For δ≤∣t∣≤π, the geometric-series formula gives ΦN(t)≤[(N+1)sin⁡2(δ/2)]−1. Split the convolution at ∣t∣=δ: uniform continuity makes the first contribution to ∣gN−g∣ arbitrarily small, and the displayed bound makes the second uniformly tend to zero. Thus Laurent polynomials are uniformly dense in C(S1). Any two finite regular positive measures with the moments of step 2.1 agree on continuous integrals. They agree on closed sets by dominated convergence applied to gn(z)=max⁡(0,1−ndist⁡(z,C))↓1C. Their compact inner approximations from step 3.1 then give equality on every Borel set. Thus μx is unique; the construction does not select among multiple representing measures. In particular the assignment x↦μx is defined by a unique property, and its use for a countable family requires no additional selection of measures.

5.1F4step 2.1step 3.1step 4.1constructalgebra

Cyclic isometry is onto: for a Laurent polynomial p, the moment identities give ∥p(U)x∥2=∫∣p(z)∣2dμx(z); polarization gives the corresponding inner products. Laurent polynomials are dense in L2(μx), with the density proved as follows. For a Borel B, regularity gives compact C⊆B⊆O with small μx(O∖C); when C is nonempty and O≠S1, the continuous function dist⁡(z,S1∖O)/(dist⁡(z,C)+dist⁡(z,S1∖O)) is 1 on C, 0 outside O, and between 0 and 1, so its squared L2 distance from 1B is at most μx(O∖C). The cases C=∅ or O=S1 use the constants 0 or 1, respectively, with the same error bound. Truncation and quantization of any measurable square-integrable function approximate it by bounded finite simple functions in L2, so continuous functions are dense; step 4.1 then supplies Laurent-polynomial density. For completeness of this L2 space under CC, take a Cauchy sequence and choose the least successive subsequence indices giving norm differences below 2−n, then choose measurable representatives of its countably many classes using CC. Finite triangle inequalities and Fatou [F4] bound the L2 norm of the sum of their absolute differences by ∑n2−n; that sum is finite almost everywhere. The representative series therefore converges almost everywhere, and Fatou on each tail gives L2 convergence with tail norm at most ∑j≥n2−j. Cauchyness gives convergence of the original sequence. Thus the isometry p↦p(U)x extends uniquely to a unitary from L2(μx) onto Kx=span⁡‾{Unx:n∈Z}: choose approximating sequences using CC if necessary, and equality of their distances proves the extension independent of that choice; the range is closed by completeness and dense by definition. It carries multiplication by z to U∣Kx. If x=0, both spaces are zero.

6.1F3step 5.1constructalgebra

Countable cyclic decomposition: set S0={0} and recursively define xj=(I−PSj−1)dj, Kj=Kxj and Sj=Sj−1⊕Kj. Each Sj−1 reduces U: this holds initially, and a cyclic space spanned by all integer powers reduces U and U∗; its orthogonal complement reduces both as well. Thus Kj⊆Sj−1⊥, the sum is orthogonal and closed, and [F3] supplies its uniquely determined projection. Moreover dj∈Sj. The closure of the countable orthogonal sum is therefore all H, since it contains the specified dense sequence. These are unique recursions from fixed data, not relation-following dependent choices. Step 5.1 identifies H with ⨁j≥1L2(μxj) and U with multiplication by z in each block. To verify onto explicitly, decompose h by the block projections: the orthogonal norm sums are bounded by ∥h∥2, their partial sums converge, and the remaining vector is orthogonal to each Kj, hence zero by density. The inverse representation is the convergent orthogonal sum of the unique block inverses.

7.1step 3.1step 4.1step 6.1constructalgebra

Circle PVM and bounded calculus: in the representation of step 6.1 define F(B) blockwise as multiplication by 1B. Then F(S1)=I, F(B)∗=F(B) and F(B)F(C)=F(B∩C). For disjoint Bn, the norm square of the omitted tail on h=(hj) is the corresponding tail of ∑j∫∣hj∣2dμxj, which tends to zero by countable additivity; hence F is strongly countably additive. Its scalar measures are μh(B)=∑j∫B∣hj∣2dμxj, finite positive Borel measures, regular by step 3.1. Define b(U) by block multiplication for bounded Borel b; the norm bound, adjoint and product laws follow by integrating pointwise identities. Also U=∫z dF. Any other regular circle PVM representing U gives scalar moments ⟨Unh,h⟩ for every n∈Z; step 4.1 forces equality of all scalar measures, and complex polarization forces equality of the projection operators on every Borel set. Thus F and the bounded calculus are unique, without an AC spectral supplier.

8.1F2step 7.1constructalgebra

Cayley transform of the actual self-adjoint operator: take U=(A−i)(A+i)−1=I−2iQ−i using [F2]. The adjoint identity Q−i∗=Qi follows from testing ⟨(A+i)x,y⟩=⟨x,(A−i)y⟩ on the respective exact domains and the bijections in [F2]. The resolvent identity Qi−Q−i=2iQiQ−i follows by inserting A+i=(A−i)+2i into the inverse equations, and the same computation shows the resolvents commute. Therefore (I+2iQi)(I−2iQ−i)=I and the reverse product is I, so U is unitary. Also I−U=2iQ−i is injective, and its range is exactly D(A). In the circle representation of step 7.1, ker⁡(I−U) consists precisely of the functions supported on {1}; hence F({1})=0. For z≠1 put λ(z)=i(1+z)/(1−z)∈R. Multiplication by 1−z has range exactly the h for which h/(1−z) has square-summable block L2 norm. Since 1/(1−z)=(λ(z)+i)/(2i), this range is exactly {h:∑j∫λ2∣hj∣2dμxj<∞}. If h=(I−U)g=2iQ−ig, then Ah=2i(I−iQ−i)g=i(I+U)g; in the multiplication representation this says Ah=λh. Thus the inverse Cayley identification proves the exact unbounded domain, rather than merely identifying an extension of A.

9.1step 3.1step 7.1step 8.1constructalgebra

Real PVM and unbounded calculus: transport F under the Borel bijection z↦λ(z) from S1∖{1} to R, defining E(B)=F(λ−1(B)). Step 8.1 proves the representation and exact domain of A, its norm formula and E(R)=I. Strong additivity and the bounded calculus transfer from step 7.1; finite scalar measures are regular on R by the truncation argument in step 3.1. For finite-valued Borel b, define multiplication on the exact square-integrability domain; truncations 1∣b∣≤nh prove density of the domain. To prove closedness, if hn→h and bhn→g in the representation, restrict to {∣b∣≤N}: bounded multiplication gives 1∣b∣≤Ng=b1∣b∣≤Nh. Increasing N shows g=bh a.e., and g∈L2 gives h in the domain. Dominated convergence proves the stated truncation convergence. Uniqueness of a regular PVM representing A follows by inverse Cayley transport: its multiplication realization of A with the prescribed domain makes (A−i)(A+i)−1 multiplication by (λ−i)/(λ+i), so it gives a regular circle PVM representing the same U (regularity also follows directly for its finite scalar measures). Step 7.1 gives equality there, and inverse transport gives equality on R.

10.1F4step 8.1step 9.1algebra

Strong groups and exact generator: define eitA by multiplication by eitλ. The group law and unitarity are pointwise; dominated convergence with bound 4∣hj∣2, summed over the blocks, proves strong continuity. If h∈D(A), then ∣(eitλ−1)/t∣≤∣λ∣ and pointwise convergence to iλ give norm convergence of the difference quotient by dominated convergence against the finite weighted norm measure. Conversely, existence of the strong derivative makes the difference quotients at t=1/n norm bounded. Fatou applied to their squared pointwise limits gives ∑j∫λ2∣hj∣2dμxj<∞, exactly h∈D(A) by step 8.1; its derivative is then iAh. This proves the group and its precise generator without a Stone existence theorem.

11.1F2F3step 7.1step 9.1step 10.1algebra∎

Transport and isometric group intertwiners: if a unitary W intertwines the self-adjoint operators including their domains, it intertwines both nonreal inverses, hence their Cayley unitaries; the transported circle PVM is a regular representing PVM, so uniqueness in step 7.1, followed by step 9.1, gives EB(C)W=WEA(C) and transport of every multiplier with its exact domain. More generally, let an isometry W intertwine the two groups for every real t. Its closed range M is invariant under the target group and its inverse, so M and M⊥ reduce the group. The projection PM commutes with the group; taking difference quotients and using step 10.1 shows PMD(B)⊆D(B) and BPM=PMB there, so it commutes with the resolvents by their inverse equations. Thus M reduces B and its restriction is self-adjoint: its nonreal inverses are the restricted full inverses, or equivalently it is the block restriction of step 9.1. Difference quotients also identify that restriction with WAW∗ on exactly WD(A), using both directions of step 10.1. The range has dense sequence (Wdj); apply uniqueness to this restriction to obtain EB(C)W=WEA(C) and the asserted calculus transport. All conclusions of the Statement follow.

Depends on

Dependency tree · 2 levels

Sources