Corollary 9: intertwining and Kraus-range commutation
OpenQAlgorithms.Papers.Independent.Intakethird100.P51.equalityIntertwiningUnder equality in data processing for a finite CPTP map and faithful normalized states , put and let be the supported output log difference. Then
For every normalized Kraus representation , form the computed isometry . Its range projection satisfies
This records the intertwining and dilation-range commutation forced by equality.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P51
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For finite nonempty index types , with the decidable equality structures used in the matrix definitions, let admit a finite Kraus representation with completeness relation , and let be positive definite trace-one matrices. Suppose , where , , when , and otherwise, and real conversion sends to zero. Set and , with matrix logarithms defined by continuous functional calculus and . Then
Furthermore, for every family , indexed by , satisfying and for every matrix , the matrix defined by satisfies
This last assertion quantifies only over representations indexed by the specified ; if none exist, that universally quantified assertion is vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.