Week 3 — Type Classification (I, II, III) and Projections

Last week we identified von Neumann algebras as those *-subalgebras of closed in WOT/SOT, with factors as the indecomposable building blocks. We now ask for their first structural division. The Murray–von Neumann classification sorts factors into three types—I, II, and III—but does not classify all factors up to isomorphism inside a type. Type I is the “ordinary” world of bounded operators on a Hilbert space. Type II admits a trace and is the world of noncommutative integration. Type III admits no nonzero normal semifinite trace and is the type found for broad classes of local QFT algebras under the hypotheses made explicit in Block C. This loss of trace motivates the rest of the course: Tomita–Takesaki theory, relative entropy, and the crossed product.

How to use this chapter

  • In class: let projection comparison do the conceptual work. Build the type-I/II/III table only after finite, infinite, minimal, and equivalent projections have been tested in examples.
  • For self-study: keep a running ledger with four columns—minimal projections, finite projections, available trace, and canonical example. Use it to reconstruct the classification rather than memorize names.
  • Instructor checkpoint: require a trace-based proof that type III is not semifinite, and keep Murray–von Neumann’s projection theory distinct from Connes’ later III refinement and property-Gamma history.

0. Reading

Primary:

  • Bratteli & Robinson Vol. I, §2.6 (type classification).
  • Murphy, C*-algebras and Operator Theory, ch. 5.

Secondary, for the curious:

  • Murray & von Neumann, “On Rings of Operators” I (1936), the original classification.
  • Takesaki Vol. I, ch. V.
  • Connes, Noncommutative Geometry, ch. V.

Proof-status legend

The classification theory is technically heavy; in a one-week treatment we cannot prove most of the structural results. Each labeled result in this note carries one of the following tags so students know what level of justification is on offer:

  • [Proved.] Full proof given in the notes.
  • [Sketched.] Key idea given; details suppressed.
  • [Stated only — refs.] Black-box statement with references for the proof.
  • [Example-only.] Verified in a specific (usually finite-dimensional) case; the general statement is by analogy.
  • [Hypothesis-explicit.] Stated with the technical assumptions required, even if the proof is in references.

This labeling carries through Weeks 4–15 and is codified in the note-quality template and conventions.md. Weeks 1–2 use the same labels retroactively.

1. The order structure on projections

A projection in a vN algebra is a self-adjoint idempotent: . Projections are the “characteristic functions” of vN algebra theory: they correspond to closed subspaces (their range) and to yes/no questions about quantum states.

The set of projections in is a complete lattice: any family has a supremum (the projection onto the closed span of their ranges) and an infimum (the projection onto the intersection of their ranges). Both are again in . For the supremum, direct the finite subsets of indices by inclusion and form the finite joins , which belong to . The increasing net converges strongly to . Infima follow from complements. No finite-rank projection is being assumed—type II and III factors may have none.

1.1 Murray–von Neumann equivalence

Definition 1.1 (Partial isometry). An element is a partial isometry if is a projection. Equivalently, is a projection; equivalently, .

The two projections (the initial projection) and (the final projection) are the projections onto the kernel-complement and the range of , respectively. The partial isometry implements an isometry from to .

Definition 1.2 (Murray–vN equivalence). Two projections are Murray–vN equivalent in , written , if there exists a partial isometry with and .

This equivalence relation captures what it means for two projections to “have the same dimension” as seen by . A partial isometry implements an isomorphism between the ranges of and , but only one that lives inside the algebra. If two projections are equivalent in but not in , then “doesn’t see” their equivalence, and we treat them as inequivalent.

Physical picture. Murray–vN equivalence is a resource-theoretic notion of “same size”: two yes/no questions and count as equally big precisely when an operation available to the observer (an element of ) converts one into the other. The restriction "" is the physics. An observer confined to a subsystem, or to a spacetime region, cannot use global unitaries to compare subspaces; she can only use her own operations. The same pair of projections can therefore be “equally large” for a global observer () and incomparable for a local one (Example 1.4). The entire type classification below is, in this sense, a classification of what notions of size are available to a constrained observer — and the punchline of the course is that the observer confined to a bounded spacetime region (type III) has the most degenerate size notion possible: everything nonzero is infinite.

