Superselection in Algebraic Language
Algebraic superselection compares representations and states of one specified observable algebra. Central projections separate classical sector labels, while multiplicities and nontrivial commutants need not define distinct sectors. For infinite systems, quasi-equivalence and disjointness make these comparisons precise without requiring every representation to be a discrete sum of irreducibles.
Required background. Representations distinguishes equivalence and multiplicity. Superselection Rules explains the physical restriction of observables. Von Neumann Algebras supplies centers and normal states.
Central projections label observable sectors
Section titled “Central projections label observable sectors”Let represent a unital C*-algebra and set . Its center is
A central projection splits both the Hilbert space and the represented algebra into mutually reducing pieces. Every observable in is block diagonal with respect to and .
For a normal state , the numbers are probabilities of central events. If , the conditional functionals
are positive normalized states, because centrality makes positive whenever is positive. They reconstruct as a convex combination.
The center is therefore a commutative algebra of classical decomposition data. A factor has center , so no nontrivial central event splits it. It can nevertheless act reducibly and support mixed states.
A finite-dimensional model separates weights from internal states
Section titled “A finite-dimensional model separates weights from internal states”Consider the observable algebra
Every state has the form
where and each density matrix is normalized when its coefficient is nonzero. The central projections and determine the weight .
This formula distinguishes classical uncertainty about the summand from mixedness inside a summand. For , the state is not pure even if both conditional density matrices are rank one. A pure state occupies one summand and is pure there.
Calling these summands physical superselection sectors assumes that this is the observable algebra of the system. Embedding it into introduces additional off-diagonal observables and changes which preparations are distinguishable. Algebra alone does not justify why those larger-algebra observables are physically excluded.
Equivalent copies are multiplicity, not central labels
Section titled “Equivalent copies are multiplicity, not central labels”Represent on by . The commutant is , but the represented algebra’s center remains scalar. A projection selecting one multiplicity vector lies in the commutant and generally not in the represented algebra.
Consequently different copies are not central observable sectors. This is the same distinction between irreducible type and copy that appears in compact-group decompositions, now applied to the observable representation itself.
The example also shows why a nontrivial commutant alone does not establish physically distinct superselection sectors. One must identify central projections that distinguish observable alternatives or a physically justified class of inequivalent representations.
Normal state families define quasi-equivalence
Section titled “Normal state families define quasi-equivalence”The folium of a representation is the set of state functionals on obtained by restricting normal states of . Concretely, they can be written using density operators on the representation Hilbert space:
Different densities can give the same restricted functional.
Two representations are quasi-equivalent when their von Neumann closures are normally star-isomorphic by a map carrying to for every . The quasi-equivalence theorem (Bratteli and Robinson, Section 2.4.4) makes this equivalent to equality of their folia. This theorem is imported, not inferred merely from abstract algebra isomorphism.
One copy and several identical copies of the defining representation of are quasi-equivalent: they admit exactly the same algebraic state functionals. They are not unitarily equivalent when their multiplicities differ. Quasi-equivalence removes this spectator multiplicity from the comparison.
Disjointness is stronger than inequivalence
Section titled “Disjointness is stronger than inequivalence”Representations are disjoint when they have no unitarily equivalent nonzero subrepresentations. Equivalently, there is no nonzero bounded intertwiner between them. Distinct irreducible representations are disjoint if they are inequivalent, but this implication fails for reducible representations that share a common summand.
A direct sum of disjoint representations has separate central support projections in its von Neumann closure. By contrast, merely choosing two nonequivalent reducible representations does not guarantee such a split.
In general infinite systems, decomposition into factors may use direct integrals, and arbitrary representations need not have a manageable unique decomposition into irreducibles. Stronger sector classifications require extra assumptions, such as type-I structure or locality and a chosen physical selection criterion. Those conditions are additional theory, not consequences of the word “sector.”
Exercise: inequivalent but overlapping representations
Section titled “Exercise: inequivalent but overlapping representations”Let be point evaluation of at . Are and disjoint? Are they quasi-equivalent?
Solution
They are not disjoint because both contain . They are not quasi-equivalent either: the first folium contains the state , whereas every state in the second folium is supported on . Thus neither unitary inequivalence nor failure of quasi-equivalence by itself implies disjointness.
References
Section titled “References”- Bratteli, Ola, and Derek W. Robinson, Operator Algebras and Quantum Statistical Mechanics 1, 2nd ed., Springer, 1987, doi:10.1007/978-3-662-02520-8, Section 2.4.4 — quasi-equivalence and disjointness; Section 4.2.2 — central and subcentral decompositions.
- Naaijkens, Pieter, Quantum Spin Systems on Infinite Lattices, Lecture Notes in Physics 933, Springer, 2017, arXiv:1311.2717 — representations and sector questions for infinite quantum systems.