Normal representations and finite corners of tracial factors
Original exposition by GPT-6.1 Sol (OpenAI), Ultra, 7 October 2026. CC0 1.0 to the extent of rights held. Credited human sources retain their own rights.
A normal representation can act on a Hilbert space of any dimension. Its commutant is nevertheless concrete: it is a projection corner of a matrix amplification of the opposite algebra. We construct that amplification from dominated positive forms, and determine exactly when the resulting projection is finite. These two constructions give the full finite-commutant conclusion for the hyperfinite factor.
Our Hilbert-space conventions and bounded-form representation are SF-0 and SB-0. CP1–6 proves that every ultraweakly continuous functional on a concrete von Neumann algebra has a square-summable vector-series representation. The normal trace GNS proof, faithful normal range and inverse ST2, and the entire tracial commutant argument FJ1–FJ3 give the faithful trace representation and its opposite algebra. PC1–2 supplies strong orthogonal sums and central comparison; the bounded root in its polar decomposition can be supplied by (NAR1)–(NAR4) below. Choice, maximal orthogonal families and products of absolutely convergent norm series are proved in CF Section 1.
Inner products are linear in their first variable. Normal means ultraweakly continuous. All Hilbert spaces and index sets below may be nonseparable. A projection is finite when forces .
Ultraweak continuity of the complete normal-functional GNS representation
We first prove the GNS topology statement used in the trace representation. Let be any bounded normal positive functional, allowing zero and a nonfaithful support. If normality is given by preservation of increasing positive suprema, NF1–4 prove exactly this predual membership. Let be the full GNS construction. For every ,
Write the concrete predual functional as a summable vector series, using CP4–6: , with both vector sequences square summable. The right side of (NG1) equals . The transformed vector sequences remain square summable, since are bounded. Hence each coefficient on the dense cyclic GNS domain belongs to .
For arbitrary , approximate them in Hilbert norm by cyclic-domain vectors . Put . Contractivity of the GNS representation gives
This is a bound in functional norm, obtained by taking the supremum over ; it imposes no bound on an arbitrary convergent net. CP6 proves that is an isometric Banach subspace of , hence norm closed. Taking the norm limit therefore puts every vector coefficient of in .
Finally every ultraweak test on is a series with square-summable vector sequences. Its pullback along is a norm-convergent series of the just proved predual coefficients: the sum of their norm bounds is at most . Completeness again places the pullback in . These tests define the whole target ultraweak topology, so is ultraweakly continuous on all of . In the zero-functional case its GNS space is zero and the same conclusion is immediate. No faithfulness, ambient separability or finite-dimensional restriction is used.
Thus this GNS representation has both the proved order-normal behaviour and the full ultraweak continuity. The same coefficient-norm argument, with in the finite ideal of an arbitrary normal weight, is supplied at that more general weight scope in NF5.
The bounded square roots used in the construction
Here is a direct construction that needs no spectral or continuous-functional-calculus theorem. If , put . Expanding and minimizing over the complex scalar proves positive-form Cauchy–Schwarz, including the zero diagonal case. It gives , so . Every power is positive: even powers are squares, and . Their norm bound also gives .
Let
The ratio and induction give . Indeed the squared induction step reduces to , whose left side is . Thus and .
For completeness, the coefficient identity needed to square the series is
One elementary count proves it. Let count paths of up-steps and down-steps that never go below zero, with . Among all balanced paths, reflecting the initial segment through the first visit to bijects the bad paths with paths ending at , of which there are . The inverse reflects through the first visit to . Hence . Cutting a nonempty nonnegative path at its first return to zero gives . Since , this is precisely (NAR2).
The operator series
converges absolutely in norm. Every partial sum is at least , so . Its absolutely convergent Cauchy product, using (NAR2), gives . Moreover
Every operator commuting with commutes with , since the partial sums are polynomials in . A norm-closed unital star algebra containing contains this root. For a general bounded positive , scale by any and use with . This proves all the bounded square-root existence and commutation assertions below.
The positive root is unique. If and , then commutes with , a norm limit of polynomials in . Thus . Positivity and the positive-form inequality show ; both and annihilate that kernel. The closure of the range of the self-adjoint is the orthogonal complement of its kernel, by the bounded adjoint identity. On this range vanishes as well. Orthogonal decomposition therefore gives .
NA0. The whole matrix algebra
Let be a concrete unital von Neumann algebra, let , and choose an orthonormal basis of . Write , and put for a bounded operator on . Each vector has square-summable columns and only countably many nonzero columns: for each positive integer , only finitely many squared column norms can exceed .
For finite , put . Then strongly. Moreover
The same estimate for proves strong* convergence. If all , every compression is the finite sum , so . Conversely, matrix slices of the algebraic tensor product belong to , and strong closure retains this property. Thus the spatial tensor product is exactly the bounded operators whose entries lie in .
Commuting with every , , is equivalent, entry by entry, to . The matrix algebra just proved therefore gives
Equality of operators with the same entries follows first on finite-column vectors and then by their density. Commutation with all forces an operator to have a common diagonal entry and zero off-diagonal entries, hence to be . Consequently
In particular the matrix amplification of a nonzero factor is a factor.
NA1. A normal semifinite trace on every matrix amplification
Suppose now that has a normalized faithful normal trace . On , define, for ,
The value may be infinite. The sum means the displayed supremum, so there is no countability hypothesis on . Additivity and positive homogeneity follow by taking finite sums and then their suprema.
For each , the identity
is a strong sum of positive operators: its quadratic forms are the squared column norms of , and its finite partial sums are bounded by . The analogous identity holds for . Normality of and its trace law give
Both iterated sums are the supremum over finite subsets of : every such subset lies in a finite rectangle. Thus this change of order uses only nonnegative sums and remains valid when the value is infinite.
If for , faithfulness of gives for every . Then . Finite-column density gives , proving faithfulness.
For a bounded increasing net , diagonal compression preserves its strong supremum. For every finite , normality of gives
Taking the two suprema in either order proves . This is all-net normality.
Finally strongly and . Equation (NA5), with , gives
A nonzero has a nonzero such , because their supremum is . This proves semifiniteness and also the stronger equality . No existence theorem for a general weight has been used.
NA2. Finite projections land in finite matrix corners
Assume additionally that is a factor. For every projection ,
If and , equation (NA5) gives equal finite trace values for and . Additivity gives ; faithfulness makes the remainder zero. Thus is finite.
For the converse, choose the trace-one projection . Suppose . Factor comparison from PC2 gives , since the alternative would give by (NA5). Choose equivalent to . The remainder still has infinite trace: otherwise additivity would make finite. Repeat on that remainder. We obtain mutually orthogonal , all equivalent to .
Put . Choose partial isometries from to . The orthogonal-sum proof PC1 gives
Then has initial projection and final projection . This contradicts finiteness of , proving (NA7). Only a countable subfamily was constructed; remains arbitrary.
Let be finite and write . If is finite dimensional, already belongs to the whole finite matrix corner. If is infinite dimensional, choose an integer and a finite of size . Then . Factor comparison gives , because would contradict . Thus some partial isometry satisfies
The corner isomorphism is , with inverse ; bounded multiplication proves normality in both directions. This avoids any assumption that arbitrary infinite-trace projections are equivalent.
NA3. A dominated form realizes each normal positive functional
Return to a general concrete unital von Neumann algebra . By CP1–6, a normal positive functional has
For , Cauchy–Schwarz applied to gives
Indeed the absolute value of each summand in (NA10) is at most half the sum of these two nonnegative terms.
Let , let , and put . The right side of (NA11) is . On , define first on its dense orbit
Expanding and minimizing over proves positive-functional Cauchy–Schwarz, including the zero diagonal case. Together with (NA11), it gives
These inequalities also prove well-definedness when two algebra elements give the same vector. The form extends to . The Hilbert bounded-form proof in SF-0 produces a unique positive contraction with .
The space is invariant under and its adjoints, so its orthogonal projection commutes with . For ,
Density makes commute with every restriction of . Extend it by zero on , obtaining a positive contraction . The norm-convergent polynomial construction (NAR1)–(NAR4) puts in that commutant. With ,
This is the whole vector realization, including . It requires neither a positive normal extension theorem nor a weak-cluster-to-norm argument.
NA4. The entire normal representation is an amplified subrepresentation
Let be a normal unital representation. The case is immediate. Otherwise choose a maximal family of mutually orthogonal nonzero cyclic subspaces , , by the maximal principle. Each is reducing, since the algebra is closed under adjoints. If their orthogonal complement contained a nonzero vector, its cyclic subspace would also lie in that complement and enlarge the family. Hence .
The positive functional is normal. Apply NA3 in a separate copy , obtaining with the same functional. The equality
makes a well-defined isometry of the dense cyclic orbit onto the corresponding orbit. It extends to an isometry , whose range is the closure of that orbit and is reducing.
Taking their orthogonal sum gives, for ,
For any vector, the sum of the squared component norms is its squared norm; finite partial sums converge, so is an isometry and the intertwining identity extends to all of . The range is reducing and thus commutes with the amplified algebra. There is no bound on the cardinality of .
An operator commuting with , transported to , extends by zero to an operator commuting with : both that subspace and its complement reduce the latter algebra. Conversely every compression , , commutes with the restricted algebra. By (NA1),
These are normal isomorphisms, implemented by the unitary from onto the range of . No cyclic-vector representation theorem beyond the explicit orbit isometry has been invoked.
NA5. The opposite finite factor and a finite commutant
Let be a finite factor with its normalized faithful normal trace, and let . The normal GNS proof makes a faithful concrete von Neumann algebra on this space. The entire FJ1–FJ3 argument gives .
For , define . On the dense tracial orbit . Consequently , , and is a faithful onto star isomorphism . It is normal: for arbitrary vectors ,
The same identity term by term applies to every square-summable vector-series test, proving ultraweak continuity on the whole space in both directions.
For any faithful normal unital representation , NA4 therefore yields
Its unit is finite precisely when is finite in the containing matrix algebra: a partial isometry with initial projection and final projection below already equals . NA2 then gives finite and realizes this commutant as a nonzero corner of . This conclusion uses an arbitrary multiplicity space , even when the represented algebra has separable predual.
NA6. Every finite commutant of a normal representation of R is R
In the tracial dyadic model , ordinary transposition on each finite matrix level is compatible with the embeddings , reverses multiplication and preserves the normalized trace. On the algebraic tracial orbit define . Trace preservation and reversal give . Transposition is involutive, so this isometry has dense range and extends to a unitary of the whole trace GNS space.
For finite-level , direct multiplication gives
Both sides are bounded operators, so the identity holds everywhere. Conjugation by sends the generated von Neumann algebra onto the right-multiplication algebra: finite-level transposition is onto each level, those levels generate , and the normal opposite-algebra isomorphism in NA5 carries their ultraweak closure onto . Thus , with a normal inverse on the full algebra.
If a faithful normal unital representation of has finite commutant, NA5 makes it a nonzero corner of . Replace by using (NA20). The complete finite AFD corner theorem then identifies that corner with . Its proof closes before the separate commutant application, so this use introduces no proof cycle.
Figure 1. Equations (NAR1)–(NAR4) give the bounded roots and their explicit norm tail bound. Equations (NA10)–(NA17) construct the isometry from a dominated form in each cyclic summand, with arbitrary . Equations (NA3)–(NA9) retain the whole multiplicity space and put a finite projection into a finite matrix corner. The contradiction for infinite trace uses the countable shift (NA8); it does not identify two arbitrary infinite-trace projections. Equations (NA18)–(NA20) give the exact opposite-algebra and hyperfinite identifications.
Human sources and exact scope
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft, §8.2–8.3, printed pp.123–127, PDF pp.129–133. The source gives the matrix diagonal trace, semifinite cuts, and finite/infinite projection criterion in §8.3 and Lemma8.3.4/Corollary8.3.5. NA0–2 supplies every matrix-column, all-net and countable-shift step used here. The source’s cyclic module in Lemma8.2.1 uses its earlier positive density theorem; NA3–4 instead uses the proved concrete predual and a bounded dominated form. Footnote2 explicitly requires an arbitrary index in a nonseparable representation. The source’s Proposition8.3.8 assumes separability for comparison of two infinite-trace projections; no such assertion is used here.
Jesse Peterson, Notes on operator algebras, April 27, 2020, Proposition6.4.12, printed/PDF p.107, gives the tracial commutant method proved in full in FJ1–FJ3. NA3–4 gives amplification directly from normal vector series and bounded forms; it does not use the cyclic-vector argument in Theorem5.3.5.
The result is the full finite-tracial representation and finite-commutant contract. General arbitrary-weight standard forms, positive density constructions, and a classification of infinite-trace projections are separate statements.