Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 9: intertwining and Kraus-range commutation

Open
QAlgorithms.Papers.Independent.Intakethird100.P51.equalityIntertwining

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

prove2quantum

Under equality in data processing for a finite CPTP map Φ\PhiΦ and faithful normalized states ρ,γ\rho,\gammaρ,γ, put D=log⁡ρ−log⁡γD=\log\rho-\log\gammaD=logρ−logγ and let LLL be the supported output log difference. Then

Φ(D)=Φ(I)L=LΦ(I).\Phi(D)=\Phi(I)L=L\Phi(I).Φ(D)=Φ(I)L=LΦ(I).

For every normalized Kraus representation Φ(X)=∑kFkXFk†\Phi(X)=\sum_kF_kXF_k^{\dagger}Φ(X)=∑k​Fk​XFk†​, form the computed isometry V(a′,k),a=(Fk)a′,aV_{(a',k),a}=(F_k)_{a',a}V(a′,k),a​=(Fk​)a′,a​. Its range projection satisfies

[VV†,L⊗IK]=0.[VV^{\dagger},L\otimes I_K]=0.[VV†,L⊗IK​]=0.

This records the intertwining and dilation-range commutation forced by equality.

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]

/-- Corollary 9, equations (45)–(46), PDF pp.16–17: the second operator is lifted
by I_K before commutation with the actual Kraus-range projection. -/
theorem equalityIntertwining [Nonempty A] [Nonempty B] [Nonempty K] (Phi : Superop A B) (hPhi : IsChannel Phi) (rho gamma : Mat A)
    (hr : FaithfulDensity rho) (hg : FaithfulDensity gamma)
    (he : (relativeEntropy (Phi rho) (Phi gamma)).toReal = (relativeEntropy rho gamma).toReal) :
    let D := logMatrix rho - logMatrix gamma
    let L := logMatrix (Phi rho) - logMatrix (Phi gamma)
    Phi D = Phi 1 * L ∧ Phi D = L * Phi 1 ∧
    ∀ F : K → Matrix B A ℂ, IsKrausFamily F → (∀ X, Phi X = krausApply F X) →
      (krausV F * (krausV F)ᴴ) * Matrix.kronecker L (1 : Mat K) =
        Matrix.kronecker L (1 : Mat K) * (krausV F * (krausV F)ᴴ) := 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. 16, Corollary 9: intertwining and Kraus-range commutation
Read-back

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

For finite nonempty index types A,B,KA,B,KA,B,K, with the decidable equality structures used in the matrix definitions, let Φ:Mat⁡A(C)→Mat⁡B(C)\Phi:\operatorname{Mat}_A(\mathbb C)\to\operatorname{Mat}_B(\mathbb C)Φ:MatA​(C)→MatB​(C) admit a finite Kraus representation with completeness relation ∑iEi†Ei=IA\sum_iE_i^\dagger E_i=I_A∑i​Ei†​Ei​=IA​, and let ρ,γ\rho,\gammaρ,γ be positive definite trace-one matrices. Suppose DR(Φρ∥Φγ)=DR(ρ∥γ)D_{\mathbb R}(\Phi\rho\Vert\Phi\gamma)=D_{\mathbb R}(\rho\Vert\gamma)DR​(Φρ∥Φγ)=DR​(ρ∥γ), where D(X∥Y)=Re⁡tr⁡[f(X)−Xlog⁡Y]D(X\Vert Y)=\operatorname{Re}\operatorname{tr}[f(X)-X\log Y]D(X∥Y)=Retr[f(X)−XlogY], f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx, when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and D(X∥Y)=+∞D(X\Vert Y)=+\inftyD(X∥Y)=+∞ otherwise, and real conversion sends +∞+\infty+∞ to zero. Set D0=log⁡ρ−log⁡γD_0=\log\rho-\log\gammaD0​=logρ−logγ and L=log⁡(Φρ)−log⁡(Φγ)L=\log(\Phi\rho)-\log(\Phi\gamma)L=log(Φρ)−log(Φγ), with matrix logarithms defined by continuous functional calculus and ln⁡0=0\ln0=0ln0=0. Then

Φ(D0)=Φ(IA)L,Φ(D0)=LΦ(IA).\Phi(D_0)=\Phi(I_A)L,\qquad \Phi(D_0)=L\Phi(I_A).Φ(D0​)=Φ(IA​)L,Φ(D0​)=LΦ(IA​).

Furthermore, for every family Fk∈CB×AF_k\in\mathbb C^{B\times A}Fk​∈CB×A, indexed by k∈Kk\in Kk∈K, satisfying ∑kFk†Fk=IA\sum_kF_k^\dagger F_k=I_A∑k​Fk†​Fk​=IA​ and Φ(X)=∑kFkXFk†\Phi(X)=\sum_kF_kXF_k^\daggerΦ(X)=∑k​Fk​XFk†​ for every matrix XXX, the matrix V:CA→CB×KV:\mathbb C^A\to\mathbb C^{B\times K}V:CA→CB×K defined by V(b,k),a=(Fk)baV_{(b,k),a}=(F_k)_{ba}V(b,k),a​=(Fk​)ba​ satisfies

VV†(L⊗IK)=(L⊗IK)VV†.VV^\dagger(L\otimes I_K)=(L\otimes I_K)VV^\dagger.VV†(L⊗IK​)=(L⊗IK​)VV†.

This last assertion quantifies only over representations indexed by the specified KKK; if none exist, that universally quantified assertion is vacuous.

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