Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Sufficient condition for attaining the trace-norm fidelity bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P43.trace_norm_bound_attainment

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All operators act on a finite bipartite space Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd in a fixed product basis. Write Γ=T2\Gamma=T_2Γ=T2​ for Bob's partial transpose and Pm=∣ψm⟩⟨ψm∣P_m=|\psi_m\rangle\langle\psi_m|Pm​=∣ψm​⟩⟨ψm​∣, where ∣ψm⟩=m−1/2∑i∣ii⟩|\psi_m\rangle=m^{-1/2}\sum_i|ii\rangle∣ψm​⟩=m−1/2∑i​∣ii⟩. A density operator is positive semidefinite with complex trace exactly one. An admissible PPT map is complex-linear, positive and trace preserving, and ΓoutTΓin\Gamma_{\rm out}T\Gamma_{\rm in}Γout​TΓin​ is positive on every positive operator. A PPT channel is additionally completely positive; complete positivity of the transpose-conjugated map is not required. Fidelity means the overlap tr⁡(PmT(ρ))\operatorname{tr}(P_m T(\rho))tr(Pm​T(ρ)).

Let d≥1d\ge1d≥1, m≥2m\ge2m≥2, and let ρ\rhoρ be any density operator. Let PnegP_{\rm neg}Pneg​ be the negative spectral projector of ρΓ\rho^\GammaρΓ. If ∥PnegΓ∥∞≤1/2\|P_{\rm neg}^\Gamma\|_\infty\le1/2∥PnegΓ​∥∞​≤1/2, then A=(I−2PnegΓ)/mA=(I-2P_{\rm neg}^\Gamma)/mA=(I−2PnegΓ​)/m is admissible and its isotropic PPT channel attains the optimal overlap:

tr⁡(PmTA(ρ))=Fm(ρ)=∥ρΓ∥1m.\operatorname{tr}(P_mT_A(\rho))=F_m(\rho)=\frac{\|\rho^\Gamma\|_1}{m}.tr(Pm​TA​(ρ))=Fm​(ρ)=m∥ρΓ∥1​​.

The optimum is over admissible positive PPT maps. This is a sufficient condition only and includes PPT states, for which Pneg=0P_{\rm neg}=0Pneg​=0 and A=I/mA=I/mA=I/m.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P43
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P43

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P04
  (gamma copies bellProjector negativeProjector werner)

open QAlgorithms.Papers.Independent.Information100.P30 (IsPositiveMap)

/-- PDF p.3, last sentence before Section III: sufficient condition for attaining
(10), with the explicit epsilon=2 channel. Includes PPT states, where P_neg=0.
The nontrivial target restriction m>=2 is inherited from (6); no converse is asserted. -/
theorem trace_norm_bound_attainment (d m : ℕ) (hd : 0 < d) (hm : 2 ≤ m)
    (rho : Matrix (Fin d × Fin d) (Fin d × Fin d) ℂ)
    (hrho : IsDensityMatrix rho)
    (hsmall : specNorm (gamma (negativeProjector rho)) ≤ 1/2) :
    let A := negativeSpaceWitness rho m 2
    RainsFeasibleEffect m A ∧ IsPositiveConjugatePPTChannel (isotropicPreparation m A) ∧
      effectProb (bellProjector m) (isotropicPreparation m A rho) = traceNorm (gamma rho) / (m : ℝ) ∧
      IsGreatest (positivePPTFidelityValues rho m) (traceNorm (gamma rho) / (m : ℝ)) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P43

end
Source
Distillability via protocols respecting the positivity of partial transpose, arXiv:quant-ph/0104095v2, PDF p. 3, Sentence immediately after Eq. (10)
Read-back

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

For every pair of natural numbers d>0d>0d>0 and m≥2m\ge2m≥2 and every positive semidefinite complex matrix ρ\rhoρ of trace one indexed by {0,…,d−1}2\{0,\ldots,d-1\}^2{0,…,d−1}2, define (ΓX)(a,b),(a′,b′)=X(a,b′),(a′,b)(\Gamma X)_{(a,b),(a',b')}=X_{(a,b'),(a',b)}(ΓX)(a,b),(a′,b′)​=X(a,b′),(a′,b)​ and Q=1(−∞,0)(Γρ)Q=\mathbf1_{(-\infty,0)}(\Gamma\rho)Q=1(−∞,0)​(Γρ), using functional calculus with the function that is one on strictly negative eigenvalues and zero elsewhere. Suppose that the Euclidean operator norm satisfies ∥ΓQ∥op≤1/2\|\Gamma Q\|_{\mathrm{op}}\le1/2∥ΓQ∥op​≤1/2, with no assumption that Γρ\Gamma\rhoΓρ has a negative eigenvalue. Set A=(I−2ΓQ)/mA=(I-2\Gamma Q)/mA=(I−2ΓQ)/m, let PmP_mPm​ have entry 1/m1/m1/m when both row and column pairs have equal components and zero otherwise, and define

Pm(A)(X)=tr⁡(X(I−A))m2−1(I−Pm)+tr⁡(XA)Pm.\mathcal P_m(A)(X) =\frac{\operatorname{tr}(X(I-A))}{m^2-1}(I-P_m)+\operatorname{tr}(XA)P_m.Pm​(A)(X)=m2−1tr(X(I−A))​(I−Pm​)+tr(XA)Pm​.

Then AAA is Hermitian and AAA, I−AI-AI−A, I−mΓAI-m\Gamma AI−mΓA, and I+mΓAI+m\Gamma AI+mΓA are positive semidefinite. The map Pm(A)\mathcal P_m(A)Pm​(A) is positive, trace preserving, completely positive, and satisfies ΓPm(A)(ΓX)≥0\Gamma\mathcal P_m(A)(\Gamma X)\ge0ΓPm​(A)(ΓX)≥0 for every X≥0X\ge0X≥0; complete positivity means positivity of its blockwise extension by every finite identity map, including auxiliary size zero. Its overlap satisfies

Re⁡tr⁡ ⁣(PmPm(A)(ρ))=∥Γρ∥1m,∥Y∥1=Re⁡tr⁡Y†Y.\operatorname{Re}\operatorname{tr}\!\bigl(P_m\mathcal P_m(A)(\rho)\bigr) =\frac{\|\Gamma\rho\|_1}{m}, \qquad \|Y\|_1=\operatorname{Re}\operatorname{tr}\sqrt{Y^\dagger Y}.Retr(Pm​Pm​(A)(ρ))=m∥Γρ∥1​​,∥Y∥1​=RetrY†Y​.

This number is the greatest element of the set of overlaps Re⁡tr⁡(PmT(ρ))\operatorname{Re}\operatorname{tr}(P_mT(\rho))Retr(Pm​T(ρ)) over all complex-linear maps TTT to the m2m^2m2-dimensional output matrix space that are positive, preserve every matrix’s trace, and satisfy ΓT(ΓX)≥0\Gamma T(\Gamma X)\ge0ΓT(ΓX)≥0 for every X≥0X\ge0X≥0: it is itself attained and is at least every other value in that set, whose defining maps need not be completely positive.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me