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

Completely bounded extension and factorization

Written by GPT-6.1 Sol (OpenAI), Ultra, September 2026. Self-checked by the writing AI. New original text: public domain (CC0).

Complete positivity requires a map to preserve every matrix positive cone. Complete boundedness asks a different question: how much can the map enlarge a matrix norm? A completely bounded map can reverse the sign of a positive element. Its extension theorem must therefore control matrix norms without imposing positivity on the extension.

The connection between the two notions comes from a two-by-two block. We place the map in an off-diagonal corner and use scalar diagonal corners to turn a norm estimate into positivity. Arveson's theorem extends the resulting positive map, and Stinespring's theorem recovers the original map as a coefficient of a representation.

Prerequisites are Completely positive finite models, including Arveson's extension theorem, and Completely positive maps, including Stinespring dilation and the multiplicative domain. We also use the elementary decomposition of a representation of a matrix algebra. The free extension and block-method sources are identified in the references below. No separability hypothesis occurs in this lesson.

1. Matrix norms on a subspace

Let VV be a linear subspace of a C*-algebra AA. The norm on Mn(V)M_n(V) is its norm as a subspace of Mn(A)M_n(A). For θ:V→B(H)\theta:V\to B(H), write

θ(n)([vij])=[θ(vij)],∥θ∥cb=sup⁡n≥1∥θ(n)∥.\theta^{(n)}([v_{ij}])=[\theta(v_{ij})],\qquad \|\theta\|_{\rm cb}=\sup_{n\ge1}\|\theta^{(n)}\|.

The map is completely bounded if this supremum is finite, and a complete contraction if it is at most one. A complete isometry preserves the norm at every matrix size.

The map z↦−zz\mapsto-z on C\mathbb C has completely bounded norm one. It is not positive, since its value at 11 is −1-1. Thus a completely bounded extension theorem cannot promise a completely positive extension for an arbitrary original map.

We will repeatedly use the following block criterion.

Lemma 1.1. For an operator X:L→KX:L\to K,

(1KXX∗1L)≥0⟺∥X∥≤1.\begin{pmatrix}1_K&X\\X^*&1_L\end{pmatrix}\ge0 \quad\Longleftrightarrow\quad \|X\|\le1.

More generally, if P,QP,Q are positive invertible operators, then

(PXX∗Q)≥0⟺∥P−1/2XQ−1/2∥≤1.\begin{pmatrix}P&X\\X^*&Q\end{pmatrix}\ge0 \quad\Longleftrightarrow\quad \|P^{-1/2}XQ^{-1/2}\|\le1.

Proof. In the first assertion, the quadratic form on (ξ,η)(\xi,\eta) is ∥ξ∥2+2Re⁡⟨ξ,Xη⟩+∥η∥2\|\xi\|^2+2\operatorname{Re}\langle\xi,X\eta\rangle+\|\eta\|^2. Minimizing over ξ\xi, with η\eta fixed, gives ∥η∥2−∥Xη∥2\|\eta\|^2-\|X\eta\|^2. It is nonnegative for every η\eta exactly when ∥X∥≤1\|X\|\le1. Conjugation by diag⁡(P−1/2,Q−1/2)\operatorname{diag}(P^{-1/2},Q^{-1/2}) gives the second assertion. □\square

Inner products here and below are linear in the second variable.

2. The scalar-diagonal operator system

Assume temporarily that AA is unital. Define

S(V)={(λ1Avw∗μ1A):λ,μ∈C, v,w∈V}⊂M2(A).\mathcal S(V)= \left\{ \begin{pmatrix}\lambda1_A&v\\w^*&\mu1_A\end{pmatrix}: \lambda,\mu\in\mathbb C,\ v,w\in V \right\}\subset M_2(A).

It is an operator system: it is linear, closed under adjoints, and contains the identity of M2(A)M_2(A). Closure of VV is unnecessary. For a linear map θ:V→B(H)\theta:V\to B(H), set

