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.

Nonnegativity of finite-dimensional quantum conditional mutual information

Statement

Let ρABC be a finite-dimensional tripartite state, with conditional mutual information defined by Finite quantum mutual, conditional, and conditional mutual information. Then I(A:B∣C)ρ=S(ρAC)+S(ρBC)−S(ρC)−S(ρABC)≥0.

Facts & Assumptions

Given: A density operator ρABC on a finite ordered tensor product HA⊗HB⊗HC.

[F1]

Finite quantum mutual, conditional, and conditional mutual information: I(A:B∣C)=S(ρAC)+S(ρBC)−S(ρC)−S(ρABC), where ρAC is obtained by permuting A,B,C to A,C,B and tracing out the last factor.

[F2]

Strong subadditivity of finite-dimensional quantum entropy: every tripartite state ωUVW satisfies S(ωUV)+S(ωVW)≥S(ωV)+S(ωUVW).

[F3]

Finite wire permutations are unitary basis permutations: reordering tensor factors gives a unitary basis permutation.

[F4]

Partial trace over a finite tensor factor and Ordered tensor registers, their inner product, and wire permutations: partial traces sum matrix blocks in the displayed ordered product basis, and the tensor factors retain their specified order.

[F5]

Finite-dimensional von Neumann entropy: entropy is the sum −∑λ>0λln⁡λ over positive eigenvalues.

Proof

1.1givenF1F3F5F6constructalgebra

Let QBC:HB⊗HC→HC⊗HB be the two-factor swap and let P=IA⊗QBC:HA⊗HB⊗HC→HA⊗HC⊗HB. Put τACB=PρABCP†. By [F3], P is unitary; therefore an orthonormal eigenbasis of ρABC is carried to an orthonormal eigenbasis of τACB with the same eigenvalues, and [F5] gives S(τACB)=S(ρABC). The AC marginal of τ is exactly ρAC by the definition in [F1].

2.1givenF3F4F5F6step 1.1algebra

In the product basis, tracing out A from τ gives τCB=QBCρBCQBC†: its (c,b),(c′,b′) coefficient is the sum over a of the ρ coefficients with indices (a,b,c),(a,b′,c′), which is precisely the swapped coefficient. Thus [F3] and the eigenvalue argument in step 1.1 give S(τCB)=S(ρBC). Tracing out both A and B gives the same C marginal τC=ρC, since the finite sums over their basis indices are merely reordered.

3.1givenF1F2step 1.1step 2.1algebra∎

Apply [F2] to the tripartite state τ with middle register C. It yields S(τAC)+S(τCB)−S(τC)−S(τACB)≥0. Substituting the equalities in steps 1.1 and 2.1 gives exactly the expression in [F1], so I(A:B∣C)ρ≥0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

40 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