Alphabeta Math
LemmaStatement: 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.

The state space is convex, closed under countable mixtures, and complete in the trace norm

Statement

Assume the Axiom of Countable Choice. Let H≠{0} be a complex Hilbert space and let D(H) be the state space of The state space: density operators, pure and mixed states, and purity. Write S1(H) for the complex Banach space of trace-class operators on H with the trace norm ∥⋅∥1, and X:={ρ∈S1(H):ρ∗=ρ} for the set of self-adjoint trace-class operators, regarded as a real vector space by restricting scalars from C to R (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations). Then:

(a) Finite mixtures. X is a closed real-linear subspace of S1(H) and hence a real Banach space, and D(H)⊆X is closed under finite real convex combinations, that is, it contains with any two of its points the whole real segment between them: for all ρ,σ∈D(H) and every real λ∈[0,1], λρ+(1−λ)σ∈D(H). By induction every finite convex combination ∑j=1nλjρj with ρj∈D(H), real λj≥0 and ∑jλj=1 is again an element of D(H).

(b) Countable mixtures. Let (ρn)n∈N⊆D(H) and let (wn)n∈N be real weights with wn≥0 and ∑nwn=1. Then the series ∑nwnρn converges absolutely in ∥⋅∥1 to an element of D(H): the series converges in X, its sum T satisfies T∗=T, T≥0, tr⁡T=1, and ∥T∥1=tr⁡T, with ∥T−∑n<Kwnρn∥1⟶0(K→∞).

(c) Grouping of consecutive blocks. In the situation of (b) let 0=N0<N1<N2<⋯ be an increasing sequence with Nk→∞, and for every k∈N put uk:=∑Nk≤n<Nk+1wn,σk:=1uk∑Nk≤n<Nk+1wnρn, where it is assumed that uk>0 for every k (blocks of zero weight are omitted). Then σk∈D(H) for every k, ∑kuk=1, and ∑kukσk=∑nwnρn in ∥⋅∥1, the series on the left converging absolutely.

(d) Closedness and completeness. D(H) is closed in the Banach space (X,∥⋅∥1), and D(H) is complete for the trace-norm metric.

Facts & Assumptions

Given: The complex Hilbert space H≠{0}; density operators ρ,σ,ρn∈D(H); real weights λ,wn≥0; a block decomposition N0<N1<⋯ with N0=0, Nk→∞.

[F1]

Trace class is a Banach ideal (Trace class is a two sided Banach operator ideal): S1(H) is a linear subspace of B(H) on which ∥⋅∥1 is a norm and (S1(H),∥⋅∥1) is a Banach space; ∥T∥≤∥T∥1; and ATB is trace class with ∥ATB∥1≤∥A∥ ∥T∥1∥B∥ for bounded A,B.

[F2]

Density operators (Density operators and scalar spectral probability clause (a), The state space: density operators, pure and mixed states, and purity): ρ∈D(H) means ρ∗=ρ, ρ≥0 (that is, ⟨ρx,x⟩∈[0,∞) for all x) and ρ is trace class with tr⁡ρ=1.

[F3]

Positivity, norm and trace of a positive trace-class operator (Self-adjoint, positive, unitary and normal operators, Trace of a positive operator is the sum of its eigenvalues, Trace is absolutely convergent and basis independent): a positive operator satisfies ⟨Tx,x⟩∈[0,∞); for a self-adjoint positive trace-class T one has tr⁡T=∥T∥1; the trace is linear and ∣tr⁡T∣≤∥T∥1 for every trace-class T.

[F4]

Adjoints and operator-norm continuity (Hilbert-adjoint identities): (aS+bT)∗=a‾S∗+b‾T∗ for complex scalars a,b; T∗∗=T; and ∥T∗∥=∥T∥. Thus T↦T∗ is real-linear and isometric in the operator norm. By [F1], trace-norm convergence implies operator-norm convergence, so if trace-class Tm→T in trace norm and every Tm is self-adjoint, then Tm∗→T∗ and Tm→T in operator norm. Since Tm∗=Tm for every m, uniqueness of limits gives T∗=T.

[F5]

Cauchy–Schwarz and its use (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs): ∣⟨y,x⟩∣≤∥y∥ ∥x∥; hence ∣⟨(T−S)x,x⟩∣≤∥T−S∥ ∥x∥2≤∥T−S∥1∥x∥2 by [F1].

[F6]

Series in a Banach space and completeness (Series and absolute convergence in a normed space, Banach space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R, Complete metric space: every Cauchy sequence converges in the space): an absolutely convergent series in a Banach space converges; a sequence converges to a limit p when the distances tend to 0, and then every subsequence converges to the same limit.

[F7]

Closed subspaces of complete metric spaces (Closed subspaces of complete metric spaces are complete; the converse under countable choice clause 2): a closed subset of a complete metric space is complete; and the subspace metric is the restriction of the ambient metric.

[F8]

Convexity convention and restricted scalars (A field is a vector space over itself, and over any subfield K⊆F every F-vector space is a K-vector space by restricting the scalars, Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations): a subset C of a real or complex vector space is read as convex when (1−t)x+ty∈C for all x,y∈C and all real t with 0≤t≤1, coefficients always real; this is the reading fixed in clause (a) of the statement and used below. A complex vector space is a real vector space by restricting scalars along the subfield R⊆C, with the same addition and scalar multiplication.

