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

Qm Interference And Local Detection

1 · Prerequisites

2 · Summary

This page develops the interference and local-detection structure of the massive-model framework on top of the kinematic page qm-massive-particle-kinematics. The batch-local mathematics of Component amplitudes, coherent and incoherent bin laws, and recorded detector weights collects the component-valued cross-term identities, the coherent and which-path bin laws on a measure space of amplitudes, the recorded-weight sub-probability and conditioning, and the criterion under which the coherent law and the weighted which-path law coincide on every bin. Separately, The declared two-path preparation model and its ideal detection bins declares the pair's model and supplies its joint position PVM and Born-density calculation: two nonzero path-component classes of the model state space, coherent preparations of a declared relative phase, which-path preparations with declared weights, and the ideal detection-bin reading; and The declared recorded detector and sampling model of the two-path arrangement declares the finite recorded detector with bounded multiplication effects, its no-record channel and loss conditioning, and the declared independent-trials model.

Coherent and which-path detection laws of the declared two-path model derives the normalized coherent position law with its amplitude cross term, the which-path law, and the exact criterion for their coincidence when the coherent preparation is admissible at phase 0, and Recorded bin laws, loss and conditioning of the declared two-path detector derives the recorded-bin laws, the no-record mass and conditioned law, the reduction of indicator weights to ideal bins, and a sufficient condition for the recorded laws to agree when the coherent preparation is admissible at phase 0. Continuity equation and local balance for the massive-model position density derives the continuity equation and local squared-amplitude balance for the model's componentwise C1-in-time, C2-in-space solutions of the P4/P5 equation almost everywhere with the bounded measurable P5 potential. This is the position probability density when the full-space state is normalized; under explicit domination and surface-flux hypotheses the finite total squared-amplitude integral is conserved on an interval. P4 separately gives norm conservation of the model's flow and hence total probability one for unit preparations. The finite-sample behaviour is fixed by A finite sample can fail a criterion that rejects a positive-probability sequence: within the declared independent-trials model, a criterion that rejects a positive-probability outcome sequence fails with positive probability, coincident recorded laws are indistinguishable, and no p-value, error rate or empirical conclusion is produced. What the two-path detection page establishes, assumes and defers records what the page assumes rather than derives, that it makes no which-path claim, that screen reductions and marker-overlap visibility loss are separate models (the latter homed on the entanglement page), and that only the companion example page reports an experiment.

The page is conditional throughout: the path components, phases, weights, recorded weights and trial independence are declared apparatus and preparation inputs in the sense of the preparation and apparatus postulate P7, the identification of a concrete arrangement with any of them is a tested identification with uncertainty, and no laboratory data appear here.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Component amplitudes, coherent and incoherent bin laws, and recorded detector weights

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), the choice hypothesis of the cited Hilbert-space and measure suppliers. Let (D,A,dx) be a σ-finite measure space (Measures on sigma-algebras), let r≥1 be an integer, and let L2(D;Cr):={f:D→Cr measurable: ∫D∥f(x)∥Cr2 dx<∞}/ ⁣∼, the quotient by equality dx-almost everywhere (The space Lp(μ) as the quotient by null functions, Complex Lp classes and Euclidean test-function conventions), with ⟨f,g⟩:=∫D⟨f(x),g(x)⟩Cr dx,∥f∥2:=⟨f,f⟩=∫D∥f(x)∥Cr2 dx, linear in the first argument (L2 with the integral pairing is a Hilbert space). For a,b∈L2(D;Cr) and measurable B⊆D write ⟨a,b⟩B:=∫B⟨a(x),b(x)⟩Cr dx,N:=∥a∥2+∥b∥2,c:=Re⁡⟨a,b⟩D. Then:

(a) Pointwise and integrated cross term. For dx-almost every x∈D, ∥a(x)+b(x)∥Cr2=∥a(x)∥Cr2+∥b(x)∥Cr2+2Re⁡⟨a(x),b(x)⟩Cr, and for every measurable B⊆D, the three functions ∥a∥2, ∥b∥2, ⟨a,b⟩Cr being dx-integrable on B, ∫B∥a+b∥2 dx=∫B∥a∥2 dx+∫B∥b∥2 dx+2Re⁡⟨a,b⟩B.

(b) Coherent bin law. If ∥a+b∥>0, then pcoh(B):=∫B∥a+b∥2 dx∥a+b∥2(B∈A) defines a probability measure on (D,A) (Probability measures and probability spaces), and for every B∈A the expansion of (a) holds with ∥a+b∥2=N+2c in the denominator.

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

(d) Recorded weights, sub-probability and conditioning. Let μ be a probability measure on (D,A) and let W:D→[0,1] be measurable. Then B↦ν(B):=∫BW dμ is a finite measure on (D,A) with 0≤ν(D)≤1; if ν(D)>0, then νˉ(B):=ν(B)/ν(D) defines a probability measure on (D,A). More generally, for finitely many measurable weights W1,…,Wm:D→[0,1] with ∑a=1mWa≤1 pointwise, the numbers νa:=∫DWa dμ satisfy νa≥0 and ∑a=1mνa≤1; if ∑a=1mWa=1 pointwise, then ∑a=1mνa=1.

(e) Coincidence criterion. Let ∥a∥>0, ∥b∥>0 and ∥a+b∥>0, and put w∗:=∥a∥2/N, so that pmix with weight w∗ is p∗(B)=N−1∫B(∥a∥2+∥b∥2)dx. Then pcoh(B)=p∗(B) for every B∈A if and only if NRe⁡⟨a(x),b(x)⟩Cr=c (∥a(x)∥Cr2+∥b(x)∥Cr2)for dx-almost every x∈D. In particular, if ⟨a(x),b(x)⟩Cr=0 for almost every x, then the two laws coincide; and if c=0, then they coincide if and only if Re⁡⟨a(x),b(x)⟩Cr=0 for almost every x.

The assertions concern the specified classes and weights only; no probability law of an apparatus, no sample of trials and no empirical claim is asserted.

Facts & Assumptions

Given: The Axiom of Countable Choice; a σ-finite measure space (D,A,dx); an integer r≥1; classes a,b∈L2(D;Cr); a probability measure μ on (D,A); measurable weights W,W1,…,Wm:D→[0,1]; reals w∈[0,1].

[F1]

Componentwise L2 and its pairing. For f=(f1,…,fr) with components in the scalar space L2(D;C) of The space Lp(μ) as the quotient by null functions and Complex Lp classes and Euclidean test-function conventions, the integral ⟨f,g⟩=∑l=1r∫Dflgl‾ dx is finite and defines an inner product, linear in the first argument, with ∥f∥2=∑l∥fl∥2; for every measurable B the partial pairing satisfies ∣⟨f,g⟩B∣≤∥f∥L2(B)∥g∥L2(B)≤∥f∥ ∥g∥ (L2 with the integral pairing is a Hilbert space, Cauchy-Schwarz inequality for L2, Cauchy–Schwarz: ∣⟨u,v⟩∣≤∥u∥∥v∥, with equality exactly for linearly dependent vectors). Two choices of representatives of f,g change x↦⟨f(x),g(x)⟩Cr and x↦∥f(x)+g(x)∥2 only on a dx-null set, so the pointwise assertions are well posed almost everywhere.

[F2]

Indefinite integrals are measures. For nonnegative measurable h the set function B↦∫Bh dx is a measure on (D,A) (The indefinite integral of a nonnegative measurable function is a measure); for g∈L1(dx) the real and imaginary parts of B↦∫Bg dx are countably additive by monotone convergence (Monotone convergence for the integral).

[F3]

Monotonicity of the integral. If 0≤h≤H are measurable, then ∫Dh dx≤∫DH dx (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F4]

Probability measures and normalization. A probability measure is a measure on (D,A) with total mass 1 (Probability measures and probability spaces, Measures on sigma-algebras). A finite measure ν≥0 with 0<ν(D)<∞ is normalized to a probability measure by νˉ(B)=ν(B)/ν(D), because countable additivity divided by the constant ν(D) stays countably additive and νˉ(D)=1.

Proof

technique · direct; expand the squared component norm pointwise, then read off in turn the two normalized laws and the weight bounds, integrate the cross term, normalize it, and compute the coincidence condition from the two displayed formulas

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

1.1givenF1algebra

[Pointwise identity] Fix representatives of a,b. For every x∈D the identity ∥a(x)+b(x)∥Cr2=∥a(x)∥Cr2+∥b(x)∥Cr2+2Re⁡⟨a(x),b(x)⟩Cr holds by the expansion of the finite-dimensional inner product; by [F1] the three real functions x↦∥a(x)∥2, ∥b(x)∥2 and Re⁡⟨a(x),b(x)⟩ are measurable, and the last is integrable because ∣Re⁡⟨a(x),b(x)⟩∣≤∥a(x)∥ ∥b(x)∥ with ∥a∥ ∥b∥∈L1(dx); representatives differing on null sets change the identity only on a null set. This proves the pointwise assertion of (a).

1.2F2F4algebra

[Incoherent law] Assume ∥a∥,∥b∥>0. By [F2] each of B↦∫B∥a∥2dx and B↦∫B∥b∥2dx is a finite measure with positive total masses ∥a∥2 and ∥b∥2; by [F4] each normalized set function is a probability measure, and a convex combination with w∈[0,1] of two probability measures is again a probability measure, because countable additivity is preserved and w⋅1+(1−w)⋅1=1. This is (c).

1.3F2F3F4algebra

