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

Complete inputs for completely positive finite models

Finite matrix models have to work before a unit is available, on Hilbert spaces of arbitrary cardinality, and for operator systems that need not be closed. This component supplies those inputs for Completely positive finite models. It also proves the representation of an arbitrary commutative C*-algebra needed for the lesson's unnumbered nuclearity assertion.

The scalar boundary is the complete CF1–10 constructions: choice, Hahn–Banach, compact products, continuous C*-calculus, order, forced unitization and Hilbert/Banach completion. The complete MG01–06 arguments then construct scalar GNS representations, faithful representations, canonical matrix C*-norms, positive scalar functionals and complete contractivity of star homomorphisms. Matrix square roots are used only after that matrix construction. CP1–6 supplies the whole concrete coefficient predual. Inner products in the dilation arguments below are linear in their second variable.

FCP0. Approximate identities for every algebra and ideal

Let AA be any C*-algebra, and let JJ be a norm-closed two-sided ideal; J=AJ=A is allowed. For a finite F⊂JF\subset J and t>0t>0, form in the forced unitization

hF=∑x∈F(x∗x+xx∗),eF,t=hF(hF+t1)−1.h_F=\sum_{x\in F}(x^*x+xx^*),\qquad e_{F,t}=h_F(h_F+t1)^{-1}.

The summands belong to JJ by its two-sided ideal property. Continuous calculus, with a function vanishing at zero, gives eF,t∈Je_{F,t}\in J and 0≤eF,t≤10\le e_{F,t}\le1. Both x∗xx^*x and xx∗xx^* are at most hFh_F for x∈Fx\in F. Congruence by 1−eF,t=t(hF+t1)−11-e_{F,t}=t(h_F+t1)^{-1} and the C*-identity give

∥(1−eF,t)x∥2=∥(1−eF,t)xx∗(1−eF,t)∥≤∥t2hF(hF+t1)−2∥≤t/4,∥x(1−eF,t)∥2≤∥t2hF(hF+t1)−2∥≤t/4.\begin{aligned} \|(1-e_{F,t})x\|^2 &=\|(1-e_{F,t})xx^*(1-e_{F,t})\|\\ &\le\|t^2h_F(h_F+t1)^{-2}\|\le t/4,\\ \|x(1-e_{F,t})\|^2 &\le\|t^2h_F(h_F+t1)^{-2}\|\le t/4. \end{aligned}

The scalar bound follows from t2s/(s+t)2≤t/4t^2s/(s+t)^2\le t/4, s≥0s\ge0. Direct the pairs by enlarging FF and decreasing tt. Every later pair retains the bound for each previously selected xx, so these are positive contractive two-sided approximate identities. This construction uses nets for an arbitrary algebra; it makes no separability assumption. The empty finite set gives zero. The zero algebra and zero ideal are included.

This construction also proves self-adjointness if “ideal” initially means only a closed two-sided algebraic ideal. For x∈Jx\in J, eix∗=(xei)∗→x∗e_i x^*=(xe_i)^*\to x^*, and each eix∗∈Je_i x^*\in J. Hence J=J∗J=J^*.

For any representation π:A→B(K)\pi:A\to B(K), set K0=π(A)K‾K_0=\overline{\pi(A)K}. This space and its orthogonal complement reduce π\pi. If ξ⊥K0\xi\perp K_0, testing against π(a∗)η\pi(a^*)\eta proves π(a)ξ=0\pi(a)\xi=0. Moreover π(ei)π(a)η→π(a)η\pi(e_i)\pi(a)\eta\to\pi(a)\eta, and the common bound one extends convergence to all of K0K_0. Thus π(ei)→PK0\pi(e_i)\to P_{K_0} strongly. No nondegeneracy is silently imposed on a representation.

We will also use boundedness of an algebraically positive map. If a positive linear map T:A→DT:A\to D had unbounded norms on the positive unit ball, choose am≥0a_m\ge0, ∥am∥≤2−m\|a_m\|\le2^{-m}, with ∥T(am)∥≥m\|T(a_m)\|\ge m. The norm-convergent sum a=∑mama=\sum_m a_m satisfies a−am≥0a-a_m\ge0. Positivity and order monotonicity would force ∥T(a)∥≥m\|T(a)\|\ge m for every mm, which is impossible. Boundedness on the positive unit ball therefore holds. Decompose the real and imaginary parts of an arbitrary element into their positive and negative parts to obtain a finite bound on ∥T∥\|T\|. No continuity was used in moving through a sum: only the order relations a−am≥0a-a_m\ge0 were used.

Every finite-dimensional C*-algebra and its actual unit

Let F≠0F\ne0 be a finite-dimensional C*-algebra, possibly a subalgebra with a different unit from its ambient algebra. For a fixed vector-space basis, the coordinate map from Euclidean space has an upper norm bound by the sum of the basis norms. On the Euclidean unit sphere its image norm is continuous and positive, so compactness gives a positive lower bound. Thus both norms are equivalent and the closed unit ball of FF is compact. Its positive contractive approximate identity has a norm-convergent subnet. Its limit p∈Fp\in F satisfies pa=ap=apa=ap=a for all a∈Fa\in F. The positive cone is closed, and testing a=pa=p gives p2=pp^2=p; thus p=p∗p=p^* is its actual unit and is an ambient projection.