Φθ(λ1Avw∗μ1A)=(λ1Hθ(v)θ(w)∗μ1H).\Phi_\theta\begin{pmatrix}\lambda1_A&v\\w^*&\mu1_A\end{pmatrix} =\begin{pmatrix}\lambda1_H&\theta(v)\\\theta(w)^*&\mu1_H\end{pmatrix}.

Theorem 2.1 (The two-by-two device). The map θ\theta is a complete contraction if and only if Φθ\Phi_\theta is completely positive. In that case Φθ\Phi_\theta is unital.

Proof. At matrix size nn, rearrange the matrix coordinates so that the two diagonal corners are grouped together. A positive element of Mn(S(V))M_n(\mathcal S(V)) then has the form

Z=(Λ⊗1AXX∗M⊗1A),Λ,M∈Mn(C)+,X∈Mn(V).Z=\begin{pmatrix}\Lambda\otimes1_A&X\\X^*&\mathsf M\otimes1_A\end{pmatrix}, \qquad \Lambda,\mathsf M\in M_n(\mathbb C)_+,\quad X\in M_n(V).

Add ε\varepsilon times the identity to both diagonal blocks. Lemma 1.1 gives

∥(Λ+ε1n)−1/2X(M+ε1n)−1/2∥≤1.\| (\Lambda+\varepsilon1_n)^{-1/2} X(\mathsf M+\varepsilon1_n)^{-1/2}\|\le1.

Multiplication by scalar matrices preserves Mn(V)M_n(V), and amplification of θ\theta commutes with this multiplication. If θ\theta is a complete contraction, the same inequality holds after applying θ(n)\theta^{(n)}. The block criterion makes the image of the regularized ZZ positive. Let ε↓0\varepsilon\downarrow0; the positive cone is norm closed, so Φθ(n)(Z)≥0\Phi_\theta^{(n)}(Z)\ge0. This proves complete positivity at every size.

Conversely, if X∈Mn(V)X\in M_n(V) has norm at most one, Lemma 1.1 makes (1XX∗1)\begin{pmatrix}1&X\\X^*&1\end{pmatrix} positive. Complete positivity of Φθ\Phi_\theta, followed by the same criterion, gives ∥θ(n)(X)∥≤1\|\theta^{(n)}(X)\|\le1. Hence θ\theta is a complete contraction. The formula for Φθ\Phi_\theta gives its unitality. □\square

The scalar diagonals are essential. Complete contractivity alone does not permit keeping arbitrary diagonal products unchanged while replacing the off-diagonal entries by θ\theta. Exercise 3 gives a concrete failure.

3. Recover the off-diagonal coefficient

Lemma 3.1. Let AA be unital and let Ψ:M2(A)→B(H⊕H)\Psi:M_2(A)\to B(H\oplus H) be ucp. Suppose

Ψ(E11⊗1A)=(1H000),Ψ(E22⊗1A)=(0001H).\Psi(E_{11}\otimes1_A)=\begin{pmatrix}1_H&0\\0&0\end{pmatrix},\qquad \Psi(E_{22}\otimes1_A)=\begin{pmatrix}0&0\\0&1_H\end{pmatrix}.

There are a unital representation π:A→B(K)\pi:A\to B(K) and isometries V1,V2:H→KV_1,V_2:H\to K such that the upper-right corner of Ψ(E12⊗a)\Psi(E_{12}\otimes a) is V1∗π(a)V2V_1^*\pi(a)V_2.

Proof. Take a unital Stinespring dilation Ψ(X)=W∗Π(X)W\Psi(X)=W^*\Pi(X)W, where W:H⊕H→LW:H\oplus H\to L is an isometry. Put pi=Eii⊗1Ap_i=E_{ii}\otimes1_A, and let PiP_i be the corresponding projection on H⊕HH\oplus H. A projection mapped to a projection belongs to the multiplicative domain. More directly,

∥(Π(pi)W−WPi)η∥2=0\|(\Pi(p_i)W-WP_i)\eta\|^2=0

follows by expanding the square and using W∗Π(pi)W=PiW^*\Pi(p_i)W=P_i. Therefore Π(pi)W=WPi\Pi(p_i)W=WP_i.