[Recorded weights] Applying [F3] with h=W and H=1 gives ν(D)=∫DW dμ≤∫D1 dμ=1 and ν(B)≥0 for every B because W≥0; countable additivity of ν follows from [F2] applied to the measure μ. If ν(D)>0, [F4] makes νˉ a probability measure. For the finite family, νa=∫DWadμ≥0 and ∑aνa=∫D∑aWa dμ≤∫D1 dμ=1 by finite additivity and [F3]; if ∑aWa=1 pointwise, the middle integral equals μ(D)=1. This is (d).

2.1step 1.1F1algebra

[Integrated identity] Let B∈A. Integrating the identity of step 1.1 over B is legitimate because all three terms are integrable on B by step 1.1 and [F1]; the integral of the left side is ∫B∥a+b∥2dx and the integral of the right side is ∫B∥a∥2dx+∫B∥b∥2dx+2Re⁡⟨a,b⟩B, which is the displayed identity of (a).

3.1step 2.1F2F3F4algebra

[Coherent law] Assume ∥a+b∥>0. The set function B↦∫B∥a+b∥2dx is a finite measure with total mass ∥a+b∥2 by [F2], and ∥a+b∥2∈(0,∞); dividing by this constant gives a finite measure of total mass one, hence a probability measure by [F4], whose value at B is pcoh(B) with denominator N+2c by step 2.1 applied to B=D. This is (b).

4.1step 1.2step 1.3step 2.1step 3.1F1F2algebra∎

[Coincidence criterion] Assume the hypotheses of (e), including ∥a+b∥>0. By steps 2.1 and 1.2 with w=w∗, p∗(B)=1N∫B(∥a∥2+∥b∥2)dx and pcoh(B)=∫B(∥a∥2+∥b∥2)dx+2c(B)N+2c with c(B):=Re⁡⟨a,b⟩B; since N>0 and N+2c=∥a+b∥2>0, the equality pcoh(B)=p∗(B) is equivalent to Nc(B)=c M(B) for the finite measure M(B):=∫B(∥a∥2+∥b∥2)dx. The signed measure Nc(⋅)−c M(⋅) vanishes on every B∈A if and only if its density NRe⁡⟨a(x),b(x)⟩Cr−c(∥a(x)∥2+∥b(x)∥2) vanishes dx-almost everywhere by [F2], since a nonzero integrable density has a level set of strictly positive or strictly negative integral. This is the displayed criterion; if ⟨a(x),b(x)⟩=0 a.e., then c=0 and c(B)=0 for every B, so the laws coincide, and if c=0 the criterion reduces to Re⁡⟨a(x),b(x)⟩=0 a.e. This proves (e), and steps 1.1, 1.2, 1.3, 2.1, 3.1 prove the remaining clauses.

Remarks

  • Convention. The pairing is linear in the first argument, as fixed by the cited L2 items, so the cross term of a sum a+b is 2Re⁡⟨a,b⟩ and not 2Re⁡⟨b,a⟩; the two agree because the real part is symmetric.
  • What is not asserted. The lemma is an identity and inequality package for classes and weights; it produces no detector law, no state update, no sample of trials and no measured frequency. The coincidence criterion concerns the two declared laws, not the question of which preparation a laboratory realizes.
DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The declared two-path preparation model and its ideal detection bins

Physical scope

A declared preparation and detection model for a two-path interference arrangement in the massive spin-s model of the framework: two declared nonzero path-component classes of the model state space, the coherent preparations of a declared relative phase, the declared incoherent (which-path) preparations with declared weights, and the ideal detection-bin reading of the model's joint position observable. The model is a declaration of the apparatus and preparation assignment in the sense of the preparation and apparatus postulate P7; it asserts no derivation of the path decomposition from the framework, no claim that any particle took a definite path, no detector response or sampling model, no experiment and no empirical result. Spatial bins are regions of R^3; a lower-dimensional material screen and any marginal or flux reduction of a state to it are separate models, not claimed here.

Definition

(a) Framework data and state convention. Adopt the state and composition postulate P1, the observable and probability postulate P2, the kinematics and one-particle model postulate P5, the identical-particle and spin postulate P6, and the preparation and apparatus discipline P7 (State and composition postulate P1: Hilbert spaces, preparations and composite systems, Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, Identical-particle and spin assignments P6: permutation sectors and finite-spin representations, Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions). Fix a spin label s∈{0,12,1,32,… }, put r:=2s+1, and fix a mass parameter m>0. P5 assigns the one-particle state space Hs:=L2(R3;Cr) with almost-everywhere equivalence classes and pairing ⟨f,g⟩:=∫R3∑l=1rfl(x)gl(x)‾ dx, linear in the first argument (Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, The space Lp(μ) as the quotient by null functions, Real and complex inner-product spaces and their induced length). P1 identifies a pure preparation with the ray [ψ]:={zψ:z∈C∖{0}} of a unit vector ψ and a general preparation with a density operator, meaning a bounded self-adjoint positive trace-class operator ρ with tr⁡ρ=1 (State and composition postulate P1: Hilbert spaces, preparations and composite systems, Trace class operator, Self-adjoint, positive, unitary and normal operators). Write D(Hs):={ρ:ρ is a bounded self-adjoint positive trace-class operator on Hs and tr⁡ρ=1} for the set of general preparations.

For a unit vector u, define Puf:=⟨f,u⟩u. By Cauchy--Schwarz (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs), ∥Puf∥=∣⟨f,u⟩∣≤∥f∥, so Pu is bounded. Then Pu2=Pu and Pu is self-adjoint because for f,g∈Hs, ⟨Puf,g⟩=⟨f,u⟩⟨u,g⟩=⟨f,Pug⟩. Moreover ⟨Puf,f⟩=∣⟨f,u⟩∣2≥0 by the inner-product identities and ⟨u,u⟩=1. Its range is Cu, so it has finite rank and is trace class by Trace class operator. The one-term nuclear representation Puf=⟨f,u⟩u gives tr⁡Pu=⟨u,u⟩=1 by Trace is absolutely convergent and basis independent. Thus Pu is a density operator. For ψ≠0 define ρ^(ψ):=Pψ/∥ψ∥,ρ^(ψ)f=⟨f,ψ⟩ψ∥ψ∥2. For every nonzero scalar z, conjugate-linearity in the second argument and ∥zψ∥2=∣z∣2∥ψ∥2 give ρ^(zψ)f=⟨f,zψ⟩zψ∥zψ∥2=∣z∣2⟨f,ψ⟩ψ∣z∣2∥ψ∥2=ρ^(ψ)f, so the pure density operator depends only on the ray.

Position PVM and Born-density calculation. P5 assigns the componentwise position operators Qjf=xjf on D(Qj):={f∈Hs:xjf∈Hs},j=1,2,3. Each Qj is self-adjoint on this domain. To see density, for f∈Hs put fn=1{∣xj∣≤n}f; then fn∈D(Qj) and fn→f in Hs by dominated convergence. If f,g∈D(Qj), then ⟨Qjf,g⟩=⟨f,Qjg⟩ because xj is real-valued and both products are integrable by Cauchy--Schwarz. If g∈D(Qj∗) with Qj∗g=h, let En={x:∣xj∣≤n}. For every q∈Hs supported in En, one has q∈D(Qj) and ⟨q,(xjg−h)1En⟩=0 by the defining adjoint identity. The vector (xjg−h)1En lies in Hs because xj is bounded on En; taking it for q shows xjg=h almost everywhere on En. Since En↑R3, xjg=h∈Hs almost everywhere, so g∈D(Qj) and Qj∗g=Qjg. Symmetry gives the reverse domain inclusion; hence Qj=Qj∗ by Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators.

For a Borel set S⊆R3, define the indicator multiplication operator M1S:Hs→Hs by (M1Sf)(x):=1S(x)f(x) almost everywhere. This is independent of the representative of the L2 class and is bounded, since ∥M1Sf∥2=∫S∥f(x)∥Cr2dx≤∥f∥2. It is linear and a bounded operator with bound one (A bounded linear operator between normed spaces). It is an orthogonal projection: 1S2=1S and the real indicator multiplier is self-adjoint for the declared pairing.

For Borel C⊆R, define Ej(C):=M1{x:xj∈C}. Each value is a bounded orthogonal projection since ∥1{x:xj∈C}f∥≤∥f∥, and Ej(∅)=0, Ej(R)=I, and Ej(C∩D)=Ej(C)Ej(D). For a disjoint sequence (Cn) with union C, the squared norm of Ej(C)f−∑n≤NEj(Cn)f equals ∫{x:xj∈C∖∪n≤NCn}∥f(x)∥2dx, which tends to zero by dominated convergence; hence Ej is strongly countably additive. Its scalar measures are finite Borel measures ⟨Ej(C)f,f⟩=∫{x:xj∈C}∥f(x)∥2dx, and are regular on R by Locally finite Borel measures on second-countable LCH spaces are regular. The push-forward integral identity ∫Rg(λ)d⟨Ej(λ)f,f⟩=∫R3g(xj)∥f(x)∥2dx holds first for indicators and nonnegative simple functions and then for nonnegative measurable g by monotone convergence. In particular the domain of ∫λ dEj(λ) is exactly D(Qj) by the same identity with g(λ)=λ2. For bounded Borel g, the bounded PVM calculus equals multiplication by g(xj): this holds for indicators by the definition of Ej, for finite simple functions by linearity, and for bounded Borel functions by uniform simple approximation and the norm bound of the bounded calculus (Bounded borel pvm integral). Therefore the truncations of the unbounded integral are multiplication by xj1{∣xj∣≤n}. For f∈D(Qj) these converge in Hs to xjf, since the squared tail norm is ∫{∣xj∣>n}xj2∥f(x)∥2dx→0 by dominated convergence. Thus ∫λ dEj(λ)=Qj on exactly D(Qj), and the regular spectral theorem identifies Ej as the spectral PVM of Qj (Integral of a measurable function against a projection-valued measure, Spectral theorem for unbounded self-adjoint operators (PVM form)).

