Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Partial trace contracts trace distance

Statement

Let HA,HB be nonzero finite-dimensional complex inner-product spaces and let ρ,σ be density operators on HA⊗HB. Then D(Tr⁡HBρ,Tr⁡HBσ)≤D(ρ,σ).

Facts & Assumptions

Given: The finite-dimensional spaces, density operators ρ,σ, the partial trace over the second factor, and trace distance.

[F1]

In ordered product orthonormal bases, (Tr⁡HBX)ii′=∑jX(i,j),(i′,j), and the partial trace satisfies tr⁡((Tr⁡HBX)A)=tr⁡(X(A⊗IHB)) (Partial trace over a finite tensor factor, The partial trace is characterized by the trace pairing and is basis-independent).

[F2]

The partial trace of a nonnegative operator is nonnegative and it preserves total trace, so it maps density operators to density operators (The partial trace preserves non-negativity and total trace).

[F3]

Trace distance is one half of the trace norm of the state difference; the trace norm is the sum of singular values and equals tr⁡X∗X (Trace Distance, Trace Norm, Trace Norm Spectral Formula).

[F4]
[F5]

A⊗IHB acts by A on the first factor and identity on the second; the product basis is orthonormal (Tensor products of finitely many linear maps, Ordered tensor registers, their inner product, and wire permutations, The product basis is orthonormal and tensor dimensions multiply).

[F6]

The operator norm is the maximum of ∥Tv∥ over unit vectors on a nonzero domain (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||).

[F7]

Cauchy–Schwarz gives ∣⟨u,v⟩∣≤∥u∥ ∥v∥ (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

Proof

1.1givenF1F2algebra

Put X=ρ−σ and Y=Tr⁡HBX. Both are Hermitian. For Y, this follows directly from [F1]: conjugating its (i,i′) entry and using X(i,j),(i′,j)=X(i′,j),(i,j)‾ gives Yii′‾=Yi′i. By [F2], the two partial traces of ρ,σ are density operators, so their trace distance is defined.

1.2givenF3F4F6F7algebra

For any finite-dimensional Hermitian Z, diagonalize it in an orthonormal basis with eigenvalues λi∈R. If A=A∗ and ∥A∥≤1, then each diagonal entry ⟨Aei,ei⟩ is real and lies in [−1,1]: [F7] gives ∣⟨Aei,ei⟩∣≤∥Aei∥∥ei∥≤∥A∥≤1, where the middle inequality follows from [F6] by scaling a unit vector. Hence ∣tr⁡(ZA)∣=∣∑iλi⟨Aei,ei⟩∣≤∑i∣λi∣=∥Z∥1 by [F3]–[F4]. Equality is attained by the self-adjoint contraction A=∑λi>0Pi−∑λi<0Pi, so ∥Z∥1=max⁡A=A∗, ∥A∥≤1tr⁡(ZA).

2.1F1F4F5F6F7step 1.2algebra

For every self-adjoint contraction A on HA, [F4] gives an orthonormal eigenbasis of A. If Ae=λe for a unit eigenvector, then [F7] and [F6] give ∣λ∣=∣⟨Ae,e⟩∣≤∥Ae∥∥e∥≤∥A∥≤1. By [F5], the product basis diagonalizes A⊗IHB with each eigenvalue repeated, so this tensor operator is a self-adjoint contraction as well. The pairing identity [F1] gives tr⁡(YA)=tr⁡(X(A⊗IHB)), whose absolute value is at most ∥X∥1 by step 1.2 applied on HA⊗HB. Taking the maximum over A in step 1.2 on HA yields ∥Y∥1≤∥X∥1.

3.1F1F3step 2.1algebra∎

Apply the trace-distance definition [F3] to X=ρ−σ and Y=Tr⁡HBρ−Tr⁡HBσ=Tr⁡HBX. Step 2.1 gives 2D(Tr⁡HBρ,Tr⁡HBσ)=∥Y∥1≤∥X∥1=2D(ρ,σ); division by 2 proves the assertion.

Depends on

Used by

Dependency tree · two levels

48 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