Finite maximal quotients

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. Original text: CC0 1.0.

A maximal C*-quotient of a finite von Neumann algebra is itself a finite von Neumann factor. Its quotient map can be singular, so ultraweak compactness cannot simply be passed through that map. We instead modify a Cauchy sequence on central projections invisible to the quotient. The modified sequence has uniformly small centre-valued L2L^2 increments. A weak cluster point then realizes the prescribed GNS limit.

Prerequisites are Central averaging and maximal ideals, Corollary 6.2; the centre-valued trace in Traces on von Neumann algebras, Part A, Theorem 5.2; and Multiplicity of a von Neumann algebra, Proposition 11.2. That proposition proves that the GNS representation of any tracial positive functional, whether normal or not, generates a finite von Neumann algebra with a faithful normal vector trace. We use Kaplansky density for its unit ball, and commutative Gelfand theory and C*-quotient functional calculus from C*-algebra functional calculus.

The central-patch argument below combines the linked programme proofs. Lemmas 1.1 and 2.1 turn a quotient Cauchy sequence into one controlled by every normal trace on the centre; Theorem 3.1 then proves that the GNS image is already weakly closed. The character on the centre may be singular, the algebra is arbitrary, and the quotient’s tracial Hilbert space may be nonseparable. The proof and the type I product example are supplied here in full.

Let MM be finite, without any countability hypothesis, let Z=Z(M)Z=Z(M), and let T:M→ZT:M\to Z be its normalized centre-valued trace. Fix a character χ\chi of ZZ, and put τ=χ∘T,Iχ={a:τ(a∗a)=0}.(0.1) \tau=\chi\circ T,\qquad I_\chi=\{a:\tau(a^*a)=0\}. \tag{0.1} The preceding lesson proves that IχI_\chi is a maximal two-sided ideal. Let (π,H,ξ)(\pi,H,\xi) be the GNS representation of τ\tau. Since τ\tau is tracial, its null left ideal is two-sided and equals ker⁡π\ker\pi: if τ(a∗a)=0\tau(a^*a)=0, then ∥π(a)π(b)ξ∥2=τ(b∗a∗ab)≤∥b∥2τ(a∗a)=0 \|\pi(a)\pi(b)\xi\|^2=\tau(b^*a^*ab) \leq\|b\|^2\tau(a^*a)=0 for every bb, and the converse follows by applying π(a)\pi(a) to ξ\xi. Thus π(M)≅M/Iχ\pi(M)\cong M/I_\chi.

1. Central patches that preserve a quotient sequence

Lemma 1.1. Suppose an∈M1a_n\in M_1 and τ((an+1−an)∗(an+1−an))<εn2,∑nεn<∞.(1.1) \tau((a_{n+1}-a_n)^*(a_{n+1}-a_n))<\varepsilon_n^2, \qquad \sum_n\varepsilon_n<\infty. \tag{1.1} There are bn∈M1b_n\in M_1 satisfying π(bn)=π(an)\pi(b_n)=\pi(a_n) and T((bn+1−bn)∗(bn+1−bn))≤εn2 1.(1.2) T((b_{n+1}-b_n)^*(b_{n+1}-b_n)) \leq\varepsilon_n^2\,1. \tag{1.2}

Proof. Put dn=an+1−and_n=a_{n+1}-a_n, hn=T(dn∗dn)h_n=T(d_n^*d_n). The central projection en=1[0,εn2](hn) e_n=1_{[0,\varepsilon_n^2]}(h_n) satisfies χ(en)=1\chi(e_n)=1. Indeed, χ(en)\chi(e_n) is zero or one. If it were zero, the spectral inequality hn≥εn2(1−en) h_n\geq\varepsilon_n^2(1-e_n) would give χ(hn)≥εn2\chi(h_n)\geq\varepsilon_n^2, contrary to (1.1). No preservation of this Borel spectral projection by χ\chi is assumed.

