Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-adaptedprecheck pass
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Dependency tree · 2 levels

Sources