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

Permutation sector projections on the n-fold tensor power

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space, n≥1, and H⊗n the n-fold completed tensor power (H⊗1:=H, H⊗(k+1):=H⊗k⊗^H as in Hilbert tensor construction: inner product, completion and product bases). For v0,…,vn−1∈H write v0⊗⋯⊗vn−1∈H⊗n for the iterated elementary tensor.

(a) For every π in the symmetric group Sn (The finite symmetric group Sn, one-line notation, and cycle notation) there is a unique unitary Uπ∈B(H⊗n) with

Uπ(v0⊗⋯⊗vn−1)=vπ−1(0)⊗⋯⊗vπ−1(n−1),

and UπUσ=Uπσ, Uπ∗=Uπ−1.

(b) The operators

P+:=1n!∑π∈SnUπ,P−:=1n!∑π∈Snsgn⁡(π)Uπ

(with sgn⁡ the sign homomorphism, The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2) are orthogonal projections.

(c) UπP+=P+Uπ=P+ and UπP−=P−Uπ=sgn⁡(π)P− for every π; consequently the range of P+ is the subspace of vectors fixed by every Uπ, and the range of P− is the subspace of vectors transforming by sgn⁡.

(d) If v0,…,vn−1 have a repeated factor, that is, vi=vj for some distinct i,j∈{0,…,n−1}, then P−(v0⊗⋯⊗vn−1)=0.

Selecting the symmetric or antisymmetric sector for a particle species is a physical postulate, not a theorem of this construction; no spin-statistics statement is proved here.

Facts & Assumptions

Given: A complex Hilbert space H; n≥1; the tensor powers H⊗k; the symmetric group Sn and its sign homomorphism.

[F1]

The completed tensor product construction provides: the algebraic tensor product with bilinear elementary tensors, the inner product with ⟨u⊗v,u′⊗v′⟩=⟨u,u′⟩⟨v,v′⟩, the dense inclusion, unique orthonormal-coordinate expansions and ∥u⊗v∥=∥u∥ ∥v∥ (Hilbert tensor construction: inner product, completion and product bases).

[F2]

Bounded operators S,T extend uniquely to S⊗T with ∥S⊗T∥≤∥S∥ ∥T∥, the adjoint is S∗⊗T∗, and compositions multiply; unitary factors have unitary tensor product (Bounded tensor maps: extension, norm estimate, adjoint and commutation).

[F3]

Any parenthesized iterated tensor product represents multilinear maps: for a multilinear map Φ:Hn→Z there is a unique linear L with L(v1⊗⋯⊗vn)=Φ(v1,…,vn) and different parenthesizations agree (Finite iterated tensor products represent multilinear maps independently of parenthesization).

[F4]

sgn⁡:Sn→{+1,−1} is a homomorphism with sgn⁡(πσ)=sgn⁡(π)sgn⁡(σ) and sgn⁡(π−1)=sgn⁡(π); An=ker⁡sgn⁡ consists of the even permutations (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2, The alternating group An=ker⁡(sgn⁡) of even permutations, For n≥2, sign is the unique nontrivial homomorphism Sn→{+1,−1}).

Proof

1.1givenF1F3constructalgebra

[Permutation isometries on the dense algebraic core] The span of iterated elementary tensors is dense in H⊗n, by induction on the completion construction [F1]. On the algebraic iterated tensor product, the multilinear assignment (v0,…,vn−1)↦vπ−1(0)⊗⋯⊗vπ−1(n−1) induces a linear map by [F3]. It descends isometrically to its image in the completed tensor power: for elementary tensors v=v0⊗⋯⊗vn−1 and w=w0⊗⋯⊗wn−1, the inner product of their permuted images is ∏k=0n−1⟨vπ−1(k),wπ−1(k)⟩=∏k=0n−1⟨vk,wk⟩=⟨v,w⟩ by [F1]. Sesquilinearity gives the same identity for finite linear combinations, so any algebraic relation with zero norm has zero-norm image. The isometry therefore extends uniquely by continuity to Uπ on the completion. For n=1 it is the identity, and the zero Hilbert space is included.

2.1step 1.1F1F2algebra

[Group law and unitarity] Direct substitution of indices in the elementary formula gives UπUσ=Uπσ and Ue=I on the dense algebraic core; continuity gives these equalities on the whole completion. Thus Uπ−1Uπ=I=UπUπ−1, so the isometry of step 1.1 is surjective and unitary, with Uπ∗=Uπ−1. Any bounded operator with the same elementary action agrees with this one on a dense span and hence everywhere, proving uniqueness. No choice of permutation word or zeroth tensor power is needed.

3.1step 2.1F4algebra

[The projections are orthogonal projections] With coefficients c+(π)=1 and c−(π)=sgn⁡(π), write P±:=1n!∑πc±(π)Uπ as in the Statement, use UπUσ=Uπσ and reindex τ=πσ: for P+ this gives P+2=1(n!)2∑π,σUπσ=1(n!)2∑τn! Uτ=P+, and for P−, since σ=π−1τ and by [F4] sgn⁡(π)sgn⁡(σ)=sgn⁡(τ), it gives P−2=1(n!)2∑π,σsgn⁡(π)sgn⁡(σ)Uπσ=1(n!)2∑τn! sgn⁡(τ)Uτ=P−; moreover P±∗=1n!∑πc±(π)Uπ−1=1n!∑τc±(τ)Uτ=P± because Uπ∗=Uπ−1 and sgn⁡(π−1)=sgn⁡(π) [F4]. Hence P± are orthogonal projections.

4.1step 2.1step 3.1F4algebra

[Ranges and transformation laws] For every π, UπP+=1n!∑σUπσ=1n!∑τUτ=P+ and UπP−=1n!∑σsgn⁡(σ)Uπσ=sgn⁡(π)1n!∑τsgn⁡(τ)Uτ=sgn⁡(π)P−, using sgn⁡(σ)sgn⁡(πσ)=sgn⁡(π) [F4]; by self-adjointness of the projections these identities also hold with the order reversed. Consequently, if u∈ran⁡P+ then Uπu=P+u=u for all π, and if u∈ran⁡P− then Uπu=sgn⁡(π)u; conversely Uπu=u for all π gives P+u=u, and Uπu=sgn⁡(π)u for all π gives P−u=1n!∑πsgn⁡(π)2u=u.

5.1step 2.1step 3.1F4algebra∎

[Vanishing on repeated factors] Suppose vi=vj for distinct i,j∈{0,…,n−1} and let τ be the transposition swapping those positions. Then Uτ(v0⊗⋯⊗vn−1)=v0⊗⋯⊗vn−1 because the swap exchanges equal vectors. Pairing the terms of the sum defining n!P− as {π,πτ} over a set of coset representatives of the subgroup {e,τ} gives, for each pair, sgn⁡(π)Uπv+sgn⁡(πτ)Uπτv=sgn⁡(π)Uπv−sgn⁡(π)UπUτv=0 by Uπτ=UπUτ and Uτv=v. Hence P−v=0 for the tensor with a repeated factor.

Depends on

Dependency tree · 2 levels

Sources