Example 1.3. In , two projections are Murray–vN equivalent iff they have the same rank (this is a standard linear-algebra fact). The partial isometry can be constructed as a “rotation” between the two ranges.

Example 1.4. In a non-factor like , two rank-1 projections — one in each summand — are not Murray–vN equivalent because no partial isometry connects them: every operator in the algebra is block-diagonal. This shows that the equivalence depends on the algebra, not just on the Hilbert-space ranks.

1.2 Order on projections

Definition 1.5. if for some projection (i.e., is dominated by in the usual sense ).

This is the order on equivalence classes: iff is equivalent to a subprojection of .

Theorem 1.6 (Comparison theorem for factors). [Sketched.] In a factor , any two projections are comparable: or .

This is one of the foundational results of Murray–vN: in a factor, the order on equivalence classes of projections is a total order. In a non-factor (e.g., ), projections supported on different summands are incomparable.

Proof sketch. Use Zorn’s lemma to find a maximal family of pairwise orthogonal subprojections of , each Murray–vN equivalent to a subprojection of . Set . By maximality, the “remaining” projection has no equivalent subprojection in . Use that is a factor to show that this forces either (so ) or is “exhausted” by the construction (so ). The argument requires care because of the choice of partial isometries; we omit the details.

The comparison theorem is what makes “dimension” of projections (relative to the algebra) a totally ordered invariant in a factor.

2. Finite versus infinite projections

Definition 2.1. A non-zero projection is finite if for all with and , we have . Equivalently: is not Murray–vN equivalent to a strict subprojection of itself.

This is the algebraic generalization of “finite-dimensional subspace.” A projection is infinite if it is equivalent to a strict subprojection of itself — Hilbert’s hotel.

Definition 2.2. A projection is minimal if implies or . Minimal projections are the “atoms” of .

Example 2.3. In :

  • Finite projections = projections of finite rank.
  • Infinite projections = projections of infinite rank (e.g., the identity if ).
  • Minimal projections = rank-1 projections, of the form for unit .

In , the projections form a “discrete” structure: ranks are integers, finite ranks are finite, infinite ranks are infinite. This will be the case in type I algebras generally.

Example 2.4 (Hilbert’s hotel). In , the projection (onto all of ) is equivalent to the projection onto . The shift is a partial isometry with and . So , demonstrating that is infinite in .

Example 2.5 (Type II oddity). In a type II factor , every projection, including the identity, is finite, but the projection lattice is not discrete — between any two projections there is a continuum of projections (parameterized by trace value). This is the “continuous-dimension” structure that gives type II its name.

3. The Murray-von Neumann classification

Theorem 3.1 (Murray-von Neumann 1936). [Stated only — refs: Murray–vN, Ann. of Math. 37 (1936) 116–229; Takesaki Vol. I §V.1.] A factor falls into exactly one of three types:

  • Type I: contains a non-zero minimal projection.
  • Type II: contains no minimal projection but contains a non-zero finite projection.
    • Type II if is finite.
    • Type II if is infinite.
  • Type III: every non-zero projection in is infinite.

The classification is exhaustive and exclusive: every factor is in exactly one type.

Physical picture. Read the trichotomy as three answers to the question “what is the smallest thing the observer can resolve?” Type I: there is an atom—a minimal projection, a finest-grained yes/no question. Type II: there is no atom—questions can be subdivided forever—but a trace still calibrates their continuous size. Type III: there are no atoms and no faithful normal semifinite calibration; every nonzero projection is equivalent to a proper part of itself. This does not mean that equal decompositions are impossible—proper infiniteness supplies many such decompositions. It means that the finite dimension-counting intuition has collapsed. In local QFT, combined with a cyclic-separating vacuum, this algebraic structure is the setting in which sharp tensor factors and intrinsic reduced density matrices fail.

3.1 Type I factors

Theorem 3.2. [Sketched.] Every type I factor is isomorphic to for some Hilbert space . The isomorphism class is determined by :

  • Type I for : .
  • Type I: with infinite; in the separable case, .

Sketch of proof. Let be a type I factor on , and pick a minimal projection (exists by Theorem 3.1). Since is a factor, the comparison theorem gives a family of pairwise orthogonal projections , all equivalent to , with . Let be the cardinality of this family.

