Open MathsAll courses
Positive maps and finite-dimensional approximation · Prerequisite proofs · Sources and terms

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 ϕ:A→B(H)\phi:A\to B(H) is V∗π( ⋅ )VV^*\pi(\,\cdot\,)V, where π\pi is a representation and ∥V∥2=∥ϕ∥\|V\|^2=\|\phi\|. 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 Mn=Mn(C)M_n=M_n(\mathbb C). 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,DA,D, a cpc map θ:A→D\theta:A\to D has finite-dimensional completely positive approximations if, for every finite set F⊂AF\subset A and every ε>0\varepsilon>0, there are cpc maps

A→αMn→βDsuch that∥βα(a)−θ(a)∥<ε(a∈F).A\xrightarrow{\alpha}M_n\xrightarrow{\beta}D \quad\text{such that}\quad \|\beta\alpha(a)-\theta(a)\|<\varepsilon\quad(a\in F).

For θ=id⁡A\theta=\operatorname{id}_A, this is the completely positive approximation property.

The maps α\alpha and β\beta play different roles. The first records finitely many matrix measurements. The second reconstructs an element of DD. 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 θi=βiαi\theta_i=\beta_i\alpha_i through matrix algebras such that ∥θi(a)−θ(a)∥→0\|\theta_i(a)-\theta(a)\|\to0 for every a∈Aa\in A.

Proof. Direct the pairs (F,ε)(F,\varepsilon), with FF finite, by increasing FF and decreasing ε\varepsilon. Choose one approximation for each pair. Once the index contains a given aa and has tolerance less than a given positive number, all later indices meet that requirement. This gives pointwise norm convergence.

Conversely, for each aa in a finite FF, convergence gives an index beyond which its error is less than ε\varepsilon. A common upper bound of these finitely many indices works for all of FF. □\square

Proposition 1.2. If AA is separable, a net in Proposition 1.1 can be replaced by a sequence.

Proof. Choose a norm-dense sequence a1,a2,…a_1,a_2,\ldots in AA. At stage kk, approximate a1,…,aka_1,\ldots,a_k within 1/k1/k. For a∈Aa\in A, choose aja_j close to aa. Contractivity gives

∥θk(a)−θ(a)∥≤2∥a−aj∥+∥θk(aj)−θ(aj)∥.\|\theta_k(a)-\theta(a)\| \le 2\|a-a_j\|+\|\theta_k(a_j)-\theta(a_j)\|.

First let k→∞k\to\infty and then let aj→aa_j\to a. □\square

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 F=⨁j=1rMnjF=\bigoplus_{j=1}^rM_{n_j}, place FF as diagonal blocks in MNM_N, where N=∑jnjN=\sum_jn_j, and let

P(x)=⨁jpjxpj.P(x)=\bigoplus_jp_jxp_j.

The inclusion and PP are cpc, and PP fixes FF. They turn a factorization through FF into one through MNM_N. Conversely a full matrix algebra is already finite-dimensional.

2. Order allows extensions

An operator system S⊂CS\subset C is a self-adjoint linear subspace of a unital C*-algebra containing 1C1_C. Its matrix positive cones are inherited from CC. 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 c1c1, positivity of its quadratic form on vectors (ξ,zη)(\xi,z\eta), minimized over z∈Cz\in\mathbb C, gives

∣⟨ξ,Yη⟩∣2≤⟨ξ,T1ξ⟩⟨η,T2η⟩≤c2∥ξ∥2∥η∥2.|\langle\xi,Y\eta\rangle|^2 \le\langle\xi,T_1\xi\rangle\langle\eta,T_2\eta\rangle \le c^2\|\xi\|^2\|\eta\|^2.

Thus its off-diagonal entry YY has norm at most cc, including the zero diagonal cases. For xx in an operator system with ∥x∥≤1\|x\|\le1, the matrix (1xx∗1)\begin{pmatrix}1&x\\x^*&1\end{pmatrix} is positive in the ambient algebra: it factors as R∗RR^*R, where

R=(1x0(1−x∗x)1/2).R=\begin{pmatrix}1&x\\0&(1-x^*x)^{1/2}\end{pmatrix}.

If ϕ\phi is completely positive, applying it at size two and using the preceding block estimate proves ∥ϕ(x)∥≤∥ϕ(1)∥\|\phi(x)\|\le\|\phi(1)\|. Consequently ∥ϕ∥=∥ϕ(1)∥\|\phi\|=\|\phi(1)\|, 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 EE, put its dual unit ball in

∏x∈E{z∈C:∣z∣≤∥x∥}\prod_{x\in E}\{z\in\mathbb C:|z|\le\|x\|\}

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 B(H)B(H) in CP1–CP6 makes its bounded balls ultraweakly compact, for arbitrary HH.

We now translate a matrix-valued map into a scalar functional. We use column vectors and write quadratic forms as ξ∗Tξ\xi^*T\xi.

Lemma 2.1. For a linear map ϕ:S→Mn\phi:S\to M_n, define