Every nonzero projection e∈Fe\in F contains a minimal projection. If eFe≠CeeFe\ne\mathbb Ce, split a nonscalar element into real and imaginary parts to obtain a nonscalar self-adjoint h∈eFeh\in eFe. Finite-dimensional linear dependence gives a nonzero polynomial PP with P(h)=0P(h)=0. If P(λ)≠0P(\lambda)\ne0, the identity P(t)−P(λ)=(t−λ)Q(t)P(t)-P(\lambda)=(t-\lambda)Q(t) makes h−λeh-\lambda e invertible in eFeeFe; hence σ(h)\sigma(h) is contained in the finite root set of PP. It has at least two points, since otherwise continuous calculus would make hh scalar. Interpolate the function equal to one at one spectral point and zero at the others. Continuous calculus produces a nonzero proper projection q<eq<e. Repeating this descent must terminate, since the dimensions of the corners strictly decrease, at a projection eie_i with eiFei=Ceie_iFe_i=\mathbb Ce_i.

Starting in pFppFp, then in the successive residual corners, gives finitely many orthogonal minimal projections e1,…,eNe_1,\ldots,e_N summing to pp. The process stops because nonzero orthogonal projections are linearly independent. If eiFej≠0e_iFe_j\ne0, choose a nonzero xx there. Then

x∗x=αej,xx∗=αei,α=∥x∥2>0.x^*x=\alpha e_j,\qquad xx^*=\alpha e_i,\qquad \alpha=\|x\|^2>0.

Thus v=x/αv=x/\sqrt\alpha is a partial isometry from eje_j to eie_i. Every y∈eiFejy\in e_iFe_j equals v(v∗y)v(v^*y), and v∗yv^*y is scalar on eje_j; this corner is one-dimensional. The relation eiFej≠0e_iFe_j\ne0 is an equivalence relation: adjoints give symmetry, and products of the displayed partial isometries give transitivity.

In one equivalence class choose a reference projection ere_r, partial isometries vi∈eiFerv_i\in e_iFe_r, and vr=erv_r=e_r. Then Eij=vivj∗E_{ij}=v_iv_j^* are full matrix units, and every corner in that class is their scalar span. Corners between distinct classes are zero. The identity a=∑i,jeiaeja=\sum_{i,j}e_i a e_j therefore gives an algebraic star isomorphism

F≅⨁ν=1kMnν.F\cong\bigoplus_{\nu=1}^k M_{n_\nu}.

MG04 constructs the matrix norms and MG06 makes this star isomorphism and its inverse isometric. This proves the entire finite-dimensional structure assertion used in the block retraction, Corollary 2.4 and Theorem 3.2. For F=0F=0, use zero maps through M1M_1; no nonzero unit is needed.

FCP1. The two complete tensor norms

The entire TN01–03 construction gives the Hilbert tensor completion, algebraic injectivity for a faithful pair, and the bound for every spatial pair. Its matrix-state approximation step uses the complete scalar and matrix constructions MG01–04. In particular,

∥(π⊙σ)(z)∥≤∥z∥min⁡\|(\pi\odot\sigma)(z)\| \le\|z\|_{\min}

for arbitrary coefficient representations, including degenerate and nonfaithful ones. A faithful pair defines the same norm at any Hilbert cardinality; it is a C*-norm and satisfies ∥a⊗b∥min⁡=∥a∥∥b∥\|a\otimes b\|_{\min}=\|a\|\|b\|. Its completion is the minimal tensor product. This result does not use a completely positive tensor contraction.

For the maximal norm, let A,BA,B be arbitrary, possibly zero or nonunital C*-algebras. A commuting pair π,σ\pi,\sigma on one Hilbert space defines

Rπ,σ(∑iai⊗bi)=∑iπ(ai)σ(bi).R_{\pi,\sigma}\left(\sum_i a_i\otimes b_i\right) =\sum_i\pi(a_i)\sigma(b_i).

The algebraic tensor relations make this well defined. Commutation, multiplication and the adjoint identities make it a star representation. MG06 gives

∥Rπ,σ(z)∥≤∑i∥ai∥∥bi∥.(FCP1a)\|R_{\pi,\sigma}(z)\| \le\sum_i\|a_i\|\|b_i\|. \tag{FCP1a}

The supremum of these norms can be taken over a set. Adjoin identities to the two coefficient actions by a+λ1↦π(a)+λIa+\lambda1\mapsto\pi(a)+\lambda I and similarly for BB. For a vector ξ\xi, the closed span of all π†(a)σ†(b)ξ\pi^\dagger(a)\sigma^\dagger(b)\xi reduces both actions. A dense set has cardinal at most κ=max⁡(ℵ0,∣A†∣,∣B†∣)\kappa=\max(\aleph_0,|A^\dagger|,|B^\dagger|): use finite rational complex linear combinations of the displayed vectors. A maximal orthonormal set, obtained by choice, has dense span, since a nonzero orthogonal complement would supply an additional unit vector. Its cardinal is at most κ\kappa: choose a distinct point of the dense set in the disjoint radius-1/31/3 balls around its unit vectors. Identifying these bases with subsets of one fixed set of size κ\kappa gives a set of Hilbert spaces and pairs. Testing Rπ,σ(z)R_{\pi,\sigma}(z) on individual unit vectors shows that these pairs attain the same supremum as all pairs.

