Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Symmetric and antisymmetric identical-particle Fock spaces

Definition

Assume the Axiom of Countable Choice, written ACω (The Axiom of Countable Choice (ACω)). Let I be a specified finite or countably infinite mode set with a fixed enumeration, and let h=ℓ2(I) have its coordinate orthonormal basis (ej)j∈I. Put h⊗0=C, h⊗1=h, and define each completed tensor power recursively by h⊗(n+1)=h⊗n⊗^h, using the first-variable-linear product inner product of Hilbert tensor construction: inner product, completion and product bases. For n≥1, let Uπ permute the tensor factors for π∈Sn, and let

P±(n)=1n!∑π∈Snχ±(π)Uπ,χ+(π)=1,χ−(π)=sgn⁡(π),

with P±(0)=IC. The permutation-sector theorem Permutation sector projections on the n-fold tensor power makes these orthogonal projections. Define the symmetric and antisymmetric sectors H±(n):=ran⁡P±(n). Define

F±(h):={ψ=(ψn)n≥0:ψn∈H±(n), ∑n≥0∥ψn∥2<∞},⟨ψ,φ⟩:=∑n≥0⟨ψn,φn⟩.

The vector Ω=(1,0,0,…) is the vacuum, and the finite-particle subspace consists of vectors with only finitely many nonzero components.

This is a mathematical construction for a specified mode basis. Choosing its symmetric or antisymmetric sector for a physical species is a separate model postulate. No spin-statistics theorem or physical species assignment is part of the definition.

Facts & Assumptions

Given: A finite or countable enumerated mode set I, the coordinate Hilbert space ℓ2(I), its completed tensor powers, and the symmetric-group action.

[A1]

The Axiom of Countable Choice (ACω): every at most countable family of nonempty sets has a choice function.

[F1]

Hilbert tensor construction: inner product, completion and product bases, Statement (c)–(d): the completed tensor product of complex Hilbert spaces has the product inner product, is complete, and the products of complete orthonormal families form a complete orthonormal family.

[F2]

Permutation sector projections on the n-fold tensor power, Statement (a)–(c): the factor permutations are unitary, and their symmetric and antisymmetric averages are orthogonal projections whose ranges are the fixed and sign-transforming subspaces.

Proof

1.1givenA1F1F2algebra

The tensor factors and product pairing in the Definition are supplied by [F1]. For every n≥1, [F2] makes P±(n) an orthogonal projection. The range of an orthogonal projection is closed: if Pxk=xk and xk→x, boundedness of P gives Px=lim⁡kPxk=lim⁡kxk=x. Therefore each H±(n) is a closed subspace of the complete tensor Hilbert space and is itself complete.

1.2givenF1F3algebra

For ψ,φ∈F±(h), Cauchy–Schwarz for the square-summable nonnegative sequences (∥ψn∥)n and (∥φn∥)n gives ∑n∣⟨ψn,φn⟩∣≤(∑n∥ψn∥2)1/2(∑n∥φn∥2)1/2<∞. Hence the displayed pairing converges absolutely, is sesquilinear, and is positive definite because ⟨ψ,ψ⟩=∑n∥ψn∥2=0 forces every coordinate to vanish.

2.1step 1.1step 1.2algebra

Let (ψ(k))k be Cauchy in this norm. For each fixed n, (ψn(k))k is Cauchy in the complete sector H±(n), so it converges to some ψn∈H±(n). If k≥K and ∥ψ(k)−ψ(m)∥≤ε for all m≥K, then for every finite N, passing m→∞ in the finite sum yields ∑n≤N∥ψn−ψn(k)∥2≤ε2. Also ∑n≤N∥ψn∥2≤2∥ψ(k)∥2+2ε2. Taking suprema over finite N proves ∑n∥ψn∥2<∞, so ψ∈F±(h), and then ∥ψ(k)−ψ∥≤ε for all k≥K. Thus the direct sum is complete.

3.1step 1.2algebra∎

For ψ∈F±(h), truncating after sector N changes its squared norm by ∑n>N∥ψn∥2→0. Therefore the finite-particle subspace is dense and Ω is a unit vector.

Depends on

Dependency tree · 2 levels

Sources