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

Finite spin components of an N-fold spatial tensor product

Statement

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.

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let N,r≥1 be integers, H=L2(R3;Cr), SN=(Cr)⊗N, and M=rN. In the product basis ea=ea1⊗⋯⊗eaN indexed by a∈{1,…,r}N, identify SN with CM and write LN=L2(R3N;CM). Then:

(a) There is a unique unitary ΘN:H⊗N→LN such that [ΘN(f1⊗⋯⊗fN)]a(x1,…,xN)=∏j=1N[fj(xj)]aj.

(b) For π∈SN, let Uπ be the permutation of the complete one-particle factors and Rπea=eaπ^−1(1)⊗⋯⊗eaπ^−1(N) the permutation of spin factors. With Xπ=(xπ^(1),…,xπ^(N)), the conjugate permutation is Uπ:=ΘNUπΘN−1,(UπΨ)(X)=RπΨ(Xπ). In particular [UπΨ]a(X)=Ψ(aπ^(1),…,aπ^(N))(Xπ); averaging this combined action gives P±=ΘNP±(N)ΘN−1.

(c) The component domain DN=W2,2(R3N;CM) is the set of tuples with every scalar component in W2,2(R3N;C). If a scalar self-adjoint T has this scalar domain and its domain is preserved by every spatial block permutation, commuting with that permutation on the domain, its finite direct sum TMΨ=(TΨa)a on DN is self-adjoint, retains every scalar lower bound T≥cI, and commutes with the combined permutations on that domain. The restrictions of TM to ran⁡P±, with domain DN∩ran⁡P±, are self-adjoint when the sector is nonzero; on the zero sector the unique zero operator has domain {0}.

(d) For matrices Aj∈B(Cr), the constant spin action A1⊗⋯⊗AN preserves DN and commutes with TM. Its permutation covariance is Rπ(A1⊗⋯⊗AN)Rπ−1=Aπ^−1(1)⊗⋯⊗Aπ^−1(N). Thus a common internal unitary A⊗N commutes with Uπ, preserves both sectors and commutes with their restricted operators. This is a tensor identity and asserts no physical spin-statistics assignment. For r=1 all spin actions are scalar and ΘN is the iterated scalar product unitary; for N=1 it is the identity component identification.

Facts & Assumptions

Given: N,r,H,SN,M,LN, the product spin basis, and in (c) the scalar self-adjoint T with domain W2,2 and spatial permutation invariance.

[F1]

The scalar Euclidean product map is unitary and permits finite component sums (Euclidean L² product unitary: L²(R^a)⊗̂L²(R^b) ≅ L²(R^{a+b}) Statement); iterating it gives the scalar N-factor product map. The component identification is unitary for every Euclidean dimension and finite component count (Unitary identifications of the component-valued wave-function space (a), (b)).

[F2]

Tensor pairings multiply, elementary tensors span densely, and spin product bases are orthonormal; bounded factor maps extend with their tensor action and adjoints (Hilbert tensor construction: inner product, completion and product bases, Bounded tensor maps: extension, norm estimate, adjoint and commutation). Factor permutations and their symmetric/sign averages are unitary and orthogonal projections respectively (Permutation sector projections on the n-fold tensor power (a)-(c)).

[F3]

A self-adjoint operator invariant on its domain under a unitary finite-group permutation representation restricts self-adjointly to each nonzero symmetric/sign sector (Permutation-restricted self-adjointness (a)-(d)); the scalar-only application (e) is not needed for a spin sector.

Proof

Given: The data of the Statement and [F1]-[F3].

1.1F1F2givenalgebra

[Finite component product unitary] Resolve each one-particle vector into its r components by [F1]. On the dense span of vectors (g1ea1)⊗⋯⊗(gNeaN), send this vector to the function (∏jgj(xj))ea. Inner products of such vectors are the product of the scalar pairings times ∏jδajbj by [F2]; their image pairings have exactly the same value by the iterated scalar unitary [F1]. Linearity therefore gives a well-defined isometry on this dense span. Its image is dense: in each of the finitely many components the scalar products span densely by [F1]. The isometry extends to the completion; its range is closed by completeness and dense, hence all of LN. Expansion of the finite components gives the formula in (a), and equality on a dense span gives uniqueness.

2.1step 1.1F2algebra

[Combined permutation] On the component product vectors of step 1.1, applying Uπ replaces the factor in slot j by the former factor in slot π^−1(j). Evaluating the product formula gives (UπΨ)(X)=RπΨ(Xπ), including the displayed component-index formula. Both operators are bounded unitaries, so the equality extends by density. Conjugating the finite averages of [F2] gives P±; this simultaneously permutes spatial blocks and spin slots.

3.1givenstep 2.1algebra

[Finite component domain and self-adjointness] Since there are finitely many components, the definition of weak derivatives shows DN=(W2,2(R3N;C))⊕M: derivative testing and integrability hold componentwise in both directions, and all norms are finite sums. The direct sum TM is dense and symmetric. A vector η lies in D(TM∗) precisely when testing separately in each component puts ηa∈D(T∗)=D(T) for every a; conversely these finitely many adjoint values give a vector in LN. Thus D(TM∗)=DN and TM∗=TM. If T≥cI, summing the scalar quadratic inequalities gives TM≥cI. The hypothesis on scalar spatial permutations gives domain preservation and commutation for their componentwise action; Rπ is a constant permutation of finitely many components, so it preserves the domain and commutes with TM too. Their combined action in step 2.1 has both properties.

4.1step 2.1step 3.1F3algebra

[Sector restrictions] Apply [F3] to the self-adjoint TM of step 3.1 and the combined representation from step 2.1. It gives reduction and self-adjointness on every nonzero ran⁡P± with exactly the stated intersection domain. If a sector is zero, its Hilbert space and dense operator domain are both {0}, so its unique operator is its own adjoint.

5.1step 1.1step 2.1step 3.1step 4.1F2algebra∎

[Spin covariance and edge cases] A constant spin matrix makes finite linear combinations of the scalar components, so it preserves DN and commutes with the componentwise scalar TM. On elementary spin tensors the conjugation by Rπ reorders the matrices to Aπ^−1(j) in slot j; by linearity this is the displayed covariance on all of SN. For a common A, the reordering leaves A⊗N unchanged, so it commutes with each combined permutation and its averages; if A is unitary the inverse has the same properties, proving onto preservation of both sectors and their domains. At r=1 the sole component is scalar, and at N=1 the product formula is the original vector-valued function. These establish (d) and all stated branches.

Depends on

Dependency tree · 2 levels

Sources