Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition III.1: approximate disentangling converse

Open
QAlgorithms.Papers.Independent.Intakenext100.P47.disentangling_converse

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

prove2quantum

Let ρAB\rho_{AB}ρAB​ be a density matrix on finite nonzero spaces, d=dAdBd=d_Ad_Bd=dA​dB​, n≥1n\ge1n≥1, and ϵ≥0\epsilon\ge0ϵ≥0. Suppose TTT is a finite coordinated product-unitary ensemble with probabilities pip_ipi​ and NNN terms whose output on ρ⊗n\rho^{\otimes n}ρ⊗n is within full trace norm ϵ\epsilonϵ of a normalized separable state. Let F\mathcal FF consist of all pairs (R,σ)(R,\sigma)(R,σ) with RRR any COLUR map on the nnn copies, σ\sigmaσ separable and normalized, and ∥σ−R(ρ⊗n)∥1≤ϵ\|\sigma-R(\rho^{\otimes n})\|_1\le\epsilon∥σ−R(ρ⊗n)∥1​≤ϵ. Then F\mathcal FF is nonempty, its following entropy objective is bounded below, and

log⁡2N≥H(p)≥Se(T,ρ⊗n)≥inf⁡(R,σ)∈F(S(σ)−nS(ρ)−nϵlog⁡2d−η(ϵ)).\log_2N\ge H(p)\ge S_e(T,\rho^{\otimes n})\ge\inf_{(R,\sigma)\in\mathcal F}\bigl(S(\sigma)-nS(\rho)-n\epsilon\log_2d-\eta(\epsilon)\bigr).log2​N≥H(p)≥Se​(T,ρ⊗n)≥(R,σ)∈Finf​(S(σ)−nS(ρ)−nϵlog2​d−η(ϵ)).

The final η(ϵ)\eta(\epsilon)η(ϵ) has no factor nnn. This is the approximate disentangling converse and optimizes over all channels and targets, rather than targets near one fixed channel.

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.6, Proposition III.1: optimization includes R as well as its separable target.
The final erasureEta(eps) is not multiplied by n. -/
theorem disentangling_converse {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : Matrix (A × B) (A × B) ℂ)
    (hrho : IsDensityMatrix rho) (n : ℕ) (hn : 0 < n) (eps : ℝ) (heps : 0 ≤ eps)
    (T : COLUR (Copies A n) (Copies B n))
    (hT : Disentangles (T.operation (sourcePower rho n)) eps) :
    (separableEntropyCosts rho n eps).Nonempty ∧
    BddBelow (separableEntropyCosts rho n eps) ∧
    sInf (separableEntropyCosts rho n eps) ≤ entropyExchange T.operation (sourcePower rho n) ∧
    entropyExchange T.operation (sourcePower rho n) ≤ shannon T.weight ∧
    shannon T.weight ≤ Real.logb 2 T.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. 6, Proposition III.1: approximate disentangling converse
Read-back

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

For any finite nonempty types A,BA,BA,B, density matrix ρ\rhoρ on A×BA\times BA×B, positive integer nnn, real ε≥0\varepsilon\ge0ε≥0, and operation T(X)=∑i=0r−1wi(Ui⊗Vi)X(Ui⊗Vi)†\mathcal T(X)=\sum_{i=0}^{r-1}w_i(U_i\otimes V_i)X(U_i\otimes V_i)^\daggerT(X)=∑i=0r−1​wi​(Ui​⊗Vi​)X(Ui​⊗Vi​)†, where r>0r>0r>0, the local matrices are unitary, and the weights are nonnegative and sum to 111, write ρn\rho_nρn​ for the regrouped nnn-fold tensor power of ρ\rhoρ. Assume there exists a separable density matrix σ\sigmaσ with ∥T(ρn)−σ∥1≤ε\|\mathcal T(\rho_n)-\sigma\|_1\le\varepsilon∥T(ρn​)−σ∥1​≤ε; a separable density matrix means a finite convex combination of tensor products of local positive semidefinite trace-one matrices. Define C⊆RC\subseteq\mathbb RC⊆R to consist of all values

H(ω)−nH(ρ)−nεlog⁡2(∣A∣∣B∣)−η(ε)H(\omega)-nH(\rho)-n\varepsilon\log_2(|A||B|)-\eta(\varepsilon)H(ω)−nH(ρ)−nεlog2​(∣A∣∣B∣)−η(ε)

obtained from any such finite mixture R\mathcal RR of paired local unitary conjugations and any separable density matrix ω\omegaω satisfying ∥ω−R(ρn)∥1≤ε\|\omega-\mathcal R(\rho_n)\|_1\le\varepsilon∥ω−R(ρn​)∥1​≤ε. Then CCC is nonempty and bounded below, and

inf⁡C≤H ⁣((id⊗T)(∣ρn⟩⟨ρn∣))≤−∑iwilog⁡2wi≤log⁡2r.\inf C \le H\!\left((\mathrm{id}\otimes\mathcal T)(|\sqrt{\rho_n}\rangle\langle\sqrt{\rho_n}|)\right) \le-\sum_iw_i\log_2w_i \le\log_2 r.infC≤H((id⊗T)(∣ρn​​⟩⟨ρn​​∣))≤−i∑​wi​log2​wi​≤log2​r.

Here H(X)=−Re⁡Tr⁡[x↦xlog⁡2x](X)H(X)=-\operatorname{Re}\operatorname{Tr}[x\mapsto x\log_2x](X)H(X)=−ReTr[x↦xlog2​x](X), the canonical purification has coefficients (X)ji(\sqrt X)_{j i}(X​)ji​, ∥M∥1=Re⁡Tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{M^\dagger M}∥M∥1​=ReTrM†M​, and η(x)=−xlog⁡2x\eta(x)=-x\log_2xη(x)=−xlog2​x for x≤e−1x\le e^{-1}x≤e−1 and e−1log⁡2ee^{-1}\log_2ee−1log2​e otherwise. Zero weights and ε=0\varepsilon=0ε=0 are included, with the total logarithm convention log⁡20=0\log_2 0=0log2​0=0.

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