Define ∥z∥max⁡\|z\|_{\max} by that supremum. Spatial coefficient actions commute, so

∥z∥min⁡≤∥z∥max⁡≤∑i∥ai∥∥bi∥.(FCP1b)\|z\|_{\min}\le\|z\|_{\max} \le\sum_i\|a_i\|\|b_i\|. \tag{FCP1b}

If either algebra is zero the algebraic tensor is zero and its completion is the zero algebra. Otherwise the faithful spatial pair makes this a norm. The triangle inequality, submultiplicativity and star invariance hold for every pair and hence for their supremum. Also

∥z∗z∥max⁡=sup⁡π,σ∥Rπ,σ(z)∗Rπ,σ(z)∥=∥z∥max⁡2.\|z^*z\|_{\max} =\sup_{\pi,\sigma}\|R_{\pi,\sigma}(z)^*R_{\pi,\sigma}(z)\| =\|z\|_{\max}^2.

The two elementary-tensor bounds give ∥a⊗b∥max⁡=∥a∥∥b∥\|a\otimes b\|_{\max}=\|a\|\|b\|. Complete the normed algebra. Products extend by the submultiplicative estimate, adjoints extend isometrically, and the C*-identity passes to limits, producing A⊗max⁡BA\otimes_{\max}B. Each commuting pair extends contractively to this completion. These facts are exactly the norm construction and finite projective error bound required in Lemmas 4.1–4.2 and Theorem 4.3 of the lesson.

FCP2. The full dilation, commuting action and embedded unitization

Let ψ:A→B(H)\psi:A\to B(H) be completely positive. FCP0 proves boundedness; put c=∥ψ∥c=\|\psi\|. On A⊙HA\odot H use

⟨∑iai⊗ξi,∑jbj⊗ηj⟩ψ=∑i,j⟨ξi,ψ(ai∗bj)ηj⟩.\left\langle\sum_i a_i\otimes\xi_i,\sum_j b_j\otimes\eta_j\right\rangle_\psi =\sum_{i,j}\langle\xi_i,\psi(a_i^*b_j)\eta_j\rangle.

The tensor relations preserve this form. The Gram matrix [ai∗aj][a_i^*a_j] is positive: for the rectangular row R=(a1,…,an)R=(a_1,\ldots,a_n), it is R∗RR^*R, equivalently the corresponding corner of a square Gram product. Complete positivity therefore makes the form positive. Positive-form Cauchy–Schwarz makes its null vectors a linear subspace orthogonal to all vectors. Quotient by that subspace and complete to LL.

Left multiplication by d∈Ad\in A has norm at most ∥d∥\|d\|. Its squared norm defect is the positive form of

[ai∗(∥d∥21−d∗d)aj].[a_i^*(\|d\|^2 1-d^*d)a_j].

The positive square root of the middle element is taken in A†A^\dagger; its products with the aja_j lie in the ideal AA. Thus the matrix is a Gram matrix over AA. Left multiplication descends and extends to ρ(d)∈B(L)\rho(d)\in B(L). Direct substitution gives the product and adjoint identities. This is a contractive star representation.

If AA is unital, set Vξ=[1⊗ξ]V\xi=[1\otimes\xi]. Then ρ(1)=IL\rho(1)=I_L,

V∗ρ(a)V=ψ(a),V∗V=ψ(1),∥V∥2=∥ψ(1)∥=∥ψ∥.V^*\rho(a)V=\psi(a),\qquad V^*V=\psi(1),\qquad \|V\|^2=\|\psi(1)\|=\|\psi\|.

The last equality follows either from the size-two block norm estimate in the lesson or from the compression formula and its reverse bound at the unit. Complete positivity of a unital map makes VV an isometry. For a cpc map VV is a contraction; no injectivity is required.

For nonunital AA, use the whole approximate identity in FCP0. The vectors [ei⊗ξ][e_i\otimes\xi] have norms at most c1/2∥ξ∥c^{1/2}\|\xi\|. Their pairing with every [a⊗η][a\otimes\eta] converges because eia→ae_i a\to a in norm. Uniform boundedness extends these pairings from the dense algebraic vectors to a bounded functional on all of LL. The Hilbert representation theorem supplies a unique weak-limit vector VξV\xi; it depends linearly on ξ\xi and ∥V∥≤c1/2\|V\|\le c^{1/2}. Further,

ρ(a)[ei⊗ξ]=[aei⊗ξ]⟶[a⊗ξ]\rho(a)[e_i\otimes\xi]=[ae_i\otimes\xi]\longrightarrow[a\otimes\xi]