Define the joint position PVM by G(B):=M1B(B⊆R3 Borel). For each f, ∥G(B)f∥≤∥f∥, so its values are bounded; indicator multiplication gives its projection, identity, and intersection laws. Strong countable additivity follows from dominated convergence applied to ∥f∥2. Its scalar measures are B↦∫B∥f(x)∥2dx, finite regular Borel measures on R3. On coordinate rectangles, G(C1×C2×C3)=E1(C1)E2(C2)E3(C3). The rectangles generate B(R3); the published Borel-product and finite-measure uniqueness theorems show that these rectangle values uniquely determine the joint PVM (The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}, Finite measures agreeing on a generating pi-system and on the whole space are equal, Scalar and complex measures from a pvm): for any two candidate PVMs, their finite scalar measures agree on the generating rectangles and on the whole space, so they agree on every Borel set; the polarization identity in the last lemma then gives equality of the operator values. This constructs the mathematical joint position PVM; a physical joint detector reading is supplied only for the finite effect families declared below. For a density operator ρ define μρG(B):=tr⁡(ρG(B)) for each Borel B⊆R3. Since G is a PVM, this set function is a probability measure by the general density/PVM calculation used in clause (ii) of P2. For a finite Borel partition (Ba)a=1m, the operators G(Ba) are orthogonal projections and sum to I. For each f∈Hs, ⟨G(Ba)f,f⟩=∥G(Ba)f∥2∈[0,∥f∥2], so they are bounded effects with 0≤G(Ba)≤I in quadratic-form order. Clause (iv) of P2 therefore assigns the channel probabilities pa(ρ)=μρG(Ba); the two-channel partition (B,R3∖B) assigns μρG(B) to bin B (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes). Thus G is the mathematical joint position PVM, while the detector reading used here is the declared finite-effect model of P2(iv); this does not assert that every three sharp coordinate measurement is jointly realized by a laboratory apparatus. For a unit vector u, the trace formula for the rank-one operator Pu gives μPuG(B)=tr⁡(PuG(B))=∥G(B)u∥2=∫B∥u(x)∥Cr2dx, and P7(iii) leaves identification of this ideal detector with a concrete apparatus as a tested physical claim with uncertainty.

Assume the Axiom of Countable Choice and the Axiom of Choice as required by the cited trace and spectral suppliers (The Axiom of Countable Choice (ACω), The Axiom of Choice).

(b) Declared two-path assignment. A declared two-path preparation model of the apparatus is the assignment of two nonzero classes ψ1,ψ2∈Hs, called the path components of the model with respect to the declared pair of alternative path conditions of the apparatus, together with a declared relative phase φ∈R and a declared weight w∈[0,1]. The assignment of ψ1,ψ2, φ and w is part of the preparation model in the sense of clause (i) of P7 (Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions): it is declared, not computed from the framework, and no item of this page asserts that a particle described by the model "took" one of the two paths.

(c) Coherent preparation. The declared two-path model is admissible at phase φ when ψ1+eiφψ2≠0 in Hs. When it is admissible, the coherent preparation of relative phase φ is the pure preparation ρcoh(φ):=ρ^(ψ1+eiφψ2), the normalized rank-one density operator defined in clause (a). The relative phase φ is read in radians (dimensionless). Multiplying both path components by one common nonzero scalar leaves their associated pure density operator unchanged, while the declared relative phase remains part of the preparation assignment.

(d) Incoherent preparation. For a declared weight w∈[0,1] the incoherent preparation, or which-path preparation, of the model is ρmix(w):=w ρ^(ψ1)+(1−w) ρ^(ψ2). It is a density operator: both summands are positive trace-class operators of trace one; trace-class operators form a vector space, nonnegative real combinations preserve positivity and self-adjointness, and the trace is linear, so tr⁡ρmix(w)=w+(1−w)=1 (Trace class is a two sided Banach operator ideal, Trace is absolutely convergent and basis independent). The weight w is a declared preparation weight, not an outcome probability.

(e) Ideal detection bins. A declared ideal detector of the model is a finite family B=(Ba)a=1m of pairwise disjoint Borel subsets of R3 with ⋃aBa=R3; the ideal bin probabilities of a preparation ρ∈D(Hs) are the numbers pa(ρ):=μρG(Ba)=tr⁡(ρ G(Ba))(a=1,…,m), the reading of the finite-effect clause (iv) of P2 for the declared detector and its mathematical joint position PVM (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Projection valued measure). By clause (iv) of P2 these numbers are nonnegative, are at most one, and satisfy ∑apa(ρ)=1. A single declared bin B is the two-element ideal detector (B,R3∖B); its probability is μρG(B).

For the ideal support, choose a Lebesgue-measurable representative f of the unit L2 class and form Sf:={x:∥f(x)∥Cr>0}. The ideal support is the class of Sf under equality up to a Lebesgue-null symmetric difference. This class is independent of the representative, and it is not asserted to be a Borel detector bin.

(f) Status and scope. Clauses (a)-(e) fix the model data of the pair: the framework reading, the declared path components and preparations, and the ideal bin reading of the position observable. They adopt no assumption beyond P1, P2, P5, P6, P7 and the cited mathematics; the declaration of ψ1,ψ2,φ,w and of the bins is an apparatus-model input, and the claim that a concrete two-slit apparatus realizes a particular such declaration is a tested identification with uncertainty under P7(iii). The declared bins are subsets of R3; the model does not claim that a physical screen of lower dimension is literally a spatial region, and a marginal, coarse-graining or flux reduction of a state to a screen coordinate or surface is a separate detection model, not supplied here. No dynamics, no recorded-event response, no sampling model and no empirical result is asserted; the recorded-event and sampling models are declared separately on this page.

Remarks

  • Classes, not functions. The path components are almost-everywhere classes; pointwise values such as ψj(x) are read only through the measurable representatives, densities and pairings defined above, and the interference identities of the page hold up to null sets.
  • "Path" is a declared decomposition. The phrase "path component" names an element of the declared decomposition of the preparation model. The pair proves laws of the declared coherent and incoherent preparations; it does not assert which-path ontology, does not assign a trajectory to the particle, and does not assume that the two components are orthogonal or have disjoint ideal supports. Whether a preparation model with an orthogonal or disjoint-support decomposition describes a given apparatus is a physical identification under P7.
  • Units. The outcome sets are sets of position with unit metre, the probability numbers are dimensionless, and the phase is read in radians (Dimensions, SI unit conventions and quantity types of the framework).
DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The declared recorded detector and sampling model of the two-path arrangement

Physical scope

A declared finite recorded-outcome detector model and a declared sampling model for the two-path arrangement of the pair: bounded measurable recorded weights, their multiplication effects and the completed finite effect family including a no-record channel, the recorded probability reading of the unsharp finite-outcome clause of the observable and probability postulate P2, the conditioned recorded law, and the assumption of finitely many independent and identically distributed trials with a declared fringe criterion. The item asserts no detector realization, no calibration, no measured counts and no statistical-inference conclusion; the recorded-event probabilities are read from the declared effects, and the identification of a concrete apparatus with these effects and of its repetitions with the sampling model is a tested identification with uncertainty under the preparation and apparatus postulate P7.

Definition

Adopt the declared two-path preparation model of The declared two-path preparation model and its ideal detection bins, the unsharp finite-outcome clause (iv) of the observable and probability postulate P2, and the preparation and apparatus discipline P7 (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions). Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The following vocabulary is used by this page.

(a) Declared recorded detector. A declared recorded detector of the arrangement is a finite set A of recorded outcome labels with 0∉A, together with measurable recorded weights wa:R3→[0,1] for a∈A such that ∑a∈Awa(x)≤1 for almost every x∈R3. The effect of the label a is the multiplication operator Fa:=Mwa,(Mwψ)(x):=w(x)ψ(x)a.e., on Hs=L2(R3;Cr), and the no-record effect is F0:=I−∑a∈AFa. The multiplier is a well-defined linear map on almost-everywhere classes, since changing a representative on a null set changes its product only on that null set. Each Fa is bounded: for ψ∈Hs, ∥Mwaψ∥2=∫R3wa(x)2∥ψ(x)∥Cr2dx≤∥ψ∥2, so the boundedness inequality holds with bound C=1 by monotonicity of the nonnegative integral (Monotonicity and nonnegative homogeneity of the nonnegative integral). Thus Fa is a bounded linear operator (A bounded linear operator between normed spaces). Because wa is real, the componentwise pairing gives ⟨Mwaψ,ϕ⟩=⟨ψ,Mwaϕ⟩ for all ψ,ϕ∈Hs; hence Fa is self-adjoint by The Hilbert-space adjoint of a bounded operator. At almost every x, the finite-dimensional operator wa(x)ICr is nonnegative in the sense of Non-negative and positive operators, and therefore 0≤⟨Faψ,ψ⟩=∫R3wa(x)∥ψ(x)∥Cr2dx≤∥ψ∥2. Here 0≤Fa≤I means these quadratic-form inequalities for every ψ∈Hs.

Define w0(x):=max⁡{0,1−∑a∈Awa(x)}. This is measurable, 0≤w0≤1, and it equals 1−∑awa almost everywhere by the admissibility condition. Thus F0=Mw0=I−∑aFa on Hs, and the same argument gives 0≤F0≤I and self-adjointness. Consequently ∑a∈AFa+F0=I, so the completed family is a finite family of bounded effects of clause (iv) of P2 (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes).

