Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered: strict Bell-diagonal creation comparison and Fig.2

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.bell_diagonal_strict_comparison

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

prove2quantum

All local registers are nonzero and finite-dimensional. Density matrices are positive semidefinite with trace one. Entropies use natural logarithms, 0ln⁡0=00\ln0=00ln0=0, and Umegaki relative entropy S(σ∥ρ)S(\sigma\Vert\rho)S(σ∥ρ) is +∞+\infty+∞ on failure of support inclusion. The relative entropy of entanglement is ER(σ)=inf⁡ρ∈SepS(σ∥ρ)E_R(\sigma)=\inf_{\rho\in\mathrm{Sep}}S(\sigma\Vert\rho)ER​(σ)=infρ∈Sep​S(σ∥ρ), where separability is across the specified Alice:Bob cut.

Let pi≥0p_i\ge0pi​≥0 sum to one and let σ=∑i=14pi∣Belli⟩⟨Belli∣\sigma=\sum_{i=1}^4p_i|\mathrm{Bell}_i\rangle\langle\mathrm{Bell}_i|σ=∑i=14​pi​∣Belli​⟩⟨Belli​∣. Then

12<max⁡ipi<1⟹ER(σ)<Ec(σ).\tfrac12<\max_i p_i<1\quad\Longrightarrow\quad E_R(\sigma)<E_c(\sigma).21​<imax​pi​<1⟹ER​(σ)<Ec​(σ).

When every pi≤1/2p_i\le1/2pi​≤1/2, both functionals vanish; when some pi=1p_i=1pi​=1, both equal ln⁡2\ln2ln2. This retains exactly the equality exceptions in the p.33 strict static comparison.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P42
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate ComplexOrder ENNReal Topology

namespace QAlgorithms.Papers.Independent.Intakenext100.P42

open QAlgorithms QAlgorithms.Entanglement

open QAlgorithms.Papers.Independent.Dependency50.P21 (relativeEntropy)

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

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

open QAlgorithms.Papers.Independent.Bridge50.P49 (groupedProduct)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF pp.16,33 and Fig.2 pp.42,44: strict creation comparison for mixed entangled
Bell-diagonal states; equality on the separable regime and pure Bell endpoints. -/
theorem bell_diagonal_strict_comparison (p : Fin 4 → ℝ)
    (hp : ∀ i, 0 ≤ p i) (htotal : ∑ i, p i = 1) :
    ((∃ i, 1/2 < p i ∧ p i < 1) →
      relativeEntanglementNats (bellDiagonal p) < formationNats (bellDiagonal p)) ∧
    ((∀ i, p i ≤ 1/2) →
      relativeEntanglementNats (bellDiagonal p) = 0 ∧ formationNats (bellDiagonal p) = 0) ∧
    ((∃ i, p i = 1) →
      relativeEntanglementNats (bellDiagonal p) = (Real.log 2 : EReal) ∧
      formationNats (bellDiagonal p) = (Real.log 2 : EReal)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 33, Unnumbered: strict Bell-diagonal creation comparison and Fig.2
Read-back

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

For every four nonnegative real numbers p0,p1,p2,p3p_0,p_1,p_2,p_3p0​,p1​,p2​,p3​ with ∑i=03pi=1\sum_{i=0}^3p_i=1∑i=03​pi​=1, let σp=∑i=03pi∣βi⟩⟨βi∣\sigma_p=\sum_{i=0}^3p_i|\beta_i\rangle\langle\beta_i|σp​=∑i=03​pi​∣βi​⟩⟨βi​∣, where (∣β0⟩,∣β1⟩,∣β2⟩,∣β3⟩)=((∣00⟩+∣11⟩)/2,(∣00⟩−∣11⟩)/2,(∣01⟩+∣10⟩)/2,(∣01⟩−∣10⟩)/2)(|\beta_0\rangle,|\beta_1\rangle,|\beta_2\rangle,|\beta_3\rangle)=((|00\rangle+|11\rangle)/\sqrt2,(|00\rangle-|11\rangle)/\sqrt2,(|01\rangle+|10\rangle)/\sqrt2,(|01\rangle-|10\rangle)/\sqrt2)(∣β0​⟩,∣β1​⟩,∣β2​⟩,∣β3​⟩)=((∣00⟩+∣11⟩)/2​,(∣00⟩−∣11⟩)/2​,(∣01⟩+∣10⟩)/2​,(∣01⟩−∣10⟩)/2​). Define E(X)E(X)E(X) as the extended-real infimum over separable density matrices YYY of Re⁡tr⁡[Xlog⁡X−Xlog⁡Y]\operatorname{Re}\operatorname{tr}[X\log X-X\log Y]Retr[XlogX−XlogY] when ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, assigning +∞+\infty+∞ otherwise; separable density matrices are finite convex combinations of products of positive semidefinite trace-one matrices. Define F(X)F(X)F(X) as the extended-real infimum of ∑jwjS(tr⁡left∣ψj⟩⟨ψj∣)\sum_jw_j S(\operatorname{tr}_{\mathrm{left}}|\psi_j\rangle\langle\psi_j|)∑j​wj​S(trleft​∣ψj​⟩⟨ψj​∣) over all finite decompositions X=∑jwj∣ψj⟩⟨ψj∣X=\sum_jw_j|\psi_j\rangle\langle\psi_j|X=∑j​wj​∣ψj​⟩⟨ψj​∣ with wj≥0w_j\ge0wj​≥0, ∑jwj=1\sum_jw_j=1∑j​wj​=1, and ∥ψj∥=1\|\psi_j\|=1∥ψj​∥=1, where S(Z)=−Re⁡tr⁡[Zlog⁡Z]S(Z)=-\operatorname{Re}\operatorname{tr}[Z\log Z]S(Z)=−Retr[ZlogZ]. All logarithms are natural and use log⁡0=0\log0=0log0=0 in functional calculus. The assertion consists of three implications: if some pip_ipi​ satisfies 12<pi<1\tfrac12<p_i<121​<pi​<1, then E(σp)<F(σp)E(\sigma_p)<F(\sigma_p)E(σp​)<F(σp​); if every pi≤12p_i\le\tfrac12pi​≤21​, then E(σp)=F(σp)=0E(\sigma_p)=F(\sigma_p)=0E(σp​)=F(σp​)=0; and if some pi=1p_i=1pi​=1, then E(σp)=F(σp)=log⁡2E(\sigma_p)=F(\sigma_p)=\log2E(σp​)=F(σp​)=log2, with these real constants embedded into the extended reals.

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