Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

One-mode photon number operator and count PVM

Statement

Assume the Axiom of Countable Choice. Let H be a complex Hilbert space with the second-variable-linear pairing used for bosonic Fock space, and let u∈H satisfy ∥u∥=1. Put K=u⊥. Let Ju:Fs(Cu)⊗^Fs(K)→Fs(H) be the one-mode Fock unitary, and for n∈N0 let en=u⊗n∈(Cu)s(n), with e0=1. On Fs(Cu) define Qnz=⟨en,z⟩2en, and on Fs(H) put Pn:=Ju(Qn⊗I)Ju−1. For every Borel set B⊆R, define the strong sum Eu(B):=∑n∈B∩N0Pn. Define the mode number operator Nu:=∑n=0∞nPn,D(Nu):={Ψ∈Fs(H):∑n=0∞n2∥PnΨ∥2<∞}. Then (Pn)n≥0 are mutually orthogonal projections with strong sum I, Eu is a projection-valued measure supported on N0, and Nu is self-adjoint with these spectral projections. Define MuΨ:=∑n=0∞n(n−1)PnΨ on D(Mu):={Ψ∈Fs(H):∑n=0∞n2(n−1)2∥PnΨ∥2<∞}. Then Mu=Nu(Nu−I) is self-adjoint, and Dfin is a graph core for it. On the finite-particle subspace, Nu=a†(u)a(u),Mu=Nu(Nu−I)=a†(u)2a(u)2. Thus the finite-particle restriction of a†(u)2a(u)2 is essentially self-adjoint with closure Mu.

Facts & Assumptions

Given: Countable Choice, the bosonic Fock space over H, a unit vector u, and its closed orthogonal complement K=u⊥.

[A1]

Assume Countable Choice, written ACω. The Axiom of Countable Choice (ACω)

[F1]

The bosonic Fock space is the square-summable direct sum of its symmetric particle sectors; its finite-particle subspace is Dfin, and the creation and annihilation maps are defined on those sectors. Schwartz/distribution spaces and Hilbert Fock conventions

[F2]

The one-mode splitting is a unitary Ju:Fs(Cu)⊗^Fs(K)→Fs(H); under it, creation and annihilation by u act on the first factor by en↦n+1en+1 and en↦nen−1 on finite-particle vectors. One-mode factorization of symmetric Fock space

[F3]

On Dfin, the bosonic CCR include [a(u),a†(u)]=I, and the finite-particle subspace is invariant under these creation and annihilation maps. Bosonic and fermionic Fock operators with exact domains

[F4]

A PVM is a countably strongly additive map from a sigma-algebra to orthogonal projections, with empty-set value zero, full-space value the identity, and E(B∩C)=E(B)E(C). Projection valued measure

[F5]

A densely defined operator is self-adjoint when it equals its adjoint, including equality of domains and values; its operator domain is part of the data. Unbounded linear operators: domain, graph and extension Symmetric, self-adjoint and essentially self-adjoint operators

Proof

1.1A1F1F2givenalgebra

Under the unitary Ju of [F2], the one-dimensional nth sector of Fs(Cu) is spanned by the unit vector en. Therefore Qn are mutually orthogonal projections and their strong sum is the identity on Fs(Cu). Tensoring with the identity on Fs(K) and conjugating by Ju shows that each Pn is an orthogonal projection, PnPm=0 for n≠m, and ∑n≥0PnΨ=Ψ in norm for every Ψ∈Fs(H).

2.1F1F2F5step 1.1algebra

Under Ju, write Ψ=⨁n≥0en⊗ϕn with ϕn∈Fs(K), and put mn=n(n−1). The composition Nu(Nu−I) acts diagonally by mn and has exactly the stated domain: ∑nmn2∥ϕn∥2<∞ implies Ψ∈D(Nu) because n2≤mn2 for n≥2 and the n=0,1 block contributions are finite, and it gives (Nu−I)Ψ∈D(Nu); conversely, membership in the composition domain gives this sum. This domain contains Dfin, dense by truncation of the square-summable Fock sum in [F1], and the operator is symmetric because each mn is real. If Φ∈D(Mu∗) and Ξ=Mu∗Φ, testing the adjoint identity on vectors supported in one nth block forces Ξn=mnΦn; square summability gives Φ∈D(Mu). Conversely, for Φ∈D(Mu), Cauchy–Schwarz on the block sum gives the adjoint identity with value MuΦ. Hence Mu=Mu∗ and is self-adjoint, therefore closed, by [F5].

2.2A1F4step 1.1algebra

For Borel B, the orthogonal sum defining Eu(B) converges strongly because ∑n∥PnΨ∥2=∥Ψ∥2. It is an orthogonal projection, Eu(∅)=0, Eu(R)=I, and orthogonality gives Eu(B)Eu(C)=Eu(B∩C). For pairwise disjoint Borel sets Bj, their intersections with N0 partition B∩N0, so the corresponding orthogonal series gives Eu(⋃jBj)Ψ=∑jEu(Bj)Ψ in norm. Thus Eu is a PVM supported on N0, and Eu({n})=Pn.

2.3F2F5step 1.1algebra

Under Ju, Nu is the diagonal operator (Ψn)n≥0↦(nΨn)n≥0 with domain ∑nn2∥Ψn∥2<∞. It is symmetric because every diagonal coefficient n is real. If Φ lies in its adjoint domain with adjoint value Ξ, testing the adjoint identity on vectors supported in a single sector forces Ξn=nΦn for every n. Since Ξ is square-summable, ∑nn2∥Φn∥2<∞, so Φ∈D(Nu). Conversely, for Φ∈D(Nu), Cauchy–Schwarz on the sector sum gives the adjoint identity with value NuΦ. Hence D(Nu∗)=D(Nu) and Nu∗=Nu, and its projections are the constructed Eu({n})=Pn.

3.1F1F2F3step 1.1step 2.3algebra

By [F2], on a one-mode occupation vector en⊗ϕ one has a(u)(en⊗ϕ)=n en−1⊗ϕ and a†(u)(en⊗ϕ)=n+1 en+1⊗ϕ; thus a†(u)a(u)=Nu on finite-particle vectors, including the n=0 sector. On the same invariant subspace, [F3] gives a(u)a†(u)=a†(u)a(u)+I. Consequently Nu(Nu−I)=a†(u)a(u)a†(u)a(u)−a†(u)a(u)=a†(u)2a(u)2 on Dfin, by substitution of the CCR and cancellation of the two a†(u)a(u) terms.

4.1F1F2step 3.1step 2.1algebra∎

Truncate any Ψ∈D(Mu) to Ψ(M)=∑n=0MPnΨ; its squared graph-norm tail is ∑n>M(1+mn2)∥PnΨ∥2→0. For fixed M, write each PnΨ under Ju−1 as en⊗ϕn and approximate each of the finitely many ϕn by finite-particle vectors in Fs(K), which are dense by [F1]. The one-mode unitary preserves norm and the finitely many multipliers mn are bounded, so these approximations converge in graph norm and their images have finite total particle number. Thus Dfin is a graph core for Mu; its restriction is a†(u)2a(u)2 by step 3.1, and its closure is Mu because Mu is closed by step 2.1.

Depends on

Dependency tree · 2 levels

Sources