Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 6: LOSR monotones are WPICC monotones

Open
QAlgorithms.Papers.Independent.Intakethird100.P29.losr_monotones_are_wpicc_monotones

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

prove2quantum

All Bell scenarios have independent finite, nonempty Alice and Bob input and output alphabets. A behavior is a nonnegative conditional output law normalized at every input pair; NS\mathrm{NS}NS imposes both no-signaling marginal identities. Processing uses one initial box with rules and randomness fixed independently of the supplied behavior. A Bell nonlocality monotone is a family of finite, nonnegative values on no-signaling behaviors in all scenarios. It vanishes on every local behavior and does not increase under LOSR or WPICC operations, including operations changing alphabet sizes. For every such nonnegative real-valued family fff, LOSR monotonicity implies WPICC monotonicity:

f is an LOSR monotone ⟹ f is a WPICC monotone.f\text{ is an LOSR monotone}\ \Longrightarrow\ f\text{ is a WPICC monotone}.f is an LOSR monotone ⟹ f is a WPICC monotone.

There is no convexity or continuity assumption. This identifies the two choices of free-operation class for nonlocality monotones. WPICC uses Appendix A’s fixed no-preparation LOSR branch and random adaptive preparation branches in which at least one party measures before the final inputs.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P29
Formal statement
noncomputable section

open scoped BigOperators ENNReal

namespace QAlgorithms.Papers.Independent.Intakethird100.P29

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Advance50.P47
  (Box IsCorrelation IsNoSignaling HasLocalModel TwoLocalBoxes losrTransform
   correlationMixture)

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

open QAlgorithms.Papers.Independent.Dependency50.P47 (Law)

/-- PDF p.6, Lemma 6. No convexity, continuity, or positivity-on-nonlocal-boxes
premise is imposed on the nonnegative real-valued family. -/
theorem losr_monotones_are_wpicc_monotones (f : Quantity)
    (hf : IsLOSRMonotone f) : IsWPICCMonotone f := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P29

end
Source
Nonlocality free wirings and the distinguishability between Bell boxes, arXiv:1611.06932v2, PDF p. 6, Lemma 6
Read-back

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

Let f(s,p)∈[0,∞]f(s,p)\in[0,\infty]f(s,p)∈[0,∞] be any function on scenarios and real behavior arrays. Assume it is finite on every nonsignaling correlation, zero on every local correlation, and satisfies f(t,w(p))≤f(s,p)f(t,w(p))\le f(s,p)f(t,w(p))≤f(s,p) for every nonsignaling ppp whenever www, on all real arrays, has the form

w(r)χψαβ=∑a,b,x,y(∑λμ(λ)OλA(α∣a,x,χ)OλB(β∣b,y,ψ))rxyab(∑ην(η)IηA(x∣χ)IηB(y∣ψ)),w(r)_{\chi\psi}^{\alpha\beta} =\sum_{a,b,x,y} \left(\sum_\lambda\mu(\lambda)O^A_\lambda(\alpha\mid a,x,\chi)O^B_\lambda(\beta\mid b,y,\psi)\right) r_{xy}^{ab} \left(\sum_\eta\nu(\eta)I^A_\eta(x\mid\chi)I^B_\eta(y\mid\psi)\right),w(r)χψαβ​=a,b,x,y∑​(λ∑​μ(λ)OλA​(α∣a,x,χ)OλB​(β∣b,y,ψ))rxyab​(η∑​ν(η)IηA​(x∣χ)IηB​(y∣ψ)),

with probability-vector kernels and separate probability mass functions μ,ν\mu,\nuμ,ν on arbitrary types. Then fff also satisfies the same inequality whenever www agrees on all nonsignaling correlations with a probability mixture of deterministic transformations that either separately choose source inputs from target inputs and locally process the outputs, or first fix Alice’s input and, depending on her outcome, either choose Bob’s input from his target input while Alice’s output ignores Bob’s outcome, or fix Bob’s input and permit both outputs to depend on Bob’s outcome, or do the symmetric Bob-first construction. Each final output depends on its own target input and the stated available outcomes, and deterministic probabilities are sums of source entries with output indicators. The conclusion also includes the same finiteness and zero-value requirements. Scenarios have positive integer sizes; nonsignaling correlations are nonnegative normalized arrays with each marginal independent of the other party’s input; local correlations additionally have pxyab=∑λμ(λ)Aλ(a∣x)Bλ(b∣y)p_{xy}^{ab}=\sum_\lambda\mu(\lambda)A_\lambda(a\mid x)B_\lambda(b\mid y)pxyab​=∑λ​μ(λ)Aλ​(a∣x)Bλ​(b∣y) with probability-vector responses. The second class requires agreement only on nonsignaling correlations.

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