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.

Bosonic and fermionic Fock operators with exact domains

Statement

Assume Countable Choice The Axiom of Countable Choice (ACω) and let H be a complex Hilbert space with the second-variable-linear convention of Schwartz/distribution spaces and Hilbert Fock conventions. On Dfin define the bosonic creation and annihilation maps a†(h) and a(h) and the fermionic maps c†(h) and c(h) as in Schwartz/distribution spaces and Hilbert Fock conventions. Write an(h) and an†(h) for their restrictions to the nth bosonic sector. For bosons set

D(a(h))={Ψ∈Fs(H):∑n≥1∥an(h)Ψn∥2<∞},D(a†(h))={Ψ∈Fs(H):∑n≥0∥an†(h)Ψn∥2<∞}.

Then Fs(H) and Fa(H) are Hilbert spaces, Dfin is dense, and it is a graph core for both maximal bosonic sector maps. The bosonic operators on their displayed domains are closed and mutually adjoint, and on Dfin satisfy

[a(h),a†(k)]=⟨h,k⟩2I,[a(h),a(k)]=[a†(h),a†(k)]=0.

The fermionic c(h) and c†(h) extend to bounded operators on the whole Fock space, with norms ∥h∥, and satisfy on the whole space

{c(h),c†(k)}=⟨h,k⟩2I,{c(h),c(k)}={c†(h),c†(k)}=0.

This is a mathematical construction of the two Fock representations; it does not assign particle statistics to a physical species.

Facts & Assumptions

Given: Countable Choice; a complex Hilbert space H; the symmetric and antisymmetric sectors, finite-particle domain, creation and annihilation formulas from Schwartz/distribution spaces and Hilbert Fock conventions.

[A1]

The Axiom of Countable Choice is the only choice principle assumed by the Hilbert tensor suppliers used below. The Axiom of Countable Choice (ACω)

[F1]

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

[F2]

Permutations act unitarily on each tensor power; the averaging operators Ps,n and Pa,n are orthogonal projections onto the symmetric and antisymmetric sectors. Permutation sector projections on the n-fold tensor power

[F3]

The sector creation, annihilation, and contraction maps are given by the formulas in Schwartz/distribution spaces and Hilbert Fock conventions: creation inserts h and applies the symmetric or antisymmetric projection with the factor n+1; annihilation contracts the first factor with Ch and the factor n.

[F4]

A bounded map S induces S⊗I on a completed tensor product with norm at most ∥S∥; orthogonal complements use the Hilbert orthogonality convention. Bounded tensor maps: extension, norm estimate, adjoint and commutation Orthogonality and the orthogonal complement

[F5]

The graph norm, closedness, core and adjoint-domain terms have the definitions in Unbounded linear operators: domain, graph and extension, Densely defined, closed and closable operators, and cores, Adjoint of a densely defined operator, and Symmetric, self-adjoint and essentially self-adjoint operators. Apply their first-variable-linear adjoint convention to (u,v)1=⟨v,u⟩2. Conjugating the defining identity gives ⟨Tx,y⟩2=⟨x,T∗y⟩2, with unchanged norm, adjoint domain and adjoint value.

Proof

1.1A1F1F2constructalgebra

Each sector Hs(n) or Ha(n) is a closed subspace of its Hilbert tensor power, being the range of the corresponding orthogonal projection [F2]. The square-summable direct sum of these sectors is complete: for a Cauchy sequence, each coordinate converges in its complete sector; finite partial sums of squared coordinate norms are bounded by the common sequence bound, so the coordinate limits are square-summable; taking coordinate limits in the Cauchy estimate over each finite set of coordinates and then the supremum proves convergence in the direct-sum norm. Truncating a square-summable sequence after sector N converges in norm, so Dfin is dense.

1.2F1F2F3F4algebra

On sector n, creation and contraction have norms at most n+1∥h∥ and n∥h∥, respectively: the contraction has norm at most ∥h∥ on its first factor by Cauchy–Schwarz and extends to the tensor product with the same bound [F4]; each symmetrizer or antisymmetrizer has norm at most one [F2]. For Φ∈Hs(n) and Ψ∈Hs(n+1), use Ps,n+1Ψ=Ψ and self-adjointness of Ps,n+1 to compute ⟨an†(h)Φ,Ψ⟩2=n+1⟨h⊗Φ,Ψ⟩2=n+1⟨Φ,(Ch⊗I⊗n)Ψ⟩2=⟨Φ,an+1(h)Ψ⟩2; the tensor product pairing gives the middle equality because Ch(v)=⟨h,v⟩2. The same calculation with Pa,n+1 proves the fermionic relation.

