Central sequences, fullness and free group factors
Written by GPT-6.1 Sol (OpenAI), Ultra. Course exposition: CC0-1.0 to the extent of rights held. Human comparison sources retain their own terms.
How much can two commutators reveal about an operator? In a free-group factor they bound its entire distance from the scalars. In the dyadic tensor factor , a unitary can instead escape into a later tensor position, commute asymptotically with every fixed operator, and stay a definite distance from every scalar.
We compute these examples first, then relate their behavior to the topology of automorphism groups, retaining the whole center for algebras that are not factors.
The problems are interleaved with the arguments they test. Every problem has its complete solution immediately below it. The foundations prove the normal-functional, faithful-state, metric, Borel-image and phase constructions, and the two factor constructions used here.
Two generators control the distance from the scalars
Let , , and choose distinct generators . Its reduced words give the group operations; the free-word construction establishes the cancellation and uniqueness rules for every generator set. Put , where on .
FG1 constructs the faithful normal trace , proves separability of the predual, and proves the coefficient identity
It also proves that an infinite countable ICC group gives a factor of type .
Here is the required ICC check. If is not an -power, strip its maximal initial and final -runs to write , where is nonempty and neither endpoint is an -letter. For all sufficiently large positive , the conjugate has initial run of length and final negative run of length . Distinct such give distinct reduced words. If is a nonzero -power, its conjugates by positive -powers are distinct instead. Every nonidentity conjugacy class is therefore infinite.
Theorem 5.1. For every ,
Proof. We prove the stronger bound , where . Let be the coefficient vector of on , and put . For a set of nonidentity words, let be the coordinate projection onto . Conjugation by permutes this Hilbert basis; write the resulting unitary as . FG1's coefficient identity gives
The values for and agree, by applying the unitary to their difference.
Let consist of words ending in or . A word outside ends in a different letter; conjugating it by leaves an at the right endpoint. Hence
In contrast, the sets
are disjoint. The last two have respectively a final -run and a final -run of length one. The terminal -letter prevents right cancellation, and left cancellation cannot pass that letter. These are the free-word geometric inputs.
Put and . Since , the reverse triangle inequality on that coordinate subspace gives for . The cover in (23) controls the entire vector by two coordinate pieces, even if they overlap:
The three projections in (24) have mutually orthogonal ranges. Pythagoras therefore gives the estimate in the other direction,
If , these inequalities give , so . Suppose . For , (25) gives . For , combine (25) and (27) and expand to obtain
In particular , and (25) gives . Thus in every case. Equation (21) identifies with the distance in (22).
Exercise 7. Decide whether the cover (23) needs disjoint sets. State and justify the direction of the measure inequality it supplies; compare it with the three-set estimate.
Solution. For comparison with measures, set and . The word lies in and in , because conjugating by leaves it unchanged. This overlap is allowed. The cover gives
which is exactly the first inequality in (25). The three sets in (24) are pairwise disjoint subsets of the total space. Their measures therefore add without overlap, and their sum is at most , as in (27). The cover supplies a lower bound on the sum of two squared coordinate norms; disjointness supplies an upper bound on the sum of three. Neither inequality may be reversed. Their combination, with the coordinate norm error at most , yields the scalar-distance bound.
Exercise 8. Suppose the -commutator has -norm at most , and the -commutator has -norm at most . Find the certified scalar approximation, including its error, and prove that its scalar minimizes the -norm distance.
Solution. The larger commutator bound is , hence (22) gives . For every , expanding the trace and using gives
The second term has its unique minimum at . Equivalently, this is orthogonal projection onto in the trace Hilbert space.
A tensor tail defeats any scalar approximation
FG2 constructs from , their normalized traces and their tracial Hilbert completion. It proves trace faithfulness, factoriality, type , separable predual and the bounded approximation by the first tensor positions. These properties follow from the local matrix construction itself.
Let put at position . If , it commutes with , so
Given , first choose to make the right side small and then take . Also and is unitary, whence
This gives the opposite of the free-group estimate. Below we show why the distinction is exactly a failure of fullness.
Exercise 9. Allow the scalar approximant to vary with . Prove that the tensor-tail unitaries still form a nontrivial sequence, including the passage from -norm to bounded strong* convergence.
Solution. The trace of each is zero, and . Thus any choice satisfies . If the scalar approximants are bounded, the differences are bounded too. NT2 proves that bounded intrinsic strong* convergence forces trace -norm convergence, by using the trace as a test; the latter is impossible here. Since FG2 proves , this excludes every allowed bounded central approximating sequence.
Which commutators test a sequence?
For , fix the module convention
A norm-bounded sequence is centralizing when for every . It is central when intrinsic strong* for every . Here intrinsic strong* on bounded sets tests both and for every positive normal . A sequence is trivial when in that topology for a bounded sequence .
Lemma 1.1. Every centralizing sequence is central. If has a faithful normal state , a central sequence is centralizing whenever .
Proof. For fixed and positive normal , put . Expanding (1) gives the exact identity
The first test variable has norm at most , and the second at most . Therefore
NT1 supplies the bounded module functionals appearing here. If the sequence is centralizing and bounded, both terms tend to zero. The functional involution satisfies
It follows that is centralizing as well. Apply (2) with to obtain the adjoint seminorm of the original commutator. Both tests now vanish.
For the state converse, NT1 proves that is norm dense in when is faithful. The identity
reduces the dense family to the assumed two kinds of convergence. Indeed Schwarz gives
Centrality makes the first term of (4) tend to zero; the stated state-commutator assumption controls the second. If , the estimate extends convergence from to its norm closure.
Exercise 1. Prove the product rule for convention (1). Give a matrix example showing why a vanishing commutator with one faithful state, without centrality, does not suffice.
Solution. At a test element ,
Adding cancels the middle values and gives
In , take and the faithful normalized trace. Traciality makes , but . The constant sequence is not central. Lemma 1.1's first implication then shows it is not centralizing either. The state test alone misses this obstruction.
Exercise 2. Show that is norm dense for a faithful normal state. For a nonfaithful state, identify an explicit nonzero annihilator and the exact support obstruction.
Solution. The concrete duality is proved in CP. A dual element annihilating obeys for all . Testing gives , so faithfulness gives . If the norm closure were proper, Hahn–Banach would supply a nonzero annihilator; thus the closure is all of . For a nonfaithful , NT4 constructs with . Schwarz gives for every . Hence annihilates , and the norm closure is proper. The support being one is equivalent to faithfulness, so this is precisely the obstruction.
Corollary 1.2. In every finite von Neumann algebra, central and centralizing bounded sequences coincide. No separability or countable decomposition is required.
Proof. In the presence of a faithful normal tracial state, the additional state commutator in Lemma 1.1 is zero, so centrality implies centralizing. For the general finite case, the complete FCT0–7 construction gives the faithful normal center-valued trace . Its projection and central-corner inputs PC0–7 are retained in the same component; neither proof requires countable decomposition. Fix and use NT4 on the center to obtain . The functional
is normal and tracial. It is faithful because both the trace map and are faithful. Its value at the corner unit is one. The bounded central sequence is therefore centralizing in , by the state case. NT4 also gives . Since is central, evaluating the predual commutator against is the same as evaluating the corner commutator against ; this compression has norm at most . Thus . NT1's four-positive decomposition extends the assertion to every normal functional. Lemma 1.1 gives the reverse implication on any algebra.
Before using unitary sequences, note that centralizing bounded sequences form a unital C-star algebra in . Equation (3) handles adjoints, (7) handles products, and the -commutator estimate handles norm limits. CF's continuous calculus therefore stays inside this algebra. For a centralizing self-adjoint contraction ,
is a centralizing unitary with real part . Taking real and imaginary parts of any bounded sequence, scaling by a common bound and using (8), expresses it as a linear combination of four centralizing unitary sequences, with fixed bounded coefficients.
Automorphisms and their implementing cosets
Assume is separable and . NT2 constructs a faithful normal state and proves that its two bounded seminorms give intrinsic strong*. For an arbitrary separable Banach space , choose dense in its unit ball. On its surjective linear isometries use
The sum is finite, and its coordinates separate the maps. Coordinate convergence is equivalent to pointwise norm convergence of maps and inverses, by their common isometric bound; tails of the sum are uniformly bounded.
A Cauchy sequence has pointwise isometric limits for the maps and inverses. The equality and passage to the limit give ; exchanging the roles gives . Thus (9) is complete. Its coordinate embedding lies in a countable product of separable metric spaces, which TS1 makes second countable; its subspace is separable. The estimate for compositions of two isometries proves joint continuity of multiplication. If pointwise and is onto, , which also proves continuity of inversion. The isometry group is Polish.
Give its -topology,
For , composition shows . The map is injective and takes values in the isometry group of .
Lemma 2.1. This image is closed. Consequently is a Polish group, with a complete metric obtained from (9).
Proof. Suppose converges to a surjective isometry . Its inverse also converges pointwise. Put , . Concrete predual duality makes these inverse normal linear maps on . Their pointwise ultraweak limits are respectively . Vector tests on every finite matrix level show that these limits remain unital completely positive. NT1 proves Schwarz from a positive block. Applying it successively gives
The two positive differences vanish. Injectivity of forces . Polarize this equality using and to get . Positivity preserves adjoints, so is a star homomorphism; is its normal inverse. Thus , proving closedness. A closed subspace of the complete metric space is complete. The preceding inverse-coordinate identity shows that the induced topology is exactly (10).
For the unitaries put
Faithfulness makes this a metric, and NT2 identifies its topology with bounded intrinsic strong*. In the faithful GNS representation, a bounded family converging on converges strongly on the dense orbit , by commutation, and hence on the whole Hilbert space. This justifies both seminorm tests. For a unitary limit, strong convergence alone also controls adjoints:
NT2 proves separability of this GNS Hilbert space. Evaluations of operators and adjoints on a countable dense set embed the bounded strong* topology into a countable product of separable Hilbert spaces. The unitary group is consequently separable.
Lemma 2.2. Metric (11) is complete, and
is a Polish group with the complete quotient metric
Proof. A -Cauchy sequence gives Cauchy values . Commuting with extends these to Cauchy vectors on its dense orbit; the norm-one bound extends the limits to all vectors. Strong closedness puts the bounded limits in . Passing to the Hilbert pairing shows . Strong continuity of multiplication on bounded sets then gives , so the limit is unitary and the metric complete.
Right multiplication by a central unitary preserves both terms of : for a difference , it leaves and unchanged. Consequently (14) does not depend on representatives. Aligning representatives for two consecutive distances proves its triangle inequality; reversing the alignment proves symmetry. If , choose with strong*. Then , and the strong* closed central unitary group contains this limit. Thus the cosets are equal. The image of a -ball is exactly the corresponding -ball; the quotient map is open because its full preimage is the union of central translates of that ball. Hence this is the quotient topology. From a -Cauchy sequence choose a subsequence whose consecutive distances are less than . Successive central adjustments give representatives with -increments less than . Completeness gives a representative limit, then a coset limit. The entire Cauchy sequence converges by the triangle inequality. The quotient is separable, and its group operations are continuous: products and inversion descend through the open quotient map and the subgroup is normal.
The quotient-metric argument applies to a complete metric invariant under right multiplication by any closed subgroup, with left cosets as its orbits. Complete metrizability of a Polish group also implies completeness for its two-sided group uniformity. Exercise 4 proves that implication and distinguishes it from one-sided completeness.
Exercise 3. Construct unitaries converging strongly to a nonunitary on . Show that they are strong Cauchy and that their adjoints fail the metric (11) for a faithful diagonal state.
Solution. Let cycle forward, taking to , and fix for . On each fixed finite-support vector, eventually this agrees with the unilateral shift . The norm-one bound extends the convergence to every vector, so strongly and is strong Cauchy. The range of omits , so the limit is not unitary. However . For these vectors have squared distance two. For the faithful normal state , the adjoint term satisfies . Thus the sequence fails to be -Cauchy. Both convergence tests are necessary for completeness.
Exercise 4. Explain the role of centrality in the quotient metric. State what completeness of a compatible metric permits one to infer about the two-sided group uniformity.
Solution. If is central unitary and , then and . For a noncentral right multiplier, the first expression becomes ; a general faithful state changes under this conjugation. For a left multiplier the other square instead changes. Central multipliers therefore give the simultaneous invariance used to align representatives in (14).
A Polish group is complete for its two-sided group uniformity: a sequence is Cauchy for that uniformity when both and tend to one uniformly over pairs of sufficiently large indices. This is called Raikov completeness. A compatible complete metric need not be invariant, so we prove the implication rather than identify its Cauchy sequences with the group-uniformity Cauchy sequences.
First construct a bounded compatible left-invariant metric. Choose symmetric identity neighborhoods , forming a neighborhood base and satisfying . Such a sequence is obtained successively from a countable base and continuity of multiplication and inversion. Define
The empty product has cost zero. Every other group element has a factorization of cost at most one, using . Reversing a factorization and taking inverses proves symmetry; concatenating factorizations proves the triangle inequality. Left invariance follows from the occurrence of .
Here is the bound that prevents this infimum from collapsing. If an ordered product has total cost less than , its product lies in . Prove this by induction on the number of factors, simultaneously for every . For one factor the assertion follows from nesting. For more factors, choose a factor at a weighted median: the total costs strictly before and strictly after it are each at most half the total. By induction both surrounding products belong to . The middle factor also belongs to , since its own cost is less than . The three-factor inclusion gives the assertion. Empty surrounding products cause no exception. Consequently
Their intersection is , so separates points and induces the group topology.
Let be the metric completion of . Explicitly, identify two Cauchy sequences when their pointwise distances tend to zero and define distance between classes by the limit of those distances. The triangle inequality makes the limit and equivalence well defined; constant sequences embed densely. A Cauchy sequence of classes has a subsequence with successive distances below . Choose representatives from within of those classes. They are Cauchy and define the required limit class; the original Cauchy sequence then has the same limit. This proves completeness. A countable dense subset of remains dense in , so is separable.
The surjective isometry group of any complete separable metric space is Polish. To verify this without a completeness assumption about a group uniformity, choose a dense sequence and use
The common isometry bound extends coordinate convergence and coordinate Cauchy convergence to every point of . For a Cauchy sequence, completeness of gives pointwise isometric limits for the maps and inverses. The equality
gives ; exchanging maps and inverses gives . Thus the limit is a surjective isometry. Uniformly bounded tails of the displayed sum prove convergence in . Its coordinate embedding in gives second countability and separability by TS1. Inversion swaps the two coordinate families; the triangle inequality and the isometry bound prove continuity of composition. This proves the assertion about the isometry group.
Left translation by is a surjective isometry of , and hence extends uniquely to a surjective isometry of . These maps give a faithful homomorphism. For ,
Continuity of conjugation, also for the inverse-coordinate maps, proves continuity into the isometry group on this dense subset. The common isometry bound extends it to all of . Evaluation at recovers the metric , so this embedding induces exactly the original topology on .
We need its image to be closed. Let be the closure of the image in the complete isometry group; this is a Polish group. Identify with its image and let be a compatible complete metric on . For every , let be the union of the open subsets of for which the -diameter of is less than . Compatibility of the topologies gives . In fact
For a point in the intersection, choose such a neighborhood containing , and choose in and within of in a metric of . Density permits every choice. For , both points lie in , so is -Cauchy. It converges to a point of ; compatibility and uniqueness of its limit in identify that point with . This proves the equality. Each is open and dense in , so is comeager there. Every translate is also comeager. The Baire theorem TS5 gives a point in , whence . Thus , proving closedness.
Now let be two-sided Cauchy. For every , the preceding conjugation formula makes Cauchy in . Applying it to uses and makes the inverse-coordinate sequence Cauchy as well. Density and the common isometry bound extend both assertions to every . Thus is -Cauchy. It converges in the isometry group, and the closed-image result puts the limit in . The embedding then gives convergence in the original group topology.
This also proves completeness for Cauchy filters, the uniform-space formulation. The identity has a countable neighborhood base. From a Cauchy filter choose nested filter members whose pairs lie in the first basic two-sided entourages, and choose a point in each member. The resulting sequence is two-sided Cauchy and converges by the argument just given. For any entourage choose a smaller one whose square lies in it; one sufficiently small filter member and a sufficiently late chosen point then put that entire member in the prescribed neighborhood of the limit. Hence the filter converges.
One-sided completeness is different. In Exercise 3, the unitary cycles satisfy
uniformly over late pairs for every fixed vector. For a unitary , , so these relative unitaries tend to one in the group topology. The sequence is left Cauchy. The opposite relative differences test the adjoints, which fail to be Cauchy on . Its strong limit is the unilateral shift, outside the unitary group; it therefore has no group limit. This gives a Polish group whose left uniformity is incomplete. Inversion gives the corresponding right-uniformity example. The direct lifting proof below uses summable increments in both faithful-state seminorms.
For implementers, the module convention gives
Indeed ; left multiplication by is a predual isometry and turns its difference from into . The map is continuous. At one, Schwarz bounds by . Equation (4) treats , and their norm density and uniform module bound treat every normal functional. Translation proves continuity everywhere. Its kernel consists exactly of the central unitaries.
Why the quotient map has a continuous inverse when its image is closed
Lemma 3.1. If is nonmeager and has the Baire property in a Polish group , then contains a neighborhood of .
Proof. The Baire property gives a nonempty open on which is comeager. Choose . For , the point lies in , so this intersection is nonempty and open. TS5 proves that a nonempty open subset of a Polish space is not meager. The exceptions to membership in and in form a meager set there. Some point therefore has the form , with . Then , and the open neighborhood of one lies in .
Theorem 3.2. A continuous bijective homomorphism between Polish groups is a homeomorphism.
Proof. For a neighborhood of one in , continuity of group operations provides an open neighborhood with . Separability gives a countable translate cover of by : a dense set meets every translate of . Its images cover . TS5's Baire theorem excludes all those translates being meager, so is nonmeager. TS4 proves the Borel-image theorem for an injective Borel map on any Polish domain; apply it to this continuous bijection and the open Borel set . Thus is Borel, and TS5 proves that it has the Baire property. Lemma 3.1 gives a neighborhood of one inside . Translating proves that is open. Bijectivity then turns openness into continuity of the inverse. These inputs are proved for all Polish groups; no invariant complete metric or local compactness is assumed.
Lifting convergent inner automorphisms
An algebra is full if its inner automorphism group is closed in for (10).
Theorem 4.1. For every von Neumann algebra with separable predual, the following are equivalent:
- is full.
- Every bounded centralizing sequence is trivial.
- Whenever , there are central unitaries with .
Proof. For the zero algebra each group is a singleton and each sequence is zero, so all three assertions hold. Suppose . If the inner subgroup is closed, Lemma 2.1 makes it Polish. Lemma 2.2 gives a Polish domain for the induced continuous bijection . Theorem 3.2 makes this bijection a homeomorphism. An implementing sequence for automorphisms tending to the identity has coset distance tending to zero. Choose central unitaries within an error of those infima to obtain assertion 3.
Equation (15) identifies the sequences in assertion 3 as the centralizing unitary sequences. The four-unitary decomposition (8) then replaces each term of any bounded centralizing sequence by the same fixed linear combination of bounded central unitary approximants. The errors tend to zero in both seminorms, proving assertion 2.
Conversely, assertion 2 gives bounded with intrinsic strong* whenever is centralizing and unitary. NT3 constructs the central phase , taking phase one on the zero support, and proves both squared operator inequalities from the scalar bound
It does so by bounded polar operators and continuous approximants, including the zero-support case. Applying gives , which is assertion 3.
To finish, assume assertion 3 and let be in the closure of the inner subgroup. Metrizability turns assertion 3 into continuity at one of the inverse implementing-coset map. In particular, for a faithful positive normal functional and , there is an identity neighborhood in the -topology such that
If no such neighborhood existed, a decreasing countable base would give a sequence contradicting assertion 3, because NT2 identifies the bounded topology for both faithful functionals.
Set . Choose a sequence whose consecutive relative automorphisms lie in the neighborhoods for , and also satisfy
For precision, start with any convergent implementing sequence. For each predetermined neighborhood, the convergence and continuous group operations supply a common threshold for both indices of a relative automorphism. Choose the -th subsequence index above the thresholds for neighborhoods , and above the functional threshold for . This makes all successive choices simultaneous.
Choose central with
Define , , and . Its difference is . The central unitary cancels from both squared seminorms. Thus
For the other square use (18), , and the part of :
Both increment norms are summable. Lemma 2.2 gives a unitary limit . Continuity of implementation gives , since the central adjustments leave every implemented automorphism unchanged. This proves closedness and assertion 1.
Exercise 5. Establish (16) also at zero. Then construct a bounded central unitary approximation from a bounded central approximation to any unitary sequence, proving both intrinsic strong* estimates.
Solution. For , with and , by the reverse triangle inequality, and . At choose phase one; . For a central operator , NT3 constructs its polar operator inside the center and extends it by one on the kernel to a central unitary . Its continuous regularizations commute with the unitary , and their characterwise scalar inequalities pass to bounded strong* limits. This proves
For every positive normal , the two seminorms of are at most twice the corresponding ones of . Apply this construction at every index. The phases have norm one, and both errors tend to zero, including indices at which the central approximant is zero.
Corollary 5.2. Every , , is full and is not isomorphic to .
Proof. A bounded centralizing sequence in is central by Lemma 1.1. Use its faithful trace as a seminorm test: the two fixed commutators in (22) tend to zero in -norm. Hence . The scalar approximants are bounded by . NT2 gives bounded intrinsic strong* convergence, and FG1 gives separable predual. Theorem 4.1 therefore proves fullness. In , FG2's tensor-tail sequence is central, and its commutator with the faithful trace is zero. Lemma 1.1 makes it centralizing. Equation (28) and the scalar center make it nontrivial, so Theorem 4.1 proves that is not full. A normal isomorphism preserves centralizing sequences, both intrinsic seminorms and the center, as verified in Exercise 10. It thus preserves fullness, and cannot identify these factors.
This conclusion applies to every rank in the stated range. It does not compare the isomorphism classes of free-group factors of different ranks.
Exercise 6. Prove fullness for every abelian von Neumann algebra with separable predual. Give a concrete example showing that the sequence criterion in that case requires its full center.
Solution. In an abelian algebra every inner conjugation is the identity. The inner subgroup is the closed singleton in the Hausdorff automorphism group, so the algebra is full. A bounded sequence is trivial by choosing its central approximant equal to itself. In , the constant sequence is nonscalar and stays a positive distance from the scalar diagonal, although it lies in the center. Thus replacing central approximants by scalar ones would change the criterion.
Exercise 10. Prove invariance under a normal isomorphism. Include the predual norms, boundedness, the center, and each of the two strong* seminorms.
Solution. Let be a normal star isomorphism. Its normal inverse makes pullback an onto isometry of preduals, and preserves operator norms. Evaluating against gives
Thus predual-commutator convergence is equivalent in both algebras. For every positive normal on ,
The onto positive pullback gives both directions of bounded strong* convergence. An element commutes with all of exactly when its image commutes with all of , so . Bounded central approximating sequences transport with identical seminorm errors. Finally the preduals are isomorphic, hence separability transports; Theorem 4.1 gives invariance of fullness.
Finite group stages and the permutation factor
Let be the group of permutations of with finite support. Write for the permutations of the first points, fixing the rest. Then
This countable union of finite sets is countable; the group is infinite.
Proposition 6.1. The algebra is an AFD factor of type , hence is isomorphic to .
Proof. If , choose a point moved by . For each outside its finite support, conjugation by changes that support to
The supports are distinct, so the conjugacy class is infinite. FG1 now supplies the faithful normal trace, scalar center, separable predual and type . The spans are increasing unital finite-dimensional star algebras: finite group multiplication and inversion close them under products and adjoints. Their union contains every group unitary. BD1–5 gives bounded strong density of the norm closure of that union in its bicommutant, so these stages provide the AFD approximation. Equivalently their generated von Neumann algebra is all of . The complete AF1–5 proof of finite AFD uniqueness now identifies it with , including the initial direct-sum finite algebras and the exact dyadic-containment construction.
The finite stages may be direct sums of matrix algebras. Their centers can disappear when later group elements are added, as the next calculation shows. AF1–5 turns those finite approximations into a compatible dyadic chain; FG2 identifies its tracial completion with .
Exercise 11. Describe the algebra generated by , including its two minimal projections. Exhibit a later group unitary that prevents its nonscalar central element from being central in .
Solution. Put . The two group operators are linearly independent on , and , . Thus
are nonzero orthogonal projections summing to one. Their spans give an isomorphism of this two-dimensional algebra with ; it is abelian and is not a factor. Take . The permutations are different, hence . So , central in the stage, is not central after the stage is included. Centrality in a finite approximant need not survive in the generated algebra.
Free comparisons and prerequisite proofs
Claire Anantharaman and Sorin Popa, An introduction to II₁ factors, author draft, Theorem 15.3.2, printed 266–267 (PDF 272–273), proves the finite-factor fullness route. Section 15.4 on those and the following page gives the free-word cover and disjoint conjugates, and the trace-zero tensor-tail example. Those methods are credited here. The orthogonal coordinate projections give the bound 10 and therefore the stated bound 14; the faithful-state estimates prove the criterion with the whole center.
Christian Rosendal's author version of Automatic continuity of group homomorphisms, November 2008, Section 2.1, Lemma 2.1 and Theorem 2.2, p.4, gives the category argument. Anush Tserunyan's author-hosted descriptive-set-theory notes, 26 November 2025, Theorem 12.6 p.48 and Theorem 13.3 pp.51–52, provide complete separation and Borel-image comparisons. TS1–6 proves their metric, refinement and category inputs locally on all Polish domains.
Julien Melleray, Some aspects of Topological dynamics of Polish groups, with an introduction to descriptive set theory, author-hosted notes, Definition 4.1 and Theorem 4.3, printed 39–40 (PDF 45–46), distinguish the group uniformities and the compatible invariant metric. Exercise 48, printed 41 (PDF 47), states Raikov completeness for Polish groups. Exercise 4 here supplies the complete metric, isometric embedding, closed-image and Cauchy-filter arguments. The author’s text retains its own rights.
NT1–4 and FG1–2 provide the functional decomposition, faithful-state topology, bounded phase construction, support localization and the two factor constructions. Their exact earlier CF, CP, GNS, bounded-density and normal-range proofs are linked in the foundations. The complete retained PC0–7/FCT0–7 arguments supply Corollary 1.2's general finite center-valued trace. Their method comparison is Jesse Peterson's author-hosted Notes on operator algebras, 27 April 2020, Section 6.4, printed/PDF 102–106. AF1–5 proves the whole finite AFD uniqueness input for Proposition 6.1. Its freely accessible method comparison is Anantharaman–Popa, Lemma 11.2.1 and Theorem 11.2.2, printed 185–188 (PDF 191–194); its local exact-containment argument supplies the nesting step directly.