Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

Reduced preparations of a declared composite: the subsystem states of the framework

Physical scope

The subsystem preparations of a declared composite model of two distinguishable subsystems: the reduced states obtained from the composite preparation by the partial trace, their affineness and continuity, and the product case. The reduction is a mathematical operation on the model description; this definition asserts no discarding process, no measurement, no interaction, no dynamics, and no empirical fact, and it makes no claim that a laboratory procedure realizes the reduction.

Definition

Adopt the declared composite model of Composite systems of the framework: product bases, local readouts, local effects and local instruments with subsystems A,B, assigned spaces H,K and composite space H⊗^K, the state postulate P1 (State and composition postulate P1: Hilbert spaces, preparations and composite systems) and the state space D(H⊗^K) of the framework (The state space of the framework: preparations, pure rays and density operators). Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), the hypothesis of the cited partial-trace and tensor construction results. The following vocabulary is used by this page.

(a) Reduced preparations. For a preparation ρ∈D(H⊗^K) of the declared composite, the reduced preparation of subsystem A is ρA:=Tr⁡Kρ∈D(H), the image of ρ under the partial trace Tr⁡K of Separable partial trace and its basic properties clause (a), characterized by tr⁡(ρAX)=tr⁡(ρ (X⊗IK))for every bounded X∈B(H); the reduced preparation of subsystem B is ρB:=Tr⁡Hρ∈D(K), characterized by tr⁡(ρBY)=tr⁡(ρ (IH⊗Y)) for every bounded Y∈B(K). By clause (b) of Separable partial trace and its basic properties the partial trace maps density operators to density operators and is trace preserving, so ρA and ρB are states of the respective subsystems in the sense of the state space of the framework.

(b) Affineness and continuity. The maps ρ↦ρA and ρ↦ρB are affine and continuous in the trace norm: Tr⁡K is linear and ∥Tr⁡KT∥1≤∥T∥1 by clause (a) of Separable partial trace and its basic properties, with the trace norm of Trace class is a two sided Banach operator ideal. In particular the reduction of a statistical mixture ∑nwnρn∈D(H⊗^K) of composite preparations is the corresponding mixture ∑nwnρA,n of the reduced preparations.

(c) Product preparations reduce to their factors. If Ψ=κ(u⊗v) with ∥u∥=∥v∥=1 and ρ=TΨ,Ψ is a product preparation (Composite systems of the framework: product bases, local readouts, local effects and local instruments clause (b), Hilbert tensor construction: inner product, completion and product bases), then Tu⊗v, u⊗v=Tu,u⊗Tv,v as bounded operators on H⊗^K, because both sides agree on every elementary tensor κ(x⊗y) in the sense of Bounded tensor maps: extension, norm estimate, adjoint and commutation clause (a) and κ[H⊙K] is dense (Hilbert tensor construction: inner product, completion and product bases clause (c)); consequently ρA=Tu,u,ρB=Tv,v by clause (c) of Separable partial trace and its basic properties. Thus a product preparation is exactly a preparation whose reductions reconstruct it, ρ=ρA⊗ρB, and whose reductions are pure.

(d) Correlated and uncorrelated preparations. A composite preparation ρ is called uncorrelated when ρ=ρA⊗ρB and correlated otherwise; a pure preparation TΨ,Ψ is called a product preparation when Ψ is a product vector and non-product otherwise (Product vectors, separable states and entangled states of a two-factor composite clauses (a), (b)). These are descriptive names for the displayed algebraic conditions; the statistical reading of the distinction, including the failure of factorization of local outcome laws for non-product pure preparations, is a theorem of this page and is not assumed here.

(e) Status. Clauses (a)-(d) fix vocabulary: the subsystem states attached to a composite preparation by the partial trace. The reduction is a mathematical operation on the model description. It is not a dynamics, not an interaction, not a measurement and not a physical discarding of subsystem B; no disturbance of either subsystem and no empirical fact is asserted, and the question whether a laboratory procedure prepares a state whose reduction is a prescribed state is a tested identification with uncertainty under P7. The physical reading of clause (a) — that the reduced preparation reproduces every local outcome law of subsystem A — is a theorem of this page and is not assumed here.

Remarks

  • Reverse product criteria. To justify the reverse implications in clause (c), take a unit vector Ψ with Schmidt expansion Ψ=∑rsrκ(vr⊗ur), where sr>0, ∑rsr2=1, and the two factor families are orthonormal. The proof of Infinite Schmidt decomposition and the pure product criterion steps 3.1 and 6.1 identifies the eigenvalues of ρA=Tr⁡KTΨ,Ψ as sr2 and proves tr⁡(ρA2)=∑rsr4=1 exactly when there is one Schmidt coefficient, exactly the product-vector case. The partial-trace formula in Separable partial trace and its basic properties clause (c), applied to finite Schmidt truncations, gives the finite reduction sums. The rank-one map is trace-norm continuous and the partial trace is trace-norm contractive, so passage to the trace-norm limit gives ρB=∑rsr2Tur,ur; hence its purity is the same and purity of either reduction implies that Ψ is a product vector. Clause (c)'s partial-trace calculation proves the converse.

    The other reverse criterion, ρ=ρA⊗ρB implying a product vector, follows from the same expansion. For each r, put qr=κ(vr⊗ur). The expansion and orthonormality give ⟨ρqr,qr⟩=sr2 and ⟨ρAvr,vr⟩=⟨ρBur,ur⟩=sr2. The bounded tensor calculus then gives ⟨(ρA⊗ρB)qr,qr⟩=sr4. Equality of the composite operators forces sr2=sr4 for each positive coefficient. Since ∑rsr2=1, exactly one coefficient is present. Conversely clause (c)'s product calculation gives ρ=ρA⊗ρB for a product vector.

Depends on

Dependency tree · 2 levels

Sources