Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Section 2.3: equivalence with Petz imaginary-power condition and intertwining

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.petzSSA

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

prove2quantum

For a faithful normalized tripartite state, let L12,L23,L2L_{12},L_{23},L_2L12​,L23​,L2​ denote the logarithms of its actual marginals lifted by identity operators. Equality in SSA is equivalent to log⁡ρ123−L12=L23−L2\log\rho_{123}-L_{12}=L_{23}-L_2logρ123​−L12​=L23​−L2​, and also to

eitL12e−itL2=eitlog⁡ρ123e−itL23(t∈R).e^{itL_{12}}e^{-itL_2}=e^{it\log\rho_{123}}e^{-itL_{23}}\quad(t\in\mathbb R).eitL12​e−itL2​=eitlogρ123​e−itL23​(t∈R).

Any of these conditions implies

eit(L12−L2+L23)=eitL12e−itL2eitL23(t∈R).e^{it(L_{12}-L_2+L_{23})}=e^{itL_{12}}e^{-itL_2}e^{itL_{23}}\quad(t\in\mathbb R).eit(L12​−L2​+L23​)=eitL12​e−itL2​eitL23​(t∈R).

This identifies the logarithm criterion with Petz’s imaginary-power condition and records its intertwining consequence.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
Formal statement
noncomputable section

open scoped Matrix ComplexOrder ComplexConjugate Matrix.Norms.L2Operator

open MeasureTheory

namespace QAlgorithms.Papers.Independent.Intakethird100.P51

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact interfaces from the frozen accepted library; no local redeclarations.

open QAlgorithms.Papers.Independent.Information100.P63 (Mat)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy holevo IsLaw)

open QAlgorithms.Papers.Independent.Information100.P27 (average)

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy marginalAB channelAdjoint)

open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)

open QAlgorithms.Papers.Independent.Gap48.P19 (shannonNats)

open QAlgorithms.Papers.Independent.Gap48.P33 (measurementInformation)

section Statements

variable {A B C D J K O : Type}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype J] [Fintype K] [Fintype O]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

variable [DecidableEq J] [DecidableEq K] [DecidableEq O]

/-- Section 2.3, equations (13)–(15), PDF p.7: every real imaginary-power parameter. -/
theorem petzSSA [Nonempty A] [Nonempty B] [Nonempty C] (rho : Mat (A × (B × C))) (h : FaithfulDensity rho) :
    let L12 := liftAB (logMatrix (marginalAB rho))
    let L23 := liftBC (logMatrix (traceLeft rho))
    let L2 := liftB (logMatrix (traceRight (traceLeft rho)))
    let P := ∀ t : ℝ, imaginaryExp t L12 * imaginaryExp (-t) L2 =
      imaginaryExp t (logMatrix rho) * imaginaryExp (-t) L23
    (ssaGap rho = 0 ↔ SSAlogCondition rho) ∧ (SSAlogCondition rho ↔ P) ∧
    (ssaGap rho = 0 → ∀ t : ℝ, imaginaryExp t (L12 - L2 + L23) =
      imaginaryExp t L12 * imaginaryExp (-t) L2 * imaginaryExp t L23) := by sorry

end Statements

end QAlgorithms.Papers.Independent.Intakethird100.P51

end
Source
Inequalities for Quantum Entropy: A Review with Conditions for Equality, arXiv:quant-ph/0205064v2, PDF p. 7, Section 2.3: equivalence with Petz imaginary-power condition and intertwining
Read-back

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

For finite nonempty index types A,B,CA,B,CA,B,C with decidable equality, let ρ\rhoρ be a positive definite complex matrix of trace 111 on A×(B×C)A\times(B\times C)A×(B×C), and let ρAB,ρBC,ρB\rho_{AB},\rho_{BC},\rho_BρAB​,ρBC​,ρB​ be its partial traces. Define S(M)=−Re⁡tr⁡(f(M))S(M)=-\operatorname{Re}\operatorname{tr}(f(M))S(M)=−Retr(f(M)), where f(x)=xlog⁡xf(x)=x\log xf(x)=xlogx is applied by continuous functional calculus using the natural logarithm, and set G=S(ρAB)+S(ρBC)−S(ρ)−S(ρB)G=S(\rho_{AB})+S(\rho_{BC})-S(\rho)-S(\rho_B)G=S(ρAB​)+S(ρBC​)−S(ρ)−S(ρB​). With natural matrix logarithms, put L12=(log⁡ρAB)⊗ICL_{12}=(\log\rho_{AB})\otimes I_CL12​=(logρAB​)⊗IC​, L23=IA⊗log⁡ρBCL_{23}=I_A\otimes\log\rho_{BC}L23​=IA​⊗logρBC​, and L2=IA⊗log⁡ρB⊗ICL_2=I_A\otimes\log\rho_B\otimes I_CL2​=IA​⊗logρB​⊗IC​. Then G=0G=0G=0 if and only if log⁡ρ−L12=L23−L2\log\rho-L_{12}=L_{23}-L_2logρ−L12​=L23​−L2​; this logarithmic identity holds if and only if, for every real ttt,

eitL12e−itL2=eitlog⁡ρe−itL23.e^{itL_{12}}e^{-itL_2}=e^{it\log\rho}e^{-itL_{23}}.eitL12​e−itL2​=eitlogρe−itL23​.

Furthermore, G=0G=0G=0 implies that, for every real ttt,

eit(L12−L2+L23)=eitL12e−itL2eitL23.e^{it(L_{12}-L_2+L_{23})}=e^{itL_{12}}e^{-itL_2}e^{itL_{23}}.eit(L12​−L2​+L23​)=eitL12​e−itL2​eitL23​.

The exponentials are matrix exponentials, and singleton registers are included.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me