Alphabeta Math
TheoremStatement: 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-restricted self-adjointness

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space, let H be a self-adjoint operator on H (Symmetric, self-adjoint and essentially self-adjoint operators), let N≥1, and let (Uπ)π∈SN be unitary operators on H with UπUσ=Uπσ and Uπ∗=Uπ−1 for all π,σ∈SN (The Hilbert-space adjoint of a bounded operator). Define P+:=1N!∑π∈SNUπ,P−:=1N!∑π∈SNsgn⁡(π)Uπ. Assume that for every π∈SN, UπD(H)⊆D(H)andUπHψ=HUπψ(ψ∈D(H)). Then:

(a) P+ and P− are orthogonal projections on H;

(b) for every z∈ρ(H) one has Uπ(H−z)−1=(H−z)−1Uπ and hence P±(H−z)−1=(H−z)−1P±;

(c) P±D(H)⊆D(H) and HP±ψ=P±Hψ for every ψ∈D(H);

(d) if ran⁡P±≠{0}, then the restriction H±:=H∣D(H)∩ran⁡P± is a self-adjoint operator on the Hilbert space ran⁡P± (Range criterion for self-adjointness);

(e) application: under the additional Axiom of Choice (The Axiom of Choice), let N≥1, m>0, ℏ>0, let r≥1, let Vext,W:R3→R be measurable and bounded, and assume W(−z)=W(z) for every z∈R3. Put V(X):=∑i=1NVext(xi)+∑i<jW(xi−xj) on R3N, let K be the free kinetic operator of Bounded fixed-N operator with all masses mi=m, let Θ:L2(R3)⊗N→L2(R3N) be the iterated Euclidean product unitary (Euclidean L² product unitary: L²(R^a)⊗̂L²(R^b) ≅ L²(R^{a+b}), Hilbert tensor construction: inner product, completion and product bases), let Uπ be the permutation unitaries of Permutation sector projections on the n-fold tensor power and set Uπphys:=Θ Uπ Θ−1,P±phys:=Θ P±(N) Θ−1. Then H:=K+MV satisfies the hypotheses above for the representation Uπphys, so P±phys reduce H and the restrictions of H to the symmetric and antisymmetric sectors are self-adjoint on those sectors.

No spin-statistics statement, no identification of a physical species with a sector, and no claim about bound states or spectra is made.

Facts & Assumptions

Slot convention. For ℓ≥1, Sℓ acts on {0,…,ℓ−1} as in Permutation sector projections on the n-fold tensor power. On one-based tuple positions use π^(k):=1+π(k−1) for 1≤k≤ℓ. Conjugation by k↦k−1 gives πσ^=π^∘σ^ and π−1^=π^−1; thus the supplier's tensor action becomes Uπ(v1⊗⋯⊗vℓ)=vπ^−1(1)⊗⋯⊗vπ^−1(ℓ). The parameters of Uπ and sgn⁡(π) remain canonical zero-based permutations. Given: the complex Hilbert space H, the self-adjoint operator H, the unitary representation (Uπ) of SN, its averages P±, numbers z∈ρ(H) and vectors ψ,φ∈H.

[F1]

By The finite symmetric group Sn, one-line notation, and cycle notation, SN consists of the bijections of an N-element set, so it has N! elements by choosing successive images in N,N−1,…,1 ways. Its sign map is a homomorphism and is surjective for N≥2 (The sign is a homomorphism Sn→{+1,−1}, surjective exactly when n≥2); choose τ with sgn⁡(τ)=−1. Left multiplication by τ pairs the terms of ∑π∈SNsgn⁡(π) with their negatives, so this sum is zero. Group averaging now gives P+∗=P+, P+2=P+ and likewise P−∗=P−, P−2=P−; for N=1, both averages equal the identity. The Hilbert adjoint and bounded-operator conventions are The Hilbert-space adjoint of a bounded operator and A bounded linear operator between normed spaces.

[F2]

For a self-adjoint H and z∈ρ(H) the resolvent R(z):=(H−z)−1 is a bounded bijection of H onto D(H) with inverse H−z; D(H) is dense (Symmetric, self-adjoint and essentially self-adjoint operators, A bounded linear operator between normed spaces).

[F3]

Range criterion: a densely defined symmetric operator S is self-adjoint if and only if it is closed and ran⁡(S−i)=ran⁡(S+i)=H; equivalently if it is closed, symmetric and both S±i are surjective (Range criterion for self-adjointness).

