Alphabeta Math
TheoremStatement: 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.

Number operator domain

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with completed tensor powers H⊗n, symmetric projections P+(n) and Fock space F(H) as in Hilbert direct-sum construction. Define the number operator by D(N):={ψ∈F(H): ∑n∈Nn2∥ψn∥2<∞},(Nψ)n:=nψn. Then:

(a) N is a densely defined self-adjoint operator on F(H) with the displayed domain; N≥0 in the sense that ⟨Nψ,ψ⟩≥0 for ψ∈D(N), NΩ=0, and F0 is a core for N (Symmetric, self-adjoint and essentially self-adjoint operators);

(b) for every n, every nonzero u∈ran⁡P+(n) satisfies Nιn(u)=n ιn(u), and for H≠{0} the spectrum of N is σ(N)=N;

(c) for f∈H and ψ∈F0 the core operators of Creation contraction bounds satisfy NS+(f)ψ−S+(f)Nψ=S+(f)ψ,NS−(f)ψ−S−(f)Nψ=−S−(f)ψ;

(d) D(N)⊆D1:={ψ:∑n(n+1)∥ψn∥2<∞}, and for every ψ∈D(N), ∥Nψ∥2=∑n∈Nn2∥ψn∥2,⟨Nψ,ψ⟩=∑n∈Nn∥ψn∥2.

No physical interpretation of N, and no assertion about particle number measurement, is made.

Facts & Assumptions

Given: the complex Hilbert space H, the Fock space F(H) with sectors ran⁡P+(n) and coordinate embeddings ιn, the dense finite-particle subspace F0, the vacuum Ω, the number operator N with domain D(N), vectors f∈H and ψ∈F(H), and n∈N.

[F1]

F(H) is a Hilbert space with inner product ⟨ψ,φ⟩=∑n⟨ψn,φn⟩, F0 is dense, and each ran⁡P+(n) is a closed subspace of the Hilbert space H⊗n (Hilbert direct-sum construction, Permutation sector projections on the n-fold tensor power).

[F2]

For a densely defined operator A, a vector y belongs to D(A∗) exactly when there is z with ⟨Ax,y⟩=⟨x,z⟩ for every x∈D(A); then A∗y=z. A densely defined symmetric operator satisfies A⊆A∗ (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators). Cauchy-Schwarz holds in each sector by Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs; for square-summable coordinate norms apply that theorem to finite nonnegative real vectors (a0,…,aN) and (b0,…,bN) in RN+1 with inner product ⟨a,b⟩:=∑n=0Nanbn, then take increasing partial sums. These definitions require only the declared Countable Choice; self-adjointness of N will be proved directly rather than invoking the stronger choice hypotheses of the general direct-sum theorem.

[F3]

The core operators satisfy (S+(f)ψ)n=nP+(n)(f⊗ψn−1), (S−(f)ψ)n=n+1Ψf(n)(ψn+1) on F0 (Creation contraction bounds).

Proof

1.1F1F2algebra

[Coordinate adjoint, vacuum and positivity] The coordinate Hilbert-space construction used in [F1] is valid under the present hypotheses: the sector spaces are complete closed tensor subspaces, the pairing converges by Cauchy-Schwarz, and a Cauchy sequence has coordinate limits. For each finite coordinate sum, the Cauchy norm bound passes to the limit; taking the supremum over those finite sums proves that the limit is square summable and that convergence holds in the full sum. Finite-coordinate truncations give density of F0. Thus these Hilbert and density facts do not require invoking the Axiom of Choice premise of the general operator-sum theorem. [F1, F2, algebra] Every vector of F0 lies in D(N), so N is densely defined. For ψ,φ∈D(N), the sequence form of Cauchy-Schwarz in [F2] makes the coordinate pairing series absolutely convergent and gives ⟨Nψ,φ⟩=∑nn⟨ψn,φn⟩=⟨ψ,Nφ⟩; hence N⊆N∗. If φ∈D(N∗) and η=N∗φ, test the adjoint identity with every vector ιn(u) in a single sector. It gives ⟨nu,φn⟩=⟨u,ηn⟩ for all u, so ηn=nφn for every n, including η0=0. Consequently ∑nn2∥φn∥2=∥η∥2<∞, proving φ∈D(N) and N∗φ=Nφ. Thus N=N∗ on exactly the displayed domain. For ψ∈D(N), ⟨Nψ,ψ⟩=∑nn∥ψn∥2≥0, and the vacuum satisfies NΩ=0. The finite-coordinate truncations ψ(M) lie in F0 and satisfy ψ(M)→ψ and Nψ(M)→Nψ by convergence of ∑nn2∥ψn∥2, so F0 is a graph core. This retains all conclusions of (a) under its original Countable Choice hypothesis.

1.2F3algebra

[Commutation on the core] Let f∈H and ψ∈F0; all vectors below lie in F0 by [F3]. Using the sector formulas of [F3], for n≥1 the n-th coordinate of S+(f)Nψ is nP+(n)(f⊗(n−1)ψn−1)=(n−1)(S+(f)ψ)n, while the n-th coordinate of NS+(f)ψ is n(S+(f)ψ)n; both coordinates vanish for n=0. Hence NS+(f)ψ−S+(f)Nψ=S+(f)ψ. Similarly, the n-th coordinate of S−(f)Nψ is n+1Ψf(n)((n+1)ψn+1)=(n+1)(S−(f)ψ)n, and that of NS−(f)ψ is n(S−(f)ψ)n; their difference is −(S−(f)ψ)n for every n, proving the second identity.

2.1F1F2step 1.1algebra

[Eigenvalues and spectrum] Let n∈N and u∈ran⁡P+(n), u≠0. The vector ιn(u) lies in D(N) with (Nιn(u))m=m(ιn(u))m, which is nιn(u); thus every n∈N is an eigenvalue when H≠{0}, since then each sector contains e⊗n≠0 (and the vacuum sector is C). Now fix λ∈C∖N and put cn:=(n−λ)−1. If n>2∣λ∣, then ∣n−λ∣≥n−∣λ∣>n/2, so ∣cn∣<2/n≤2 and n∣cn∣<2; among the finitely many remaining indices each denominator is nonzero because λ∉N. Hence sup⁡n∣cn∣<∞ and sup⁡nn∣cn∣<∞. Define Rλψ:=(cnψn)n. Then ∥Rλψ∥2=∑n∣cn∣2∥ψn∥2≤(sup⁡n∣cn∣)2∥ψ∥2 and ∑nn2∥cnψn∥2≤(sup⁡nn∣cn∣)2∥ψ∥2, so Rλ is bounded from F(H) to D(N) with its graph norm. Coordinatewise, (N−λI)Rλ=I on F(H) and Rλ(N−λI)=I on D(N); hence Rλ is a bounded inverse of N−λI. Therefore σ(N)⊆N, and the exhibited eigenvalues give σ(N)=N for H≠{0}.

3.1F1step 1.1algebra∎

[Domain inclusion and moments] If ψ∈D(N) then ∑n(n+1)∥ψn∥2=∑nn∥ψn∥2+∑n∥ψn∥2≤∑nn2∥ψn∥2+∥ψ∥2<∞ (using n≤n2), so D(N)⊆D1. The coordinate formula (Nψ)n=nψn and orthogonality of the sectors give ∥Nψ∥2=∑n∥nψn∥2=∑nn2∥ψn∥2 and ⟨Nψ,ψ⟩=∑nn∥ψn∥2, both series converging absolutely; this proves (d) and completes the proof of (a)-(d).

Depends on

Dependency tree · 2 levels

Sources