fϕ([sij])=∑i,j=1nϕ(sij)ij.f_\phi([s_{ij}])=\sum_{i,j=1}^n\phi(s_{ij})_{ij}.

Then ϕ\phi is completely positive if and only if fϕf_\phi is a positive functional on the operator system Mn(S)M_n(S).

Proof. If ϕ\phi is completely positive and [sij]≥0[s_{ij}]\ge0, apply ϕ\phi entrywise and evaluate its positive quadratic form on the vector whose ii-th component is the ii-th standard basis vector. The result is fϕ([sij])≥0f_\phi([s_{ij}])\ge0.

Conversely, let X=[spq]∈Mm(S)+X=[s_{pq}]\in M_m(S)_+ and let ξ1,…,ξm∈Cn\xi_1,\ldots,\xi_m\in\mathbb C^n. Set Upi=(ξp)iU_{pi}=(\xi_p)_i. The scalar compression U∗XUU^*XU belongs to Mn(S)+M_n(S)_+. Its entries are

(U∗XU)ij=∑p,q(ξp)i‾spq(ξq)j.(U^*XU)_{ij}=\sum_{p,q}\overline{(\xi_p)_i}s_{pq}(\xi_q)_j.

Therefore

fϕ(U∗XU)=∑p,qξp∗ϕ(spq)ξq≥0.f_\phi(U^*XU) =\sum_{p,q}\xi_p^*\phi(s_{pq})\xi_q\ge0.

All quadratic forms of ϕ(m)(X)\phi^{(m)}(X) are nonnegative. Hence ϕ\phi is completely positive. □\square

Lemma 2.2. A positive functional ff on an operator system R⊂DR\subset D extends to a positive functional gg on DD with g(1)=f(1)g(1)=f(1).

Proof. On the real vector space DsaD_{\rm sa}, define

p(x)=inf⁡{f(y):y∈Rsa, y≥x}.p(x)=\inf\{f(y):y\in R_{\rm sa},\ y\ge x\}.

The set is nonempty because it contains ∥x∥1\|x\|1. It is bounded below: y≥x≥−∥x∥1y\ge x\ge-\|x\|1 implies f(y)≥−∥x∥f(1)f(y)\ge-\|x\|f(1). The function pp is sublinear, and p(y)=f(y)p(y)=f(y) for y∈Rsay\in R_{\rm sa}. Real Hahn–Banach extends f∣Rsaf|_{R_{\rm sa}} to a real linear g0≤pg_0\le p on DsaD_{\rm sa}.

If x≥0x\ge0, then p(−x)≤f(0)=0p(-x)\le f(0)=0, so g0(x)≥0g_0(x)\ge0. Also g0(1)=f(1)g_0(1)=f(1). Complexify g0g_0. The result is a positive linear functional gg. Positivity gives ∥g∥=g(1)\|g\|=g(1), so it is bounded. □\square

Theorem 2.3 (Arveson extension). If S⊂CS\subset C is an operator system and ϕ:S→B(H)\phi:S\to B(H) is completely positive, there is a completely positive extension Φ:C→B(H)\Phi:C\to B(H). If ϕ\phi is unital, Φ\Phi is unital.

Proof. If H=0H=0, the zero map is the required extension. Otherwise suppose first that H=CnH=\mathbb C^n, with n≥1n\ge1. Extend fϕf_\phi from Mn(S)M_n(S) to a positive functional gg on Mn(C)M_n(C), using Lemma 2.2. Define

Φ(c)ij=g(Eij⊗c).\Phi(c)_{ij}=g(E_{ij}\otimes c).

Then fΦ=gf_\Phi=g, so Lemma 2.1 makes Φ\Phi completely positive. For s∈Ss\in S, the definition gives Φ(s)ij=ϕ(s)ij\Phi(s)_{ij}=\phi(s)_{ij}. In particular Φ(1)=ϕ(1)\Phi(1)=\phi(1).

For arbitrary HH, direct its finite-dimensional subspaces KK by inclusion. Compress ϕ\phi to B(K)B(K), extend it by the finite-dimensional case, and regard the extension ΦK\Phi_K as a map into B(H)B(H), zero on K⊥K^\perp. Each map is completely positive and

∥ΦK∥=∥ΦK(1)∥=∥PKϕ(1)PK∥≤∥ϕ(1)∥.\|\Phi_K\|=\|\Phi_K(1)\| =\|P_K\phi(1)P_K\|\le\|\phi(1)\|.

For every c∈Cc\in C, the values lie in the ultraweakly compact ball of radius ∥ϕ(1)∥∥c∥\|\phi(1)\|\|c\|. Compactness of the product of these balls supplies a subnet converging ultraweakly at every cc. Its limit Φ\Phi is linear. Matrix positivity is preserved by this limit: for every positive matrix over CC 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 Φ\Phi is completely positive at every size.

For s∈Ss\in S, we have ΦK(s)=PKϕ(s)PK\Phi_K(s)=P_K\phi(s)P_K, which converges strongly to ϕ(s)\phi(s). 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 Φ\Phi extends ϕ\phi. Its value at 11 is ϕ(1)\phi(1), proving the unital assertion. □\square

