Commuting projections need not be maximal abelian

Commuting operators generate an abelian algebra. They need not account for every operator commuting with that algebra. A concrete example in the Jones projection relations shows why this distinction matters in proofs about factor representations.

We assume finite-dimensional tensor products and Going up and down the Jones tower, for the meaning of the projection relations. Basic references are [Jones] and [Takesaki]. The example below has parameter , corresponding to index four.

Construction and proof sources: Proposition 5.1 and Theorem 5.2 below give the tensor projections and the explicit nonzero matrix coefficient of the commutator. Their use in the canonical Markov representation is justified by Theorem 13.7 of Why the discrete projection algebra is unique, using the trace recursion of Lemma 11.1 and Proposition 11.2 in Removing a projection produces a subfactor. The comparison with Takesaki, Remark XIX.3.17 retains that representation and the displayed witness.

Projections onto an antisymmetric tensor

Let , with orthonormal basis , and let

On , let act as on positions and as the identity on the other positions. The inclusions , , make these definitions compatible as increases.

Proposition 5.1. These projections satisfy

The normalized product trace satisfies the Markov formula

Proof. The vector has norm one, so is an orthogonal projection. Operators on disjoint pairs commute. For the adjacent relation, work on three tensor factors. The range of is spanned by and . Direct application of the displayed matrix gives

For example, the first computation sends

Both sides of vanish off the range of . Reversing the three positions proves the other adjacent relation. Tensoring with identities proves the assertions for all positions.

The ordinary partial trace of over its second factor is . The normalized partial trace is consequently . Applying this partial trace to the last tensor factor proves the Markov formula.

A noncommutative commutant

Take the weak closure, in the faithful product-trace representation, of the algebra generated by all . Call it . Let

The even generators commute, so is abelian.

Theorem 5.2. The algebra is not maximal abelian in . Its relative commutant contains the self-adjoint operators

and these satisfy .

Proof. Since commute, is a projection orthogonal to both of them. Hence and commute with . Every even with commutes with all four generators , by distant commutation. Thus .

To show they do not commute, use five tensor factors. Let be the elementary tensor with a single in position , and elsewhere. On their span,

Therefore

Applying these formulas gives

and

Since is self-adjoint,

Here the bracket is the usual bra–ket matrix coefficient, conjugate-linear in the bra. Thus

The finite tensor algebra has faithful product trace, so this nonzero operator remains nonzero in its tracial representation and in the compatible infinite representation. An abelian algebra with a noncommutative relative commutant cannot be maximal abelian.

The even projections act on two disjoint pairs among five tensor factors. Compressing the neighboring odd projections gives two noncommuting operators in their commutant.

The diagram shows the tensor positions and the exact matrix coefficient in Theorem 5.2. The coefficient uses and .

Reference: [Takesaki, Remark XIX.3.17] asserts maximal abelianness for every permissible parameter. Theorem 5.2 disproves that assertion at ; proofs of factoriality must therefore use another argument.

The assertion that a Markov trace is factorial is a different assertion from maximal abelianness of its even-generator algebra. The counterexample does not disprove factoriality. Nor does it claim that all parameter values have the same relative commutant.

Exercises

Exercise 5.1 — introductory. Compute in the normalized product trace, and explain why this is independent of the number of tensor factors.

Solution. The projection has rank one on a four-dimensional space, so its normalized trace is . Tensoring with identity operators multiplies this by normalized traces of identities, each equal to one.

Exercise 5.2 — intermediate. Compute and using the formulas in the proof.

Solution. We have

Also , , and hence

Its -coefficient is zero, as required.

Exercise 5.3 — advanced. Explain why proving commutation with a finite set of generators would not normally suffice for membership in , and why it suffices here.

Solution. Membership requires commutation with all even generators and then their weak closure. Here the two nearby even generators annihilate , and all remaining even generators have distance at least two from each generator used in . The projection relations therefore prove commutation with every even generator. The commutant is weakly closed, so commutation extends to .

References

Written by GPT-6.1 Sol (OpenAI), Ultra reasoning effort, September 2026. Self-checked by the writing AI. Public domain (CC0).