in norm, since its squared error is at most c∥aei−a∥2∥ξ∥2c\|ae_i-a\|^2\|\xi\|^2. Weak limits give ρ(a)Vξ=[a⊗ξ]\rho(a)V\xi=[a\otimes\xi]. Pairing this with VηV\eta, using the limiting pairings just constructed, gives V∗ρ(a)V=ψ(a)V^*\rho(a)V=\psi(a). Hence ∥ψ∥≤∥V∥2\|\psi\|\le\|V\|^2, and together with the first bound this proves ∥V∥2=c\|V\|^2=c. When c=0c=0, the quotient and VV are zero. This includes H=0H=0.

Now suppose σ:B→B(H)\sigma:B\to B(H) is any star representation whose range commutes with ψ(A)\psi(A). On algebraic vectors define

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

For a finite vector, its squared norm is the quadratic form of P=[ψ(ai∗aj)]≥0P=[\psi(a_i^*a_j)]\ge0. This matrix commutes with D=diag⁡(σ(b),…,σ(b))D=\operatorname{diag}(\sigma(b),\ldots,\sigma(b)), and also with D∗D^*. Continuous calculus gives commutation with P1/2P^{1/2}, whence

D∗PD≤∥b∥2P.D^*PD\le\|b\|^2P.

Thus the operation preserves the nullspace and is bounded by ∥b∥\|b\|. The form itself gives σ^(b)∗=σ^(b∗)\widehat\sigma(b)^*=\widehat\sigma(b^*), and products and linear combinations agree on the dense algebraic vectors. It extends to a star representation commuting with ρ\rho. In the unital case the definition gives σ^(b)V=Vσ(b)\widehat\sigma(b)V=V\sigma(b). In the nonunital case it gives that identity on each ei⊗ξe_i\otimes\xi, and bounded operators preserve the weak limits defining VV. No faithfulness of σ\sigma, σ^\widehat\sigma, or VV enters any step.

For a cpc map ϕ:A→D\phi:A\to D, compose with a target representation and apply this construction. A commuting target pair gives

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

FCP1 bounds its norm by ∥∑iai⊗bi∥max⁡\|\sum_i a_i\otimes b_i\|_{\max}. Taking the supremum over all target pairs proves the maximal contraction in the entire Lemma 4.1. For the minimal contraction use faithful target representations on separate Hilbert spaces, tensor VV with the identity, and apply the entire TN03 spatial bound. Both contractions extend from algebraic tensors by completion. Neither argument requires a unit.

The same dilation gives the extension actually required for a nonunital subalgebra A0⊂AA_0\subset A in Proposition 5.4. Work in AA when it is unital, or in A†A^\dagger otherwise, and write 11 for that ambient identity and C=A0+C1C=A_0+\mathbb C1. The displayed quotient dilation is minimal: its dense vectors are ρ(a)Vξ=[a⊗ξ]\rho(a)V\xi=[a\otimes\xi]. In particular its representation is nondegenerate. If the ambient identity belongs to A0A_0, then ρ(1)=IL\rho(1)=I_L by FCP0; use the existing unital algebra. Otherwise each element of CC has a unique expression a+λ1a+\lambda1, and

ρC(a+λ1)=ρ(a)+λIL\rho_C(a+\lambda1)=\rho(a)+\lambda I_L

is an algebraic unital star homomorphism. MG06 makes it completely positive and contractive, without an assumed representation norm. The map ψC(x)=V∗ρC(x)V\psi_C(x)=V^*\rho_C(x)V is completely positive at every matrix size, since it is a matrix congruence. It extends ψ\psi and has value V∗V≤IHV^*V\le I_H at 11 when ψ\psi is cpc. The size-two norm estimate makes its norm at most one. A proper intrinsic unit pp of A0A_0 causes no ambiguity: ρ(p)=IL\rho(p)=I_L on the minimal space, so this representation kills 1−p1-p. The extension theorem applies to this actual embedded unital algebra and then restricts back to AA. Thus the unitization step covers every subalgebra case in the directed-union proof.

FCP3. Every commutative C*-algebra is a full C0(X)C_0(X)

We prove the whole representation needed for the lesson's commutative-algebra assertion. First let C≠0C\ne0 be unital and commutative. Its state space S(C)S(C) is compact Hausdorff for pointwise convergence: embed the dual unit ball in the product of the discs {∣z∣≤∥a∥}\{|z|\le\|a\|\}, impose the closed linearity equations, and then the closed equations and inequalities s(1)=1s(1)=1, s(a∗a)≥0s(a^*a)\ge0. MG01 supplies states and their norm bounds.

For every a∈Ca\in C, the compact set

Fa={s∈S(C):s(a∗a)=∥a∥2}F_a=\{s\in S(C):s(a^*a)=\|a\|^2\}

is nonempty by the norming state in MG01. It is a face: equality with the maximal possible value in a nontrivial convex combination forces equality in both summands. Among its nonempty compact faces, choose a minimal one by the axiom of choice in its Zorn form. Indeed, the intersection of a nested family of such faces is nonempty by compactness, compact, and a face; this is the chain condition for that choice.

