Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Continuity of the normalized PPT relative-entropy infimum

Open
QAlgorithms.Papers.Independent.Intakethird100.P100.pptEntanglement_continuity

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

prove2quantum

Let HA,HBH_A,H_BHA​,HB​ have positive finite dimensions and set N=dim⁡(HA⊗HB)N=\dim(H_A\otimes H_B)N=dim(HA​⊗HB​). Let PPT\mathrm{PPT}PPT be exactly the trace-one positive semidefinite bipartite matrices whose partial transpose is positive semidefinite. Define EPPT(ω)=inf⁡τ∈PPTS(ω∥τ)E_{\mathrm{PPT}}(\omega)=\inf_{\tau\in\mathrm{PPT}}S(\omega\Vert\tau)EPPT​(ω)=infτ∈PPT​S(ω∥τ), retaining infinity at a support violation.

All logarithms are natural. States are positive semidefinite matrices of trace one, and the distance t=∥σ−ρ∥1t=\|\sigma-\rho\|_1t=∥σ−ρ∥1​ uses the full trace norm, without a factor of one half. Set η(t)=−tlog⁡t\eta(t)=-t\log tη(t)=−tlogt, with η(0)=0\eta(0)=0η(0)=0.

For arbitrary bipartite density matrices σ,ρ\sigma,\rhoσ,ρ with t≤1/3t\leq 1/3t≤1/3, both infima are finite and

∣EPPT(σ)−EPPT(ρ)∣≤2(tlog⁡N+η(t))+4t.|E_{\mathrm{PPT}}(\sigma)-E_{\mathrm{PPT}}(\rho)|\leq 2\bigl(t\log N+\eta(t)\bigr)+4t.∣EPPT​(σ)−EPPT​(ρ)∣≤2(tlogN+η(t))+4t.

This is the paper's normalized PPT variation. Neither input is required to be PPT.

Formalization Note The accepted entropy infimum is stored in bits. The Lean bound multiplies its absolute real difference by log⁡2\log 2log2, which gives exactly the natural-logarithm quantity displayed above.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P100
Formal statement
noncomputable section

open Filter

open scoped ENNReal Topology ComplexOrder

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P100

open QAlgorithms.Papers.Independent.Dependency50.P15
  (relativeDistance relativeDistanceValue positiveOperatorRelativeEntropyBits groupedTensorPower)

open QAlgorithms.Papers.Independent.Information100.P54
  (relativeEntropyBits relativeEntanglement)

/-- Remark (i), PDF p.2, and introduction, PDF p.1: the identical bound (3)
for minimization over normalized PPT states, with arbitrary density inputs. -/
theorem pptEntanglement_continuity
    {A B : Type*} [Fintype A] [Fintype B] [DecidableEq A] [DecidableEq B]
    [Nonempty A] [Nonempty B]
    (sigma rho : Matrix (A × B) (A × B) ℂ)
    (hsigma : IsDensityMatrix sigma) (hrho : IsDensityMatrix rho)
    (hclose : traceNorm (sigma - rho) ≤ 1 / 3) :
    pptEntanglement sigma < ⊤ ∧ pptEntanglement rho < ⊤ ∧
    Real.log 2 * |(pptEntanglement sigma).toReal -
      (pptEntanglement rho).toReal| ≤
      2 * (traceNorm (sigma - rho) * Real.log (Fintype.card (A × B)) +
        Real.negMulLog (traceNorm (sigma - rho))) + 4 * traceNorm (sigma - rho) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P100

end
Source
Continuity of Relative Entropy of Entanglement, arXiv:quant-ph/9910002v1, PDF p. 2, Remark (i), with the introductory variation on p.1
Read-back

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

For any finite, nonempty types A,BA,BA,B with decidable equality and density matrices σ,ρ\sigma,\rhoσ,ρ on A×BA\times BA×B, meaning positive semidefinite matrices with trace 111, put d=∣A×B∣d=|A\times B|d=∣A×B∣ and t=Re⁡tr⁡(σ−ρ)†(σ−ρ)t=\operatorname{Re}\operatorname{tr}\sqrt{(\sigma-\rho)^\dagger(\sigma-\rho)}t=Retr(σ−ρ)†(σ−ρ)​. If t≤1/3t\le1/3t≤1/3, then

EPPT(σ)<+∞,EPPT(ρ)<+∞,(ln⁡2)∣EPPT(σ)R−EPPT(ρ)R∣≤2(tln⁡d−tln⁡t)+4t.E_{\mathrm{PPT}}(\sigma)<+\infty,\qquad E_{\mathrm{PPT}}(\rho)<+\infty,\qquad (\ln2)\left|E_{\mathrm{PPT}}(\sigma)_{\mathbb R} -E_{\mathrm{PPT}}(\rho)_{\mathbb R}\right| \le2\bigl(t\ln d-t\ln t\bigr)+4t.EPPT​(σ)<+∞,EPPT​(ρ)<+∞,(ln2)∣EPPT​(σ)R​−EPPT​(ρ)R​∣≤2(tlnd−tlnt)+4t.

Here EPPT(X)=inf⁡Y∈PR(X∥Y)E_{\mathrm{PPT}}(X)=\inf_{Y\in\mathcal P}R(X\Vert Y)EPPT​(X)=infY∈P​R(X∥Y) in the extended nonnegative reals, where P\mathcal PP consists of density matrices YYY for which the matrix with entries Y(a,b),(a′,b′)TA=Y(a′,b),(a,b′)Y^{T_A}_{(a,b),(a',b')}=Y_{(a',b),(a,b')}Y(a,b),(a′,b′)TA​​=Y(a′,b),(a,b′)​ is positive semidefinite. For density matrices X,YX,YX,Y, the minimized quantity is max⁡{Re⁡tr⁡(f(X)−Xlog⁡Y),0}/ln⁡2\max\{\operatorname{Re}\operatorname{tr}(f(X)-X\log Y),0\}/\ln2max{Retr(f(X)−XlogY),0}/ln2 if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise; it is also +∞+\infty+∞ if either argument is not a density matrix. Here f(x)=xln⁡xf(x)=x\ln xf(x)=xlnx, and matrix functions use functional calculus with ln⁡0=0\ln0=0ln0=0. The subscript R\mathbb RR denotes conversion to a real number, sending +∞+\infty+∞ to 000, though the conclusion asserts finiteness. The cases t=0t=0t=0 and d=1d=1d=1 are included, with tln⁡t=0t\ln t=0tlnt=0 at zero.

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