39.03.04 · operator-algebras / von-neumann-algebras

Comparison of Projections and the Murray-von Neumann Type Classification

shipped3 tiersLean: none

Anchor (Master): Takesaki *Theory of Operator Algebras I* Ch. V; Murray-von Neumann *On Rings of Operators* I–IV; Dixmier *Von Neumann Algebras* Ch. III; Kadison-Ringrose *Fundamentals II* Ch. 6–8

Intuition Beginner

A projection inside an algebra of operators 39.03.01 picks out a piece of space — it answers a yes-or-no question and keeps the part where the answer is yes. The first thing you want to know about two such pieces is whether they are the same size. In ordinary geometry you compare two regions by sliding one onto the other. Here you do the same thing, but the sliding is done by an operator inside the algebra that carries the first piece exactly onto the second without stretching it. When such a carrier exists, the two projections count as equivalent — the same size in the only sense the algebra can detect.

Once you can compare sizes, you can ask how the sizes are spread out. In familiar settings sizes come in whole numbers: a region holds one point, or two, or seventeen. But operator algebras allow stranger size scales. Some allow a continuous dial of sizes, every value between zero and one, with no smallest nonzero piece at all. Others are so large that every nonzero piece is the same size as the whole, so the scale runs away and swallows itself.

These three behaviors — whole-number sizes, a continuous dial, and a runaway scale — are the heart of the type classification. Every algebra of this kind breaks apart cleanly into pieces of each behavior.

Visual Beginner

A partial isometry is a one-way conveyor belt: it carries one chosen piece of space exactly onto another and ignores everything else. The picture to hold is two shaded regions joined by such a belt, certifying that the two have equal size.

The conveyor belt going both ways is what equality of size means: takes onto , and the reverse belt takes back onto . The three rulers below show the three ways sizes can be laid out.

Worked example Beginner

Work with three-by-three complex matrices acting on ordinary three-dimensional space. Let be the projection onto the first coordinate axis and the projection onto the second coordinate axis:

Both pick out a one-dimensional piece. To certify they are the same size, find a conveyor belt carrying the first axis onto the second. Take to be the matrix sending the first basis vector to the second and killing everything else:

Check the two belt conditions. Multiplying gives back — the belt loaded at the first axis. Multiplying gives back — the belt delivers to the second axis. So and are equivalent.

What this tells us: in matrices, two projections are the same size exactly when they have the same rank — the same dimension of range. Here both have rank one, and the conveyor belt makes the equal-size verdict concrete. Size is dimension, counted in whole numbers, which is the type I pattern.

Check your understanding Beginner

Formal definition Intermediate+

Let be a von Neumann algebra 39.03.01 and let denote its lattice of projections. Two projections are Murray–von Neumann equivalent (relative to ), written , if there exists a partial isometry with $$ v^* v = p, \qquad v v^* = q. $$ The element carries the range of isometrically onto the range of and annihilates . The relation is an equivalence relation on : reflexivity uses , symmetry uses , and transitivity uses the product of two partial isometries. One writes when for some subprojection ; this is a preorder, and the comparison of projections asks when two projections are -comparable.

A projection is finite if forces — no proper subprojection is equivalent to the whole. Otherwise is infinite. A projection is properly infinite if and is infinite for every central projection with . A nonzero projection is abelian if the reduced algebra is commutative; equivalently, the only projections under are central in . The von Neumann algebra itself is called finite, infinite, properly infinite, or has any of these properties of its unit .

The centre is 39.03.01. The central support of a projection is the smallest central projection with ; equivalently over unitaries . The type decomposition is governed by central projections, and the central support is the device that compares projections that live in different central blocks. A projection is purely infinite in the relevant sense when contains no nonzero finite central piece below .

A trace on is a map that is additive, positively homogeneous, and satisfies the trace property for all . It is faithful if , normal if on bounded increasing nets (the order-continuity of 39.03.02), and finite if , in which case it normalises to a state . On projections, implies , so a trace descends to a dimension function on equivalence classes.