If the minimal face contained two different states, evaluation at some self-adjoint element would distinguish them: split a distinguishing complex element into real and imaginary parts. This real continuous affine evaluation attains its maximum on the face. Its maximizing set is a nonempty compact proper face, a contradiction. Hence the minimal face is a singleton {s}\{s\}. Faces are transitive under inclusion, so ss is an extreme state of all S(C)S(C), with s(a∗a)=∥a∥2s(a^*a)=\|a\|^2. This proves the required pure-state existence without assuming a representation theorem or a general extreme-point theorem.

Every extreme state of commutative CC is multiplicative. To see this, take 0≤b≤10\le b\le1, put t=s(b)t=s(b), and consider the positive functionals

ℓ1(c)=s(bc),ℓ2(c)=s((1−b)c).\ell_1(c)=s(bc),\qquad \ell_2(c)=s((1-b)c).

They are positive because positive commuting products are positive, and their norms are tt and 1−t1-t by the scalar norm estimate. If 0<t<10<t<1, the identity s=t(ℓ1/t)+(1−t)(ℓ2/(1−t))s=t(\ell_1/t)+(1-t)(\ell_2/(1-t)) and extremality imply ℓ1/t=ℓ2/(1−t)=s\ell_1/t=\ell_2/(1-t)=s. If t=0t=0, the norm-zero functional ℓ1\ell_1 vanishes. If t=1t=1, ℓ2\ell_2 vanishes. Thus in every case

s(bc)=s(b)s(c).s(bc)=s(b)s(c).

Positive contractions linearly span CC, by scalar calculus and decomposition of real and imaginary parts. The identity therefore holds for all b,c∈Cb,c\in C. Since states are Hermitian and take value one at the identity, ss is a unital star homomorphism into C\mathbb C, called a character.

Let KK be the set of these characters. It is the closed subset of S(C)S(C) specified by s(bc)=s(b)s(c)s(bc)=s(b)s(c) for all b,cb,c. Thus KK is compact Hausdorff. For each aa, the preceding construction gives a character with

∣s(a)∣2=s(a∗a)=∥a∥2.|s(a)|^2=s(a^*a)=\|a\|^2.

Consequently the map

Γ:C→C(K),Γ(a)(s)=s(a)\Gamma:C\to C(K),\qquad \Gamma(a)(s)=s(a)

is an isometric unital star homomorphism. Its range is closed, contains constants, and separates points of KK.

Here is the entire surjectivity step. Let R=Γ(Csa)\mathcal R=\Gamma(C_{\rm sa}), a closed real linear space of real continuous functions. It contains the constants and separates points. It also contains ∣f∣|f| for every f∈Rf\in\mathcal R, by continuous calculus of a self-adjoint preimage; hence it contains the pointwise minima and maxima of every finite family.

Given g∈C(K,R)g\in C(K,\mathbb R) and ε>0\varepsilon>0, for any x,y∈Kx,y\in K there is fxy∈Rf_{xy}\in\mathcal R with fxy(x)=g(x)f_{xy}(x)=g(x) and fxy(y)=g(y)f_{xy}(y)=g(y). For distinct points rescale a separating real function and add a constant; for identical points use a constant. For fixed xx, the open sets fxy>g−εf_{xy}>g-\varepsilon, as yy varies, cover KK. Take a finite subcover and let fxf_x be the maximum of its functions. Then fx>g−εf_x>g-\varepsilon on KK, while fx(x)=g(x)f_x(x)=g(x). The open sets fx<g+εf_x<g+\varepsilon, as xx varies, also cover KK. Take a finite subcover and let ff be the minimum of its fxf_x's. At every point,

g−ε<f<g+ε.g-\varepsilon<f<g+\varepsilon.

Thus R\mathcal R is uniformly dense in the real continuous functions; closedness makes it all of them. Splitting real and imaginary parts proves Γ(C)=C(K)\Gamma(C)=C(K). The empty-space issue does not arise for this nonzero unital CC, whose state/character construction already made K≠∅K\ne\varnothing.

Now let AA be an arbitrary commutative C*-algebra, possibly nonunital or zero. Its forced unitization C=A†C=A^\dagger is nonzero, unital and commutative. Under the isomorphism just proved, the scalar quotient character s∞(a+λ1)=λs_\infty(a+\lambda1)=\lambda is a point of KK, and the ideal A=ker⁡s∞A=\ker s_\infty becomes exactly

{f∈C(K):f(s∞)=0}.\{f\in C(K):f(s_\infty)=0\}.

Set X=K∖{s∞}X=K\setminus\{s_\infty\}. This is locally compact Hausdorff. For completeness, in a compact Hausdorff space, if x∈Ox\in O is open, separate xx from each point of K∖OK\setminus O by disjoint open neighborhoods. A finite cover of K∖OK\setminus O makes their corresponding intersection a neighborhood UU of xx with compact closure contained in OO. Apply this with O⊂XO\subset X to obtain compact neighborhoods in XX.

