Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 partial trace is characterized by the trace pairing and is basis-independent

Statement

For finite-dimensional complex inner-product spaces HA,HB, the partial trace Tr⁡B:End⁡(HA⊗HB)→End⁡(HA) is the unique linear map satisfying

tr⁡((Tr⁡BR)∘T)=tr⁡(R∘(T⊗IHB))for every R∈End⁡(HA⊗HB) and T∈End⁡(HA).

Here IHB is the identity map y↦y on HB; End⁡ is the notation defined in Partial trace over a finite tensor factor.

Its coordinate formula is independent of the chosen ordered orthonormal basis of HB. The assertion includes zero-dimensional factors.

Facts & Assumptions

Given: Finite-dimensional complex inner-product spaces HA,HB, an operator R∈End⁡(HA⊗HB), and the partial trace from Partial trace over a finite tensor factor.

[F1]

In ordered orthonormal bases, (Tr⁡BR)ii′=∑jR(i,j),(i′,j), with an empty sum equal to 0 (Partial trace over a finite tensor factor).

[F2]

The tensor map T⊗IHB sends each elementary tensor ei⊗fj to (Tei)⊗fj (Tensor products of finitely many linear maps).

[F3]

The product basis is an orthonormal basis and spans the tensor space, including the empty-basis cases (The product basis is orthonormal and tensor dimensions multiply).

[F4]

The trace of a finite-dimensional endomorphism is the sum of its diagonal matrix entries in any ordered basis, including the zero-dimensional case (The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace tr⁡(A) as the sum of the diagonal entries).

[F5]

If tr⁡(DA)=0 for every endomorphism A of a finite-dimensional complex vector space, then D=0 (The trace pairing on a finite endomorphism space is nondegenerate).

[F6]

The matrix of a composite is the product of the matrices in matching ordered bases ([S∘T]BD=[S]CD[T]BC).

[F8]

Every finite-dimensional real or complex inner-product space has an orthonormal basis, with the empty basis in dimension zero (Every finite-dimensional real or complex inner product space has an orthonormal basis).

[F9]

Identity maps and compatible composites of linear maps are linear (Identity maps and composites of linear maps are linear).

Proof

1.1givenF1F4F6F7F8choosealgebra

By [F8], choose ordered orthonormal bases (ei)i<a of HA and (fj)j<b of HB, and set S=Tr⁡B(R). For any T∈End⁡(HA), [F1], [F6] and [F7] give tr⁡(S∘T)=∑i,i′<a∑j<bR(i,j),(i′,j)Ti′i.

2.1step 1.1F2F3F6F7F9algebra

The identity IHB is linear by [F9], so [F2] defines the linear map T⊗IHB; its composite with R is linear by [F9]. In the product basis, [F2] gives the matrix entry Ti′iδj′j of T⊗I. By [F6] and [F7], tr⁡(R∘(T⊗I))=∑i,j∑i′,j′R(i,j),(i′,j′)Ti′iδj′j=∑i,i′,jR(i,j),(i′,j)Ti′i, which is the same finite sum as in step 1.1. Thus S satisfies the displayed trace identity.

3.1step 2.1F5

If S′ is any other map value at R satisfying the identity for every T, then tr⁡((S−S′)∘T)=0 for every T. Apply [F5] on HA to obtain S=S′. Since this holds for every R, the trace identity characterizes the partial-trace map uniquely.

4.1step 1.1step 2.1step 3.1F4

Repeat steps 1.1 and 2.1 with any other ordered orthonormal basis of HB. The right-hand side is the trace of the same endomorphism R∘(T⊗IHB), and [F4] makes that trace basis-independent. Step 3.1 then forces the resulting partial-trace operator to equal S.

5.1F1F3F4algebra∎

If HB=0, the product space and R are zero, [F1] is the empty sum, and both sides of the trace identity are 0. If HA=0, the input and output endomorphism spaces contain only the zero map, so the same identity and uniqueness hold.

Depends on

Used by

Cited to discharge well-definedness by Partial trace over a finite tensor factor.

Dependency tree · two levels

32 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources