Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Corollary 4 (19): WPICC is not contained in GW

Open
QAlgorithms.Papers.Independent.Intakethird100.P29.wpicc_not_contained_in_global

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. There exist initial and final scenarios and a WPICC wiring WWW for which no global wiring GGG has the same action on every no-signaling input:

∃W∈WPICC∀G∈GW∃P∈NS:W(P)≠G(P).\exists W\in\mathrm{WPICC}\quad\forall G\in\mathrm{GW}\quad\exists P\in\mathrm{NS}: W(P)\ne G(P).∃W∈WPICC∀G∈GW∃P∈NS:W(P)=G(P).

This is non-inclusion of classes of operations on their common domain, rather than a distinction between declared domain types. 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, Corollary 4, (19). Nonmembership means that no global wiring
agrees on every NS input, independently of raw extensions outside that domain. -/
theorem wpicc_not_contained_in_global :
    ∃ (s t : BellScenario) (w : BellOperation s t), IsWPICC w ∧ ¬ HasGWRestriction w := 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, Corollary 4 (19)
Read-back

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

There exist scenarios s,ts,ts,t and an operation www between their real behavior arrays with the following two properties. First, on all nonsignaling source correlations, www is a probability mixture, with a probability mass function on an arbitrary type, of deterministic preparations: either choose each source input from its own target input and each final output from its own target input and source outcome; or fix Alice’s input first and, for each Alice 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 use the symmetric Bob-first construction. In these cases each final output can depend on its own target input and the stated available outcomes, and the resulting array sums the selected source entries with indicators enforcing those outputs. Second, there are no nonnegative normalized kernels I(x,y∣χ,ψ)I(x,y\mid\chi,\psi)I(x,y∣χ,ψ) and O(α,β∣a,b,x,y,χ,ψ)O(\alpha,\beta\mid a,b,x,y,\chi,\psi)O(α,β∣a,b,x,y,χ,ψ) such that, for every nonsignaling correlation ppp,

w(p)χψαβ=∑a,b,x,yO(α,β∣a,b,x,y,χ,ψ) pxyab I(x,y∣χ,ψ).w(p)_{\chi\psi}^{\alpha\beta} =\sum_{a,b,x,y}O(\alpha,\beta\mid a,b,x,y,\chi,\psi)\, p_{xy}^{ab}\,I(x,y\mid\chi,\psi).w(p)χψαβ​=a,b,x,y∑​O(α,β∣a,b,x,y,χ,ψ)pxyab​I(x,y∣χ,ψ).

Here all four sizes of each scenario are positive integers, and a nonsignaling correlation is a nonnegative array normalized over outputs at each input pair, with Bob’s marginal independent of Alice’s input and Alice’s marginal independent of Bob’s input. The claim concerns agreement on this set; it does not require any particular behavior of www elsewhere.

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