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 be a linear subspace of a C*-algebra . The norm on is its norm as a subspace of . For , write
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 on has completely bounded norm one. It is not positive, since its value at is . 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 ,
More generally, if are positive invertible operators, then
Proof. In the first assertion, the quadratic form on is . Minimizing over , with fixed, gives . It is nonnegative for every exactly when . Conjugation by gives the second assertion.
Inner products here and below are linear in the second variable.
2. The scalar-diagonal operator system
Assume temporarily that is unital. Define
It is an operator system: it is linear, closed under adjoints, and contains the identity of . Closure of is unnecessary. For a linear map , set
Theorem 2.1 (The two-by-two device). The map is a complete contraction if and only if is completely positive. In that case is unital.
Proof. At matrix size , rearrange the matrix coordinates so that the two diagonal corners are grouped together. A positive element of then has the form
Add times the identity to both diagonal blocks. Lemma 1.1 gives
Multiplication by scalar matrices preserves , and amplification of commutes with this multiplication. If is a complete contraction, the same inequality holds after applying . The block criterion makes the image of the regularized positive. Let ; the positive cone is norm closed, so . This proves complete positivity at every size.
Conversely, if has norm at most one, Lemma 1.1 makes positive. Complete positivity of , followed by the same criterion, gives . Hence is a complete contraction. The formula for gives its unitality.
The scalar diagonals are essential. Complete contractivity alone does not permit keeping arbitrary diagonal products unchanged while replacing the off-diagonal entries by . Exercise 3 gives a concrete failure.
3. Recover the off-diagonal coefficient
Lemma 3.1. Let be unital and let be ucp. Suppose
There are a unital representation and isometries such that the upper-right corner of is .
Proof. Take a unital Stinespring dilation , where is an isometry. Put , and let be the corresponding projection on . A projection mapped to a projection belongs to the multiplicative domain. More directly,
follows by expanding the square and using . Therefore .
The matrix units of identify with , so that
for a unital representation of . The intertwining identities make diagonal in this decomposition, with diagonal entries . Because is an isometry, both entries are isometries. Compressing by now gives the asserted formula.
4. Extension with the same completely bounded norm
Theorem 4.1 (Completely bounded extension and factorization). Let be a linear subspace of a C*-algebra and let be completely bounded. There are a representation and operators such that
Consequently,
extends and satisfies . If , one may choose .
Proof. The zero map has a zero extension and zero factorization. Otherwise put and .
First suppose is unital. Theorem 2.1 makes ucp on . Arveson's extension theorem gives a ucp map extending it. The two diagonal matrix units already belong to , so their values meet Lemma 3.1. That lemma gives
Set and . Then the required factorization holds and both norms are .
At every matrix size,
Thus the extension has completely bounded norm at most . Restriction to gives the reverse inequality, hence equality.
For nonunital , embed it in the algebra obtained by adjoining a unit. Matrix norms on are unchanged. Apply the unital argument there and restrict the representation and extension to . The representation on may be degenerate, which is allowed. Its coefficient formula still gives the same upper bound, and restriction to still gives equality. No countability or closure of was used.
The two operators generally differ. Requiring would make the coefficient map completely positive, which is impossible for on a subspace containing the unit.
Corollary 4.2 (A positive block completion). A completely bounded map , of norm , has completely positive maps , each of norm at most , such that
is completely positive.
Proof. Use the balanced factorization in Theorem 4.1 and put , . The displayed map is compression of by the row operator . Hence it is completely positive, and the separate norms are bounded by . For use zero maps.
This completion adjusts the diagonal entries. It does not claim that arbitrary diagonal expressions from can be copied into the target algebra.
Corollary 4.3 (Self-adjoint maps). If is completely bounded and satisfies , then it is a difference of two completely positive maps.
Proof. Take . Set
Both maps are completely positive. Their difference is . The second term is , so self-adjointness makes the difference .
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 on a unital C*-algebra with is positive. Consequently a unital contractive map between unital C*-algebras is positive.
Proof. For self-adjoint and real ,
The linear term in forces . For , we then have , so . Rescaling proves positivity on every positive element.
For a unital contraction , 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 is positive.
Theorem 5.2. Let be a surjective linear isometry of C*-algebras, and suppose is also an isometry. There are a unitary and a surjective *-isomorphism such that
In particular is a complete isometry.
Proof. Pass to the bidual map . A surjective linear isometry has a surjective isometric bidual map. We use the canonical identifications and , from the enveloping von Neumann algebra construction. They show that is an isometry as well. Both bidual algebras are unital.
Put , so . For every , the squared norm of the row , placed in a two-by-two matrix with second row zero, is . Its image has squared norm . Surjectivity therefore gives
Since , choose . The left side is one, forcing . Apply the same argument to the column and choose . It gives . Thus is unitary in .
The map is a unital surjective two-isometry, and its inverse has the same properties. Lemma 5.1, at matrix sizes one and two, makes and 2-positive. Here the Schwarz estimate uses only 2-positivity: the matrix
is positive. Applying keeps it positive. Since preserves adjoints and the unit, testing the resulting quadratic form on gives
Apply to this inequality and then use its Schwarz inequality on . The two inequalities sandwich between identical endpoints. Applying back gives equality:
Polarization yields . A positive linear map preserves adjoints, so replacing by proves multiplicativity. Hence is a *-isomorphism of the biduals.
It remains to locate the original algebras and the multiplier. Let , a closed C*-subalgebra. Since is onto, . It follows that
The left side is , because a C*-algebra is the closed linear span of its products. Thus . In particular , and multiplying this equality by gives . Taking adjoints gives and . These two-sided multiplier conditions place and in ; they remain mutual inverses there. Restricting gives the claimed .
A *-isomorphism is isometric at every matrix size, as is multiplication by the diagonal unitary with entries . Hence is a complete isometry.
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 or themselves.
6. A matrix norm detects transposition
Transposition on is an isometry at scalar size. Its second amplification can already enlarge norms.
Example 6.1. Let be transposition and set
On , exchanges the tensor factors, so it is a unitary of norm one. Applying transposition to the second factor gives
The last operator has norm . Thus transposition is neither a complete contraction nor a complete isometry.
It is also not completely positive. The positive operator is sent by the same partial transpose to , whose value on the antisymmetric vector is its negative.
7. Exercises with solutions
Exercise 1 (A sign can be completely bounded; introductory). Factor on in the form of Theorem 4.1 with product of operator norms one. Explain why no positive extension exists.
Solution. Take , , on . Then and . Any extension on the same algebra must still send to , preventing positivity.
Exercise 2 (The regularization step; intermediate). In Theorem 2.1, why may we add to the diagonal blocks, and why must the matrices multiplying 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 , so stays in and commutes with . Multiplication by arbitrary elements of need not preserve , and need not respect it.
Exercise 3 (Enlarging the diagonals fails; intermediate). Let , let , and let exchange the two coordinates. Show that is a complete isometry, but the rule that keeps the diagonal entries and applies only to the off-diagonal entries need not preserve positivity in .
Solution. Coordinate exchange is a *-automorphism, hence a complete isometry. The matrix 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 . At the second coordinate it equals , which has eigenvalue . Thus even a complete isometry does not justify arbitrary unchanged diagonal products. Scalar multiples of the identity, as in , avoid this obstruction.
Exercise 4 (The corner formula; intermediate). With the notation of Lemma 3.1, compute all four corners of .
Solution. The diagonal Stinespring operator gives
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 with positive , . Rescale it so that the two operator norms agree without changing the coefficient or their product.
Solution. Replace by and by . The scalar factors multiply to one, and both new norms are . 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 and . If is unital and the balanced factorization comes from isometries, compute .
Solution. The pure - and -terms cancel in the difference, leaving . The sum at the unit is when and are times isometries and is unital. Thus in this construction.
Exercise 7 (A scalar norm misses a matrix norm; intermediate). Verify the action of and of in Example 6.1, and determine their spectra on .
Solution. On an elementary tensor, . It has eigenvalue on the three-dimensional symmetric subspace and on the one-dimensional antisymmetric subspace. The rank-one operator has eigenvalue two on 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 in a unital C*-algebra satisfying for every must be a coisometry. What extra test makes it unitary?
Solution. Insert . The equality reads , so . The corresponding column identity , with , gives .
Exercise 9 (Why surjectivity matters; intermediate). Let be an isometry whose range is a proper subspace. Show that is a complete isometry , but does not send the unit to a unitary of . Explain why this does not contradict Theorem 5.2.
Solution. Compression by recovers , 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 , which is not a unitary. The map is not surjective onto . In Theorem 5.2, surjectivity is what allows the decisive choice of 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.