Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section II, Eq. (4): ordering of three finite noise costs

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.noiseCost_order

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on finite nonzero complex spaces, and let R(τ)=∑i=1Npi(Ui⊗Vi)τ(Ui⊗Vi)†R(\tau)=\sum_{i=1}^N p_i(U_i\otimes V_i)\tau(U_i\otimes V_i)^\daggerR(τ)=∑i=1N​pi​(Ui​⊗Vi​)τ(Ui​⊗Vi​)† be a chosen finite product-unitary ensemble, with N≥1N\ge1N≥1, pi≥0p_i\ge0pi​≥0, and ∑ipi=1\sum_i p_i=1∑i​pi​=1. Let H(p)=−∑ipilog⁡2piH(p)=-\sum_i p_i\log_2p_iH(p)=−∑i​pi​log2​pi​, using 0log⁡20=00\log_20=00log2​0=0. If ψ\psiψ purifies ρ\rhoρ, define Se(R,ρ)=S((id⊗R)(ψ))S_e(R,\rho)=S((\mathrm{id}\otimes R)(\psi))Se​(R,ρ)=S((id⊗R)(ψ)). Then

log⁡2N≥H(p)≥Se(R,ρ).\log_2N\ge H(p)\ge S_e(R,\rho).log2​N≥H(p)≥Se​(R,ρ).

The first two costs depend on the implementing ensemble, whereas the last depends only on its channel and the source state. This orders the finite noise resources used in the erasure converses.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P47
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P47

open QAlgorithms Filter

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies localProduct)

open QAlgorithms.Papers.Independent.Dependency50.P19 (mutualInformation first)

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

open QAlgorithms.Papers.Independent.Information100.P27 (shannon Config)

open QAlgorithms.Papers.Independent.Information100.P71 (channelPower)

open QAlgorithms.Papers.Independent.Advance50.P05 (RectangularInstrument)

open scoped Matrix ComplexConjugate

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.3, (4): the three costs of a chosen implementing ensemble are ordered. -/
theorem noiseCost_order {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) (R : COLUR A B) :
    entropyExchange R.operation rho ≤ shannon R.weight ∧
    shannon R.weight ≤ Real.logb 2 R.count := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P47

end
Source
On the quantum, classical and total amount of correlations in a quantum state, arXiv:quant-ph/0410091v2, PDF p. 3, Section II, Eq. (4): ordering of three finite noise costs
Read-back

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

For any finite nonempty types A,BA,BA,B, any positive semidefinite matrix ρ\rhoρ on A×BA\times BA×B with trace 111, and any positive-length list RRR of ccc pairs of local unitaries Ui,ViU_i,V_iUi​,Vi​, with nonnegative weights pip_ipi​ summing to 111, let T(X)=∑i<cpi(Ui⊗Vi)X(Ui⊗Vi)†T(X)=\sum_{i<c}p_i(U_i\otimes V_i)X(U_i\otimes V_i)^\daggerT(X)=∑i<c​pi​(Ui​⊗Vi​)X(Ui​⊗Vi​)†. The declaration asserts

H ⁣((id⊗T)(∣ξρ⟩⟨ξρ∣))≤−∑i<cpilog⁡2pi≤log⁡2c,H\!\left((\mathrm{id}\otimes T)(|\xi_\rho\rangle\langle\xi_\rho|)\right) \le -\sum_{i<c}p_i\log_2p_i \le \log_2c,H((id⊗T)(∣ξρ​⟩⟨ξρ​∣))≤−i<c∑​pi​log2​pi​≤log2​c,

where ξρ(u,v)=(ρ)v,u\xi_\rho(u,v)=(\sqrt\rho)_{v,u}ξρ​(u,v)=(ρ​)v,u​, ∣ξ⟩⟨ξ∣|\xi\rangle\langle\xi|∣ξ⟩⟨ξ∣ has entries ξxξy‾\xi_x\overline{\xi_y}ξx​ξy​​, and H(Y)=−Re⁡tr⁡[ x↦xlog⁡2x ](Y)H(Y)=-\operatorname{Re}\operatorname{tr}[\,x\mapsto x\log_2x\,](Y)H(Y)=−Retr[x↦xlog2​x](Y), with matrix functions given by continuous functional calculus. Zero weights and repeated unitaries are allowed, so ccc counts all entries of the specified list, including entries of weight zero.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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