Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Irreversibility in the complex spectral parametrization

Open
QAlgorithms.Papers.Independent.Intakethird100.P90.spectral_rank_two_irreversible

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

prove2quantum

All systems are finite-dimensional complex Hilbert spaces with fixed orthonormal product bases and positive local dimensions. A state is a positive semidefinite operator of trace one. All logarithms are base two and all operational rates are measured in standard Bell pairs (ebits) per input copy, with deterministic operations and error tending to zero. Write ED,ECE_D,E_CED​,EC​ for distillable entanglement and entanglement cost under completely PPT-preserving CPTP operations; an explicit LOCC subscript denotes unrestricted two-way local operations and classical communication.

Let 0<p<10<p<10<p<1, u1=(∣01⟩−∣10⟩)/2u_1=(|01\rangle-|10\rangle)/\sqrt2u1​=(∣01⟩−∣10⟩)/2​, and u2=(∣a⟩⊗∣b⟩−∣b⟩⊗∣a⟩)/2u_2=(|a\rangle\otimes|b\rangle-|b\rangle\otimes|a\rangle)/\sqrt2u2​=(∣a⟩⊗∣b⟩−∣b⟩⊗∣a⟩)/2​ for complex qutrit vectors a,ba,ba,b. Assume u2u_2u2​ is a unit vector orthogonal to u1u_1u1​, so that the displayed expression is a spectral decomposition of the state

ρ=p∣u1⟩⟨u1∣+(1−p)∣u2⟩⟨u2∣.\rho=p|u_1\rangle\langle u_1|+(1-p)|u_2\rangle\langle u_2|.ρ=p∣u1​⟩⟨u1​∣+(1−p)∣u2​⟩⟨u2​∣.

Then

ED(ρ)<1=EC(ρ).E_D(\rho)<1=E_C(\rho).ED​(ρ)<1=EC​(ρ).

Orthogonality is required also at p=1/2p=1/2p=1/2. The statement retains arbitrary complex spectral data rather than restricting to the real-angle representative used after a local basis change.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P90
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakethird100.P90

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms

open QAlgorithms.Papers.Independent.Dependency50.P36
  (relativeEntropy rains target canonicalMatrix allowed pptDistillable)

open QAlgorithms.Papers.Independent.Information100.P04 (gamma copies IsPPT)

open QAlgorithms.Papers.Independent.Next46.P42 (regroupProduct)

open QAlgorithms.Papers.Independent.Information100.P06 (supportProjection)

open QAlgorithms.Papers.Independent.Information100.P21 (FiniteLOCC)

open QAlgorithms.Papers.Independent.Gap48.P32 (antisymmetricQutrit)

/-- arXiv:1606.09421v3, PDF pp.4,7, Eq.(11) and Proposition 5. The spectral
vectors are unit and orthogonal, also when p=1/2; a,b may be complex. -/
theorem spectral_rank_two_irreversible
    (rho : Matrix (Fin 3 × Fin 3) (Fin 3 × Fin 3) ℂ)
    (p : ℝ) (a b : EuclideanSpace ℂ (Fin 3))
    (hstate : IsDensityMatrix rho) (hp0 : 0 < p) (hp1 : p < 1)
    (hunit : ‖exteriorKet a b‖ = 1)
    (horth : inner ℂ (antisymmetricKet 1) (exteriorKet a b) = 0)
    (hspectral : rho = (p : ℂ) • pureDensity (antisymmetricKet 1) +
      ((1-p : ℝ) : ℂ) • pureDensity (exteriorKet a b)) :
    pptDistillable rho < 1 ∧ asymptoticEntanglementCost false rho = 1 := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P90

end
Source
Irreversibility of Asymptotic Entanglement Manipulation Under Quantum Operations Completely Preserving Positivity of Partial Transpose, arXiv:1606.09421v3, PDF p. 7, Proposition 5: spectral form of the rank-two antisymmetric example
Read-back

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

For every complex matrix ρ\rhoρ on {0,1,2}×{0,1,2}\{0,1,2\}\times\{0,1,2\}{0,1,2}×{0,1,2}, real ppp, and vectors a,b∈C3a,b\in\mathbb C^3a,b∈C3, assume that ρ≥0\rho\ge0ρ≥0, Tr⁡ρ=1\operatorname{Tr}\rho=1Trρ=1, 0<p<10<p<10<p<1, and, on defining

u=∣0,1⟩−∣1,0⟩2,w(i,j)=aibj−biaj2,u=\frac{|0,1\rangle-|1,0\rangle}{\sqrt2}, \qquad w_{(i,j)}=\frac{a_i b_j-b_i a_j}{\sqrt2},u=2​∣0,1⟩−∣1,0⟩​,w(i,j)​=2​ai​bj​−bi​aj​​,

one has ∥w∥=1\|w\|=1∥w∥=1, ⟨u,w⟩=0\langle u,w\rangle=0⟨u,w⟩=0, and ρ=p uu†+(1−p) ww†\rho=p\,uu^\dagger+(1-p)\,ww^\daggerρ=puu†+(1−p)ww†. Here kets are coordinate basis vectors, norms and inner products are Euclidean, and vv†vv^\daggervv† has entries vxvy‾v_x\overline{v_y}vx​vy​​; the vectors a,ba,ba,b themselves are not separately required to be normalized or orthogonal. The conclusion is DPPT(ρ)<1D_{\mathrm{PPT}}(\rho)<1DPPT​(ρ)<1 and CPPT(ρ)=1C_{\mathrm{PPT}}(\rho)=1CPPT​(ρ)=1, with both quantities extended-real valued. Specifically, write (ΓX)(i,j),(i′,j′)=X(i,j′),(i′,j)(\Gamma X)_{(i,j),(i',j')}=X_{(i,j'),(i',j)}(ΓX)(i,j),(i′,j′)​=X(i,j′),(i′,j)​, ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​, and let Φk\Phi_kΦk​ have entry 1/k1/k1/k when both row and column have equal party indices and 000 otherwise. A channel is a finite Kraus sum X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I; it is PPT when its partial-transpose conjugate is also a channel. The quantity DPPT(ρ)D_{\mathrm{PPT}}(\rho)DPPT​(ρ) is the supremum of r≥0r\ge0r≥0 such that, for every ε>0\varepsilon>0ε>0, all sufficiently large natural nnn admit a PPT channel taking ρ⊗n\rho^{\otimes n}ρ⊗n within trace norm ε\varepsilonε of Φ⌈2nr⌉\Phi_{\lceil2^{nr}\rceil}Φ⌈2nr⌉​. The quantity CPPT(ρ)C_{\mathrm{PPT}}(\rho)CPPT​(ρ) is the infimum of r≥0r\ge0r≥0 such that, for every ε,δ>0\varepsilon,\delta>0ε,δ>0, all sufficiently large positive natural nnn admit m∈Nm\in\mathbb Nm∈N and a PPT channel taking Φ2m\Phi_{2^m}Φ2m​ within trace norm ε\varepsilonε of ρ⊗n\rho^{\otimes n}ρ⊗n, with m≤n(r+δ)m\le n(r+\delta)m≤n(r+δ). Tensor-power entries are products of single-copy entries, party registers are grouped and relabelled by the fixed finite-index bijections, and m=0m=0m=0 is allowed.

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