The matrix units of Π(M2⊗1A)\Pi(M_2\otimes1_A) identify LL with K⊕KK\oplus K, so that

Π([aij])=[π(aij)]\Pi([a_{ij}])=[\pi(a_{ij})]

for a unital representation π\pi of AA. The intertwining identities make WW diagonal in this decomposition, with diagonal entries V1,V2V_1,V_2. Because WW is an isometry, both entries are isometries. Compressing Π(E12⊗a)\Pi(E_{12}\otimes a) by WW now gives the asserted formula. □\square

4. Extension with the same completely bounded norm

Theorem 4.1 (Completely bounded extension and factorization). Let V⊂AV\subset A be a linear subspace of a C*-algebra and let θ:V→B(H)\theta:V\to B(H) be completely bounded. There are a representation π:A→B(K)\pi:A\to B(K) and operators S,T:H→KS,T:H\to K such that

θ(v)=S∗π(v)T(v∈V),∥S∥∥T∥=∥θ∥cb.\theta(v)=S^*\pi(v)T\quad(v\in V),\qquad \|S\|\|T\|=\|\theta\|_{\rm cb}.

Consequently,

θ~(a)=S∗π(a)T(a∈A)\widetilde\theta(a)=S^*\pi(a)T\quad(a\in A)

extends θ\theta and satisfies ∥θ~∥cb=∥θ∥cb\|\widetilde\theta\|_{\rm cb}=\|\theta\|_{\rm cb}. If θ≠0\theta\ne0, one may choose ∥S∥=∥T∥=∥θ∥cb1/2\|S\|=\|T\|=\|\theta\|_{\rm cb}^{1/2}.

Proof. The zero map has a zero extension and zero factorization. Otherwise put c=∥θ∥cb>0c=\|\theta\|_{\rm cb}>0 and θ0=θ/c\theta_0=\theta/c.

First suppose AA is unital. Theorem 2.1 makes Φθ0\Phi_{\theta_0} ucp on S(V)\mathcal S(V). Arveson's extension theorem gives a ucp map Ψ:M2(A)→B(H⊕H)\Psi:M_2(A)\to B(H\oplus H) extending it. The two diagonal matrix units already belong to S(V)\mathcal S(V), so their values meet Lemma 3.1. That lemma gives

θ0(v)=V1∗π(v)V2.\theta_0(v)=V_1^*\pi(v)V_2.

Set S=c1/2V1S=c^{1/2}V_1 and T=c1/2V2T=c^{1/2}V_2. Then the required factorization holds and both norms are c1/2c^{1/2}.

At every matrix size,

∥[S∗π(aij)T]∥≤∥S∥ ∥[aij]∥ ∥T∥.\|[S^*\pi(a_{ij})T]\| \le\|S\|\,\|[a_{ij}]\|\,\|T\|.

Thus the extension has completely bounded norm at most cc. Restriction to VV gives the reverse inequality, hence equality.

For nonunital AA, embed it in the algebra A†A^\dagger obtained by adjoining a unit. Matrix norms on VV are unchanged. Apply the unital argument there and restrict the representation and extension to AA. The representation on AA may be degenerate, which is allowed. Its coefficient formula still gives the same upper bound, and restriction to VV still gives equality. No countability or closure of VV was used. □\square

The two operators generally differ. Requiring S=TS=T would make the coefficient map completely positive, which is impossible for v↦−vv\mapsto-v on a subspace containing the unit.

Corollary 4.2 (A positive block completion). A completely bounded map θ:A→B(H)\theta:A\to B(H), of norm cc, has completely positive maps ϕ1,ϕ2:A→B(H)\phi_1,\phi_2:A\to B(H), each of norm at most cc, such that

a⟼(ϕ1(a)θ(a)θ(a∗)∗ϕ2(a))a\longmapsto \begin{pmatrix} \phi_1(a)&\theta(a)\\ \theta(a^*)^*&\phi_2(a) \end{pmatrix}

is completely positive.

