Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, equations (13)–(14): exchange-matrix entropy

Proved
QAlgorithms.Papers.Independent.Support50.P41.exchangeMatrixEntropy

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ be a density matrix and (Aμ)(A_\mu)(Aμ​) a normalized operator-sum representation of a channel Φ\PhiΦ. Construct

Wμν=Tr⁡(AμρAν†).W_{\mu\nu}=\operatorname{Tr}(A_\mu\rho A_\nu^\dagger).Wμν​=Tr(Aμ​ρAν†​).

Then WWW is a density matrix and Se(ρ,Φ)=S(W)S_e(\rho,\Phi)=S(W)Se​(ρ,Φ)=S(W), with entropy in bits. This computes entropy exchange using only the input and Kraus operators.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P41

open QAlgorithms

open QAlgorithms.Entanglement (IsCompletelyPositive)

open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)

open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)

open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)

open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)

open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)

open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)

open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)

open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)

open scoped Matrix ComplexConjugate ComplexOrder ENNReal

attribute [local instance] Classical.propDecidable Classical.decEq

-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.

local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _

/-- PDF pp.20--21, (13)--(14): computed exchange matrix and its entropy, with the printed order.
Source correction: the first p.20 formula for rho_E prints Tr_E; use Tr_RQ,
as in the immediately following derivation. Independent moderation pending. -/
theorem exchangeMatrixEntropy {d m : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (A : Fin m → Matrix (Fin d) (Fin d) ℂ)
    (hA : OperatorSum Phi A)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
    (∀ k l, complementaryMap A rho k l = (A k * rho * (A l)ᴴ).trace) ∧
    IsDensityMatrix (complementaryMap A rho) ∧
    entropyExchange Phi rho = vnEntropy (complementaryMap A rho) := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 21, §5.1, equations (13)–(14): exchange-matrix entropy
Read-back

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

Let d≥1d\ge1d≥1 and m≥0m\ge0m≥0 be integers. Let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) be a function, and suppose matrices A0,…,Am−1A_0,\ldots,A_{m-1}A0​,…,Am−1​ satisfy ∑kAk†Ak=Id\sum_kA_k^\dagger A_k=I_d∑k​Ak†​Ak​=Id​ and Φ(X)=∑kAkXAk†\Phi(X)=\sum_kA_kXA_k^\daggerΦ(X)=∑k​Ak​XAk†​ for every XXX. Let ρ\rhoρ be positive semidefinite with trace one. Define C∈Mm(C)C\in M_m(\mathbb C)C∈Mm​(C) entrywise by

Ckl=∑u,v=0d−1∑y=0d−1(Ak)yu(Al)yv‾ρuv.C_{kl}=\sum_{u,v=0}^{d-1}\sum_{y=0}^{d-1}(A_k)_{yu}\overline{(A_l)_{yv}}\rho_{uv}.Ckl​=u,v=0∑d−1​y=0∑d−1​(Ak​)yu​(Al​)yv​​ρuv​.

Then Ckl=tr⁡(AkρAl†)C_{kl}=\operatorname{tr}(A_k\rho A_l^\dagger)Ckl​=tr(Ak​ρAl†​) for every k,lk,lk,l, CCC is positive semidefinite with trace one, and S((id⁡d⊗Φ)(cρcρ†))=S(C)S((\operatorname{id}_d\otimes\Phi)(c_\rho c_\rho^\dagger))=S(C)S((idd​⊗Φ)(cρ​cρ†​))=S(C), where S(X)=−Re⁡tr⁡(g(X))S(X)=-\operatorname{Re}\operatorname{tr}(g(X))S(X)=−Retr(g(X)) for the spectral function g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t, g(0)=0g(0)=0g(0)=0, and cρc_\rhocρ​ has coefficients (ρ)ji(\sqrt{\rho})_{ji}(ρ​)ji​ in the fixed enumeration of the input basis. The amplification applies Φ\PhiΦ to each system block. Although m=0m=0m=0 is quantified over, it cannot satisfy the completeness equality when d≥1d\ge1d≥1.

Human review
  • Endorsed by Shuze Chen · Oct 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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