Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8: persistence of the strict gap for nearby mixtures

Open
QAlgorithms.Papers.Independent.Intakenext100.P60.pauli_gap_neighborhood

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.

Define

fp(z)=z4−z3+4(p0pxpy+p0pxpz+p0pypz+pxpypz)z−16p0pxpypz.f_p(z)=z^4-z^3+4(p_0p_xp_y+p_0p_xp_z+p_0p_yp_z+p_xp_yp_z)z-16p_0p_xp_yp_z.fp​(z)=z4−z3+4(p0​px​py​+p0​px​pz​+p0​py​pz​+px​py​pz​)z−16p0​px​py​pz​.

Assume the strict condition fp(−(2h−1)/2)>0f_p(-(2^h-1)/2)>0fp​(−(2h−1)/2)>0.

There is δ>0\delta>0δ>0, depending on these fixed weights, such that

0≤s≤1,∣s−12∣<δ⟹ED(ρs)≤log⁡2∥ρsΓ∥1<Ec(ρs)=h.0\le s\le1,\quad |s-\tfrac12|<\delta\quad\Longrightarrow\quad E_D(\rho_s)\le\log_2\|\rho_s^\Gamma\|_1<E_c(\rho_s)=h.0≤s≤1,∣s−21​∣<δ⟹ED​(ρs​)≤log2​∥ρsΓ​∥1​<Ec​(ρs​)=h.

This is persistence of the strict gap along the one-parameter mixture line named in the source.

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: continuity gives a neighborhood within the explicitly named mixture
line, not within the full state space. The preceding strict condition (20) is retained. -/
theorem pauli_gap_neighborhood (p : Fin 4 → ℝ) (hp : PauliAdmissible p)
    (hgap : GapCriterion p) :
    ∃ delta > (0 : ℝ), ∀ s ∈ Set.Icc (0 : ℝ) 1, |s - 1 / 2| < delta →
      twoWayDistillable (pauliMixture p s) ≤
        Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p s))) ∧
      Real.logb 2 (traceNorm (Entanglement.partialTransposeFirst (pauliMixture p s))) <
        formationCostBits (pauliMixture p s) ∧
      formationCostBits (pauliMixture p s) = binEntropy2 (p 0 + p 3) ∧
      twoWayDistillable (pauliMixture p s) < formationCostBits (pauliMixture p s) := 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: persistence of the strict gap for nearby mixtures
Read-back

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

Let p0,p1,p2,p3∈Rp_0,p_1,p_2,p_3\in\mathbb Rp0​,p1​,p2​,p3​∈R satisfy

pi≥0,∑i=03pi=1,∣p0+p2−p1−p3∣≤p0+p3−p1−p2,∣p0+p1−p2−p3∣≤p0+p3−p1−p2.p_i\ge0,\qquad \sum_{i=0}^3p_i=1,\qquad |p_0+p_2-p_1-p_3|\le p_0+p_3-p_1-p_2,\qquad |p_0+p_1-p_2-p_3|\le p_0+p_3-p_1-p_2.pi​≥0,i=0∑3​pi​=1,∣p0​+p2​−p1​−p3​∣≤p0​+p3​−p1​−p2​,∣p0​+p1​−p2​−p3​∣≤p0​+p3​−p1​−p2​.

Set H2(x)=binEntropy⁡(x)/log⁡2H_2(x)=\operatorname{binEntropy}(x)/\log2H2​(x)=binEntropy(x)/log2, and assume the strict polynomial inequality

gp ⁣(−2H2(p0+p3)−12)>0,gp(z)=z4−z3+4(p0p1p2+p0p1p3+p0p2p3+p1p2p3)z−16p0p1p2p3.g_p\!\left(-\frac{2^{H_2(p_0+p_3)}-1}{2}\right)>0,\qquad g_p(z)=z^4-z^3+ 4(p_0p_1p_2+p_0p_1p_3+p_0p_2p_3+p_1p_2p_3)z -16p_0p_1p_2p_3.gp​(−22H2​(p0​+p3​)−1​)>0,gp​(z)=z4−z3+4(p0​p1​p2​+p0​p1​p3​+p0​p2​p3​+p1​p2​p3​)z−16p0​p1​p2​p3​.

Define