Restriction identifies the displayed ideal with all of C0(X)C_0(X). A continuous function on KK vanishing at s∞s_\infty has compact nonzero level sets lying in XX. Conversely, for f∈C0(X)f\in C_0(X), extend it by zero at s∞s_\infty. Each ε\varepsilon-level set is compact in XX, hence closed in KK; its complement is a neighborhood of s∞s_\infty on which ∣f∣<ε|f|<\varepsilon. This proves continuity of the extension and the onto assertion. When A=0A=0, KK is the singleton s∞s_\infty, X=∅X=\varnothing, and C0(X)=0C_0(X)=0. When AA has its own unit pp, every character has s(p)∈{0,1}s(p)\in\{0,1\}; a character with s(p)=0s(p)=0 annihilates all of AA, so is s∞s_\infty. The open condition s(p)<1/2s(p)<1/2 therefore isolates s∞s_\infty. Thus XX is compact, giving the familiar C(X)C(X) case.

The all-LCH finite-list construction in Theorem 3.3 of the lesson therefore applies to every commutative C*-algebra, with no countability condition. Transfer its cpc maps through this star isomorphism using MG06, then apply the entire Theorem 4.3. This proves the original unnumbered nuclearity assertion at its full scope.

FCP4. Operator-system order, compactness and all matrix tests

Let S⊂CS\subset C be any operator system, without a closedness assumption, and let ϕ:S→D\phi:S\to D be completely positive. Represent DD faithfully by MG03–04. If ∥x∥≤1\|x\|\le1, the size-two matrix

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

is positive. The positive image block has diagonal entries ϕ(1)\phi(1). Positive-form Cauchy–Schwarz on a pair of Hilbert vectors gives ∥ϕ(x)∥≤∥ϕ(1)∥\|\phi(x)\|\le\|\phi(1)\|. The reverse bound at 11 proves ∥ϕ∥=∥ϕ(1)∥\|\phi\|=\|\phi(1)\|. Applying exactly the same argument to Mm(S)M_m(S) gives ∥ϕ(m)∥=∥ϕ(1)∥\|\phi^{(m)}\|=\|\phi(1)\| for every mm. This is also the norm control for the direct sum of finite-matrix coordinate maps, the block-diagonal retraction, and both repaired ucp maps in Exercise 7.

For a positive scalar functional ω\omega and a fixed d∈D+d\in D_+, the map x↦ω(x)dx\mapsto\omega(x)d is completely positive. MG05 makes S=[ω(xij)]S=[\omega(x_{ij})] a positive scalar matrix whenever [xij]≥0[x_{ij}]\ge0. In Mm(D†)M_m(D^\dagger), the matrices S⊗1S\otimes1 and diag⁡(d1/2,…,d1/2)\operatorname{diag}(d^{1/2},\ldots,d^{1/2}) give the congruence [ω(xij)d]≥0[\omega(x_{ij})d]\ge0, whose entries lie in DD. This proves the positivity of the added kernel term in Proposition 2.5 and both state terms in Exercise 7.

The scalar functional in Lemma 2.1 is taken on the entire matrix operator system Mn(S)M_n(S). Its quadratic-form calculation uses the canonical matrix norm and order in MG04; all scalar compressions preserve positive cones by congruence. Lemma 2.2's order-dominating Hahn–Banach construction is precisely the positive extension of MG01 and uses no closedness. Theorem 2.3 then extends each finite-dimensional compression and takes a pointwise ultraweak cluster map over all finite-dimensional subspaces of HH. Positivity at every matrix size is tested on every finite tuple of vectors, so no separability or finite-target restriction remains.

The compactness and limit assertions used here have full concrete proofs. The dual ball embeds into the product of the closed scalar discs, with closed linearity equations. CF compactness and the whole coefficient predual CP1–6 make the bounded balls of B(H)B(H) ultraweakly compact. A concrete von Neumann algebra M⊂B(H)M\subset B(H) is weak-operator closed and therefore ultraweakly closed, so its bounded balls and products of these balls are compact as well. For a uniformly bounded strongly convergent net, each vector coefficient converges. In any square-summable coefficient series, Cauchy–Schwarz bounds the tail uniformly by the common operator bound times the two square-sum tails. Split into a finite part and its tail to prove ultraweak convergence. This justifies every compression limit and support-cutoff limit in Theorem 2.3 and Proposition 2.5.

Multiplication on either side by a fixed operator is ultraweakly continuous by transforming the coefficient vectors and keeping their square sums finite. Strong convergence of uniformly bounded nets is preserved by products: expand (xiyi−xy)ξ=xi(yi−y)ξ+(xi−x)yξ(x_i y_i-xy)\xi=x_i(y_i-y)\xi+(x_i-x)y\xi.

These facts justify the whole identity b1/2ψ0(x)b1/2=ϕ(x)b^{1/2}\psi_0(x)b^{1/2}=\phi(x) in Proposition 2.5, even when bb has nonclosed range or kernel. The constructed support projection belongs to MM; no spectral probability measure or invertibility of bb is assumed.

Finally, MG04 and scalar continuous calculus give every positive matrix over DD a square root in that matrix algebra. Rectangular congruences are positive by embedding in a square matrix with zero unused rows and columns. This supplies both directions of the full Choi-matrix calculation in Exercise 3 at every output matrix size.

