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 one-body reduction trace law of the finite-mode permutation sectors

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H be a complex Hilbert space of finite dimension d≥1 (Hilbert space), let n≥1, let H⊗n be the n-fold completed tensor power with H⊗0:=C, H⊗1:=H and H⊗(k+1):=H⊗k⊗^H, let (Uπ)π∈Sn be the permutation unitaries and let Pσ(n), σ∈{+,−}, be the sector projections (Permutation sector projections on the n-fold tensor power), with sector space Hnσ:=ran⁡Pσ(n)⊆H⊗n. For O∈B(H) and i∈{1,…,n} let O(i)∈B(H⊗n) be the operator of clause (a) below, and put Σ(O):=∑i=1nO(i)∈B(H⊗n). Identify H⊗n with H⊗^H⊗(n−1) by the surjective linear isometry Jn of clause (b) below, and let Tr⁡H⊗(n−1) be the partial trace of Finite partial trace, Schmidt decomposition and finite no-signalling clause (a) over the second factor of that identification. Then:

(a) slot operators: for every O∈B(H) and every i∈{1,…,n} there is a unique O(i)∈B(H⊗n) with O(i)(v1⊗⋯⊗vn)=v1⊗⋯⊗vi−1⊗Ovi⊗vi+1⊗⋯⊗vn for all v1,…,vn∈H; it satisfies ∥O(i)∥≤∥O∥ and (O∗)(i)=(O(i))∗; in particular O=O∗ gives O(i)=(O(i))∗;

(b) parenthesisation: the assignment v1⊗⋯⊗vn↦v1⊗(v2⊗⋯⊗vn) extends to a surjective linear isometry Jn:H⊗n→H⊗^H⊗(n−1); for n=1 the empty product is 1∈C and J1u=u⊗1;

(c) permutation invariance: Uπ Σ(O) Uπ∗=Σ(O) for every π∈Sn; consequently Σ(O) preserves both sector spaces and commutes with Pσ(n): Σ(O)Pσ(n)=Pσ(n)Σ(O)=Pσ(n)Σ(O)Pσ(n);

(d) trace law: for every density operator ρ on the sector space Hnσ (Density operators and scalar spectral probability clause (a)), let j:Hnσ↪H⊗n be the isometric inclusion and define its zero extension ρ~:=jρj∗∈B(H⊗n); then for every O∈B(H) one has tr⁡(ρ~ Σ(O))=n tr⁡(γ O), where γ:=Tr⁡H⊗(n−1)(Jnρ~Jn−1)∈B(H);

(e) the reduced operator is a density operator: the operator γ of clause (d) is a density operator on H; it is independent of the choice of slot in the sense that it equals the partial trace of ρ~ over the other n−1 slots in the parenthesisation in which the retained slot is the one the display names; for n=1, γ=ρ. If Hnσ={0}, there is no density operator of trace one on that sector, so clauses (d)-(e) make no assertion about a sector preparation;

(f) scope: clauses (a)-(e) are exact operator identities on the finite-dimensional labelled tensor powers; no physical system, particle species, preparation or measurement is asserted, and the parameter n is a dimension count of the construction, not an observed particle number.

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 finite-dimensional complex Hilbert space H of dimension d≥1, the integer n≥1, the completed tensor powers H⊗n with permutation unitaries Uπ and sector projections Pσ(n), the operator O∈B(H), the slot index i, and the density operator ρ on Hnσ with its zero extension ρ~.

[F1]

Tensor powers. H⊗n is a complex Hilbert space; the elementary tensors have dense linear span; ∥v1⊗⋯⊗vn∥=∥v1∥⋯∥vn∥ and ⟨v1⊗⋯⊗vn,w1⊗⋯⊗wn⟩=∏k⟨vk,wk⟩; for orthonormal families spanning H the corresponding elementary tensors form an orthonormal family with dense span (Hilbert tensor construction: inner product, completion and product bases clauses (b), (c), (d)).

[F2]

Parenthesisation. For every parenthesisation the iterated tensor product represents multilinear maps, and different parenthesisations are connected by the unique isomorphism preserving pure tensors (Finite iterated tensor products represent multilinear maps independently of parenthesization).

[F3]

Bounded tensor maps. For complex Hilbert spaces V,W and S∈B(V), T∈B(W) there is a unique S⊗T∈B(V⊗^W) with (S⊗T)(u⊗v)=Su⊗Tv, ∥S⊗T∥≤∥S∥ ∥T∥, (S⊗T)∗=S∗⊗T∗, and for endomorphisms S⊗I and I⊗T commute (Bounded tensor maps: extension, norm estimate, adjoint and commutation clauses (a), (b), (c)).