Pick partial isometries with and . Then the form a system of “matrix units” satisfying . The vN algebra they generate is isomorphic to . Plus, the original contains as generators (using minimality of ), so .

This is the “rigidity” of type I: there is essentially only one type I factor of each cardinality, and they are all the standard .

3.2 Type II factors

Theorem 3.3 (Trace existence on type II). [Stated only — refs: Murray–vN 1937; Takesaki Vol. I §V.2.] Every type II factor admits a unique normalized faithful normal trace , characterized by and for all .

The uniqueness is striking: the trace is intrinsic to the algebra, not requiring any external data. This contrasts with for infinite-dimensional , where the standard trace is only an extended-valued semifinite weight and is infinite on the identity.

The trace gives a notion of “dimension” for projections that takes continuous values in : for a projection , the number is the “fraction of the algebra” that occupies.

Lemma 3.4 (Continuous-dimension). [Sketched.] In a type II factor, the values fill the entire interval .

Sketch. Using the comparison theorem and divisibility properties: for any with , one can find with (split into two equivalent halves). Iterating gives a dense set of dyadic rationals; SOT-limits of projections give the continuous interval.

This is the source of the name “noncommutative integration”: type II algebras are like “spaces of bounded measurable functions” with a continuous probability measure, where projections play the role of indicator functions of measurable sets.

Physical picture. A type II factor is a quantum system in which “dimension of a subspace” has become a continuous quantity, the way “number of microstates” becomes continuous in classical statistical mechanics when one passes from counting to phase-space volume. There is no smallest subspace — no qubit you can point to — but there is a perfectly good answer to “what fraction of the system is this?” In Block D this is exactly what makes the crossed-product algebras of gravity tractable: a type II algebra supports density operators and entropies relative to the trace ( with , ), even though a diffuse type-II factor has no normal pure states. Singular pure states may still exist when the factor is viewed as a C*-algebra. Entropy differences can then be finite and meaningful under the hypotheses developed later, while absolute state counting still is not — which matches the physical situation of generalized entropy in gravity, where regulated differences, rather than a bare local entropy, are the controlled quantities.

3.3 Type II factors

Intrinsic definition. A factor is type II if it is type II (no minimal projection but has a non-zero finite projection, per Theorem 3.1) and the identity is infinite. Equivalently, has no minimal projections and admits a faithful normal semifinite trace — defined on a dense *-ideal and satisfying where defined — but no normalized trace. The condition on minimal projections is needed: with also carries a faithful normal semifinite trace, , and no normalized one, but it is type I.

The trace takes projection-values in the full extended interval .

Theorem 3.5 (Structure theorem). [Stated only — separability assumed; refs: Murray–vN; Takesaki Vol. I §V.1.] Every type II factor on a separable Hilbert space is isomorphic to for some type II factor .

The II factor depends on the II factor and need not be the hyperfinite factor of §5.2. The hyperfinite case is the one that reappears in Block D as the continuous core of the hyperfinite type III factor.

The structure theorem is what justifies the slogan “type II = II tensor type I.” But the type is intrinsic to the algebra (a property of its projection lattice and trace), and we should be careful to distinguish the intrinsic definition from the structural decomposition. The decomposition is a theorem; the intrinsic property is the definition.

3.4 Type III factors

Theorem 3.6. [Stated only — refs as Theorem 4.1 below.] A factor is type III iff it admits no faithful normal semifinite trace, iff every non-zero projection in is infinite, iff for every projection there is a partial isometry with and a strict subprojection of .

The three characterizations are equivalent and reinforce one another. The operational consequences:

  • No intrinsic density matrices: there is no canonical semifinite trace on the algebra relative to which a normal state could be written as . In a particular concrete representation, a normal functional may still be represented by an ambient trace-class operator; that representation is neither intrinsic nor a reduced density matrix for a tensor factor.
  • No intrinsic local von Neumann entropy of the form , because neither the local trace nor its density exists inside the factor.
  • Different entropy notions: Araki–Uhlmann relative entropy (Week 7) is the substitute that survives in type III.