(b) Recorded probabilities. For a preparation ρ∈D(Hs) the recorded probability of a label a∈A and the no-record probability are ν(a):=tr⁡(ρFa),ν(0):=tr⁡(ρF0)=1−∑a∈Aν(a), the outcome reading of clause (iv) of P2 for the declared effects (Assigned sharp observables and the outcome law of the framework clause (f) records the reading; the numbers are nonnegative and sum to one). The recorded-event mass is ν(A):=∑a∈Aν(a)=1−ν(0)∈[0,1]. A detector is full-efficiency when ∑awa=1 almost everywhere, so that F0=0 and ν(0)=0 for every preparation. For a fixed preparation ρ, the model loses events when ν(0)>0, and the no-record channel carries this lost mass. A detector that is not full-efficiency can nevertheless have ν(0)=0 for a particular preparation. A declared recorded bin B is the special case with one label a and wa=1B; then Fa=G(B) is the position projection of clause (e) of The declared two-path preparation model and its ideal detection bins, with the position set B read in the metre unit of Dimensions, SI unit conventions and quantity types of the framework, and the recorded probability is the ideal bin probability.

(c) Loss conditioning. When ν(A)>0, the conditioned recorded law is νˉ(a):=ν(a)ν(A)(a∈A). It is a probability measure on the finite set A (Probability measures and probability spaces); it is the law of the recorded label under the declared model conditioned on the occurrence of a record. Conditioning is a statistical operation on the recorded data; it is not a state update, and no claim of P3 is made here.

(d) Sampling model. A declared N-trial sampling model for a fixed preparation ρ is a probability space (Ω,F,P) carrying measurable maps O1,…,ON:(Ω,F)→(A∪{0},P(A∪{0})) (N≥1), where 0 is the no-record label of clause (b) and is distinct from every recorded label because 0∉A. The maps are mutually independent in the sense of Pairwise and mutual independence of finite-valued random variables and identically distributed with P(Ok=a)=ν(a) for every a∈A, P(Ok=0)=ν(0) and every k, where ν is the recorded law of clause (b); the numbers ν(a) and ν(0) sum to one, so this is a probability law on the finite set A∪{0}. The empirical frequency of the label a in the sample is FN(a):=1N#{k:Ok=a}. A declared fringe criterion for sample size N is a subset C⊆(A∪{0})N; the model accepts the sample when (O1,…,ON)∈C and fails the criterion otherwise. The identification of repetitions of a concrete procedure with the independent identically distributed model is an additional statistical assumption in the sense of clause (ii) of P7; it is not a consequence of P1-P6, and correlated trials, drifting preparation, dead time and selection must be modeled or recorded as limitations if present (Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions).

(e) Status. Clauses (a)-(d) fix the recorded-detector and sampling vocabulary of the pair and read clause (iv) of P2 and clauses (i)-(iii) of P7. The recorded weights, the label set, the conditioning convention and the sampling model are declared apparatus and procedure inputs. The claim "this apparatus realizes the effect family Fa" and the claim "its repetitions are independent and identically distributed draws of ν" are physical identifications with uncertainty under P7(iii) and P7(ii), can fail, and are not derived here. No calibration, efficiency, background or resolution value is asserted, no counts are recorded, and no statistical-inference conclusion is drawn by this definition.

Remarks

  • Relations between the detector families. The ideal detector of clause (e) of The declared two-path preparation model and its ideal detection bins is the full-efficiency case wa=1Ba of a declared recorded detector whose labels partition the bin family; a general recorded detector with non-indicator weights represents finite resolution, response and efficiency through its weights, and its no-record channel represents lost events.
  • No state update is declared. The item declares outcome probabilities only. Which post-measurement state, if any, a registration leaves behind is a separate instrument-model question and is not part of this page.
Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Coherent and which-path detection laws of the declared two-path model

Physical scope

The detection laws of the declared two-path preparation model of the massive spin-s model of the framework: the normalized coherent bin law with its amplitude cross term, the which-path (incoherent) bin law, and the criterion under which the two declared laws coincide on every bin, with the phase-zero criterion conditional on the coherent preparation being admissible at phase zero. The statement is a conditional consequence of P1, P2, P5 and P6, the declared apparatus and preparation assignment in the sense of P7, and the cited published mathematics plus the local calculations in its proof. It asserts no which-path ontology, no entanglement or marker interaction, no detector response, no dynamics and no empirical result; the coherent and the which-path law are properties of two declared preparation models, and the identification of a concrete arrangement with either model is a tested identification with uncertainty.

Statement

Adopt the state and composition postulate P1, the observable and probability postulate P2, the kinematics and massive-particle model postulate P5 and the internal-factor postulate P6, as read by The declared two-path preparation model and its ideal detection bins, and the preparation and apparatus discipline P7, and adopt the declared two-path preparation model of that definition with path components ψ1,ψ2∈Hs=L2(R3;Cr), relative phase φ∈R and weight w∈[0,1] (State and composition postulate P1: Hilbert spaces, preparations and composite systems, Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, Identical-particle and spin assignments P6: permutation sectors and finite-spin representations, Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions). Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Let G(B)=M1B be the joint position PVM constructed in clause (a) of The declared two-path preparation model and its ideal detection bins, and read its outcome law by P2 as μρG(B)=tr⁡(ρG(B)) (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes). Put N:=∥ψ1∥2+∥ψ2∥2,Z(B):=∫B⟨ψ1(x),ψ2(x)⟩Crdx,Z:=Z(R3),c(B):=Re⁡Z(B),c:=c(R3). Then:

(a) Coherent law. If the declared model is admissible at phase φ, then for every Borel set B⊆R3 μρcoh(φ)G(B)=∫B∥ψ1(x)+eiφψ2(x)∥Cr2 dx∥ψ1+eiφψ2∥2, and the numerator expands as ∫B(∥ψ1∥2+∥ψ2∥2)dx+2Re⁡(e−iφ∫B⟨ψ1(x),ψ2(x)⟩Crdx), with denominator N+2Re⁡(e−iφZ); in particular ∥ψ1+eiφψ2∥2>0.

(b) Which-path law. For the declared weight w∈[0,1] and every Borel set B⊆R3, μρmix(w)G(B)=w ∫B∥ψ1∥2 dx∥ψ1∥2+(1−w) ∫B∥ψ2∥2 dx∥ψ2∥2.

(c) Coincidence criterion. Let w∗:=∥ψ1∥2/N, so that μρmix(w∗)G(B)=N−1∫B(∥ψ1∥2+∥ψ2∥2)dx. If the declared model is admissible at phase 0, then μρcoh(0)G(B)=μρmix(w∗)G(B) for every Borel set B if and only if NRe⁡⟨ψ1(x),ψ2(x)⟩Cr=c (∥ψ1(x)∥Cr2+∥ψ2(x)∥Cr2)for almost every x. In particular, if ⟨ψ1(x),ψ2(x)⟩Cr=0 for almost every x, then the coherent law of phase 0 and the which-path law of weight w∗ agree on every bin; and if c=0, then, under phase-0 admissibility, they agree if and only if Re⁡⟨ψ1(x),ψ2(x)⟩Cr=0 for almost every x.

(d) Scope. Clauses (a)-(c) are conditional on P1, P2, P5, P6 and the declared model, and identify the laws of exactly two declared preparations. They assert no path ontology, use no entangled marker state and no reduced state, assert no detector response, no loss, no sampling model, no dynamics and no empirical result.

Facts & Assumptions

Given: P1, P2, P5, P6 and P7 as stated; the Axiom of Countable Choice and the Axiom of Choice; nonzero ψ1,ψ2∈Hs; the phase φ, weight w∈[0,1], Borel B⊆R3, and, for clause (c), admissibility at phase 0.

[F1]

Position law. For a unit vector u the declared joint position PVM satisfies μ[u]G(B)=∥G(B)u∥2=∫B∥u(x)∥2dx, and for a density operator ρ P2 gives μρG(B)=tr⁡(ρG(B)) (The declared two-path preparation model and its ideal detection bins clause (a), Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes). Indeed, PuG(B)f=⟨f,G(B)u⟩u is a one-term nuclear representation, so its trace is ⟨u,G(B)u⟩=∥G(B)u∥2 (Trace is absolutely convergent and basis independent).

[F2]

Finite trace linearity. If ρ1,ρ2 are density operators and λ∈[0,1], then tr⁡((λρ1+(1−λ)ρ2)G(B))=λtr⁡(ρ1G(B))+(1−λ)tr⁡(ρ2G(B)), because the trace is linear and each ρjG(B) is trace class: G(B) is bounded and trace-class operators form a two-sided ideal (Trace is absolutely convergent and basis independent, Trace class is a two sided Banach operator ideal).

[F3]

Declared preparations. The coherent preparation is ρ^(ψ1+eiφψ2) when that vector is nonzero; the which-path preparation is wρ^(ψ1)+(1−w)ρ^(ψ2) (The declared two-path preparation model and its ideal detection bins clauses (c)-(e)).

[F4]

Local cross-term identity and integrability. For measurable representatives of a,b∈L2(R3;Cr), finite-dimensional inner-product expansion gives ∥a(x)+b(x)∥2=∥a(x)∥2+∥b(x)∥2+2Re⁡⟨a(x),b(x)⟩ almost everywhere. The cross term is integrable since ∣⟨a(x),b(x)⟩∣≤∥a(x)∥∥b(x)∥ and ∫∥a∥∥b∥≤∥a∥2∥b∥2 (Real and complex inner-product spaces and their induced length, Cauchy-Schwarz inequality for L2). Integrating the identity over any Borel B gives the corresponding bin expansion.

Proof

Proof technique: direct; apply P2 and the locally constructed position PVM to the declared preparations, compute the finite trace mixture directly, expand the component cross term, and identify equality of the resulting integrable densities.

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