No separability of HH was used. The extension need not be normal even if part of the original setting involves von Neumann algebras.

Corollary 2.4. If F⊂AF\subset A is a finite-dimensional C*-subalgebra, there is a cpc map E:A→FE:A\to F that fixes FF.

Proof. Represent F=⨁jMnjF=\bigoplus_jM_{n_j}. Let pp be its unit, which is a projection of AA. In the unital algebra pAppAp, extend each coordinate map F→MnjF\to M_{n_j} by Theorem 2.3. Their direct sum is a ucp map E0:pAp→FE_0:pAp\to F. Put E(a)=E0(pap)E(a)=E_0(pap). Compression is cpc, and EE fixes FF. □\square

Proposition 2.5 (Normalize at the unit). Let S⊂CS\subset C be an operator system and ϕ:S→M\phi:S\to M a completely positive map into a von Neumann algebra. Put b=ϕ(1)b=\phi(1). There is a ucp map ϕ0:S→M\phi_0:S\to M such that

ϕ(x)=b1/2ϕ0(x)b1/2(x∈S).\phi(x)=b^{1/2}\phi_0(x)b^{1/2}\quad(x\in S).

Proof. Represent MM on its given Hilbert space. Put e=PbH‾e=P_{\overline{bH}}, whose complementary space is ker⁡b\ker b by the bounded adjoint identity. The contractions rδ=b(b+δ1)−1r_\delta=b(b+\delta1)^{-1} vanish on ker⁡b\ker b, and

∥(1−rδ)b∥=∥δb(b+δ1)−1∥≤δ.\|(1-r_\delta)b\|=\|\delta b(b+\delta1)^{-1}\|\le\delta.

They tend strongly to the identity on bHbH, and their common bound one extends the convergence to bH‾\overline{bH}. Thus rδ→er_\delta\to e strongly. All rδr_\delta belong to MM, so its weak operator closedness puts ee in MM. This constructs the support projection without a spectral-measure theorem.

The other contractions kδ=b1/2(b+δ1)−1/2k_\delta=b^{1/2}(b+\delta1)^{-1/2} have the same strong limit. They also vanish on ker⁡b\ker b, and the scalar identity

t(1−tt+δ)=δtt+δ(t+δ+t)≤δ/2(t≥0)t\left(1-\sqrt{\frac{t}{t+\delta}}\right) =\frac{\delta t}{\sqrt{t+\delta}(\sqrt{t+\delta}+\sqrt t)} \le\delta/2\quad(t\ge0)

gives ∥(1−kδ)b∥≤δ/2\|(1-k_\delta)b\|\le\delta/2. Density in bH‾\overline{bH} and the common contraction bound again prove kδ→ek_\delta\to e strongly. For δ>0\delta>0, set ψδ(x)=(b+δ1)−1/2ϕ(x)(b+δ1)−1/2\psi_\delta(x)=(b+\delta1)^{-1/2}\phi(x)(b+\delta1)^{-1/2}. These maps are completely positive and have norm at most one, since their values at 11 are b(b+δ1)−1≤1b(b+\delta1)^{-1}\le1. Compactness of the product of ultraweakly compact balls in MM gives a pointwise ultraweak cluster map ψ0\psi_0, which is completely positive and satisfies ψ0(1)=e\psi_0(1)=e.

For a positive x∈Sx\in S, 0≤ϕ(x)≤∥x∥b0\le\phi(x)\le\|x\|b. Its quadratic form vanishes on ker⁡b\ker b; positive-form Cauchy–Schwarz then makes every mixed coefficient there zero. Thus ϕ(x)\phi(x) annihilates ker⁡b\ker b, and self-adjointness gives ϕ(x)=eϕ(x)e\phi(x)=e\phi(x)e. The positive elements span SS, so this holds for every xx. For the contractions kδk_\delta whose strong limit was proved above, bounded multiplication with the fixed ϕ(x)\phi(x) gives kδϕ(x)kδ→eϕ(x)e=ϕ(x)k_\delta\phi(x)k_\delta\to e\phi(x)e=\phi(x) strongly. Therefore

b1/2ψδ(x)b1/2⟶ϕ(x)b^{1/2}\psi_\delta(x)b^{1/2} \longrightarrow\phi(x)

strongly, and the ultraweak cluster limit gives b1/2ψ0(x)b1/2=ϕ(x)b^{1/2}\psi_0(x)b^{1/2}=\phi(x).

Choose a state ω\omega of CC and put ϕ0(x)=ψ0(x)+ω(x)(1−e)\phi_0(x)=\psi_0(x)+\omega(x)(1-e). It is ucp, and the added term disappears after multiplication by b1/2b^{1/2}. The case b=0b=0 is included: then ϕ=0\phi=0. □\square

3. Finite models that we can see

Example 3.1 (Compact operators). Let HH be any Hilbert space. For a finite-dimensional subspace KK, compression and inclusion give cpc maps