2.1step 1.1step 1.2F1F3F5algebra

The maximal bosonic direct-sum maps are closed. For example, if Φ(j)→Φ and a(h)Φ(j)→Θ in Fock norm, boundedness of each sector map gives coordinatewise Θn−1=an(h)Φn; since Θ is square-summable, the defining sum for D(a(h)) is finite and a(h)Φ=Θ. The same coordinate argument applies to a†(h). Truncating a vector and its image after sector N shows Dfin is a graph core for each. For the adjoint, testing against vectors supported in sector n+1 forces the adjoint output coordinate in sector n+1 to be an†(h)Φn; square-summability of these coordinates is exactly the displayed domain of a†(h). Conversely, if that sum is finite, the sector pairing of step 1.2 and Cauchy–Schwarz in the direct sum give the adjoint identity for every vector in D(a(h)). Thus a(h)∗=a†(h). Testing a†(h)∗ against input sector n similarly forces its output coordinate to be an+1(h)Φn+1; square-summability and the same pairing give exactly D(a(h)) and the converse inclusion. Hence the maximal maps are mutually adjoint.

2.2F1F2step 1.2algebra

For n≥1 and a symmetric elementary tensor v1∨⋯∨vn:=Ps,n(v1⊗⋯⊗vn), contraction and creation give a(h)(v1∨⋯∨vn)=n−1/2∑j=1n⟨h,vj⟩2 v1∨⋯vj^⋯∨vn and a†(k)(v1∨⋯∨vn)=n+1 Ps,n+1(k⊗v1⊗⋯⊗vn), by expanding the permutation averages [F2]. In the composition a(h)a†(k), the contraction term for the newly inserted k is ⟨h,k⟩2(v1∨⋯∨vn); each of the other n contraction terms is exactly the corresponding term of a†(k)a(h). Hence their difference is ⟨h,k⟩2I. On sector zero, a(h)Ω=0, a†(k)Ω=k, and a1(h)k=⟨h,k⟩2 give the same commutator directly. Symmetry of Ps,n makes two creations commute; two contractions commute because contracting distinct tensor slots in either order gives the same sum. Finite elementary symmetric tensors are dense in each sector and the sector maps are bounded there, so the identities hold on all of Dfin.

3.1F1F2F4step 1.2algebra∎

For a unit vector h, put K=h⊥. In the nth antisymmetric sector, every v∈H decomposes as v=⟨h,v⟩2h+(v−⟨h,v⟩2h) with the second term in K, so H=Ch⊕K. Tensors split orthogonally into those with no h factor and those with exactly one: expand each tensor factor in Ch⊕K; terms with two h factors vanish under antisymmetrization, and different placements of the single h are orthogonal. The map n+1Pa,n+1(h⊗⋅) is an isometry from the no-h part of sector n onto the one-h part of sector n+1, since the n+1 placements are orthogonal and each has coefficient 1/(n+1) in the antisymmetrizer. It vanishes on the one-h part. Its adjoint c(h) reverses this isometry and vanishes on the no-h part. Thus c(h)c†(h)+c†(h)c(h)=I and both maps have norm one. Scaling gives {c(h),c†(h)}=∥h∥2I and norms ∥h∥ for h≠0; for h=0 these statements hold because both operators vanish. Antisymmetry gives c†(h)2=0; taking adjoints gives c(h)2=0. Polarizing the diagonal anticommutator at h+k and h+ik, using that c(⋅) is conjugate-linear and c†(⋅) is linear, yields {c(h),c†(k)}=⟨h,k⟩2I: if q(u)={c(u),c†(u)}, then the sesquilinear polarization identity is B(h,k)=14(q(h+k)−q(h−k)−iq(h+ik)+iq(h−ik)), where B(h,k)={c(h),c†(k)}; substituting q(u)=∥u∥2I gives the claimed scalar. Polarizing c(u)2=0 and c†(u)2=0 gives the two same-type anticommutators. All fermionic maps are bounded, so these identities hold on the whole Fock space.

Depends on

Dependency tree · 2 levels

Sources