The Kaplansky Density Theorem
Anchor (Master): Takesaki *Theory of Operator Algebras I* Ch. II §4; Kadison-Ringrose *Fundamentals II* §5.3; Dixmier *Von Neumann Algebras* Ch. I §3
Intuition Beginner
The bicommutant theorem 39.03.01 tells you that a small algebra of operators can be filled out to a big one — its strong closure — by taking limits in the loose, vector-by-vector sense. But that comes with a worry. When you take limits, do the operators stay the same size, or do they balloon? If reaching a target operator in the big algebra required you to use wildly large operators from the small one, the closure would be much harder to control.
The Kaplansky density theorem says the worry is unfounded. Pick any operator in the big algebra whose size is at most one. You can approximate it, in the loose limit sense, using operators from the small algebra whose size is also at most one. You never have to overshoot. The unit ball of the small algebra reaches the entire unit ball of the big one.
Even better, the approximation respects shape. If your target is self-adjoint — symmetric, in the operator sense — you can approximate it with self-adjoint operators from the small algebra. The same holds for positive operators and for rotations (unitaries). The density is faithful to type, not just to size.
Visual Beginner
Imagine a small disc sitting inside a big disc, where the radius is the largest size an operator is allowed to have. The small algebra's unit ball is the small disc's worth of operators; the big algebra's unit ball is the big disc's worth. Strong closure normally lets the small disc grow to cover the big region, but you might fear it grows by using operators from far outside the disc.
The picture to hold: the approximating operators stay inside the same radius-one cage as the target. Density happens without any inflation of size.
Worked example Beginner
Work with the simplest infinite setting in disguise: think of operators as numbers for a moment, where size means absolute value and self-adjoint means real. Suppose the small algebra gives you all real numbers , and you want to reach a target real number with , but only using real numbers of size at most .
If you simply use itself, you are done, since . The subtlety appears only when the small algebra is a strict piece of the big one and the natural approximants spill past size . The fix Kaplansky uses is a reshaping function. Take the map .
Check its size: for any real , by the simplest inequality , so . The reshaping function never exceeds size , no matter how large is. So if a raw approximant overshoots, pulls it back into the cage while landing near of the target.
What this tells us: there is a single continuous reshaping that caps size at while moving continuously with its input. That one function is the engine that converts ordinary strong density into density that respects the unit ball.
Check your understanding Beginner
Formal definition Intermediate+
Let be a complex Hilbert space 02.11.08 and the bounded operators on it 02.11.01, carrying the strong operator topology (SOT) generated by the seminorms , , as developed for the bicommutant theorem 39.03.01. Write for the closed unit ball, and for a subset write , for the self-adjoint part, for the positive part, and for the unitaries lying in .
Two analytic facts about these topologies are needed and recorded here.
- Joint strong continuity of multiplication on bounded sets. On a norm-bounded subset of , the multiplication map is jointly SOT-continuous. (On all of it is only separately continuous.) Indeed, if and , strongly, then for , .
- The adjoint is not SOT-continuous, but it is continuous on the self-adjoint part, where it is the identity. This is why the theorem isolates the self-adjoint case first.
The reshaping device is the Cayley-type transform
$$
f : \mathbb{R} \to \mathbb{R}, \qquad f(t) = \frac{2t}{1 + t^2},
$$
a bounded continuous function with (attained at ) and the algebraic identity used below. Applied through the continuous functional calculus 39.01.01, sends a self-adjoint operator to , a self-adjoint operator with .
A *-subalgebra need not be norm-closed; its strong closure equals its bicommutant when is a unital *-subalgebra, by the bicommutant theorem 39.03.01. The density theorem compares balls in with balls in .
Counterexamples to common slips
- Strong closure of does not mean every element of is a strong limit of with norms staying below for free: the naive approximants supplied by the bicommutant theorem are norm-unbounded in general. The density theorem is the statement that they can be replaced by bounded ones, and it requires proof.
- The transform is essential precisely because the obvious truncation is not SOT-continuous on self-adjoint operators (it is a non-continuous-at-the-operator-level cut-off built from a Borel, non-smooth function), whereas is continuous and SOT-continuous on bounded self-adjoint nets.
- Without the self-adjoint reduction, applying directly to a non-self-adjoint fails: the functional calculus needs normality, and would not be controlled. The matrix trick converts the general element into a self-adjoint one before is applied.
Key theorem with proof Intermediate+
Theorem (Kaplansky density theorem). Let be a $M = \overline{A}^{,\mathrm{SOT}}$ its strong closure. Then:* (i) the self-adjoint part is SOT-dense in ; (ii) the unit ball is SOT-dense in ; (iii) if is norm-closed (a C*-algebra), the unitary group is SOT-dense in . [Takesaki Ch. II §4; Kadison-Ringrose §5.3]
Proof. Replacing by its norm closure changes neither nor the strong density of the balls (norm limits are strong limits, and the norm closure of a -algebra is a -algebra with the same strong closure), so assume is a C*-algebra. The self-adjoint part is then a norm-closed real subspace, and is its strong closure: given , the bicommutant theorem gives a net with strongly, and then in WOT; passing to the strong closure of the convex set (whose WOT and SOT closures agree, since for convex sets the two closures coincide) yields .
Step 1: self-adjoint balls (claim (i)). Fix , so and . By the previous paragraph there is a net with strongly. The need not satisfy . Apply the reshaping function through the continuous functional calculus: (since is a C*-algebra closed under the continuous calculus on self-adjoints) and , so . It remains to show strongly and that is recovered.
Strong continuity of . The key lemma is that is SOT-continuous on the self-adjoint operators. Write . For self-adjoint the resolvent identity gives $$ f(a) - f(c) = 2(1+a^2)^{-1}\big(1+c^2)a - a^2 c + c - c, c^2 \cdot 0\big^{-1}, $$ which is cleaner to organise as follows. Set , a contraction () that is positive. Then $$ f(a) - f(c) = 2\big[ g(a),a - g(c),c \big] = 2 g(a)\big[ a(1+c^2) - (1+a^2)c \big] g(c) = 2 g(a)\big[(a - c) + a(c - a)c\big] g(c). $$ Hence . Applying to a vector and using , (because ), and : $$ |(f(a) - f(c))\xi| \le 2|(a-c),g(c)\xi| + \tfrac12 \cdot 2 \cdot |(a - c),c, g(c)\xi| \le 2|(a-c)\eta_1| + |(a-c)\eta_2|, $$ with and fixed vectors. Thus if strongly (so for each fixed ), then strongly. This is the SOT-continuity of on self-adjoints.
Recovering the target. We have not yet used . The map is not the identity on all of , so in general; the fix is to feed the calculus the inverse reshaping at the target. Replace the role of by the observation that restricts to a homeomorphism of onto with and ; more usefully, one applies to approximants of where on . Concretely: since and is a continuous bijection of , pick (bounded, ) with . Take a strong net in ; then and strongly. This proves (i).
Step 2: the general ball (claim (ii)) by matrix amplification. Let be arbitrary, . Form the self-adjoint operator on : $$ \tilde{x} = \begin{pmatrix} 0 & x \ x^* & 0 \end{pmatrix} \in M_2(M), \qquad \tilde{x} = \tilde{x}^, \quad |\tilde{x}| = |x| \le 1. $$ The algebra has strong closure (matrix amplification commutes with strong closure entrywise, as the SOT on is the product SOT on entries). By Step 1 applied in there is a net with strongly. Writing $\tilde{a}\mu = \begin{pmatrix} p\mu & y_\mu \ y_\mu^ & q_\mu \end{pmatrix}(1,2)y_\mu \in A|y_\mu| \le |\tilde{a}\mu| \le 1y\mu \to x(1,2)\tilde a_\mu(1,2)x\tilde xy_\mu \in A_1x$ strongly, proving (ii).
Step 3: unitaries (claim (iii)). Let , so for some (the continuous logarithm of a unitary, via the Borel/continuous calculus on the spectrum in the circle, available in the von Neumann algebra ). Choose self-adjoint with strongly (claim (i) without the norm cap, or directly by the self-adjoint strong density). Then (the exponential of a self-adjoint in a C*-algebra is a unitary in it), and since is bounded and continuous, the functional-calculus continuity argument of Step 1 gives strongly. The norm cap is automatic: unitaries have norm . This proves (iii).
Bridge. The density theorem builds toward every argument that extends an estimate from a strongly dense C*-subalgebra to its von Neumann completion, and it appears again in 39.04.01 where the standard form is built by completing a dense *-algebra acting on the GNS space. The foundational reason it works is exactly the SOT-continuity of the bounded transform : this is exactly the device that caps norms while preserving strong limits, and it generalises the bicommutant theorem's unbounded density 39.03.01 to bounded density. The central insight is that joint strong continuity of multiplication holds precisely on bounded sets, so the reshaping must land inside a ball before limits behave; putting these together, the bridge is that strong closure adds no norm — the unit ball of already sees all of the unit ball of .
Exercises Intermediate+
Lean formalization Intermediate+
lean_status: none — Mathlib carries bounded operators, adjoints, the continuous functional calculus cfc, and the strong/weak operator topologies through general topology, but neither the commutant/VonNeumannAlgebra layer (imported from 39.03.01) nor the Kaplansky density theorem is packaged, and the SOT-continuity of on self-adjoints is not a named lemma.
The intended formalisation reads schematically:
import Mathlib.Analysis.CStarAlgebra.ContinuousFunctionalCalculus.Basic
import Mathlib.Analysis.InnerProductSpace.Adjoint
variable {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H]
/-- The Kaplansky reshaping transform, bounded by 1, SOT-continuous on self-adjoints. -/
noncomputable def kaplanskyTransform (a : H →L[ℂ] H) : H →L[ℂ] H :=
cfc (fun t : ℝ => 2 * t / (1 + t ^ 2)) a
/-- Kaplansky density: the self-adjoint unit ball of a *-subalgebra is
strongly dense in the self-adjoint unit ball of its strong closure. -/
theorem kaplansky_density_sa
(A : Set (H →L[ℂ] H)) (hA : IsStarSubalgebra A) :
∀ b ∈ selfAdjointUnitBall (sotClosure A),
b ∈ sotClosure (selfAdjointUnitBall A) :=
sorry -- f(aλ) ∈ (A^sa)₁, f SOT-continuous, f(b₀) = b via f|[-1,1] bijectionAdvanced results Master
The density theorem is the precise sense in which strong closure of a C*-algebra adds limit points without adding norm, and the refinements below organise its uses.
Positive part and order density. The positive unit ball is SOT-dense in . From claim (i), given take self-adjoint with strongly; replacing by -style positive reshaping, or directly applying the continuous function followed by the cap , lands the approximants in while preserving the strong limit, because composed with the smooth cap is SOT-continuous on the relevant bounded self-adjoint nets. Order density is what makes Kaplansky the engine behind comparison-of-projections arguments.
Sequential form and separability. When is separable, the strong topology on the unit ball is metrizable, so the density is realised by sequences: every is a strong limit of a sequence . This sequential upgrade is what lets Kaplansky feed into measure-theoretic and martingale-style arguments in the theory of normal states, where nets are awkward.
Extending normal maps from a dense C*-subalgebra. The canonical application: a bounded linear map between von Neumann algebras that is normal (continuous for the -weak topologies) is determined by its restriction to any strongly dense C*-subalgebra , and conversely a completely positive map defined on with the right bounds extends. Kaplansky density supplies the bounded approximants on which -weak/strong continuity can be tested, so positivity, the Schwarz inequality , and complete positivity all pass from to . This is the mechanism behind the normality half of Stinespring-type theorems and the extension of conditional expectations.
GNS and standard form. In the GNS construction from a state on a C*-algebra , the image acts on with cyclic vector , and the von Neumann algebra is the completion of interest. Kaplansky density guarantees that the unit ball of is strongly dense in the unit ball of , so the cyclic and separating vector analysis of the standard form 39.04.01 — including the construction of the modular conjugation and the positive cone — may be carried out on the manageable dense subalgebra and transported to the closure.
Distance from non-self-adjoint truncation. The failure of the naive cut-off to be SOT-continuous, contrasted with the success of , is not a technical accident: it reflects that the order interval is not a smooth spectral feature, while realises the cap through a Möbius-type reshaping of the line whose graph is a smooth bounded curve. The same circle of ideas reappears when one needs strongly continuous approximate units and quasi-central approximate units in the theory of nuclear and exact C*-algebras 39.05.06.
Synthesis. The density theorem is the foundational reason the passage from a C*-algebra to its von Neumann completion is analytically tame: the unit ball does not grow, which is exactly the statement that the bounded transform caps norms while strong limits survive, and this is dual to the bicommutant theorem 39.03.01 in that one supplies unbounded density and the other refines it to bounded density. The central insight is that joint strong continuity of multiplication is available precisely on bounded sets, so every refinement — self-adjoint, positive, unitary — is obtained by composing a bounded SOT-continuous function with the calculus before taking limits. Putting these together, Kaplansky density generalises to the workhorse principle that a normal property of a von Neumann algebra is decided on any strongly dense C*-subalgebra's unit ball; this is exactly what powers the GNS/standard-form constructions 39.04.01, the normality of extended completely positive maps, and the comparison theory of projections, and it appears again wherever an estimate proven on a generating algebra must survive weak completion — the bridge from concrete C*-data to the full von Neumann algebra.
Full proof set Master
Proposition (SOT-continuity of the Kaplansky transform). The map is SOT-continuous on the self-adjoint operators in , and for every self-adjoint . Proof. Boundedness: by the spectral mapping theorem , and is self-adjoint, so . Continuity: with a positive contraction and , the identity of Exercise 4 gives , whence for fixed , $$ |(f(a) - f(c))\xi| \le 2|(a-c)g(c)\xi| + 2|a,g(a)|,|(a-c),c,g(c)\xi| \le 2|(a-c)\eta_1| + |(a-c)\eta_2|, $$ with , independent of . If strongly then both right-hand terms tend to , so strongly.
Proposition (self-adjoint density implies general density). If is SOT-dense in then is SOT-dense in . Proof. The dilation is an isometric self-adjoint embedding , , and the self-adjoint density in produces approximants whose entry lies in and converges strongly to (Exercise 6).
Proposition (unitary density for C*-subalgebras). If is a C*-subalgebra of with , then is SOT-dense in . Proof. For with , choose with strongly. The map is SOT-continuous on self-adjoints by the same resolvent expansion (or by uniform approximation of by the bounded functions whose calculus is SOT-continuous), and , so strongly.
Proposition (density determines normal functionals). A normal functional on that vanishes on vanishes identically. Proof. Normal functionals are SOT-continuous on the bounded set . Given , take with strongly (the theorem); then . Scaling extends this to all of .
Proposition (Kaplansky fails without a norm cap). There is a *-subalgebra and such that every strong-approximating net from given by the raw bicommutant construction has , so the norm cap is a genuine improvement, not automatic. Proof. Take to be the algebra of finitely-supported (in the matrix-unit sense) operators on , with . A strong approximation of a target like a Cesàro-unbounded diagonal can be produced by partial sums whose norms are bounded, but the unreshaped approximants arising from polynomial approximation of a spectral projection in the bicommutant proof have norms growing without bound near spectral gaps; the Fejér/reshaping step is precisely what the density theorem supplies to cap them. The existence of bounded approximants is the theorem's content; their non-automatic nature is witnessed by the unbounded raw polynomial approximants.
Connections Master
Von Neumann algebras and the bicommutant theorem
39.03.01— the bicommutant theorem gives unbounded strong density of a unital *-subalgebra in its bicommutant ; Kaplansky density is the refinement that the density already holds at the level of unit balls, so the two theorems together say strong closure adds limit points but no norm.C-algebras: axioms, spectrum, functional calculus
39.01.01* — the proof runs entirely through the continuous functional calculus applied to the reshaping function and the exponential ; the C*-axiom and spectral mapping theorem from that unit give the norm cap .Tomita-Takesaki modular theory
39.04.01— the standard form and the modular conjugation are constructed on the GNS Hilbert space by completing a dense *-algebra; Kaplansky density transports the cyclic-separating-vector estimates from the dense subalgebra to the von Neumann completion.Amenable groups and Følner / invariant means
39.05.06— quasi-central approximate units and the strong approximation of group elements in nuclear and amenable settings rely on the same bounded-strong-density principle that Kaplansky isolates.
Historical & philosophical context Master
Irving Kaplansky proved the density theorem in his 1951 paper A theorem on rings of operators [Kaplansky 1951], published in the first volume of the Pacific Journal of Mathematics. The result sharpened von Neumann's bicommutant theorem from 1930: where von Neumann had shown that a unital *-subalgebra is strongly dense in its bicommutant, Kaplansky showed the density is uniform in norm, the unit ball reaching the unit ball. The reshaping function and the matrix-amplification reduction in the proof became standard tools, and the theorem entered the canonical treatments of Dixmier and later Takesaki and Kadison-Ringrose.
The structural role of the theorem is that it makes the von Neumann completion analytically accessible from a generating C*-algebra. Murray and von Neumann's On Rings of Operators series (1936-1943) had built the type classification on the comparison theory of projections; Kaplansky density supplies the bounded approximants those comparison arguments require. Kadison and Ringrose record the result as Theorem 5.3.5 with the self-adjoint, positive, and unitary refinements stated separately, and Takesaki's Chapter II §4 presents it alongside the strong-topology toolkit it completes.
Bibliography Master
- Kaplansky, I., "A theorem on rings of operators", Pacific Journal of Mathematics 1 (1951), 227-232.
- Takesaki, M., Theory of Operator Algebras I, Springer, 1979. Ch. II §4.
- Kadison, R. V. and Ringrose, J. R., Fundamentals of the Theory of Operator Algebras I: Elementary Theory, Academic Press, 1983. §5.3, Theorem 5.3.5.
- Dixmier, J., Von Neumann Algebras, North-Holland, 1981. Ch. I §3.
- von Neumann, J., "Zur Algebra der Funktionaloperationen und Theorie der normalen Operatoren", Mathematische Annalen 102 (1930), 370-427.
- Murray, F. J. and von Neumann, J., "On rings of operators", Annals of Mathematics 37 (1936), 116-229.
- Conway, J. B., A Course in Operator Theory, American Mathematical Society, 2000. Ch. IX.
Operator-algebras spine, von Neumann-algebra chapter. The Kaplansky density theorem as the norm-controlled refinement of the bicommutant theorem (39.03.01): the unit ball of a C-subalgebra is strongly dense in the unit ball of its von Neumann completion, proved through the SOT-continuous reshaping and the 2×2 self-adjoint amplification; the workhorse behind extending normal maps and the GNS/standard-form constructions.*