K(H)⟶B(K)⟶K(H),T⟼PKTPK.\mathcal K(H)\longrightarrow B(K)\longrightarrow\mathcal K(H), \qquad T\longmapsto P_KTP_K.

These approximate the identity in norm as KK increases. For a finite-rank TT, a KK containing the ranges of TT and T∗T^* makes the compression exact. For a compact TT, approximate by a finite-rank operator and use contractivity. This proves the completely positive approximation property without assuming HH separable.

Theorem 3.2 (Locally finite-dimensional algebras). Suppose that AA is the norm closure of an upward-directed family of finite-dimensional C*-subalgebras. Then AA has the completely positive approximation property.

Proof. Given finite F⊂AF\subset A and ε>0\varepsilon>0, choose one finite-dimensional subalgebra DD and, for each a∈Fa\in F, an element da∈Dd_a\in D with ∥a−da∥<ε/2\|a-d_a\|<\varepsilon/2. Use Corollary 2.4 for a cpc retraction E:A→DE:A\to D. Inclusion j:D→Aj:D\to A gives

∥jE(a)−a∥≤∥E(a−da)∥+∥da−a∥<ε.\|jE(a)-a\|\le\|E(a-d_a)\|+\|d_a-a\|<\varepsilon.

Replace DD by a full matrix algebra as explained in Section 1. □\square

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 XX, C0(X)C_0(X) 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 M1M_1. Otherwise write the list as f1,…,fmf_1,\ldots,f_m, choose 0<δ<ε0<\delta<\varepsilon, and put

z(x)=(f1(x),…,fm(x)),K={x:∥z(x)∥∞≥δ/2}.z(x)=(f_1(x),\ldots,f_m(x)),\qquad K=\{x:\|z(x)\|_\infty\ge\delta/2\}.

Each nonzero level set of a C0(X)C_0(X) function is compact, so KK, a finite union of such level sets, is compact. If KK is empty, every selected function has norm at most δ/2\delta/2, and the zero maps already work. Otherwise its image under zz is compact. Choose finitely many xj∈Kx_j\in K so that, for every x∈Kx\in K, some jj has ∥z(x)−z(xj)∥∞<δ/8\|z(x)-z(x_j)\|_\infty<\delta/8. Define

w0(x)=max⁡{0,δ−∥z(x)∥∞},wj(x)=max⁡{0,δ/4−∥z(x)−z(xj)∥∞},W(x)=w0(x)+∑jwj(x),gj(x)=wj(x)/W(x),\begin{aligned} w_0(x)&=\max\{0,\delta-\|z(x)\|_\infty\},\\ w_j(x)&=\max\{0,\delta/4-\|z(x)-z(x_j)\|_\infty\},\\ W(x)&=w_0(x)+\sum_jw_j(x),\qquad g_j(x)=w_j(x)/W(x), \end{aligned}

and also set g0=w0/Wg_0=w_0/W. On KK, at least one wjw_j is greater than δ/8\delta/8; off KK, w0>δ/2w_0>\delta/2. Thus W>0W>0 everywhere. All the weights are continuous, nonnegative, and satisfy g0+∑jgj=1g_0+\sum_jg_j=1.

For j≥1j\ge1, positivity of wj(x)w_j(x) implies ∥z(x)∥∞>∥z(xj)∥∞−δ/4≥δ/4\|z(x)\|_\infty>\|z(x_j)\|_\infty-\delta/4\ge\delta/4. Therefore the support of gjg_j is contained in the compact level set {x:∥z(x)∥∞≥δ/4}\{x:\|z(x)\|_\infty\ge\delta/4\}; hence gj∈Cc(X)+g_j\in C_c(X)_+. The weight g0g_0 represents the omitted zero sample and need not have compact support. Define

α(f)=(f(xj))j=1r,β((aj)j=1r)=∑j=1rajgj.\alpha(f)=(f(x_j))_{j=1}^r,\qquad \beta((a_j)_{j=1}^r)=\sum_{j=1}^ra_jg_j.

Evaluation α:C0(X)→Cr\alpha:C_0(X)\to\mathbb C^r is a contractive *-homomorphism. At every matrix size and every point of XX, β\beta sends a positive matrix to a nonnegative sum of positive scalar matrices. Thus β\beta is completely positive, and ∥β∥=∥∑jgj∥≤1\|\beta\|=\|\sum_jg_j\|\le1.

If gj(x)>0g_j(x)>0 for j≥1j\ge1, then ∣fi(xj)−fi(x)∣<δ/4|f_i(x_j)-f_i(x)|<\delta/4. If g0(x)>0g_0(x)>0, then ∣fi(x)∣<δ|f_i(x)|<\delta. Consequently

∣βα(fi)(x)−fi(x)∣≤∑j=1rgj(x)∣fi(xj)−fi(x)∣+g0(x)∣fi(x)∣≤δ<ε.|\beta\alpha(f_i)(x)-f_i(x)| \le\sum_{j=1}^rg_j(x)|f_i(x_j)-f_i(x)|+g_0(x)|f_i(x)| \le\delta<\varepsilon.

This is uniform on all of XX. Include Cr\mathbb C^r diagonally in MrM_r 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. □\square

