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.

Local readout laws and reduced preparations: the subsystem state determines, and is determined by, the local statistics

Physical scope

The reading of the framework's Born law (P2) and ideal conditional-measurement law (P3) for quantities of one factor of a declared composite of two distinguishable subsystems: the outcome law of a local readout equals the outcome law of the factor quantity in the reduced preparation, the reduced preparation is determined by the local statistics, and a declared ideal sharp measurement of the factor acts on the composite with conditional and discarded reductions inherited from the factor. The unchanged opposite reduction is proved only for the declared ideal P3 instrument; no disturbance claim about a real apparatus, no dynamics, no interaction, no apparatus realization and no empirical fact are asserted.

Statement

Adopt the framework's composition, state and measurement readings for a declared composite of two distinguishable subsystems A,B with assigned spaces H,K (Composite systems of the framework: product bases, local readouts, local effects and local instruments, Reduced preparations of a declared composite: the subsystem states of the framework, Declared ideal measurements and instruments of the framework), and 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 suppliers. Let ρ,ρ′∈D(H⊗^K) be preparations with reduced preparations ρA=Tr⁡Kρ, ρA′=Tr⁡Kρ′ and ρB=Tr⁡Hρ. Then:

(a) Local readout law. For every assigned sharp observable (A,uA) of subsystem A with local readout (Aloc,uA) and every Borel B⊆R, μρAloc(B)=tr⁡(ρ (EA(B)⊗IK))=tr⁡(ρA EA(B))=μρAA(B), where EA is the spectral projection valued measure of A. In particular the local statistics of subsystem A depend on the composite preparation only through its reduced preparation, and if ρA=ρA′ then every local readout law is the same in ρ and in ρ′.

(b) Determination of the reduced preparation. Conversely, if ρA≠ρA′, then there are a bounded assigned sharp observable (P,1) of subsystem A and a Borel set B with μρPloc(B)≠μρ′Ploc(B): the family of local readout laws of subsystem A determines ρA among the preparations of the composite.

(c) Ideal local measurement. Let (Pa)a∈A0 be a declared ideal sharp measurement of subsystem A (Declared ideal measurements and instruments of the framework clause (a)). Then (Pa⊗IK)a∈A0 is a declared ideal sharp measurement of the declared composite, its outcome probabilities in a preparation ρ are pa=tr⁡(ρ (Pa⊗IK))=tr⁡(ρAPa), and for pa>0 the conditional state ρa:=(Pa⊗IK)ρ (Pa⊗IK)/pa of the composite has the reduced preparation (ρa)A=PaρAPapa, which is the selective Lueders update of ρA by Pa. The discarded-outcome state Φ(ρ)=∑a(Pa⊗IK)ρ (Pa⊗IK) has reduced preparations Φ(ρ)A=∑aPaρAPa,Φ(ρ)B=Tr⁡HΦ(ρ)=ρB. The analogous statements hold with the roles of A and B exchanged.

(d) Scope. Clauses (a)-(c) are conditional consequences of P1, P2 and P3 in the readings of the cited items and of the cited mathematics. They concern the declared composite and its declared measurements; they assert no dynamics, no interaction, no apparatus realization, no uniqueness of recorded outcomes and no empirical fact, and clause (c) is a statement about the declared ideal Lueders instrument only, not about every laboratory procedure.

Facts & Assumptions

Given: The declared composite with assigned spaces H,K; preparations ρ,ρ′; reduced preparations ρA,ρA′,ρB; an assigned sharp observable (A,uA) of subsystem A with spectral measure EA; a declared ideal sharp measurement (Pa)a∈A0 of subsystem A; the choice hypotheses.

[F1]

Local readout and its outcome law. For an assigned sharp observable (A,uA) of subsystem A, the local readout (Aloc,uA) is the assigned sharp observable of the composite with spectral projection valued measure FA=EA(⋅)⊗IK, so that μρAloc(B)=tr⁡(ρ(EA(B)⊗IK)); EA is regular and FA is a regular projection valued measure by Local PVM extension: tensoring a projection-valued measure with the identity (Composite systems of the framework: product bases, local readouts, local effects and local instruments clause (c), Assigned sharp observables and the outcome law of the framework clauses (a), (b)).

[F2]

Partial trace. tr⁡((Tr⁡KT)X)=tr⁡(T(X⊗IK)) for every trace-class T and bounded X, and Tr⁡K is linear, positive, trace preserving and trace-norm contractive; moreover Tr⁡KTu⊗v,u′⊗v′=⟨v,v′⟩Tu,u′ (Separable partial trace and its basic properties clauses (a), (b), (c)).

