Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Local-response representability implies setting-independent marginals

Statement

Let μ be a binary correlation model on finite setting sets I,J with outcome labels Σ={−1,+1} (Binary correlation models: setting-indexed tables of two-valued outcome laws, marginals and the CHSH functional), and suppose that μ admits a local-response representation with response laws (αi), (βj) and probability space (Λ,ΣΛ,P) (Local-response representations of a binary correlation model: one setting-independent specification space and per-station response laws). Then:

(a) for every i∈I the marginal law of the first station satisfies μijA=μij′Afor all j,j′∈J, and for every j∈J the marginal law of the second station satisfies μijB=μi′jB for all i,i′∈I; that is, μ is no-signalling;

(b) consequently, if a binary correlation model is not no-signalling, then it admits no local-response representation.

No physical assumption and no choice principle is used; the proposition is a statement about the tables and their representation.

Facts & Assumptions

Given: A binary correlation model μ; a local-response representation (αi)i∈I, (βj)j∈J on (Λ,ΣΛ,P); setting labels i∈I, j,j′∈J; outcome labels ε,δ∈Σ.

[F1]

The joint laws and marginals are the finite sums μijA(ε)=∑δ∈Σμij(ε,δ) and μijB(δ)=∑ε∈Σμij(ε,δ), and no-signalling means exactly the pair of setting-independence identities of clause (c) of Binary correlation models: setting-indexed tables of two-valued outcome laws, marginals and the CHSH functional; under the representation hypothesis the joint law is also given by the representation identity μij(ε,δ)=EP[αi(⋅,ε)βj(⋅,δ)] of clause (a) of Local-response representations of a binary correlation model: one setting-independent specification space and per-station response laws.

[F2]

Both response laws are normalized on the two-point set Σ: ∑ε∈Σαi(λ,ε)=1 for every λ∈Λ and i∈I, and ∑δ∈Σβj(λ,δ)=1 for every λ∈Λ and j∈J (Local-response representations of a binary correlation model: one setting-independent specification space and per-station response laws clause (a)).

[F3]

Expectation is linear: E[aX+bY]=aE[X]+bE[Y] for integrable real random variables X,Y and scalars a,b (Linearity, monotonicity, and the modulus bound for expectation, Expectation of a nonnegative or integrable random variable); by induction the identity extends to finite sums ∑δ∈Σ over the two-element set Σ (Finite sums and finite products, by recursion).

Proof

technique · direct; sum the representation identity over the distant outcome label, use the normalization of the distant response law and the linearity of expectation, and read off the setting-independence

Given: The data of the statement and [F1]-[F3].

1.1givenF1F2F3algebra

[Marginal of the first station] Fix i∈I, j∈J and ε∈Σ. By [F1] and the definition of the marginal, μijA(ε)=∑δ∈Σμij(ε,δ)=∑δ∈ΣEP[αi(⋅,ε)βj(⋅,δ)]=EP[∑δ∈Σαi(⋅,ε)βj(⋅,δ)]=EP[αi(⋅,ε)∑δ∈Σβj(⋅,δ)]=EP[αi(⋅,ε)], where the second equality is the representation identity, the third is the finite linearity of [F3], and the last is the normalization of [F2]. The resulting expression involves i and ε only, so μijA(ε)=μij′A(ε) for every j′∈J; as (ε,i,j) were arbitrary this is the first-station half of (a).

1.2givenF1F2F3algebra

[Marginal of the second station] The same computation with the roles of the two stations exchanged, summing this time over ε∈Σ and using the normalization ∑εαi(λ,ε)=1 of [F2], gives μijB(δ)=∑εμij(ε,δ)=EP[βj(⋅,δ)] for every δ∈Σ, an expression free of i; hence μijB=μi′jB for all i,i′∈I, the second-station half of (a).

2.1step 1.1step 1.2F1∎

[Assembly and contrapositive] Steps 1.1 and 1.2 give the two setting-independence identities, which by [F1] is exactly no-signalling of μ; this is (a). For (b), if a model admits a local-response representation then (a) makes it no-signalling, so a model that is not no-signalling admits none.

Remarks

  • Direction of the implication. Representability is a strictly stronger requirement than no-signalling: this proposition gives only the implication from representability to no-signalling. The converse fails, and the framework's singlet arrangement is an explicit failing case once its four tables violate the CHSH bound of the next item.
  • Reading. The two identities are the statement that each station's outcome law is unaffected by the distant setting in the model. This is a property of the declared tables; it is not a statement about any laboratory procedure and it assumes no spatial or temporal structure.

Depends on

Dependency tree · 2 levels

Sources