Proof. Use the balanced factorization in Theorem 4.1 and put ϕ1(a)=S∗π(a)S\phi_1(a)=S^*\pi(a)S, ϕ2(a)=T∗π(a)T\phi_2(a)=T^*\pi(a)T. The displayed map is compression of π(a)\pi(a) by the row operator (S T):H⊕H→K(S\ T):H\oplus H\to K. Hence it is completely positive, and the separate norms are bounded by ∥S∥2=∥T∥2=c\|S\|^2=\|T\|^2=c. For c=0c=0 use zero maps. □\square

This completion adjusts the diagonal entries. It does not claim that arbitrary diagonal expressions from AA can be copied into the target algebra.

Corollary 4.3 (Self-adjoint maps). If θ:A→B(H)\theta:A\to B(H) is completely bounded and satisfies θ(a∗)=θ(a)∗\theta(a^*)=\theta(a)^*, then it is a difference of two completely positive maps.

Proof. Take θ(a)=S∗π(a)T\theta(a)=S^*\pi(a)T. Set

ψ±(a)=14(S±T)∗π(a)(S±T).\psi_\pm(a)=\tfrac14(S\pm T)^*\pi(a)(S\pm T).

Both maps are completely positive. Their difference is 12(S∗π(a)T+T∗π(a)S)\tfrac12(S^*\pi(a)T+T^*\pi(a)S). The second term is θ(a∗)∗\theta(a^*)^*, so self-adjointness makes the difference θ(a)\theta(a). □\square

5. Surjective two-isometries are rigid

A linear isometry of C*-algebras can preserve the scalar norm while reversing multiplication. Preserving the norm at matrix size two rules out that possibility when the map is surjective.

Lemma 5.1. A linear functional ff on a unital C*-algebra with ∥f∥=f(1)=1\|f\|=f(1)=1 is positive. Consequently a unital contractive map between unital C*-algebras is positive.

Proof. For self-adjoint hh and real tt,

∣1+itf(h)∣2≤∥1+ith∥2≤1+t2∥h∥2.|1+itf(h)|^2\le\|1+ith\|^2\le1+t^2\|h\|^2.

The linear term in tt forces Im⁡f(h)=0\operatorname{Im}f(h)=0. For 0≤h≤10\le h\le1, we then have ∣1−f(h)∣=∣f(1−h)∣≤1|1-f(h)|=|f(1-h)|\le1, so f(h)≥0f(h)\ge0. Rescaling proves positivity on every positive element.

For a unital contraction ρ\rho, compose with any state of the target. The resulting functional has norm at most one and value one at the unit, so is a state by the first assertion. States detect positivity in a C*-algebra, hence ρ\rho is positive. □\square

Theorem 5.2. Let θ:A→B\theta:A\to B be a surjective linear isometry of C*-algebras, and suppose θ(2)\theta^{(2)} is also an isometry. There are a unitary u∈M(B)u\in M(B) and a surjective *-isomorphism π:A→B\pi:A\to B such that

θ(a)=uπ(a)(a∈A).\theta(a)=u\pi(a)\quad(a\in A).

In particular θ\theta is a complete isometry.

Proof. Pass to the bidual map T=θ∗∗:A∗∗→B∗∗T=\theta^{**}:A^{**}\to B^{**}. A surjective linear isometry has a surjective isometric bidual map. We use the canonical identifications M2(A)∗∗=M2(A∗∗)M_2(A)^{**}=M_2(A^{**}) and M2(B)∗∗=M2(B∗∗)M_2(B)^{**}=M_2(B^{**}), from the enveloping von Neumann algebra construction. They show that T(2)T^{(2)} is an isometry as well. Both bidual algebras are unital.

Put u=T(1)u=T(1), so ∥u∥=1\|u\|=1. For every x∈A∗∗x\in A^{**}, the squared norm of the row (1 x)(1\ x), placed in a two-by-two matrix with second row zero, is 1+∥x∥21+\|x\|^2. Its image has squared norm ∥uu∗+T(x)T(x)∗∥\|uu^*+T(x)T(x)^*\|. Surjectivity therefore gives

∥uu∗+bb∗∥=1+∥b∥2(b∈B∗∗).\|uu^*+bb^*\|=1+\|b\|^2\quad(b\in B^{**}).

