Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3: two characterizations of equality in strong subadditivity

Open
QAlgorithms.Papers.Independent.Intakethird100.P84.equalityInStrongSubadditivity

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let D123D_{123}D123​ be an invertible density matrix on a tensor product H1⊗H2⊗H3H_1\otimes H_2\otimes H_3H1​⊗H2​⊗H3​ of nonzero finite-dimensional complex Hilbert spaces. Let D12,D23,D2D_{12},D_{23},D_2D12​,D23​,D2​ be its actual reduced densities, obtained by partial traces. Write S(D)=−Tr⁡(Dlog⁡D)S(D)=-\operatorname{Tr}(D\log D)S(D)=−Tr(DlogD), with natural logarithms. Each of the following conditions is separately equivalent to

S(D123)+S(D2)=S(D12)+S(D23):S(D_{123})+S(D_2)=S(D_{12})+S(D_{23}):S(D123​)+S(D2​)=S(D12​)+S(D23​): D123it(D12−it⊗I3)=(I1⊗D23it)(I1⊗D2−it⊗I3)for all t∈R, log⁡D123−(log⁡D12)⊗I3=I1⊗log⁡D23−I1⊗log⁡D2⊗I3.\begin{aligned} &D_{123}^{it}(D_{12}^{-it}\otimes I_3) =(I_1\otimes D_{23}^{it})(I_1\otimes D_2^{-it}\otimes I_3) \quad\text{for all }t\in\mathbb R,\ &\log D_{123}-(\log D_{12})\otimes I_3 =I_1\otimes\log D_{23}-I_1\otimes\log D_2\otimes I_3. \end{aligned}​D123it​(D12−it​⊗I3​)=(I1​⊗D23it​)(I1​⊗D2−it​⊗I3​)for all t∈R, ​logD123​−(logD12​)⊗I3​=I1​⊗logD23​−I1​⊗logD2​⊗I3​.​

This gives multiplicative and logarithmic characterizations of strong-subadditivity equality. The smaller densities are constructed from D123D_{123}D123​; their invertibility follows from the hypothesis on the full state.

Formalization Note Registers have order I×(J×K)I\times(J\times K)I×(J×K). The entropy equality is written with the frozen entropy in bits; multiplication by log⁡2>0\log 2>0log2>0 converts it to the displayed equality in natural units. Powers and logarithms are taken before identity embedding.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P84
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P84

open scoped Matrix ComplexConjugate ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

-- Pinned accepted definitions, inspected at their recorded source locations.

