Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Coherent and incoherent two-path bin laws and the marker overlap

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (D,A,dx) be a σ-finite measure space, let L2(D) be the complex Hilbert space of The space Lp(μ) as the quotient by null functions and Complex Lp classes and Euclidean test-function conventions, and let a,b∈L2(D).

(a) Coherent law. If a+b≠0 as a class, i.e. ∥a+b∥>0, then pcoh(B):=∫B∣a+b∣2 dx∥a+b∥2,B∈A, defines a probability measure on (D,A) (Measures on sigma-algebras, Probability measures and probability spaces), and for every B ∫B∣a+b∣2dx=∫B∣a∣2dx+∫B∣b∣2dx+2Re⁡∫Bab‾ dx.

(b) Incoherent law. If a≠0, b≠0 and w∈[0,1], then pmix(B):=w ∫B∣a∣2dx∥a∥2+(1−w) ∫B∣b∣2dx∥b∥2 defines a probability measure on (D,A).

(c) Signed difference. Let a,b be unit vectors with Re⁡⟨a,b⟩≠−1, and put N(B):=∫B(∣a∣2+∣b∣2)dx,c(B):=Re⁡∫Bab‾ dx,pcoh(B):=N(B)+2c(B)2+2c(D),pmix(B):=N(B)2. Then for every B, N(B)−2c(B)=∫B∣a−b∣2dx≥0, and pcoh(B)−pmix(B)=2c(B)−c(D)N(B)2(1+c(D)). Equality pcoh(B)=pmix(B) for every measurable bin holds exactly when 2Re⁡(ab‾)=c(D)(∣a∣2+∣b∣2) almost everywhere. In particular, if a⊥b then c(D)=0 and the signed difference is c(B), so orthogonality alone does not imply equality on each bin. If b=a then equality holds on every bin. Coherence of the preparation changes the bin law according to the amplitudes and their actual normalization.

(d) Marker overlap. Let K be a complex Hilbert space (Hilbert space) with unit vectors e1,e2, let α,β∈C with ∣α∣2+∣β∣2=1, let a,b be unit vectors and put Ψ:=α a⊗e1+β b⊗e2 in the completed tensor product L2(D)⊗^K. The reduced weight ρ:=Tr⁡KTΨ,Ψ is defined even when Ψ=0, with tr⁡ρ=∥Ψ∥2. If Ψ≠0, B∈A has finite measure and PB is multiplication by 1B, then the normalized bin law of the reduced weight ρ is tr⁡(ρPB)tr⁡ρ=1∥Ψ∥2∫B(∣α∣2∣a∣2+∣β∣2∣b∣2+2Re⁡(αβ‾ ⟨e1,e2⟩ a(x)b(x)‾))dx, and ∣⟨e1,e2⟩∣≤1: the marker overlap bounds the complex cross coefficient in modulus (its phase may rotate the real interference contribution); that contribution vanishes identically when e1⊥e2, leaving the incoherent weight. If Ψ=0, no normalized law is defined.

(e) Finite sampling. If a detector model produces, for a fixed bin B, a positive integer N of independent trials each with success probability p=pcoh(B) or p=pmix(B), and SN is the number of successes, then SN is binomial(N,p) and E[SN/N]=p, Var⁡(SN/N)=p(1−p)/N (The CHSH bound and the finite-sampling law for independent trials, clause (c)).

All assertions are identities and inequalities for the specified preparation vectors; no detector law, no measured counting rate and no empirical claim is asserted, and (e) is conditional on the stated independent-trials model.

Facts & Assumptions

Given: a σ-finite measure space (D,A,dx), classes a,b∈L2(D); in (d) a Hilbert space K with unit vectors e1,e2 and coefficients α,β.

[F1]

For measurable B the set function B↦∫Bg dx is countably additive for g∈L1: for pairwise disjoint Bn with union B, the partial sums of ∫∣g∣1Bn increase to ∫∣g∣1B≤∫∣g∣, and monotone convergence applied to the positive and negative parts gives ∫Bg=∑n∫Bng (Monotone convergence for the integral).

[F2]

For a,b∈L2(D) and measurable B, ∫B∣a+b∣2=∫B∣a∣2+∫B∣b∣2+2Re⁡∫Bab‾, and ∣∫Bab‾∣≤∥a∥L2(B)∥b∥L2(B)≤∥a∥ ∥b∥ (Cauchy-Schwarz inequality for L2, Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors, L2 with the integral pairing is a Hilbert space).

