Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.1, equation (12): purification independence of entropy production

Proved
QAlgorithms.Papers.Independent.Support50.P41.intrinsicEntropy

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

prove2quantum

Fix a density matrix ρ\rhoρ and CPTP map Φ\PhiΦ on a nonzero finite-dimensional system. Any normalized purifications ψ\psiψ and ϕ\phiϕ of ρ\rhoρ, with arbitrary finite reference dimensions, satisfy

S((id⊗Φ)(∣ψ⟩⟨ψ∣))=Se(ρ,Φ)=S((id⊗Φ)(∣ϕ⟩⟨ϕ∣)).S((\mathrm{id}\otimes\Phi)(|\psi\rangle\langle\psi|))=S_e(\rho,\Phi)=S((\mathrm{id}\otimes\Phi)(|\phi\rangle\langle\phi|)).S((id⊗Φ)(∣ψ⟩⟨ψ∣))=Se​(ρ,Φ)=S((id⊗Φ)(∣ϕ⟩⟨ϕ∣)).

Entropy is in bits. This makes the definition of entropy production independent of the chosen purification.

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.19--20, (12): entropy production is independent of reference and purification. -/
theorem intrinsicEntropy {d a b : ℕ} [NeZero d]
    (Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
    (psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi)
    (phi : EuclideanSpace ℂ (Fin b × Fin d)) (hphi : IsPurification rho phi) :
    vnEntropy (idTensorSuperop Phi (pureDensity psi)) = entropyExchange Phi rho ∧
    vnEntropy (idTensorSuperop Phi (pureDensity phi)) = entropyExchange Phi rho := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 19, §5.1, equation (12): purification independence of entropy production
Read-back

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

Let d≥1d\ge1d≥1 and a,b≥0a,b\ge0a,b≥0 be integers. Let Φ:Md(C)→Md(C)\Phi:M_d(\mathbb C)\to M_d(\mathbb C)Φ:Md​(C)→Md​(C) admit a finite representation Φ(X)=∑jEjXEj†\Phi(X)=\sum_jE_jXE_j^\daggerΦ(X)=∑j​Ej​XEj†​ for every matrix XXX, with ∑jEj†Ej=Id\sum_jE_j^\dagger E_j=I_d∑j​Ej†​Ej​=Id​. Let ρ\rhoρ be positive semidefinite with trace one, and let ψ∈Ca⊗Cd\psi\in\mathbb C^a\otimes\mathbb C^dψ∈Ca⊗Cd and ϕ∈Cb⊗Cd\phi\in\mathbb C^b\otimes\mathbb C^dϕ∈Cb⊗Cd be unit vectors whose partial traces over their respective reference factors equal ρ\rhoρ. Define S(X)=−Re⁡tr⁡(g(X))S(X)=-\operatorname{Re}\operatorname{tr}(g(X))S(X)=−Retr(g(X)), where spectral functional calculus uses g(t)=tlog⁡2tg(t)=t\log_2tg(t)=tlog2​t with g(0)=0g(0)=0g(0)=0, and let cρc_\rhocρ​ be the canonical purification with coefficients (ρ)ji(\sqrt{\rho})_{ji}(ρ​)ji​ in the fixed enumeration of the input basis. Then both equalities hold:

S((id⁡a⊗Φ)(ψψ†))=S((id⁡d⊗Φ)(cρcρ†)),S((id⁡b⊗Φ)(ϕϕ†))=S((id⁡d⊗Φ)(cρcρ†)).S((\operatorname{id}_a\otimes\Phi)(\psi\psi^\dagger)) =S((\operatorname{id}_d\otimes\Phi)(c_\rho c_\rho^\dagger)), \qquad S((\operatorname{id}_b\otimes\Phi)(\phi\phi^\dagger)) =S((\operatorname{id}_d\otimes\Phi)(c_\rho c_\rho^\dagger)).S((ida​⊗Φ)(ψψ†))=S((idd​⊗Φ)(cρ​cρ†​)),S((idb​⊗Φ)(ϕϕ†))=S((idd​⊗Φ)(cρ​cρ†​)).

Each amplification applies Φ\PhiΦ to blocks with fixed reference indices; each reference partial trace sums over equal reference indices. Neither purification hypothesis can hold when its reference dimension is zero.

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