Since 0≤uu∗≤10\le uu^*\le1, choose b=(1−uu∗)1/2b=(1-uu^*)^{1/2}. The left side is one, forcing 1−uu∗=01-uu^*=0. Apply the same argument to the column (1 x)T(1\ x)^{\mathsf T} and choose b=(1−u∗u)1/2b=(1-u^*u)^{1/2}. It gives u∗u=1u^*u=1. Thus uu is unitary in B∗∗B^{**}.

The map P=u∗TP=u^*T is a unital surjective two-isometry, and its inverse has the same properties. Lemma 5.1, at matrix sizes one and two, makes PP and P−1P^{-1} 2-positive. Here the Schwarz estimate uses only 2-positivity: the matrix

(x∗xx∗x1)=(x∗1)(x1)\begin{pmatrix}x^*x&x^*\\x&1\end{pmatrix} =\begin{pmatrix}x^*\\1\end{pmatrix}\begin{pmatrix}x&1\end{pmatrix}

is positive. Applying P(2)P^{(2)} keeps it positive. Since PP preserves adjoints and the unit, testing the resulting quadratic form on (ξ,−P(x)ξ)(\xi,-P(x)\xi) gives

P(x∗x)≥P(x)∗P(x).P(x^*x)\ge P(x)^*P(x).

Apply P−1P^{-1} to this inequality and then use its Schwarz inequality on P(x)P(x). The two inequalities sandwich x∗xx^*x between identical endpoints. Applying PP back gives equality:

P(x∗x)=P(x)∗P(x)(x∈A∗∗).P(x^*x)=P(x)^*P(x)\quad(x\in A^{**}).

Polarization yields P(x∗y)=P(x)∗P(y)P(x^*y)=P(x)^*P(y). A positive linear map preserves adjoints, so replacing xx by x∗x^* proves multiplicativity. Hence PP is a *-isomorphism of the biduals.

It remains to locate the original algebras and the multiplier. Let C=P(A)⊂B∗∗C=P(A)\subset B^{**}, a closed C*-subalgebra. Since θ\theta is onto, B=uCB=uC. It follows that

span⁡‾(B∗B)=span⁡‾(C∗C)=C.\overline{\operatorname{span}}(B^*B) =\overline{\operatorname{span}}(C^*C)=C.

The left side is BB, because a C*-algebra is the closed linear span of its products. Thus C=BC=B. In particular uB=BuB=B, and multiplying this equality by u∗u^* gives u∗B=Bu^*B=B. Taking adjoints gives Bu=BBu=B and Bu∗=BBu^*=B. These two-sided multiplier conditions place uu and u∗u^* in M(B)M(B); they remain mutual inverses there. Restricting PP gives the claimed π:A→B\pi:A\to B.

A *-isomorphism is isometric at every matrix size, as is multiplication by the diagonal unitary with entries uu. Hence θ\theta is a complete isometry. □\square

For the zero algebras the assertion is interpreted in their zero multiplier algebra and is vacuous. The proof for nonzero algebras uses no unit in AA or BB themselves.

6. A matrix norm detects transposition

Transposition on MnM_n is an isometry at scalar size. Its second amplification can already enlarge norms.

Example 6.1. Let t:M2→M2t:M_2\to M_2 be transposition and set

F=∑i,j=12Eij⊗Eji∈M2(M2).F=\sum_{i,j=1}^2 E_{ij}\otimes E_{ji}\in M_2(M_2).

On C2⊗C2\mathbb C^2\otimes\mathbb C^2, FF exchanges the tensor factors, so it is a unitary of norm one. Applying transposition to the second factor gives

(id⁡M2⊗t)(F)=∑i,jEij⊗Eij=∣Ω⟩⟨Ω∣,Ω=e1⊗e1+e2⊗e2.(\operatorname{id}_{M_2}\otimes t)(F) =\sum_{i,j}E_{ij}\otimes E_{ij} =|\Omega\rangle\langle\Omega|, \qquad \Omega=e_1\otimes e_1+e_2\otimes e_2.