1.1givenF1F3F4algebra

[Coherent law] Assume admissibility at φ and put u=(ψ1+eiφψ2)/∥ψ1+eiφψ2∥. Then ρcoh(φ)=ρ^(u) by [F3], and [F1] gives μρcoh(φ)G(B)=∫B∥u(x)∥2dx=∫B∥ψ1(x)+eiφψ2(x)∥2dx∥ψ1+eiφψ2∥2. Applying [F4] with a=ψ1 and b=eiφψ2 expands the numerator; conjugate-linearity in the second argument gives the factor e−iφ. At B=R3 the denominator is N+2Re⁡(e−iφZ)>0. This proves (a).

1.2givenF1F2F3algebra

[Which-path law] Let ρj=ρ^(ψj) and uj=ψj/∥ψj∥. By [F1], tr⁡(ρjG(B))=∫B∥uj(x)∥2dx=∥ψj∥−2∫B∥ψj(x)∥2dx. The declared mixture is wρ1+(1−w)ρ2 by [F3]; applying trace linearity [F2] to P2's outcome formula yields (b).

2.1givenstep 1.1step 1.2F2F4algebra∎

[Coincidence criterion] Assume admissibility at phase 0, and define M(B)=∫B(∥ψ1(x)∥2+∥ψ2(x)∥2)dx and cB=Re⁡∫B⟨ψ1(x),ψ2(x)⟩dx. By [F4], the zero-phase coherent law is (M(B)+2cB)/(N+2c), while step 1.2 at w=w∗ gives the which-path law M(B)/N. Since N>0 and N+2c=∥ψ1+ψ2∥2>0, equality of these laws for every Borel B is equivalent to NcB=cM(B) for every B. Define the real integrable function h(x):=NRe⁡⟨ψ1(x),ψ2(x)⟩−c(∥ψ1(x)∥2+∥ψ2(x)∥2). Then equality for every B is equivalent to ∫Bh(x)dx=0 for every Borel B. Since the Lebesgue sigma-algebra is the completion of the Borel Lebesgue measure, every Lebesgue-measurable set differs from a Borel set by a null set, and the integral of h∈L1 is unchanged on such a difference (L(Rn) is exactly the completion of the restriction of λn to the Borel sets). Thus ∫Eh=0 for every Lebesgue-measurable set E. If h is nonzero on a set of positive measure, some set {h≥1/n} or {h≤−1/n} has positive measure; its integral has a strict sign, contradicting that condition. Thus h=0 almost everywhere, and conversely that almost-everywhere relation makes all the integrals vanish. This proves the criterion. If the components are pointwise orthogonal almost everywhere, then c=0 and the relation holds; if c=0, it reduces to Re⁡⟨ψ1(x),ψ2(x)⟩=0 almost everywhere. This proves (c), while steps 1.1 and 1.2 establish (a)-(b); (d) records the stated scope.

Remarks

  • The cross term is physical relative phase. A change of the relative phase φ rotates the complex overlap Z(B), giving the cross term 2Re⁡(e−iφZ(B)), without changing the two path densities; a common phase of ψ1 and ψ2 is immaterial.
  • What the theorem does not claim. It does not assert that the coherent preparation is "more correct" than the which-path preparation, that a particle took a particular path, or that any apparatus realizes either declaration; and it makes no claim about visibility loss by entanglement or path marking, which belongs to the entanglement model of the category.
Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Recorded bin laws, loss and conditioning of the declared two-path detector

Physical scope

The recorded-outcome laws of the declared finite recorded detector of the pair in the coherent and which-path preparations of the declared two-path model, the no-record mass carried by lost events, the conditioned recorded law, the reduction of indicator weights to ideal position bins, and a sufficient condition under which the recorded coherent and which-path laws agree, conditional on phase-zero admissibility when that phase is compared. The statement is a conditional consequence of P2 and the declared preparation and detector models plus the cited mathematics and local calculation; it asserts no detector realization, no calibration, no counts and no empirical result, and identification of a concrete apparatus with the declared effects or sampling model carries uncertainty under P7.

Statement

Adopt the observable and probability postulate P2 in its unsharp finite-outcome reading, the declared two-path preparation model The declared two-path preparation model and its ideal detection bins with path components ψ1,ψ2≠0, relative phase φ and weight w, and the declared recorded detector The declared recorded detector and sampling model of the two-path arrangement with finite label set A satisfying 0∉A, recorded weights wa and effects Fa=Mwa, no-record effect F0=I−∑aFa, recorded probabilities ν(a) and recorded-event mass ν(A)=∑a∈Aν(a) (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes). Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice), the choice hypotheses of the cited trace-class, rank-one and square-root suppliers. Let ρcoh(φ) and ρmix(w) be the declared coherent and which-path preparations and put N:=∥ψ1∥2+∥ψ2∥2, c:=Re⁡⟨ψ1,ψ2⟩ and w∗:=∥ψ1∥2/N. Then:

(a) Recorded coherent law. If the model is admissible at phase φ, then for every label a∈A νcoh(φ)(a)=∫R3wa(x) ∥ψ1(x)+eiφψ2(x)∥Cr2 dx∥ψ1+eiφψ2∥2, and the numerator equals ∫R3wa(∥ψ1∥2+∥ψ2∥2)dx+2Re⁡(e−iφ∫R3wa⟨ψ1,ψ2⟩Crdx).

(b) Recorded which-path law. For the declared weight w∈[0,1] and every a∈A, νmix(w)(a)=w ∫R3wa∥ψ1∥2dx∥ψ1∥2+(1−w) ∫R3wa∥ψ2∥2dx∥ψ2∥2.

(c) Loss. The no-record probability is ν(0)=1−ν(A)=tr⁡(ρF0)≥0, so ν(A)≤1. If ∑awa=1 almost everywhere, then F0=0 and ν(0)=0 for every preparation; if F0≠0, then there is a declared pure preparation with ν(0)>0. When ν(A)>0, the conditioned recorded law νˉ(a)=ν(a)/ν(A) is a probability measure on A.

(d) Ideal bins and coincidence. If wa=1Ba for a declared ideal detector (Ba)a=1m, then ν(a)=μρG(Ba) is the ideal bin probability of Coherent and which-path detection laws of the declared two-path model. Moreover, if the declared model is admissible at phase 0 and if the almost-everywhere relation NRe⁡⟨ψ1(x),ψ2(x)⟩Cr=c (∥ψ1(x)∥Cr2+∥ψ2(x)∥Cr2) of clause (c) of that theorem holds, then the recorded coherent law of phase 0 and the recorded which-path law of weight w∗ agree, νcoh(0)(a)=νmix(w∗)(a), for every label a of every declared recorded detector.

(e) Scope. Clauses (a)-(d) are conditional on P2, the declared preparation and detector models and the cited mathematics; they assert no calibration, no resolution, background or efficiency value, no state update, no counts and no empirical result, and the claim that a concrete apparatus realizes the declared effects is a tested identification with uncertainty.

Facts & Assumptions

Given: The postulates and declared models read as in the statement; the Axiom of Countable Choice and the Axiom of Choice; labels a∈A; preparations ρcoh(φ) and ρmix(w); weights wa and effects Fa=Mwa, F0=I−∑aFa; the constants N,c,w∗.

[F1]

Unsharp finite outcomes. Clause (iv) of P2 states that a finite-resolution apparatus with finitely many channels is described, when the idealization uses bounded effects, by a finite family (Fa)a=1p of bounded operators with 0≤Fa≤I in the quadratic-form order and ∑aFa=I, the outcome probabilities being pa=tr⁡(ρFa)≥0 with ∑apa=1 (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes clause (iv)).

[F2]

Declared recorded detector. The recorded weights wa are measurable [0,1]-valued with ∑awa≤1 almost everywhere, the effects are Fa=Mwa and F0=I−∑aFa with 0≤Fa,F0≤I and ∑aFa+F0=I, the recorded probabilities are ν(a)=tr⁡(ρFa) and ν(0)=tr⁡(ρF0)=1−∑aν(a), the recorded-event mass is ν(A)=∑aν(a), and the conditioned recorded law is νˉ(a)=ν(a)/ν(A) when ν(A)>0 (The declared recorded detector and sampling model of the two-path arrangement clauses (a)-(c)). In particular ∑awa=1 almost everywhere exactly when F0=0.

[F3]

Rank-one pairing. For unit u and bounded self-adjoint multiplication operator MW, the normalized rank-one preparation is Puf=⟨f,u⟩u. Its product satisfies PuMWf=⟨f,MWu⟩u, a one-term nuclear representation, so its trace is ⟨u,MWu⟩ by the published trace formula (Trace class operator, Trace is absolutely convergent and basis independent).

[F4]

Trace calculus. The trace is linear in its trace-class variable and the trace-class operators form a two-sided ideal, so tr⁡(ρ(F+G))=tr⁡(ρF)+tr⁡(ρG) for a preparation ρ and bounded F,G (Trace is absolutely convergent and basis independent, Trace class is a two sided Banach operator ideal).

[F5]

Weighted bin identity. For a,b∈L2(R3;Cr) and measurable 0≤W≤1, choose measurable representatives and expand the finite-dimensional norm pointwise. This gives ∫W∥a+b∥2dx=∫W(∥a∥2+∥b∥2)dx+2Re⁡∫W⟨a,b⟩dx. The cross term is integrable because W∣⟨a,b⟩∣≤∥a∥∥b∥ and Cauchy--Schwarz gives ∫∥a∥∥b∥≤∥a∥2∥b∥2 (Real and complex inner-product spaces and their induced length, Cauchy-Schwarz inequality for L2).

