Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

A declared finite phase-averaging model reproduces the which-path law for orthogonal components

Physical scope

An exact computation in the declared two-path preparation model of the pair for a declared statistical ensemble of preparations whose relative phase is uniformly distributed over the finitely many n-th roots of unity, in the case of orthogonal path components: the averaged bin law equals the which-path law with the norm weights, and the cross term averages to zero bin by bin. The example is a conditional computation in the declared model; it asserts no decoherence mechanism, no environmental model, no detector response, no counts and no empirical result, and it does not cover the continuous uniform phase distribution.

Example

Adopt the declared two-path preparation and detection model The declared two-path preparation model and its ideal detection bins with path components ψ1,ψ2≠0 satisfying ⟨ψ1,ψ2⟩=0 (orthogonal components), and the coherent and which-path detection laws Coherent and which-path detection laws of the declared two-path model. Assume the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice), as required by the preparation and detection-law suppliers. Fix an integer n≥2 and declare the finite phase-averaging model: the relative phase takes the n values φk:=2πkn(k=0,1,…,n−1) with equal statistical weight 1/n, so that the averaged bin law of a Borel set B⊆R3 is pˉ(B):=1n∑k=0n−1μρcoh(φk)G(B). Put N:=∥ψ1∥2+∥ψ2∥2 and w∗:=∥ψ1∥2/N. Then:

(a) ∥ψ1+eiφkψ2∥2=N for every k, so every coherent preparation of the declared model has the same normalization N;

(b) the averaged cross term vanishes bin by bin: 1n∑k=0n−12Re⁡(e−iφk∫B⟨ψ1(x),ψ2(x)⟩Crdx)=0;

(c) consequently pˉ(B)=μρmix(w∗)G(B) for every Borel set B: the declared finite phase-averaging model reproduces the which-path law with the norm weights, while each single phase shows the cross term of Coherent and which-path detection laws of the declared two-path model.

The averaging over the phase is a declared statistical model of the preparation ensemble in the sense of clause (ii) of the preparation and apparatus postulate Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions; the computation asserts no decoherence mechanism, no detector response, no counts and no empirical result, and it does not cover the continuous uniform phase distribution, which would require its own integral model.

Verification

Given: The declared model data with ψ1,ψ2≠0, ⟨ψ1,ψ2⟩=0; an integer n≥2 with phases φk=2πk/n; a Borel set B⊆R3; N=∥ψ1∥2+∥ψ2∥2 and w∗=∥ψ1∥2/N; the Axiom of Countable Choice and the Axiom of Choice.

[L1] The coherent and which-path laws are μρcoh(φ)G(B)=∥ψ1+eiφψ2∥−2∫B∥ψ1+eiφψ2∥2dx and μρmix(w)G(B)=w∥ψ1∥−2∫B∥ψ1∥2dx+(1−w)∥ψ2∥−2∫B∥ψ2∥2dx, and the coherent numerator expands as ∫B(∥ψ1∥2+∥ψ2∥2)dx+2Re⁡(e−iφ∫B⟨ψ1,ψ2⟩dx) (Coherent and which-path detection laws of the declared two-path model clauses (a) and (b), The declared two-path preparation model and its ideal detection bins clauses (c)-(e)).

Proof technique: direct; compute the coherent norm under orthogonality, average the cross term over the roots of unity, and read the averaged law off the coherent and which-path formulas.

Given: The data of the statement and [L1]-[L2].

1.1givenL1algebra

[Phase-independent normalization] For every k, [L1] gives ∥ψ1+eiφkψ2∥2=∥ψ1∥2+∥ψ2∥2+2Re⁡⟨ψ1,eiφkψ2⟩=N+2Re⁡(e−iφk⟨ψ1,ψ2⟩)=N, since ⟨ψ1,ψ2⟩=0. This proves (a).

1.2givenL2algebra

[Root sum] The numbers eiφk, k=0,…,n−1, are exactly the n-th roots of unity and ζ↦ζ−1 permutes them, so ∑k=0n−1e−iφk=∑k=0n−1eiφk=0 by [L2].

2.1step 1.1step 1.2L1L2algebra∎

[Averaged law] By step 1.1 each summand of pˉ(B) has denominator N, and by [L1] its numerator is ∫B(∥ψ1∥2+∥ψ2∥2)dx+2Re⁡(e−iφk∫B⟨ψ1,ψ2⟩dx). Averaging the n summands and using linearity of the finite average, the cross term contributes 2NRe⁡((1n∑ke−iφk)∫B⟨ψ1,ψ2⟩dx)=0 by step 1.2, and the remaining term is 1N∫B(∥ψ1∥2+∥ψ2∥2)dx=w∗∫B∥ψ1∥2dx∥ψ1∥2+(1−w∗)∫B∥ψ2∥2dx∥ψ2∥2, since w∗∥ψ1∥−2=N−1=(1−w∗)∥ψ2∥−2; this is μρmix(w∗)G(B) by [L1]. This proves (b) and (c).

Remarks

  • Source scope. Tong supplies the two-slit cross term and discusses which-path monitoring; Binney and Skinner discuss alternative-route amplitudes and spatial averaging over unresolved fringes. Neither cited passage specifies this finite random-phase ensemble. Its hypotheses are declared locally, and its averaged law is proved here using the detection laws and the sum of roots of unity.
  • The averaging is not a dynamics. Nothing here evolves the state or removes coherence dynamically; the computation concerns a declared ensemble of preparations whose relative phase is randomized over a finite set. A continuous uniform phase distribution is a different declared model and is not computed here.
  • Orthogonality is used. The identification of the averaged law with the which-path law uses ⟨ψ1,ψ2⟩=0, which makes the normalization independent of the phase. For non-orthogonal components the averaged law need not coincide with the which-path law, and no claim is made about that case.

Depends on

Dependency tree · 2 levels

Sources