Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck 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.

Consequences of a declared ideal sharp measurement: repeatability and discarded ensembles

Physical scope

A conditional consequence of the adopted ideal conditional-measurement postulate P3 for a declared ideal sharp measurement: the Born outcome probabilities, the selective Lueders conditional states, the certainty of an immediately repeated outcome, the discarded-outcome state as the outcome-weighted mixture of the conditional states, invariance of bounded quantities compatible with the declared measurement under discarding, and the loss of coherence between non-selected branches. The theorem asserts nothing about any laboratory apparatus, about outcome uniqueness or about measurements outside the declared class.

Statement

Adopt the state postulate P1, the observable and probability postulate P2 and the ideal conditional-measurement postulate P3 of the framework (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, Ideal conditional measurement postulate P3: the projective Lueders update and discarded outcomes), and assume the Axiom of Countable Choice, the hypothesis of the cited mathematics. Let (Pa)a∈A be a declared ideal sharp measurement of a system with state space D(H) (Declared ideal measurements and instruments of the framework, The state space of the framework: preparations, pure rays and density operators) and let ρ be a state. Then:

(a) Outcome law. For every outcome label a the probability is pa=tr⁡(ρPa), with pa≥0 and ∑apa=1; for the pure state of a unit vector ψ it is pa=∥Paψ∥2.

(b) Conditional state and repeatability. If pa>0, the conditional state after the outcome a is the state ρa=PaρPa/pa, with tr⁡(ρaPa)=1 and tr⁡(ρaPb)=0 for b≠a. Immediate repetition of the same declared measurement therefore returns the same outcome with certainty: P(second outcome b∣first outcome a)=δab.

(c) Discarded outcomes. The discarded-outcome state Φ(ρ)=∑aPaρPa is a state and coincides with the outcome-weighted mixture of the conditional states, Φ(ρ)=∑a:pa>0paρa, the series converging in trace norm; moreover tr⁡(Φ(ρ)Pa)=pa for every a and Φ(ρ)=∑aPaΦ(ρ)Pa. The conditional-vs-discarded distinction is therefore exactly the distinction between one selected branch ρa and the mixture of all branches.

(d) Compatible bounded quantities. If B is a bounded operator with PaB=BPa for every a, then tr⁡(Φ(ρ)B)=tr⁡(ρB). In particular, if the declared measurement is the spectral measurement of a bounded assigned sharp observable A=∑aaaPa (a finite or norm-convergent series with real aa), then A commutes with every Pa and the mean of A is unchanged by discarding the outcomes.

(e) Loss of coherence. If ψ=αu+βv with u,v orthonormal, u∈ran⁡P1, v∈ran⁡P2 for distinct labels 1≠2, and ρ=Tψ,ψ, then Φ(ρ)=∣α∣2Tu,u+∣β∣2Tv,v,tr⁡(Φ(ρ)(Tu,v+Tv,u))=0, whereas for the coherent preparation tr⁡(ρ(Tu,v+Tv,u))=2Re⁡(αβ‾): the discarded-outcome ensemble is the classical mixture of the branch states and carries no coherence between the ranges of P1 and P2.

(f) Scope. Clauses (a)-(e) are conditional on the adopted P3 and on the mathematical items cited; they do not assert that any laboratory apparatus realizes a declared ideal sharp measurement, do not select a unique recorded outcome, and do not describe the disturbance produced by an apparatus outside the declared class (clause (v) of P3). The identification of a device with a declared measurement is a tested identification with uncertainty under P7.

Facts & Assumptions

Given: The adopted postulates P1, P2, P3; a declared ideal sharp measurement (Pa)a∈A with strong sum I; a state ρ; probabilities pa=tr⁡(ρPa); the discarded-outcome state Φ(ρ)=∑aPaρPa; a bounded operator B commuting with every Pa; vectors ψ,u,v and scalars α,β as in clause (e).

[F1]

Declared measurements. The family (Pa) is a finite or countable family of pairwise orthogonal orthogonal projections with strong sum I, and its Lueders instrument has outcome probabilities pa=tr⁡(ρPa), conditional states ρa=PaρPa/pa for pa>0, and discarded-outcome state Φ(ρ)=∑aPaρPa (Declared ideal measurements and instruments of the framework clauses (a)-(b); Ideal conditional measurement postulate P3: the projective Lueders update and discarded outcomes clauses (i)-(iv)).

[F2]

Selective update. For pa>0 the operator ρa is a state with tr⁡(ρaPa)=1, tr⁡(ρaQ)=0 for every orthogonal projection Q with QPa=0, and PaρaPa=ρa (The selective Lueders update by an orthogonal projection clauses (a)-(c)).