[F3]

Trace pairing and cyclicity. For trace-class T and bounded B one has tr⁡(BT)=tr⁡(TB) and ∣tr⁡T∣≤∥T∥1 (Nuclear bounded cyclicity for trace-class operators clause (b), Trace is absolutely convergent and basis independent, Trace class is a two sided Banach operator ideal clauses 1, 2); the rank-one operators satisfy tr⁡(STw,w′)=⟨Sw,w′⟩, Tw,w′ is bounded with ∥Tw,w′∥=∥w∥ ∥w′∥, and Tw,w is an orthogonal projection for unit w (Rank-one operator calculus clauses (a), (b), (c), (e)).

[F4]

Separating local statistics. If two density operators ρA≠ρA′ on H are distinct, then there is a unit w with ⟨ρAw,w⟩≠⟨ρA′w,w⟩, and the rank-one projection P=Tw,w has the outcome laws μρAP({1})=tr⁡(ρAP)=⟨ρAw,w⟩ and μρA′P({1})=⟨ρA′w,w⟩ (Distinct density operators are separated by the law of a bounded rank-one projection clauses (a), (b), Density operators and scalar spectral probability clause (b)).

[F5]

Ideal sharp measurement of the composite. For a declared ideal sharp measurement (Pa) of a system, the outcome probability in ρ is pa=tr⁡(ρPa), the conditional state is PaρPa/pa when pa>0, and the discarded-outcome state is the trace-norm convergent sum Φ(ρ)=∑aPaρPa with tr⁡(Φ(ρ)Pa)=pa (Consequences of a declared ideal sharp measurement: repeatability and discarded ensembles clauses (a), (b), (c), Declared ideal measurements and instruments of the framework clauses (a), (b)).

[F6]

Tensor calculus and strong continuity. (S⊗IK)κ(x⊗y)=κ(Sx⊗y) for bounded S, and (S⊗T)(S′⊗T′)=(SS′)⊗(TT′), (S⊗T)∗=S∗⊗T∗, ∥S⊗T∥≤∥S∥ ∥T∥ for bounded operators (Bounded tensor maps: extension, norm estimate, adjoint and commutation clauses (a), (b), (c)); if a sequence of bounded operators is uniformly bounded and converges strongly, then tensoring with IK preserves the strong convergence (Local PVM extension: tensoring a projection-valued measure with the identity clause (c)).

[F7]

Density-operator expansion. The preparation ρ has a finite or countable trace-norm convergent expansion ρ=∑nwnTun,un with (un) orthonormal, wn≥0 and ∑nwn=1 (Density operators and scalar spectral probability clause (a)).

Proof

Proof technique: direct; establish the intertwining identity for the partial trace and bounded operators on one factor, derive the local readout law from the partial trace characterization, read the determination of the reduced preparation off the separating rank-one projection, and compute the conditional and discarded reductions of a local ideal sharp measurement with the intertwining identity.

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

1.1F2F3F6algebra

[Intertwining identity] Let T be trace class on H⊗^K and X,Y bounded on H. For every bounded Z on H, [F2] gives tr⁡(Tr⁡K((X⊗I)T(Y⊗I))Z)=tr⁡((X⊗I)T(Y⊗I)(Z⊗I))=tr⁡(T(YZX⊗I))=tr⁡((Tr⁡KT)(YZX))=tr⁡(X(Tr⁡KT)YZ) by [F3] and [F6]; since Tr⁡K((X⊗I)T(Y⊗I)) and X(Tr⁡KT)Y are trace-class operators with equal trace pairings against every bounded Z, they are equal by [F3].

1.2givenF6algebra

[The extended family is a declared measurement] The operators Pa⊗IK are orthogonal projections by [F6]; PaPb=0 for a≠b gives (Pa⊗IK)(Pb⊗IK)=(PaPb)⊗IK=0; and ∑a∈A0(Pa⊗IK)=IH⊗IK in the strong sense, because the finite partial sums are (∑a≤NPa)⊗IK by linearity and converge strongly to IH⊗IK by [F6], the projections ∑a≤NPa being uniformly bounded and converging strongly to IH. Hence (Pa⊗IK) is a declared ideal sharp measurement of the composite.

1.3givenF1F2algebra

[Local readout law] For every Borel B, [F1] gives μρAloc(B)=tr⁡(ρ(EA(B)⊗IK)), and [F2] applied with the bounded operator EA(B) gives tr⁡(ρ(EA(B)⊗IK))=tr⁡(ρAEA(B))=μρAA(B) by [F1]; applying the same identity to ρ′ gives the case ρA=ρA′, so this is (a).

