Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Equation (51) and Figure 1: rank-three catalytic region, strict boundary corrected

Open
QAlgorithms.Papers.Independent.Intakethird100.P95.rankThreeCatalysis

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

prove2quantum

Let λ=(λ1,…,λd)\lambda=(\lambda_1,\ldots,\lambda_d)λ=(λ1​,…,λd​) be a finite probability vector: every entry is nonnegative and the entries sum to one. Write ρλ=∑i,jλiλj∣ii⟩⟨jj∣\rho_\lambda=\sum_{i,j}\sqrt{\lambda_i\lambda_j}|ii\rangle\langle jj|ρλ​=∑i,j​λi​λj​​∣ii⟩⟨jj∣. All logarithms have base two. A PPT operation is a completely positive, trace-preserving map LLL such that ΓoutLΓin\Gamma_{\rm out}L\Gamma_{\rm in}Γout​LΓin​ is completely positive for arbitrary finite ancillary systems; Γ\GammaΓ transposes Bob in the fixed product basis. For a positive integer KKK, ΦK\Phi_KΦK​ denotes the maximally entangled state of Schmidt rank KKK. Assume the target has three strictly positive probabilities in nondecreasing order. Then

[∃C≥2:  ΦC⊗Φ2→PPTΦC⊗ρλ]⟺2(λ3↑λ2↑+λ3↑λ1↑+λ1↑λ2↑)<1.\bigl[\exists C\ge2:\;\Phi_C\otimes\Phi_2\to^{\rm PPT}\Phi_C\otimes\rho_\lambda\bigr]\quad\Longleftrightarrow\quad2\bigl(\sqrt{\lambda_3^\uparrow\lambda_2^\uparrow}+\sqrt{\lambda_3^\uparrow\lambda_1^\uparrow}+\sqrt{\lambda_1^\uparrow\lambda_2^\uparrow}\bigr)<1.[∃C≥2:ΦC​⊗Φ2​→PPTΦC​⊗ρλ​]⟺2(λ3↑​λ2↑​​+λ3↑​λ1↑​​+λ1↑​λ2↑​​)<1.

This gives the finite-catalyst preparation region of Figure 1.

Source correction. Equation (51) prints a non-strict inequality, but Theorem 21 requires the strict inequality displayed here.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P95
Formal statement
noncomputable section

open scoped BigOperators Matrix ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakethird100.P95

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact primitives from the pinned accepted library; no local aliases.

open QAlgorithms.Papers.Independent.Claimed50.P28 (maximallyEntangledDensity)

open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability)

open QAlgorithms.Papers.Independent.Information100.P63 (logTwo)

open QAlgorithms.Papers.Independent.Information100.P19 (outer)

open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)

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

/-- PDF p.9, (51), CORRECTED BOUNDARY: printed ≤1 is replaced by <1, as required
by Theorem 21. The positive spectrum (1/18,1/18,8/9) has S_{1/2}=1 and
cannot be prepared with any finite catalyst, so the printed equality case is false. -/
theorem rankThreeCatalysis (lam : Fin 3 → ℝ) (hprob : IsProbability lam)
    (hpos : ∀ i, 0 < lam i) (hsorted : Monotone lam) :
    CatalyticPreparation 2 lam ↔
      2 * (Real.sqrt (lam 2 * lam 1) + Real.sqrt (lam 2 * lam 0) +
        Real.sqrt (lam 0 * lam 1)) < 1 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P95

end
Source
Pure-state transformations and catalysis under operations that completely preserve positivity of partial transpose, arXiv:0801.4322v2, PDF p. 9, Equation (51) and Figure 1: rank-three catalytic region, strict boundary corrected
Read-back

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

For every vector λ=(λ0,λ1,λ2)\lambda=(\lambda_0,\lambda_1,\lambda_2)λ=(λ0​,λ1​,λ2​) satisfying 0<λ0≤λ1≤λ20<\lambda_0\le\lambda_1\le\lambda_20<λ0​≤λ1​≤λ2​ and λ0+λ1+λ2=1\lambda_0+\lambda_1+\lambda_2=1λ0​+λ1​+λ2​=1, there exist an integer C≥2C\ge2C≥2 and a complex-linear, trace-preserving map L\mathcal LL sending ΩC⊗Ω2\Omega_C\otimes\Omega_2ΩC​⊗Ω2​ to ΩC⊗ρλ\Omega_C\otimes\rho_\lambdaΩC​⊗ρλ​, with both L\mathcal LL and ΓoutLΓin\Gamma_{\rm out}\mathcal L\Gamma_{\rm in}Γout​LΓin​ completely positive, if and only if

2(λ2λ1+λ2λ0+λ0λ1)<1.2\bigl(\sqrt{\lambda_2\lambda_1}+\sqrt{\lambda_2\lambda_0} +\sqrt{\lambda_0\lambda_1}\bigr)<1.2(λ2​λ1​​+λ2​λ0​​+λ0​λ1​​)<1.

Here Ωm=m−1∑i,j=0m−1∣ii⟩⟨jj∣\Omega_m=m^{-1}\sum_{i,j=0}^{m-1}|ii\rangle\langle jj|Ωm​=m−1∑i,j=0m−1​∣ii⟩⟨jj∣, and ρλ\rho_\lambdaρλ​ has entries λiλk\sqrt{\lambda_i\lambda_k}λi​λk​​ at ((i,i),(k,k))((i,i),(k,k))((i,i),(k,k)) and zero elsewhere. Each tensor product groups the first factors together and the second factors together; Γ\GammaΓ transposes the latter factor, (Γ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)​. Complete positivity requires positivity preservation under every finite identity amplification, including size zero, and trace preservation holds for every matrix. This equivalence imposes no additional requirement about whether conversion without the factor ΩC\Omega_CΩC​ exists.

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