Alphabeta Math
Pipeline-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.

Quantum Relative Entropy, Data Processing, and Strong Subadditivity

1 · Prerequisites

2 · Summary

This finite-dimensional development uses the support-sensitive quantum relative entropy with natural logarithms. It uses the resolvent compression inequality, the Jensen inequality for the negative logarithm, and partial-trace and channel data processing through finite Stinespring dilation, proved together with joint convexity on Quantum Information Measures. The entropy consequences are strong subadditivity and nonnegativity of conditional mutual information; the measurement consequence is the finite Holevo bound established on that prerequisite page. States and positive semidefinite operators are both allowed where the stated relative entropy convention permits them. No infinite-dimensional extension or equality/recovery claim is made.

The channel data-processing proof factors the channel through an isometric embedding and a partial trace. The top route denotes that factorization, and the lower arrow denotes the original channel; the equality is justified by the finite Stinespring theorem and the proof text, not by the picture.

\begin{tikzcd}
\mathcal L(H) \arrow[r, "X\mapsto VXV^\dagger"] \arrow[rr, "\Phi"'] & \mathcal L(K\otimes E) \arrow[r, "\operatorname{Tr}_E"] & \mathcal L(K)
\end{tikzcd}

The entropy inequalities use finite marginal definitions and preserve their factor order explicitly. All logarithms are natural, so divergences and entropies are measured in nats.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The finite Weyl twirl is the normalized partial trace

Statement

Let H,K be finite-dimensional complex inner-product spaces with d=dim⁡K≥1, and fix an ordered orthonormal basis e0,…,ed−1 of K. Let Xej=ej+1 mod d and Zej=ωjej, where ω=exp⁡(2πi/d) (and ω=1 when d=1). For R∈End⁡(H⊗K), 1d2∑p,q=0d−1(IH⊗XpZq)R(IH⊗XpZq)†=(Tr⁡KR)⊗IK/d.

Facts & Assumptions

Given: Finite-dimensional complex-inner-product spaces H,K, d=dim⁡K≥1, an ordered orthonormal basis of K, and R∈End⁡(H⊗K).

[F1]

Partial trace over a finite tensor factor: in an ordered product basis with the retained factor first, (Tr⁡KR)ii′=∑jR(i,j),(i′,j).

[F2]

Ordered tensor registers, their inner product, and wire permutations: the product basis is ordered by factor indices and elementary-tensor pairings are products of the factor pairings.

[F3]

Complex de Moivre formula for every integer exponent: integer powers of cos⁡θ+isin⁡θ equal cos⁡(nθ)+isin⁡(nθ).

[F5]

Euler's formula: exp⁡(iθ)=cos⁡θ+isin⁡θ for every real θ: exp⁡(iθ)=cos⁡θ+isin⁡θ for real θ.

Proof

1.1givenF2F3F4F5algebra

If d≥2, Euler's identity [F5] and the integer-power formula [F3] give ωm=exp⁡(2πim/d) for every integer m. By [F4], this equals 1 exactly when d divides m, so ω has exact order d and ∣ω∣=1. The shift X permutes the orthonormal basis and the phase Z multiplies its vectors by unit scalars, so both are unitary. For d=1 both are the identity. For d≥2, d−1∑q=0d−1ωqm is 1 when d∣m; otherwise multiplication by 1−ωm≠0 makes the geometric sum telescope to 1−ωmd=0, so it is 0.

2.1givenF2step 1.1algebra

Write Eab=∣ea⟩⟨eb∣ and expand R=∑a,b=0d−1Rab⊗Eab in the product basis. Direct action on basis vectors gives ZqEab(Zq)†=ωq(a−b)Eab and XpEab(Xp)†=Ea+p,b+p, with indices modulo d. Averaging first over q using step 1.1 removes every a≠b term and keeps Raa⊗Eaa.

3.1givenF1step 2.1algebra∎

For each remaining diagonal unit, d−1∑p=0d−1Ea+p,a+p=IK/d. Therefore the full average is ∑aRaa⊗IK/d. By [F1], ∑aRaa=Tr⁡KR, giving the identity. When d=1, [F1] says Tr⁡KR is the unique coefficient R00, so the same equality holds.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

5 · Examples, counterexamples and false statements

None yet.

Sources