Operator density from finite vector tests
Written by GPT-6.1 Sol (OpenAI), Ultra, October 2026. Original text and embedded diagram: public domain (CC0).
A strong operator neighbourhood asks for good approximation on finitely many vectors. Commutants turn those finite tests into one invariant-subspace problem. A rational function then converts self-adjoint approximants into contractions. These two constructions prove the positive matrix density needed to reconstruct completely positive maps with values in a C*-algebra.
We use the complete Hilbert-space, projection and series-vector proofs H00–H03, their arbitrary-Hilbert-space identification P00, C*-unitization, calculus and approximate identities F02–F09, and real convex separation SEP. The C*-norm and order on finite matrices, including entrywise representations, are proved in Completely positive maps, Section 2. Inner products are linear in their second variable. No separability assumption is imposed.
For a representation , put
The notation means the closed linear span. We work on , and extend operators on by zero on whenever the original space is used. Write
where these commutants are taken in . The unit of this algebra on is . When , all supported operators and all the approximations below are zero.
ODF01. Bounded strong limits and ultraweak tests
Strong convergence means in norm for every vector . Weak operator convergence means convergence of every scalar . Strong* convergence means that both and strongly. H03 describes the ultraweak topology by the functionals
P00 makes that description available on every Hilbert space, including spaces with uncountable orthonormal bases.
Bounded product lemma. If and strongly and , then strongly.
Proof. For each ,
The last vector is fixed. No bound on the norms of the is needed for this assertion. If both nets and their adjoints converge strongly and both nets have uniform norm bounds, applying the same argument to also proves strong* convergence of the products.
Bounded topology lemma. If in the weak operator topology and , then ultraweakly. In particular every uniformly bounded strongly convergent net converges ultraweakly.
Proof. For unit vectors , the scalar limit gives , and the Hilbert norming formula gives . Given (ODF1), its tail after , evaluated at , has modulus at most
Choose to make this small. The initial finite sum tends to zero by weak operator convergence, so the whole series tends to zero. If , every operator involved is zero. This is a net argument: convergence of the finite sum requires only finitely many eventual conditions.
The uniform bounds in these lemmas are hypotheses. Strong convergence of an arbitrary net supplies no uniform operator-norm bound by itself.
ODF02. The essential representation and its support
Every preserves . Since , it also preserves . A vector satisfies for every , , so . Thus .
Let be the positive contractive approximate identity in supplied by F09. On a vector ,
F05 gives . Finite sums of these vectors are dense in ; the uniform bound extends convergence to all of . Every vanishes on . Consequently
On , this is a strongly convergent approximate identity with limit . In particular the restricted representation is nondegenerate. These statements include and .
The supported algebra , rather than the full bicommutant in a degenerate ambient space, is the closure to be approximated. For example, if on a nonzero , its strong closure is zero although its full bicommutant contains .
ODF03. The bicommutant theorem on finitely many vectors
Theorem. On , is strongly dense in . More precisely, for , , and , there is such that
Proof. The zero essential space and the assertion with no test vectors are immediate: take . For , write , and consider the closed linear subspace
It is invariant under every diagonal operator , by multiplication in . It is reducing, since . Its orthogonal projection therefore commutes with each , by H01.
Let be the coordinate inclusion. The entries are bounded operators, and the equation says . Hence every lies in . Since , it commutes with every , and therefore . Equation (ODF2) puts in . It follows that
The definition of now provides one satisfying (ODF3).
Conversely, is strongly closed and contains . Indeed, for , the equation passes to a strong limit, since both evaluations use fixed vectors. Thus every strong limit from belongs to . The two inclusions prove the theorem.
The indices consisting of a finite vector set and a positive error, ordered by enlarging the set and decreasing the error, give a directed set. Choosing one approximant for each such index turns (ODF3) into a strong-convergent net. No countable cofinal family is required.
Figure. The maps and are the actual operators in the ODF03 proof. The diagram depicts their invariant-subspace mechanism; it asserts no finite-dimensionality of or .
ODF04. Self-adjoint strong density by real separation
Lemma. Every is a strong limit of operators with . Their norms are not asserted bounded.
Proof. ODF03 supplies a net converging strongly to . Strong convergence implies weak operator convergence. The adjoints converge weakly to , because
Thus converges weakly to . Each has a self-adjoint lift in .
Fix . The real linear map
takes the real vector space into the real Hilbert space underlying . Every continuous real linear functional on that Hilbert space has the form . To see this from H00, if is real linear, then is bounded complex linear and has a Hilbert representative; taking its real part recovers .
The weak operator convergence just proved therefore puts in the Banach weak closure of . This image is a real linear subspace, hence convex. The real separation proof SEP says that its weak and norm closures agree. Choose with . Directing these choices by finite sets and errors proves strong density.
ODF05. The rational contraction cutoff
Resolvent lemma. If strongly, then
strongly, even when the have no uniform bound.
Proof. For a self-adjoint bounded operator ,
The operator has closed range and zero kernel. Its adjoint has zero kernel too, so that range is dense and therefore all of . Its inverse has norm at most one. The elementary inverse identity gives, for or ,
For a fixed , the norm of the right side applied to is at most . The rightmost vector is fixed; the leftmost inverse has its own uniform bound. This proves the lemma without estimating .
Put
It is real, , and , since . F06 gives with for every . This assertion uses the forced unitization when necessary, and the vanishing value at zero puts the result back in . The resolvent lemma and (ODF4) give strongly.
Theorem (self-adjoint contraction density). Every with is a strong* limit of , where and .
Proof. If , take the constant zero net. Otherwise, in , put
These operators belong to , by its C*-calculus and inverse calculus. They commute, and . Indeed is obtained by continuous functions of , and is invertible. The identity gives
Consequently . This includes .
ODF04 supplies self-adjoint lifts with strongly. Take . The scalar bound gives in , not just in its represented image. Extending to the forced unitization on sends the new unit to . The extension is a unital *-homomorphism, so it preserves inverses and the rational identity (ODF4); hence
All these operators are self-adjoint, so this is strong* convergence.
ODF06. Positive matrices with the same norm bound
Theorem (positive matrix Kaplansky density). For every and every , there is a net such that
The same convergences hold after extension by zero to .
Proof. First identify the strongly generated algebra of . Its elements have entries in . The algebra is strongly closed: a strong limit has entries extracted by the coordinate inclusions and projections, and each limiting entry belongs to . It contains .
Conversely, let , and fix finitely many vectors in . For each entry , ODF03 supplies an element of approximating that entry on all the finitely many -th vector components. If each entry error on each component is less than , each output row error is less than , and the full output vector error is less than . Thus is strongly dense in . Its essential space is : diagonal copies of converge strongly to . Applying ODF03 to the representation identifies its bicommutant with .
If , take the constant zero net. Otherwise put , and let . It is a self-adjoint contraction. Apply ODF05 to the C*-algebra and its representation . We obtain self-adjoint , , with strongly. Set
These matrices are positive and satisfy . ODF01's bounded product estimate gives strongly. The matrices and the target are self-adjoint, so convergence is strong*. Their represented norms are bounded by , and ODF01 then gives ultraweak convergence.
For extension by zero, a vector of is tested only through its orthogonal projection onto . This proves strong and strong* convergence on ; the same norm bound and ODF01 give ultraweak convergence there.
In particular the positive part of the unit ball of a faithfully represented C*-algebra is strongly and ultraweakly dense in the positive unit ball of its generated von Neumann algebra. The statement for Choi matrices uses (ODF5) with that same finite matrix size.
ODF07. The entire contraction ball and the closure algebra
Every contraction is a strong* limit of with . To prove this, the self-adjoint matrix
has norm . Its square is , and the C*-identity and the norm of a block diagonal operator prove this equality. Apply ODF05 at matrix size two to obtain self-adjoint contractions
The matrix norm inequality is part of the matrix construction linked above. The two off-diagonal corners give and strongly. This proves the assertion. The uniformly bounded approximants also converge ultraweakly, by ODF01.
It follows that the strong, strong* and ultraweak closures of , extended by zero on , all equal the supported algebra . For the reverse inclusion in the ultraweak closure, on is ultraweakly closed: for each , the equations are differences of one-term functionals (ODF1). On , the additional equations are also ultraweakly closed by the same one-term tests. The strong* and strong reverse inclusions follow from their fixed-vector versions. On a nondegenerate representation , so each closure is precisely .
References
The bicommutant theorem is due to John von Neumann. The finite-vector projection argument and the rational cutoff above give its density consequence and Kaplansky's theorem at the hypotheses stated here.
Irving Kaplansky, A theorem on rings of operators, Pacific Journal of Mathematics 1 (1951), 227–232. Theorem 1, printed pp.227–231, is the bounded density theorem; Lemmas 1–5, printed pp.228–230, develop the bounded-calculus and Cayley-resolvent method. The real separation, finite amplification and nonunital support arguments needed in this lesson are proved above from the linked programme foundations.