For X=[0,1]X=[0,1], one may take equally spaced sample points and the piecewise linear tent functions. If every ff in the finite set has Lipschitz constant at most LL, a mesh of width hh gives error at most LhLh. This finite model consists of samples and interpolation weights; it is not a finite-dimensional subalgebra of C([0,1])C([0,1]).

4. Why matrix models control tensor norms

For an algebraic tensor z∈A⊙Bz\in A\odot B, the minimal norm is obtained in a tensor product of faithful representations. The maximal norm is the supremum over representations of AA and BB with commuting ranges on one Hilbert space. We always have ∥z∥min⁡≤∥z∥max⁡\|z\|_{\min}\le\|z\|_{\max}.

Lemma 4.1. If ϕ:A→D\phi:A\to D is cpc, then ϕ⊙id⁡B\phi\odot\operatorname{id}_B extends to a contraction both from A⊗min⁡BA\otimes_{\min}B to D⊗min⁡BD\otimes_{\min}B and from A⊗max⁡BA\otimes_{\max}B to D⊗max⁡BD\otimes_{\max}B.

Proof. For the minimal norm, represent DD faithfully on HH and BB faithfully on LL, and dilate the resulting map A→B(H)A\to B(H) as V∗π( ⋅ )VV^*\pi(\,\cdot\,)V, with ∥V∥≤1\|V\|\le1. Then

(ϕ⊙id⁡B)(z)=(V⊗1)∗(π⊙σ)(z)(V⊗1).(\phi\odot\operatorname{id}_B)(z) =(V\otimes1)^*(\pi\odot\sigma)(z)(V\otimes1).

Every tensor product of representations is bounded by the minimal norm, so this expression has norm at most ∥z∥min⁡\|z\|_{\min}.

For the maximal norm, fix commuting representations ρ:D→B(H)\rho:D\to B(H) and σ:B→B(H)\sigma:B\to B(H), and put ψ=ρϕ\psi=\rho\phi. We need a dilation of ψ\psi that also carries the BB-action. Here is the construction. On A⊙HA\odot H, use the positive form associated to ψ\psi:

∥∑iai⊗ξi∥ψ2=∑i,jξi∗ψ(ai∗aj)ξj.\left\|\sum_i a_i\otimes\xi_i\right\|_\psi^2 =\sum_{i,j}\xi_i^*\psi(a_i^*a_j)\xi_j.

Positive-form Cauchy–Schwarz makes the zero vectors an orthogonal subspace; quotienting and completing gives a Hilbert space. Left multiplication by c∈Ac\in A is bounded by ∥c∥\|c\|. Indeed its squared norm defect is the positive form of [ai∗(∥c∥21−c∗c)aj][a_i^*(\|c\|^2 1-c^*c)a_j]; this is a Gram matrix after multiplying every aja_j by the positive square root of ∥c∥21−c∗c\|c\|^2 1-c^*c in the unitization, and all Gram entries lie in AA. Thus left multiplication preserves the nullspace, extends boundedly, and gives the representation π\pi; its product and adjoint identities follow on algebraic vectors and then by continuity. Since σ(b)\sigma(b) commutes with every ψ(a)\psi(a), the operation

σ^(b)(a⊗ξ)=a⊗σ(b)ξ\widehat\sigma(b)(a\otimes\xi)=a\otimes\sigma(b)\xi

is bounded by ∥b∥\|b\| in this seminorm: the positive operator matrix [ψ(ai∗aj)][\psi(a_i^*a_j)] commutes with the diagonal matrix whose entries are σ(b)\sigma(b). The operation therefore descends to the completed quotient. Its adjoint is the operation for b∗b^*, and multiplication is preserved. Thus σ^\widehat\sigma is a representation commuting with π\pi.

Here is the approximate-identity step when AA is nonunital. Let (eλ)(e_\lambda) be a positive contractive approximate identity. For ξ∈H\xi\in H, the quotient vectors eλ⊗ξe_\lambda\otimes\xi have norms at most ∥ξ∥\|\xi\|, since

∥eλ⊗ξ∥ψ2=ξ∗ψ(eλ2)ξ≤∥ξ∥2.\|e_\lambda\otimes\xi\|_\psi^2 =\xi^*\psi(e_\lambda^2)\xi\le\|\xi\|^2.

For every a⊗ηa\otimes\eta, their inner products converge, because eλa→ae_\lambda a\to a in norm and ψ\psi is bounded. Density and the uniform bound give a weak limit VξV\xi, with ∥V∥≤1\|V\|\le1. Left multiplication satisfies

π(a)(eλ⊗ξ)=aeλ⊗ξ⟶a⊗ξ\pi(a)(e_\lambda\otimes\xi)=ae_\lambda\otimes\xi \longrightarrow a\otimes\xi