Set z0=1,zn=e1e2⋯en,pk=zk−1−zk. z_0=1,\qquad z_n=e_1e_2\cdots e_n,\qquad p_k=z_{k-1}-z_k. The znz_n decrease, χ(zn)=1\chi(z_n)=1, and the pkp_k are orthogonal central projections with χ(pk)=0\chi(p_k)=0. Define, with a0=a1a_0=a_1, bn=znan+∑k=1npkak−1.(1.3) b_n=z_na_n+\sum_{k=1}^n p_ka_{k-1}. \tag{1.3} This is a contraction, because it uses contractions on the members of a finite central partition of 11. Every pkp_k, and 1−zn1-z_n, lies in ker⁡π\ker\pi, as its τ\tau-value is zero. Hence π(bn)=π(an)\pi(b_n)=\pi(a_n).

The old central pieces in (1.3) are frozen rather than replaced at later stages. Consequently bn+1−bn=zn+1(an+1−an). b_{n+1}-b_n=z_{n+1}(a_{n+1}-a_n). The centre-module rule for TT gives T((bn+1−bn)∗(bn+1−bn))=zn+1hn≤εn2 1, T((b_{n+1}-b_n)^*(b_{n+1}-b_n)) =z_{n+1}h_n\leq\varepsilon_n^2\,1, because zn+1≤enz_{n+1}\leq e_n. □\square

The frozen pieces matter. Replacing the complement of every znz_n by a fixed identity can create uncontrolled increments on the annulus zn−zn+1z_n-z_{n+1}.

2. A cluster point recovers the GNS limit

Lemma 2.1. For a sequence bnb_n as in Lemma 1.1, there is b∈M1b\in M_1 such that T((b−bn)∗(b−bn))≤(∑k=n∞εk)2 1.(2.1) T((b-b_n)^*(b-b_n)) \leq\left(\sum_{k=n}^\infty\varepsilon_k\right)^2\,1. \tag{2.1} In particular π(bn)ξ→π(b)ξ\pi(b_n)\xi\to\pi(b)\xi.

Proof. For every positive normal λ∈Z∗\lambda\in Z_*, the functional λ∘T\lambda\circ T is a normal positive finite trace. Its L2L^2 seminorm obeys the triangle inequality. For m>nm>n, (1.2) gives (λ∘T)((bm−bn)∗(bm−bn))1/2≤λ(1)1/2∑k=nm−1εk. (\lambda\circ T)((b_m-b_n)^*(b_m-b_n))^{1/2} \leq\lambda(1)^{1/2}\sum_{k=n}^{m-1}\varepsilon_k. Positive normal functionals separate the order of ZZ, so T((bm−bn)∗(bm−bn))≤(∑k=nm−1εk)2 1.(2.2) T((b_m-b_n)^*(b_m-b_n)) \leq\left(\sum_{k=n}^{m-1}\varepsilon_k\right)^2\,1. \tag{2.2}

The unit ball M1M_1 is ultraweakly compact. Choose a cluster point b∈M1b\in M_1, with a subnet of the sequence tending to it and with indices tending to infinity. For a normal positive ω\omega, the function x↦ω(x∗x)x\mapsto\omega(x^*x) is ultraweakly lower semicontinuous. A direct proof is the identity ω(x∗x)=sup⁡c∈M{2Re⁡ω(c∗x)−ω(c∗c)};(2.3) \omega(x^*x)= \sup_{c\in M} \{2\operatorname{Re}\omega(c^*x)-\omega(c^*c)\}; \tag{2.3} positivity of ω((x−c)∗(x−c))\omega((x-c)^*(x-c)) gives one inequality, and c=xc=x gives the other. Every function inside the supremum is ultraweakly continuous.

Apply (2.3) with ω=λ∘T\omega=\lambda\circ T to the subnet in (2.2), for a fixed nn. It gives (2.1) after testing all positive normal λ\lambda. Evaluation of this central order inequality by the possibly singular character χ\chi now yields ∥π(b−bn)ξ∥2=τ((b−bn)∗(b−bn))≤(∑k=n∞εk)2⟶0. \|\pi(b-b_n)\xi\|^2 =\tau((b-b_n)^*(b-b_n)) \leq\left(\sum_{k=n}^\infty\varepsilon_k\right)^2 \longrightarrow0. The character is used only after the central inequality has been established. □\square

