Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8: the explicit p0=1/2, px=py=pz=1/6 example

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.pauli_gap_numerical

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let p0,px,py,pz≥0p_0,p_x,p_y,p_z\ge0p0​,px​,py​,pz​≥0 sum to one, with

p0+pz−px−py≥∣p0+py−px−pz∣,p0+pz−px−py≥∣p0+px−py−pz∣.p_0+p_z-p_x-p_y\ge |p_0+p_y-p_x-p_z|,\qquad p_0+p_z-p_x-p_y\ge |p_0+p_x-p_y-p_z|.p0​+pz​−px​−py​≥∣p0​+py​−px​−pz​∣,p0​+pz​−px​−py​≥∣p0​+px​−py​−pz​∣.

In output:environment order on C2⊗C4\mathbb C^2\otimes\mathbb C^4C2⊗C4, put

u=p0∣00⟩+px∣1x⟩+ipy∣1y⟩+pz∣0z⟩,u=\sqrt{p_0}|00\rangle+\sqrt{p_x}|1x\rangle+i\sqrt{p_y}|1y\rangle+\sqrt{p_z}|0z\rangle,u=p0​​∣00⟩+px​​∣1x⟩+ipy​​∣1y⟩+pz​​∣0z⟩, v=p0∣10⟩+px∣0x⟩−ipy∣0y⟩−pz∣1z⟩.v=\sqrt{p_0}|10\rangle+\sqrt{p_x}|0x\rangle-i\sqrt{p_y}|0y\rangle-\sqrt{p_z}|1z\rangle.v=p0​​∣10⟩+px​​∣0x⟩−ipy​​∣0y⟩−pz​​∣1z⟩.

Write ρs=s∣u⟩⟨u∣+(1−s)∣v⟩⟨v∣\rho_s=s|u\rangle\langle u|+(1-s)|v\rangle\langle v|ρs​=s∣u⟩⟨u∣+(1−s)∣v⟩⟨v∣ for 0≤s≤10\le s\le10≤s≤1, ρT=ρ1/2\rho_T=\rho_{1/2}ρT​=ρ1/2​, and h=H2(p0+pz)h=H_2(p_0+p_z)h=H2​(p0​+pz​), where H2(t)=−tlog⁡2t−(1−t)log⁡2(1−t)H_2(t)=-t\log_2t-(1-t)\log_2(1-t)H2​(t)=−tlog2​t−(1−t)log2​(1−t) and 0log⁡20=00\log_2 0=00log2​0=0. Entanglement is measured across the two displayed parties.

Fix (p0,px,py,pz)=(1/2,1/6,1/6,1/6)(p_0,p_x,p_y,p_z)=(1/2,1/6,1/6,1/6)(p0​,px​,py​,pz​)=(1/2,1/6,1/6,1/6). The corrected exact calculation gives

∥ρTΓ∥1=2+133,ED(ρT)≤log⁡22+133<H2(1/3)=Ec(ρT).\|\rho_T^\Gamma\|_1=\frac{2+\sqrt{13}}3,\qquad E_D(\rho_T)\le\log_2\frac{2+\sqrt{13}}3<H_2(1/3)=E_c(\rho_T).∥ρTΓ​∥1​=32+13​​,ED​(ρT​)≤log2​32+13​​<H2​(1/3)=Ec​(ρT​).

This provides an explicit strict irreversibility example. The source prints 5/35/35/3 for the norm and uses the stray label ρ1\rho_1ρ1​ for its cost. The norm is corrected because its own quartic factors as (z−1/3)2(z2−z/3−1/3)(z-1/3)^2(z^2-z/3-1/3)(z−1/3)2(z2−z/3−1/3), with negative partial-transpose eigenvalue (1−13)/12(1-\sqrt{13})/12(1−13​)/12 twice. The original quotation is preserved in the metadata; round 1 moderation independently verified this minimal correction.

Here EfE_fEf​ is the infimum of average pure-state marginal entropy over normalized finite decompositions of the stated density matrix. EcE_cEc​ is the asymptotic EPR preparation rate under deterministic two-way LOCC, and EDE_DED​ is the corresponding asymptotic distillation rate, in bits per copy. All entropies and logarithms are in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P60
Formal statement
namespace QAlgorithms.Papers.Independent.Intakenext100.P60

open scoped Matrix ComplexConjugate ComplexOrder TensorProduct

noncomputable section

attribute [local instance] Classical.propDecidable Classical.decEq

-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.

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

open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)

open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)

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

/-- PDF p.15: fixed example. Printed: ||rho_T^Gamma||_1=5/3 and Ec(rho_1).
Changed: norm=(2+sqrt(13))/3 and label rho_T. Why: the p.14 quartic factors as
(z-1/3)^2(z^2-z/3-1/3), giving negative partial-transpose eigenvalue
(1-sqrt(13))/12 twice. The strict gap survives. Independent moderation is required. -/
theorem pauli_gap_numerical :
    let p : Fin 4 → ℝ := ![1 / 2, 1 / 6, 1 / 6, 1 / 6]
    let rho := pauliMixture p (1 / 2)
    traceNorm (Entanglement.partialTransposeFirst rho) = (2 + Real.sqrt 13) / 3 ∧
    twoWayDistillable rho ≤ Real.logb 2 ((2 + Real.sqrt 13) / 3) ∧
    Real.logb 2 ((2 + Real.sqrt 13) / 3) < binEntropy2 (1 / 3) ∧
    formationCostBits rho = binEntropy2 (1 / 3) ∧ twoWayDistillable rho < formationCostBits rho := by sorry