v0=p0∣0,0⟩+p1∣1,1⟩+ip2∣1,2⟩+p3∣0,3⟩,v1=p0∣1,0⟩+p1∣0,1⟩−ip2∣0,2⟩−p3∣1,3⟩,ρs=s∣v0⟩⟨v0∣+(1−s)∣v1⟩⟨v1∣v_0=\sqrt{p_0}|0,0\rangle+\sqrt{p_1}|1,1\rangle +i\sqrt{p_2}|1,2\rangle+\sqrt{p_3}|0,3\rangle,\qquad v_1=\sqrt{p_0}|1,0\rangle+\sqrt{p_1}|0,1\rangle -i\sqrt{p_2}|0,2\rangle-\sqrt{p_3}|1,3\rangle,\qquad \rho_s=s|v_0\rangle\langle v_0|+(1-s)|v_1\rangle\langle v_1|v0​=p0​​∣0,0⟩+p1​​∣1,1⟩+ip2​​∣1,2⟩+p3​​∣0,3⟩,v1​=p0​​∣1,0⟩+p1​​∣0,1⟩−ip2​​∣0,2⟩−p3​​∣1,3⟩,ρs​=s∣v0​⟩⟨v0​∣+(1−s)∣v1​⟩⟨v1​∣

on C2⊗C4\mathbb C^2\otimes\mathbb C^4C2⊗C4. For matrices, use X(i,j),(k,l)TA=X(k,j),(i,l)X^{T_A}_{(i,j),(k,l)}=X_{(k,j),(i,l)}X(i,j),(k,l)TA​​=X(k,j),(i,l)​ and ∥X∥1=Re⁡Tr⁡X†X\|X\|_1=\operatorname{Re}\operatorname{Tr}\sqrt{X^\dagger X}∥X∥1​=ReTrX†X​. Here C(X)C(X)C(X) denotes the real infimum of real EEE for which every ε,η>0\varepsilon,\eta>0ε,η>0 admits integers m≥0,n>0m\ge0,n>0m≥0,n>0 and a finite local protocol LLL with

∣E−m/n∣≤η,12∥L(Sm)−X[n]∥1≤ε.|E-m/n|\le\eta,\qquad \tfrac12\|L(S_m)-X^{[n]}\|_1\le\varepsilon.∣E−m/n∣≤η,21​∥L(Sm​)−X[n]∥1​≤ε.

Each local basis is first relabelled by its fixed equivalence to an initial segment of natural numbers; X[n]X^{[n]}X[n] is the grouped nnn-fold tensor power with the fixed relabellings to local dimensions an,bna^n,b^nan,bn, and SmS_mSm​ is the similarly grouped mmm-fold tensor power of the projector onto (∣0,1⟩−∣1,0⟩)/2(|0,1\rangle-|1,0\rangle)/\sqrt2(∣0,1⟩−∣1,0⟩)/2​, with S0=1S_0=1S0​=1. A finite local protocol is generated recursively from identities by local Kraus operations satisfying ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I, outcome-dependent finite continuations, and summation of their outputs. The infimum allows every real EEE, without an explicit nonnegativity condition. Also, D(X)D(X)D(X) is the real supremum of all R≥0R\ge0R≥0 such that, for every ε,η>0\varepsilon,\eta>0ε,η>0, all sufficiently large positive integers nnn admit l>0l>0l>0 and such a protocol LLL satisfying

n(R−η)≤log⁡2l,∥L(X[n])−1l∑j,k=0l−1∣j,j⟩⟨k,k∣∥1≤ε.n(R-\eta)\le\log_2l,\qquad \left\|L(X^{[n]})-\frac1l\sum_{j,k=0}^{l-1}|j,j\rangle\langle k,k|\right\|_1\le\varepsilon.n(R−η)≤log2​l,​L(X[n])−l1​j,k=0∑l−1​∣j,j⟩⟨k,k∣​1​≤ε.

There exists a real δ>0\delta>0δ>0 such that every s∈[0,1]s\in[0,1]s∈[0,1] with ∣s−12∣<δ|s-\tfrac12|<\delta∣s−21​∣<δ satisfies

D(ρs)≤log⁡2∥ρsTA∥1<C(ρs)=H2(p0+p3),D(ρs)<C(ρs).D(\rho_s)\le\log_2\|\rho_s^{T_A}\|_1 <C(\rho_s)=H_2(p_0+p_3), \qquad D(\rho_s)<C(\rho_s).D(ρs​)≤log2​∥ρsTA​​∥1​<C(ρs​)=H2​(p0​+p3​),D(ρs​)<C(ρs​).

The weights pip_ipi​ need not be strictly positive, and the quantified interval for sss includes either endpoint whenever it satisfies the stated strict distance condition.

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