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

Singlet pairings: the joint laws of the two spin-half factors along two directions

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), the hypothesis of the tensor construction cited below. Let V=C2 carry the orthonormal basis (e+,e−) and let σx=(0110),σy=(0−ii0),σz=(100−1) be the Pauli matrices of clause (e) of Finite spin matrices in the ordered basis (e+,e−); for a=(ax,ay,az)∈R3 put σa:=axσx+ayσy+azσz, and for ε∈Σ={−1,+1} put Pa,ε:=12(I+ε σa). Let V⊗^V be the completed tensor product with inclusion κ of Hilbert tensor construction: inner product, completion and product bases and let Ψ:=12(κ(e+⊗e−)−κ(e−⊗e+))∈V⊗^V,q:=12(κ(e+⊗e−)+κ(e−⊗e+)). Then:

(a) for every unit a∈R3 and ε∈Σ the operator Pa,ε is an orthogonal projection on V, Pa,++Pa,−=I and Pa,εPa,ε′=δεε′Pa,ε;

(b) ∥Ψ∥=1 and the four vectors Ψ,q,κ(e+⊗e+),κ(e−⊗e−) are mutually orthogonal, so (Ψ,q,κ(e+⊗e+),κ(e−⊗e−)) is an orthonormal basis of V⊗^V;

(c) for all unit a,b∈R3 and all ε,δ∈Σ, ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩=14(1−εδ a⋅b);

(d) the marginals of the four numbers in (c) are ∑δ∈Σ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩=12=∑ε∈Σ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩, and their correlation is ∑ε∈Σ∑δ∈Σε δ ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩=−a⋅b.

The lemma is a finite-dimensional computation in the tensor product; it asserts no preparation, measurement or physical interpretation. The Axiom of Countable Choice enters only through the construction of the completed tensor product cited from Hilbert tensor construction: inner product, completion and product bases.

Facts & Assumptions

Given: The space V=C2 with orthonormal basis (e+,e−) and the Pauli matrices σx,σy,σz; unit vectors a,b∈R3; the completed tensor product V⊗^V with inclusion κ; the vectors Ψ and q; the labels ε,δ∈Σ; the Axiom of Countable Choice.

[F1]

The Pauli matrices satisfy σi∗=σi, σx2=σy2=σz2=I, σxσy=iσz, σyσz=iσx, σzσx=iσy and consequently σiσj+σjσi=2δijI; their actions on the basis are σxe+=e−, σxe−=e+, σye+=ie−, σye−=−ie+, σze+=e+ and σze−=−e− (Finite spin matrices clause (e), Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes).

[F2]

For every a∈R3 the matrix σa=∑iaiσi is self-adjoint and σa2=∑i,jaiajσiσj=∑iai2I+∑i≠jaiajσiσj=∥a∥2I by the anticommutation relations of [F1]; in particular σa2=I for unit a, and σa is a linear map V→V (Finite spin matrices clauses (a), (e), Linear map between vector spaces over the same field).

[F3]

The completed tensor product V⊗^V is a complex Hilbert space, κ is a linear isometry with dense image, ⟨κ(u⊗v),κ(u′⊗v′)⟩=⟨u,u′⟩⟨v,v′⟩ for all u,u′,v,v′∈V, and the four elementary tensors κ(eε⊗eδ) form an orthonormal basis (Hilbert tensor construction: inner product, completion and product bases clauses (b), (c), (d), Real and complex inner product spaces, with the inner product linear in the first argument, Real and complex inner-product spaces and their induced length, Hilbert space, The induced length is a norm).

[F4]

For bounded S,T on V there is a bounded operator S⊗T on V⊗^V with (S⊗T)κ(u⊗v)=κ(Su⊗Tv) for all u,v∈V, (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)); consequently computations on Ψ may be performed term by term in the orthonormal basis of [F3].

[F5]

In a complex inner product space, ∣⟨x,y⟩∣≤∥x∥ ∥y∥ (Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors); the norm is induced by the inner product, ∥z∥=⟨z,z⟩1/2 (The induced length is a norm, Real and complex inner-product spaces and their induced length).

Proof

technique · direct; verify the projection algebra from the Pauli anticommutation relations, compute the action of the local and product Pauli operators on the four product-basis vectors, read the pairings off the orthonormal basis, and assemble the joint numbers from the projection decomposition

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

1.1givenF2algebra

[Projections] Fix a unit a and ε∈Σ. By [F2], Pa,ε∗=12(I+εσa∗)=12(I+εσa)=Pa,ε and Pa,ε2=14(I+2εσa+ε2σa2)=14(2I+2εσa)=12(I+εσa)=Pa,ε using ε2=1 and σa2=I; hence Pa,ε is an orthogonal projection. Moreover Pa,++Pa,−=I and Pa,+Pa,−=14(I−σa2)=0, which is (a).

1.2givenF3F5algebra

