Tensor Network Theory: A formalization blueprint

I Positive but Not Completely Positive Maps: Supporting Results

This appendix supports Chapter 22. It proves the positive-filter identities used in trace normalization, the Schmidt-rank linear algebra behind the maximal-overlap theorem, the extremal projection bounds in Ky Fan’s maximum principle, the right-tensor identities behind the Choi-compression criteria, and the elementary closure properties of \(k\)-positive maps.

I.1 Positive filters and trace normalization

This section proves the normalization and invertibility steps used in Lemma 22.1.1. Here \(T^*\) denotes the adjoint for the trace pairing, \(\mathbb {1}\) is the identity matrix, and \(A^{-1/2}\) denotes the inverse of the positive square root of a positive definite matrix.

For every \(X\in M_{D}(\mathbb {C})\), the conjugation filter \(\rho \mapsto X\rho X^\dagger \) is completely positive, hence positive. Therefore, if \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) is positive, then \(\rho \mapsto T(X\rho X^\dagger )\) is positive. If in addition \(X^\dagger X=\mathbb {1}\), then the conjugation filter is trace-preserving and hence is a quantum channel.

Proof

Complete positivity follows from the Kraus representation (??) with the single Kraus operator \(X\). Positivity follows immediately. If \(X^\dagger X=\mathbb {1}\), cyclicity of the trace gives \(\operatorname{tr}(X\rho X^\dagger )=\operatorname{tr}(X^\dagger X\rho )=\operatorname{tr}(\rho )\).

Lemma I.1.2 Trace-normalization criterion, trace-preservation component

Let \(T:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\) be a linear map and let \(X\in M_{D}(\mathbb {C})\) satisfy \(X^\dagger T^*(\mathbb {1})X=\mathbb {1}\). Then, for every \(\rho \in M_{D}(\mathbb {C})\),

\begin{align} \operatorname{tr}\! (T(X\rho X^\dagger )) & =\operatorname{tr}(\rho ). \notag \end{align}
Proof

Expanding with the trace-pairing adjoint gives

\begin{align} \operatorname{tr}\! (T(X\rho X^\dagger )) & =\operatorname{tr}\! (X\rho X^\dagger T^*(\mathbb {1})) =\operatorname{tr}\! (\rho X^\dagger T^*(\mathbb {1})X) =\operatorname{tr}(\rho ). \notag \end{align}

Let \(T:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\) be a positive map between matrix algebras of possibly different dimensions, and let \(X\in M_{D}(\mathbb {C})\) satisfy \(X^\dagger T^*(\mathbb {1})X=\mathbb {1}\), where \(T^*\) is the trace-pairing adjoint. Then \(\rho \mapsto T(X\rho X^\dagger )\) is positive and trace-preserving.

This is the algebraic trace-normalization step in the proof of [ Wol12 , Chapter 3, Lemma “Making positive maps trace preserving” ] . The inverse-square-root choice is recorded in the next theorem.

Proof

By Theorem I.1.1, \(X\rho X^\dagger \) is positive whenever \(\rho \) is positive; positivity of \(T\) therefore makes the filtered map positive. For trace preservation, the trace-pairing adjoint identity and cyclicity of the trace give

\begin{align} \operatorname{tr}\! (T(X\rho X^\dagger )) & =\operatorname{tr}\! (T^*(\mathbb {1})X\rho X^\dagger ) =\operatorname{tr}\! (X^\dagger T^*(\mathbb {1})X\rho ) =\operatorname{tr}(\rho ). \notag \end{align}
Lemma I.1.4 Normalizing conjugation by inverse square root

Let \(A\in M_{D}(\mathbb {C})\) be positive definite and set \(S=A^{1/2}\). Then

\begin{align} (S^{-1})^\dagger A S^{-1} & =\mathbb {1}. \notag \end{align}
Proof

Since \(A\) is positive definite, \(S\) is invertible and self-adjoint, and \(S^2=A\). Therefore \((S^{-1})^\dagger A S^{-1}=S^{-1}S^2S^{-1}=\mathbb {1}\).

Lemma I.1.5 Inverse square root of a positive definite matrix is invertible
#

If \(A\in M_{D}(\mathbb {C})\) is positive definite, then \((A^{1/2})^{-1}\) is invertible.

Proof