in the quotient norm: the squared error is at most ∥aeλ−a∥2∥ξ∥2\|ae_\lambda-a\|^2\|\xi\|^2. Taking weak limits proves π(a)Vξ=a⊗ξ\pi(a)V\xi=a\otimes\xi, and pairing with VηV\eta gives V∗π(a)V=ψ(a)V^*\pi(a)V=\psi(a). The bounded operator σ^(b)\widehat\sigma(b) preserves weak limits and takes eλ⊗ξe_\lambda\otimes\xi to eλ⊗σ(b)ξe_\lambda\otimes\sigma(b)\xi. Consequently σ^(b)V=Vσ(b)\widehat\sigma(b)V=V\sigma(b). In the unital case the same identities follow immediately from Vξ=1⊗ξV\xi=1\otimes\xi. Neither construction requires VV or the commutant representation to be faithful. It follows that

∑iρ(ϕ(ai))σ(bi)=V∗(∑iπ(ai)σ^(bi))V.\sum_i\rho(\phi(a_i))\sigma(b_i) =V^*\left(\sum_i\pi(a_i)\widehat\sigma(b_i)\right)V.

Its norm is at most ∥∑iai⊗bi∥max⁡\|\sum_i a_i\otimes b_i\|_{\max}. Take the supremum over the commuting representations. □\square

Lemma 4.2. For every BB, the minimal and maximal norms on Mn⊙BM_n\odot B agree. The same holds for a finite direct sum of matrix algebras.

Proof. Let π:Mn→B(K)\pi:M_n\to B(K) be any representation and put e=π(1n)e=\pi(1_n). Its action is zero on (1−e)K(1-e)K, so the product with a commuting representation contributes zero there. On eKeK, put L=π(E11)KL=\pi(E_{11})K and define

U:Cn⊗L⟶eK,U(ei⊗ξ)=π(Ei1)ξ.U:\mathbb C^n\otimes L\longrightarrow eK, \qquad U(e_i\otimes\xi)=\pi(E_{i1})\xi.

The matrix-unit identities give

⟨π(Ei1)ξ,π(Ej1)η⟩=δij⟨ξ,η⟩.\langle\pi(E_{i1})\xi,\pi(E_{j1})\eta\rangle =\delta_{ij}\langle\xi,\eta\rangle.

Thus UU is an isometry. For every ζ∈eK\zeta\in eK, ξi=π(E1i)ζ\xi_i=\pi(E_{1i})\zeta belongs to LL, and

∑iU(ei⊗ξi)=∑iπ(Eii)ζ=ζ.\sum_iU(e_i\otimes\xi_i)=\sum_i\pi(E_{ii})\zeta=\zeta.

Hence UU is onto, and U∗π(x)U=x⊗1LU^*\pi(x)U=x\otimes1_L.

An operator commuting with every Eii⊗1E_{ii}\otimes1 has zero off-diagonal blocks. Commuting also with every Eij⊗1E_{ij}\otimes1 forces all diagonal blocks to be the same operator. Consequently any representation σ:B→B(K)\sigma:B\to B(K) commuting with π(Mn)\pi(M_n) reduces eKeK, and on that subspace

U∗σ(b)U=1n⊗σ0(b),U^*\sigma(b)U=1_n\otimes\sigma_0(b),

where σ0:B→B(L)\sigma_0:B\to B(L) is a representation: linearity, products and adjoints follow from the diagonal blocks. No faithfulness or nondegeneracy of σ0\sigma_0 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 F=⨁j=1rMnjF=\bigoplus_{j=1}^rM_{n_j}, 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 F⊙BF\odot B agree. □\square

A C*-algebra AA is nuclear if these two norms agree on A⊙BA\odot B for every C*-algebra BB.

Theorem 4.3. A C*-algebra with the completely positive approximation property is nuclear.

Proof. Fix BB and z=∑j=1raj⊗bjz=\sum_{j=1}^ra_j\otimes b_j. Choose cpc factorizations θi=βiαi\theta_i=\beta_i\alpha_i approximating id⁡A\operatorname{id}_A. The cross-norm estimate gives

∥(θi⊙id⁡B)(z)−z∥max⁡≤∑j∥θi(aj)−aj∥∥bj∥⟶0.\|(\theta_i\odot\operatorname{id}_B)(z)-z\|_{\max} \le\sum_j\|\theta_i(a_j)-a_j\|\|b_j\|\longrightarrow0.

By Lemmas 4.1 and 4.2,

∥(βi⊙id⁡B)(αi⊙id⁡B)(z)∥max⁡≤∥(αi⊙id⁡B)(z)∥Mni⊗max⁡B=∥(αi⊙id⁡B)(z)∥Mni⊗min⁡B≤∥z∥min⁡.\begin{aligned} \|(\beta_i\odot\operatorname{id}_B)(\alpha_i\odot\operatorname{id}_B)(z)\|_{\max} &\le\|(\alpha_i\odot\operatorname{id}_B)(z)\|_{M_{n_i}\otimes_{\max}B}\\ &=\|(\alpha_i\odot\operatorname{id}_B)(z)\|_{M_{n_i}\otimes_{\min}B}\\ &\le\|z\|_{\min}. \end{aligned}

