Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5.2, equations (18)–(19) and absolute-value summary

Proved
QAlgorithms.Papers.Independent.Support50.P41.environmentEntropyBounds

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

prove2quantum

Let ρ\rhoρ and σ\sigmaσ be density matrices of a nonzero finite system and environment, initially in the product state ρ⊗σ\rho\otimes\sigmaρ⊗σ. A fixed unitary UUU induces Φ(X)=Tr⁡E[U(X⊗σ)U†]\Phi(X)=\operatorname{Tr}_E[U(X\otimes\sigma)U^\dagger]Φ(X)=TrE​[U(X⊗σ)U†] and final environment state σ′=Tr⁡Q[U(ρ⊗σ)U†]\sigma'=\operatorname{Tr}_Q[U(\rho\otimes\sigma)U^\dagger]σ′=TrQ​[U(ρ⊗σ)U†]. Then

∣S(σ′)−S(σ)∣≤Se(ρ,Φ)≤S(σ)+S(σ′).|S(\sigma')-S(\sigma)|\le S_e(\rho,\Phi)\le S(\sigma)+S(\sigma').∣S(σ′)−S(σ)∣≤Se​(ρ,Φ)≤S(σ)+S(σ′).

This bounds both directions of environment entropy change even when its initial state is mixed.

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.23--24, (18)--(19): arbitrary mixed environment with product initialization. -/
theorem environmentEntropyBounds {d e : ℕ} [NeZero d] [NeZero e]
    (U : Matrix.unitaryGroup (Fin d × Fin e) ℂ)
    (sigma : Matrix (Fin e) (Fin e) ℂ) (hsigma : IsDensityMatrix sigma)
    (rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho) :
    let Phi := fun X => traceRight (mixedInteraction U sigma X)
    let sigmaOut := traceLeft (mixedInteraction U sigma rho)
    |vnEntropy sigmaOut - vnEntropy sigma| ≤ entropyExchange Phi rho ∧
    entropyExchange Phi rho ≤ vnEntropy sigma + vnEntropy sigmaOut := by sorry

end QAlgorithms.Papers.Independent.Support50.P41

end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 23, §5.2, equations (18)–(19) and absolute-value summary
Read-back

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

Let d,e>0d,e>0d,e>0 be integers, let UUU be unitary on Cd⊗Ce\mathbb C^d\otimes\mathbb C^eCd⊗Ce, and let ρ∈Md(C)\rho\in M_d(\mathbb C)ρ∈Md​(C) and σ∈Me(C)\sigma\in M_e(\mathbb C)σ∈Me​(C) each be positive semidefinite with trace 111. Set Φ(X)=Tr⁡E[U(X⊗σ)U†]\Phi(X)=\operatorname{Tr}_E[U(X\otimes\sigma)U^\dagger]Φ(X)=TrE​[U(X⊗σ)U†] and σout=Tr⁡Q[U(ρ⊗σ)U†]\sigma_{\mathrm{out}}=\operatorname{Tr}_Q[U(\rho\otimes\sigma)U^\dagger]σout​=TrQ​[U(ρ⊗σ)U†], where the partial traces sum diagonal entries over the discarded factors. Define S(Z)=−Re⁡Tr⁡[f(Z)]S(Z)=-\operatorname{Re}\operatorname{Tr}[f(Z)]S(Z)=−ReTr[f(Z)] by continuous functional calculus with f(x)=xlog⁡2xf(x)=x\log_2xf(x)=xlog2​x and 0log⁡20=00\log_2 0=00log2​0=0, and define EΦ(ρ)=S((id⁡⊗Φ)(ΓρΓρ†))E_\Phi(\rho)=S((\operatorname{id}\otimes\Phi)(\Gamma_\rho\Gamma_\rho^\dagger))EΦ​(ρ)=S((id⊗Φ)(Γρ​Γρ†​)), where Γρ(i,j)=(ρ)ji\Gamma_\rho(i,j)=(\sqrt{\rho})_{ji}Γρ​(i,j)=(ρ​)ji​. Then

∣S(σout)−S(σ)∣≤EΦ(ρ),EΦ(ρ)≤S(σ)+S(σout).|S(\sigma_{\mathrm{out}})-S(\sigma)|\le E_\Phi(\rho), \qquad E_\Phi(\rho)\le S(\sigma)+S(\sigma_{\mathrm{out}}).∣S(σout​)−S(σ)∣≤EΦ​(ρ),EΦ​(ρ)≤S(σ)+S(σout​).
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