Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered Eq.(73): optimized Werner lower bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P42.optimized_werner_lower_bound

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.

For any two-qubit density matrix σ\sigmaσ, let FFF be its maximum overlap with a maximally entangled unit vector. The maximum is attained by a local-unitary image of Φ+\Phi^+Φ+. Let WF=F∣Ψ−⟩⟨Ψ−∣+1−F3(I−∣Ψ−⟩⟨Ψ−∣)W_F=F|\Psi^-\rangle\langle\Psi^-|+\frac{1-F}{3}(I-|\Psi^-\rangle\langle\Psi^-|)WF​=F∣Ψ−⟩⟨Ψ−∣+31−F​(I−∣Ψ−⟩⟨Ψ−∣). Then

ER(σ)≥ER(WF)={0,F≤12,Fln⁡F+(1−F)ln⁡(1−F)+ln⁡2,F>12.E_R(\sigma)\ge E_R(W_F)=\begin{cases}0,&F\le\tfrac12,\\F\ln F+(1-F)\ln(1-F)+\ln2,&F>\tfrac12.\end{cases}ER​(σ)≥ER​(WF​)={0,FlnF+(1−F)ln(1−F)+ln2,​F≤21​,F>21​.​

This is the optimized Werner lower bound for every input density matrix.

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 p.25, corrected Eq.(73): attained optimized Werner lower bound for EVERY input.
For F≤1/2 the Werner value is zero; the printed positive expression fails on I/4. -/
theorem optimized_werner_lower_bound (sigma : Matrix (Bool × Bool) (Bool × Bool) ℂ)
    (hsigma : IsDensityMatrix sigma) :
    let f := twoQubitMaxEntangledFraction sigma
    (∃ U V : Matrix.unitaryGroup Bool ℂ,
      effectProb (pureDensity (localBell U V)) sigma = f) ∧
    relativeEntanglementNats (singletWernerState f) = (wernerValue f : EReal) ∧
    relativeEntanglementNats (singletWernerState f) ≤ relativeEntanglementNats sigma := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P42

end
Source
Entanglement Measures and Purification Procedures, arXiv:quant-ph/9707035v2, PDF p. 25, Unnumbered Eq.(73): optimized Werner lower bound
Read-back

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

For every positive semidefinite trace-one matrix σ\sigmaσ on C{false,true}2\mathbb C^{\{\mathrm{false},\mathrm{true}\}^2}C{false,true}2, let ∣Φ+⟩=(∣00⟩+∣11⟩)/2|\Phi^+\rangle=(|00\rangle+|11\rangle)/\sqrt2∣Φ+⟩=(∣00⟩+∣11⟩)/2​ and define

f=sup⁡U,V∈U(2)Re⁡tr⁡ ⁣(∣(U⊗V)Φ+⟩⟨(U⊗V)Φ+∣ σ).f=\sup_{U,V\in U(2)} \operatorname{Re}\operatorname{tr}\!\left( |(U\otimes V)\Phi^+\rangle\langle(U\otimes V)\Phi^+|\,\sigma \right).f=U,V∈U(2)sup​Retr(∣(U⊗V)Φ+⟩⟨(U⊗V)Φ+∣σ).

Let ∣Ψ−⟩=(∣01⟩−∣10⟩)/2|\Psi^-\rangle=(|01\rangle-|10\rangle)/\sqrt2∣Ψ−⟩=(∣01⟩−∣10⟩)/2​ and Wf=f∣Ψ−⟩⟨Ψ−∣+1−f3(I−∣Ψ−⟩⟨Ψ−∣)W_f=f|\Psi^-\rangle\langle\Psi^-|+\frac{1-f}{3}(I-|\Psi^-\rangle\langle\Psi^-|)Wf​=f∣Ψ−⟩⟨Ψ−∣+31−f​(I−∣Ψ−⟩⟨Ψ−∣). For any matrix XXX, let E(X)E(X)E(X) be the extended-real infimum over separable density matrices YYY of D(X∥Y)D(X\|Y)D(X∥Y), where D(X∥Y)=Re⁡tr⁡[Xlog⁡X−Xlog⁡Y]D(X\|Y)=\operatorname{Re}\operatorname{tr}[X\log X-X\log Y]D(X∥Y)=Retr[XlogX−XlogY] if ker⁡Y⊆ker⁡X\ker Y\subseteq\ker XkerY⊆kerX, and +∞+\infty+∞ otherwise; separable density matrices are finite convex combinations of tensor products of positive semidefinite trace-one matrices. The assertion is that some pair of unitaries U,VU,VU,V attains the displayed supremum, and

E(Wf)={0,f≤12,flog⁡f+(1−f)log⁡(1−f)+log⁡2,f>12,E(Wf)≤E(σ).E(W_f)= \begin{cases} 0,&f\le \tfrac12,\\ f\log f+(1-f)\log(1-f)+\log2,&f>\tfrac12, \end{cases} \qquad E(W_f)\le E(\sigma).E(Wf​)={0,flogf+(1−f)log(1−f)+log2,​f≤21​,f>21​,​E(Wf​)≤E(σ).

The piecewise real value is embedded into the extended reals. Logarithms are natural, matrix logarithms use functional calculus, and the total logarithm has log⁡0=0\log0=0log0=0.

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