Type III factors are bizarre by standard QM intuition. Yet they are the typical case in QFT. More precisely, phase-space and split/approximation hypotheses supply the hyperfinite side; an independent scaling or modular-spectrum theorem supplies type III; factoriality removes the centre; and separable predual lets the Connes—Haagerup classification identify the unique hyperfinite type III factor. These hypotheses are non-trivial, and the result is not “true of every QFT” in the loose sense; Week 12 gives the full citation chain. The whole motivation for the crossed product (Block D) and for Witten’s gravitational dressing is to pass from the sharp type-III algebra to an enlarged semifinite algebra under additional hypotheses.

We refine the classification of type III in §6 below.

4. Trace existence

Theorem 4.1 (Existence of trace). [Type-III no trace direction sketched below; other directions stated only — refs: Murray–vN; Takesaki Vol. I §V.2.] A factor admits a faithful normal semifinite trace iff is of type I or II.

In particular, type III factors are characterized by the non-existence of trace.

Why does the trace exist for I, II and not III?

  • Type I: the trace is the “operator trace” on . Normalized in finite dimensions, semifinite in infinite.
  • Type II: the Murray–von Neumann dimension theory uses comparison and continuity of the projection lattice to construct a normalized dimension function on projections, then extends it to a faithful normal trace. The resulting trace is the unique normal state invariant under all inner automorphisms. There is no minimal projection relative to which one could count ranks.
  • Type II: tensor product of II trace and trace.
  • Type III: here is the short contradiction that uses both semifiniteness and infiniteness. Suppose were a faithful normal semifinite trace and choose a non-zero projection . Semifiniteness supplies a non-zero with . Since every non-zero projection is infinite, there is a strict subprojection with . Traciality gives , while finite additivity on the orthogonal decomposition gives Hence . Faithfulness forces , contradicting . Thus no faithful normal semifinite trace exists.

The crucial role of trace in physics: it underlies the standard von Neumann entropy. The absence of trace in type III is what forces the development of relative-entropy methods, the Araki–Uhlmann entropy, and ultimately the crossed-product construction that recovers a semifinite trace by adjoining the modular-translation degree of freedom. Interpreting that degree of freedom as an observer’s clock is additional physics, introduced only in the gravitational applications.

Physical picture. The trace is the algebraic form of a state-independent counting measure. For a finite-dimensional projection, counts dimensions; in a II factor, generalizes the fraction of available degrees of freedom selected by . Type III has no faithful normal semifinite version of that measure. Therefore a sharply local QFT algebra has no intrinsic “uniform local ensemble” and no entropy of the form . This statement does not say that every local state has a literal temperature. It says something more precise: absolute state counting is unavailable, whereas comparisons of states through modular theory and relative entropy remain meaningful. Block D will enlarge the algebra to a semifinite core, where a trace becomes available only after the extra modular degree of freedom has been included.

5. Concrete examples

5.1 Type I factors

  • for any Hilbert space . Type I if , type I otherwise.
  • acting on is not a factor (it is its own commutant); decomposed into factors via direct integral over , each fiber is type I.
  • Tensor products — still type I.

5.2 Type II: hyperfinite construction

The most concrete and useful type II factor is the hyperfinite II factor , constructed as an inductive limit of matrix algebras.

Construction. Set , with the normalized trace . The inclusion via is trace-preserving: .

Form the inductive limit (a *-algebra) with the consistent trace . Run GNS in this trace state: in our convention, linear in the second slot, is the completion of with respect to . Take the WOT-closure of the image of in .

The result is the hyperfinite II factor. Concretely:

  • Every element of is a WOT-limit of elements in some .
  • The trace extends from to as a faithful normal state: where is the cyclic vector (image of ).
  • is a factor: its center is trivial. (This requires a non-trivial argument — see Murray–vN.)
  • contains projections of every value : dyadic rationals from finite-dimensional approximation, full interval by SOT-limits.

Theorem 5.1 (Murray–vN uniqueness). [Stated only — refs: Murray & von Neumann, On rings of operators IV, Ann. of Math. 44 (1943) 716–808.] Among factors with separable predual, the hyperfinite II factor is unique up to isomorphism.

