Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

The complete deterministic and asymptotic comparison chain

Open
QAlgorithms.Papers.Independent.Intakethird100.P83.deterministicChain

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

prove2quantum

Let ρ\rhoρ be any normalized finite-dimensional bipartite state. Let E1E_1E1​ be its exact one-copy PPT rate with real target size, EΓ,0E_{\Gamma,0}EΓ,0​ the supremum of its positive-blocklength exact rate ratios, EΓE_\GammaEΓ​ the PPT rate with fidelity tending to one, EWE_WEW​ the logarithm of SDP (7), and ENE_NEN​ its logarithmic negativity. Then

E1(ρ)≤EΓ,0(ρ)≤EΓ(ρ)≤EW(ρ)≤EN(ρ).E_1(\rho)\le E_{\Gamma,0}(\rho)\le E_\Gamma(\rho)\le E_W(\rho)\le E_N(\rho).E1​(ρ)≤EΓ,0​(ρ)≤EΓ​(ρ)≤EW​(ρ)≤EN​(ρ).

All quantities are evaluated on the same state. The chain does not assert equality between deterministic and vanishing-error rates in general.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P83
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P83

open QAlgorithms.Papers.Independent.Support50.P11 (Loewner)

open QAlgorithms.Papers.Independent.Dependency50.P32 (partialTranspose)

open QAlgorithms.Papers.Independent.Information100.P34 (supportProjector)

variable {A B C D : Type*}

variable [Fintype A] [Fintype B] [Fintype C] [Fintype D]

variable [DecidableEq A] [DecidableEq B] [DecidableEq C] [DecidableEq D]

/-- Complete five-term comparison chain, PDF p.5. All quantities refer
to the same normalized state and the exact one-copy target size is real. -/
theorem deterministicChain [Nonempty A] [Nonempty B]
    (rho : Matrix (A × B) (A × B) ℂ) (hrho : IsDensityMatrix rho) :
    oneCopyExact rho ≤ exactRegularized rho ∧
    exactRegularized rho ≤ entanglementGamma rho ∧
    entanglementGamma rho ≤ entanglementW rho ∧
    entanglementW rho ≤ entanglementN rho := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P83

end
Source
Improved Semidefinite Programming Upper Bound on Distillable Entanglement, arXiv:1601.07940v4, PDF p. 5, Unnumbered result: complete deterministic/asymptotic comparison chain
Read-back

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

For any finite nonempty types A,BA,BA,B, each with decidable equality, and any positive semidefinite complex matrix ρ\rhoρ indexed by A×BA\times BA×B with trace 111, define X(a,b),(a′,b′)Γ=X(a,b′),(a′,b)X^\Gamma_{(a,b),(a',b')}=X_{(a,b'),(a',b)}X(a,b),(a′,b′)Γ​=X(a,b′),(a′,b)​, let ∥X∥1=Re⁡tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{tr}\sqrt{X^\dagger X}∥X∥1​=RetrX†X​, and let ∥⋅∥op\|\cdot\|_{\mathrm{op}}∥⋅∥op​ be the Euclidean operator norm. Define FX(k)F_X(k)FX​(k) as the real supremum of Re⁡tr⁡(XQ)\operatorname{Re}\operatorname{tr}(XQ)Retr(XQ) subject to k>0k>0k>0, 0⪯Q⪯I0\preceq Q\preceq I0⪯Q⪯I, and −k−1I⪯QΓ⪯k−1I-k^{-1}I\preceq Q^\Gamma\preceq k^{-1}I−k−1I⪯QΓ⪯k−1I, where ⪯\preceq⪯ means positive semidefinite difference. Define D(X)=sup⁡{log⁡2k:k∈R, k>0, FX(k)=1}D(X)=\sup\{\log_2 k:k\in\mathbb R,\ k>0,\ F_X(k)=1\}D(X)=sup{log2​k:k∈R, k>0, FX​(k)=1}, Dreg(X)=sup⁡m≥1D(X⊗m)/mD_{\mathrm{reg}}(X)=\sup_{m\ge1}D(X^{\otimes m})/mDreg​(X)=supm≥1​D(X⊗m)/m, and Γ(X)=sup⁡{r∈R:FX⊗n(2nr)→1}\Gamma(X)=\sup\{r\in\mathbb R:F_{X^{\otimes n}}(2^{nr})\to1\}Γ(X)=sup{r∈R:FX⊗n​(2nr)→1}, with no nonnegativity restriction on rrr. Tensor powers have entries ∏iX(ai,bi),(ai′,bi′)\prod_i X_{(a_i,b_i),(a'_i,b'_i)}∏i​X(ai​,bi​),(ai′​,bi′​)​, with the zeroth power equal to the scalar 111. Finally, set W(X)=log⁡2sup⁡RRe⁡tr⁡(XΓR)W(X)=\log_2\sup_R\operatorname{Re}\operatorname{tr}(X^\Gamma R)W(X)=log2​supR​Retr(XΓR), where RRR is Hermitian, ∥R∥op≤1\|R\|_{\mathrm{op}}\le1∥R∥op​≤1, and RΓ⪰0R^\Gamma\succeq0RΓ⪰0, and set N(X)=log⁡2∥XΓ∥1N(X)=\log_2\|X^\Gamma\|_1N(X)=log2​∥XΓ∥1​; all suprema here are real-valued. Then

D(ρ)≤Dreg(ρ)≤Γ(ρ)≤W(ρ)≤N(ρ).D(\rho)\le D_{\mathrm{reg}}(\rho)\le\Gamma(\rho)\le W(\rho)\le N(\rho).D(ρ)≤Dreg​(ρ)≤Γ(ρ)≤W(ρ)≤N(ρ).
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