2.1givenF3F4step 1.3algebra

[Determination of the reduced preparation] Suppose ρA≠ρA′. By [F4] there is a unit w with ⟨ρAw,w⟩≠⟨ρA′w,w⟩; declare the bounded self-adjoint operator P:=Tw,w with unit 1 as a bounded assigned sharp observable of subsystem A. Its local readout (Ploc,1) has, by step 1.3, the outcome law μρPloc({1})=tr⁡(ρ(P⊗IK))=tr⁡(ρAP)=⟨ρAw,w⟩, and likewise μρ′Ploc({1})=⟨ρA′w,w⟩; the two numbers differ, so some local readout law differs, which is (b).

2.2givenF2F5step 1.1step 1.2algebra

[Conditional local measurement] By step 1.2 the family (Pa⊗IK) is a declared ideal sharp measurement of the composite, so [F5] gives pa=tr⁡(ρ(Pa⊗IK))=tr⁡(ρAPa) by [F2], and the conditional state ρa=(Pa⊗IK)ρ(Pa⊗IK)/pa for pa>0. Step 1.1 with X=Y=Pa gives Tr⁡K((Pa⊗IK)ρ(Pa⊗IK))=PaρAPa, hence (ρa)A=PaρAPa/pa; the conditional update of the composite reduces to the selective Lueders update of ρA, which is the first part of (c).

2.3givenF2F3F5F6F7step 1.1step 1.2algebra

[Discarded local measurement] The discarded-outcome state Φ(ρ) of [F5] has A-reduction ∑aPaρAPa: apply Tr⁡K to the trace-norm convergent series termwise using step 1.1 and the trace-norm continuity of Tr⁡K from [F2]. For the B-reduction let Y be bounded on K, enumerate the outcomes, and set SN=∑a≤NPa. Orthogonality and the strong resolution of the identity give 0≤SN≤IH and SN→IH strongly. By [F6], SN⊗IK→IH⊗IK strongly, and the tensor product rule gives SN⊗Y=(SN⊗IK)(IH⊗Y)→IH⊗Y strongly with sup⁡N∥SN⊗Y∥≤∥Y∥. The strong limit passes through this trace pairing by a finite-tail argument: [F7] and the rank-one trace identity in [F3] give tr⁡(ρ(SN⊗Y))=∑kwk⟨(SN⊗Y)uk,uk⟩. For each k the summand converges to wk⟨(IH⊗Y)uk,uk⟩, and its modulus is at most wk∥Y∥. Given ε>0, choose a finite initial segment ending at N0 whose omitted weights sum to less than ε/(4∥Y∥) when Y≠0; the tail of the difference from the limit is at most 2∥Y∥∑k>N0wk<ε/2, while strong convergence on the finite segment makes that part less than ε/2 for all sufficiently large N; hence tr⁡(ρ(SN⊗Y))→tr⁡(ρ(IH⊗Y)). The case Y=0 is immediate. Now let ΦN(ρ)=∑a≤N(Pa⊗IK)ρ(Pa⊗IK). Trace-norm convergence in [F5] and the trace ideal bound give tr⁡(ΦN(ρ)(IH⊗Y))→tr⁡(Φ(ρ)(IH⊗Y)). For each finite N, cyclicity [F3] and the tensor rules [F6] give tr⁡(ΦN(ρ)(IH⊗Y))=tr⁡(ρ(SN⊗Y)). Therefore tr⁡(Tr⁡HΦ(ρ)Y)=tr⁡(Φ(ρ)(IH⊗Y))=tr⁡(ρ(IH⊗Y))=tr⁡(ρBY) by [F2]. Since the trace pairings against every bounded Y determine a trace-class operator, Tr⁡HΦ(ρ)=ρB. This completes (c); the exchanged-roles statement is the same argument with H and K interchanged.

3.1step 1.3step 2.1step 2.2step 2.3∎

[Assembly and scope] Step 1.3 is (a), step 2.1 is (b), steps 2.2 and 2.3 are (c), and (d) records that only P1, P2, P3 in their stated readings and the cited mathematics were used.

Remarks

  • Which factor is measured. Clause (c) measures subsystem A; its discarded version leaves ρB fixed while changing ρA into the Lueders mixture. The conditional version changes the description of B as well, and that conditional change is exactly the correlation between the factors; no signalling claim beyond the outcome-law invariance is made here.
  • Unbounded readouts. Clause (a) covers unbounded assigned sharp observables of the factor, including the position and momentum observables of the massive-particle model, because the local readout is defined through the spectral measure EA(⋅)⊗IK.

Depends on

Dependency tree · 2 levels

Sources