Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5), p. 2 — conditional entropy as a relative entropy: S(B|A) = ln d_B − S(ρ_AB ‖ ρ_A ⊗ I_B/d_B)

Proved
SimpleSSA.Monotone.eq_5

by mikedeng1 · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

conditional-entropyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrelative-entropy

Let ρAB\rho_{AB}ρAB​ be a density matrix on a composite finite-dimensional system ABABAB, let ρA=tr⁡BρAB\rho_A = \operatorname{tr}_B\rho_{AB}ρA​=trB​ρAB​, and let dBd_BdB​ be the dimension of BBB. The conditional entropy is S(B∣A)≡S(ρAB)−S(ρA)S(B|A) \equiv S(\rho_{AB}) - S(\rho_A)S(B∣A)≡S(ρAB​)−S(ρA​), with S(ρ)=−tr⁡(ρln⁡ρ)S(\rho) = -\operatorname{tr}(\rho\ln\rho)S(ρ)=−tr(ρlnρ). Then

S(B∣A)=ln⁡dB−S(ρAB ∥ ρA⊗IBdB),S(B|A) = \ln d_B - S\Big(\rho_{AB}\,\Big\|\,\rho_A\otimes\frac{I_B}{d_B}\Big),S(B∣A)=lndB​−S(ρAB​​ρA​⊗dB​IB​​),

where S(⋅∥⋅)S(\cdot\|\cdot)S(⋅∥⋅) is the relative entropy (3).

The identity rewrites conditional entropies as relative entropies; applied to the systems of (2), it turns strong subadditivity into the relative-entropy inequality (6).

Formalization Note No invertibility is assumed. The support of ρAB\rho_{AB}ρAB​ always lies in the support of ρA⊗IB\rho_A\otimes I_BρA​⊗IB​, so the real-valued relative entropy of the formalization (logarithms by functional calculus, with ln⁡0=0\ln 0 = 0ln0=0 on kernels) is the paper's finite value for every density matrix ρAB\rho_{AB}ρAB​. The page prints the denominator as dbd_bdb​; it is dBd_BdB​, the dimension of BBB. Logarithms are natural.

Preamble
import Mathlib
import Definitions.Def_SimpleSSA_Monotone_Basic

open scoped Matrix.Norms.L2Operator ComplexOrder Kronecker Matrix
Formal statement
namespace SimpleSSA.Monotone

open TroppMatrixConcentration QAlgorithms WildeQIT

/-- (5), p. 2: `S(B|A) = ln d_B − S(ρ_AB ‖ ρ_A ⊗ I_B/d_B)`, with `S(B|A) = S(ρ_AB) − S(ρ_A)`,
for every density matrix `ρ_AB`. -/
theorem eq_5 {A B : Type} [Fintype A] [DecidableEq A] [Nonempty A]
    [Fintype B] [DecidableEq B] [Nonempty B]
    (ρ : Matrix (A × B) (A × B) ℂ) (hρ : IsDensityMatrix ρ) :
    entropy ρ - entropy (partialTraceRight ρ) =
      Real.log (Fintype.card B) - relEntropy ρ (partialTraceRight ρ ⊗ₖ maximallyMixed B) := by sorry

end SimpleSSA.Monotone
Source
Nielsen & Petz, A simple proof of the strong subadditivity inequality, arXiv:quant-ph/0408130v3, p. 2, (5); S(·|·) defined on p. 1
Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 23, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me