The function space C0(X)C_0(X) is itself a complete C*-algebra. A uniformly Cauchy net has a uniform continuous limit ff. For each ε>0\varepsilon>0, a sufficiently close member fif_i makes {∣f∣≥ε}\{|f|\ge\varepsilon\} a closed subset of the compact set {∣fi∣≥ε/2}\{|f_i|\ge\varepsilon/2\}, so ff vanishes at infinity. Sums, products and conjugates stay in this space, and the supremum norm gives ∥f‾f∥=∥f∥2\|\overline f f\|=\|f\|^2. Pointwise nonnegative functions have their pointwise square roots in C0(X)C_0(X), while squares are pointwise nonnegative.

For C0(X)C_0(X), the direct sum of the evaluation representations over all x∈Xx\in X is faithful: a function whose values all vanish is zero. Its amplified representation is the direct sum of all pointwise scalar matrices. MG03–04 reflect order through this faithful representation. Thus pointwise matrix positivity is equivalent to positivity in Mm(C0(X))M_m(C_0(X)), proving the exact complete-positivity tests for the weights in Theorem 3.3 and Exercise 4. For the interval tent model, only adjacent sample weights are nonzero at a point; their sum is one and each sample distance is at most the mesh width hh. A function with Lipschitz constant at most LL therefore has interpolation error at most LhLh, as stated in the original example.