[Orthonormal basis] By [F3], ∥Ψ∥2=12(∥e+⊗e−∥2+∥e−⊗e+∥2)=1 and ∥q∥2=1, and the inner products pair the four displayed vectors as 0 or 1: for instance ⟨Ψ,q⟩=12(1−1)=0 and ⟨Ψ,κ(e+⊗e+)⟩=12(⟨e+,e+⟩⟨e−,e+⟩−⟨e−,e+⟩⟨e+,e+⟩)=0 by the product formula of [F3]. Since the four elementary tensors already form an orthonormal basis of the four-dimensional space V⊗^V, so do the four mutually orthogonal unit vectors Ψ,q,κ(e+⊗e+),κ(e−⊗e−); this is (b).

2.1givenF1F4step 1.2algebra

[Local Pauli operators on Ψ] Using [F1] and [F4] term by term, (σz⊗I)Ψ=12(κ(e+⊗e−)+κ(e−⊗e+))=q and (I⊗σz)Ψ=12(−κ(e+⊗e−)−κ(e−⊗e+))=−q; further (σx⊗I)Ψ=12(κ(e−⊗e−)−κ(e+⊗e+)), (I⊗σx)Ψ=12(κ(e+⊗e+)−κ(e−⊗e−)), (σy⊗I)Ψ=i2(κ(e+⊗e+)+κ(e−⊗e−)) and (I⊗σy)Ψ=−i2(κ(e+⊗e+)+κ(e−⊗e−)), all of which are linear combinations of the three basis vectors q,κ(e+⊗e+),κ(e−⊗e−) orthogonal to Ψ by step 1.2; hence ⟨(σi⊗I)Ψ,Ψ⟩=0=⟨(I⊗σi)Ψ,Ψ⟩ for i=x,y,z, and by the linearity of [F4] in the first tensor argument, ⟨(σa⊗I)Ψ,Ψ⟩=0=⟨(I⊗σb)Ψ,Ψ⟩ for all a,b.

2.2givenF1F4step 1.2algebra

[Product Pauli operators on Ψ] Term-by-term application of [F1] and [F4] gives (σx⊗σx)Ψ=(σy⊗σy)Ψ=(σz⊗σz)Ψ=−Ψ. Put r+:=(κ(e+⊗e+)+κ(e−⊗e−))/2 and r−:=(κ(e+⊗e+)−κ(e−⊗e−))/2. The six mixed products are (σx⊗σy)Ψ=−iq, (σy⊗σx)Ψ=iq, (σx⊗σz)Ψ=−r+, (σz⊗σx)Ψ=r+, (σy⊗σz)Ψ=ir− and (σz⊗σy)Ψ=−ir−. Each is orthogonal to Ψ by step 1.2. Thus ⟨(σi⊗σj)Ψ,Ψ⟩=−δij for all i,j∈{x,y,z}.

3.1step 2.2F4algebra

[Directional correlation] By the linearity of [F4], (σa⊗σb)Ψ=∑i,jaibj(σi⊗σj)Ψ, so the final identity of step 2.2 and the conjugate-linearity of the inner product in its second argument give ⟨(σa⊗σb)Ψ,Ψ⟩=∑i,jaibj(−δij)=−a⋅b, with real a,b.

4.1step 1.1step 1.2step 2.1step 3.1F4algebra

[Joint numbers] Let a,b be unit vectors and ε,δ∈Σ. By step 1.1, Pa,ε=12(I+εσa) and Pb,δ=12(I+δσb), so multilinearity of the tensor product [F4] and the bilinearity of the inner product give ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩=14(⟨Ψ,Ψ⟩+ε⟨(σa⊗I)Ψ,Ψ⟩+δ⟨(I⊗σb)Ψ,Ψ⟩+εδ⟨(σa⊗σb)Ψ,Ψ⟩)=14(1−εδ a⋅b) by steps 1.2, 2.1 and 3.1; this is (c).

5.1step 4.1algebra

[Marginals and correlation] Summing the formula of step 4.1 over the distant label and using ∑δ∈Σδ=0 gives ∑δ⟨(Pa,ε⊗Pb,δ)Ψ,Ψ⟩=14(2−εa⋅b⋅0)=12, and symmetrically for the other marginal; the correlation is ∑ε,δεδ 14(1−εδa⋅b)=14((∑εε)(∑δδ)−a⋅b∑ε,δ(εδ)2)=14(0−4 a⋅b)=−a⋅b; this is (d).

6.1step 1.1step 1.2step 4.1step 5.1∎

[Assembly] Step 1.1 is (a), step 1.2 is (b), step 4.1 is (c) and step 5.1 is (d); only the finite-dimensional tensor calculus of [F1]-[F4] and real arithmetic were used, and no physical interpretation is asserted.

Remarks

  • Relation to the framework's singlet. The vector Ψ is the singlet of the two-factor spin-half model; its joint numbers (c) are the pairings of the local spin projections, and (d) shows that each single-station marginal is 12 and that the directional correlation is −a⋅b. The physical reading of these numbers as outcome laws of a declared preparation is fixed on the page of this pair; this lemma itself is linear algebra.
  • No degenerate directions. The computation covers every pair of unit directions, including a=b (correlation −1) and a=−b (correlation +1) and a⊥b (correlation 0); the joint numbers are 14(1∓εδ) in these cases and remain in [0,1].

Depends on

Dependency tree · 2 levels

Sources