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

Statistical mixtures, spectral decompositions and the extremal role of pure preparations

Physical scope

Model-internal statements about preparations of the non-relativistic quantum framework under the state postulate: statistical mixtures of preparations with probability weights are preparations; every preparation has a spectral decomposition as a countable mixture of pairwise orthogonal pure preparations; and the pure preparations are exactly the extreme points of the preparation set, so every mixed preparation is a nontrivial mixture of two preparations. The weights are classical preparation probabilities, not amplitudes. The item asserts no apparatus realization of any mixture, no measurement or probability law, no dynamics and no empirical result.

Statement

Adopt the state and composition postulate P1 of the framework (State and composition postulate P1: Hilbert spaces, preparations and composite systems) and use the state-space vocabulary of The state space of the framework: preparations, pure rays and density operators. Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)), which is the choice hypothesis of the spectral and mixture suppliers cited below. Let H≠{0} be the Hilbert space assigned to a declared system. Then:

(a) Mixtures. Let (ρn) be a finite or countable family of preparations with real weights wn≥0 satisfying ∑nwn=1. Then the statistical mixture ∑nwnρn of clause (iii) of P1 converges in trace norm to a preparation, namely to the density operator T=∑nwnρn of The state space is convex, closed under countable mixtures, and complete in the trace norm. The mixture is affine in its data: a term of zero weight may be added or removed without changing T, and splitting one weight between two copies of the same preparation, wρ=w1ρ+w2ρ with w1+w2=w, leaves T unchanged. If the index set is partitioned into consecutive finite blocks with total weights uk>0 and block mixtures σk, then ∑kukσk=∑nwnρn in trace norm, so mixtures may be regrouped.

(b) Spectral decomposition. Every preparation ρ is a countable statistical mixture of pairwise orthogonal pure preparations: there exist a finite or countable orthonormal family (un) of unit vectors and positive weights λn with ∑nλn=1 such that ρ=∑nλn Tun,un, the sum converging in trace norm, and the weights λn are exactly the positive eigenvalues of ρ counted with multiplicity.

(c) Extremality and nontrivial decompositions. A preparation is pure if and only if its density operator is an extreme point of the state space D(H) in the sense of the condition displayed in The extreme points of the state space are exactly the pure states; consequently every mixed preparation ρ admits a representation as a statistical mixture of two preparations in a nontrivial way: if λ1≥λ2>0 are two positive eigenvalues of ρ with orthonormal eigenvectors u1 and u2, then with ε:=λ2/2 the operators σ±:=ρ±ε(Tu1,u1−Tu2,u2) are preparations with ρ=12σ++12σ− and σ+≠σ−.

Facts & Assumptions

Given: The adopted state postulate P1, the assigned Hilbert space H≠{0}, preparations ρ,ρn∈D(H), weights wn≥0 with ∑nwn=1, and where required two positive eigenvalues λ1≥λ2>0 of ρ with orthonormal eigenvectors u1,u2.

[F1]

The state postulate (State and composition postulate P1: Hilbert spaces, preparations and composite systems): pure preparations are the unit rays of H; general preparations are the density operators on H; a statistical mixture of preparations ρn with weights wn≥0, ∑nwn=1, is the trace-norm convergent sum ρ=∑nwnρn, whose weights are a classical preparation uncertainty and not amplitudes; and the density operator associated with a unit ray [ψ] is Tψ,ψ.

[F2]

State-space vocabulary and mixtures (The state space of the framework: preparations, pure rays and density operators, The state space is convex, closed under countable mixtures, and complete in the trace norm): preparations are the states D(H); countable probability-weighted sums of states converge absolutely in the trace norm to a state, finite convex combinations of states are states, and consecutive finite blocks of a weighted family may be grouped with the grouped weights producing the same sum.

[F3]

Spectral expansion (Density operators and scalar spectral probability clause (a), Purity, spectral weights and the criterion for a pure state): every density operator ρ admits an expansion ρ=∑nλnTun,un converging in trace norm, with λn>0, ∑nλn=1, and (un) an orthonormal family of eigenvectors; the λn are the positive eigenvalues of ρ counted with multiplicity. The purity criterion gives that ρ is pure exactly when the multiplicity list has one positive eigenvalue equal to 1.

[F4]

Pure states are extreme (The extreme points of the state space are exactly the pure states): the extreme points of D(H) are exactly the pure states.

[F5]

Pure states and rays (Rays, unit vectors and rank-one Hilbert projections, The state space: density operators, pure and mixed states, and purity): Tu,u with u∈S(H) are exactly the pure states, and Tu1,u1≠Tu2,u2 for orthonormal unit vectors u1,u2.

[F6]

Extremality condition (The extreme points of the state space are exactly the pure states): a state x∈D(H) is extreme when x=(1−t)y+tz with y,z∈D(H) and real 0<t<1 implies y=z=x.

Proof

1.1givenF1F2algebra

[(a) mixtures and affinity] By [F2] the sum T=∑nwnρn converges absolutely in trace norm to a state, so it is a preparation in the sense of [F1]; the identity ∑nwnρn=∑nwnρn+0⋅ρ′ for an extra preparation ρ′ and the identity wρ=w1ρ+w2ρ for w1+w2=w are identities in the real vector space of self-adjoint trace-class operators, so the value of the mixture is unchanged; and the grouping statement for consecutive blocks is clause (c) of [F2].

1.2givenF2F3F5algebra

[(b) the spectral decomposition is a mixture of pure preparations] By [F3] the preparation ρ has an expansion ρ=∑nλnTun,un with positive weights λn, ∑nλn=1 and (un) orthonormal; by [F5] each Tun,un is a pure state, and pairwise orthogonality of the un makes the pure preparations pairwise distinct; the convergence in trace norm is the convergence of a statistical mixture as in [F2]. Thus ρ is exhibited as the mixture of the pure preparations Tun,un with the weights λn, which by [F3] are its positive eigenvalues counted with multiplicity.

1.3givenF2F4

[(c) extremality] By [F4] the extreme points of D(H) are exactly the pure states; since preparations are the states of D(H) by [F2], a preparation is pure exactly when its density operator is extreme.

2.1givenstep 1.3F1F2F3F5F6algebra

[(c) the nontrivial splitting of a mixed preparation] By [F3], a mixed ρ has at least two positive eigenvalues counted with multiplicity. Choose two with λ1≥λ2>0 and orthonormal eigenvectors u1,u2, and put ε=λ2/2. In the spectral expansion of [F3], choose the orthonormal eigenvectors to include u1,u2 (within either selected eigenspace, replace its finite orthonormal basis by one containing the specified vectors). The operators σ±=ρ±ε(Tu1,u1−Tu2,u2) therefore have the same trace-norm convergent expansion with the two selected weights replaced by λ1±ε and λ2∓ε. All weights remain positive, since λ1−ε≥λ2/2>0 and λ2−ε=λ2/2>0, and their sum remains one. By [F2] and [F5] each σ± is a density operator and hence a preparation. Their average is ρ, while σ+−σ−=2ε(Tu1,u1−Tu2,u2)≠0 by [F5]. Thus [F1] reads the identity as a nontrivial statistical mixture with weights 1/2, so ρ is not extreme by [F6], consistent with step 1.3.

3.1step 1.1step 1.2step 1.3step 2.1∎

[Conclusion] Steps 1.1-1.2 prove (a) and (b); steps 1.3 and 2.1 prove (c).

Depends on

Dependency tree · 2 levels

Sources