[F6]

Declared preparation laws. The coherent and which-path laws are those of Coherent and which-path detection laws of the declared two-path model clauses (a)-(b); its clause (c) coincidence relation is used only when the model is admissible at phase 0.

[F7]

Positive square root. Assume the Axiom of Choice. Every bounded positive operator T on a nonzero complex Hilbert space has a bounded positive square root T1/2 with T1/2T1/2=T; if Tx≠0 then T1/2x≠0, so ⟨Tx,x⟩=∥T1/2x∥2>0 (Positive square root).

[F8]

Probability measures on a finite set. A probability measure on a σ-algebra A is a measure with total mass one (Probability measures and probability spaces, Measures on sigma-algebras); on a finite set with the σ-algebra of all subsets, a nonnegative function of the atoms whose values sum to one extends uniquely to a probability measure, because finite additivity is read off the atoms and every countably disjoint family has only finitely many nonempty members.

Proof

Proof technique: direct; compute the trace pairing of a pure preparation with a multiplication effect by its one-term nuclear representation, substitute the declared preparations and use trace linearity for the mixture, read loss off the completed effect family, and integrate the weighted cross-term identity.

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

1.1givenF3algebra

[Pure-state pairing] Let ψ≠0, set u=ψ/∥ψ∥, and let [given, F3, algebra] W be a measurable [0,1]-valued weight. Since MW is self-adjoint, ρ^(ψ)MWf=PuMWf=⟨MWf,u⟩u=⟨f,MWu⟩u=Tu,MWuf. This is a one-term nuclear representation, so [F3] gives tr⁡(ρ^(ψ)MW)=⟨u,MWu⟩=∫R3W(x)∥ψ(x)∥2dx∥ψ∥2.

2.1givenF2F4F5step 1.1algebra

[Recorded laws] For the coherent preparation, [F2] and step 1.1 with [given, F2, F4, F5, step 1.1, algebra] ψ=ψ1+eiφψ2 and W=wa give νcoh(φ)(a)=∫wa∥ψ1+eiφψ2∥2dx∥ψ1+eiφψ2∥2; substituting [F5] gives the stated expansion. For the which-path preparation, [F4] gives tr⁡(ρmix(w)Fa)=wtr⁡(ρ^(ψ1)Fa)+(1−w)tr⁡(ρ^(ψ2)Fa), and step 1.1 with ψ=ψj gives (b).

2.2givenF1F2F7step 1.1algebra

[Loss] The completed family (Fa)a∈A∪{F0} has nonnegative [given, F1, F2, F7, step 1.1, algebra] bounded effects summing to the identity by [F2]. Thus [F1] gives ν(a)≥0, ν(0)≥0 and ν(0)+∑aν(a)=1, whence ν(0)=1−ν(A) and ν(A)≤1. If ∑awa=1 almost everywhere, then F0=0 and ν(0)=0 for every preparation. Conversely, if F0≠0, choose x with F0x≠0. By [F7], F01/2x≠0 and ⟨F0x,x⟩=∥F01/2x∥2>0. The pure preparation of ψ=x/∥x∥ then has ν(0)=tr⁡(ρ^(ψ)F0)=∥x∥−2⟨F0x,x⟩>0 by step 1.1. This proves the unconditioned loss claims of (c).

3.1givenstep 2.1F2F8algebra

[Conditioning] When ν(A)>0, the recorded probabilities of step 2.1 [given, step 2.1, F2, F8, algebra] are nonnegative and sum to ν(A), so the finite-set function νˉ(a)=ν(a)/ν(A) is nonnegative and sums to one. It therefore extends to a probability measure on A by [F8]. This completes (c).

4.1step 2.1step 2.2step 3.1F5F6algebra∎

[Ideal bins and coincidence] If wa=1Ba, then [step 2.1, step 2.2, step 3.1, F5, F6, algebra] Fa=G(Ba) and ν(a)=tr⁡(ρG(Ba))=μρG(Ba) by P2, the ideal bin probability. Under the phase-zero admissibility and coincidence hypotheses of (d), multiply its almost-everywhere relation by wa and integrate. The weighted terms are integrable by [F5], so N∫waRe⁡⟨ψ1,ψ2⟩dx=c∫wa(∥ψ1∥2+∥ψ2∥2)dx. Substitution into the coherent formula of step 2.1 at phase 0 and the which-path formula at weight w∗ gives νcoh(0)(a)=νmix(w∗)(a), since w∗∥ψ1∥−2=N−1. This proves (d); steps 2.1-3.1 prove (a)-(c), and (e) records the scope.

Remarks

  • Where the response enters. The recorded weights wa carry the declared finite resolution and efficiency of the model; the bin partition of the ideal detector is the special case of indicator weights. No value of any weight is asserted, and no apparatus realization is claimed.
  • Conditioning is not a state update. The conditioned law is a statistical operation on the recorded sample; no claim is made about the post-detection state of the particle, and destructive or absorbing detection channels are outside the model's declared effects.
Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Continuity equation and local balance for the massive-model position density

Physical scope

The local squared-amplitude balance of the massive spin-s model in its smooth solution regime: for a componentwise C1-in-time, C2-in-space function satisfying the displayed local Schroedinger equation almost everywhere with the real bounded measurable P5 potential on an open spatial region, its squared-amplitude density and current satisfy the pointwise continuity equation and integrated balance over bounded C1 regions. On an open time interval, its finite total squared-amplitude integral is conserved under explicit domination and surface-flux hypotheses; if normalized at one time, it remains a position probability density. Separately, the P4 unitary flow preserves the norm of every state and the P2 position probability of every unit preparation has total mass one. The statement is conditional on P1, P2, P4, P5 and P6 and the cited published mathematics. It does not assert that the flow of an arbitrary L2 initial vector has a C1-in-time, C2-in-space representative, identify a screen record rate with surface flux, or record an empirical result.

Statement

Adopt the state and composition postulate P1, the observable and probability postulate P2, the autonomous-dynamics postulate P4 and the kinematics and massive-particle model postulate P5 with its internal-factor postulate P6, read through The massive spin-s particle model of the framework: state space, operators, units and frame readings and Assigned energy observable, unitary flow and the two pictures of autonomous evolution (State and composition postulate P1: Hilbert spaces, preparations and composite systems, Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Autonomous dynamics postulate P4: self-adjoint generators and unitary evolution, Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, Identical-particle and spin assignments P6: permutation sectors and finite-spin representations). Assume Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice). Let V0∈L∞(R3;R) be the real bounded measurable P5 potential and choose a bounded real measurable representative V:R3→R; on Ω⊆R3 use its restriction. Fix the P5 constants ℏ>0 and m>0, a spin label s with r=2s+1, a nonempty open spatial region Ω, and a nonempty open time interval I⊆R. Let ψ:Ω×I→Cr have components ψl, ∂tψl, ∂jψl and ∂k∂jψl continuous on Ω×I for all j,k∈{1,2,3}, and suppose the model equation holds for Lebesgue almost every (x,t)∈Ω×I: iℏ ∂tψl(x,t)=−ℏ22mΔψl(x,t)+V(x)ψl(x,t)(l=1,…,r). The displayed equation is the local differential expression assigned by P5/P4; it is a hypothesis here, and ψ is not required to be a global P4 domain vector. P5 assigns Hop=−ℏ2Δ/(2m)+V(Q) on the componentwise W2,2(R3;Cr) domain, and P4 asserts the norm-differentiable equation for vectors in that domain. Existence of a smooth representative for such a global solution is a separate regularity hypothesis (Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators clause (iv), Autonomous dynamics postulate P4: self-adjoint generators and unitary evolution clause (iii)).

Define the squared-amplitude density and its associated current by n(x,t):=∑l=1r∣ψl(x,t)∣2=∥ψ(x,t)∥Cr2,j(x,t):=ℏm∑l=1rIm⁡(ψl(x,t)‾ ∇ψl(x,t))=−ℏmIm⁡⟨ψ(x,t),∇ψ(x,t)⟩Cr. For Ω=R3, when ψ(⋅,t) is a unit vector of Hs, n(⋅,t) is the model's position probability density. Under the local hypotheses stated here, no global normalization or Hs membership is assumed; n is the squared-amplitude density and the same balance equations apply. Accordingly, j is the probability current for a normalized state and the corresponding squared-amplitude current otherwise. The minus sign in the pairing expression follows from the convention that the L2 pairing is linear in its first argument. For each component put jl=(ℏ/m)Im⁡(ψl‾∇ψl). Then:

(a) Pointwise continuity. For every (x,t)∈Ω×I, ∂tn(x,t)+div⁡j(x,t)=0.

(b) Integrated balance. If D⊆Ω is a bounded open set with C1 boundary and D‾⊆Ω (Divergence on a bounded C1 Euclidean domain), then t↦∫Dn(x,t)dx is differentiable on I with ddt∫Dn(x,t) dx=−∫∂Dj(x,t)⋅ν(x) dS, ν the outward unit normal.

(c) Global conservation under domination. If Ω=R3, if for each l there is a nonnegative measurable gl∈L1(R3) with ∣ψl(x,t)∣2≤gl(x) for almost every x and every t∈I, and if lim⁡R→∞sup⁡t∈I∫{∣x∣=R}∣jl(x,t)∣ dS=0 for each l, then t↦∫R3n(x,t)dx is finite and constant on I. In particular, if this integral is 1 at one time, it is 1 throughout I and n(⋅,t) is a position probability density at every time.