[F3]

Marker overlap contraction of Marker overlap contraction of the two-path cross term: with Ψ=αa⊗e1+βb⊗e2, ρ=Tr⁡KTΨ,Ψ is a positive trace-class weight with tr⁡ρ=∥Ψ∥2 and, for every measurable B of finite measure, tr⁡(ρPB)=∫B(∣α∣2∣a∣2+∣β∣2∣b∣2+2Re⁡(αβ‾⟨e1,e2⟩ab‾))dx; also ∣⟨e1,e2⟩∣≤1.

[F4]

Binomial frequencies: if SN is binomial(N,p) with N≥1, p∈[0,1], then E[SN/N]=p and Var⁡(SN/N)=p(1−p)/N (The CHSH bound and the finite-sampling law for independent trials, clause (c)).

Proof

1.1givenF1F2algebra

[Coherent law] Assume ∥a+b∥>0; then ∥a+b∥2=∫D∣a+b∣2>0 is finite, and pcoh(D)=1. The set function B↦∫B∣a+b∣2 is countably additive by [F1] applied to g=∣a+b∣2∈L1, and nonnegative; dividing by the finite positive number ∥a+b∥2 preserves countable additivity and total mass one, so pcoh is a probability measure. The expansion is the pointwise identity ∣a+b∣2=∣a∣2+∣b∣2+2Re⁡(ab‾) integrated over B, legitimate for L1 classes. This is (a).

1.2givenF1algebra

[Incoherent law] If a≠0 and b≠0, the two normalized set functions B↦∥a∥−2∫B∣a∣2 and B↦∥b∥−2∫B∣b∣2 are probability measures by [F1] applied to ∣a∣2 and ∣b∣2, so any convex combination with w∈[0,1] is a probability measure. This is (b).

1.3givenF2algebra

[Signed difference] Let a,b be unit vectors; then N(D)=2 and, Cauchy–Schwarz gives c(D)≥−1, and the hypothesis c(D)≠−1 therefore gives ∥a+b∥2=2+2c(D)>0. Expanding, pcoh(B)−pmix(B)=N(B)+2c(B)2+2c(D)−N(B)2=2N(B)+4c(B)−2N(B)−2c(D)N(B)4(1+c(D))=2c(B)−c(D)N(B)2(1+c(D)), and N(B)−2c(B)=∫B(∣a∣2+∣b∣2−2Re⁡ab‾)=∫B∣a−b∣2≥0. The signed difference is the integral over B of the integrable real function [2Re⁡(ab‾)−c(D)(∣a∣2+∣b∣2)]/[2(1+c(D))]. Its integral vanishes on every measurable bin exactly when this density is zero almost everywhere: otherwise one of its positive or negative level sets has a strictly signed integral. This proves the stated all-bin criterion. If a⊥b, only c(D)=0 follows, giving difference c(B). For an explicit counterexample, take D={1,2} with dx({1})=dx({2})=1, a=(1,1)/2 and b=(1,−1)/2. Their inner product is zero, but c({1})=1/2, so their coherent and balanced mixed laws differ on that bin. If b=a (unit), then N(B)=2∫B∣a∣2 and c(B)=∫B∣a∣2, so 2c(B)−c(D)N(B)=2∫B∣a∣2−2∫B∣a∣2=0; the difference vanishes for every B. This is (c).

1.4givenF3algebra

[Marker law] Under the hypotheses of (d), tr⁡ρ=∥Ψ∥2 by [F3]; if Ψ≠0 the normalized law is tr⁡(ρPB)/tr⁡ρ, and substituting [F3]'s formula gives the displayed identity. The bound ∣⟨e1,e2⟩∣≤1 bounds the complex cross coefficient by ∣αβ∣, while its phase need not contract the real interference part; this is [F3]. When Ψ=0, the raw weight remains defined and has zero trace, so normalization is omitted; if e1⊥e2 the cross term 2Re⁡(αβ‾⟨e1,e2⟩ab‾) vanishes pointwise, leaving the incoherent weight ∣α∣2∣a∣2+∣β∣2∣b∣2. This is (d).

2.1givenF4algebra∎

[Finite sampling] Under the stated independent-trials model, the number of successes SN is by definition binomial(N,p), and the mean and variance of SN/N are those of [F4]. This is (e), and it is conditional on that model.

Depends on

Dependency tree · 2 levels

Sources