Proof

1.1givenF1F2F3F4F8algebra

[(a) finite mixtures are states] Let ρ,σ∈D(H) and λ∈[0,1] real. The combination λρ+(1−λ)σ is trace class by [F1] and self-adjoint because (λρ+(1−λ)σ)∗=λρ∗+(1−λ)σ∗=λρ+(1−λ)σ by [F4] with real scalars; it is positive because ⟨(λρ+(1−λ)σ)x,x⟩=λ⟨ρx,x⟩+(1−λ)⟨σx,x⟩≥0 by [F2] and [F3]; and its trace is λtr⁡ρ+(1−λ)tr⁡σ=λ+(1−λ)=1 by the linearity of the trace in [F3]. Hence it is a density operator, so D(H) is closed under finite real convex combinations in the reading of [F8]; the finite-combination statement follows by induction on the number of components.

1.2givenF1F3F6algebra

[(b) the mixture series converges in the trace norm] For every n the operator wnρn is self-adjoint by [F4] and positive, and it is trace class with ∥wnρn∥1=wn∥ρn∥1=wntr⁡ρn=wn by [F1] and [F3]; hence ∑n∥wnρn∥1=∑nwn=1<∞, so the series is absolutely convergent in the Banach space S1(H) by [F6] and has a trace-class sum T; moreover ∥T−∑n<Kwnρn∥1→0 because the tail is a convergent series of norms of the omitted terms, by [F6]. The self-adjointness argument below places this sum in X.

1.3givenF1F4F6F7F8algebra

[(a) X is a real Banach space] If Tm∈X and ∥Tm−T∥1→0, then by [F1] and [F4], ∥T∗−T∥≤∥T∗−Tm∗∥+∥Tm−T∥=∥(Tm−T)∗∥+∥Tm−T∥=2∥Tm−T∥≤2∥Tm−T∥1→0. Thus T∗=T and X is closed in S1(H). It is a real-linear subspace because sums and real scalar multiples of self-adjoint operators are self-adjoint by [F4], and it is complete in the restricted trace-norm metric by [F7] applied to the complete space S1(H) of [F1].

2.1givenstep 1.1algebra

[(c) block members are states] Fix k with uk>0. The finite combination σk=uk−1∑Nk≤n<Nk+1wnρn is a convex combination of the operators ρn, Nk≤n<Nk+1, with nonnegative real coefficients wn/uk summing to 1 (the finite sum of the weights is uk), so σk∈D(H) by step 1.1 and induction.

2.2givenstep 1.2F1F2F3F4F5algebra

[(b) the mixture sum is a state] Let SK:=∑n<Kwnρn, the self-adjoint partial sums of step 1.2. Trace-norm convergence and [F1] give ∥T−SK∥→0, and operator-norm continuity of the adjoint [F4] gives ∥T∗−T∥≤∥T∗−SK∗∥+∥SK−T∥=2∥T−SK∥≤2∥T−SK∥1→0. Hence T is self-adjoint. It is positive because for every x the numbers ⟨SKx,x⟩=∑n<Kwn⟨ρnx,x⟩ are nonnegative by [F2], while ∣⟨(T−SK)x,x⟩∣≤∥T−SK∥1∥x∥2→0 by [F5], so ⟨Tx,x⟩≥0; and tr⁡T=lim⁡K∑n<Kwn=1 because ∣tr⁡T−tr⁡SK∣≤∥T−SK∥1→0 by [F3] and the trace is linear. Thus T∈D(H)⊆X, and since SK∈X this trace-norm convergence is also convergence in X.

3.1givenstep 2.1step 1.2F3F6algebra

[(c) grouping of consecutive blocks] Let Tm:=∑n<mwnρn be the partial sums of the n-series; by regrouping finite sums in the real vector space X one has, for every K, ∑k<Kukσk=∑k<K∑Nk≤n<Nk+1wnρn=∑n<NKwnρn=TNK. Since Tm→T by step 1.2 and NK→∞, the sequence (TNK)K is a subsequence of a convergent sequence in the metric space X and therefore converges to T as well by [F6]; the left series converges absolutely because ∑k∥ukσk∥1=∑kuktr⁡σk=∑kuk=∑nwn=1 by [F3] and step 2.1. Hence both series have the same sum T.

4.1givenstep 1.3F2F3F5F7algebra∎

[(d) closedness and completeness] Let ρm∈D(H) converge to ρ∈X in the trace norm. Then ρ is self-adjoint by definition of X; it is positive because ∣⟨(ρ−ρm)x,x⟩∣≤∥ρ−ρm∥1∥x∥2→0 by [F5] while ⟨ρmx,x⟩≥0; and tr⁡ρ=lim⁡mtr⁡ρm=1 by [F3] and trace linearity. Hence ρ∈D(H), so D(H) is closed in X; since X is complete by step 1.3, D(H) is complete for the restricted metric by [F7]. This proves (a)-(d).

Depends on

Dependency tree · 2 levels

Sources