Alphabeta Math
Pipeline-generated
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.

Causal propagators, time slice and algebraic locality — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passverified 2026-10-22 (gpt-6.1-sol)Open item page →

Bell-pair postselection changes a conditional remote expectation

Statement

Assume Countable Choice as in The Axiom of Countable Choice (ACω). On H=C2⊗C2, let ψ=∣00⟩+∣11⟩2, where e0=(1,0) and e1=(0,1) are the standard orthonormal basis of C2, j,a,b,c,d∈{0,1}, ∣j⟩:=ej, and ∣ab⟩:=ea⊗eb. Give H the inner product linear in the first argument and conjugate-linear in the second determined by ⟨ea⊗eb,ec⊗ed⟩=1 if a=c and b=d, and 0 otherwise, extended by these sesquilinearity rules. Let IH be the identity on H. For either K=H or K=C2, write B(K) for the bounded complex-linear maps K→K, with boundedness measured by the induced norm. Define the initial vector functional ω:B(H)→C by ω(C):=⟨Cψ,ψ⟩. For j∈{0,1} let Pjx:=⟨x,ej⟩ej for x∈C2; Alice uses the local projections M0=P0⊗I2,M1=P1⊗I2, where I2 is the identity on C2. Bob's observable is ZB=I2⊗Z, with Z the linear operator determined by Z∣0⟩=∣0⟩ and Z∣1⟩=−∣1⟩. Define the branch weight pj:=∥Mjψ∥2 and, when pj>0, the normalized branch vector ψj:=Mjψ/pj. Each branch weight is 1/2; conditional on branch 0 Bob's ZB expectation ωj(ZB):=⟨ZBψj,ψj⟩ is +1, and conditional on branch 1 it is −1. The initial and nonselective ZB expectations are both zero. These are finite-dimensional mathematical state calculations, not claims about an apparatus or observed data.

Facts & Assumptions

Given: The two-factor Hilbert space with the displayed orthonormal basis and inner-product convention, the vector ψ, the projections M0,M1, and the operator ZB.

[A1]

Assume Countable Choice as stated in The Axiom of Countable Choice (ACω).

[F1]

Real and complex inner-product spaces and their induced length: the inner product is linear in its first argument, conjugate-linear in its second, and induces the norm ∥x∥=⟨x,x⟩.

[F2]

Local trace-preserving operations preserve commuting expectations: for a nonzero complex Hilbert space H, a state on B(H) is a complex-linear functional ω with ω(IH)=1 and ω(X∗X)∈[0,∞) for every bounded X; for commuting unital ∗-subalgebras and a finite normalized family in one of them, the nonselective expectation of every element of the other equals its initial expectation.

[F3]

Hilbert space and Every finite-dimensional normed space is Banach: a complex Hilbert space is a complex inner-product space complete in its induced norm; the four displayed orthonormal basis vectors make H finite-dimensional, so the induced norm is complete and H is a nonzero Hilbert space. The same argument with e0,e1 makes C2 a Hilbert space.

[F4]

The spaces (\mathcal B(X,Y)) and (\mathcal B(X)) of bounded linear operators: B(K) is the set of bounded complex-linear operators K→K for each of the finite-dimensional Hilbert spaces K=H,C2 used here.

[F5]

The Hilbert-space adjoint of a bounded operator: for bounded X on a Hilbert space with the linear-first convention, ⟨Xx,y⟩=⟨x,X∗y⟩.

Proof

1.1F1F2F3F4F5givenalgebra

The four vectors ∣ab⟩ are orthonormal, so ∥ψ∥2=(1+1)/2=1. By [F1], ω is complex-linear and ω(IH)=1. For every X∈B(H), adjointness [F5] and conjugate symmetry give ω(X∗X)=⟨X∗Xψ,ψ⟩=⟨ψ,X∗Xψ⟩‾=⟨Xψ,Xψ⟩‾=∥Xψ∥2≥0, so ω is a state in the sense of [F2]. The projections satisfy M0∗=M0, M1∗=M1, M0M1=0, and M0+M1=IH. Hence ∑j=01Mj∗Mj=IH, and M0ψ=∣00⟩2,M1ψ=∣11⟩2. The outcome probabilities are pj=∥Mjψ∥2=1/2, so both normalized conditional vectors are defined.

2.1F1step 1.1givenalgebra

Dividing the branch vectors in step 1.1 by pj=1/2 gives ψ0=∣00⟩ and ψ1=∣11⟩. Since ZB∣00⟩=∣00⟩ and ZB∣11⟩=−∣11⟩, their conditional expectations are respectively ω0(ZB)=⟨ZBψ0,ψ0⟩=+1 and ω1(ZB)=⟨ZBψ1,ψ1⟩=−1. Also ZBψ=∣00⟩−∣11⟩2,ω(ZB)=⟨ZBψ,ψ⟩=⟨∣00⟩−∣11⟩2,∣00⟩+∣11⟩2⟩=0, because the cross terms vanish by orthogonality.

3.1A1F1F2F4step 1.1step 2.1givenalgebra∎

Let A:={A⊗I2:A∈B(C2)} and B:={I2⊗B:B∈B(C2)}. For every elementary tensor u⊗v, (A⊗I2)(I2⊗B)(u⊗v)=Au⊗Bv=(I2⊗B)(A⊗I2)(u⊗v); elementary tensors span H, so these unital ∗-algebras commute. The two projections lie in A and the normalization was checked in step 1.1. Applying [F2] to the state proved in step 1.1 and C=ZB gives the nonselective expectation ∑jω(Mj∗ZBMj)=∑j⟨Mj∗ZBMjψ,ψ⟩=ω(ZB)=⟨ZBψ,ψ⟩=0. Equivalently, the probability-weighted conditional values from step 2.1 average to (1/2)(+1)+(1/2)(−1)=0. Thus post-selection changes the conditional remote expectation in either branch, while retaining and averaging the outcomes leaves the original remote marginal unchanged.

Remarks

The branch states are conditional on the reported local outcome. Their different remote expectations do not give a nonselective signal; the outcome-averaged identity is the algebraic conclusion of Local trace-preserving operations preserve commuting expectations.

5 · Examples, experiments and counterexamples

None yet.

Sources