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.

Schmidt reduction of a pure composite preparation, purity of the subsystems, and the product criterion

Physical scope

The pure preparations of a declared composite of two distinguishable subsystems: the Schmidt expansion of the composite vector, the reduced preparations of the factors, the purity criterion for the reduced states, and the product-vector characterization, including pure-state separability equivalence for the trace-norm closed convex hull. The statement is conditional on the framework's composition reading and the cited mathematics; it asserts no dynamics, no measurement, no interaction, no apparatus realization and no empirical fact, and it makes no claim about mixed states beyond what is stated.

Statement

Adopt the framework's composition and state 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, The state space of the framework: preparations, pure rays and density operators, Reduced preparations of a declared composite: the subsystem states of the framework), and assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The adopted composite reading also carries the Axiom of Choice (The Axiom of Choice) for its local spectral readouts; the Schmidt and partial-trace deductions below use only Countable Choice. Let Ψ∈H⊗^K satisfy ∥Ψ∥=1, let ρ=TΨ,Ψ∈D(H⊗^K),ρA=Tr⁡Kρ∈D(H),ρB=Tr⁡Hρ∈D(K) be the pure preparation of the declared composite and its two reduced preparations. Then:

(a) Schmidt expansion and reductions. There are an at most countable index set J, orthonormal families (vr)r∈J⊆H, (ur)r∈J⊆K and numbers sr>0 with Ψ=∑r∈Jsr κ(vr⊗ur)(norm convergence),∑r∈Jsr2=1, and the reduced preparations are given by the trace-norm convergent series ρA=∑r∈Jsr2 Tvr,vr,ρB=∑r∈Jsr2 Tur,ur. Moreover tr⁡ρA2=tr⁡ρB2=∑r∈Jsr4.

(b) Purity and product criterion. The following are equivalent: (i) exactly one sr is nonzero; (ii) ρA is pure, that is tr⁡ρA2=1; (iii) ρB is pure; (iv) Ψ is a product vector, Ψ=κ(u⊗v) with ∥u∥=∥v∥=1; (v) ρ=ρA⊗ρB; (vi) ρ is separable in the trace-norm closed-convex-hull sense of Product vectors, separable states and entangled states of a two-factor composite clause (b). In that case sr0=1 at the unique nonzero index and Ψ=κ(vr0⊗ur0), ρA=Tu,u, ρB=Tv,v for u=vr0, v=ur0.

(c) Non-product pure preparations. If Ψ is not a product vector, then at least two coefficients sr are nonzero, ρA and ρB are mixed, tr⁡ρA2<1, and ρ≠ρA⊗ρB; the pure preparation is entangled in the full trace-norm closed-convex-hull sense of Product vectors, separable states and entangled states of a two-factor composite clause (b). More precisely, if m=max⁡rsr2<1, every separable σ satisfies tr⁡(σρ)≤m and ∥ρ−σ∥1≥1−m>0.

(d) Scope. The statement concerns the declared composite, its pure preparations and the reduced preparations of the factors. It asserts no dynamics, no interaction, no measurement, no apparatus realization and no empirical fact; and it concerns pure composite preparations only, mixed-state separability being outside its scope.

Facts & Assumptions

Given: The declared composite with assigned spaces H,K; a unit vector Ψ∈H⊗^K; the preparations ρ,ρA,ρB; the Axiom of Countable Choice and the inherited Axiom of Choice.

[F1]

Schmidt expansion. For Ψ∈H⊗^K there are an at most countable J, orthonormal families (vr)⊆H, (ur)⊆K and sr>0 with Ψ=∑rsrκ(vr⊗ur) in norm, ∥Ψ∥2=∑rsr2; the sr are the positive square roots of the nonzero eigenvalues of the positive operator CC∗:H0→H0, where C:K0‾→H0 is the linear coefficient map on countable closed factor supports of Ψ from the cited Schmidt theorem (for an orthonormal basis (fj) of K0 and Ψ=∑jhj⊗fj, it is defined by Cfˉj=hj and continuous linear extension); and for ∥Ψ∥=1 the reduced density ρ=Tr⁡KTΨ,Ψ satisfies tr⁡ρ2=∑rsr4, with tr⁡ρ2=1 exactly when exactly one sr is nonzero, i.e. exactly when Ψ is a product vector (Infinite Schmidt decomposition and the pure product criterion; the completed tensor product and the embedding κ are those of Hilbert tensor construction: inner product, completion and product bases). For bounded X∈B(H), x∈H and y∈K the tensor identity (X⊗IK)κ(x⊗y)=κ(Xx⊗y) holds (Bounded tensor maps: extension, norm estimate, adjoint and commutation clause (a)).

[F2]

Partial trace. There is a linear positive trace-preserving map Tr⁡K on trace-class operators with tr⁡((Tr⁡KT)X)=tr⁡(T(X⊗IK)) for every trace-class T and every bounded X∈B(H) and ∥Tr⁡KT∥1≤∥T∥1; it maps density operators to density operators (Separable partial trace and its basic properties clauses (a), (b)); on rank-one operators Tr⁡KTu⊗v,u′⊗v′=⟨v,v′⟩Tu,u′ (clause (c)).

[F3]

Rank-one trace pairing. For trace-class S and x,y∈H one has tr⁡(STx,y)=⟨Sx,y⟩, and Tx,x≥0 with tr⁡Tx,x=∥x∥2, Tx,y being bounded with ∥Tx,y∥=∥x∥ ∥y∥; the map (x,y)↦Tx,y is trace-norm continuous (Rank-one operator calculus clauses (a), (b), (c), (d), (e), (f), Trace class is a two sided Banach operator ideal). For every bounded X, clauses (d) and (b) of that rank-one supplier give Tx,yX=Tx,X∗y and tr⁡(Tx,yX)=⟨x,X∗y⟩=⟨Xx,y⟩; thus the bounded pairings used below do not require X to be trace class.

