Alphabeta Math
Physics theoremStatement: 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.

Tsirelson bound for every declared spin correlation arrangement of the framework

Physical scope

A conditional bound on the CHSH functional of every declared spin correlation arrangement of the framework: for any declared composite preparation of the two spin-half factors and any two unit directions per station the absolute value of the CHSH functional of the arrangement's sign tables is at most 2 sqrt 2, and the bound is attained by the singlet preparation at the directions displayed on this page. The statement is a model theorem under the framework's composite, observable, measurement and spin readings; it asserts no measured value, no apparatus, no detection efficiency and no empirical fact.

Statement

Let (V⊗^V,ρ,a0,a1,b0,b1) be a declared spin correlation arrangement of the two declared spin-half factors in the sense of Declared spin correlation arrangement of the framework: two spin-half factors, four directions, joint sign tables and local-response models, with a preparation ρ∈D(V⊗^V), unit directions ai,bj∈R3, outcome laws νijρ(ε,δ) and CHSH functional S(νρ) as in clauses (d) of that definition and (d) of Binary correlation models: setting-indexed tables of two-valued outcome laws, marginals and the CHSH functional. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)) and the Axiom of Choice (The Axiom of Choice), the hypotheses of the cited mathematical suppliers. Then:

(a) ∣S(νρ)∣≤22 for every preparation ρ and all unit directions a0,a1,b0,b1;

(b) the bound is attained: with Ψ:=12(κ(e+⊗e−)−κ(e−⊗e+)) and the singlet preparation ρΨ=TΨ,Ψ, for the directions a0=(0,0,1), a1=(1,0,0), b0=(1,0,1)/2, b1=(−1,0,1)/2 one has S(νρΨ)=−22, so ∣S(νρΨ)∣=22.

The statement is a conditional theorem about the declared arrangement model; it asserts no measured value and no apparatus realization.

Facts & Assumptions

Given: A declared spin correlation arrangement with preparation ρ and directions a0,a1,b0,b1; the outcome laws νijρ and their CHSH functional; the Axiom of Countable Choice and the Axiom of Choice.

[F1]

The arrangement's outcome law is νijρ(ε,δ)=tr⁡(ρ(Pai,ε⊗Pbj,δ)) with Pa,ε=12(I+εa⋅σ); the correlations are Eij(νρ)=∑ε,δεδ νijρ(ε,δ) and S(νρ)=E00+E01+E10−E11 (Declared spin correlation arrangement of the framework: two spin-half factors, four directions, joint sign tables and local-response models clauses (a), (d), Binary correlation models: setting-indexed tables of two-valued outcome laws, marginals and the CHSH functional clause (d)).

[F2]

The Pauli matrix σa=∑iaiσi for unit a is a self-adjoint involution, σa2=I, and Pa,+−Pa,−=σa (Finite spin matrices clause (e), Declared spin correlation arrangement of the framework: two spin-half factors, four directions, joint sign tables and local-response models clause (a)).

[F3]

The completed tensor product V⊗^V carries the bounded tensor calculus: (S⊗T)(S′⊗T′)=(SS′)⊗(TT′), (S⊗T)∗=S∗⊗T∗, ∥S⊗T∥≤∥S∥ ∥T∥, and the assignment is linear in each argument (Bounded tensor maps: extension, norm estimate, adjoint and commutation clauses (a), (b), (c)).

[F4]

A density operator ρ is self-adjoint, positive and trace class with tr⁡ρ=1 and ∥ρ∥1=1 (Density operators and scalar spectral probability clause (a), Trace class operator).

[F5]

Trace class is a two-sided Banach operator ideal: for trace-class T and bounded A,B one has ATB trace class with ∥ATB∥1≤∥A∥ ∥T∥1∥B∥, and ∥T∥≤∥T∥1 (Trace class is a two sided Banach operator ideal clauses 1, 2); the trace is linear on the trace class and ∣tr⁡T∣≤∥T∥1 (Trace is absolutely convergent and basis independent).

[F6]

For bounded self-adjoint involutions A0,A1 on a Hilbert space H and B0,B1 on a Hilbert space K, the operator C:=A0⊗(B0+B1)+A1⊗(B0−B1) on H⊗^K is self-adjoint with ∥C∥≤22; equivalently, for every unit vector ψ the CHSH combination of the expectations ⟨(Ai⊗Bj)ψ,ψ⟩ is at most 22 in absolute value (Tsirelson bound clauses (a), (b), (c)).

[F7]

Under the Axiom of Countable Choice and the Axiom of Choice, the singlet preparation and displayed directions satisfy S(νρΨ)=−22 (The singlet arrangement: directional sign tables, CHSH value 2 sqrt 2 and the failure of local-response models at violating settings clause (b)); that supplier states both hypotheses.

Proof

technique · direct; write the CHSH functional as the trace of the preparation against the CHSH operator, apply the operator-norm bound of the finite-dimensional Tsirelson theorem, and bound the trace by the ideal and trace inequalities

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

1.1givenF1F2F3F5algebra

[CHSH functional as an operator trace] Put C:=σa0⊗(σb0+σb1)+σa1⊗(σb0−σb1), a bounded operator on V⊗^V by [F3]. For each (i,j), [F2] gives σai⊗σbj=(Pai,+−Pai,−)⊗(Pbj,+−Pbj,−)=∑ε,δεδ Pai,ε⊗Pbj,δ, a finite sum, so by [F1], the linearity of the finite sum and the linearity of the trace [F5], Eij(νρ)=∑ε,δεδtr⁡(ρ(Pai,ε⊗Pbj,δ))=tr⁡(ρ∑ε,δεδ(Pai,ε⊗Pbj,δ))=tr⁡(ρ(σai⊗σbj)). Summing the four terms with the CHSH signs and using [F3] and the linearity of the trace gives S(νρ)=tr⁡(ρ C).

1.2givenF2F6

[Operator norm bound] By [F2] the matrices σai,σbj are self-adjoint involutions, so [F6] applies and gives ∥C∥≤22.

2.1step 1.1step 1.2F4F5algebra

[Trace bound] By [F4] ρ is trace class with ∥ρ∥1=1, so [F5] makes ρC trace class with ∥ρC∥1≤∥ρ∥1∥C∥=∥C∥, and the trace bound of [F5] gives ∣tr⁡(ρC)∣≤∥ρC∥1≤∥C∥≤22. With step 1.1 this is ∣S(νρ)∣≤22, which is (a).

3.1F7step 2.1∎

[Attainment; the Axiom of Choice enters through F7 here] Clause (b) is exactly [F7] for the singlet preparation and the displayed directions, and step 2.1 shows that no value larger than 22 occurs. The Axiom of Choice is required at this proof step to invoke the attainment result with its stated hypotheses; the operator-norm derivation of (a) uses the Countable Choice hypothesis of its mathematical suppliers.

Remarks

  • Sharpness within the declared class. The bound cannot be lowered for the declared arrangement model, because the singlet at the displayed directions attains it (clause (b)). This is a statement about the declared binary sign measurements of the arrangement; it is not an optimality statement for other functionals, for more settings, for unsharp measurements or for other systems.
  • Where the bound is used. The bound is one half of the contrast of this page: the CHSH functional of any representable model is at most 2 in absolute value (The CHSH bound for every binary correlation model admitting a local-response representation), while the declared arrangement permits 22; the gap is not a numerical coincidence of the singlet but a property of the framework's binary sharp readouts of self-adjoint involutions.

Depends on

Dependency tree · 2 levels

Sources