Counterexamples to common slips

  • Equivalence is relative to , not to . Two projections can be equivalent in (same rank) yet inequivalent in a smaller that contains no partial isometry between them; the partial isometry must live in . Conversely they can be -equivalent without being unitarily conjugate by a unitary of unless their complements are also equivalent.
  • Finiteness is not the same as finite-dimensional range. In a II factor the unit is a finite projection even though is infinite-dimensional: no proper subprojection of is equivalent to , because the trace strictly decreases. The hallmark of infinity is the existence of a proper subprojection of the same size, exactly as the even integers biject with all integers.
  • The comparison theorem does not say any two projections are comparable outright. It says they become comparable after cutting by a single central projection : on one side and on the other. In a factor the centre is the scalars, so and genuine total comparability returns.

Key theorem with proof Intermediate+

Theorem (the comparison theorem). Let be a von Neumann algebra and . There is a central projection such that $$ zp \preceq zq \qquad \text{and} \qquad (1-z)q \preceq (1-z)p. $$ In particular, in a factor any two projections are comparable: either or . [Takesaki Ch. V; Murray-von Neumann 1936]

Proof. The engine is the comparability of projections with equal central support by a maximal-family / halving argument, combined with a central cut that separates the two halves.

Step 1: a partial isometry exists when ranges overlap centrally. First record the basic lemma: if have , then there are nonzero subprojections and with . Indeed, means the central supports overlap, so there is with . Write the polar decomposition with a partial isometry (the polar parts lie in because is weakly closed and is a norm-limit of polynomials in an element of ). Then the support projection of , a nonzero subprojection , and a nonzero subprojection, with implementing .

Step 2: exhaust by a maximal orthogonal family. Consider all families where the are mutually orthogonal, the are mutually orthogonal, and implements . Partially order these families by inclusion; a chain has its union as an upper bound, so Zorn's lemma yields a maximal family. Set and . Summing the partial isometries, (a strongly convergent sum with orthogonal initial and final spaces) is a partial isometry with and , so .

Step 3: the leftover pieces have disjoint central support. Let and be the leftovers. By maximality, Step 1 cannot be applied to and : there are no nonzero equivalent subprojections of and . By the contrapositive of Step 1 this forces — the leftovers have orthogonal central supports.

Step 4: the central cut. Put (a central projection dominating off ). Because , we have , so , giving . On the complement, ; since , in fact , so , giving . (More carefully, choosing to be the central projection with and , available because lets the two leftovers be separated by a central projection, delivers both inequalities simultaneously.) This is the asserted dichotomy.

For a factor, , so ; one of the two inequalities is vacuous and the other reads or .

Bridge. The comparison theorem builds toward the entire type classification, and it appears again in 39.04.01 where the modular theory of a factor refines the comparison of projections into a flow on the projection lattice. The foundational reason the theorem works is exactly the polar decomposition landing inside : a single operator with overlapping central support manufactures a partial isometry, which is the central insight that turns the abstract question "are these the same size?" into the concrete production of a conveyor belt. This is exactly the bridge from the bicommutant identity of 39.03.01 — which guarantees weak limits and hence polar parts stay in — to a quantitative size theory. Putting these together, the centre measures precisely the obstruction to total comparability, so a factor (centre the scalars) carries a total order on projection sizes; this generalises the rank function on matrices and is dual to the trace, which reads the order back as a number. The dimension function and the trace, developed next, are the numerical shadow of the order the comparison theorem installs.

Exercises Intermediate+

Lean formalization Intermediate+

lean_status: none — Mathlib carries bounded operators, adjoints, and orthogonal projections, and a partial VonNeumannAlgebra predicate, but neither Murray–von Neumann equivalence of projections, the comparison theorem, the finite/infinite/abelian distinctions, nor the type decomposition and the trace on a finite factor is packaged.

The intended formalisation reads schematically:

import Mathlib.Analysis.InnerProductSpace.Adjoint
import Mathlib.Analysis.InnerProductSpace.Projection

variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
variable (M : Set (H →L[ℂ] H)) [IsVonNeumannAlgebra M]

/-- Murray–von Neumann equivalence: a partial isometry in M between p and q. -/
def MvnEquiv (p q : H →L[ℂ] H) : Prop :=
  ∃ v ∈ M, star v * v = p ∧ v * star v = q

/-- The comparison theorem: any two projections become comparable after a
central cut z ∈ Z(M). -/
theorem comparison
    (p q : H →L[ℂ] H) (hp : IsProjection M p) (hq : IsProjection M q) :
    ∃ z ∈ center M, IsCentralProjection z ∧
      Subordinate (MvnEquiv M) (z * p) (z * q) ∧
      Subordinate (MvnEquiv M) ((1 - z) * q) ((1 - z) * p) :=
  sorry  -- maximal-family exhaustion + polar decomposition in M

Advanced results Master

Comparison of projections installs an order on sizes; the trace turns the order into a number, and the central decomposition sorts the algebra into the three behaviours.

The type decomposition. Every von Neumann algebra admits a unique decomposition by central projections , with of type I (it has an abelian projection of central support ), of type II (no nonzero abelian projection, but a finite projection of central support ), and of type III (no nonzero finite projection). The type II part splits further as according to whether is finite or properly infinite, and the type I part stratifies as with a homogeneous algebra for abelian and . A factor () is purely of one type: I, I, II, II, or III.

Factors of each type. Type I is ; type I is . Type II is the prototype of a finite factor of infinite linear dimension — the group von Neumann algebra of an i.c.c. group 39.03.01, or the hyperfinite below. Type II is , equivalently , carrying a semifinite trace with range . Type III factors carry no trace at all; the Powers factors (), built from infinite tensor products of matrix states with eigenvalue ratio , are mutually non-isomorphic type III factors, and Connes' invariants and refine III into the continuum III, 39.04.01.

The dimension function and the trace on a finite factor. On a finite factor there is a unique faithful normal trace with , and the dimension function on projections realises the comparison order numerically: , and . Its range is for type I and the whole interval for type II. This continuous range — a projection of every size between and , hence no minimal projection — is the defining novelty Murray and von Neumann discovered: "continuous dimension". Uniqueness of follows because any two normal traces on a factor are proportional (the comparison theorem makes the trace determined by its values on equivalence classes, which the order pins down up to scale).

Construction and uniqueness of the hyperfinite II factor. Let be the weak closure of the increasing union of dyadic matrix algebras, embedded , in the GNS representation of the unique normalised trace. Then is a II factor, hyperfinite (a weak limit of finite-dimensional subalgebras) and approximately finite-dimensional. Murray and von Neumann proved is the unique hyperfinite II factor up to isomorphism; Connes' deep theorem later identified hyperfiniteness with injectivity, amenability, and several other conditions, making the canonical "smallest" II factor into which every separable amenable one embeds.

The fundamental group. For a II factor with trace , the amplifications cut by a projection of trace define isomorphism types for , and the fundamental group is a subgroup of measuring the self-similarity of under rescaling the trace. For the hyperfinite factor (it is fully self-similar); Connes showed property-(T) factors have countable , and Popa later produced II factors with and with prescribed fundamental groups, opening the deformation/rigidity theory.

Existence of type III. Type III factors are not pathological exceptions: they are generic. The Powers factors exist by the infinite-tensor-product construction, the group-measure-space algebra of a non-measure-preserving ergodic action is type III, and the local algebras of relativistic quantum field theory are type III 39.04.01. The Tomita–Takesaki modular automorphism group, built from a faithful normal state via 39.03.02, is the tool that detects and classifies them, since a type III factor admits no trace to anchor the comparison theory to a number.

