Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

The two-particle exchange operator and the symmetric and antisymmetric combinations

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space with inner product linear in the first argument (Hilbert space, Real and complex inner-product spaces and their induced length), let H⊗^H be its completed tensor square with inclusion κ (Hilbert tensor construction: inner product, completion and product bases), and for n=2 let (Uπ)π∈S2 and the projections P±(2) be those of Permutation sector projections on the n-fold tensor power. Write τ:=U(0 1) for the exchange operator, so that τ(κ(u⊗v))=κ(v⊗u) for u,v∈H; in the sequel the inclusion is suppressed and u⊗v denotes κ(u⊗v). Then:

(a) τ is self-adjoint and τ2=I; consequently τ is an isometry with τ−1=τ=τ∗ (The Hilbert-space adjoint of a bounded operator, A bounded linear operator between normed spaces);

(b) P+(2)=12(I+τ) and P−(2)=12(I−τ), and ran⁡P+(2)={x∈H⊗^H:τx=x},ran⁡P−(2)={x∈H⊗^H:τx=−x};

(c) for all u,v∈H, ∥u⊗v+v⊗u∥2=2(∥u∥2∥v∥2+∣⟨u,v⟩∣2),∥u⊗v−v⊗u∥2=2(∥u∥2∥v∥2−∣⟨u,v⟩∣2); in particular, if u,v are orthonormal, then s:=12(u⊗v+v⊗u) and a:=12(u⊗v−v⊗u) are orthonormal, τs=s and τa=−a, and both ran⁡P±(2) are nonzero;

(d) whenever u,v∈H are orthonormal, τκ(u⊗v)≠κ(u⊗v). Consequently, if H contains an orthonormal pair (equivalently, dim⁡H≥2), both exchange eigenspaces contain nonzero vectors and τ≠I. If H={0} or dim⁡H=1, then τ=I, P+(2)=I and P−(2)=0; for H={0} the tensor square and both ranges are zero.

Facts & Assumptions

Given: The complex Hilbert space H with inner product linear in the first argument, the completed tensor square H⊗^H with inclusion κ, the permutation unitaries Uπ for n=2 and the projections P±(2), and vectors u,v∈H.

[F1]

Tensor square. κ:H⊙H→H⊗^H is a linear isometry with dense image, κ(u⊗v) is bilinear in (u,v), ∥κ(u⊗v)∥=∥u∥ ∥v∥ and ⟨κ(u⊗v),κ(u′⊗v′)⟩=⟨u,u′⟩⟨v,v′⟩ (Hilbert tensor construction: inner product, completion and product bases clauses (a)-(d), Real and complex inner-product spaces and their induced length).

[F2]

Permutation unitaries. U(0 1)∈B(H⊗^H) is the unique bounded operator with U(0 1)κ(u⊗v)=κ(v⊗u); it is unitary with UπUσ=Uπσ and Uπ∗=Uπ−1. For every π∈S2, UπP+(2)=P+(2)Uπ=P+(2) and UπP−(2)=P−(2)Uπ=sgn⁡(π)P−(2). The orthogonal projections are P+(2)=12∑π∈S2Uπ and P−(2)=12∑π∈S2sgn⁡(π)Uπ (Permutation sector projections on the n-fold tensor power clauses (a)-(c), The Axiom of Countable Choice (ACω)).

[F3]

Orthogonal projections. An orthogonal projection P satisfies P2=P=P∗, and its range is a closed subspace (The Hilbert orthogonal projection onto a closed subspace, Hilbert projections are linear, self-adjoint and contractive).

[F4]

Adjoint and operator norm. For T∈B(H⊗^H) the Hilbert adjoint T∗ is the unique bounded operator with ⟨Tx,y⟩=⟨x,T∗y⟩, and T is an isometry exactly when T∗T=I; ∥Tx∥≤∥T∥ ∥x∥ (The Hilbert-space adjoint of a bounded operator, The operator norm as the least bound and as the unit-sphere or unit-ball supremum, A bounded linear operator between normed spaces).

Proof

1.1F2F4algebra

[The exchange operator is a self-adjoint involution] By [F2] with π=σ=(0 1) one has τ2=U(0 1)(0 1)=Ue=I, and τ∗=U(0 1)−1=U(0 1)=τ; hence τ−1=τ=τ∗ and τ is an isometry, which is (a).