A positive definite matrix is invertible, hence so is its square root \(A^{1/2}\), and the inverse of an invertible matrix is invertible.

Theorem I.1.6 Trace normalization by inverse square root

Let \(T:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\) be a positive map such that \(T^*(\mathbb {1})\) is positive definite. Put \(X=(T^*(\mathbb {1}))^{-1/2}\). Then \(\rho \mapsto T(X\rho X^\dagger )\) is positive and trace-preserving.

Proof

Let \(S=(T^*(\mathbb {1}))^{1/2}\). Since \(T^*(\mathbb {1})\) is positive definite, \(S\) is invertible and self-adjoint, and \(S^2=T^*(\mathbb {1})\). For \(X=S^{-1}\),

\begin{align} X^\dagger T^*(\mathbb {1})X & =S^{-1}S^2S^{-1}=\mathbb {1}. \notag \end{align}

Theorem I.1.3 applies.

Consequently, the inverse-square-root filter used in Lemma 22.1.1 is invertible and satisfies the required normalization identity.

I.2 Schmidt-rank factorization and spectral expansions

This section supplies the bounded-rank factorizations and spectral identities used in Theorems 22.2.2.3, 22.2.2.6, and 22.2.2.7. The coefficient matrix of a bipartite vector identifies Schmidt rank with ordinary matrix rank; reduced densities and eigenbasis expansions then express the relevant overlaps and quadratic forms.

Lemma I.2.1 Monotonicity of bounded Schmidt rank
#

If \(\operatorname{SR}(\psi )\le k\) and \(k\le l\), then \(\operatorname{SR}(\psi )\le l\).

Proof

The hypothesis gives \(\operatorname{SR}(\psi )\le k\), and transitivity with \(k\le l\) gives \(\operatorname{SR}(\psi )\le l\).

Lemma I.2.2 Rank factorization through a coordinate space
#

If \(A\in M_{m,n}(\mathbb {C})(\mathbb {C})\) has rank at most \(k\), then there are matrices \(B\in M_{m,k}(\mathbb {C})(\mathbb {C})\) and \(C\in M_{k,n}(\mathbb {C})(\mathbb {C})\) such that \(BC=A\).

Proof

The range of the linear map represented by \(A\) has dimension at most \(k\). Embed this range into \(\mathbb {C}^k\), compose with the range map, and then map back to the ambient codomain. The corresponding matrices give the desired factorization.

Lemma I.2.3 Coefficient-matrix form of the reduced density

Writing \(C_i\) for the coefficient matrix of \(\phi _i\), the reduced density operator factors as \(\rho _i=C_iC_i^\dagger \).

Proof