This is the analog of Theorem 3.2 (every type I factor is ): the hyperfinite II factor is the type II factor that arises from inductive limits of finite-dimensional algebras. Non-hyperfinite type II factors exist (e.g., the group factors — see below) and are not isomorphic to .

5.3 Type II: group factors

For a discrete icc group , the group vN algebra is a type II factor.

Verification (clean route via factor classification). Three structural facts together force type II:

  1. is a factor when is icc. Any commutes with every , so its expansion has coefficients constant on conjugacy classes. The icc condition (every non-identity conjugacy class is infinite) combined with -summability of the coefficients forces for , so . Hence has trivial center.

  2. Faithful normalized trace exists. The trace is faithful, normal, normalized, and tracial (Week 2 Example 5.5). Existence of a normalized trace rules out types II (no normalized trace) and III (no trace at all).

  3. No minimal projections (and infinite-dimensional). Every type I factor with is finite-dimensional, while for infinite is infinite-dimensional (the for distinct are linearly independent). Type I factors do not admit a normalized trace (only a semifinite one), contradicting (2). So is not type I.

By Theorem 3.1 the only remaining option is II. [Sketched.]

The argument deliberately avoids relying on a ” has projections of every trace value ” claim. That conclusion follows from the general continuous-dimension theorem for II factors once the type has been established, but it cannot be used here as an input without making the reasoning circular.

The icc condition is essential. For : not icc (the conjugacy class of is just ). And indeed — abelian, not a factor.

Examples of icc groups. (finitary permutations of ); free groups for ; .

Theorem 5.2 (Murray–von Neumann 1943). [Stated only — ref: On rings of operators IV, Ann. of Math. 44 (1943) 716–808.] is not isomorphic to the hyperfinite II factor .

Murray and von Neumann introduced property for this purpose: has property , whereas does not. Connes’ 1976 classification of injective factors later placed this distinction in a much broader framework, but it is not the original proof of non-isomorphism. We will use neither proof; the point is simply that the trace and the Murray–von Neumann type do not classify II factors up to isomorphism.

5.4 Type II: tensor extension

is a type II factor. The semifinite trace is . Projections have continuous trace values in .

This will be the type of the crossed product algebra in Block D: the dressed algebra for type III is type II.

5.5 Type III: Powers factors (preview of Week 4)

We construct a type III factor in detail in Week 4 via the Powers construction — an infinite tensor product of ‘s with each factor in a non-tracial state. For each (strictly!), the resulting algebra is the hyperfinite type III factor. The endpoint corresponds to the tracial product state, and the resulting algebra is the hyperfinite II factor — not the type III factor.

Important caveat on notation. The Connes classification (§6 below) names a separate full-spectrum class III, distinct from “the endpoint” of the Powers III family. Concretely:

  • Powers III family: strictly. Discrete S-invariant .
  • Tracial endpoint of the Powers family (): hyperfinite II.
  • Type III: a separate Connes class with S-invariant (full positive half-line). The QFT case, not the Powers limit.

The contrast with §5.2 is striking: changing the state on each factor from tracial to non-tracial qualitatively changes the type of the inductive limit, from II to III. A small change in state, a qualitative algebraic shift.

6. The type III classification (Connes’ invariants)

Type III factors come in a one-parameter family of subtypes, distinguished by Connes’ invariants. We state the classification; we do not derive it.

A subtle point first. The “period” or “spectrum” of a modular flow depends on a choice of state (a cyclic-separating vector). The thing that is invariant of the algebra alone is constructed by intersecting over all faithful normal states, giving the Connes S-invariant:

where is the spectrum of the modular operator associated with the weight . This intersection is a closed multiplicative subset of that depends only on . The terms weight, faithful, normal, and semifinite are defined together in Appendix A §A.5.1. A faithful normal state is a special finite example of such a weight.

Theorem 6.1 (Connes 1973). [Stated only — refs: Connes, Ann. Sci. ENS 6 (1973) 133–252.] A type III factor falls into one of three subfamilies, distinguished by :

  • Type III for : — a discrete multiplicative subset. The Powers factor (Week 4) realizes this case explicitly; on the Powers state the modular flow is periodic with period , but periodicity of the flow is a state-level statement and the algebra-level invariant is .
  • Type III: (no nontrivial multiplicative structure).
  • Type III: — the full positive half-line. Equivalently, every faithful normal semifinite weight has full positive modular spectrum. This is the “most non-tracial” subtype in the precise sense of the -invariant.