The compact-operator and uncountable-Hilbert examples also have their full elementary inputs. If TT sends the unit ball of an arbitrary Hilbert space into a relatively compact set, take a finite ε\varepsilon-net of that set and let KK be its finite-dimensional span. Orthogonal projection gives ∥T−PKT∥≤ε\|T-P_KT\|\le\varepsilon, so TT is a norm limit of finite-rank operators. Conversely, a norm limit of finite-rank operators has a totally bounded unit-ball image: at any tolerance approximate it by a finite-rank image and use a finite net in that finite-dimensional ball. Its closure is complete and totally bounded. Successive finite nets select a Cauchy subsequence of every sequence, which has a limit by completeness. To prove compactness for open covers, if no uniform radius has all its balls contained in cover members, choose xnx_n whose radius-1/n1/n ball is not so contained. A convergent subsequence tends to a point in an open cover member, which contains a fixed ball about that limit; eventually it contains the entire radius-1/n1/n ball about xnx_n, a contradiction. A uniform radius therefore exists, and a finite net gives a finite subcover. Thus both definitions of compact operator agree at every Hilbert cardinality. A finite-rank operator SS and its adjoint have finite-dimensional ranges; putting both ranges in one finite K′K' gives PK′SPK′=SP_{K'}SP_{K'}=S. Contractivity then gives ∥T−PK′TPK′∥≤2∥T−S∥\|T-P_{K'}TP_{K'}\|\le2\|T-S\|, proving the entire directed compression example.

For ξ∈ℓ2(I)\xi\in\ell^2(I), every set {i:∣ξi∣≥1/m}\{i:|\xi_i|\ge1/m\} is finite: arbitrarily large finite subsets would make the sum of squares unbounded. Their countable union contains the entire nonzero support. A countable dense family in the closed span of the finite-dimensional KnK_n's therefore has support in one countable J⊂IJ\subset I, and continuity of each coordinate puts the entire closed span in ℓ2(J)\ell^2(J). If II is uncountable, a coordinate outside JJ supplies the norm-one rank-one projection whose every compression vanishes. This proves the whole obstruction in Exercise 5.

The convexity step in Exercise 6 also has a complete separation proof. In a real normed space EE, let VV be a nonempty convex set, and let yy lie outside its norm closure. Put δ=dist⁡(y,V)>0\delta=\operatorname{dist}(y,V)>0, choose v0∈Vv_0\in V, and set U=V+B(0,δ/2)−v0U=V+B(0,\delta/2)-v_0. This is open, convex, contains zero, and excludes y−v0y-v_0. Its gauge

p(x)=inf⁡{t>0:x∈tU}p(x)=\inf\{t>0:x\in tU\}

is finite, nonnegative, sublinear, and bounded above by ∥x∥/η\|x\|/\eta for a ball B(0,η)⊂UB(0,\eta)\subset U. Convexity proves subadditivity by rescaling two points into UU; rescaling proves positive homogeneity. Openness gives U={p<1}U=\{p<1\}: for x∈Ux\in U slightly enlarge xx and then rescale, and for p(x)<1p(x)<1 use convexity with zero. Hence p(y−v0)≥1p(y-v_0)\ge1. On the real line through y−v0y-v_0, prescribe ℓ(t(y−v0))=t p(y−v0)\ell(t(y-v_0))=t\,p(y-v_0). For t≥0t\ge0 this equals the gauge, and for t<0t<0 it is at most the nonnegative gauge. Hahn–Banach extends ℓ≤p\ell\le p to EE. The two bounds on ℓ(x)\ell(x) and −ℓ(x)-\ell(x) make it continuous. For v∈Vv\in V, testing every u∈B(0,δ/2)u\in B(0,\delta/2) in v+u−v0∈Uv+u-v_0\in U gives

ℓ(v−v0)+(δ/2)∥ℓ∥≤1≤ℓ(y−v0).\ell(v-v_0)+(\delta/2)\|\ell\|\le1 \le\ell(y-v_0).

Since ℓ≠0\ell\ne0, this strictly separates yy from VV, so yy is also outside the weak closure. Norm closure is contained in weak closure by continuity, proving equality of both closures for a convex set. In a complex space the functional L(x)=ℓ(x)−iℓ(ix)L(x)=\ell(x)-i\ell(ix) is complex linear and continuous with Re⁡L=ℓ\operatorname{Re}L=\ell, giving the same separation in the complex weak topology.

For E=DrE=D^r with its maximum norm, every continuous linear functional is the sum of its rr coordinate functionals: apply it to the sum of the coordinate inclusions. Thus pointwise weak closure of the maps in Exercise 6 puts the evaluated tuple in the weak closure of their convex image in DrD^r. The separation just proved puts it in the norm closure, at every finite list and tolerance. The image is nonempty because the zero map factors through M1M_1; an empty test list is automatic. This completes the whole weak-to-norm approximation argument.

FCP5. The whole lesson and every solved exercise

The finite-set definitions are used throughout, including nonseparable algebras. Zero maps treat the zero algebra and the empty/all-zero finite function lists. The following routes include complete statements, proofs and solutions.

Original assertion Complete inputs
Propositions 1.1–1.2 Directed finite sets/tolerances, finite upper bounds, and the exact 2∣a−aj∣2|a-a_j| contraction estimate.
Lemmas 2.1–2.2 MG01–04 and FCP4: all matrix-functional quadratic forms and the full scalar order extension.
Theorem 2.3, Corollary 2.4 The full arbitrary-Hilbert compression proof, CP1–6, finite-coordinate compactness, all matrix levels and the actual pAppAp coordinate retractions.
Proposition 2.5 FCP4, scalar calculus and state existence: entire support construction, both cutoff limits, arbitrary von Neumann target, kernel, b=0b=0, cluster map and the full ucp completion.
Example 3.1, Theorem 3.2 Entire finite-rank/compact approximation on arbitrary HH, complete finite-dimensional retraction, all directed finite algebra families and the two reconstruction errors.
Theorem 3.3 and its tent example The original whole finite-list w0,wj,W,gjw_0,w_j,W,g_j construction on every LCH XX, FCP4's pointwise matrix order, and the exact LhLh error.
Lemmas 4.1–4.2 Whole TN01–03 and FCP1–2; the original complete matrix-unit decomposition with its zero-action space, arbitrary second representation and every direct summand.
Theorem 4.3 and all three nuclearity examples FCP1's entire finite projective error bound, both full tensor contractions, finite-matrix min=max, and FCP3's full commutative representation.
Propositions 5.1–5.4 Full cpc compositions/retractions, FCP0's entire ideal approximate identity, actual corners, and FCP2's exact embedded unitization in every directed-union case.
Exercises 1–2 The whole 2,1,32,1,3 block retraction and the Banach/net contraction error argument.
Exercise 3 Every matrix square root and rectangular congruence in FCP4, both implications, and all output matrix sizes.
Exercise 4 Both complete pointwise-positive maps, their unit values, the two reconstructed functions and the exact 1/21/2 versus 1/41/4 comparison.
Exercise 5 Full countable-support argument in uncountable ℓ2(I)\ell^2(I), the common separable span, an omitted coordinate, norm-one rank-one obstruction, and the directed family that does work.
Exercise 6 The entire convex combination through a finite direct sum, its matrix realization, and Hahn–Banach separation in every finite product DrD^r.
Exercise 7 Scalar state positivity at every matrix level by MG05; both ucp repair maps and the exact 2∣a∣∣1−βα(1)∣2|a||1-\beta\alpha(1)| additional error, with 11 included in the finite set.
Exercise 8 The whole bounded map z↦−zz\mapsto-z, its norm-one amplifications and failure of positivity at the unit.

Human comparison and terms

Arveson's publisher-open Subalgebras of C*-algebras, Acta Mathematica 123 (1969), 141–224, provides the complete unital Stinespring comparison in Theorem 1.1.1, pp.145–146; extension in Theorem 1.2.3 with Lemmas 1.2.4–1.2.6, pp.149–152; the all-matrix norm estimate in Proposition 1.2.10, pp.153–154; and the whole commuting-action comparison in Theorem 1.3.1, pp.154–156. The source extension has a closed-system hypothesis and uses general BW compactness and Krein–Smulyan. The lesson's matrix-functional proof and the exact local coefficient/compactness constructions supply its broader nonclosed-system case. FCP2 supplies the entire nonunital and proper-unit cases.

Only the extra isomorphism clause in the source commuting-action theorem assumes an injective dilation operator. The tensor contraction here does not make that assumption and does not consume the source's referred-out normality assertion. The finite models, the full commutative representation, the CPAP-to-nuclearity direction, permanence and whole solved exercises are proved at their stated local scopes.

This component is an original course exposition by GPT-6.1 Sol (OpenAI), Ultra, released under CC0-1.0. Human sources retain their own terms. Free access grants no additional licence for their expression.