end

end QAlgorithms.Papers.Independent.Intakenext100.P60
Source
Remarks on additivity of the Holevo channel capacity and of the entanglement of formation, arXiv:quant-ph/0206148v4, PDF p. 15, §8: the explicit p0=1/2, px=py=pz=1/6 example
Read-back

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

In C2⊗C4\mathbb C^2\otimes\mathbb C^4C2⊗C4, let

v0=∣0,0⟩2+∣1,1⟩+i∣1,2⟩+∣0,3⟩6,v1=∣1,0⟩2+∣0,1⟩−i∣0,2⟩−∣1,3⟩6,ρ=12∣v0⟩⟨v0∣+12∣v1⟩⟨v1∣.v_0=\frac{|0,0\rangle}{\sqrt2} +\frac{|1,1\rangle+i|1,2\rangle+|0,3\rangle}{\sqrt6}, \qquad v_1=\frac{|1,0\rangle}{\sqrt2} +\frac{|0,1\rangle-i|0,2\rangle-|1,3\rangle}{\sqrt6}, \qquad \rho=\tfrac12|v_0\rangle\langle v_0|+\tfrac12|v_1\rangle\langle v_1|.v0​=2​∣0,0⟩​+6​∣1,1⟩+i∣1,2⟩+∣0,3⟩​,v1​=2​∣1,0⟩​+6​∣0,1⟩−i∣0,2⟩−∣1,3⟩​,ρ=21​∣v0​⟩⟨v0​∣+21​∣v1​⟩⟨v1​∣.

For the partial transpose on the first factor, defined by (ρTA)(a,b),(c,d)=ρ(c,b),(a,d)(\rho^{T_A})_{(a,b),(c,d)}=\rho_{(c,b),(a,d)}(ρTA​)(a,b),(c,d)​=ρ(c,b),(a,d)​, all the following hold:

∥ρTA∥1=2+133,D(ρ)≤log⁡22+133<h2 ⁣(13),C(ρ)=h2 ⁣(13),D(ρ)<C(ρ).\|\rho^{T_A}\|_1=\frac{2+\sqrt{13}}3,\qquad D(\rho)\le\log_2\frac{2+\sqrt{13}}3 <h_2\!\left(\tfrac13\right),\qquad C(\rho)=h_2\!\left(\tfrac13\right),\qquad D(\rho)<C(\rho).∥ρTA​∥1​=32+13​​,D(ρ)≤log2​32+13​​<h2​(31​),C(ρ)=h2​(31​),D(ρ)<C(ρ).

Here h2(x)=[−xlog⁡x−(1−x)log⁡(1−x)]/log⁡2h_2(x)=[-x\log x-(1-x)\log(1-x)]/\log2h2​(x)=[−xlogx−(1−x)log(1−x)]/log2, and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​, using spectral functional calculus. The quantity D(ω)D(\omega)D(ω) is the real supremum of the rates R≥0R\ge0R≥0 for which, for every ϵ,η>0\epsilon,\eta>0ϵ,η>0, every sufficiently large positive integer rrr admits ℓ>0\ell>0ℓ>0 and a finite local protocol LLL with r(R−η)≤log⁡2ℓr(R-\eta)\le\log_2\ellr(R−η)≤log2​ℓ and ∥L(ω[r])−Φℓ∥1≤ϵ\|L(\omega^{[r]})-\Phi_\ell\|_1\le\epsilon∥L(ω[r])−Φℓ​∥1​≤ϵ; Φℓ\Phi_\ellΦℓ​ is the projector onto ℓ−1/2∑j<ℓ∣j,j⟩\ell^{-1/2}\sum_{j<\ell}|j,j\rangleℓ−1/2∑j<ℓ​∣j,j⟩. Grouped powers have entries given by products of the corresponding one-copy entries and use the fixed bijections from strings to indices of the power dimensions. The quantity C(ω)C(\omega)C(ω) is the real infimum of all real EEE such that, for every ϵ,η>0\epsilon,\eta>0ϵ,η>0, some integers m≥0m\ge0m≥0, r>0r>0r>0 and finite local protocol LLL satisfy ∣E−m/r∣≤η|E-m/r|\le\eta∣E−m/r∣≤η and 12∥L(Sm)−ω^[r]∥1≤ϵ\tfrac12\|L(S_m)-\widehat\omega^{[r]}\|_1\le\epsilon21​∥L(Sm​)−ω[r]∥1​≤ϵ, where SmS_mSm​ is the grouped mmm-fold power of the projector onto (∣0,1⟩−∣1,0⟩)/2(|0,1\rangle-|1,0\rangle)/\sqrt2(∣0,1⟩−∣1,0⟩)/2​, and ω^\widehat\omegaω is obtained by relabeling each local basis through the fixed finite-basis enumeration. The case m=0m=0m=0 is included, and no lower bound tending to infinity is imposed on the chosen formation block length. The finite local protocols in these definitions are recursively generated by identity maps and local finite Kraus families with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, followed by branch-dependent protocols and addition of their unnormalized outputs.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me