The partial trace of \(|\phi _i\rangle \! \langle \phi _i|\) over the second factor has entries \(\sum _b(C_i)_{a,b}\overline{(C_i)_{a',b}}\), which is the \((a,a')\) entry of \(C_iC_i^\dagger \).

Lemma I.2.4 Reduced density is positive semidefinite

The reduced density operator \(\rho _i\) is positive semidefinite.

Proof

By the coefficient-matrix form, \(\rho _i=C_iC_i^\dagger \), which is positive semidefinite for any matrix \(C_i\).

Lemma I.2.5 Eigenbasis Rayleigh expansion
#

For a Hermitian operator \(\tau \) with eigenvalues \(\nu _i\) and normalized eigenvectors \(\phi _i\), the expectation in a vector \(\psi \) expands as

\begin{align} \langle \psi |\tau |\psi \rangle & =\sum _i\nu _i|\langle \phi _i | \psi \rangle |^2. \label{eq:schwarz_eigenbasis_rayleigh} \end{align}
Proof

Diagonalizing \(\tau =U\operatorname{diag}(\nu _i)U^\dagger \) with \(U\) the unitary of eigenvectors, the change of variable \(y=U^\dagger \psi \) gives \(\langle \psi |\tau |\psi \rangle =\sum _i\nu _i|y_i|^2\), and \(y_i=\langle \phi _i | \psi \rangle \) is the \(i\)-th eigenvector overlap.

Lemma I.2.6 Eigenbasis Parseval identity

For a Hermitian operator \(\tau \) with normalized eigenvectors \(\phi _i\), the eigenvector overlaps recover the squared norm of \(\psi \):

\begin{align} \sum _i|\langle \phi _i | \psi \rangle |^2 & =\| \psi \| ^2. \label{eq:schwarz_eigenbasis_parseval} \end{align}
Proof

The eigenvectors form an orthonormal basis, so with \(y=U^\dagger \psi \) one has \(\sum _i|\langle \phi _i | \psi \rangle |^2=\sum _i|y_i|^2=\| y\| ^2=\| \psi \| ^2\), where the last equality follows because \(U\) is unitary.

The factorization lemma gives coordinate representatives for bounded Schmidt rank, while the reduced-density and eigenbasis identities provide the Frobenius, Rayleigh, and Parseval formulas used in the main spectral bounds.

I.3 Ky Fan’s maximum principle

This section proves attainment and the matching upper bound used in Theorem 22.2.2.2. For Hermitian \(A\), write \(S_k(A)\) for the sum introduced in Definition 22.2.2.1.

Theorem I.3.1 Achievability of the largest-eigenvalue sum

For every Hermitian \(A\in M_{D}(\mathbb {C})\) and every \(k\ge 0\), there is an orthogonal projection \(P\) of rank \(\min (k,D)\) with \(\operatorname{Re}\operatorname{tr}(PA)=S_k(A)\).

Proof

Diagonalize \(A=U\operatorname{diag}(\lambda _i)U^\dagger \) and take \(P\) to be the projection onto the span of the eigenvectors with the \(\min (k,D)\) largest eigenvalues. Then \(\operatorname{Re}\operatorname{tr}(PA)=\sum _{i\le k}\lambda _i=S_k(A)\).

Theorem I.3.2 Upper bound for the largest-eigenvalue sum

For every Hermitian \(A\in M_{D}(\mathbb {C})\) and every orthogonal projection \(P\) of rank \(k{\lt}D\), one has \(\operatorname{Re}\operatorname{tr}(PA)\le S_k(A)\).

Proof

Conjugating \(P\) by \(U\) gives an orthogonal projection \(Q\) of the same rank, and \(\operatorname{Re}\operatorname{tr}(PA)=\sum _iw_i\lambda _i\), where \(w_i\) are the diagonal entries of \(Q\). Each \(w_i\) lies in \([0,1]\) and the weights sum to \(\operatorname{tr}(P)=k\). With the threshold \(c=\lambda _{k+1}\),

\begin{align} \sum _{i\le k}\lambda _i-\sum _iw_i\lambda _i & =\sum _{i\le k}(\lambda _i-c)(1-w_i) +\sum _{i{\gt}k}(c-\lambda _i)w_i \ge 0, \notag \end{align}

since for \(i\le k\) the eigenvalues dominate \(c\) while \(1-w_i\ge 0\), and for \(i{\gt}k\) they are dominated by \(c\) while \(w_i\ge 0\).

Together, Theorems I.3.1 and I.3.2 prove Theorem 22.2.2.2, which supplies the projection estimate in the maximal-overlap theorem.

I.4 Right-tensor identities and Choi compressions

This section proves the matrix identities and rank parametrizations used in the Schmidt-rank Choi criterion, the rectangular compression criterion, and the rank-\(k\) projection criterion. Throughout, \(R_X\) and \(C_T(X)\) are the right-tensor factor and Choi compression of Definitions 22.2.3.2 and 22.2.3.1.

Theorem I.4.1 Right tensor sandwich formula

If \(\tau \) is the Choi matrix of \(T\), then

\begin{align} R_X\tau R_X^\dagger & =C_T(X), \label{eq:schwarz_right_tensor_sandwich} \end{align}

where \(C_T(X)\) is the right-factor Choi compression by \(X\).

Proof

By (??), the \((i,p),(j,q)\) entry of the left-hand side of (??) is

\begin{align} \sum _{r,s,a,b} \delta _{i,r}X_{a,p}\tau _{(r,a),(s,b)} \delta _{j,s}\overline{X_{b,q}} & =\sum _{a,b}X_{a,p}\tau _{(i,a),(j,b)} \overline{X_{b,q}}. \notag \end{align}

which is (??).

Lemma I.4.2 Compressed maximally entangled vectors have bounded Schmidt rank

For \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\), the vector

\begin{align} \psi _X & =\left(D^{-1/2}X_{i,p}\right)_{(i,p)} \in \mathbb {C}^D\otimes \mathbb {C}^k \label{eq:schwarz_compressed_omega} \end{align}

has Schmidt rank at most \(k\).

