Unnumbered main result: WPICC parametrisation (8), (A5)-(A6)
OpenQAlgorithms.Papers.Independent.Intakethird100.P29.wpicc_normal_formAll 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; imposes both no-signaling marginal identities. Processing uses one initial box with rules and randomness fixed independently of the supplied behavior. For every operational WPICC wiring between two fixed scenarios there exist a real , an LOSR wiring , and a linear map on raw conditional arrays, with for every , such that
The same work for all inputs. This is a necessary normal form for the operational class, not a definition declaring arbitrary NS-to-local maps physically realizable. 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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P29
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.4, (8), derived in Appendix A, pp.10–11, (A5),(A6).
The weight, LOSR map, and linear NS-to-local map are uniform over the input.
There is no division by the weight, including when it equals zero. -/
theorem wpicc_normal_form {s t : BellScenario} (w : BellOperation s t)
(hw : IsWPICC w) :
∃ (weight : ℝ), 0 ≤ weight ∧ weight ≤ 1 ∧
∃ (v : BellOperation s t) (l : Behavior s →ₗ[ℝ] Behavior t),
IsLOSR v ∧ (∀ p, IsNS p → HasLocalModel (l p)) ∧
∀ p, IsNS p → w p = fun x y a b =>
weight * l p x y a b + (1 - weight) * v p x y a b := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P29
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any Bell scenarios with finite nonempty question and answer sets, and let map real source arrays to real target arrays. Call a source array nonsignaling when it is nonnegative, sums to one over answers at every question pair, and each party’s answer marginal is independent of the other party’s question. Assume that, on nonsignaling arrays, is a discrete probability mixture, over an arbitrary hidden-variable set, of the following deterministic preparations: either each source question is a function of the corresponding target question and each target answer is a function of the corresponding target question and source answer; or Alice first uses a fixed source question, and her source answer chooses a continuation in which Bob either waits to choose his source question as a function of his target question, with Alice’s target answer depending only on her target question and Bob’s on his target question and source answer, or uses a fixed source question before the target questions, with both target answers depending on Bob’s source answer and the respective target question; or the same construction with Alice and Bob interchanged. Continuation choices and their functions may depend on the first source answer, and each preparation’s output probabilities are obtained by summing the source probabilities over source answers consistent with these deterministic outputs. Then there exist a real , a map , and a real-linear map on the full real array spaces such that: , on every real source array, is a transformation formed by independently averaging product input kernels and product output kernels, namely
where both expectations use discrete probability mass functions on arbitrary sets and all kernels are nonnegative and normalized; for every nonsignaling , is a nonnegative normalized array admitting a local representation with a discrete probability mass function and normalized nonnegative responses; and, for every nonsignaling , pointwise. The values are allowed, and the last two requirements concern only nonsignaling inputs.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.