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 extreme points of the state space are exactly the pure states

Statement

Assume the Axiom of Countable Choice. Let H≠{0} be a complex Hilbert space and let D(H) be its state space (The state space: density operators, pure and mixed states, and purity), regarded as a subset of the real vector space X of self-adjoint trace-class operators, closed under finite real convex combinations by The state space is convex, closed under countable mixtures, and complete in the trace norm. Call a state ρ∈D(H) an extreme point of D(H) when ρ=(1−t)σ+tτ,σ,τ∈D(H),0<t<1⟹σ=τ=ρ, holds for all real t with 0<t<1 and all σ,τ∈D(H). Then ρ is an extreme point of D(H) if and only if ρ is a pure state.

Facts & Assumptions

Given: The Hilbert space H≠{0}; a state ρ∈D(H); states σ,τ∈D(H) and a real t∈(0,1) with ρ=(1−t)σ+tτ where a decomposition is assumed.

[F1]

The state space and purity (The state space: density operators, pure and mixed states, and purity, Purity, spectral weights and the criterion for a pure state): a state is a self-adjoint positive trace-class operator of trace 1; it is pure exactly when it equals Tu,u for some unit vector u; for a state ρ with positive eigenvalues λn counted with multiplicity one has ∑nλn=1, each λn∈(0,1], tr⁡(ρ2)≤1, and ρ is mixed exactly when it has at least two positive eigenvalues.

[F2]

Convexity and countable mixtures (The state space is convex, closed under countable mixtures, and complete in the trace norm): D(H) is a convex subset of the real vector space X of self-adjoint trace-class operators, and every countable probability-weighted sum ∑nwnρn with ρn∈D(H), wn≥0, ∑nwn=1, converges in trace norm to an element of D(H).

[F3]

Spectral expansion of a state (Density operators and scalar spectral probability clause (a), Spectral theorem for compact self adjoint operators): a state ρ equals ∑nλnTun,un for its positive eigenvalues λn counted with multiplicity and an orthonormal family of eigenvectors un. For the spectral theorem, let Σ be the set of distinct nonzero eigenvalues of ρ, and for λ∈Σ let Pλ be the orthogonal projection onto Eλ(ρ). Then ρx=∑λ∈ΣλPλx in norm, the sum being indexed by distinct eigenvalues; the closed span M of those eigenspaces is (ker⁡ρ)⊥=ran⁡ρ‾, and H=M⊕ker⁡ρ. Positivity makes every member of Σ positive, and the positive eigenvalues counted with multiplicity are exactly the λn from the density expansion.

[F4]

Norm and trace bounds for states (Trace class is a two sided Banach operator ideal, Trace of a positive operator is the sum of its eigenvalues, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The operator norm as the least bound and as the unit-sphere or unit-ball supremum): for trace-class S one has ∥S∥≤∥S∥1; for a positive trace-class S one has ∥S∥1=tr⁡S; hence ∥σ∥≤∥σ∥1=1 for every state σ; and ∣⟨y,x⟩∣≤∥y∥ ∥x∥ with equality if and only if y,x are linearly dependent.

[F5]

Pure states and projections (Rays, unit vectors and rank-one Hilbert projections): for u∈S(H) the operator Tu,u is the Hilbert orthogonal projection onto Cu with Tu,uu=u and Tu,u2=Tu,u, and for unit vectors u,w one has Tu,u=Tw,w if and only if w=ζu for some ζ∈U(1); distinct rays therefore give distinct pure states.

[F6]

Extremality convention and real 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): a point x of a set K is read as extreme when every representation x=(1−t)y+tz with y,z∈K and real 0<t<1 forces y=z=x; this is the condition displayed in the statement and used below. The space X is read as a real vector space by restricting scalars from C to R.

[F7]

Orthogonal projections (The Hilbert orthogonal projection onto a closed subspace): the Hilbert projection PM is characterised by PMx∈M and x−PMx∈M⊥; a one-dimensional subspace Cu with ∥u∥=1 equals the range of Tu,u by [F5].

Proof

1.1givenF1F4F5algebra