open QAlgorithms.Papers.Independent.Renew46.P35 (traceAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P21 (imaginaryPower marginalAB)

/-- Petz, arXiv:quant-ph/0209053v1, PDF p.11, Theorem 3.
Every marginal is computed from rho; the only invertibility assumption is on rho.
All smaller-system logarithms/powers are embedded with ordinary identities. -/
theorem equalityInStrongSubadditivity {I J K : Type*}
    [Fintype I] [Fintype J] [Fintype K]
    [Nonempty I] [Nonempty J] [Nonempty K]
    (rho : Matrix (I × (J × K)) (I × (J × K)) ℂ)
    (hrho : IsDensityMatrix rho) (hinv : IsUnit rho) :
    let D12 := marginalAB rho
    let D23 := traceLeft rho
    let D2 := traceRight D23
    let eqSSA := vnEntropy rho + vnEntropy D2 = vnEntropy D12 + vnEntropy D23
    (eqSSA ↔ ∀ t : ℝ,
      imaginaryPower rho t * embed12 (K := K) (imaginaryPower D12 (-t)) =
      Matrix.kronecker (1 : Matrix I I ℂ) (imaginaryPower D23 t) *
        Matrix.kronecker (1 : Matrix I I ℂ)
          (Matrix.kronecker (imaginaryPower D2 (-t)) (1 : Matrix K K ℂ))) ∧
    (eqSSA ↔
      cfc Real.log rho - embed12 (K := K) (cfc Real.log D12) =
      Matrix.kronecker (1 : Matrix I I ℂ) (cfc Real.log D23) -
        Matrix.kronecker (1 : Matrix I I ℂ)
          (Matrix.kronecker (cfc Real.log D2) (1 : Matrix K K ℂ))) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P84

end
Source
Monotonicity of quantum relative entropy revisited, arXiv:quant-ph/0209053v1, PDF p. 11, Theorem 3: two characterizations of equality in strong subadditivity
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let I,J,KI,J,KI,J,K be nonempty finite types and let ρ\rhoρ, indexed by I×(J×K)I\times(J\times K)I×(J×K), be an invertible positive semidefinite complex matrix of trace one. Define its marginals by

(D12)(i,j),(i′,j′)=∑kρ(i,(j,k)),(i′,(j′,k)),(D23)(j,k),(j′,k′)=∑iρ(i,(j,k)),(i,(j′,k′)),(D2)j,j′=∑k(D23)(j,k),(j′,k).(D_{12})_{(i,j),(i',j')}=\sum_k\rho_{(i,(j,k)),(i',(j',k))},\qquad (D_{23})_{(j,k),(j',k')}=\sum_i\rho_{(i,(j,k)),(i,(j',k'))},\qquad (D_2)_{j,j'}=\sum_k(D_{23})_{(j,k),(j',k)}.(D12​)(i,j),(i′,j′)​=k∑​ρ(i,(j,k)),(i′,(j′,k))​,(D23​)(j,k),(j′,k′)​=i∑​ρ(i,(j,k)),(i,(j′,k′))​,(D2​)j,j′​=k∑​(D23​)(j,k),(j′,k)​.

Write S(A)=−Re⁡tr⁡(u↦ulog⁡2u)(A)S(A)=-\operatorname{Re}\operatorname{tr}(u\mapsto u\log_2u)(A)S(A)=−Retr(u↦ulog2​u)(A), using spectral functional calculus, and write AitA^{it}Ait for the spectral function λ↦eitln⁡λ\lambda\mapsto e^{it\ln\lambda}λ↦eitlnλ. For a matrix BBB indexed by I×JI\times JI×J, let ι12(B)(i,(j,k)),(i′,(j′,k′))=δk,k′B(i,j),(i′,j′)\iota_{12}(B)_{(i,(j,k)),(i',(j',k'))}=\delta_{k,k'}B_{(i,j),(i',j')}ι12​(B)(i,(j,k)),(i′,(j′,k′))​=δk,k′​B(i,j),(i′,j′)​. The declaration asserts both equivalences

S(ρ)+S(D2)=S(D12)+S(D23)  ⟺  ∀t∈R,ρitι12(D12−it)=(II⊗D23it)(II⊗(D2−it⊗IK)),S(\rho)+S(D_2)=S(D_{12})+S(D_{23}) \iff \forall t\in\mathbb R,\quad \rho^{it}\iota_{12}(D_{12}^{-it}) =(I_I\otimes D_{23}^{it}) \bigl(I_I\otimes(D_2^{-it}\otimes I_K)\bigr),S(ρ)+S(D2​)=S(D12​)+S(D23​)⟺∀t∈R,ρitι12​(D12−it​)=(II​⊗D23it​)(II​⊗(D2−it​⊗IK​)),

and

S(ρ)+S(D2)=S(D12)+S(D23)  ⟺  ln⁡ρ−ι12(ln⁡D12)=II⊗ln⁡D23−II⊗(ln⁡D2⊗IK).S(\rho)+S(D_2)=S(D_{12})+S(D_{23}) \iff \ln\rho-\iota_{12}(\ln D_{12}) =I_I\otimes\ln D_{23} -I_I\otimes(\ln D_2\otimes I_K).S(ρ)+S(D2​)=S(D12​)+S(D23​)⟺lnρ−ι12​(lnD12​)=II​⊗lnD23​−II​⊗(lnD2​⊗IK​).
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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