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.

Product vectors, separable states and entangled states of a two-factor composite

Definition

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let H,K be nonzero complex Hilbert spaces (Hilbert space) and let H⊗^K be their completed tensor product with inclusion κ (Hilbert tensor construction: inner product, completion and product bases). Density operators are the self-adjoint positive trace-class operators of trace one (Density operators and scalar spectral probability clause (a), Trace class operator), and for u,u′∈H, v,v′∈K the rank-one operator Tu⊗v, u′⊗v′ is the one of Rank-one operator calculus.

(a) Product vectors and pure product states. A vector Ψ∈H⊗^K is a product vector when Ψ=κ(u⊗v) for some u∈H, v∈K. A pure product state of the composite is a density operator of the form TΨ,Ψ,Ψ=κ(u⊗v),∥u∥=∥v∥=1. A vector is non-product when it is not a product vector.

(b) Separable states. Write P for the set of all pure product states, a subset of the set D(H⊗^K) of density operators. The separable states are the elements of the trace-norm closed convex hull S(H,K):=conv⁡‾ P ⊆ D(H⊗^K), where conv⁡ denotes the set of finite convex combinations and the closure is taken in the trace norm ∥⋅∥1 of Trace class is a two sided Banach operator ideal. A state ρ∈D(H⊗^K) is entangled (with respect to the declared splitting H,K) when ρ∉S(H,K).

(c) Conventions and elementary consequences of the form of the definition. The set conv⁡P consists exactly of the finite sums ∑j=1nwjTΨj,Ψj with n≥1, weights wj≥0, ∑jwj=1 and unit product vectors Ψj: such sums are convex combinations of density operators and hence density operators (The state space is convex, closed under countable mixtures, and complete in the trace norm clause (a)), without any orthogonality requirement on the product vectors. Every element of conv⁡P is a density operator, and S(H,K) is a convex subset of D(H⊗^K): if ρ,σ are limits of convex combinations ρn→ρ, σn→σ and t∈[0,1], then tρ+(1−t)σ is the trace-norm limit of the convex combinations tρn+(1−t)σn. Separability of a state is a property of the declared splitting (H,K); no assertion is made here about its behaviour under a different factorization of a larger space.

(d) Finite dimension. When H and K are finite dimensional, P is compact and conv⁡P is already closed in the trace norm (it is a compact, hence closed, convex set in the finite-dimensional space of endomorphisms of H⊗^K), so S(H,K)=conv⁡P and no closure convention is needed. In the general case the closure in clause (b) is declared explicitly and is part of the definition.

(e) Pure-state specialization and status. A pure state TΨ,Ψ with ∥Ψ∥=1 is separable in the precise trace-norm closed-convex-hull sense of clause (b) exactly when Ψ is a product vector of clause (a); otherwise it is entangled. This is the proved mathematical specialization of Pure-state separability is equivalent to being a product: a Schmidt overlap witness, whose locally defined P,S are exactly those above. Clauses (a)-(e) fix mathematical vocabulary and adopt no physical assumption, dynamics, measurement or probability law. Whether a laboratory preparation realizes a separable or entangled state for the declared splitting remains a tested identification with uncertainty, not a consequence about nature of this definition.

Remarks

  • Why the closure is explicit. In infinite dimension the convex hull of the pure product states need not be trace-norm closed, and different authors complete it differently. Clause (b) declares the trace-norm closure, which is the convention used by this category; the mathematical results of the page are stated for this declared class.

  • Entanglement is relative to a splitting. The same vector of a three-factor space may be a product vector with respect to one grouping of the factors and non-product with respect to another, so a separability or entanglement statement without the declared pair (H,K) is incomplete; the definition above always carries that pair.

  • Finite-dimensional closed convex hull. Suppose H and K have complex dimensions h,k≥1, put L=H⊗^K and N=hk, and let W={T∈B(L):T=T∗}, regarded as a real vector space. In orthonormal coordinates, W has real dimension d=N2: there are N real diagonal entries and N(N−1)/2 free complex entries above the diagonal. The product of the unit spheres of H and K is a closed bounded subset of R2h+2k, hence compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line. The map (u,v)↦κ(u⊗v) is continuous: bilinearity and the tensor norm formula give ∥κ(u⊗v)−κ(u′⊗v′)∥≤∥u−u′∥ ∥v∥+∥u′∥ ∥v−v′∥. The map q↦Tq,q is trace-norm continuous by Rank-one operator calculus clause (f). Therefore P is compact by The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset.

    Every finite convex combination of more than d+1 members P1,…,Pm∈P with positive weights wi can be reduced. The vectors (Pi,1) in W×R, a real vector space of dimension d+1, are linearly dependent; hence there are real ci, not all zero, with ∑iciPi=0 and ∑ici=0. The ci have both signs. Set t=min⁡ci>0wi/ci and wi′=wi−tci. Then every wi′≥0, ∑iwi′=1, ∑iwi′Pi=∑iwiPi, and at least one wi′ is zero. Removing zero weights and repeating leaves at most d+1 terms. Since P is nonempty, shorter combinations can be padded with zero weights. Thus conv⁡P is the image of Pd+1×Δd under the continuous map ((Pi),(wi))↦∑iwiPi, where Δd={(w1,…,wd+1):wi≥0, ∑iwi=1}. The trace-norm and Euclidean coordinate topologies on W agree. In an orthonormal basis (gi)i=1N of L, write T=∑i,jtijTgi,gj and use the Euclidean coordinate norm ∥T∥2:=(∑i,j∣tij∣2)1/2. Each coordinate satisfies ∣tij∣=∣⟨Tgj,gi⟩∣≤∥T∥≤∥T∥1; conversely, ∥T∥1≤∑i,j∣tij∣ ∥Tgi,gj∥1=∑i,j∣tij∣≤N∥T∥2, since the matrix units have trace norm one by Rank-one operator calculus and there are N2 coordinates. Thus ∥T∥2≤N∥T∥1 and ∥T∥1≤N∥T∥2, proving equality of the topologies. Hence in finite coordinates P is closed and bounded because it is compact; the simplex Δd is also closed and bounded. Therefore Pd+1×Δd is closed and bounded in a Euclidean space, hence compact by Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line. Its image is compact and therefore closed in the trace-norm space. Finally, conv⁡P⊆D(L) by The state space is convex, closed under countable mixtures, and complete in the trace norm clause (a), and its trace-norm closure remains in D(L) by that lemma's clause (d). This proves the finite-dimensional assertion of clause (d); clause (b)'s trace-norm closure remains the declared convention in every dimension.

Depends on

Dependency tree · 2 levels

Sources