[F4]

Purity criterion. A state is pure exactly when its purity tr⁡ρ2 equals one (Purity, spectral weights and the criterion for a pure state, Density operators and scalar spectral probability clause (a)).

[F5]

Reduced preparations and product preparations. ρA=Tr⁡Kρ and ρB=Tr⁡Hρ are the reduced preparations of the declared composite, and for a product preparation Tκ(u⊗v),κ(u⊗v)=Tu,u⊗Tv,v, so that ρA=Tu,u and ρB=Tv,v (Reduced preparations of a declared composite: the subsystem states of the framework clauses (a), (c), Composite systems of the framework: product bases, local readouts, local effects and local instruments clause (b)).

[F6]

The mathematical equivalence of a pure projector being separable with its vector being product, and the strict Schmidt-overlap/trace-norm witness for non-product vectors, are Pure-state separability is equivalent to being a product: a Schmidt overlap witness. Its closed convex hull is exactly the one declared in the definition.

Proof

Proof technique: direct; obtain the Schmidt expansion from the infinite Schmidt theorem, pass the partial trace identity to the trace-norm limit through finite truncations to identify the two reduced preparations, and read off the purity and product criteria from the supplier's purity statement and the purity criterion for states.

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

1.1givenF1

[Expansion and normalization] By [F1] there are J, (vr), (ur) and sr>0 with Ψ=∑rsrκ(vr⊗ur) in norm and ∑rsr2=∥Ψ∥2=1; this is the expansion of (a).

1.2givenF1F3algebra

[Finite truncations] Put ΨN:=∑r∈JNsrκ(vr⊗ur) for an increasing sequence of finite subsets JN↑J. For bounded X∈B(H) and N one has, using the tensor identity of [F1] on elementary tensors, ⟨(X⊗IK)ΨN,ΨN⟩=∑r,r′∈JNsrsr′⟨Xvr,vr′⟩⟨ur,ur′⟩=∑r∈JNsr2⟨Xvr,vr⟩ by orthonormality of (ur); since ΨN→Ψ, ∥X⊗IK∥≤∥X∥ and ∑rsr2<∞, the sesquilinear form is continuous and the series converges absolutely, so tr⁡(ρ(X⊗IK))=⟨(X⊗IK)Ψ,Ψ⟩=∑rsr2⟨Xvr,vr⟩.

2.1givenF2F3step 1.2algebra

[Reduction identity] Let S:=∑rsr2Tvr,vr, a trace-class operator with S≥0 and tr⁡S=1 by [F3] and absolute convergence. For bounded X, step 1.2 and [F2] give tr⁡(ρAX)=tr⁡(ρ(X⊗IK))=∑rsr2⟨Xvr,vr⟩; taking X=Tw,w′ and using [F3] twice, ⟨ρAw,w′⟩=tr⁡(ρATw,w′)=∑rsr2⟨Tw,w′vr,vr⟩=∑rsr2⟨vr,w′⟩⟨w,vr⟩=⟨Sw,w′⟩ for all w,w′∈H, so ρA=S by taking w′=(ρA−S)w and using ∥(ρA−S)w∥2=0; interchanging the factors gives ρB=∑rsr2Tur,ur with the same argument.

3.1givenF1F4F5F6step 2.1algebra

[Purity and product criterion] By [F1] and step 2.1, tr⁡ρA2=∑rsr4=tr⁡ρB2 and tr⁡ρA2=1 holds exactly when exactly one sr is nonzero and exactly when Ψ is a product vector; purity of ρA is equivalent to tr⁡ρA2=1 by [F4], and likewise for ρB. If exactly one sr0 is nonzero, then sr02=1 and Ψ=κ(vr0⊗ur0) is a product vector, so ρ=ρA⊗ρB by [F5]; conversely for a product vector [F5] gives ρA=Tu,u, ρB=Tv,v, which are pure by [F3] and [F4]. This is (b); its failure case, in which at least two sr are nonzero and both reduced preparations are mixed with tr⁡ρA2<1 and ρ≠ρA⊗ρB, is (c). Conversely, if ρ=ρA⊗ρB, pair both operators with the unit product vector qr=κ(vr⊗ur). The expansion gives ⟨ρqr,qr⟩=sr2, while step 2.1 and the tensor action in [F1] give ⟨(ρA⊗ρB)qr,qr⟩=sr4. Thus every positive sr2 equals its square and is one; their sum one forces exactly one coefficient. Finally [F6] identifies this product case exactly with separability, proving (vi); in the non-product case it gives entanglement and the stated strict trace-norm witness.

4.1step 1.1step 2.1step 3.1∎

[Assembly and scope] Step 1.1 gives the expansion of (a) and step 2.1 its reduction formulae; step 3.1 establishes (b) and (c); only the declared composite, its pure preparations and the cited mathematics were used, which is the scope statement (d).

Remarks

  • Pure versus mixed scope. Clause (c) proves non-product pure preparations entangled for the full trace-norm closed convex hull. A general classification or criterion for mixed-state separability is not claimed.
  • Choice. The adopted composite interface carries the Axiom of Choice for local spectral readouts. The deductions in this proof use only Countable Choice through the tensor construction and Schmidt theorem; no spectral theorem for unbounded operators enters the deduction.

Depends on

Dependency tree · 2 levels

Sources