(d) Flow conservation. For the model's assigned unitary flow U(t)=exp⁡(−itHop/ℏ) on the model's state space and every ψ0∈Hs, one has ∥U(t)ψ0∥=∥ψ0∥ for every t∈R; consequently the model's position probability of a unit preparation integrates to one at every time, without the regularity hypotheses of (a)-(c), because P4 assigns a unitary group (Autonomous dynamics postulate P4: self-adjoint generators and unitary evolution, Assigned energy observable, unitary flow and the two pictures of autonomous evolution clause (b)).

(e) Units, reading and scope. In the SI conventions of Dimensions, SI unit conventions and quantity types of the framework the position wave function has unit m−3/2, the density n has unit m−3 and the current j has unit m−2s−1; the display of (a) is the local balance of the model's squared-amplitude density in its smooth regime, and (b) reads the rate of change of its integral over a region as minus the outward current flux across its boundary. When ψ is a normalized full-space state, these are the position probability density and probability flux, respectively. The statement does not assert that the flow of an arbitrary L2 initial vector has a representative obeying the regularity hypotheses of (a)-(c), does not identify a recorded screen rate or any detection law with the surface flux (the detection model of this page is the declared effect and bin model), and records no empirical result.

Facts & Assumptions

Given: P1, P2, P4, P5 and P6 as cited; Countable Choice and the Axiom of Choice; ℏ>0, m>0, r=2s+1, open Ω⊆R3, open time interval I, the real bounded measurable P5 potential V, a componentwise C1-in-time and C2-in-space solution of the equation almost everywhere, the density n and current j, and, in (d), ψ0∈Hs and P4's flow U(t).

[F1]

P4/P5 equation and its regularity premise. P5 assigns the componentwise Hamiltonian Hop=−ℏ22mΔ+V(Q) on the W2,2 domain for bounded real measurable V; P4 asserts the equation in the norm-differentiable sense for domain vectors. The Statement separately assumes a function with the displayed classical derivatives and local equation almost everywhere; this local PDE premise does not assert that every such function is a global P4 domain vector. The extra regularity is not inferred for arbitrary L2 initial data (Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators clause (iv), Autonomous dynamics postulate P4: self-adjoint generators and unitary evolution clause (iii)).

[F2]

Componentwise calculus. For a scalar C1-in-time, C2-in-space component u, product differentiation gives ∂t∣u∣2=2Re⁡(u‾∂tu) and div⁡(ℏmIm⁡(u‾∇u))=ℏmIm⁡(∇u‾⋅∇u+u‾Δu)=ℏmIm⁡(u‾Δu), because ∇u‾⋅∇u=∑j∣∂ju∣2 is real (Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0, The Laplacian of a C2 function and of a C2 vector field, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, Divergence and curl are linear and satisfy the scalar product rules).

[F3]

Divergence theorem. For a bounded C1 domain D and a C1 vector field F on D‾, ∫Ddiv⁡F dx=∫∂DF⋅ν dS (Divergence on a bounded C1 Euclidean domain).

[F4]

Differentiation under the integral. On each compact time interval inside I, continuity of ∂tn on the compact set D‾×J gives an integrable constant majorant on bounded D; the differentiation-under-the-integral theorem then yields ddt∫Dn=∫D∂tn (Differentiation under the integral sign).

[F5]

Limits and interval connectedness. Monotone convergence gives ∫BRn→∫R3n as R→∞ for nonnegative n, and the mean value theorem bounds a change by the interval length times the supremum of the derivative (Monotone convergence for the integral, The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)). Differentiability implies continuity (A function differentiable at c is continuous at c). The hypothesis that I is an interval ensures every pair s<t in I is joined by a compact interval in I.

[F6]

P4 flow. The assigned U(t) is unitary for each real t by P4 and the evolution definition, so it preserves the Hilbert norm (Autonomous dynamics postulate P4: self-adjoint generators and unitary evolution, Assigned energy observable, unitary flow and the two pictures of autonomous evolution clause (b)).

[F7]

Units. The position wave function has unit m−3/2, so n has unit m−3; ℏ/m has unit m2s−1, and hence j has unit m−2s−1 (Dimensions, SI unit conventions and quantity types of the framework).

Proof

technique · direct; derive the continuity identity componentwise from the P4/P5 equation, integrate it over bounded regions and expanding balls under the stated regularity and flux assumptions, and read norm conservation directly from P4 unitarity

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

1.1givenF1F2algebra

[Pointwise continuity] For each l, the model equation holds almost everywhere and gives [given, F1, F2, algebra] ∂tψl=iℏ2mΔψl−iℏVψl. By [F2], ∂t∣ψl∣2=2Re⁡(ψl‾∂tψl)=−ℏmIm⁡(ψl‾Δψl), because V∣ψl∣2 is real almost everywhere. The product calculation in [F2] also gives div⁡jl=ℏmIm⁡(ψl‾Δψl), so ∂t∣ψl∣2+div⁡jl=0 almost everywhere. This left side is continuous on Ω×I by the assumed regularity; if it were nonzero at a point, continuity would make it nonzero on an open ball of positive Lebesgue measure. It therefore vanishes everywhere. Summing the finite number of component identities proves (a) and gives ∂tn=−div⁡j.

1.2givenF6algebra

[Flow conservation] By [F6], U(t) is unitary for every t, hence [given, F6, algebra] ∥U(t)ψ0∥=∥ψ0∥. For a unit vector the P2 position law therefore has total mass ∥U(t)ψ0∥2=1 at every time. This proves (d).

2.1givenstep 1.1F3F4

[Integrated balance] Fix t0∈I and choose an open interval [given, step 1.1, F3, F4] J0⊂I containing t0 whose closure J is a compact subset of I. Since D‾×J is compact and ∂tn is continuous, it is bounded there; the constant bound on bounded D is an integrable majorant. Applying [F4] on J0 gives ddt∫Dn=∫D∂tn near t0. By step 1.1 and [F3], this is −∫Ddiv⁡j=−∫∂Dj⋅ν dS. Since t0 was arbitrary, (b) holds on I.

3.1givenstep 2.1F5algebra

[Global conservation] Assume the hypotheses of (c), and fix s<t in [given, step 2.1, F5, algebra] I. Since I is an interval, [s,t]⊂I. For R>0 let BR={x:∣x∣<R} and FR(τ)=∫BRn(x,τ)dx. By (b), ∣FR′(τ)∣=∣∫∂BRj⋅ν dS∣≤∑l=1r∫∂BR∣jl∣ dS. The mean value theorem in [F5] gives ∣FR(t)−FR(s)∣≤(t−s)∑l=1rsup⁡τ∈I∫∂BR∣jl(x,τ)∣dS, whose right side tends to zero as R→∞. For each τ∈{s,t}, the balls increase to R3, so [F5] yields FR(τ)→∫R3n(x,τ)dx. The domination hypothesis makes both limits finite. Letting R→∞ proves equality of the total squared-amplitude integrals at s and t. Since s<t were arbitrary in I, this integral is constant on I, proving (c).

4.1step 1.1step 2.1step 1.2step 3.1F7algebra∎

[Conclusion and units] Steps 1.1, 2.1, 1.2 and 3.1 establish (a)-(d). [step 1.1, step 2.1, step 1.2, step 3.1, F7, algebra] The units in (e) follow from [F7]; its remaining sentences state the scope, and no detection law is identified with the flux.

Remarks

  • The smooth regime is an added hypothesis. The theorem concerns a componentwise C1-in-time, C2-in-space solution of the equation almost everywhere for the bounded measurable P5 potential. The model's assigned flow preserves every state norm by P4, but existence of a representative with the stated regularity is not derived here.
  • Normalization controls the probability reading. The local equation and its global conservation conclusion concern the squared-amplitude density. Under the hypotheses of (c), normalization at one time makes it a probability density throughout the interval; (d) gives this conclusion directly for the unitary flow of a unit preparation.
  • The current is not a detection rate. The current j describes the local balance of the model's squared-amplitude density (or probability density when normalized); it is not by itself the recorded rate of a detector. The pair's recorded-outcome model assigns probabilities through the declared effects of the recorded detector.
Thought experimentStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

A finite sample can fail a criterion that rejects a positive-probability sequence

Physical scope

A hypothetical finite-sampling analysis of the declared two-path arrangement: for a coherent or which-path preparation whose recorded law is fixed, and under the declared independent-and-identically-distributed N-trial sampling model, every declared fringe criterion that rejects at least one outcome sequence of positive probability fails with positive probability, and the empirical frequency of a label concentrates around its recorded probability. The indistinguishability conclusion for the phase-zero coherent and weighted which-path laws assumes that phase zero is admissible. The item is a conditional consequence of the declared preparation and detector models, the declared sampling model in the sense of P7, and published probability suppliers with local calculations. It asserts no measured counts, no p-value, no confidence level, no universal failure probability, and no empirical conclusion about nature; a finite sample without a visible fringe pattern is not a falsification of the coherent model, and a sample with a visible pattern is not a proof of it.

Statement

Adopt the declared two-path preparation model The declared two-path preparation model and its ideal detection bins and the declared recorded detector and sampling model The declared recorded detector and sampling model of the two-path arrangement with finite label set A satisfying 0∉A, recorded law ν (a probability law on A∪{0}, with 0 the distinct no-record label), and the declared N-trial sampling model of clause (d) of that definition; the identification of repetitions with that model is the additional statistical assumption of clause (ii) of the preparation and apparatus postulate P7 (Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions). Fix a preparation ρ, which may be a coherent preparation ρcoh(φ) or a which-path preparation ρmix(w) of the declared model, so that its recorded law is the law ν of Coherent and which-path detection laws of the declared two-path model and Recorded bin laws, loss and conditioning of the declared two-path detector. Let (O1,…,ON) be the outcome sequence, SN(a):=#{k:Ok=a} and FN(a):=SN(a)/N the empirical frequency of a∈A∪{0}. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Then:

