Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Entropic steering inequality for two observed marginals

Open
QAlgorithms.Papers.Independent.Intakethird100.P94.entropicSteering_S5

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

prove2quantum

Let P(a,s,b∣i,j)P(a,s,b\mid i,j)P(a,s,b∣i,j) have a normalized local-hidden-state model with the same hidden ensemble at every pair of settings i,j∈{1,2}i,j\in\{1,2\}i,j∈{1,2}. Alice's binary output aaa includes a public binary detection flag sss, and the no-click output is predetermined. Bob's response is the Born probability of a binary rank-one projective measurement on the normalized hidden qubit state. Define A~i=(Ai,si)\widetilde A_i=(A_i,s_i)Ai​=(Ai​,si​) and q=−log⁡2max⁡a,b∣⟨u1a,u2b⟩∣2q=-\log_2\max_{a,b}|\langle u_{1a},u_{2b}\rangle|^2q=−log2​maxa,b​∣⟨u1a​,u2b​⟩∣2 from Bob's two orthonormal measurement bases. Then, in bits,

H(B1∣A~1)+H(B2∣A~2)≥q.H(B_1\mid\widetilde A_1)+H(B_2\mid\widetilde A_2)\ge q.H(B1​∣A1​)+H(B2​∣A2​)≥q.

Each entropy is evaluated on its own observed same-setting marginal. Conditioning events with zero probability contribute zero. No joint distribution for incompatible Bob outcomes is required. The inequality provides a direct entropic criterion for steering.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P94
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P94

open MeasureTheory

open scoped ComplexConjugate

/-- arXiv:1109.1435v3, PDF p.6, (S5): every common normalized local-hidden-state
ensemble obeys the entropic steering inequality. Neither (S3) nor (S4) is assumed. -/
theorem entropicSteering_S5 {Lambda : Type*} [MeasurableSpace Lambda]
    (U : BobBases) (L : HiddenModel Lambda U) :
    projectiveOverlapIncompatibility U ≤ flaggedConditionalEntropy L false + flaggedConditionalEntropy L true := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P94

end
Source
One-sided Device-Independent Quantum Key Distribution: Security, feasibility, and the connection with steering, arXiv:1109.1435v3, PDF p. 6, Eq. (S5)
Read-back

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

Let B={0,1}\mathbb B=\{0,1\}B={0,1}, representing false and true. For every measurable space Λ\LambdaΛ, every pair of unitary complex matrices U0,U1U_0,U_1U0​,U1​ indexed by B\mathbb BB, and every model LLL, suppose LLL supplies a probability measure μ\muμ, positive semidefinite trace-one matrices ρλ\rho_\lambdaρλ​ with measurable entries, and nonnegative measurable responses ri(λ,a,s)r_i(\lambda,a,s)ri​(λ,a,s) satisfying ∑a,sri(λ,a,s)=1\sum_{a,s}r_i(\lambda,a,s)=1∑a,s​ri​(λ,a,s)=1 for every i,λi,\lambdai,λ. The model also supplies bits cic_ici​ satisfying ri(λ,a,0)=0r_i(\lambda,a,0)=0ri​(λ,a,0)=0 for a≠cia\ne c_ia=ci​. Define Ej,b(x,y)=Uj(x,b)Uj(y,b)‾E_{j,b}(x,y)=U_j(x,b)\overline{U_j(y,b)}Ej,b​(x,y)=Uj​(x,b)Uj​(y,b)​ and qj,b(λ)=Re⁡tr⁡(Ej,bρλ)q_{j,b}(\lambda)=\operatorname{Re}\operatorname{tr}(E_{j,b}\rho_\lambda)qj,b​(λ)=Retr(Ej,b​ρλ​); every product ri(λ,a,s)qj,b(λ)r_i(\lambda,a,s)q_{j,b}(\lambda)ri​(λ,a,s)qj,b​(λ) must be integrable. Put pi(a,s,b)=∫Λri(λ,a,s)qi,b(λ) dμ(λ)p_i(a,s,b)=\int_\Lambda r_i(\lambda,a,s)q_{i,b}(\lambda)\,d\mu(\lambda)pi​(a,s,b)=∫Λ​ri​(λ,a,s)qi,b​(λ)dμ(λ), mi(a,s)=∑bpi(a,s,b)m_i(a,s)=\sum_b p_i(a,s,b)mi​(a,s)=∑b​pi​(a,s,b), and

Hi=∑a,s∈B{0,mi(a,s)=0,mi(a,s) h2 ⁣(pi(a,s,1)mi(a,s)),mi(a,s)≠0,C=max⁡a,b∈B∣∑x∈BU0(x,a)‾U1(x,b)∣2,H_i=\sum_{a,s\in\mathbb B} \begin{cases} 0,&m_i(a,s)=0,\\ m_i(a,s)\,h_2\!\left(\dfrac{p_i(a,s,1)}{m_i(a,s)}\right),&m_i(a,s)\ne0, \end{cases} \qquad C=\max_{a,b\in\mathbb B}\left|\sum_{x\in\mathbb B}\overline{U_0(x,a)}U_1(x,b)\right|^2,Hi​=a,s∈B∑​⎩⎨⎧​0,mi​(a,s)h2​(mi​(a,s)pi​(a,s,1)​),​mi​(a,s)=0,mi​(a,s)=0,​C=a,b∈Bmax​​x∈B∑​U0​(x,a)​U1​(x,b)​2,

where h2(p)=−[pln⁡p+(1−p)ln⁡(1−p)]/ln⁡2h_2(p)=-[p\ln p+(1-p)\ln(1-p)]/\ln2h2​(p)=−[plnp+(1−p)ln(1−p)]/ln2, with 0ln⁡0=00\ln0=00ln0=0. Then −log⁡2C≤H0+H1-\log_2 C\le H_0+H_1−log2​C≤H0​+H1​. Zero-mass pairs contribute zero, and no condition of positive detection probability or equal detection probabilities is imposed.

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