Type III is the type relevant to standard QFT examples under additional hypotheses. Week 12 makes the theorem chain precise. Bisognano–Wichmann computes one preferred wedge modular operator; a separate type or scaling theorem is needed because the spectrum of one state does not evaluate the intersection defining .

Physical picture. In a finite type-I standard form, modular eigenvalues are ratios of density-matrix eigenvalues. This makes a discrete Powers ladder and a continuous III spectrum easy to visualize. Beyond type I, however, those numbers are modular spectral values, not literal ratios of eigenvalues of a local density matrix. The -invariant extracts the part of the modular spectrum that survives every faithful weight. The analogy is a mnemonic; Week 12 supplies the classification theorem.

We will see Connes’ invariants in operational form in Week 6 (modular flow on a specific state) and in Week 11 (Bell-CHSH on type III algebras in QFT).

Hyperfinite type III — the citation chain. In the separable-predual setting there is a unique hyperfinite type III factor up to isomorphism—but pinning down the precise statement and its proof is a multi-paper effort:

  • Connes (1976, Ann. of Math.) — classified the hyperfinite type III factors for and reduced the III case to a remaining technical question.
  • Haagerup (1987, Acta Math.) — completed the classification by proving uniqueness of the hyperfinite type III factor.
  • Buchholz–D’Antoni–Fredenhagen (1987, Comm. Math. Phys.) — obtained the hyperfinite universal structure from phase-space/split assumptions, retaining the centre in the general statement. A separate modular or scaling input supplies the III subtype.

We do not prove these in this course; they are stated and used. [Stated only — refs as above.]

7. Why this matters for QFT

Block C will state and use the following result, with hypotheses made explicit there:

Claim (hypothesis-explicit synthesis, to be used in Block C). [Stated only.] If suitable phase-space hypotheses give hyperfiniteness, a separate scaling/modular theorem gives type III, and the bounded-region local algebra is a factor with separable predual, then is isomorphic to the unique hyperfinite type III factor.

The hypotheses are non-trivial and must be verified model by model. Free-field and many conformal nets provide standard examples. No complete four-dimensional interacting construction licenses an automatic extrapolation to QCD or to the Standard Model.

Citation chain. This is not the Haag–Hugenholtz–Winnink theorem (1967), which is about the equivalence of KMS and equilibrium states — a foundational but distinct result. The local-algebra type III universality theorem is the cumulative product of:

  • Driessler (Comm. Math. Phys. 1975/1977) — modular-spectrum criteria forcing local algebras to be type III.
  • Fredenhagen (Comm. Math. Phys. 97 (1985)) — type III under asymptotic-scale-invariance / modular-spectrum hypotheses.
  • Buchholz–Wichmann (Comm. Math. Phys. 106 (1986)) — nuclearity as the right phase-space condition.
  • Buchholz–D’Antoni–Fredenhagen (Comm. Math. Phys. 111 (1987)) — hyperfinite universal structure from phase-space/split input, with the centre present in the general result.
  • Buchholz–Verch (Rev. Math. Phys. 7 (1995)) — scaling-algebra route from a nontrivial scaling limit to the III conclusion under its hypotheses.

We will not reproduce this chain. Block C states the theorem with hypotheses, cites the references, and uses the result. A student who wants the proofs should consult the references directly (or Halvorson’s “Algebraic Quantum Field Theory” 2006 review, which surveys the chain).

Implications:

  1. No intrinsic local density matrix. A normal local state may have an ambient trace-class representative on the vacuum Hilbert space, but there is no canonical trace-density inside the type-III algebra and no sharp tensor-factor partial trace.

  2. No intrinsic absolute von Neumann entropy. Regulated entanglement entropies may diverge as the cutoff is removed, but that divergence is not a proof of type. Relative entropy remains intrinsic and may be finite or ; regulated differences require a controlled matching theorem.

  3. Operational resources, with scope. Type-III factors are universal embezzlers in the precise approximate sense reviewed in Week 12. Bell maximality, by contrast, is a theorem about a specified pair of commuting local algebras and cannot be inferred from the type label alone.

  4. The continuous core supplies a semifinite enlargement. Block D forms on a space involving . For a III factor the core is II with a faithful normal semifinite trace. Trace-densities and entropies still require normality and integrability, and the “modular clock” interpretation is extra physical structure.

