(4), p. 2 — monotonicity of the relative entropy: S(ρ_A‖σ_A) ≤ S(ρ_AB‖σ_AB) for invertible ρ_AB, σ_AB
ProvedSimpleSSA.Monotone.eq_4Let and be invertible density matrices on a composite finite-dimensional system , and let and be their reduced density matrices on . Then
where 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) and . 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.
import Mathlib import Definitions.Def_SimpleSSA_Monotone_Basic open scoped Matrix.Norms.L2Operator ComplexOrder Kronecker Matrix
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.