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 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 , use finite tensor density to mean a matrix with , for every coordinate vector , and . Here is the conjugate transpose and is the sum of its diagonal entries. A finite POVM on is a family , , of Hermitian matrices with for every and ; an effect is a Hermitian matrix with , meaning both and are nonnegative in this sense. These conventions extend the identical coordinate definitions of Finite tensor density, observable and measurement language from to arbitrary nonzero finite ordered registers. Let be a finite tensor density on . Then is a finite tensor density on . For every matrix on , For a finite POVM on , the trace pairings of its outcomes in equal the trace pairings of the lifted effects in .
Facts & Assumptions
Given: The ordered tensor and density conventions specified in the Statement, a density on , and a finite POVM when the last claim is used.
Partial trace over a finite tensor factor: the partial trace contracts the second tensor factor in the specified product basis.
The partial trace is characterized by the trace pairing and is basis-independent: its trace-pairing identity is .
The partial trace preserves non-negativity and total trace: partial trace preserves non-negativity and total trace.
Ordered tensor registers, their inner product, and wire permutations: the ordered product basis is orthonormal for the product inner product and spans .
Tensor products of finitely many linear maps: is the linear tensor map sending to .
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
By the coordinate definition [F1], is the second-factor partial trace. Apply [F3] to the nonnegative trace-one operator . It gives and ; therefore is a finite tensor density by the Statement's explicit definition on .
Apply [F2] with and to obtain the displayed expectation identity. If is a POVM, choose an orthonormal basis of . For , the product inner product [F4] and tensor map [F5] give where nonnegativity of each follows from [F6]; hence every lifted matrix is nonnegative. Moreover, 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 in the trace-pairing identity shows that each lifted outcome pairing equals the corresponding reduced-state pairing.
Depends on
Finite tensor density, observable and measurement language
Partial trace over a finite tensor factor
Ordered tensor registers, their inner product, and wire permutations
Tensor products of finitely many linear maps
The partial trace is characterized by the trace pairing and is basis-independent
The partial trace preserves non-negativity and total trace