Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4), p. 2 — monotonicity of the relative entropy: S(ρ_A‖σ_A) ≤ S(ρ_AB‖σ_AB) for invertible ρ_AB, σ_AB

Proved
SimpleSSA.Monotone.eq_4

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

monotonicityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-informationrelative-entropy

Let ρAB\rho_{AB}ρAB​ and σAB\sigma_{AB}σAB​ be invertible density matrices on a composite finite-dimensional system ABABAB, and let ρA=tr⁡BρAB\rho_A = \operatorname{tr}_B\rho_{AB}ρA​=trB​ρAB​ and σA=tr⁡BσAB\sigma_A = \operatorname{tr}_B\sigma_{AB}σA​=trB​σAB​ be their reduced density matrices on AAA. Then

S(ρA∥σA)≤S(ρAB∥σAB),S(\rho_A\|\sigma_A) \le S(\rho_{AB}\|\sigma_{AB}),S(ρA​∥σA​)≤S(ρAB​∥σAB​),

where S(ρ∥σ)=tr⁡(ρln⁡ρ−ρln⁡σ)S(\rho\|\sigma) = \operatorname{tr}(\rho\ln\rho-\rho\ln\sigma)S(ρ∥σ)=tr(ρlnρ−ρlnσ) is the relative entropy. Discarding part of a composite system can only decrease the relative entropy between two states.

This is the monotonicity of the relative entropy, from which the paper derives strong subadditivity through (5) and (6). It is proved in §3 (pp. 3–5).

Formalization Note The inequality is stated for invertible (positive definite) ρAB\rho_{AB}ρAB​ and σAB\sigma_{AB}σAB​. This is the paper's own assumption in §3 (p. 3: "our proof of monotonicity of the relative entropy and of strong subadditivity only applies directly for invertible density matrices"); the extension to all density matrices is a continuity argument the paper omits. It also keeps the relative entropy finite, so that its real-valued encoding is the paper's value. 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

/-- (4), p. 2, proved in §3 for invertible states (p. 3): monotonicity of the relative entropy
under discarding `B`, `S(ρ_A‖σ_A) ≤ S(ρ_AB‖σ_AB)`. -/
theorem eq_4 {A B : Type} [Fintype A] [DecidableEq A] [Nonempty A]
    [Fintype B] [DecidableEq B] [Nonempty B]
    (ρ σ : Matrix (A × B) (A × B) ℂ) (hρ : IsDensityMatrix ρ) (hρ_inv : ρ.PosDef)
    (hσ : IsDensityMatrix σ) (hσ_inv : σ.PosDef) :
    relEntropy (partialTraceRight ρ) (partialTraceRight σ) ≤ relEntropy ρ σ := by sorry

end SimpleSSA.Monotone
Source
Nielsen & Petz, A simple proof of the strong subadditivity inequality, arXiv:quant-ph/0408130v3, p. 2, (4); proved in §3, pp. 3–5, for invertible density matrices (p. 3)
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