Tensor Network Theory: A formalization blueprint

A Schwarz Inequalities and Multiplicative Domains: Supporting Results

This appendix supports Chapter 5 by collecting the elementary order, trace-duality, rank-one, and weighted-trace arguments used there.

A.1 Trace duality and elementary order preservation

Let \(T\) denote a positive linear map between matrix algebras. For a linear map \(E:M_{D}(\mathbb {C})\to M_{D'}(\mathbb {C})\), write \(E^*\) for the trace-pairing adjoint of Definition 5.3.1. The results below supply the order step in Theorem 5.6.3.1 and the trace duality used by the positive-retraction and fixed-point arguments.

Theorem A.1.1 Positive maps are monotone
#

If \(T:M_{n}(\mathbb {C})\to M_{m}(\mathbb {C})\) is positive and \(A,B\in M_{n}(\mathbb {C})\) satisfy \(A\le B\), then \(T(A)\le T(B)\) in \(M_{m}(\mathbb {C})\).

Proof

Since \(B-A\ge 0\), positivity gives \(T(B-A)\ge 0\). By linearity, this is \(T(B)-T(A)\ge 0\).

Theorem A.1.2 Positive maps preserve adjoints
#

If \(T:M_{n}(\mathbb {C})\to M_{m}(\mathbb {C})\) is positive, then \(T(A^\dagger )=T(A)^\dagger \) for all \(A\in M_{n}(\mathbb {C})\).

Proof

Regard \(T\) as the associated positive linear map (Definition 4.4.1). For positive linear maps between matrix \(C^*\)-algebras, \(T(A^\ast )=T(A)^\ast \). Since the star on each matrix algebra is the conjugate transpose, \(T(A^\dagger )=T(A^\ast )=T(A)^\ast =T(A)^\dagger \).

Theorem A.1.3 Trace-pairing adjoint identity
#

For every linear map \(E : M_{D}(\mathbb {C}) \to M_{D'}(\mathbb {C})\), every \(\rho \in M_{D'}(\mathbb {C})\), and every \(X \in M_{D}(\mathbb {C})\), one has

\begin{align} \operatorname{tr}(E^*(\rho )X) & =\operatorname{tr}(\rho E(X)). \label{eq:schwarz_trace_adjoint_pairing} \end{align}
Proof

Write \(X=\sum _{i,j}X_{ij}e_{ij}\) in the standard matrix units and use linearity in \(X\). For \(X=e_{ij}\) one has \(\operatorname{tr}(E^*(\rho )e_{ij})=(E^*(\rho ))_{ji}\), while the definition of \(E^*\) gives \((E^*(\rho ))_{ji}=\operatorname{tr}(\rho E(e_{ij}))\).

Theorem A.1.4 Trace-pairing adjoint is involutive

For every linear map \(E : M_{D}(\mathbb {C}) \to M_{D'}(\mathbb {C})\), the trace-pairing adjoint of \(E^*\) is \(E\).

Proof

Fix \(X\in M_{D}(\mathbb {C})\) and an arbitrary matrix \(N\in M_{D'}(\mathbb {C})\). Applying (??) first to \(E^* : M_{D'}(\mathbb {C}) \to M_{D}(\mathbb {C})\) and then to \(E\) gives

\begin{align} \operatorname{tr}((E^*)^*(X)N) & =\operatorname{tr}(XE^*(N)) =\operatorname{tr}(E^*(N)X) =\operatorname{tr}(NE(X)) =\operatorname{tr}(E(X)N). \notag \end{align}

Both \((E^*)^*(X)\) and \(E(X)\) lie in \(M_{D'}(\mathbb {C})\), so, since this holds for every \(N\in M_{D'}(\mathbb {C})\), nondegeneracy of the trace pairing on \(M_{D'}(\mathbb {C})\) gives \((E^*)^*=E\).

Theorem A.1.5 Self-duality of the positive semidefinite cone

Let \(A \in M_{D}(\mathbb {C})\) be Hermitian. If \(\operatorname{tr}(AB)\geq 0\) for every positive semidefinite matrix \(B\), then \(A\geq 0\).

Proof

Test the hypothesis on rank-one positive semidefinite matrices \(B=xx^\dagger \). The identity \(\operatorname{tr}(Axx^\dagger )=x^\dagger A x\) and the hypothesis give \(x^\dagger A x\geq 0\) for every vector \(x\), so the Hermitian matrix \(A\) is positive semidefinite.

Theorem A.1.6 Trace-pairing adjoint of a positive map

If \(E : M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) is positive, then its trace-pairing adjoint \(E^*\) is positive.

Proof

Let \(\rho \geq 0\). First \(E^*(\rho )\) is Hermitian. Indeed, Theorem A.1.2 gives \(E(A^\dagger )=E(A)^\dagger \), and hence, for matrix units \(e_{ij}\),

\begin{align} \overline{\operatorname{tr}(\rho E(e_{ij}))} & =\operatorname{tr}(E(e_{ij})^\dagger \rho ) =\operatorname{tr}(E(e_{ji})\rho ) =\operatorname{tr}(\rho E(e_{ji})). \notag \end{align}

For every \(B\geq 0\), (??) gives \(\operatorname{tr}(E^*(\rho )B)=\operatorname{tr}(\rho E(B))\). Since \(E(B)\geq 0\), the right-hand side is non-negative by positivity of the trace product of two positive semidefinite matrices. Self-duality of the positive semidefinite cone therefore gives \(E^*(\rho )\geq 0\).

Theorem A.1.7 Trace-pairing adjoints preserve positivity exactly

A linear map is positive if and only if its trace-pairing adjoint is positive.

Proof

One direction is Theorem A.1.6. The other follows by applying the same theorem to \(E^*\) and using Theorem A.1.4.

A.2 Positive functionals and rank-one retractions

The next three results provide, respectively, the density, support, and scalarity steps in Theorem 5.3.2 and hence in its finite-star-algebra extension, Theorem 5.3.3.

Theorem A.2.1 Density representation of positive matrix functionals

Let \(f : M_{D}(\mathbb {C}) \to \mathbb {C}\) be a complex-linear functional, where \(D{\gt}0\). If \(f(X) \geq 0\) for every \(X \geq 0\) and \(f(\mathbb {1})=1\), then there is a density matrix \(\rho \in M_{D}(\mathbb {C})\) such that \(f(X) = \operatorname{tr}(\rho X)\) for every \(X \in M_{D}(\mathbb {C})\).

Proof

Define \(F : M_{D}(\mathbb {C}) \to M_{D}(\mathbb {C})\) by \(F(X) = f(X)\mathbb {1}\). For \(X \geq 0\) one has \(f(X) \geq 0\), so \(F(X) = f(X)\mathbb {1}\geq 0\) and \(F\) is positive. Set \(\sigma = D^{-1}\mathbb {1}\) and \(\rho = F^*(\sigma )\). Positivity of the trace-pairing adjoint gives \(\rho \geq 0\), while (??) gives

\begin{align} \operatorname{tr}(\rho X) & =\operatorname{tr}(\sigma F(X)) =f(X). \notag \end{align}

Taking \(X = \mathbb {1}\) yields \(\operatorname{tr}(\rho ) = 1\).

Lemma A.2.2 Rank-one domination

Let \(A\in M_{D}(\mathbb {C})\) be positive semidefinite, let \(c\in \mathbb {C}\), and let \(\psi \in \mathbb {C}^D\). If \(A\leq c|\psi \rangle \! \langle \psi |\), then there is a non-negative scalar \(a\) such that \(A=a|\psi \rangle \! \langle \psi |\).

Proof

The assertion is immediate when \(\psi =0\). Otherwise set \(s=\langle \psi ,\psi \rangle \), \(P=|\psi \rangle \! \langle \psi |\), and \(Q=s^{-1}P\). Then \(Q\) is the orthogonal projection onto \(\mathbb {C}\psi \). Write \(B=cP-A\geq 0\). Since \(A+B=cP\) vanishes on the kernel of \(Q\), positivity implies \(A(\mathbb {1}-Q)=0\). Taking adjoints gives \((\mathbb {1}-Q)A=0\), and therefore \(A=QAQ\). Finally,

\begin{align} PAP & =\langle \psi ,A\psi \rangle P, \notag \\ A & =s^{-2}\langle \psi ,A\psi \rangle P. \notag \end{align}

The coefficient is non-negative because \(A\geq 0\) and \(s{\gt}0\).

Theorem A.2.3 Rank-one ray scalar rigidity

Let \(T:M_{D}(\mathbb {C})\to M_{D}(\mathbb {C})\) be complex-linear. Suppose that for every \(v\in \mathbb {C}^D\) there is a scalar \(c_v\in \mathbb {C}\) such that \(T(|v\rangle \! \langle v|)=c_v|v\rangle \! \langle v|\). Then there is a scalar \(c\in \mathbb {C}\) such that \(T=c\, \operatorname{id}\).

Proof

Write \(P_v=|v\rangle \! \langle v|\). If \(D=0\), then \(M_{D}(\mathbb {C})\) is the zero vector space, so the conclusion holds with \(c=0\). If \(D=1\), the single matrix unit is \(P_{e_0}\). The hypothesis gives \(T(P_{e_0})=c_{e_0}P_{e_0}\), and linearity gives \(T=c_{e_0}\, \operatorname{id}\) on all of \(M_{1}(\mathbb {C})\).

It remains to consider \(D\geq 2\). Set \(c=c_{e_0}\). For \(i\ne j\), the identities

\begin{align} P_{e_i+e_j}+P_{e_i-e_j} & =2P_{e_i}+2P_{e_j}, \notag \\ c_{e_i+e_j}P_{e_i+e_j}+c_{e_i-e_j}P_{e_i-e_j} & =2c_{e_i}P_{e_i}+2c_{e_j}P_{e_j} \notag \end{align}

give, from their \((i,i)\), \((j,j)\), and \((i,j)\) entries, \(c_{e_i+e_j}=c_{e_i-e_j}=c_{e_i}=c_{e_j}\). The imaginary parallelogram identity and its image under \(T\) are

\begin{align} P_{e_i+\mathrm{i}e_j}+P_{e_i-\mathrm{i}e_j} & =2P_{e_i}+2P_{e_j}, \notag \\ c_{e_i+\mathrm{i}e_j}P_{e_i+\mathrm{i}e_j} +c_{e_i-\mathrm{i}e_j}P_{e_i-\mathrm{i}e_j} & =2c_{e_i}P_{e_i}+2c_{e_j}P_{e_j}. \notag \end{align}

Comparing the same three entries gives \(c_{e_i+\mathrm{i}e_j}=c_{e_i-\mathrm{i}e_j}=c_{e_i}=c_{e_j}\). Taking the pair \((0,i)\) shows that \(c_{e_i}=c\) for every \(i\). The hypothesis therefore gives \(T(E_{ii})=cE_{ii}\) for the diagonal matrix units. For \(i\ne j\), the polarization identity

\begin{align} 4E_{ij} & =P_{e_i+e_j}-P_{e_i-e_j} +\mathrm{i}P_{e_i+\mathrm{i}e_j} -\mathrm{i}P_{e_i-\mathrm{i}e_j} \notag \end{align}

gives \(T(E_{ij})=cE_{ij}\). Thus \(T=c\, \operatorname{id}\) on every matrix unit.

The rank-one domination and rigidity results turn the vector-dependent coefficients in the one-factor retraction into a single positive functional; the density representation identifies that functional with a density matrix.

A.3 Faithful weighted traces and peripheral Schwarz equality

These two trace facts provide the adjointness and faithfulness steps in Theorem 5.5.1. For the Kraus map \(E\), write \(E^*\) for its Kraus adjoint and let \(\rho {\gt}0\) denote the faithful fixed point used there.

Lemma A.3.1 Trace pairing for Kraus map and adjoint map

For all \(X, Y \in M_{D}(\mathbb {C})\), \(\operatorname{tr}\! (X\, E(Y)) = \operatorname{tr}\! (E^*(X)\, Y)\).

Lemma A.3.2 Positive-definite trace test

If \(A {\gt} 0\), \(X \ge 0\), and \(\operatorname{tr}(A X) = 0\), then \(X = 0\).