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

Support of the spectral measure, the spectrum and the values of the scalar law

Statement

Assume the Axiom of Choice and the Axiom of Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)). Let H be a nonzero complex Hilbert space (Hilbert space) and let A be a self-adjoint operator on H with spectral projection-valued measure EA on the Borel σ-algebra of R and spectrum σ(A) (Spectral theorem for unbounded self-adjoint operators (PVM form), Resolvent and spectrum of an unbounded operator). Then:

(a) EA(R∖σ(A))=0, equivalently EA(B)=EA(B∩σ(A)) for every Borel set B⊆R; and EA(U)≠0 for every nonempty relatively open subset U⊆σ(A). Thus the support of EA is exactly σ(A).

(b) For every density operator ρ on H, the scalar law μρA(B)=tr⁡(ρEA(B)) of Density operators and scalar spectral probability clause (b) satisfies μρA(B)=μρA(B∩σ(A))andμρA(σ(A))=1 for every Borel set B: no mass lies outside the spectrum.

(c) More generally, if C⊆R is a Borel set with EA(C)=0, then μρA(C)=0 for every density operator ρ, and if EA(C)=EA(R) then μρA(C)=1.

Facts & Assumptions

Given: The Axiom of Choice and the Axiom of Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)); a nonzero complex Hilbert space H; a self-adjoint operator A with spectral PVM EA and spectrum σ(A); density operators ρ on H.

[F1]

Spectrum from the calculus. The spectrum of f(A) is the essential range {z∈C:EA(f−1(Bε(z)))≠0 for every ε>0} of the Borel function f with respect to EA, and for f(λ)=λ the operator f(A) is A with domain D(A); consequently, for real z, z∈σ(A) if and only if EA((z−ε,z+ε))≠0 for every ε>0 (Unbounded Borel functional calculus: domains, products, spectral mapping, Spectral theorem for unbounded self-adjoint operators (PVM form)).

[F2]

Projection-valued measure. EA takes values in orthogonal projections, EA(∅)=0, EA(R)=I, EA(B∩C)=EA(B)EA(C), and for pairwise disjoint Borel Bn with union B the series ∑nEA(Bn)x converges in norm to EA(B)x for every x (Projection valued measure).

[F3]

Monotonicity and vanishing. If B⊆C then EA(B)=EA(B)EA(C)=EA(C)EA(B) and EA(C)−EA(B)=EA(C∖B) is an orthogonal projection with range orthogonal to the range of EA(B); hence ⟨EA(B)x,x⟩≤⟨EA(C)x,x⟩ for every x. Consequently, if EA(C)=0 then EA(B)=0 for every Borel B⊆C (Projection valued measure, Scalar and complex measures from a pvm).

[F4]

Scalar law. For a density operator ρ and a PVM E the assignment B↦tr⁡(ρE(B)) is a probability measure with tr⁡(ρE(B))=∑nwn∥E(B)un∥2 in every expansion ρ=∑nwnTun,un, wn≥0, ∑nwn=1, (un) orthonormal; in particular E(B)=0 implies tr⁡(ρE(B))=0 and E(B)=I implies tr⁡(ρE(B))=1 (Density operators and scalar spectral probability clauses (a) and (b)).

Proof

1.1givenF1F2algebra

[The spectrum is the essential range of the identity] By [F1] applied to f(λ)=λ, σ(A) is the essential range of the identity with respect to EA. For real z this says: z∈σ(A) if and only if EA((z−ε,z+ε))≠0 for every ε>0; and for non-real z, taking 0<ε<∣Im⁡z∣ gives Bε(z)∩R=∅, where Bε(z):={w∈C:∣w−z∣<ε}, so EA(Bε(z)∩R)=EA(∅)=0 by [F2] and no non-real point lies in the essential range.

2.1givenstep 1.1F2F3F5algebra

[The open null set equals the complement of the spectrum] Let I be the set of pairs of rationals p<q, countable by [F5], and put V:=⋃{(p,q):(p,q)∈I, EA((p,q))=0}, a countable union of Borel sets. To see V⊆R∖σ(A), suppose z∈V∩σ(A); then z∈(p,q) with EA((p,q))=0 for some rationals p<q, and choosing ε>0 with (z−ε,z+ε)⊆(p,q) gives EA((z−ε,z+ε))=0 by [F3], contradicting z∈σ(A) by step 1.1. Conversely, if z∉σ(A), step 1.1 supplies ε>0 with EA((z−ε,z+ε))=0, and by density of the rationals [F5] there are rationals p<z<q with [p,q]⊆(z−ε,z+ε); then EA((p,q))=0 by [F3], so z∈V. Hence V=R∖σ(A).

3.1givenstep 2.1F2F3algebra

[The complement of the spectrum is null] The representation of step 2.1 writes V=R∖σ(A) as a countable union of Borel null sets. Enumerate these sets as (In), repeating ∅ if there are only finitely many, and put C0:=I0 and Cn:=In∖⋃k<nIk for n≥1. The Cn are pairwise disjoint, have union V, and satisfy EA(Cn)=0 by monotonicity [F3]. Strong countable additivity [F2] therefore gives EA(V)x=∑nEA(Cn)x=0 for every x, so EA(V)=0. By additivity [F2], this is equivalent to EA(B)=EA(B∩σ(A))+EA(B∖σ(A))=EA(B∩σ(A)) for every Borel B.

4.1step 1.1step 3.1F2F3algebra

[Nonempty relatively open subsets of the spectrum are not null] Let U⊆σ(A) be nonempty and relatively open, so U=σ(A)∩W for some open W⊆R. Choose z∈U and ε>0 with (z−ε,z+ε)⊆W. By step 1.1, EA((z−ε,z+ε))≠0 because z∈σ(A); by step 3.1 applied to the Borel set (z−ε,z+ε), EA((z−ε,z+ε))=EA((z−ε,z+ε)∩σ(A)), and (z−ε,z+ε)∩σ(A)⊆U by the choice of ε. Were EA(U)=0, monotonicity [F3] would give EA((z−ε,z+ε)∩σ(A))=0, a contradiction; hence EA(U)≠0. This proves clause (a) together with step 3.1.

4.2step 3.1F4algebra

[Clause (b)] By step 3.1 and additivity of EA, EA(B)=EA(B∩σ(A)) for every Borel B; applying the scalar law [F4] to both sides gives μρA(B)=tr⁡(ρEA(B))=tr⁡(ρEA(B∩σ(A)))=μρA(B∩σ(A)), and with B=R this reads μρA(σ(A))=tr⁡(ρEA(R))=tr⁡ρ=1 by [F4].

5.1givenF4algebra∎

[Clause (c)] If EA(C)=0 then tr⁡(ρEA(C))=0 by [F4] for every density operator; if EA(C)=I then tr⁡(ρEA(C))=tr⁡ρ=1 by [F4]. Both statements are instances of the scalar law, and clause (b) is the case C=B∖σ(A) and C=σ(A) respectively.

Depends on

Dependency tree · 2 levels

Sources