8. What to take away

  1. Murray–vN classification. Three families: I (ordinary operator factors), II (semifinite with continuous projection dimension), and III (no faithful normal semifinite trace). Type III subdivides into III, III for , and III; the symbols and label distinct Connes classes and are not endpoints of a single Powers construction.

  2. The trace is the engine. Types I and II have traces; type III does not. Most quantum-mechanical reasoning relies on trace and breaks down in type III. Two structurally distinct fixes operate in tandem in the rest of the course: (a) modular theory (Block B) gives the canonical state-dependent dynamics — the modular flow — for any faithful normal state on a type III algebra, without producing a trace; (b) the crossed product (Block D) uses that dynamics to build a larger semifinite algebra carrying a faithful normal semifinite trace. The trace lives on the dressed algebra, not on the original type III algebra.

  3. The hyperfinite II factor. Concrete example, constructed by inductive limit of matrix algebras with the tracial states. Unique up to isomorphism in the separable-predual setting (Murray–vN). An analogous hyperfinite type III factor exists and is the local-QFT type under the additional hypotheses stated in Week 12.

  4. Connes’ invariants. Type III subdivides into III, III (), and III. Type III is the generic local-QFT case under the additional hypotheses stated in Week 12 and is characterized by the full Connes -invariant .

  5. The challenge type III poses. Without trace, we need new tools: relative entropy (Week 7), modular theory (Block B), crossed products (Block D). These are exactly what Tomita–Takesaki provides.

  6. The vN closure of a C*-algebra is state-dependent — and so its type can be. Type is an isomorphism invariant of the von Neumann algebra: once you have a vN factor, its type is intrinsic and does not depend on any external state. What does depend on the state is which vN algebra you get out of the GNS construction in the first place. The Powers construction (Week 4) is the cleanest illustration: the same UHF C*-algebra , completed in the tracial product state , yields the hyperfinite II factor; completed in a non-tracial product state , yields a type III factor. Two different von Neumann algebras come out of the same C*-algebraic skeleton, depending on which GNS representation you take. The two vN algebras are not isomorphic, and each has its type intrinsically.

9. Looking ahead: Week 4

Next week we introduce the KMS condition — the algebraic notion of thermal equilibrium that survives in type III, where Gibbs states do not exist. We construct the Powers factor (a concrete type III) by infinite tensor product, and we preview the central theorem of Block B: the Tomita-Takesaki theorem, which says that every cyclic-separating vector for a vN algebra produces a canonical one-parameter “modular flow” for which it is KMS at (in our upper-strip convention; see Week 4 §6.1 for the sign-convention discussion). This gives type III the dynamical structure it lacked.

10. Problem set

Core problems.

1. Type I in detail. (a) Show that has minimal projections: any rank-one projection for unit is minimal. (b) Identify the trace on when (the standard ). When , regard the standard trace as an extended-valued weight on positive operators. Show that it cannot be normalized, that it is finite on positive finite-rank operators, and that these operators witness semifiniteness below every nonzero positive element. (c) Show that any two minimal projections in a type I factor are Murray–vN equivalent. (d) Compute the trace of the projection for an arbitrary minimal .

2. Comparison theorem in finite dimensions. For , prove the comparison theorem (Theorem 1.6) directly: any two projections satisfy or vice versa, and projections of equal rank are Murray–vN equivalent. Construct explicit partial isometries.

3. Hilbert’s hotel. For : (a) Construct an explicit partial isometry with and . Identify the missing dimension. (b) Show that the identity projection is Murray–vN equivalent to any non-zero projection of infinite rank. (Hint: construct a partial isometry via a suitable bijection of the basis.) (c) Conclude that every infinite-rank projection is infinite, and every finite-rank projection is finite.