Pass to the limit. The reverse inequality always holds. □\square

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 AA has the completely positive approximation property and θ:A→D\theta:A\to D is cpc, then θ\theta has finite-dimensional completely positive approximations.

Proof. Compose the reconstruction map for an approximation of id⁡A\operatorname{id}_A with θ\theta. Contractivity of θ\theta does not increase the error. □\square

Proposition 5.2. If DD has the completely positive approximation property and there are cpc maps s:A→Ds:A\to D, r:D→Ar:D\to A with rs=id⁡Ars=\operatorname{id}_A, then AA has the same property.

Proof. Compose approximations of id⁡D\operatorname{id}_D on the finite set s(F)s(F) with ss and rr. □\square

Proposition 5.3. If AA has the completely positive approximation property, so do every closed ideal I⊂AI\subset A and every corner pAppAp, where p∈Ap\in A is a projection.

Proof. For an ideal, let F⊂IF\subset I be finite. Choose a positive contraction e∈Ie\in I with ∥eae−a∥<ε/2\|eae-a\|<\varepsilon/2 for a∈Fa\in F, using an approximate identity of II. Choose a cpc factorization βα\beta\alpha on AA with error less than ε/2\varepsilon/2 on FF. Restrict α\alpha to II, and replace β(x)\beta(x) by eβ(x)ee\beta(x)e. The new reconstruction map has range in II, is cpc, and has total error less than ε\varepsilon.

For a corner, use the inclusion pAp→ApAp\to A and the cpc retraction a↦papa\mapsto pap in Proposition 5.2. □\square

Proposition 5.4. Suppose AA is the closure of an upward-directed family of C*-subalgebras AλA_\lambda, each having the completely positive approximation property. Then AA has the property.

Proof. Approximate a finite set F⊂AF\subset A by elements bab_a of a common AλA_\lambda. Choose cpc maps α0:Aλ→Mn\alpha_0:A_\lambda\to M_n, β0:Mn→Aλ\beta_0:M_n\to A_\lambda approximating all bab_a.

The map α0\alpha_0 extends to a cpc map α:A→Mn\alpha:A\to M_n. To see this when the algebras are nonunital, take a Stinespring dilation of α0\alpha_0 and extend its representation to the unitization. This gives a completely positive extension to Aλ+C1A_\lambda+\mathbb C1 with value at 11 at most 1n1_n. Apply Theorem 2.3 in the unitization of AA, and restrict back to AA. Its norm is at most one. If AλA_\lambda already contains the ambient unit, apply Theorem 2.3 directly.

Let β\beta be β0\beta_0 followed by inclusion in AA. Then

∥βα(a)−a∥≤2∥a−ba∥+∥β0α0(ba)−ba∥.\|\beta\alpha(a)-a\| \le 2\|a-b_a\|+\|\beta_0\alpha_0(b_a)-b_a\|.

Choose both errors small enough. □\square

6. Exercises with solutions

Exercise 1 (A finite algebra inside one matrix algebra; introductory). Embed M2⊕C⊕M3M_2\oplus\mathbb C\oplus M_3 in M6M_6. Give a cpc retraction and verify that it fixes the embedded algebra.

Solution. Use diagonal blocks of sizes 2,1,32,1,3, with projections p1,p2,p3p_1,p_2,p_3. The retraction is x↦(p1xp1,p2xp2,p3xp3)x\mapsto(p_1xp_1,p_2xp_2,p_3xp_3). 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 θi\theta_i and θ\theta are contractions on a Banach space and ∥θi(aj)−θ(aj)∥→0\|\theta_i(a_j)-\theta(a_j)\|\to0 on a dense subset. Prove convergence everywhere.

Solution. For any aa, select aja_j with ∥a−aj∥<δ\|a-a_j\|<\delta. Then ∥θi(a)−θ(a)∥≤2δ+∥θi(aj)−θ(aj)∥\|\theta_i(a)-\theta(a)\|\le2\delta+\|\theta_i(a_j)-\theta(a_j)\|. The limit superior is at most 2δ2\delta, and δ\delta is arbitrary.

Exercise 3 (A matrix test for positivity; intermediate). For β:Mn→D\beta:M_n\to D, prove that β\beta is completely positive if and only if Cβ=[β(Eij)]C_\beta=[\beta(E_{ij})] is positive in Mn(D)M_n(D).

Solution. The matrix [Eij]∈Mn(Mn)[E_{ij}]\in M_n(M_n) is positive: on Cn⊗Cn\mathbb C^n\otimes\mathbb C^n it is the rank-one operator ∣∑iei⊗ei⟩⟨∑iei⊗ei∣|\sum_ie_i\otimes e_i\rangle\langle\sum_ie_i\otimes e_i|. Complete positivity therefore makes CβC_\beta positive.

Conversely factor Cβ=R∗RC_\beta=R^*R, writing its entries as β(Eij)=∑krki∗rkj\beta(E_{ij})=\sum_k r_{ki}^*r_{kj}. For a positive block matrix X=[xpq]∈Mm(Mn)X=[x_{pq}]\in M_m(M_n), each matrix

