Lemma 6: LOSR monotones are WPICC monotones
OpenQAlgorithms.Papers.Independent.Intakethird100.P29.losr_monotones_are_wpicc_monotonesAll 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. 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 , LOSR monotonicity implies WPICC monotonicity:
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.
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.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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be any function on scenarios and real behavior arrays. Assume it is finite on every nonsignaling correlation, zero on every local correlation, and satisfies for every nonsignaling whenever , on all real arrays, has the form
with probability-vector kernels and separate probability mass functions on arbitrary types. Then also satisfies the same inequality whenever 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 with probability-vector responses. The second class requires agreement only on nonsignaling correlations.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.