[F4]

The Euclidean product unitary Θ:H1⊗N→L2(R3N) satisfies Θ(f1⊗⋯⊗fN)(x)=f1(x1)⋯fN(xN); the permutation unitaries act by Uπ(f1⊗⋯⊗fN)=fπ^−1(1)⊗⋯⊗fπ^−1(N). The equal-mass free kinetic operator is the maximal Fourier multiplier K=F2∗MκF2, κ(ξ)=ℏ22m∑i∣ξi∣2, on D(K)=W2,2(R3N;C). With the supplier's e−2πiX⋅ξ convention, it equals −ℏ28π2m∑iΔi there. The multiplier V as in (e) is invariant under permutations of the coordinates because W is even (Euclidean L² product unitary: L²(R^a)⊗̂L²(R^b) ≅ L²(R^{a+b}), Hilbert tensor construction: inner product, completion and product bases, Permutation sector projections on the n-fold tensor power, Bounded fixed-N operator).

Proof

1.1F1algebra

[The averages are projections] Since π↦Uπ is a unitary representation and Uπ∗=Uπ−1, P+∗=1N!∑πUπ−1=P+ and P+2=1(N!)2∑π,σUπσ=1N!∑τUτ=P+; the same computation with the characters gives P−∗=P−, P−2=P−. Hence both are orthogonal projections, which is (a).

1.2F2algebra

[Resolvent commutation] Fix z∈ρ(H) and φ∈H; put ψ:=R(z)φ∈D(H). By hypothesis Uπψ∈D(H) and (H−z)Uπψ=Uπ(H−z)ψ=Uπφ; hence UπR(z)φ=R(z)Uπφ for every φ, so UπR(z)=R(z)Uπ; averaging gives P±R(z)=R(z)P±, which is (b).

1.3givenF1algebra

[Reduction] Put χ+(π)=1 and χ−(π)=sgn⁡(π). For ψ∈D(H), P±ψ=1N!∑πχ±(π)Uπψ∈D(H) as a finite linear combination, and the commutation hypothesis gives HP±ψ=1N!∑πχ±(π)HUπψ=1N!∑πχ±(π)UπHψ=P±Hψ, proving (c).

2.1F3step 1.3algebra

[Self-adjointness of the restrictions] Assume ran⁡P≠{0} for P=P± and put K:=ran⁡P and S:=H∣D(H)∩K. Then D(S)=PD(H) is dense in K and S is symmetric: for φ,ψ∈D(S), ⟨Sφ,ψ⟩=⟨Hφ,ψ⟩=⟨φ,Hψ⟩=⟨φ,Sψ⟩ because H is self-adjoint and ψ=Pψ. S is closed: if ψk∈D(S), ψk→ψ and Sψk→η with ψ,η∈K, then H closed gives ψ∈D(H) and Hψ=η, and ψ∈K because K is closed; hence ψ∈D(S), Sψ=η. Finally ran⁡(S−i)=Pran⁡(H−i): indeed (S−i)Pψ=P(H−i)ψ by step 1.3, and conversely every Pχ with χ∈H equals P(H−i)(H−i)−1χ=(S−i)P(H−i)−1χ. Since H−i is onto H ([F3] applied to the self-adjoint H), ran⁡(S−i)=K, and the same argument gives ran⁡(S+i)=K. By [F3], S is self-adjoint on K; this proves (d).

3.1F4step 1.2step 1.3step 2.1algebra

[The permutation-invariant instance] Let H=K+MV as in (e). The unitaries Uπphys=ΘUπΘ−1 form a unitary representation of SN on L2(R3N) ([F4]). The weight κ(ξ)=ℏ22m∑i∣ξi∣2 is invariant under permutations of the blocks ξi, so ΘUπΘ−1 maps D(K) onto itself and intertwines K with itself; and V(πX)=V(X) gives UπphysMVUπphys,−1=MV on all of L2. Hence UπphysD(H)=D(H) and UπphysH=HUπphys on D(H), and step 2.1 applies to P±phys, proving (e).

4.1step 1.1step 1.2step 1.3step 2.1step 3.1algebra∎

[Conclusion and scope] Steps 1.1-3.1 prove (a)-(e). The scope paragraph of the statement records that no spin-statistics assignment and no spectral conclusion is asserted; the symmetric and antisymmetric sectors are mathematical invariant subspaces of the specified operator.

Depends on

Dependency tree · 2 levels

Sources