4. The hyperfinite II factor. Recall the inductive construction in §5.2. (a) Verify that the inclusion (via ) is trace-preserving for the normalized traces. (b) Verify that the consistent trace extends to the inductive limit . (c) Show that contains projections of every value (rationals with denominators a power of 2). (d) (Harder.) Show that contains projections of every value — the trace takes all real values in on projections. (e) Work at the finite stage . Exhibit a diagonal projection of rank , compute its normalized trace, and follow it under the embedding . This is the finite-stage dyadic case; the non-dyadic value is reserved for Problem 7.

5. No semifinite trace in type III. Suppose is a factor in which every non-zero projection is infinite. Assume for contradiction that is a faithful normal semifinite trace. (a) Use semifiniteness to show that every non-zero projection contains a non-zero subprojection with . (b) Since is infinite, choose with . Use traciality and the finite value of to show . (c) Apply faithfulness and obtain the contradiction. Explain explicitly why starting with a projection of trace would make the subtraction invalid.

6. Group factors. For a discrete icc group: (a) Verify that the trace is normal and tracial on . (b) Show that the trace takes the value on group elements — purely supported at the identity. (c) For , use the functional calculus of the Haar-spectrum unitary to find a projection in with trace . (Hint: take the spectral projection of for a semicircle in .)

Starred problems.

7*. Type II as continuous-dimension matrix algebras. Construct an explicit projection with . (Hint: approximate from above and below using projections; the dyadic rationals are dense.) Generalize: for any , exhibit a projection of trace in .

8*. Group factors and property . Show that is a factor by proving that is icc. State Murray and von Neumann’s property- distinction between and , and then explain how Connes’ later injectivity classification subsumes the hyperfinite side of the comparison. Keep the two historical results separate.

9*. Comparison theorem revisited. Prove the comparison theorem (Theorem 1.6) in full for a factor , using Zorn’s lemma and the comparability of projections in the type I subcase. Sketch how the argument extends to types II and III.

10** (Optional, very hard). Study the property- separation directly. Construct an asymptotically central sequence of trace-zero unitaries in the hyperfinite factor , and read the Murray–von Neumann argument that no such sequence exists in . Explain why this proves non-isomorphism. Then compare this invariant with Connes’ 1976 characterization of injective factors. (Do not formulate the issue in terms of an inner automorphism that is not approximately inner: every inner automorphism is already approximately inner.)

Self-study answer checkpoints

The checks below cover the core route through projection comparison and traces. Starred problems remain theorem- and source-led, especially the non-dyadic construction and property- arguments.

  1. Type I. Rank-one projections are minimal. In infinite dimension the standard trace is an extended-valued faithful normal semifinite trace, finite on finite-rank positives and infinite on ; a nonzero dominates for some rank-one inside a nonzero spectral subspace of . Minimal projections in a factor are equivalent. In , .

  2. Finite-dimensional comparison. The comparison is exactly rank comparison. If , an isometry from into , extended by zero, gives the required partial isometry; equality of ranks gives equivalence.

  3. Hilbert’s hotel. The unilateral shift has and . Any infinite-rank projection on separable has range isomorphic to , hence is equivalent to and to a proper subprojection of itself. Finite-rank projections cannot be equivalent to a proper subprojection because rank is preserved.

  4. The hyperfinite II factor. The embeddings preserve normalized trace. The compatible trace extends first to the UHF norm closure and then normally to the GNS weak closure. At finite stages, projection traces are dyadic. Increasing strong limits of nested dyadic projections, together with normality, realize every . For part (e),

    has normalized trace , retained under every later embedding.

  5. No semifinite trace in type III. Semifiniteness supplies with . If and , then and finite additivity gives , contradicting faithfulness. The finiteness of is essential: is not an argument.

  6. Group factors. The vector functional at is normal, tracial, faithful, and satisfies . For , the unitary has Haar spectral measure on ; the spectral projection of any semicircle therefore has trace .

Wiki connections. Araki–Uhlmann relative entropy · entanglement embezzlement · Liu’s lectures on entanglement and von Neumann algebras · Bell inequalities in QFT (research area) · relative entropy in QFT (research area)


Notes prepared for the algebraic-QFT course, Semester I Block A. Last revised 2026-09-29.