[(pure ⇒ extreme) the quadratic forms are pinned to one] Assume ρ=Tu,u with u∈S(H) and ρ=(1−t)σ+tτ with 0<t<1. Then ⟨ρu,u⟩=⟨Tu,uu,u⟩=⟨u,u⟩2=∥u∥2=1 by [F5] and the definition of Tu,u, so 1=(1−t)⟨σu,u⟩+t⟨τu,u⟩. Every state η∈D(H) satisfies ⟨ηu,u⟩≥0 by positivity and ⟨ηu,u⟩≤∣⟨ηu,u⟩∣≤∥ηu∥ ∥u∥=∥ηu∥≤∥η∥≤∥η∥1=1 by [F4]; a real convex combination with weights 1−t,t>0 of two numbers ≤1 equals 1 only if both numbers equal 1. Hence ⟨σu,u⟩=⟨τu,u⟩=1.

2.1givenstep 1.1F4algebra

[(pure ⇒ extreme) the first component fixes u] For the state σ we have the chain 1=⟨σu,u⟩≤∣⟨σu,u⟩∣≤∥σu∥ ∥u∥=∥σu∥≤∥σ∥≤1 by [F4]; all inequalities are therefore equalities, so equality holds in the Cauchy–Schwarz inequality for the pair (σu,u), and the equality case of [F4] gives σu=ζu for a scalar ζ because u≠0. Taking the pairing with u gives 1=⟨σu,u⟩=ζ⟨u,u⟩=ζ, so σu=u. The same argument gives τu=u.

3.1givenstep 2.1F1F3F5F6F7algebra

[(pure ⇒ extreme) a state fixing u equals Tu,u] Let η∈D(H) with ηu=u. By [F3] its positive eigenvalues λn, counted with multiplicity, satisfy ∑nλn=1, and u is an eigenvector with eigenvalue 1. If m is the multiplicity of eigenvalue 1, then 1=∑nλn=m+∑λn≠1λn with a nonnegative second sum, so m=1 and there is no other positive eigenvalue. Thus E1(η) is one-dimensional and contains u, so E1(η)=Cu. By the distinct-eigenvalue decomposition in [F3], the closed span M of the positive eigenspaces is now E1(η)=Cu and H=M⊕ker⁡η; hence η is the orthogonal projection P1 onto Cu. By [F7] and [F5] this projection is Tu,u. Applying this to σ and to τ gives σ=τ=Tu,u=ρ; hence every representation of ρ as a nontrivial convex combination is trivial, and ρ is an extreme point by [F6].

4.1givenstep 3.1F1F2F3F5F6algebra

[(mixed ⇒ not extreme) an explicit splitting] Assume now that ρ is not pure. By [F1] the state ρ has at least two positive eigenvalues; list them with multiplicity as λ1≥λ2≥⋯>0 with orthonormal eigenvectors u1,u2, so λ2>0. Put ε:=λ22>0,σ±:=ρ±ε(Tu1,u1−Tu2,u2). The expansion of [F3] for ρ turns the displayed definitions into countable mixtures of the pure states Tun,un with weights λ1±ε, λ2∓ε, λ3,λ4,…; these weights are nonnegative because λ2−ε=ε>0 and λ1±ε≥0, and they sum to ∑nλn±ε∓ε=1; hence σ±∈D(H) by [F2]. Moreover ρ=12σ++12σ−, and σ+−σ−=2ε(Tu1,u1−Tu2,u2), which is nonzero because u1,u2 are orthogonal unit vectors and hence not phase multiples of one another, so that Tu1,u1≠Tu2,u2 by [F5]. Thus the representation ρ=12σ++12σ− with σ+≠σ− is a nontrivial convex representation with 0<12<1, and ρ is not an extreme point by [F6].

5.1step 3.1step 4.1∎

[Conclusion] Steps 1.1, 2.1 and 3.1 show that every pure state is extreme, and step 4.1 shows that every non-pure state is not extreme. Hence the extreme points of D(H) are exactly the pure states.

Depends on

Dependency tree · 2 levels

Sources