Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

One-mode factorization of symmetric Fock space

Statement

Assume Countable Choice The Axiom of Countable Choice (ACω). Let H be a complex Hilbert space, let e∈H have norm one, and put K=e⊥={v∈H:⟨e,v⟩2=0}. For ψm∈Ks(m) and k,m≥0, write ∣k⟩:=e⊗k∈(Ce)s(k) (with ∣0⟩=1), and define

Jk,m(∣k⟩⊗ψm)=(k+mk) Ps,k+m(e⊗k⊗ψm).

The map Jk,m extends over the sector Hilbert tensor products and the orthogonal direct sums to a unitary

J:Fs(Ce)⊗^Fs(K)⟶Fs(H).

Under this unitary, bosonic creation and annihilation by e act on the first factor as the one-mode ladder maps ∣k⟩↦k+1∣k+1⟩ and ∣k⟩↦k∣k−1⟩, respectively, tensored with the identity on Fs(K), on finite-particle vectors.

Facts & Assumptions

Given: Countable Choice; a complex Hilbert space H with a unit vector e; the closed orthogonal complement K=e⊥; bosonic Fock sectors and creation/annihilation maps as in Schwartz/distribution spaces and Hilbert Fock conventions.

[A1]

Assume the Axiom of Countable Choice for the Hilbert tensor constructions. The Axiom of Countable Choice (ACω)

[F1]

Completed Hilbert tensor products have product inner products and dense elementary tensors. Hilbert tensor construction: inner product, completion and product bases

[F2]

Ps,n is an orthogonal projection onto the symmetric sector; its range is the set fixed by every permutation of tensor factors. Permutation sector projections on the n-fold tensor power

[F3]

The direct sum of square-summable sector sequences is the Fock space, and creation on sector n is n+1Ps,n+1(e⊗⋅). Schwartz/distribution spaces and Hilbert Fock conventions

[F4]

The orthogonal complement K=e⊥ is a closed linear subspace of H, hence is a Hilbert space with its inherited inner product. Orthogonal complements are closed

Proof

1.1A1F2F3constructalgebra

By [F4], K is a Hilbert space, so its symmetric tensor sectors and Fock space in the Statement are defined. Fix k,m≥0, write n=k+m, and let ψm∈Ks(m). Expanding the permutation average and using symmetry of ψm gives Ps,n(e⊗k⊗ψm)=(nk)−1∑I⊆{1,…,n}∣I∣=kvI, where vI is the tensor with e in the slots in I and the m factors of ψm in the remaining slots, symmetrized there. Indeed, for each fixed placement I, the k!m! permutations of the equal e factors and the symmetric ψm give the same tensor, and k!m!/n!=(nk)−1.

2.1step 1.1F1F2algebra

Distinct placements vI are orthogonal: if I≠I′, some slot contains e in one tensor and a vector of K in the other, and e⊥K. Each vI has norm ∥ψm∥, so step 1.1 gives ∥Ps,n(e⊗k⊗ψm)∥2=(nk)−1∥ψm∥2. The same orthogonality shows that the images for different k in a fixed n sector are orthogonal. Thus the factor (nk) makes Jk,m isometric and their sector ranges are orthogonal.

3.1F1F2F3step 2.1algebra

Algebraic elementary tensors in H⊗^n are dense by [F1]. Expand each factor using H=Ce⊕K, distribute the finite tensor product, and apply Ps,n. Every resulting term has exactly k factors e and m=n−k factors in K, so it lies in the range described in step 2.1. Since Ps,n is bounded and algebraic elementary tensors are dense, their symmetrizations are dense in Hs(n); the range of the isometry is closed, hence it equals Hs(n). Taking the orthogonal direct sum over n=k+m proves that J is onto and unitary.

4.1F3step 1.1step 2.1algebra∎

On a vector e⊗k⊗ψm with n=k+m, creation by e acts by n+1Ps,n+1(e⊗Jk,m(e⊗k⊗ψm)). Since Ps,n+1 averages over all permutations, symmetrizing the last n slots first does not change the result. This equals n+1(nk)Ps,n+1(e⊗(k+1)⊗ψm). The binomial identity (n+1k+1)=n+1k+1(nk) makes this exactly Jk+1,m(k+1 e⊗(k+1)⊗ψm). Thus creation becomes the stated one-mode raising map. Annihilation by e is zero for k=0, because every first tensor factor lies in K. For k≥1, the placement formula of step 1.1 shows that contraction keeps exactly the (n−1k−1) placements with e in the contracted slot. Therefore a(e)Jk,mψm=n(nk)(n−1k−1)(nk)Ps,n−1(e⊗(k−1)⊗ψm)=k Jk−1,mψm, using (nk)=nk(n−1k−1). Thus annihilation becomes the stated one-mode lowering map and leaves the K factor unchanged.

Depends on

Dependency tree · 2 levels

Sources