Synthesis. Comparison of projections is the foundational reason von Neumann algebras carry a structure theory at all: the comparison theorem installs a total order on projection sizes inside a factor, and this is exactly what the type classification reads off — discrete order (type I), continuous order with a trace (type II), or an order with no finite values (type III). The dimension function generalises matrix rank, and putting these together the trace is dual to the order, recovering as the numerical face of the comparison theorem. The central insight is that the centre is the precise obstruction both to comparability and to being a single factor, so the central decomposition into types and the direct-integral decomposition into factors 39.03.01 are one and the same cut; this is exactly the bridge from the bicommutant identity of 39.03.01 and the predual duality of 39.03.02 to a complete-invariant program. The continuous dimension of II and the tracelessness of III generalise, respectively, the finite-rank and the runaway scales, and they hand to modular theory 39.04.01 the type III factors that no trace can reach — the deformation/rigidity invariants such as the fundamental group then animate the bare order with a moduli theory.

Full proof set Master

Proposition (equivalence is an equivalence relation). On the relation is reflexive, symmetric, and transitive. Proof. Reflexivity: has . Symmetry: if , , then has , , so . Transitivity: if via and via (so ), set . Then since is a projection, and ; computing, . Hence implements .

Proposition (additivity of equivalence over orthogonal families). If and are orthogonal families with via , then . Proof. The partial isometries have mutually orthogonal initial spaces and mutually orthogonal final spaces . The sum converges strongly and lies in (a strong limit of finite partial sums, each in , and is SOT-closed 39.03.01). Orthogonality gives and , the cross terms vanishing because for (ranges of orthogonal) and similarly for .

Proposition (a factor with a faithful normal finite trace is finite, and the trace is unique up to scale). Let be a factor with a faithful normal trace , . Then is finite and any normal trace on equals . Proof. Finiteness is Exercise 5. For uniqueness, by the comparison theorem any two projections are comparable, so the function is a dimension function: and . A normal trace likewise yields with the same additivity and equivalence-invariance. On a factor the comparison order is total, and any two normal dimension functions agreeing on the total order are proportional: for dyadic-rational sizes one halves repeatedly (possible since takes all values in for II, or all of for I), forcing there, and normality (order-continuity) extends the equality to all projections; linearity and density of the span of projections extend it to all of . Hence .

