Alphabeta Math
Thought experimentStatement: 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.

Finite samples of a declared arrangement: the CHSH estimator, its concentration and the limits of a finite-sample verdict

Physical scope

A conditional finite-sampling analysis for a declared spin correlation arrangement: under a declared independent and identically distributed sampling model with n runs per setting pair, the sample CHSH functional is unbiased, has variance at most 4/n and satisfies the stated Chebyshev concentration inequality; threshold events on either side of 2 have explicitly bounded model probabilities, and every acceptance criterion that rejects a positive-probability outcome sequence fails with positive probability. The item asserts no measured count, no p-value, no power, no error rate, no sample size and no empirical conclusion; the independence and identical distribution of trials is the declared statistical assumption of clause (ii) of P7, not a consequence of the framework.

Statement

Adopt a declared spin correlation arrangement (V⊗^V,ρ,a0,a1,b0,b1) of Declared spin correlation arrangement of the framework: two spin-half factors, four directions, joint sign tables and local-response models with its outcome laws νijρ(ε,δ), correlations Eij=Eij(νρ) and CHSH functional S=S(νρ). Let n≥1 and declare the following sampling model (the statistical model of clause (ii) of the preparation and apparatus postulate P7, Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions): on a probability space (Ω,F,P) let (Σijk,Tijk)i,j∈{0,1}k∈{1,…,n} be 4n random elements with values in Σ×Σ that are mutually independent and have the declared laws P((Σijk,Tijk)=(ε,δ))=νijρ(ε,δ)for every i,j,k,ε,δ (Pairwise and mutual independence of finite-valued random variables, Random elements and real random variables). Define the sample correlations and the sample CHSH functional E^ij:=1n∑k=1nΣijkTijk,S^:=E^00+E^01+E^10−E^11. Then:

(a) E[E^ij]=Eij and Var⁡(E^ij)≤1/n for all (i,j);

(b) E[S^]=S, Var⁡(S^)≤4/n, and for every ε>0 P(∣S^−S∣≥ε)≤4nε2;

(c) threshold consequences: if the declared model satisfies S≤2−ε for some ε>0, then P(S^>2)≤4/(nε2); if the declared model is the singlet arrangement with S=−22 and ε:=22−2, then P(S^≥−2)≤4/(nε2). Moreover, for every declared acceptance criterion C⊆(Σ×Σ)4n that rejects at least one outcome sequence (xijk) with ∏i,j,kνijρ(xijk)>0, the failure probability of the criterion is at least ∏i,j,kνijρ(xijk)>0;

(d) scope: the independence, the identical distribution and the tables νρ are declared model assumptions of the sampling model, not consequences of P1-P6; clauses (a)-(c) assert no measured count, no p-value, no error rate, no power, no required sample size and no empirical conclusion.

Facts & Assumptions

Given: A declared arrangement with tables νijρ, correlations Eij and CHSH functional S; the 4n mutually independent random elements (Σijk,Tijk) with the declared laws; the sample correlations E^ij and the sample functional S^; a declared criterion C.

[F1]

The outcome laws, correlations and CHSH functional are the ones of clause (d) of Declared spin correlation arrangement of the framework: two spin-half factors, four directions, joint sign tables and local-response models and clauses (b), (d) of Binary correlation models: setting-indexed tables of two-valued outcome laws, marginals and the CHSH functional; the sampling model of the statement is an additional declared assumption in the sense of clause (ii) of Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions and is not implied by the framework's postulates.

[F2]

A finite family of finite-valued random elements is mutually independent when the probability of every joint event factors as the product over the index set (Pairwise and mutual independence of finite-valued random variables); in particular every sequence of values with all one-run probabilities positive has probability equal to the product of those probabilities, which is positive (The CHSH bound and the finite-sampling law for independent trials clause (b)).

[F3]

Expectation is linear, and for a finite family of integrable real random variables the expectation of the finite sum is the sum of the expectations (Linearity, monotonicity, and the modulus bound for expectation, Expectation of a nonnegative or integrable random variable, Finite sums and finite products, by recursion).

[F4]