1.2F2algebra

[The projections in terms of the exchange operator] Since S2={e,(0 1)} and sgn⁡(e)=1, sgn⁡((0 1))=−1, the formulas of [F2] give P+(2)=12(Ue+U(0 1))=12(I+τ) and P−(2)=12(Ue−U(0 1))=12(I−τ), which is the first assertion of (b).

2.1step 1.1step 1.2F3algebra

[Eigenspaces as ranges] Let x∈H⊗^H. If τx=x, then 12(I+τ)x=x, so x∈ran⁡12(I+τ); conversely if x=12(I+τ)y for some y, then τx=12(τy+τ2y)=12(τy+y)=x by step 1.1. Hence the fixed space of τ is ran⁡12(I+τ)=ran⁡P+(2) by step 1.2; the same substitution with x=12(I−τ)y gives τx=−x, and conversely τx=−x implies x=12(I−τ)x, so the (−1)-eigenspace is ran⁡P−(2). This completes (b).

2.2F1F2step 1.1algebra

[Norm identities on products] By [F1] the elementary tensors satisfy ∥u⊗v∥2=∥u∥2∥v∥2 and ⟨u⊗v,v⊗u⟩=⟨u,v⟩⟨v,u⟩=∣⟨u,v⟩∣2; expanding ∥u⊗v±v⊗u∥2=∥u⊗v∥2+∥v⊗u∥2±2Re⁡⟨u⊗v,v⊗u⟩ and using that the last number is the real number ∣⟨u,v⟩∣2 gives the two identities of (c). If u,v are orthonormal then ∥u∥=∥v∥=1 and ⟨u,v⟩=0, so s and a have norm one; moreover τs=12(v⊗u+u⊗v)=s and τa=12(v⊗u−u⊗v)=−a by [F2]; and ⟨s,a⟩=12(∥u⊗v∥2−∥v⊗u∥2)=0, so s,a are orthonormal and s≠0≠a. This proves (c).

3.1F1F2step 2.2algebraconstruct

[Nonvanishing of the swapped product] Let u,v be orthonormal. Then u⊗v and v⊗u are orthonormal in H⊗^H: both have norm one by [F1], and ⟨u⊗v,v⊗u⟩=⟨u,v⟩⟨v,u⟩=0. Hence v⊗u≠u⊗v, so τ(u⊗v)≠u⊗v by [F2]; taking x:=u⊗v and x′:=s and x′′:=a from step 2.2 gives nonzero vectors with τx′=x′ and τx′′=−x′′, so τ≠I. This proves (d).

4.1F1F2step 1.2step 3.1choosealgebra

[Zero and one-dimensional spaces] If H={0}, all elementary tensors are zero and their completion is zero, so τ=I on that space. If H is one-dimensional, fix a unit spanning vector e. Every elementary tensor has the form (αe)⊗(βe)=αβ(e⊗e) and its swap is βα(e⊗e), the same vector. Hence τ=I on the dense algebraic tensor space and, by boundedness, on its completion. Step 1.2 then gives P+(2)=I and P−(2)=0 in both cases. If dim⁡H≥2, normalize a nonzero vector u and choose w outside its span; the nonzero vector w−⟨w,u⟩u normalizes to a unit v orthogonal to u, so step 3.1 applies. This proves all branches of (d).

5.1step 1.1step 1.2step 2.1step 2.2step 3.1step 4.1∎

[Assembly] Step 1.1 proves (a), steps 1.2 and 2.1 prove (b), step 2.2 proves (c) and steps 3.1 and 4.1 prove (d). Only the cited tensor and permutation mathematics and the Countable Choice hypothesis of [F2] were used; no physical reading of the exchange operator is asserted.

Remarks

  • Why the letter τ. The operator is the n=2 instance of the permutation unitaries; the notation τ matches the exchange operator of the source treatments and is used on this pair's pages for the two-particle swap.
  • Scope. The lemma concerns a single Hilbert space and its tensor square; it asserts nothing about particles, spin, statistics or dynamics. The physical reading of τ as the exchange of two labelled factors is fixed in Declared species sectors and their preparations: the framework's reading of P6 on the page for the identical-particle model.

Depends on

Dependency tree · 2 levels

Sources