Gleason's theorem

Gleason's theorem asserts that for a separable Hilbert space of dimension at least three, any nonnegative countably additive measure μ on the lattice of closed subspaces (or equivalently, on the set of projection operators) that is normalized (μ(I)=1) must be given by a density matrix ρ: μ(P)=Tr(ρP). The proof is nontrivial and relies on the geometry of the unit sphere; it shows that the measure is determined by its values on one-dimensional projections, which must form a quadratic form. The theorem fails in dimension two, where there exist non-quadratic measures, such as those arising from a single direction on the Bloch sphere.

In quantum mechanics, the theorem provides a rigorous justification for the Born rule: if a system is in a state described by a density operator ρ, the probability of obtaining an outcome associated with a projection P is Tr(ρP). This eliminates the need to postulate the Born rule separately, as it follows from the natural assumption that probabilities are additive over mutually exclusive outcomes. The theorem also underpins the impossibility of certain hidden-variable theories, as demonstrated by the Kochen–Specker theorem, which builds on Gleason's work to show that noncontextual hidden variables are incompatible with quantum mechanics.

Gleason's theorem has been extended in several directions. It holds for real Hilbert spaces of dimension at least three, and for certain classes of von Neumann algebras, where the measures correspond to normal states. In quantum logic, it characterizes the states on the lattice of projections of a type I factor. The theorem also has applications in quantum information theory, particularly in the characterization of quantum measurements and in the derivation of the Born rule from operational principles. A notable generalization is the Busch–Gleason theorem, which extends the result to positive operator-valued measures (POVMs).

Gleason's theorem is often cited as a key ingredient in the proof of the Kochen–Specker theorem, but its own proof is rarely studied in detail. The theorem was motivated by a problem posed by George Mackey, who asked whether the Born rule could be derived from the structure of quantum logic. Gleason's original proof was lengthy and involved intricate geometric arguments; later simplifications were provided by others, such as the proof using frame functions. The theorem also has surprising connections to the theory of frames and to the classification of positive maps. In dimension two, the failure of the theorem is related to the existence of noncontextual hidden-variable models for qubits, which is why the Kochen–Specker theorem requires dimension at least three.

Hilbert space

A complete inner product space, the mathematical setting for quantum mechanics.

Projection operator

A self-adjoint idempotent operator representing a quantum measurement outcome.

Born rule

The rule that the probability of an outcome is the trace of the product of the density operator and the projection.

Density matrix

A positive trace-class operator with trace one, representing a quantum state.