Proof

The coefficient matrix of \(\psi _X\) is a scalar multiple of \(X\). Therefore its rank is bounded by the number of columns, which is \(k\).

Theorem I.4.3 Rank of a compressed maximally entangled vector

Assume \(D{\gt}0\). For \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\), the vector \(\psi _X\) in (??) satisfies \(\operatorname{SR}(\psi _X)=\operatorname{rank}X\).

Proof

The coefficient matrix of \(\psi _X\) is \(D^{-1/2}X\). Since \(D{\gt}0\), the scalar \(D^{-1/2}\) is nonzero, and multiplication by this scalar preserves rank.

Assume \(D{\gt}0\). For every \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\), there is \(X\in M_{D}(\mathbb {C})(\mathbb {C})\) such that

\begin{align} \psi _{(i,p)} & =D^{-1/2}X_{i,p}, \notag \\ \operatorname{rank}X & =\operatorname{SR}(\psi ). \label{eq:schwarz_square_schmidt_representative} \end{align}

In particular, if \(\operatorname{SR}(\psi )\le r\), then \(X\) may be chosen with \(\operatorname{rank}X\le r\).

Proof

Take \(X_{i,p}=D^{1/2}\psi _{(i,p)}\). Since \(D{\gt}0\), this gives \(D^{-1/2}X_{i,p}=\psi _{(i,p)}\). The rank identity follows from Theorem I.4.3. The bounded-rank statement follows by comparison with the assumed Schmidt-rank bound.

Lemma I.4.5 Square parametrization of bounded Schmidt rank

Assume \(D{\gt}0\). A vector \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\) has Schmidt rank at most \(k\) if and only if there is a matrix \(X\in M_D(\mathbb {C})(\mathbb {C})\) of rank at most \(k\) such that \(\psi _{(i,j)}=D^{-1/2}X_{i,j}\).

Proof

The forward direction is the bounded-rank part of Theorem I.4.4. Conversely, if \(\psi _{(i,j)}=D^{-1/2}X_{i,j}\), then \(C_\psi =D^{-1/2}X\), so \(\operatorname{rank}(C_\psi )=\operatorname{rank}(X)\) because multiplication by a nonzero scalar preserves rank.

Let \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and let \(\eta \in \mathbb {C}^D\otimes \mathbb {C}^k\). Then \(R_X^\dagger \eta \in \mathbb {C}^D\otimes \mathbb {C}^D\) has Schmidt rank at most \(k\).

Proof

If \(\eta \) is read as a \(D\times k\) coefficient matrix \(E\), then the coefficient matrix of \(R_X^\dagger \eta \) is \(EX^\dagger \). Therefore \(\operatorname{rank}(EX^\dagger )\le \operatorname{rank}(X^\dagger )=\operatorname{rank}(X)\le k\).

Lemma I.4.7 Right-tensor representatives of bounded Schmidt rank

If \(\psi \in \mathbb {C}^D\otimes \mathbb {C}^D\) has Schmidt rank at most \(k\), then there exist \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and \(\eta \in \mathbb {C}^D\otimes \mathbb {C}^k\) such that \(\psi =R_X^\dagger \eta \).

Proof

Let \(C_\psi \) be the coefficient matrix of \(\psi \). The rank assumption gives a factorization \(C_\psi =BC\) through \(\mathbb {C}^k\). Taking \(X=C^\dagger \) and reading \(B\) as the coefficient matrix of \(\eta \) gives the required identity, because the coefficient matrix of \(R_X^\dagger \eta \) is \(BX^\dagger =BC\).

For \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and \(\eta \in \mathbb {C}^D\otimes \mathbb {C}^k\),

\begin{align} \langle \eta ,C_T(X)\eta \rangle & =\langle R_X^\dagger \eta ,\tau _T R_X^\dagger \eta \rangle . \label{eq:schwarz_right_compression_quadratic} \end{align}
Proof

Substituting (??) gives

\begin{align} \langle \eta ,R_X\tau _T R_X^\dagger \eta \rangle & =\langle R_X^\dagger \eta ,\tau _T R_X^\dagger \eta \rangle . \notag \end{align}
Lemma I.4.9 Rank-one ampliation as Choi compression

