Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Exact projective steering threshold of Werner states

Open
QAlgorithms.Papers.Independent.Intakethird100.P62.werner_threshold

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

prove2quantum

Let d≥2d\ge2d≥2 be an integer and let η∈R\eta\in\mathbb Rη∈R make the following operator a density matrix on Cd⊗Cd\mathbb C^d\otimes\mathbb C^dCd⊗Cd:

Wdη=d−1+ηd−1Id2−ηd−1Fd,F(u⊗v)=v⊗u.W_d^\eta=\frac{d-1+\eta}{d-1}\frac{I}{d^2}-\frac{\eta}{d-1}\frac{F}{d}, \qquad F(u\otimes v)=v\otimes u.Wdη​=d−1d−1+η​d2I​−d−1η​dF​,F(u⊗v)=v⊗u.

The physical parameter interval is −(d−1)/(d+1)≤η≤1-(d-1)/(d+1)\le\eta\le1−(d−1)/(d+1)≤η≤1. With all local projective measurements allowed, and arbitrary mixed or pure hidden quantum states in a common continuous LHS ensemble,

Wdη is steerable from Alice to Bob⟺η>1−1d.W_d^\eta\text{ is steerable from Alice to Bob} \quad\Longleftrightarrow\quad \eta>1-\frac1d.Wdη​ is steerable from Alice to Bob⟺η>1−d1​.

Equality is nonsteerable. This identifies the exact projective steering boundary, including the physical negative-parameter range.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P62
Formal statement
noncomputable section

open MeasureTheory

open scoped BigOperators Matrix.Norms.Elementwise

open QAlgorithms.Papers.Independent.Information100.P60 (Mat)

namespace QAlgorithms.Papers.Independent.Intakethird100.P62

attribute [local instance] Classical.propDecidable Classical.decEq

attribute [local instance] QAlgorithms.Papers.Independent.Intakethird100.P62.matrixContinuousENorm

attribute [local instance] QAlgorithms.Papers.Independent.Intakethird100.P62.matrixMeasurable

/-- arXiv:quant-ph/0612147v3, PDF p.3, (8)--(11) and the definition of
eta_steer above (9). The iff uses all projective observables; equality is
nonsteerable. The defective auxiliary single-outcome (10) is not assumed. -/
theorem werner_threshold (d : ℕ) (hd : 2 ≤ d) (eta : ℝ)
    (hphysical : IsDensityMatrix (wernerEta d eta)) :
    Steerable (wernerEta d eta) ↔ 1 - 1 / (d : ℝ) < eta := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P62

end
Source
Steering, Entanglement, Nonlocality, and the EPR Paradox, arXiv:quant-ph/0612147v3, PDF p. 3, (i) Werner States: exact projective steering threshold
Read-back

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

For every natural number d≥2d\ge2d≥2 and every real η\etaη, set p=(d−1+(d+1)η)/(2d)p=(d-1+(d+1)\eta)/(2d)p=(d−1+(d+1)η)/(2d), let F(u⊗v)=v⊗uF(u\otimes v)=v\otimes uF(u⊗v)=v⊗u, put P+=(I+F)/2P_+=(I+F)/2P+​=(I+F)/2 and P−=I−P+P_-=I-P_+P−​=I−P+​, and define

Wd,η=2(1−p)d(d+1)P++2pd(d−1)P−.W_{d,\eta}=\frac{2(1-p)}{d(d+1)}P_+ +\frac{2p}{d(d-1)}P_-.Wd,η​=d(d+1)2(1−p)​P+​+d(d−1)2p​P−​.

Assume that Wd,ηW_{d,\eta}Wd,η​ is positive semidefinite and has trace 111. Then Wd,ηW_{d,\eta}Wd,η​ is steerable if and only if 1−1/d<η1-1/d<\eta1−1/d<η. Here steerability means that there do not exist a measurable space Ω\OmegaΩ, a probability measure μ\muμ, a measurable and μ\muμ-integrable family of density matrices σω\sigma_\omegaσω​ on Cd\mathbb C^dCd, and response functions rA,x(ω)r_{A,x}(\omega)rA,x​(ω) for every projective measurement A=(Ax)x=0d−1A=(A_x)_{x=0}^{d-1}A=(Ax​)x=0d−1​, such that each response is measurable and nonnegative, ∑xrA,x(ω)=1\sum_xr_{A,x}(\omega)=1∑x​rA,x​(ω)=1 for every A,ωA,\omegaA,ω, every rA,xσr_{A,x}\sigmarA,x​σ is integrable, and

Tr⁡1 ⁣(Wd,η(Ax⊗Id))=∫ΩrA,x(ω)σω dμ(ω).\operatorname{Tr}_1\!\bigl(W_{d,\eta}(A_x\otimes I_d)\bigr) =\int_\Omega r_{A,x}(\omega)\sigma_\omega\,d\mu(\omega).Tr1​(Wd,η​(Ax​⊗Id​))=∫Ω​rA,x​(ω)σω​dμ(ω).

These projective measurements consist of ddd pairwise orthogonal Hermitian idempotents summing to IdI_dId​, with zero projectors allowed, and (Tr⁡1Z)u,v=∑iZ(i,u),(i,v)(\operatorname{Tr}_1 Z)_{u,v}=\sum_iZ_{(i,u),(i,v)}(Tr1​Z)u,v​=∑i​Z(i,u),(i,v)​. No separate range restriction on η\etaη is assumed beyond the density-matrix hypothesis; the strict inequality excludes equality at the stated threshold.

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