Variance is defined by Var⁡(X)=E[(X−E[X])2]=E[X2]−E[X]2 for a square-integrable real random variable, and Var⁡(cX)=c2Var⁡(X) (Moments, variance, and covariance on a probability space); the variances of a finite pairwise-independent family add, Var⁡(∑lXl)=∑lVar⁡(Xl) (Variance adds for every finite pairwise-independent family).

[F5]

For a square-integrable real random variable and a>0, P(∣X−E[X]∣≥a)≤Var⁡(X)/a2 (Chebyshev's inequality for random variables).

Proof

technique · direct; identify each sample correlation as a mean of independent bounded products, compute its mean and variance, add the four variances of the independent setting groups, apply Chebyshev, and read the positive-probability statement off the product law

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

1.1givenF1F3F4algebra

[Mean and variance of one sample correlation] Fix (i,j) and put Xk:=ΣijkTijk for k=1,…,n. Each Xk takes values in {−1,+1}, so E[Xk]=∑ε,δεδνijρ(ε,δ)=Eij by [F1] and [F3], and Xk2=1 identically, so Var⁡(Xk)=E[Xk2]−E[Xk]2=1−Eij2≤1 by [F4]; the Xk are mutually independent because the corresponding pairs are, and E^ij=1n∑kXk. Hence E[E^ij]=1n∑kE[Xk]=Eij by [F3], and Var⁡(E^ij)=1n2Var⁡(∑kXk)=1n2∑kVar⁡(Xk)≤nn2=1n by [F4]; this is (a).

1.2givenF1F2algebra

[Positive failure probability] Let (xijk) be a sequence of outcomes with p:=∏i,j,kνijρ(xijk)>0. By mutual independence [F2] the event that the sample equals this sequence has probability exactly p>0; if the criterion C rejects this sequence, that is (xijk)∉C, then the singleton event {(Σijk,Tijk)=(xijk)} is contained in the failure event {(Σijk,Tijk)∉C}, so the failure probability is at least p>0.

2.1step 1.1F1F3F4F5algebra

[CHSH estimator moments and concentration] The four families {Xk}k for the four setting pairs involve disjoint groups of the 4n mutually independent random elements, so the four estimators E^ij are mutually independent; by [F3] and [F4], E[S^]=E00+E01+E10−E11=S and Var⁡(S^)=∑i,jVar⁡(E^ij)≤4⋅1n=4n by step 1.1. Chebyshev [F5] applied to S^ gives P(∣S^−S∣≥ε)≤Var⁡(S^)/ε2≤4/(nε2) for every ε>0; this is (b).

3.1step 2.1F1algebra

[Threshold events] If S≤2−ε then {S^>2}⊆{∣S^−S∣≥ε}, so its probability is at most 4/(nε2) by step 2.1. For the singlet arrangement S=−22, so − ⁣S=22 and {S^≥−2}⊆{∣S^−S∣≥22−2}, giving the second bound.

4.1step 1.1step 1.2step 2.1step 3.1F1∎

[Assembly and scope] Steps 1.1 and 2.1 prove (a) and (b), step 1.2 and step 3.1 prove the two parts of (c), and (d) records that the sampling model is the declared assumption of P7 clause (ii) and that no measured count, p-value, error rate, power, sample size or empirical conclusion is asserted.

Remarks

  • Finite-sample threshold crossings. At the displayed singlet settings, each of the four possible outcome pairs has strictly positive probability. A sequence with product signs +1 at the first three setting pairs and −1 at the last therefore has positive probability and gives S^=4≥−2. For a representable model with S<2, a crossing S^>2 has positive probability only when its declared tables support at least one such sequence, as specified by clause (c); a deterministic table need not support one. The displayed Chebyshev upper bounds remain valid independently of that support condition. More generally, if two specified finite-sample models both assign positive probability to the same record, that record is possible under both and cannot deductively exclude either; a record assigned probability zero by one specified ideal model can exclude that model conditional on its sampling and apparatus assumptions. Thus this item makes no blanket claim that finite samples cannot distinguish all model pairs. No optimality, power or sample-size assertion is made.
  • No inference is drawn. The clauses are probabilities inside the declared sampling model. They do not compute a p-value, do not attach a confidence level and do not assert anything about a real experiment; the preparation, detection and selection qualifications remain as stated in Measurement-model boundaries of the singlet-local comparison: what the no-go excludes and what it does not.

Depends on

Dependency tree · 2 levels

Sources