Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)
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.

The Fock number operator has its sector counting PVM

Statement

Assume Countable Choice The Axiom of Countable Choice (ACω). Let H be a complex Hilbert space, and let N, EN(B), and Pn be as in Bosonic Fock number operator and counting PVM. Then N is self-adjoint on its stated domain and EN is a projection-valued measure on the Borel subsets of R. It is the sector counting resolution: EN(B) keeps exactly the sectors whose integer label lies in B, and N multiplies sector n by n. For any finite Borel partition (Ba)a=1m of R, the projections EN(Ba) are mutually orthogonal and sum to the identity.

Facts & Assumptions

Given: Countable Choice, the square-summable symmetric Fock direct sum, the number-operator definition, and the standard definitions of adjoint, self-adjoint operator, and projection-valued measure.

[A1]

Countable Choice The Axiom of Countable Choice (ACω) is the choice assumption of the Fock construction used here.

[F1]

Schwartz/distribution spaces and Hilbert Fock conventions: Fs(H) is the Hilbert direct sum of the symmetric sectors Hs(n), n≥0, with ∑n∥Ψn∥2<∞; finite-sector vectors form a dense subspace.

[F2]

Bosonic Fock number operator and counting PVM: D(N)={Ψ:∑nn2∥Ψn∥2<∞}, (NΨ)n=nΨn, and (EN(B)Ψ)n=1B(n)Ψn.

[F3]

Projection valued measure: every value must be an orthogonal projection, EN(∅)=0, EN(R)=I, EN(B∩C)=EN(B)EN(C), and disjoint countable unions must converge strongly.

[F4]

Under the second-variable-linear Fock pairing of Schwartz/distribution spaces and Hilbert Fock conventions, conjugating the first-variable-linear definition in Adjoint of a densely defined operator gives: y∈D(N∗) exactly when there is z such that ⟨Nx,y⟩2=⟨x,z⟩2 for every x∈D(N); then N∗y=z.

[F5]

Symmetric, self-adjoint and essentially self-adjoint operators: self-adjointness means equality of the operator and its adjoint, including equality of their domains.

Proof

Given: [A1], [F1]–[F5], and the number-operator and sector-projection formulas in [F2].

1.1A1F1F2algebra

Finite-sector vectors lie in D(N) and are dense by [F1]. For Ψ,Φ∈D(N), the Cauchy–Schwarz inequality gives absolute convergence of ∑nn⟨Ψn,Φn⟩2, and because each n is real, ⟨NΨ,Φ⟩2=∑nn⟨Ψn,Φn⟩2=⟨Ψ,NΦ⟩2. Thus N is densely defined and symmetric.

1.2F2F3algebra

For each Borel B, [F2] makes EN(B) the diagonal multiplier by the real indicator 1B(n). It is bounded with norm at most one, self-adjoint, and idempotent. The same coordinate formula gives EN(∅)=0, EN(R)=I, and EN(B)EN(C)=EN(B∩C).

2.1F1F2F4F5step 1.1algebra

Suppose y∈D(N∗) and write z=N∗y. Test [F4] on vectors supported in only sector n. Since N acts there as nI, the identity for every xn∈Hs(n) gives zn=nyn. Hence ∑nn2∥yn∥2=∑n∥zn∥2<∞, so y∈D(N) and N∗y=Ny. Conversely, if y∈D(N), the convergent sector sum in step 1.1 gives ⟨Nx,y⟩2=⟨x,Ny⟩2 for every x∈D(N); [F4] then gives y∈D(N∗) and N∗y=Ny. Thus D(N∗)=D(N) and N=N∗, which proves self-adjointness by [F5].

2.2F1F2F3step 1.2construct

Let (Bj)j≥0 be pairwise disjoint Borel sets with union B, and fix Ψ∈Fs(H). Given ϵ>0, choose M so that ∑n>M∥Ψn∥2<ϵ. Among the finitely many labels 0,…,M, each label in B belongs to one Bj; choose J at least as large as all those finitely many indices. Then EN(B)Ψ−∑j=0JEN(Bj)Ψ has zero components through sector M, and its squared norm is at most ∑n>M∥Ψn∥2<ϵ. This proves strong countable additivity. Together with step 1.2 it proves the PVM clauses in [F3]. The coordinate formula in [F2] shows this PVM retains exactly the sectors on which N acts by their labels.

3.1F3step 1.2step 2.2∎

In a finite Borel partition (Ba)a=1m of R, distinct sets are disjoint, so step 1.2 gives EN(Ba)EN(Bb)=0 for a≠b. Append empty sets to this finite list to apply the countable-additivity result of step 2.2; since the union is R and EN(R)=I, the finite projections sum to I.

Depends on

Dependency tree · 2 levels

Sources