[∑i,j(xpq)ijrki∗rkj]p,q\left[\sum_{i,j}(x_{pq})_{ij}r_{ki}^*r_{kj}\right]_{p,q}

is positive. Indeed it is obtained from the positive scalar matrix indexed by (p,i),(q,j)(p,i),(q,j) by multiplying on the left and right by the corresponding rectangular matrices with entries rkir_{ki}. Summing over kk gives [β(xpq)]≥0[\beta(x_{pq})]\ge0.

Exercise 4 (A model with no product rule; intermediate). On C([0,1])C([0,1]), let α(f)=(f(0),f(1))\alpha(f)=(f(0),f(1)) and β(a,b)(t)=(1−t)a+tb\beta(a,b)(t)=(1-t)a+tb. Show that α,β\alpha,\beta are ucp, that βα\beta\alpha fixes the function tt, and that it does not fix t2t^2.

Solution. Evaluation is a unital *-homomorphism. The two coefficients 1−t,t1-t,t are positive and sum to one, so β\beta is ucp by the pointwise matrix test. Both tt and t2t^2 have samples (0,1)(0,1), so their reconstructions are tt. At t=1/2t=1/2, the reconstructed square has value 1/21/2, while t2t^2 has value 1/41/4.

Exercise 5 (Why a net is needed; intermediate). Let II be uncountable and H=ℓ2(I)H=\ell^2(I). Prove that no sequence of finite-dimensional subspaces KnK_n makes PKnTPKn→TP_{K_n}TP_{K_n}\to T in norm for every T∈K(H)T\in\mathcal K(H).

Solution. The closed span KK of all KnK_n is separable. Every vector of ℓ2(I)\ell^2(I) has countable support, so a countable dense subset of KK has support in some countable J⊂IJ\subset I. Choose i∈I∖Ji\in I\setminus J. Then ei⊥Kne_i\perp K_n for every nn. For the rank-one projection TT onto Cei\mathbb Ce_i, all compressions vanish, and their distance from TT 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 F\mathcal F consist of cpc maps A→DA\to D factoring through matrix algebras. Prove that F\mathcal F is convex. Then show that if θ\theta lies in its pointwise weak closure, it lies in its pointwise norm closure.

Solution. For factorizations βjαj\beta_j\alpha_j and nonnegative tjt_j summing to one, define α(a)=⨁jαj(a)\alpha(a)=\bigoplus_j\alpha_j(a) and β((xj)j)=∑jtjβj(xj)\beta((x_j)_j)=\sum_jt_j\beta_j(x_j). Both are cpc: at every matrix level positivity is preserved, and the norm of the second is at most ∑jtj=1\sum_jt_j=1. Replace the direct sum by one matrix algebra using Section 1.

For a finite F={a1,…,ar}F=\{a_1,\ldots,a_r\}, evaluate F\mathcal F in the Banach space DrD^r, 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 (θ(a1),…,θ(ar))(\theta(a_1),\ldots,\theta(a_r)) 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 A,DA,D are unital, θ:A→D\theta:A\to D is ucp, and cpc factorizations approximate θ\theta in norm. Prove that the approximating maps can be taken ucp in both directions.

Solution. Start with α:A→Mn\alpha:A\to M_n, β:Mn→D\beta:M_n\to D, and put h=α(1)h=\alpha(1). Choose a state ω\omega on AA and define α1(a)=α(a)+ω(a)(1−h)\alpha_1(a)=\alpha(a)+\omega(a)(1-h). This is ucp. Let d=β(1)−β(h)d=\beta(1)-\beta(h). Then 0≤d≤1−β(h)0\le d\le1-\beta(h), so ∥d∥≤∥1−βα(1)∥\|d\|\le\|1-\beta\alpha(1)\|, and ∥βα1(a)−βα(a)∥≤∥a∥∥1−βα(1)∥\|\beta\alpha_1(a)-\beta\alpha(a)\|\le\|a\|\|1-\beta\alpha(1)\|.

Choose a state τ\tau on MnM_n, and set β1(x)=β(x)+τ(x)(1−β(1))\beta_1(x)=\beta(x)+\tau(x)(1-\beta(1)). This too is ucp. Since 0≤1−β(1)≤1−β(h)0\le1-\beta(1)\le1-\beta(h), the additional error on α1(a)\alpha_1(a) is at most ∥a∥∥1−βα(1)∥\|a\|\|1-\beta\alpha(1)\|. Consequently

∥β1α1(a)−θ(a)∥≤∥βα(a)−θ(a)∥+2∥a∥∥1−βα(1)∥.\|\beta_1\alpha_1(a)-\theta(a)\| \le\|\beta\alpha(a)-\theta(a)\|+2\|a\|\|1-\beta\alpha(1)\|.

Include 11 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 B(H)B(H) the restriction of a completely positive map?

Solution. No. Take S=CS=\mathbb C, H=CH=\mathbb C, and ϕ(z)=−z\phi(z)=-z. It has norm one, and all its matrix amplifications have norm one. But ϕ(1)=−1\phi(1)=-1 is not positive. Any extension still has that value at 11, 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.