(a) Concentration. For every label a and every ε>0, E[FN(a)]=ν(a),Var⁡(FN(a))=ν(a)(1−ν(a))N,P(∣FN(a)−ν(a)∣≥ε)≤ν(a)(1−ν(a))Nε2.

(b) Positive failure probability. Let C⊆(A∪{0})N be a declared fringe criterion, and suppose there is a sequence (a1,…,aN) with (a1,…,aN)∉C and ν(ak)>0 for every k. Then the failure probability of the criterion is P((O1,…,ON)∉C)≥∏k=1Nν(ak)>0. In particular, if ν(a)>0 for some label a, then every criterion that rejects the constant sequence (a,…,a) has failure probability at least ν(a)N>0.

(c) No discrimination between coincident laws. If the model is admissible at phase 0 and the recorded coherent law of phase 0 and the recorded which-path law of weight w∗ coincide in the sense of clause (d) of Recorded bin laws, loss and conditioning of the declared two-path detector, then no criterion whatsoever has different probability of acceptance under the two declared preparations; in particular no finite sample distinguishes them with certainty.

(d) Scope. Clauses (a)-(c) are conditional on the declared preparation, detector and sampling models and the cited mathematics. The independence and identical distribution of the trials are declared model assumptions, not consequences of P1-P6; no failure probability, error rate, p-value, confidence level, power, sample size or measured count is computed or asserted, and no conclusion is drawn about any real apparatus. In particular the statements do not assert that a coherent preparation must show a visible fringe pattern in a finite sample, and do not assert that a sample without a visible pattern falsifies the coherent model.

Facts & Assumptions

Given: The declared preparation, detector and sampling models, with the recorded law ν on A∪{0}; the outcome sequence O1,…,ON and the counts SN(a), FN(a); a declared criterion C and a sequence (a1,…,aN) as in (b); the Axiom of Countable Choice.

[F1]

Independent trials. The random elements O1,…,ON are mutually independent and identically distributed with P(Ok=a)=ν(a) for every a∈A∪{0} (The declared recorded detector and sampling model of the two-path arrangement clause (d), Pairwise and mutual independence of finite-valued random variables).

[F2]

Expectation, variance and concentration suppliers. Expectation is the integral against the probability measure; it is linear for integrable random variables. For a square-integrable real variable X, Var⁡(X)=E[(X−EX)2]; variance adds across a finite pairwise-independent family, and Chebyshev bounds P(∣X−EX∣≥ε)≤Var⁡(X)/ε2 (Expectation of a nonnegative or integrable random variable, Linearity, monotonicity, and the modulus bound for expectation, Moments, variance, and covariance on a probability space, Variance adds for every finite pairwise-independent family, Chebyshev's inequality for random variables).

[F3]

Recorded laws of the declared preparations. The recorded probabilities of the coherent and which-path preparations are those of Coherent and which-path detection laws of the declared two-path model clauses (a)-(b) as read by Recorded bin laws, loss and conditioning of the declared two-path detector clauses (a)-(b); its coincidence conclusion is used only when phase 0 is admissible.

Proof

Proof technique: direct; reduce each label frequency to a sum of pairwise independent Bernoulli indicators, compute its moments and apply Chebyshev, use mutual independence for the selected-sequence event, and compare product laws when the recorded one-trial laws coincide.

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

1.1givenF1algebra

[Indicator marginals and pairwise independence] Fix a∈A∪{0}, [given, F1, algebra] put p=ν(a), and define Xk=1{Ok=a}. Then P(Xk=1)=p and P(Xk=0)=1−p, so Xk is Bernoulli(p) by Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials. For distinct i,j, mutual independence of Oi,Oj, summed over the finite set of outcomes other than a when an indicator is zero, gives P(Xi=1,Xj=1)=p2,P(Xi=1,Xj=0)=p(1−p),P(Xi=0,Xj=1)=p(1−p),P(Xi=0,Xj=0)=(1−p)2. Thus the Xk are pairwise independent.

1.2givenF1algebra

[Positive-probability sequences] Let [given, F1, algebra] E={Ok=ak for every k=1,…,N}. By mutual independence [F1], P(E)=∏k=1Nν(ak)>0. Since the chosen sequence is outside C, E⊆{(O1,…,ON)∉C}, so the failure probability is at least ∏kν(ak). The constant sequence is a special case. This proves (b).

2.1givenstep 1.1F2algebra

[Frequency moments and concentration] Since [given, step 1.1, F2, algebra] FN(a)=N−1∑k=1NXk, expectation linearity gives EFN(a)=p. The two-point law gives Var⁡(Xk)=E[(Xk−p)2]=p(1−p). By [F2], Var⁡(FN(a))=N−2Var⁡(∑k=1NXk)=p(1−p)N. Applying Chebyshev from [F2] with threshold ε>0 gives the bound in (a). This proves (a).

3.1givenF1F3algebrastep 1.2step 2.1∎

[No discrimination] Under the coincidence hypothesis of (c), the [given, F1, F3, algebra, step 1.2, step 2.1] recorded probabilities agree for each a∈A. Their no-record probabilities also agree because ν(0)=1−∑a∈Aν(a). For each sequence in the finite set (A∪{0})N, its probability under the declared IID model is the product of its N one-trial probabilities; these products therefore agree under the two preparations. Summing over any criterion C shows equal acceptance probabilities, proving (c). Steps 2.1 and 1.2 prove (a)-(b), and (d) records that these are conditional model deductions, not empirical results.

Remarks

  • A null result is compatible with the coherent model. By (b), for any criterion that would reject the outcome actually realized in some positive-probability sequence, failure has positive probability under the declared coherent model itself; a finite sample without a visible pattern is therefore not by itself a refutation.
  • A pattern is not a proof. The same computation applies to the which-path model, and (c) shows that when the two recorded laws coincide no criterion distinguishes them. Agreement of a dataset with a declared model is evidence about the combined model, apparatus and sampling assumptions, not a proof of the model.
RemarkRemark: AI-adaptedProof: Not applicableOpen item page →

What the two-path detection page establishes, assumes and defers

Physical scope

Scope of the two-path preparation and detection page: the declared preparation and detector models, the coherent and which-path detection laws with phase-zero admissibility qualifications, the recorded-bin, loss and conditioning laws, continuity and local balance for regular solutions under the bounded measurable P5 potential, interval-scoped global conservation under explicit hypotheses, and the finite-sampling thought experiment. The remark asserts no experiment, records no counts or uncertainties, and makes no claim about nature.

Scope of the page

What is established. The page declares the two-path preparation model The declared two-path preparation model and its ideal detection bins with its path components, coherent and which-path preparations and ideal detection bins, and the recorded detector and sampling model The declared recorded detector and sampling model of the two-path arrangement with its bounded effects, no-record channel, loss conditioning and declared independent trials. Coherent and which-path detection laws of the declared two-path model derives the normalized coherent bin law with its amplitude cross term, the which-path bin law, and the criterion under which the two declared laws coincide on every bin; the criterion comparing phase 0 is conditional on the model being admissible at phase 0. Recorded bin laws, loss and conditioning of the declared two-path detector derives the recorded-bin laws, the no-record mass and conditioned law, the reduction of indicator weights to ideal bins, and a sufficient condition for the recorded laws to coincide when the model is admissible at phase 0. Continuity equation and local balance for the massive-model position density derives the continuity equation and local squared-amplitude balance for componentwise C1-in-time, C2-in-space solutions of the P4/P5 equation almost everywhere with the bounded measurable P5 potential. This density is a position probability density when the full-space state is normalized; under the theorem's domination and surface-flux hypotheses its finite total squared-amplitude integral is conserved on an interval. P4 separately gives norm conservation of the model's flow and total probability one for unit preparations. A finite sample can fail a criterion that rejects a positive-probability sequence shows that, within the declared independent-trials model, a declared fringe criterion that rejects a positive-probability outcome sequence fails with positive probability, and that no criterion distinguishes two recorded laws that coincide.

Adopted rather than derived. The path components, the relative phase, the preparation weight, the recorded weights and the independence of trials are declarations of the preparation and apparatus models in the sense of P7; the identification of a concrete arrangement with these declarations is a tested identification with uncertainty and can fail. The appearance of an interference pattern is not derived for any laboratory apparatus, and no count, efficiency, resolution, background or calibration value appears on this page.

Not claimed. The page does not assert which-path ontology, does not assign a trajectory to the particle between preparation and detection, and does not claim that the coherent preparation is the only admissible model of any apparatus. It makes no claim that a lower-dimensional screen is a spatial region of the model: a marginal, coarse-graining or flux reduction of a state to a screen coordinate or surface is a separate detection model. It also makes none of the following claims: that the flow of an arbitrary L2 initial vector has a C2 representative; that a recorded screen rate equals the surface flux; or that agreement of a finite dataset with a declared law establishes the framework.

Deferred content and destinations. Visibility loss by path marking and entanglement is not established here: the reusable marker-overlap physical result is homed on the entanglement page qm-composites-entanglement-and-reduced-states, and this page neither states nor consumes it. Photon polarization and optical interference are out of scope and belong to the photon and radiation page; the electron double-slit report is reported on the companion examples page, not here. Comparative classical field models and quantum-versus-classical model selection are likewise separate models.

Evidence status. The page contains no experiment and no measured value; the bounded, conditional statements above are consequences of the cited postulates, declarations and mathematics. The companion examples page reports one source-backed electron double-slit experiment with its disclosed limitations, and that report tests the combined model and apparatus assumptions rather than proving them.

5 · Examples, experiments and counterexamples

None yet.

Sources