3. The quotient is a finite von Neumann factor

Theorem 3.1. Every maximal C*-quotient of a finite von Neumann algebra is a finite von Neumann factor.

Proof. All maximal ideals are IχI_\chi by the preceding lesson. Let N=π(M)′′N=\pi(M)''. The imported tracial-GNS theorem makes the vector state of ξ\xi a faithful normal tracial state on NN, so NN is finite and ξ\xi is separating.

First, the set π(M1)ξ⊆H(3.1) \pi(M_1)\xi\subseteq H \tag{3.1} is norm closed. Given a convergent sequence in that set, choose representatives an∈M1a_n\in M_1 and pass to a subsequence whose successive squared GNS distances satisfy (1.1), with, for example, εn=2−n\varepsilon_n=2^{-n}. Lemmas 1.1–2.1 supply b∈M1b\in M_1 with the same vector limit. This proves sequential closedness, hence closedness in the Hilbert-space metric.

The unit ball of π(M)\pi(M) is the image of M1M_1. Here is an exact contraction lift: if ∥π(a)∥≤1\|\pi(a)\|\leq1, put b=a f(a∗a),f(t)=1max⁡{1,t}.(3.2) b=a\,f(a^*a),\qquad f(t)=\frac1{\max\{1,\sqrt t\}}. \tag{3.2} Continuous functional calculus gives ∥b∥≤1\|b\|\leq1, and π(b)=π(a)\pi(b)=\pi(a), because ff is one on the spectrum of π(a)∗π(a)\pi(a)^*\pi(a).

Kaplansky density now makes π(M1)\pi(M_1) strongly dense in N1N_1. For x∈N1x\in N_1, its vector xξx\xi belongs to the norm closure of (3.1), and so equals π(b)ξ\pi(b)\xi for some b∈M1b\in M_1. Since ξ\xi is separating for NN, x=π(b)x=\pi(b). Therefore N1=π(M1),N=π(M). N_1=\pi(M_1),\qquad N=\pi(M). The quotient is indeed a von Neumann algebra, rather than merely a norm-closed algebra strongly dense in one.

Finally M/IχM/I_\chi is simple because IχI_\chi is maximal. A nontrivial central projection in NN would generate a nonzero proper closed ideal. Thus Z(N)=C1Z(N)=\mathbb C1, and the finite von Neumann algebra NN is a factor. □\square

There is no assertion that the quotient map is normal. It can annihilate all the central coordinate projections of a product while sending their supremum to the identity.

4. A type I product with a type II quotient

Let M=∏n≥1M3n(C),Z=ℓ∞(N), M=\prod_{n\geq1}M_{3^n}(\mathbb C), \qquad Z=\ell^\infty(\mathbb N), and let V\mathcal V be a free ultrafilter. Its central character is χ((cn))=lim⁡Vcn. \chi((c_n))=\lim_{\mathcal V}c_n. The centre-valued trace is the sequence of normalized matrix traces. Theorem 3.1 gives a finite factor N=M/IV,IV={(an):lim⁡Vtr⁡3n(an∗an)=0}.(4.1) N=M/I_{\mathcal V},\qquad I_{\mathcal V}= \{(a_n):\lim_{\mathcal V}\operatorname{tr}_{3^n}(a_n^*a_n)=0\}. \tag{4.1}

For j≥0j\geq0, choose nested coordinate projections pn,jp_{n,j} of rank 3n−j3^{n-j} if n≥jn\geq j, and set pn,j=0p_{n,j}=0 if n<jn<j. Set p0=1p_0=1 and pj=(pn,j)np_j=(p_{n,j})_n for j≥1j\geq1. The quotient trace satisfies τN(π(pj))=3−j.(4.2) \tau_N(\pi(p_j))=3^{-j}. \tag{4.2} Thus the quotient has an infinite strictly decreasing chain of nonzero projections. It is infinite dimensional. A finite type I factor is a finite matrix algebra, so the finite factor NN is of type II1_1. The domain is of type I, being a product of finite type I central pieces. Hence type I is not preserved under arbitrary C*-quotients of von Neumann algebras.

