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

Additivity of optimized entanglement-assisted information

Statement

For a finite-dimensional channel N:A→B, define

fN(ρ):=S(ρ)+Ic(ρ,N),F(N):=sup⁡ρ∈D(A)fN(ρ).

For any two finite-dimensional channels Ni:Ai→Bi,

F(N1⊗N2)=F(N1)+F(N2).

Facts & Assumptions

Given: The channels, finite input spaces, and coherent-information convention in the Statement.

[F1]

Complementary channels and coherent information and Coherent information equals output entropy minus environment entropy: for a fixed dilation Ai→Bi⊗Ei, Ic(ρ,Ni)=S(Bi)−S(Ei).

[F2]

Finite quantum mutual, conditional, and conditional mutual information: I(X:Y)=S(X)+S(Y)−S(XY) for finite bipartite states.

[F3]

Data processing for finite quantum mutual information: applying local channels to two registers cannot increase their quantum mutual information.

[F4]

Strong subadditivity of finite-dimensional quantum entropy: for every finite tripartite state, S(XY)+S(YZ)≥S(Y)+S(XYZ).

[F6]

The maximally mixed state maximizes finite quantum entropy: a density operator on a register of dimension d has entropy at most ln⁡d.

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: ln⁡ is increasing, ln⁡1=0, and ln⁡(xy)=ln⁡x+ln⁡y for positive x,y.

[F8]

Density operator and Finite-dimensional von Neumann entropy: a density operator is non-negative with trace one, and its entropy is −∑j:λj>0λjln⁡λj in an orthonormal eigenbasis.

Proof

1.1F2F4F7givenalgebra

Strong subadditivity [F4] with the middle register one-dimensional gives subadditivity S(XY)≤S(X)+S(Y) for every bipartite state: tensoring with the unique one-dimensional state leaves all nontrivial spectra unchanged. The proof of this consequence uses the natural-log entropy convention and its product-spectrum calculation, with [F7] supplying the logarithm product law. Thus I(X:Y)≥0 by [F2].

2.1F1F2F3step 1.1algebra

Fix an arbitrary state ρA1A2, and set ρi to its marginals, ωB1B2=(N1⊗N2)(ρ), and ηE1E2=(N1c⊗N2c)(ρ) using product Stinespring dilations. Expanding each entropy by [F1] and each mutual information by [F2] yields fN1⊗N2(ρ)−fN1(ρ1)−fN2(ρ2)=−I(A1:A2)ρ−I(B1:B2)ω+I(E1:E2)η. By [F3] applied to the local complementary channels, I(E1:E2)η≤I(A1:A2)ρ. Step 1.1 gives I(B1:B2)ω≥0, so the displayed difference is nonpositive. Therefore F(N1⊗N2)≤F(N1)+F(N2).

3.1F1F5F6F7F8step 2.1algebrachoose∎

For product inputs ρ1⊗ρ2, diagonalize each density operator using [F5]. The positive eigenvalues of the product are λiμj, so expanding −∑i,jλiμjln⁡(λiμj) and applying [F7] proves entropy additivity and hence fN1⊗N2(ρ1⊗ρ2)=fN1(ρ1)+fN2(ρ2). For any density operator, [F5] and [F8] give nonnegative eigenvalues summing to one, so every positive eigenvalue lies in (0,1]. Monotonicity and ln⁡1=0 in [F7] therefore make each term −λjln⁡λj nonnegative. Together with [F6], this bounds each of S(ρi), S(Ni(ρi)), and S(Nic(ρi)) between zero and the logarithm of its fixed register dimension, so fNi is bounded above and below and its supremum is finite. For any δ>0, choose ρi with fNi(ρi)>F(Ni)−δ. The product input gives F(N1⊗N2)≥F(N1)+F(N2)−2δ. Letting δ↓0 proves the reverse inequality.

Depends on

Used by

Dependency tree · two levels

55 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