Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

Strong subadditivity of finite-dimensional quantum entropy

Statement

Let HA,HB,HC be nonzero finite-dimensional complex inner-product spaces and let ρABC be a density operator on their ordered tensor product. Write ρAB,ρBC,ρB for its marginals using the partial traces in Partial trace over a finite tensor factor. Then S(ρAB)+S(ρBC)≥S(ρB)+S(ρABC), where S(ρ)=−tr⁡(ρln⁡ρ) with 0ln⁡0:=0 as in Finite-dimensional von Neumann entropy.

Facts & Assumptions

Given: Nonzero finite-dimensional complex inner-product spaces HA,HB,HC and a density operator ρABC on HA⊗HB⊗HC.

[F1]

Finite-dimensional quantum relative entropy: D(X∥Y) is finite on support inclusion and equals tr⁡(Xln⁡X)−tr⁡(Xln⁡Y) there; otherwise it is +∞.

[F2]

Joint state support is contained in the tensor product of its marginal supports: for any bipartite state, the joint support is contained in the tensor product of its marginal supports, so its relative entropy to the product of its marginals is finite.

[F3]

Finite quantum mutual information identities and the Holevo identity: for a finite bipartite state ωUV, D(ωUV∥ωU⊗ωV)=S(ωU)+S(ωV)−S(ωUV).

[F4]

Partial-trace data processing for finite quantum relative entropy: for positive semidefinite X,Y on a finite tensor product, D(Tr⁡CX∥Tr⁡CY)≤D(X∥Y), including extended values.

[F5]

Density operator: a state is positive semidefinite and has trace one.

[F6]

Partial trace over a finite tensor factor: tracing out the last factor sums the diagonal blocks indexed by that factor.

[F7]

Ordered tensor registers, their inner product, and wire permutations: the product basis has the displayed factor order and tensor products act factorwise.

[F9]

Partial traces of a finite bipartite state are states: partial traces of a finite bipartite density operator are density operators.

Proof

1.1givenF1F2F5F7F8F9algebra

View ρABC first across the grouped bipartition A∣BC: [F9] makes ρA=Tr⁡BCρABC and ρBC=Tr⁡AρABC states. Applying [F9] across AB∣C also makes ρAB=Tr⁡CρABC a state. Applying it once more to ρAB across A∣B makes ρB=Tr⁡AρAB a state. This is also Tr⁡CρBC: in the ordered product basis [F6]–[F7], both have coefficient ∑a,c(ρABC)(a,b,c),(a,b′,c), since the finite sums may be reordered. The operator ρA⊗ρBC is also a state: spectral decompositions of the two positive factors give nonnegative product eigenvalues, and their sum is tr⁡(ρA)tr⁡(ρBC)=1. Applying [F2] to the bipartite states ρA∣BC and ρAB gives support inclusion for both relative entropies D(ρABC∥ρA⊗ρBC) and D(ρAB∥ρA⊗ρB); [F1] then makes both finite.

2.1givenF4F6F7step 1.1algebra

Set X=ρABC and Y=ρA⊗ρBC. By [F6] and the ordered product basis [F7], Tr⁡CX=ρAB and Tr⁡CY=ρA⊗Tr⁡CρBC=ρA⊗ρB: the latter equality follows entrywise by summing the C-diagonal block of ρBC while the A-factor matrix coefficient remains fixed. Apply [F4] to this pair to obtain D(ρAB∥ρA⊗ρB)≤D(ρABC∥ρA⊗ρBC).

3.1F3step 1.1step 2.1algebra∎

Both sides in step 2.1 are finite by step 1.1, so [F3] identifies them as S(ρA)+S(ρB)−S(ρAB) and S(ρA)+S(ρBC)−S(ρABC), respectively. Cancel the common finite term S(ρA) and rearrange the inequality to obtain S(ρAB)+S(ρBC)≥S(ρB)+S(ρABC).

Depends on

Used by

Dependency tree · two levels

46 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