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.

Declared countable instruments: normalization, discarded ensembles and the repeatability criterion

Physical scope

A conditional statement about declared countable instruments of the framework: a normalized countable Kraus family defines outcome effects and probabilities, a trace-preserving discarded-outcome map and conditional updates, and the instrument is repeatable exactly when the Kraus family satisfies the stated algebraic criterion. The theorem asserts no apparatus realization, no preferred outcome and no empirical result; the non-repeatability of general instruments is recorded by an explicit supplied instance.

Statement

Adopt the state postulate P1, the observable and probability postulate P2 and the ideal conditional-measurement postulate P3 (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 H be the nonzero complex Hilbert space assigned to a declared system (The state space of the framework: preparations, pure rays and density operators), and let (Ma)a≥1 be a declared normalized countable Kraus family on H: bounded operators with ∑a=1NMa∗Ma⟶Istrongly as N→∞. Declare the countable instrument with outcome set {1,2,… }, effects Fa:=Ma∗Ma, outcome probabilities pa:=tr⁡(ρFa), conditional updates ρa:=MaρMa∗/pa for pa>0, and discarded-outcome map Φ(ρ):=∑a≥1MaρMa∗ (Declared ideal measurements and instruments of the framework clause (d)). Then:

(a) POVM and discarded ensemble. Each Fa is an effect, 0≤Fa≤I; for every state ρ one has pa≥0 and ∑apa=1; Φ is a positive trace-preserving linear map of the trace-class operators and maps states to states; and Φ(ρ)=∑a:pa>0paρa, a trace-norm convergent mixture of the conditional states.

(b) Repeatability criterion. The declared instrument is repeatable, i.e. for every state ρ and every a with pa>0 an immediate repetition of the same declared instrument returns the outcome a with probability 1 and every b≠a with probability 0, if and only if MbMa=0for all a,b with b≠a. Equivalently, Ma∗FaMa=Fa for every a. If H is finite-dimensional, this criterion also forces each Fa to be an orthogonal projection; the projection condition is not imposed for general H.

(c) Projective case. For a declared ideal sharp measurement (Pa) the Kraus family Ma=Pa satisfies the criterion of (b) and is repeatable, in agreement with Consequences of a declared ideal sharp measurement: repeatability and discarded ensembles clause (b); a general normalized Kraus family need not satisfy it (Outcome effects do not determine the conditional update, and general instruments need not be repeatable clause (c)).

(d) Non-determination. The effects (Fa) determine the outcome probabilities but not the conditional updates; the Kraus family is part of the declared instrument (clause (v) of P3, Outcome effects do not determine the conditional update, and general instruments need not be repeatable clause (b)).

(e) Scope. Clauses (a)-(d) are conditional statements about the declared countable instrument; they assert no apparatus realization, no outcome uniqueness and no empirical fact, and no claim is made that every positive trace-preserving map admits such a Kraus family (Countable Kraus normalization and trace-norm convergence clause (c)).

Facts & Assumptions

Given: The adopted postulates P1, P2, P3; a normalized countable Kraus family (Ma)a≥1 on H; its effects Fa=Ma∗Ma, probabilities pa, updates ρa and discarded map Φ; a state ρ.

[F1]

Countable Kraus normalization. For a bounded family with ∑a≤NMa∗Ma→I strongly: ∑a∥Max∥2=∥x∥2 for every x; for every positive trace-class ρ the series ∑aMaρMa∗ converges in trace norm to a positive trace-class operator with trace tr⁡ρ; the map extends uniquely to a linear positive trace-preserving map of the trace-class operators and carries states to states (Countable Kraus normalization and trace-norm convergence clauses (a)-(c)).

[F2]

Density expansions. A state has an expansion ρ=∑nwnTun,un with orthonormal (un), wn≥0, ∑nwn=1; then tr⁡(ρB)=∑nwn⟨Bun,un⟩ for bounded B (Density operators and scalar spectral probability clause (a), Nuclear bounded cyclicity for trace-class operators clause (b)).

[F3]

Effects of the Kraus family. Each Fa=Ma∗Ma is bounded and self-adjoint, with ⟨Fax,x⟩=∥Max∥2≥0. The normalization and [F1] give ⟨(I−Fa)x,x⟩=∑b≠a∥Mbx∥2≥0 for every x, so 0≤Fa≤I in the general-H quadratic-form order used to define effects in Declared ideal measurements and instruments of the framework clause (d).

[F4]

Zero quadratic form for a positive form. If X is bounded and self-adjoint with qX(x):=⟨Xx,x⟩≥0 for every x, then bX(x,y):=⟨Xx,y⟩ satisfies ∣bX(x,y)∣2≤qX(x)qX(y). If qX(y)>0, expanding qX(x−bX(x,y)qX(y)y)≥0 gives this inequality; if qX(y)=0, positivity of qX(x+ty) for every t∈C forces bX(x,y)=0. Consequently, if qX(x)=0 for every x, then all pairings ⟨Xx,y⟩ vanish and X=0.

[F5]

Updates and their formulas. For pa>0 one has ρa=MaρMa∗/pa with tr⁡(MaρMa∗)=tr⁡(ρFa)=pa (Declared ideal measurements and instruments of the framework clause (d), Rank-one operator calculus clause (e), Nuclear bounded cyclicity for trace-class operators clause (b)).

Proof

1.1givenF1F2F3algebra

[The effects and the probabilities] By [F3] each Fa is an effect. For a state ρ with expansion [F2], ∑apa=∑a∑nwn∥Maun∥2=∑nwn∥un∥2=1 by [F1] with x=un and ∑nwn=1; all terms are nonnegative, so the interchange of the sums is legitimate and pa≥0 for each a.

2.1step 1.1F1F2F5algebra

[The discarded map and the mixture identity] By [F1] the series ∑aMaρMa∗ converges in trace norm, its sum Φ(ρ) is positive trace class with trace tr⁡ρ=1, and Φ is trace preserving; hence Φ(ρ) is a state [F1, F2]. For a label with pa=0, [F5] gives tr⁡(MaρMa∗)=pa=0, so the positive trace-class summand MaρMa∗ is 0; therefore the nonzero summands are exactly those with pa>0, and MaρMa∗=paρa for them [F5]. Reindexing the trace-norm convergent series gives Φ(ρ)=∑a:pa>0paρa. This is (a).

3.1step 1.1step 2.1givenF1F5algebra

[Sufficiency of the criterion] Assume MbMa=0 whenever b≠a. For a state ρ and pa>0, cyclicity and [F5] give tr⁡(ρaFb)=tr⁡(ρ(MbMa)∗(MbMa))/pa=0 for every b≠a. By clause (a), already proved in steps 1.1-2.1, the outcome probabilities in the state ρa sum to 1, so its probability for a is 1. Hence the instrument is repeatable, without any assumption that Fa commutes with Ma.

4.1step 3.1givenF1F4F5algebra

[Necessity and the equivalent identity] Assume repeatability. For a unit vector x, if Max≠0, the state Tx,x has pa=∥Max∥2>0, and the probability for b≠a after outcome a is ∥MbMax∥2/∥Max∥2=0 by the rank-one rules and [F5]. If Max=0, then MbMax=0 directly. Thus MbMa vanishes on every vector, proving necessity. Applying [F1] to Max shows ∑b∥MbMax∥2=∥Max∥2. Under the criterion only b=a remains, so ⟨Ma∗FaMax,x⟩=∥Ma2x∥2=∥Max∥2=⟨Fax,x⟩. For the self-adjoint difference D:=Ma∗FaMa−Fa, equality of these quadratic forms gives qD(x)=⟨Dx,x⟩=0 for every x; the complex polarization identity 4⟨Dx,y⟩=qD(x+y)−qD(x−y)+iqD(x+iy)−iqD(x−iy) then gives ⟨Dx,y⟩=0 for all x,y, hence D=0. Conversely Ma∗FaMa=Fa gives ∥Ma2x∥2=∥Max∥2; by [F1], ∑b∥MbMax∥2=∥Max∥2, so all nonnegative terms with b≠a vanish.

5.1step 4.1F1F3F4algebra

[The finite-dimensional projection consequence] Suppose H is finite-dimensional and the criterion holds. Put Ea:={y:Fay=y}. By [F1], for y=Max the criterion implies ∥May∥2=∥y∥2, hence ⟨(I−Fa)y,y⟩=0. By [F3], I−Fa is self-adjoint with nonnegative quadratic form; [F4] gives ⟨(I−Fa)y,z⟩=0 for every z, so (I−Fa)y=0 and ran⁡Ma⊆Ea. On Ea, ∥May∥=∥y∥, so Ma∣Ea is injective; finite dimensionality makes its image all of Ea. If x⊥Ea and e∈Ea, then ⟨Max,Mae⟩=⟨x,Fae⟩=⟨x,e⟩=0. Thus Max lies in Ea and is orthogonal to all of Ea, so is zero. Consequently Fa is identity on Ea and zero on Ea⊥, hence is the orthogonal projection onto Ea. This proves the final finite-dimensional assertion of (b); the surjectivity step uses finite dimensionality and is not asserted for general H.

6.1step 4.1step 5.1givenF1F3algebra

[Clauses (c) and (d)] For a declared ideal sharp measurement, Ma=Pa satisfies MbMa=PbPa=0 for b≠a and Fa=Pa2=Pa, so the criterion of (b) holds and the instrument is repeatable, in agreement with Consequences of a declared ideal sharp measurement: repeatability and discarded ensembles clause (b); the explicit instrument of Outcome effects do not determine the conditional update, and general instruments need not be repeatable clause (c) violates repeatability, so the criterion is not automatic. Since the outcome probabilities are functions of the effects alone while distinct normalized Kraus families may share effects, the effects do not determine the update; this is the non-determination recorded in Outcome effects do not determine the conditional update, and general instruments need not be repeatable clause (b) and clause (v) of P3. This is (c) and (d).

7.1step 6.1givenF1algebra∎

[Scope] Clauses (a)-(d) were derived from the declared Kraus family and the cited mathematics; no step used a claim about an apparatus, and the converse direction of the criterion did not assume that every positive trace-preserving map has a Kraus family, since the family was declared. This is (e).

Remarks

The finite-dimensional qualification in (b) is essential. For an explicit infinite-dimensional countermodel, take a Hilbert space with orthonormal basis e0,f1,f2,…,g1,g2,… and fix 0<t<1. Define bounded operators M1e0=t f1, M1fj=fj+1, M1gj=0, and M2e0=1−t g1, M2gj=gj+1, M2fj=0; put Ma=0 for a≥3. The images within each operator are orthogonal, so these formulas extend continuously from finite sums, with norm at most 1. Writing PF and PG for the orthogonal projections onto the closed spans of the fj and gj, their effects are F1=PF+tTe0,e0 and F2=PG+(1−t)Te0,e0, hence F1+F2=I. Since M2M1=M1M2=0, (b) proves repeatability; however F1e0=te0 and F12e0=t2e0, so F1 is not a projection. This is a conditional operator model, not an apparatus claim.

Depends on

Dependency tree · 2 levels

Sources