Applying the \(k\)-fold ampliation of \(T\) to the rank-one matrix \(|\psi \rangle \! \langle \psi |\), where \(\psi _{(a,p)}=D^{-1/2}X_{a,p}\), is exactly the right-factor compression of the Choi matrix of \(T\) by \(X\).

Proof

In entries, both sides are

\begin{align} \sum _{a,b}X_{a,p} T\! \left(D^{-1}E_{a,b}\right)_{i,j} \overline{X_{b,q}}. \notag \end{align}

If \(\psi _{(a,p)}=D^{-1/2}X_{a,p}\), then for fixed \(p,q\), the corresponding block of \(|\psi \rangle \! \langle \psi |\) is

\begin{align} (|\psi \rangle \! \langle \psi |)_{(\cdot ,p),(\cdot ,q)} & =D^{-1}\sum _{a,b}X_{a,p}\overline{X_{b,q}}E_{a,b}. \notag \end{align}

Hence

\begin{align} T\! \left(D^{-1}\sum _{a,b} X_{a,p}\overline{X_{b,q}}E_{a,b}\right)_{i,j} & =D^{-1}\sum _{a,b}X_{a,p}\overline{X_{b,q}} (T(E_{a,b}))_{i,j} \notag \\ & =\sum _{a,b}X_{a,p}\tau _{(i,a),(j,b)} \overline{X_{b,q}}. \notag \end{align}

where the second equality uses \(\tau _{(i,a),(j,b)}=D^{-1}(T(E_{a,b}))_{i,j}\).

Lemma I.4.10 Right-tensor multiplication

Let \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\). Then the right-tensor factors satisfy \(R_XR_P=R_{PX}\).

Proof

This is an entrywise calculation: the Kronecker delta in the physical index forces the two right-tensor factors to have the same physical coordinate, and the remaining sum is the matrix product \(PX\).

Lemma I.4.11 Square sandwich implies fixed rectangular compression

Let \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) have Choi matrix \(\tau \). Suppose \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) and \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) satisfy \(PX=X\). If \(R_P\tau R_P^\dagger \ge 0\), then the rectangular right compression of \(\tau \) by \(X\) is positive semidefinite.

Proof

Since \(PX=X\), Lemma I.4.10 gives \(R_XR_P=R_X\). Therefore

\begin{align} R_X\tau R_X^\dagger & =R_X(R_P\tau R_P^\dagger )R_X^\dagger , \label{eq:schwarz_fixed_rectangular_compression} \end{align}

which is positive because positive semidefiniteness is preserved under compression. The left-hand side of (??) is the rectangular compression by (??).

Lemma I.4.12 Rank-\(k\) projection fixing a rectangular right factor

Let \(X\in M_{D,k}(\mathbb {C})(\mathbb {C})\) and suppose \(k\le D\). Then there exists a Hermitian projection \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) of rank \(k\) such that \(PX=X\).

Proof

The column space of \(X\) has dimension at most \(k\). Since \(k\le D\), extend this column space to a \(k\)-dimensional subspace \(U\subseteq \mathbb {C}^D\). Let \(P\) be the orthogonal projection onto \(U\). Then \(P\) is Hermitian and idempotent, its rank is \(\dim U=k\), and it fixes each column of \(X\).

Lemma I.4.13 Right-tensor factorization for \(VV^\dagger \)

For every \(V\in M_{D,k}(\mathbb {C})(\mathbb {C})\), the right-tensor factor satisfies \(R_{VV^\dagger }=R_V^\dagger R_V\).

Proof

This is the entrywise calculation obtained by expanding the definition of \(R_V\) and summing over the middle physical index.

Lemma I.4.14 Factorized right-tensor Choi sandwich

Let \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) have Choi matrix \(\tau \). For every \(V\in M_{D,k}(\mathbb {C})(\mathbb {C})\),

\begin{align} R_{VV^\dagger }\tau R_{VV^\dagger }^\dagger & =R_V^\dagger (R_V\tau R_V^\dagger )R_V. \label{eq:schwarz_factorized_choi_sandwich} \end{align}
Proof

Replace \(R_{VV^\dagger }\) by \(R_V^\dagger R_V\) using Lemma I.4.13 and reassociate the matrix products.

Theorem I.4.15 Factorized right projections in the Choi criterion