The last operator has norm ∥Ω∥2=2\|\Omega\|^2=2. Thus transposition is neither a complete contraction nor a complete isometry.

It is also not completely positive. The positive operator ∣Ω⟩⟨Ω∣|\Omega\rangle\langle\Omega| is sent by the same partial transpose to FF, whose value on the antisymmetric vector e1⊗e2−e2⊗e1e_1\otimes e_2-e_2\otimes e_1 is its negative.

7. Exercises with solutions

Exercise 1 (A sign can be completely bounded; introductory). Factor θ(z)=−z\theta(z)=-z on C\mathbb C in the form of Theorem 4.1 with product of operator norms one. Explain why no positive extension exists.

Solution. Take π(z)=z\pi(z)=z, S=−1S=-1, T=1T=1 on C\mathbb C. Then S∗π(z)T=−zS^*\pi(z)T=-z and ∥S∥∥T∥=1\|S\|\|T\|=1. Any extension on the same algebra must still send 11 to −1-1, preventing positivity.

Exercise 2 (The regularization step; intermediate). In Theorem 2.1, why may we add ε1\varepsilon1 to the diagonal blocks, and why must the matrices multiplying XX have scalar entries?

Solution. Adding a positive diagonal matrix preserves positivity and makes both diagonal blocks invertible. Scalar matrix multiplication takes finite linear combinations of entries of XX, so stays in Mn(V)M_n(V) and commutes with θ(n)\theta^{(n)}. Multiplication by arbitrary elements of AA need not preserve VV, and θ\theta need not respect it.

Exercise 3 (Enlarging the diagonals fails; intermediate). Let A=B=C2A=B=\mathbb C^2, let e=(1,0)e=(1,0), and let θ\theta exchange the two coordinates. Show that θ\theta is a complete isometry, but the rule that keeps the diagonal entries and applies θ\theta only to the off-diagonal entries need not preserve positivity in M2(A)M_2(A).

Solution. Coordinate exchange is a *-automorphism, hence a complete isometry. The matrix Z=(eeee)Z=\begin{pmatrix}e&e\\e&e\end{pmatrix} is positive: at the first coordinate it is the scalar positive matrix of all ones, and at the second it is zero. The proposed image is (e1−e1−ee)\begin{pmatrix}e&1-e\\1-e&e\end{pmatrix}. At the second coordinate it equals (0110)\begin{pmatrix}0&1\\1&0\end{pmatrix}, which has eigenvalue −1-1. Thus even a complete isometry does not justify arbitrary unchanged diagonal products. Scalar multiples of the identity, as in S(V)\mathcal S(V), avoid this obstruction.

Exercise 4 (The corner formula; intermediate). With the notation of Lemma 3.1, compute all four corners of Ψ([aij])\Psi([a_{ij}]).

Solution. The diagonal Stinespring operator gives

Ψ([aij])=(V1∗π(a11)V1V1∗π(a12)V2V2∗π(a21)V1V2∗π(a22)V2).\Psi([a_{ij}])= \begin{pmatrix} V_1^*\pi(a_{11})V_1&V_1^*\pi(a_{12})V_2\\ V_2^*\pi(a_{21})V_1&V_2^*\pi(a_{22})V_2 \end{pmatrix}.

This also displays the positive block completion before restoring the scale.

Exercise 5 (Balance a coefficient; intermediate). Suppose a nonzero coefficient map has a factorization S∗π( ⋅ )TS^*\pi(\,\cdot\,)T with positive s=∥S∥s=\|S\|, t=∥T∥t=\|T\|. Rescale it so that the two operator norms agree without changing the coefficient or their product.

Solution. Replace SS by t/s S\sqrt{t/s}\,S and TT by s/t T\sqrt{s/t}\,T. The scalar factors multiply to one, and both new norms are st\sqrt{st}. This balances an existing factorization; equality with the completely bounded norm still requires the theorem's optimal construction.

