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

Subsystem expectations and reduced finite tensor densities

Statement

Let VA,VB be nonzero finite-dimensional ordered tensor registers as in Ordered tensor registers, their inner product, and wire permutations, with the product orthonormal bases and linear-first inner products specified there. On any such register W, use finite tensor density to mean a matrix R with R=R∗, x∗Rx≥0 for every coordinate vector x, and Tr⁡R=1. Here R∗ is the conjugate transpose and Tr⁡R is the sum of its diagonal entries. A finite POVM on W is a family (Ma)a=1r, r≥1, of Hermitian matrices with x∗Max≥0 for every x and ∑aMa=IW; an effect is a Hermitian matrix M with 0≤M≤IW, meaning both M and IW−M are nonnegative in this sense. These conventions extend the identical coordinate definitions of Finite tensor density, observable and measurement language from W=(Cq)⊗N to arbitrary nonzero finite ordered registers. Let ρ be a finite tensor density on VA⊗VB. Then ρA:=Tr⁡Bρ is a finite tensor density on VA. For every matrix A on VA, Tr⁡(ρAA)=Tr⁡(ρ(A⊗IB)). For a finite POVM (Ma)a=1r on VA, the trace pairings of its outcomes in ρA equal the trace pairings of the lifted effects Ma⊗IB in ρ.

Facts & Assumptions

Given: The ordered tensor and density conventions specified in the Statement, a density ρ on VA⊗VB, and a finite POVM when the last claim is used.

[F1]

Partial trace over a finite tensor factor: the partial trace contracts the second tensor factor in the specified product basis.

[F2]

The partial trace is characterized by the trace pairing and is basis-independent: its trace-pairing identity is tr⁡((Tr⁡BR)T)=tr⁡(R(T⊗IB)).

[F3]

The partial trace preserves non-negativity and total trace: partial trace preserves non-negativity and total trace.

[F4]

Ordered tensor registers, their inner product, and wire permutations: the ordered product basis is orthonormal for the product inner product and spans VA⊗VB.

[F5]

Tensor products of finitely many linear maps: M⊗IB is the linear tensor map sending x⊗y to Mx⊗y.

[F6]

The Statement's extension of Finite tensor density, observable and measurement language: a finite POVM on any of the stated registers is a family of nonnegative matrices whose sum is the identity.

Proof

1.1givenF1F3

By the coordinate definition [F1], ρA is the second-factor partial trace. Apply [F3] to the nonnegative trace-one operator ρ. It gives ρA≥0 and Tr⁡ρA=Tr⁡ρ=1; therefore ρA is a finite tensor density by the Statement's explicit definition on VA.

2.1givenF2F4F5F6algebra∎

Apply [F2] with R=ρ and T=A to obtain the displayed expectation identity. If (Ma) is a POVM, choose an orthonormal basis (bj)j=1dim⁡VB of VB. For x=∑jxj⊗bj, the product inner product [F4] and tensor map [F5] give ⟨(Ma⊗IB)x,x⟩=∑j⟨Maxj,xj⟩≥0, where nonnegativity of each Ma follows from [F6]; hence every lifted matrix is nonnegative. Moreover, ∑a=1rMa⊗IB=(∑a=1rMa)⊗IB=IA⊗IB=IVA⊗VB; the final identity holds on every elementary tensor, hence on the whole finite tensor product by [F5]. Therefore the lifts are a POVM, and each is an effect because its complement is the sum of the other nonnegative lifts by [F6]. Substituting A=Ma in the trace-pairing identity shows that each lifted outcome pairing equals the corresponding reduced-state pairing.

Depends on

Dependency tree · 2 levels

Sources