Assume \(D{\gt}0\). Let \(T:M_{D,D}(\mathbb {C})(\mathbb {C})\to M_{D,D}(\mathbb {C})(\mathbb {C})\) be \(k\)-positive, with Choi matrix \(\tau \). If a right-factor matrix has the form \(P=VV^\dagger \) with \(V\in M_{D,k}(\mathbb {C})(\mathbb {C})\), then \(R_P\tau R_P^\dagger \geq 0\).

Proof

By (??), \(R_{VV^\dagger }\tau R_{VV^\dagger }^\dagger =R_V^\dagger (R_V\tau R_V^\dagger )R_V\). The factor \(R_V\tau R_V^\dagger \) is positive by Theorem 22.2.3.7, and positive semidefiniteness is preserved under compression by \(R_V\).

Lemma I.4.16 Rank-\(k\) Hermitian projection factorization

Let \(P\in M_{D,D}(\mathbb {C})(\mathbb {C})\) be Hermitian, idempotent, and of rank \(k\). Then there exists \(V\in M_{D,k}(\mathbb {C})(\mathbb {C})\) such that \(P=VV^\dagger \).

Proof

Regard \(P\) as a linear operator on \(\mathbb {C}^D\). Hermiticity and idempotence say that this operator is the orthogonal projection onto its range. Choose an orthonormal basis of the range, indexed by \(\{ 0,\ldots ,k-1\} \) using the rank hypothesis, and let \(V\) be the matrix whose columns are these basis vectors. The standard rank-one expansion of an orthogonal projection gives \(P=VV^\dagger \).

These identities provide the bounded-Schmidt-rank representatives used in Theorems 22.2.3.3 and 22.2.3.4, identify ampliations with Choi compressions in Theorem 22.2.3.6, and supply the projection factorizations in Theorem 22.2.3.10.

I.5 Closure properties of \(k\)-positive maps

The next results record the monotonicity and elementary convex-cone properties used with the positivity hierarchy in Chapter 22.

Theorem I.5.1 \((k\! +\! 1)\)-positive implies \(k\)-positive
#

Positivity under amplification is monotone in \(k\).

Proof

Embed \(M_{k}(\mathbb {C})\) as the upper-left corner of \(M_{k+1}(\mathbb {C})\). For \(X\succeq 0\) in \(M_{D}(\mathbb {C})\otimes M_{k}(\mathbb {C})\), extend \(X\) by a zero row and column, apply the positive \((k+1)\)-fold ampliation, and compress back to the same corner. Compression preserves positive semidefiniteness, and the compressed image is the \(k\)-fold ampliation of \(X\).

Theorem I.5.2 \(k\)-positive implies \(m\)-positive for \(m \le k\)
#

If a linear map is \(k\)-positive and \(m \le k\), then it is \(m\)-positive.

Proof

Repeat the corner-extension and compression argument from dimension \(k\) to dimension \(m\). Equivalently, iterate the preceding theorem \(k-m\) times.

Theorem I.5.3 Zero map is \(k\)-positive
#

The zero map is \(k\)-positive.

Proof

Every ampliation of the zero map is zero, and the zero matrix is positive semidefinite.

Theorem I.5.4 Sums of \(k\)-positive maps
#

If \(E\) and \(F\) are \(k\)-positive, then \(E+F\) is \(k\)-positive.

Proof

For \(X\succeq 0\), both \(E^{(k)}(X)\) and \(F^{(k)}(X)\) are positive semidefinite. Since \((E+F)^{(k)}=E^{(k)}+F^{(k)}\), their sum is positive semidefinite.

Theorem I.5.5 Nonnegative multiples of \(k\)-positive maps
#

If \(E\) is \(k\)-positive and \(c \ge 0\), then \(cE\) is \(k\)-positive.

Proof

Ampliation commutes with scalar multiplication, and a non-negative scalar multiple of a positive semidefinite matrix is positive semidefinite.

Theorem I.5.6 Closedness of \(k\)-positive maps
#

For each \(k\), the set of \(k\)-positive linear maps is closed in the finite-dimensional space of linear maps.

Proof

Let \(E_j\to E\) with every \(E_j\) \(k\)-positive. For each fixed \(X\succeq 0\), continuity of ampliation and evaluation gives \(E_j^{(k)}(X)\to E^{(k)}(X)\). The positive semidefinite cone is closed, so \(E^{(k)}(X)\succeq 0\). Since this holds for every positive semidefinite \(X\), the limit map \(E\) is \(k\)-positive.