Exercise 6 (Positive and negative coefficients; intermediate). For a self-adjoint completely bounded map, verify Corollary 4.3 by expanding ψ+\psi_+ and ψ−\psi_-. If AA is unital and the balanced factorization comes from isometries, compute (ψ++ψ−)(1)(\psi_++\psi_-)(1).

Solution. The pure SS- and TT-terms cancel in the difference, leaving 12(θ(a)+θ(a∗)∗)=θ(a)\tfrac12(\theta(a)+\theta(a^*)^*)=\theta(a). The sum at the unit is 12(S∗S+T∗T)=c1H\tfrac12(S^*S+T^*T)=c1_H when SS and TT are c\sqrt c times isometries and π\pi is unital. Thus ∥ψ++ψ−∥=c\|\psi_++\psi_-\|=c in this construction.

Exercise 7 (A scalar norm misses a matrix norm; intermediate). Verify the action of FF and of ∣Ω⟩⟨Ω∣|\Omega\rangle\langle\Omega| in Example 6.1, and determine their spectra on C2⊗C2\mathbb C^2\otimes\mathbb C^2.

Solution. On an elementary tensor, F(ep⊗eq)=eq⊗epF(e_p\otimes e_q)=e_q\otimes e_p. It has eigenvalue 11 on the three-dimensional symmetric subspace and −1-1 on the one-dimensional antisymmetric subspace. The rank-one operator has eigenvalue two on CΩ\mathbb C\Omega and zero on its orthogonal complement. Their norms are one and two, respectively.

Exercise 8 (The row test for a unitary; intermediate). Explain why a contraction uu in a unital C*-algebra satisfying ∥uu∗+bb∗∥=1+∥b∥2\|uu^*+bb^*\|=1+\|b\|^2 for every bb must be a coisometry. What extra test makes it unitary?

Solution. Insert b=(1−uu∗)1/2b=(1-uu^*)^{1/2}. The equality reads 1=1+∥1−uu∗∥1=1+\|1-uu^*\|, so uu∗=1uu^*=1. The corresponding column identity ∥u∗u+b∗b∥=1+∥b∥2\|u^*u+b^*b\|=1+\|b\|^2, with b=(1−u∗u)1/2b=(1-u^*u)^{1/2}, gives u∗u=1u^*u=1.

Exercise 9 (Why surjectivity matters; intermediate). Let V:H→KV:H\to K be an isometry whose range is a proper subspace. Show that a↦VaV∗a\mapsto VaV^* is a complete isometry B(H)→B(K)B(H)\to B(K), but does not send the unit to a unitary of B(K)B(K). Explain why this does not contradict Theorem 5.2.

Solution. Compression by V∗V^* recovers aa, while the original map is contractive; the same argument with the amplified isometry gives equality at every size. Its value at the unit is the proper projection VV∗VV^*, which is not a unitary. The map is not surjective onto B(K)B(K). In Theorem 5.2, surjectivity is what allows the decisive choice of bb in the row and column tests.

References

Edward G. Effros and Zhong-Jin Ruan, On matricially normed spaces, Pacific Journal of Mathematics 132(2) (1988), 243–264, Section 3, especially the full proof of Theorem 3.7, printed pp.251–257 (PDF pp.10–16). The proof uses finite matrix extensions and a point-weak* net for arbitrary Hilbert spaces.

Ved Prakash Gupta, Prabha Mandayam and V. S. Sunder, The Functional Analysis of Quantum Information Theory, arXiv:1410.7188v3, Lemma 1.1.13, Proposition 1.1.14 and Theorem 1.1.17, printed pp.10–14 (PDF pp.15–19), gives the block method. Its printed corner and coefficient notation requires correction; Sections 2–3 here give the full correct matrix entries and dilation decomposition. Lemma 5.1 also proves the scalar positivity fact that the notes leave by reference.

William B. Arveson, Subalgebras of C*-algebras, Acta Mathematica 123 (1969), 141–224, Theorems 1.1.1 and 1.2.3, gives the dilation and extension methods. The preceding lesson proves extension for systems that need not be closed. Sections 4–5 here prove exact norm equality, nonunital restriction and surjective two-isometry rigidity, including the multiplier conclusion.