[F4]

Permutation unitaries and sectors. Uπ is unitary with Uπ(v1⊗⋯⊗vn)=vπ^−1(1)⊗⋯⊗vπ^−1(n) and UπUσ=Uπσ; UπP+(n)=P+(n)Uπ=P+(n) and UπP−(n)=P−(n)Uπ=sgn⁡(π)P−(n); the range of P+(n) is the subspace of vectors fixed by every Uπ, and the range of P−(n) is the subspace of vectors transforming by sgn⁡ (Permutation sector projections on the n-fold tensor power clauses (a), (b), (c)).

[F5]

Partial trace. For endomorphisms R of V⊗W with V,W finite-dimensional, there is a unique endomorphism Tr⁡WR of V with tr⁡((Tr⁡WR)A)=tr⁡(R(A⊗IW)) for every A∈End⁡(V), independent of the orthonormal basis used in its construction; if R≥0 and tr⁡R=1 then Tr⁡WR≥0 and tr⁡Tr⁡WR=1 (Finite partial trace, Schmidt decomposition and finite no-signalling clauses (a), (b)).

[F6]

Density operators. A density operator on a nonzero complex Hilbert space is a self-adjoint positive trace-class operator of trace one (Density operators and scalar spectral probability clause (a), Trace class operator, Trace of a trace class operator).

[F7]

Trace laws. The trace of an endomorphism of a finite-dimensional space is basis independent, linear, and tr⁡(XY)=tr⁡(YX) (The basis-independent trace of an endomorphism of a finite-dimensional vector space, Trace is a linear functional on Mn(F)); for a trace-class operator T and bounded S one has tr⁡(ST)=tr⁡(TS) (Cyclicity of the trace).

[F8]

Agreement on dense sets. Two bounded linear operators from a normed space into a Banach space that agree on a dense subspace are equal (A bounded linear map from a dense normed subspace into a Banach space extends uniquely with the same norm).

Proof

technique · direct; construct the slot operators by conjugating the first-slot tensor map with a permutation unitary, transport the partial trace through the parenthesisation isometry, and reduce every slot to the first by permutation invariance and cyclicity

Given: the data of the statement and [F1]-[F9].

1.1F1F2F8algebra

[The parenthesisation isometry] For n=1, J1u=u⊗1 is an isometry by [F1], and every tensor in H⊗^C equals u⊗1, so it is surjective. For n≥2, the map (v1,…,vn)↦v1⊗(v2⊗⋯⊗vn) is multilinear from Hn into H⊗^H⊗(n−1), so by [F2] applied to the two parenthesisations of the n-fold algebraic tensor product it defines a linear map on the algebraic tensor product, and this linear map preserves inner products on elementary tensors by [F1]: ⟨v1⊗⋯⊗vn,w1⊗⋯⊗wn⟩=∏k⟨vk,wk⟩=⟨v1,w1⟩⟨v2⊗⋯⊗vn,w2⊗⋯⊗wn⟩. Since the elementary tensors span a dense subspace and both sides are complete, [F8] and this isometry identity give a linear isometry Jn on the completed tensor powers, and the image is closed and contains all elementary tensors v1⊗(v2⊗⋯⊗vn), whose span is dense by [F1]; hence Jn is surjective. This proves (b).

1.2F1F3algebra

[The first-slot operator] By [F3] the operator O⊗IH⊗(n−1)∈B(H⊗^H⊗(n−1)) is bounded with (O⊗I)(u⊗w)=Ou⊗w. Transporting it through the isometry Jn of clause (b) gives a bounded operator A1:=Jn−1(O⊗I)Jn on H⊗n with A1(v1⊗⋯⊗vn)=Jn−1(Ov1⊗(v2⊗⋯⊗vn))=Ov1⊗v2⊗⋯⊗vn for all v1,…,vn∈H.

1.3F4F6F7algebra

[The zero extension and its symmetry] With j the inclusion of the sector, ρ~=jρj∗ restricts to ρ on the sector and vanishes on its orthogonal complement. It is self-adjoint and positive because ⟨ρ~x,x⟩=⟨ρj∗x,j∗x⟩≥0; adjoining an orthonormal basis of the complement to one of the sector gives tr⁡ρ~=tr⁡ρ=1, so it is a density operator by [F6]. Since jj∗=Pσ(n) and Uπj=sgn⁡σ(π)j by [F4], ρ~=Pσ(n)ρ~Pσ(n) and Uπρ~Uπ∗=ρ~ for every π. A zero sector admits no trace-one endomorphism, so no ρ exists in that case.

2.1F1F3F4F8F9step 1.2algebra

[Slot operators and the permutation invariance of their sum] Fix i, choose π∈Sn with π^(1)=i and set O(i):=UπA1Uπ∗∈B(H⊗n); [F9] and step 1.2 give ∥O(i)∥=∥O⊗I∥≤∥O∥, and [F3], [F4] give (O(i))∗=UπJn−1(O∗⊗I)JnUπ∗=(O∗)(i), so O=O∗ gives O(i)=(O(i))∗. On elementary tensors, [F4] gives Uπ∗(v1⊗⋯⊗vn)=vπ^(1)⊗⋯⊗vπ^(n); step 1.2 replaces the first factor by Ovπ^(1)=Ovi; and Uπ then moves that factor to slot π^(1)=i, leaving every other factor in its original slot, so O(i)(v1⊗⋯⊗vn)=v1⊗⋯⊗Ovi⊗⋯⊗vn. If π′ is another permutation with π′^(1)=i, then τ:=π−1π′ has τ^(1)=1 and UτA1Uτ∗ agrees with A1 on elementary tensors by [F1], [F3], hence equals it by [F8]; thus Uπ′A1Uπ′∗=UπUτA1Uτ∗Uπ∗=UπA1Uπ∗ and O(i) is well defined, with the displayed elementary-tensor action. For τ∈Sn one then has UτO(i)Uτ∗=UτπA1Uτπ∗=O(τ^(i)), and summing over i with τ^ permuting {1,…,n} gives UτΣ(O)Uτ∗=Σ(O) for Σ(O):=∑i=1nO(i); equivalently Σ(O) commutes with every Uτ. Since Pσ(n)=1n!∑π∈Snsgn⁡σ(π)Uπ is a finite linear combination of the Uπ by [F4], Σ(O) commutes with Pσ(n), so it preserves Hnσ and its orthogonal complement and Σ(O)Pσ(n)=Pσ(n)Σ(O)=Pσ(n)Σ(O)Pσ(n); this proves (a) and (c).

3.1F4F5F6F7step 1.1step 1.2step 1.3step 2.1algebra

[Reduction to one slot, the trace law and the reduced operator] By steps 1.3 and 2.1 and [F7], for π^(1)=i one has tr⁡(ρ~O(i))=tr⁡(Uπ∗ρ~UπA1)=tr⁡(ρ~A1). Set Rn:=Jnρ~Jn−1, an endomorphism of H⊗^H⊗(n−1). Its partial trace γ:=Tr⁡H⊗(n−1)Rn is an endomorphism of H by [F5]. Step 1.2 and [F5], [F7] give tr⁡(ρ~Σ(O))=ntr⁡(ρ~A1)=ntr⁡(Rn(O⊗I))=ntr⁡(γO), proving (d). Unitary transport by Jn preserves positivity and trace, so Rn is positive of trace one; [F5] then makes γ positive of trace one and hence a density operator on H by [F6]. For the retained slot i, use JnUπ∗ as the parenthesisation map; its transported state is JnUπ∗ρ~UπJn−1=Rn by step 1.3, so its partial trace is the same γ. More generally the pairing tr⁡(γO)=n−1tr⁡(ρ~Σ(O)) for every O uniquely determines γ: testing against O=Tu,v gives tr⁡(γTu,v)=⟨γu,v⟩ by Rank-one operator calculus clause (e), which determines every matrix entry. For n=1, J1u=u⊗1, Pσ(1)=I and Σ(O)=O, so this pairing gives γ=ρ. This proves (e), including the one-particle boundary.

4.1step 1.1step 2.1step 3.1∎

[Conclusion and scope] Step 1.1 proves (b), step 2.1 proves (a) and (c), and step 3.1 proves (d) and (e); every argument used only the finite-dimensional tensor construction, the permutation sectors, the partial trace and the trace axioms, and no physical object, preparation or measurement entered, which is clause (f).

Remarks

  • Reading of the identities. The law tr⁡(ρ~ Σ(O))=ntr⁡(γO) says that the mean of the sum of one-body slot operators in the sector preparation is n times the trace pairing of a single one-particle operator with a reduced operator γ on the one-particle space. Only the identity is asserted here; its physical reading requires the framework postulates and a declared preparation, and is stated separately.
  • Why the factor n appears. The sum Σ(O) has n slot terms with equal pairings by permutation invariance of the sector state, and γ is normalised once, tr⁡γ=1; the factor n is the multiplicity of the sum, not a further normalisation.

Depends on

Dependency tree · 2 levels

Sources