Completely positive finite models
Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).
A finite-dimensional model of an algebra need not preserve products. It can still preserve positivity after we couple the algebra to any matrix system. This is the reason completely positive maps are useful for approximation. They retain the order information that survives compression to a finite-dimensional Hilbert space.
We will construct such models, explain precisely what convergence means, and prove that sufficiently good models force uniqueness of the C*-tensor norm. The arguments work for nonunital and nonseparable algebras. Finite sets, rather than countable lists, organize the approximation.
Prerequisites are the lessons Completely positive maps and AF-algebras, together with the construction of the minimal and maximal C*-tensor products. We use Stinespring's theorem in its following form: a completely positive map is , where is a representation and . No faithfulness of an additional commutant representation is assumed. We also use Hahn–Banach, continuous functional calculus, and positive contractive approximate identities. The extension, dilation and commutant methods are developed in [Arveson 1969]. The exact unital dilation and faithful scalar representation are written out locally; Section 4 below supplies the nonunital dilation step explicitly. These particular spans do not consume the lifting or extension theorem.
Unital algebras in the unital assertions are nonzero. The zero algebra has the approximation property by the zero maps.
1. Approximation is a finite-set question
Write . A completely positive contraction, abbreviated cpc, is a completely positive linear map of norm at most one. A unital completely positive map is abbreviated ucp. For C*-algebras , a cpc map has finite-dimensional completely positive approximations if, for every finite set and every , there are cpc maps
For , this is the completely positive approximation property.
The maps and play different roles. The first records finitely many matrix measurements. The second reconstructs an element of . Neither is required to be multiplicative or injective.
Proposition 1.1. The finite-set definition is equivalent to the existence of a net of cpc factorizations through matrix algebras such that for every .
Proof. Direct the pairs , with finite, by increasing and decreasing . Choose one approximation for each pair. Once the index contains a given and has tolerance less than a given positive number, all later indices meet that requirement. This gives pointwise norm convergence.
Conversely, for each in a finite , convergence gives an index beyond which its error is less than . A common upper bound of these finitely many indices works for all of .
Proposition 1.2. If is separable, a net in Proposition 1.1 can be replaced by a sequence.
Proof. Choose a norm-dense sequence in . At stage , approximate within . For , choose close to . Contractivity gives
First let and then let .
Thus a sequence is available under separability. The definition itself does not require separability.
Finite-dimensional C*-algebras can replace the middle matrix algebra without changing the property. Indeed, write , place as diagonal blocks in , where , and let
The inclusion and are cpc, and fixes . They turn a factorization through into one through . Conversely a full matrix algebra is already finite-dimensional.
2. Order allows extensions
An operator system is a self-adjoint linear subspace of a unital C*-algebra containing . Its matrix positive cones are inherited from . We now prove the extension theorem needed to put finite-dimensional models on a larger algebra.
We first record the norm estimate used in the extension. If a positive operator block has diagonal entries bounded by , positivity of its quadratic form on vectors , minimized over , gives
Thus its off-diagonal entry has norm at most , including the zero diagonal cases. For in an operator system with , the matrix is positive in the ambient algebra: it factors as , where
If is completely positive, applying it at size two and using the preceding block estimate proves . Consequently , whether or not the operator system is norm closed. A faithful representation of the target lets the same calculation treat any C*-algebra target.
We also make the compactness input explicit. For a normed space , put its dual unit ball in
by recording all values of a functional. Each disc is compact, and the product is compact by the complete ultrafilter argument in CF, Section 4. The linearity equations are closed coordinate conditions, so this subset is compact. Its coordinate topology is exactly weak* convergence. Scaling proves the assertion for every bounded dual ball, including radius zero. For real normed spaces, use closed real intervals instead of discs; the same equations and proof apply. The same finite-coordinate argument proves compactness for products of these balls. In particular the actual onto concrete duality for in CP1–CP6 makes its bounded balls ultraweakly compact, for arbitrary .
We now translate a matrix-valued map into a scalar functional. We use column vectors and write quadratic forms as .
Lemma 2.1. For a linear map , define
Then is completely positive if and only if is a positive functional on the operator system .
Proof. If is completely positive and , apply entrywise and evaluate its positive quadratic form on the vector whose -th component is the -th standard basis vector. The result is .
Conversely, let and let . Set . The scalar compression belongs to . Its entries are
Therefore
All quadratic forms of are nonnegative. Hence is completely positive.
Lemma 2.2. A positive functional on an operator system extends to a positive functional on with .
Proof. On the real vector space , define
The set is nonempty because it contains . It is bounded below: implies . The function is sublinear, and for . Real Hahn–Banach extends to a real linear on .
If , then , so . Also . Complexify . The result is a positive linear functional . Positivity gives , so it is bounded.
Theorem 2.3 (Arveson extension). If is an operator system and is completely positive, there is a completely positive extension . If is unital, is unital.
Proof. If , the zero map is the required extension. Otherwise suppose first that , with . Extend from to a positive functional on , using Lemma 2.2. Define
Then , so Lemma 2.1 makes completely positive. For , the definition gives . In particular .
For arbitrary , direct its finite-dimensional subspaces by inclusion. Compress to , extend it by the finite-dimensional case, and regard the extension as a map into , zero on . Each map is completely positive and
For every , the values lie in the ultraweakly compact ball of radius . Compactness of the product of these balls supplies a subnet converging ultraweakly at every . Its limit is linear. Matrix positivity is preserved by this limit: for every positive matrix over and every finite tuple of Hilbert vectors, its image quadratic form is a finite sum of vector functionals, and hence is the limit of nonnegative numbers. Thus is completely positive at every size.
For , we have , which converges strongly to . Its common norm bound makes this convergence ultraweak: each vector coefficient converges, and the square-summable vector series of CP1–CP6 has uniformly small tails by Cauchy–Schwarz. Split such a series into a finite part and its uniformly bounded tail, then let the finite part converge. Thus extends . Its value at is , proving the unital assertion.
No separability of was used. The extension need not be normal even if part of the original setting involves von Neumann algebras.
Corollary 2.4. If is a finite-dimensional C*-subalgebra, there is a cpc map that fixes .
Proof. Represent . Let be its unit, which is a projection of . In the unital algebra , extend each coordinate map by Theorem 2.3. Their direct sum is a ucp map . Put . Compression is cpc, and fixes .
Proposition 2.5 (Normalize at the unit). Let be an operator system and a completely positive map into a von Neumann algebra. Put . There is a ucp map such that
Proof. Represent on its given Hilbert space. Put , whose complementary space is by the bounded adjoint identity. The contractions vanish on , and
They tend strongly to the identity on , and their common bound one extends the convergence to . Thus strongly. All belong to , so its weak operator closedness puts in . This constructs the support projection without a spectral-measure theorem.
The other contractions have the same strong limit. They also vanish on , and the scalar identity
gives . Density in and the common contraction bound again prove strongly. For , set . These maps are completely positive and have norm at most one, since their values at are . Compactness of the product of ultraweakly compact balls in gives a pointwise ultraweak cluster map , which is completely positive and satisfies .
For a positive , . Its quadratic form vanishes on ; positive-form Cauchy–Schwarz then makes every mixed coefficient there zero. Thus annihilates , and self-adjointness gives . The positive elements span , so this holds for every . For the contractions whose strong limit was proved above, bounded multiplication with the fixed gives strongly. Therefore
strongly, and the ultraweak cluster limit gives .
Choose a state of and put . It is ucp, and the added term disappears after multiplication by . The case is included: then .
3. Finite models that we can see
Example 3.1 (Compact operators). Let be any Hilbert space. For a finite-dimensional subspace , compression and inclusion give cpc maps
These approximate the identity in norm as increases. For a finite-rank , a containing the ranges of and makes the compression exact. For a compact , approximate by a finite-rank operator and use contractivity. This proves the completely positive approximation property without assuming separable.
Theorem 3.2 (Locally finite-dimensional algebras). Suppose that is the norm closure of an upward-directed family of finite-dimensional C*-subalgebras. Then has the completely positive approximation property.
Proof. Given finite and , choose one finite-dimensional subalgebra and, for each , an element with . Use Corollary 2.4 for a cpc retraction . Inclusion gives
Replace by a full matrix algebra as explained in Section 1.
In particular every AF-algebra has this property. The directed version also treats norm closures of noncountable families; no countable generating sequence is required.
Theorem 3.3 (Functions vanishing at infinity). For every locally compact Hausdorff space , has the completely positive approximation property.
Proof. If the finite test list is empty or every selected function is zero, use the zero maps through . Otherwise write the list as , choose , and put
Each nonzero level set of a function is compact, so , a finite union of such level sets, is compact. If is empty, every selected function has norm at most , and the zero maps already work. Otherwise its image under is compact. Choose finitely many so that, for every , some has . Define
and also set . On , at least one is greater than ; off , . Thus everywhere. All the weights are continuous, nonnegative, and satisfy .
For , positivity of implies . Therefore the support of is contained in the compact level set ; hence . The weight represents the omitted zero sample and need not have compact support. Define
Evaluation is a contractive *-homomorphism. At every matrix size and every point of , sends a positive matrix to a nonnegative sum of positive scalar matrices. Thus is completely positive, and .
If for , then . If , then . Consequently
This is uniform on all of . Include diagonally in and use the diagonal compression from Section 1 to obtain the required matrix factorization. All compact sets and samples came from the given finite list; no countability assumption or partition-of-unity theorem is used.
For , one may take equally spaced sample points and the piecewise linear tent functions. If every in the finite set has Lipschitz constant at most , a mesh of width gives error at most . This finite model consists of samples and interpolation weights; it is not a finite-dimensional subalgebra of .
4. Why matrix models control tensor norms
For an algebraic tensor , the minimal norm is obtained in a tensor product of faithful representations. The maximal norm is the supremum over representations of and with commuting ranges on one Hilbert space. We always have .
Lemma 4.1. If is cpc, then extends to a contraction both from to and from to .
Proof. For the minimal norm, represent faithfully on and faithfully on , and dilate the resulting map as , with . Then
Every tensor product of representations is bounded by the minimal norm, so this expression has norm at most .
For the maximal norm, fix commuting representations and , and put . We need a dilation of that also carries the -action. Here is the construction. On , use the positive form associated to :
Positive-form Cauchy–Schwarz makes the zero vectors an orthogonal subspace; quotienting and completing gives a Hilbert space. Left multiplication by is bounded by . Indeed its squared norm defect is the positive form of ; this is a Gram matrix after multiplying every by the positive square root of in the unitization, and all Gram entries lie in . Thus left multiplication preserves the nullspace, extends boundedly, and gives the representation ; its product and adjoint identities follow on algebraic vectors and then by continuity. Since commutes with every , the operation
is bounded by in this seminorm: the positive operator matrix commutes with the diagonal matrix whose entries are . The operation therefore descends to the completed quotient. Its adjoint is the operation for , and multiplication is preserved. Thus is a representation commuting with .
Here is the approximate-identity step when is nonunital. Let be a positive contractive approximate identity. For , the quotient vectors have norms at most , since
For every , their inner products converge, because in norm and is bounded. Density and the uniform bound give a weak limit , with . Left multiplication satisfies
in the quotient norm: the squared error is at most . Taking weak limits proves , and pairing with gives . The bounded operator preserves weak limits and takes to . Consequently . In the unital case the same identities follow immediately from . Neither construction requires or the commutant representation to be faithful. It follows that
Its norm is at most . Take the supremum over the commuting representations.
Lemma 4.2. For every , the minimal and maximal norms on agree. The same holds for a finite direct sum of matrix algebras.
Proof. Let be any representation and put . Its action is zero on , so the product with a commuting representation contributes zero there. On , put and define
The matrix-unit identities give
Thus is an isometry. For every , belongs to , and
Hence is onto, and .
An operator commuting with every has zero off-diagonal blocks. Commuting also with every forces all diagonal blocks to be the same operator. Consequently any representation commuting with reduces , and on that subspace
where is a representation: linearity, products and adjoints follow from the diagonal blocks. No faithfulness or nondegeneracy of is needed. Every product representation defining the maximal tensor norm is therefore a spatial representation, and its norm on an algebraic tensor is bounded by the minimal tensor norm. The always valid reverse inequality gives equality.
For , the images of its central summand units are mutually orthogonal projections. They split the active representation space into reducing summands for both commuting actions; on each, the preceding matrix-unit proof applies. The product norm is the largest of these finitely many summand norms, as is the spatial direct-sum norm. The complementary zero-action space again contributes zero. Thus the minimal and maximal norms on agree.
A C*-algebra is nuclear if these two norms agree on for every C*-algebra .
Theorem 4.3. A C*-algebra with the completely positive approximation property is nuclear.
Proof. Fix and . Choose cpc factorizations approximating . The cross-norm estimate gives
By Lemmas 4.1 and 4.2,
Pass to the limit. The reverse inequality always holds.
Combining this with Section 3 proves nuclearity of compact operators, commutative C*-algebras and AF-algebras. The converse, nuclearity implies completely positive approximation, requires an additional separation argument; it is proved in Tensor positivity and nuclearity.
5. Permanence from the maps
Proposition 5.1. If has the completely positive approximation property and is cpc, then has finite-dimensional completely positive approximations.
Proof. Compose the reconstruction map for an approximation of with . Contractivity of does not increase the error.
Proposition 5.2. If has the completely positive approximation property and there are cpc maps , with , then has the same property.
Proof. Compose approximations of on the finite set with and .
Proposition 5.3. If has the completely positive approximation property, so do every closed ideal and every corner , where is a projection.
Proof. For an ideal, let be finite. Choose a positive contraction with for , using an approximate identity of . Choose a cpc factorization on with error less than on . Restrict to , and replace by . The new reconstruction map has range in , is cpc, and has total error less than .
For a corner, use the inclusion and the cpc retraction in Proposition 5.2.
Proposition 5.4. Suppose is the closure of an upward-directed family of C*-subalgebras , each having the completely positive approximation property. Then has the property.
Proof. Approximate a finite set by elements of a common . Choose cpc maps , approximating all .
The map extends to a cpc map . To see this when the algebras are nonunital, take a Stinespring dilation of and extend its representation to the unitization. This gives a completely positive extension to with value at at most . Apply Theorem 2.3 in the unitization of , and restrict back to . Its norm is at most one. If already contains the ambient unit, apply Theorem 2.3 directly.
Let be followed by inclusion in . Then
Choose both errors small enough.
6. Exercises with solutions
Exercise 1 (A finite algebra inside one matrix algebra; introductory). Embed in . Give a cpc retraction and verify that it fixes the embedded algebra.
Solution. Use diagonal blocks of sizes , with projections . The retraction is . Each compression is completely positive. The direct sum map is unital, so is contractive. On a block diagonal matrix it returns the original three blocks.
Exercise 2 (Error propagation; introductory). Suppose and are contractions on a Banach space and on a dense subset. Prove convergence everywhere.
Solution. For any , select with . Then . The limit superior is at most , and is arbitrary.
Exercise 3 (A matrix test for positivity; intermediate). For , prove that is completely positive if and only if is positive in .
Solution. The matrix is positive: on it is the rank-one operator . Complete positivity therefore makes positive.
Conversely factor , writing its entries as . For a positive block matrix , each matrix
is positive. Indeed it is obtained from the positive scalar matrix indexed by by multiplying on the left and right by the corresponding rectangular matrices with entries . Summing over gives .
Exercise 4 (A model with no product rule; intermediate). On , let and . Show that are ucp, that fixes the function , and that it does not fix .
Solution. Evaluation is a unital *-homomorphism. The two coefficients are positive and sum to one, so is ucp by the pointwise matrix test. Both and have samples , so their reconstructions are . At , the reconstructed square has value , while has value .
Exercise 5 (Why a net is needed; intermediate). Let be uncountable and . Prove that no sequence of finite-dimensional subspaces makes in norm for every .
Solution. The closed span of all is separable. Every vector of has countable support, so a countable dense subset of has support in some countable . Choose . Then for every . For the rank-one projection onto , all compressions vanish, and their distance from is one. The directed family of all finite-dimensional subspaces does approximate every compact operator, as in Example 3.1.
Exercise 6 (Weak approximation and convexity; advanced). Let consist of cpc maps factoring through matrix algebras. Prove that is convex. Then show that if lies in its pointwise weak closure, it lies in its pointwise norm closure.
Solution. For factorizations and nonnegative summing to one, define and . Both are cpc: at every matrix level positivity is preserved, and the norm of the second is at most . Replace the direct sum by one matrix algebra using Section 1.
For a finite , evaluate in the Banach space , with maximum norm. Its image is convex. The weak and norm closures of a convex subset of a Banach space agree by Hahn–Banach separation. The pointwise weak hypothesis says belongs to its weak closure, hence to its norm closure. This is exactly the required finite-set approximation.
Exercise 7 (The unit can be repaired; advanced). Suppose are unital, is ucp, and cpc factorizations approximate in norm. Prove that the approximating maps can be taken ucp in both directions.
Solution. Start with , , and put . Choose a state on and define . This is ucp. Let . Then , so , and .
Choose a state on , and set . This too is ucp. Since , the additional error on is at most . Consequently
Include in the finite set and make its error sufficiently small.
Exercise 8 (A hypothesis cannot be dropped; introductory). Is every bounded map from an operator system to the restriction of a completely positive map?
Solution. No. Take , , and . It has norm one, and all its matrix amplifications have norm one. But is not positive. Any extension still has that value at , so cannot be positive. Complete positivity of the original map is essential in Theorem 2.3.
References
[Arveson 1969] William B. Arveson, Subalgebras of C*-algebras, Acta Mathematica 123 (1969), 141–224, DOI 10.1007/BF02392388. Theorem 1.1.1 and its proof construct the Stinespring quotient. Theorem 1.2.3 and its proof establish extension by separation and finite-dimensional compression; Proposition 1.2.10 gives the matrix norm bound. Theorem 1.3.1 constructs the commutant lift without assuming the dilation operator injective.
Section 2 here gives a different extension proof: the exact scalar functional on the matrix operator system, an order-dominating Hahn–Banach extension, and an ultraweak cluster map over all finite-dimensional subspaces. It also covers operator systems that are not norm closed. Section 4 carries the commuting action through the quotient directly and proves its approximate-identity identities for a nonunital algebra. The finite-set models, diffuse function interpolation, tensor-norm comparison and permanence arguments are derived above from these methods. They are not statements attributed to Arveson’s 1969 paper. In particular, Theorem 4.3 proves the direction from finite completely positive approximation to nuclearity; the converse is the separate tensor-positivity lesson.