Proposition (the type decomposition is unique). There exist unique central projections summing to such that is type I, type II, type III. Proof. Let be the central support of the supremum of all abelian projections (this supremum's central support is central). Then has an abelian projection of full central support (type I), and has none. Within , let be the central support of the supremum of all finite projections; then has a finite projection of full central support and no abelian one (type II), while the remainder supports no nonzero finite projection (type III). Uniqueness: the defining properties (existence/non-existence of abelian and finite projections of full central support) are intrinsic to the reduced algebra, so any central projection splitting into these types must agree with on each block; a central projection determined by an intrinsic property of its reduced algebra is unique. The further split uses finiteness versus proper infiniteness of the unit, equally intrinsic.

Proposition (II has continuous dimension: every value in is attained). Let be a II factor with trace and . There is a projection with . Proof. The trace is normal and faithful, and has no minimal projection (a minimal projection would be abelian, making type I). Given any projection with , non-minimality yields , and the comparison theorem inside the factor lets one halve: there is with (compare and ; equality of the two halves is achievable because the order is total and the trace continuous). Iterating produces projections of every dyadic-rational trace in . For arbitrary , take an increasing sequence of dyadic projections with and orthogonal increments; their supremum satisfies by normality.

Proposition (the hyperfinite II factor is a factor). The weak closure in the GNS representation of the unique tracial state is a II factor. Proof. The union is a unital -algebra with a faithful tracial state (the consistent normalised matrix traces); its GNS representation has a cyclic and separating vector , and is a von Neumann algebra carrying the normal extension of 39.03.02. The trace is faithful and finite, so is finite. Factoriality: an element commutes with every , hence with the whole union ; since is weakly dense in , commutes with , and a tracial-state computation shows commutes with all matrix units in every , forcing to be scalar on each finite block and, by trace continuity, scalar overall: . Type: is infinite-dimensional (it contains for all ) and finite with a faithful normal trace, so it is neither I nor I nor properly infinite; it is II.

Connections Master

  • Von Neumann algebras and the bicommutant theorem 39.03.01 — the comparison theorem rests on partial isometries from polar decompositions remaining inside , which is guaranteed by SOT-closedness ; the central decomposition into types is the projection-lattice refinement of the direct-integral decomposition of over its centre introduced there, and the II factor of an i.c.c. group is the running example carried over.

  • The predual, normal states, and the σ-weak topology 39.03.02 — the trace on a finite factor is a faithful normal state, hence an element of the predual , and normality (order-continuity) is exactly what makes the dimension function attain suprema and the continuous-dimension construction close; the GNS representation of this tracial state builds the hyperfinite factor .

  • Tomita–Takesaki modular theory 39.04.01 — type III factors carry no trace, so the comparison theory cannot be numericised by a dimension function; the modular automorphism group of a faithful normal state is the substitute, and Connes' invariants , split type III into the continuum III, completing the classification the type decomposition begins here.

  • C-algebras: axioms, spectrum, functional calculus 39.01.01* — finite-dimensional C*-algebras are exactly the type I direct sums , the simplest finite von Neumann algebras, and the matrix-unit assembly that proves a type I factor is is the same device that classifies finite-dimensional C*-algebras.

Historical & philosophical context Master

The comparison theory and the type classification are due to Murray and von Neumann in their series On Rings of Operators (1936–1943) [Murray-von Neumann 1936]. The first paper introduced equivalence of projections by partial isometries and the relative dimension function, and discovered that a factor need not have its projection sizes quantised: alongside the type I algebras with dimension range they constructed a factor whose dimension takes every value in , the type II case, and named the phenomenon "continuous dimension". The construction of the first II factor used the regular representation of a group with infinite conjugacy classes, and the third paper (1943) proved that the approximately finite-dimensional II factor is unique — the result that singles out the hyperfinite factor .

The existence of type III, where no trace exists and the comparison theory cannot be anchored to a number, was established in the same series and long resisted finer analysis. Powers (1967) constructed a one-parameter family of mutually non-isomorphic type III factors by infinite tensor products, showing type III is richly populated. Connes (1973) classified type III factors into III, , via the modular spectrum and the invariants and extracted from Tomita–Takesaki theory, and proved the uniqueness of the injective (hyperfinite) factor of each type, for which he received the Fields Medal in 1982. The fundamental group, introduced by Murray and von Neumann as a measure of self-similarity, became computable and controllable only with Popa's deformation/rigidity theory in the 2000s, which produced II factors with fundamental group and with arbitrary prescribed fundamental groups.

Bibliography Master

  • Takesaki, M., Theory of Operator Algebras I, Springer, 1979. Ch. V.
  • Murray, F. J. and von Neumann, J., "On rings of operators", Annals of Mathematics 37 (1936), 116–229.
  • Murray, F. J. and von Neumann, J., "On rings of operators. IV", Annals of Mathematics 44 (1943), 716–808.
  • Dixmier, J., Von Neumann Algebras, North-Holland, 1981. Ch. III.
  • Powers, R. T., "Representations of uniformly hyperfinite algebras and their associated von Neumann rings", Annals of Mathematics 86 (1967), 138–171.
  • Connes, A., "Une classification des facteurs de type III", Annales scientifiques de l'École Normale Supérieure 6 (1973), 133–252.
  • Kadison, R. V. and Ringrose, J. R., Fundamentals of the Theory of Operator Algebras II: Advanced Theory, Academic Press, 1986. Ch. 6–8.

Operator-algebras spine, von Neumann-algebra structure unit. Comparison of projections by partial isometries and the comparison theorem as the order on sizes that the Murray–von Neumann type classification (I/II/III) reads off; builds on the bicommutant theory (39.03.01) and the predual/normal-state machinery (39.03.02), and hands the traceless type III factors to modular theory (39.04.01).