[F3]

Non-selective map. The series Φ(ρ) converges in trace norm; Φ(ρ) is a state; Φ(ρ)=∑a:pa>0paρa; PbΦ(ρ)Pb=PbρPb for every b, so in particular tr⁡(Φ(ρ)Pb)=pb; Φ(ρ)=∑bPbΦ(ρ)Pb; and for bounded B commuting with every Pa one has tr⁡(Φ(ρ)B)=tr⁡(ρB) (The non-selective Lueders map and the discarded-outcome ensemble clauses (a)-(d)).

[F4]

Rank-one pairing. Tu,vx=⟨x,v⟩u is trace class with tr⁡(Tu,v)=⟨u,v⟩, and tr⁡(STu,v)=⟨Su,v⟩ for trace-class S (Rank-one operator calculus clause (b), Nuclear bounded cyclicity for trace-class operators clause (b)).

[F5]

States and mixtures. Under Countable Choice, finite convex combinations of states are states (The state space is convex, closed under countable mixtures, and complete in the trace norm clause (a)); the trace is linear and ∣tr⁡T∣≤∥T∥1, hence trace-norm continuous (Trace is absolutely convergent and basis independent clause 4). The given state implies H≠{0}, as required by the convexity supplier.

Proof

1.1givenF1F2F3F4algebra

[Clause (a)] By [F1] the outcome probabilities of the declared measurement are pa=tr⁡(ρPa). Since 0≤Pa≤I and ρ≥0 with tr⁡ρ=1, positivity of PaρPa and cyclicity give pa=tr⁡(PaρPa)≥0 [F2, F4]. Trace-norm convergence of Φ(ρ)=∑aPaρPa and continuity of the trace give ∑apa=tr⁡Φ(ρ)=1 by [F3]. For a pure preparation, [F1] with the rank-one calculus [F4] gives pa=tr⁡(Tψ,ψPa)=⟨Paψ,ψ⟩=∥Paψ∥2. This is (a).

1.2givenF3F4algebra

[Clause (e)] Under the hypotheses of clause (e), the computation of The non-selective Lueders map and the discarded-outcome ensemble clause (e) applies verbatim to ρ=Tψ,ψ: it gives Φ(ρ)=∣α∣2Tu,u+∣β∣2Tv,v, tr⁡(Φ(ρ)(Tu,v+Tv,u))=0, and tr⁡(ρ(Tu,v+Tv,u))=2Re⁡(αβ‾). This is (e).

2.1step 1.1givenF1F2algebra

[Clause (b)] If pa>0, [F2] gives that ρa is a state with tr⁡(ρaPa)=1; for b≠a the projections Pb and Pa satisfy PbPa=0, so [F2] gives tr⁡(ρaPb)=0. Applying the outcome law of clause (a) to the preparation ρa, the probability of the outcome b in an immediate repetition of the same declared measurement is tr⁡(ρaPb)=δab. This is (b).

3.1step 2.1givenF3F5algebra

[Clause (c)] By [F3], Φ(ρ) is a state and equals the trace-norm convergent series ∑a:pa>0paρa; since tr⁡((paρa)Pb)=δabpa by clause (b) and trace-norm continuity of the trace, summing gives tr⁡(Φ(ρ)Pb)=pb for every b, and [F3] also gives Φ(ρ)=∑bPbΦ(ρ)Pb. This is (c).

4.1step 3.1givenF3algebra

[Clause (d)] If B is bounded and PaB=BPa for every a, [F3] gives tr⁡(Φ(ρ)B)=tr⁡(ρB). If A=∑aaaPa is a bounded assigned sharp observable with real coefficients aa, then APb=∑aaaPaPb=abPb=PbA, so A commutes with every Pa and the identity applies to B=A: the mean tr⁡(ρA) of the bounded observable A is unchanged by discarding the outcomes. This is (d).

5.1step 1.2givenF1F3algebra∎

[Clause (f) and scope] Clauses (a)-(e) were obtained from the adopted clauses of P3 [F1] and the cited mathematical lemmas [F2, F3, F4]; no clause used a claim about a laboratory apparatus, an apparatus dynamics, or a preferred recorded outcome. Clause (v) of P3 explicitly excludes outcome uniqueness and arbitrary apparatuses from the declared class, and P7 makes the identification of a device with the declared measurement a tested identification with uncertainty. This is (f).

Depends on

Dependency tree · 2 levels

Sources