The quotient need not have separable predual or a separable GNS Hilbert space; no countability is claimed for those objects.

5. Graded exercises with complete solutions

Exercise 5.1 — Trace size and operator norm (basic)

In the product from Section 4, let qnq_n be rank one in M3nM_{3^n}, and let rnr_n have rank 3n−13^{n-1}. Determine the quotient images of q=(qn)q=(q_n) and r=(rn)r=(r_n), their operator norms when nonzero, and their quotient trace values.

Solution. Both product projections have norm one. Their normalized trace sequences are 3−n3^{-n} and 1/31/3. Formula (4.1) kills qq, while rr has nonzero image with trace 1/31/3. A nonzero projection has norm one, so ∥π(r)∥=1\|\pi(r)\|=1. This quotient distinguishes the normalized dimensions of the ranges; the original norm alone does not determine whether an element survives.

Exercise 5.2 — A singular quotient map (intermediate)

Let znz_n be the central projection supported only on the nn-th coordinate of the product. Compute the quotient image of every znz_n and compare the images of their finite sums with the image of their strong sum.

Solution. A free ultrafilter assigns zero to every singleton, so π(zn)=0,π(∑n=1kzn)=0. \pi(z_n)=0,\qquad \pi\left(\sum_{n=1}^kz_n\right)=0. In the product von Neumann algebra, ∑nzn=1\sum_nz_n=1 strongly. Its image is 1N≠01_N\ne0. Thus the quotient map does not preserve this increasing supremum and is not normal. Theorem 3.1 nevertheless makes its target a finite von Neumann algebra, by a different argument.

Exercise 5.3 — An uncountable orthogonal family in the quotient GNS space (advanced)

Show that the quotient in Section 4 has a nonseparable GNS Hilbert space. Use the diagonal matrices indexed by the nn ternary digits in a basis of C3n\mathbb C^{3^n}, and binary branches to choose one digit at every coordinate.

Solution. Put ω=e2πi/3\omega=e^{2\pi i/3}. For 1≤j≤n1\leq j\leq n, let un,ju_{n,j} be the diagonal unitary whose entry at the word (d1,…,dn)∈{0,1,2}n(d_1,\ldots,d_n)\in\{0,1,2\}^n is ωdj\omega^{d_j}. Uniform averaging of the independent ternary digits gives tr⁡3n(un,j∗un,k)={1,j=k,0,j≠k. \operatorname{tr}_{3^n}(u_{n,j}^*u_{n,k}) =\begin{cases}1,&j=k,\\0,&j\ne k.\end{cases} For a binary branch bb, put m(n)=⌊log⁡2n⌋m(n)=\lfloor\log_2 n\rfloor and let jn(b)=1+the integer encoded by the first m(n) bits of b. j_n(b)=1+\text{the integer encoded by the first }m(n)\text{ bits of }b. Then 1≤jn(b)≤2m(n)≤n1\leq j_n(b)\leq2^{m(n)}\leq n. Define the product unitary ub=(un,jn(b))nu_b=(u_{n,j_n(b)})_n. For distinct branches b,cb,c, their encoded prefixes differ for every sufficiently large nn; thus jn(b)≠jn(c)j_n(b)\ne j_n(c) eventually. The ultrafilter trace gives τ(ub∗uc)=0(b≠c),τ(ub∗ub)=1. \tau(u_b^*u_c)=0\quad(b\ne c),\qquad \tau(u_b^*u_b)=1. The vectors π(ub)ξ\pi(u_b)\xi, over all binary branches, form an uncountable orthonormal family. Consequently the GNS space is nonseparable. This is compatible with the finite-factor conclusion: sigma-finiteness of a von Neumann algebra, supplied here by its faithful trace, does not force its tracial Hilbert space to be separable.

References

Editable source · Sources and component terms