Tensor Network Theory: A formalization blueprint

D Wielandt Bound: Supporting Results

This appendix supports Chapter 8. It collects exact-word, cumulative-span, augmentation, blocking, complementary-gap, and one-step padding results used by the main quantitative argument.

D.1 Exact-word and block-injectivity support

This section proves the exact-word identities and low-dimensional facts used in Lemma 8.1.1.13, Theorem 8.1.1.14, Theorem 8.5.2, and Theorem 8.9.1.

Lemma D.1.1 Word span products
#

One has \(S_m(A)S_n(A)\subseteq S_{m+n}(A)\): the product of word spans at lengths \(m\) and \(n\) is contained in the word span at length \(m+n\).

Proof

Every product \(A^{w_1}A^{w_2}\) with \(|w_1|=m\) and \(|w_2|=n\) equals \(A^{w_1w_2}\), where \(|w_1w_2|=m+n\).

Lemma D.1.2 Zero-length word span

If \(D\ge 2\), then \(S_0(A)\neq M_{D}(\mathbb {C})\).

Proof

The zero-length products consist only of the identity, so \(S_0(A)=\operatorname{span}_{\mathbb {C}}\{ \mathbb {1}\} \) has dimension \(1\). Since \(\dim M_{D}(\mathbb {C})=D^2\ge 4\), this span cannot equal \(M_{D}(\mathbb {C})\).

Corollary D.1.3 \(0\)-block injectivity

If \(D\ge 1\) and \(A\) is \(0\)-block injective, then \(D=1\).

Proof

By Lemma 8.1.1.13, \(0\)-block injectivity gives \(S_0(A)=M_{D}(\mathbb {C})\). Lemma D.1.2 excludes \(D\ge 2\), so the nonzero bond dimension must be \(1\).

Lemma D.1.4 Two-sided span from one nonzero matrix
#

If \(C\in M_{D}(\mathbb {C})\) is nonzero, then

\begin{align} \operatorname{span}_{\mathbb {C}}\{ RCS:R,S\in M_{D}(\mathbb {C})\} & =M_{D}(\mathbb {C}). \label{eq:wld_two_sided_nonzero_span} \end{align}

This is the matrix-factorization input used in  [ PGVWC07 , Lemma 3 ] .

Proof

Choose a nonzero entry \(C_{pq}\). Then every matrix unit \(E_{ij}\) is a scalar multiple of \(E_{ip}CE_{qj}\), so the span in (??) contains the standard matrix basis.

Lemma D.1.5 Exact words around a nonzero middle matrix

If \(A\) is \(L\)-block injective and \(X\neq 0\), then

\begin{align} \operatorname{span}_{\mathbb {C}}\{ A^uXA^v:|u|=|v|=L\} & =M_{D}(\mathbb {C}). \notag \end{align}
Proof

By \(L\)-block injectivity, the length-\(L\) word products span \(M_{D}(\mathbb {C})\). Bilinearity of \((R,S)\mapsto RXS\) reduces the claim to Lemma D.1.4, with \(R\) and \(S\) chosen among those word products.

D.2 Cumulative-span and spectral linear algebra

This section supplies the finite-dimensional stabilization and spectral facts used in Theorem 8.2.2, Theorem 8.3.2, and Theorem 8.4.8.

The next two lemmas connect irreducible matrix actions with the cumulative word span used throughout Chapter 8.

Remark D.2.1 Burnside input for cumulative spanning

The passage from irreducible tensors to full algebra spanning first passes through the irreducible action on \(\mathbb {C}^D\). Burnside’s theorem then says that the resulting irreducible subalgebra of \(M_{D}(\mathbb {C})\) is all of \(M_{D}(\mathbb {C})\). Once the algebra span is full, finite-dimensionality gives a single cumulative span that already equals \(M_{D}(\mathbb {C})\).

Lemma D.2.2 Irreducible action gives an irreducible tensor

If the letters of \(A\) act irreducibly on \(\mathbb {C}^D\), then \(A\) has no nontrivial invariant orthogonal projection.

Proof

If \(P\) were a nontrivial invariant orthogonal projection, then its range would be invariant under every letter of \(A\). Irreducibility of the action forces this range to be either \(0\) or all of \(\mathbb {C}^D\), so \(P\) must be \(0\) or \(\mathbb {1}\), a contradiction.

Lemma D.2.3 The algebra span reaches a finite cumulative span

If the generated unital algebra satisfies \(\operatorname{alg}(A)=M_{D}(\mathbb {C})\), then there exists \(N\) such that \(T_N(A)=M_{D}(\mathbb {C})\).

Proof

Every element of \(\operatorname{alg}(A)\) lies in some cumulative span \(T_n(A)\): the generators lie in \(T_1(A)\), scalar multiples of the identity lie in \(T_0(A)\), and the family \(\{ T_n(A)\} _{n\ge 0}\) is closed under addition and under multiplication with lengths adding. Since \(M_{D}(\mathbb {C})\) is finite-dimensional, the ascending chain \(T_0(A)\subseteq T_1(A)\subseteq \cdots \) stabilizes, so one can choose a single \(N\) with \(T_N(A)=M_{D}(\mathbb {C})\).

Definition D.2.4 Fitting decomposition
#

A Fitting decomposition of a linear endomorphism \(f:V\to V\) on a finite-dimensional vector space over an algebraically closed field consists of:

  1. \(f\) is nilpotent on the generalized \(0\)-eigenspace,

  2. \(f\) is invertible on each generalized \(\mu \)-eigenspace for \(\mu \neq 0\),

  3. the generalized eigenspaces span \(V\),

  4. the generalized eigenspaces are linearly independent.

Theorem D.2.5 Fitting decomposition exists
#

Every linear endomorphism on a finite-dimensional vector space over an algebraically closed field admits a Fitting decomposition.

Proof

Nilpotency on the zero generalized eigenspace follows from the definition of generalized eigenspaces. Invertibility on nonzero generalized eigenspaces follows because \(f-\mu \) is nilpotent there, so \(f=\mu (1-(1-f/\mu ))\) is invertible. Spanning and independence are standard results for generalized eigenspaces over algebraically closed fields. In  [ SPGWC10 ] and [ Wol12 , Lemma 6.3(b) ] , the Jordan normal form is used directly. The argument is phrased in terms of generalized eigenspaces instead.

Theorem D.2.6 Nilpotent power bound
#

If \(f\) is nilpotent on a space of dimension \(n\), then \(f^n=0\).

Proof

A nilpotent endomorphism on an \(n\)-dimensional space has nilpotency index at most \(n\).

Theorem D.2.7 Cumulative span reaches \(M_{D}(\mathbb {C})\) — explicit bound

Let \(D{\gt}0\). If \(A\) is normal, then \(T_{D^2}(A)=M_{D}(\mathbb {C})\).

Proof

By Theorem 8.1.1.12, if \(T_n\neq T_{n+1}\), then \(\dim T_{n+1}{\gt}\dim T_n\). Since \(\dim T_n\le D^2\) by Lemma 8.1.1.10, after at most \(D^2\) steps either \(T_n=M_{D}(\mathbb {C})\) or \(T_n\) has stabilised. Stabilisation before reaching \(M_{D}(\mathbb {C})\) contradicts normality, which requires \(S_{L_0}=M_{D}(\mathbb {C})\) for some \(L_0\) and hence \(T_{L_0}=M_{D}(\mathbb {C})\).

Theorem D.2.8 Nonzero trace product

Let \(D{\gt}0\). If \(A\) is normal, then there exists a word \(w\) of length at most \(D^2\) such that \(\operatorname{tr}(A^w)\neq 0\). This is the weaker \(D^2\) corollary of [ SPGWC10 , Lemma 1 ] . The sharp source statement is Theorem 8.2.3.

Proof

By Theorem 8.2.1, \(\mathbb {1}\in T_{D^2}(A)\), so \(\mathbb {1}\) is a linear combination of word products of length at most \(D^2\). At least one has nonzero trace because \(\operatorname{tr}(\mathbb {1})=D\neq 0\).

Theorem D.2.9 Nonzero trace implies eigenvector
#

If \(M\in M_{D}(\mathbb {C})\) has \(\operatorname{tr}(M)\neq 0\), then \(M\) has a nonzero eigenvalue \(\mu \neq 0\) and a corresponding eigenvector \(\varphi \neq 0\) satisfying \(M\varphi =\mu \varphi \).

Proof

The trace is the sum of the eigenvalues of \(M\), counted with multiplicity, so a nonzero trace gives a nonzero eigenvalue \(\mu \). Choosing a nonzero vector \(\varphi \in \ker (M-\mu \mathbb {1})\) gives \(M\varphi =\mu \varphi \).

Theorem D.2.10 Eigenvalue extraction

Let \(D{\gt}0\). If \(A\) is normal, then there exist a word \(w_0\) with \(|w_0|\le D^2\), a nonzero scalar \(\mu \neq 0\), and a nonzero vector \(\varphi \neq 0\) such that \(A^{w_0}\varphi =\mu \varphi \).

Proof

By Theorem D.2.8, there is a word \(w_0\) with \(\operatorname{tr}(A^{w_0})\neq 0\) and \(|w_0|\le D^2\). By Theorem D.2.9, \(A^{w_0}\) has a nonzero eigenvector.

Theorem D.2.11 Vector span stabilisation

If \(K_n(A,\varphi )=K_{n+1}(A,\varphi )\), then \(K_m(A,\varphi )=K_n(A,\varphi )\) for every \(m\ge n\).

Proof

The argument is the same as for Theorem 8.1.1.11: left multiplication by \(A^i\) cannot escape the stabilised span.

Lemma D.2.12 Vector span from matrix span

If \(T_N(A)=M_{D}(\mathbb {C})\) and \(\varphi \neq 0\), then \(K_N(A,\varphi )=\mathbb {C}^D\).

Proof

Every matrix \(M\in M_{D}(\mathbb {C})\) lies in \(T_N(A)\), so in particular every rank-one matrix sending \(\varphi \) to any target vector \(v\) lies in \(T_N(A)\). Applying such matrices to \(\varphi \) recovers all of \(\mathbb {C}^D\).

D.3 One-step augmentation

This section proves the one-step augmentation results used in Theorem 8.4.2 and Theorem 8.4.6.

Definition D.3.1 One-step augmentation
#

Let \(A\) be an MPS tensor with Kraus family \(\{ A^i\} _{i=0}^{d-1}\), and let \(X\in M_{D}(\mathbb {C})\). The one-step augmentation of \(A\) by \(X\) is the tensor \(\widetilde A\) with physical dimension \(d+1\) whose first Kraus operator is \(X\) and whose remaining Kraus operators are those of \(A\):

\begin{align} \widetilde A^0 & =X, \notag \\ \widetilde A^{i+1} & =A^i. \notag \end{align}
Lemma D.3.2 Kraus operators lie in the one-step span
#

Every Kraus operator \(A^i\) belongs to the one-step span \(S_1(A)\).

Proof

This is the length-one word with letter \(i\).

Let \(X\in S_1(A)\), and let \(\widetilde A\) be the one-step augmentation of \(A\) by \(X\). Then \(S_n(\widetilde A)=S_n(A)\) for every \(n\ge 0\).

Proof

The new generator \(X\) is already in \(S_1(A)\), and each original generator remains in the augmented family. Hence the one-step spans agree. Multiplying word spans and arguing by induction on the word length gives equality at every length.

Lemma D.3.4 Normality and Kraus rank under one-step augmentation

Let \(X\in S_1(A)\), and let \(\widetilde A\) be the one-step augmentation of \(A\) by \(X\). If \(A\) is normal, then \(\widetilde A\) is normal, and \(\operatorname{kr}(\widetilde A)=\operatorname{kr}(A)\).

Proof

Since all exact word spans are unchanged by Lemma D.3.3, eventual full word span for \(A\) gives eventual full word span for \(\widetilde A\). The equality of Kraus ranks is the equality of the dimensions of the common one-step span.

Theorem D.3.5 Wielandt case (2), invertible generator

Let \(A\) be a normal MPS tensor with bond dimension \(D{\gt}0\), and suppose that some Kraus operator \(A^{i_0}\) is invertible. Then

\begin{align} S_{D^2-\operatorname{kr}(A)+1}(A) & =M_{D}(\mathbb {C}), \notag \\ \iota (A) & \le D^2-\operatorname{kr}(A)+1. \notag \end{align}
Proof

The dimensions of the exact word spans cannot decrease, because left multiplication by the invertible Kraus operator is injective. If this dimension growth stopped before the full matrix algebra was reached, the same argument at every later length would contradict normality. Since \(\dim S_1(A)=\operatorname{kr}(A)\) and \(\dim M_{D}(\mathbb {C})=D^2\), the full algebra is reached by length \(D^2-\operatorname{kr}(A)+1\). The index bound follows from the definition of \(\iota (A)\).

Let \(A\) be an MPS tensor with bond dimension \(D\ge 1\), satisfying \(\sum _i(A^i)^\dagger A^i=\mathbb {1}\), and suppose that \(A\) is primitive in the sense of Definition 8.1.1.3. If some Kraus operator \(A^{i_0}\) is invertible, then

\begin{align} S_{D^2-\operatorname{kr}(A)+1}(A) & =M_{D}(\mathbb {C}), \notag \\ \iota (A) & \le D^2-\operatorname{kr}(A)+1. \notag \end{align}
Proof

Apply the one-step case to \(X=A^{i_0}\), which belongs to \(S_1(A)\) by Lemma D.3.2.

Let \(A\) be an MPS tensor with bond dimension \(D\ge 1\), satisfying \(\sum _i(A^i)^\dagger A^i=\mathbb {1}\), and suppose that \(A\) is primitive in the sense of Definition 8.1.1.3. If some Kraus operator \(A^{i_0}\) is non-invertible and has an eigenvector \(\varphi \neq 0\) with nonzero eigenvalue \(\mu \), then

\begin{align} S_{D^2}(A) & =M_{D}(\mathbb {C}), \notag \\ \iota (A) & \le D^2. \notag \end{align}
Proof

Apply the one-step case to \(X=A^{i_0}\), which belongs to \(S_1(A)\) by Lemma D.3.2.

D.4 Blocking and fixed-length spanning

This section proves the blocking and fixed-length constructions used in Theorem 8.4.8, Theorem 8.5.4, and Theorem 8.9.1.

Theorem D.4.1 Blocking preserves normality

If \(A\) is normal and \(L{\gt}0\), then the blocked tensor \(A^{[L]}\) is also normal.

Proof

Choose \(N\) with \(S_N(A)=M_{D}(\mathbb {C})\). Then \(\mathbb {1}\in S_N(A)\). For any \(M\in S_N(A)\), write \(\mathbb {1}=\sum _r c_rA^{w_r}\) with each \(|w_r|=N\). Then

\begin{align} M & =M\mathbb {1}=\sum _r c_rMA^{w_r} \in S_N(A)S_N(A) \subseteq S_{2N}(A). \label{eq:wld_blocknormal_self_inclusion} \end{align}

By Lemma D.1.1, iterating (??) gives \(S_N(A)\subseteq S_{kN}(A)\) for every \(k\ge 1\). Taking \(k=L\) yields \(M_{D}(\mathbb {C})=S_N(A)\subseteq S_{NL}(A)\). By Lemma D.4.2, \(S_{NL}(A)\subseteq S_N(A^{[L]})\), so \(S_N(A^{[L]})=M_{D}(\mathbb {C})\).

Lemma D.4.2 Chunking: word span embeds into blocked word span

One has \(S_{nL}(A)\subseteq S_n(A^{[L]})\) for all \(n,L\).

Proof

Every length-\(nL\) word in the original alphabet can be split into \(n\) consecutive chunks of length \(L\), each of which is a single blocked Kraus operator by (??). The claim follows by induction on \(n\), using Lemma D.1.1.

Theorem D.4.3 Word eigenvector gives blocked eigenvector

If \(A^{w_0}\varphi =\mu \varphi \) for a word \(w_0\) of length \(L\), then \((A^{[L]})^{j_0}\varphi =\mu \varphi \), where \(j_0\) is the encoded blocked index corresponding to \(w_0\).

Proof

By (??), \((A^{[L]})^{j_0}=A^{w_0}\).

Suppose \(A\) has bond dimension \(D{\gt}0\), is normal, and \(L{\gt}0\), and we have:

  1. a word \(w_0\) of length \(L\) with eigenvector \(A^{w_0}\varphi =\mu \varphi \) (\(\mu \neq 0\), \(\varphi \neq 0\)),

  2. a word \(\tau _0\) of length \(L\) with transpose eigenvector \((A^{\tau _0})^T\psi =\nu \psi \) (\(\nu \neq 0\), \(\psi \neq 0\)),

  3. a rank-one element \(\varphi \psi ^T\in S_m(A^{[L]})\) for some \(m\).

Then there exists \(N\) such that \(S_N(A)=M_{D}(\mathbb {C})\).

Remark. The proof gives the explicit bound \(N=((D{-}1)+m+(D{-}1))L\); the theorem states only the existential conclusion.

Proof

Set \(B=A^{[L]}\), which is normal by Theorem D.4.1. The word eigenvectors transfer to single-index eigenvectors of \(B\) and \(B^T\) by Theorem D.4.3. Eigenvector spreading and padding then give \(H_{D-1}(B,\varphi )=H_{D-1}(B^T,\psi )=\mathbb {C}^D\).

For each standard basis vector \(e_j\), choose \(R_j\in S_{D-1}(B^T)\) with \(R_j\psi =e_j\). Reversing each word after transposition shows that \(R_j^T\in S_{D-1}(B)\), and therefore \((\varphi \psi ^T)R_j^T=\varphi e_j^T\) belongs to \(S_{m+D-1}(B)\). Theorem 8.5.2, applied with \(n=D-1\) and \(m'=m+D-1\), now gives \(S_{(D-1)+m+(D-1)}(B)=M_{D}(\mathbb {C})\). Finally, Lemma 8.5.3 transfers this identity to \(S_{((D-1)+m+(D-1))L}(A)=M_{D}(\mathbb {C})\).

Theorem D.4.5 Rank-one extraction for blocked tensor

Suppose \(A\) has bond dimension \(D{\gt}0\), is normal, and \(N_0\ge 1\) with \(S_{N_0}(A)=M_{D}(\mathbb {C})\). Then there exist words \(\sigma _0,\tau _0\) of length \(N_0\), nonzero vectors \(\varphi ,\psi \), nonzero scalars \(\mu ,\nu \), and \(m\in \mathbb {N}\) such that:

  1. \(A^{\sigma _0}\varphi =\mu \varphi \),

  2. \((A^{\tau _0})^T\psi =\nu \psi \),

  3. \(\varphi \psi ^T\in S_m(A^{[N_0]})\).

Proof

Set \(B=A^{[N_0]}\). By (??) and \(S_{N_0}(A)=M_{D}(\mathbb {C})\), one has \(S_1(B)=M_{D}(\mathbb {C})\). Hence \(\mathbb {1}\in S_1(B)\), so not all blocked generators can have trace zero. Choose \(j_0\) with \(\operatorname{tr}(B^{j_0})\neq 0\). By Theorem D.2.9, \(B^{j_0}\) has a nonzero eigenvector \(\varphi \) with eigenvalue \(\mu \neq 0\). Writing \(j_0\) as the blocked index corresponding to a word \(\sigma _0\) of length \(N_0\) gives \(A^{\sigma _0}\varphi =\mu \varphi \). Applying the same argument to the transpose blocked tensor gives a word \(\tau _0\) of length \(N_0\), a nonzero vector \(\psi \), and \(\nu \neq 0\) with \((A^{\tau _0})^T\psi =\nu \psi \). Since \(A\) is normal and \(N_0\ge 1\), the blocked tensor \(B\) is normal by Theorem D.4.1. Therefore there exists \(M\) with \(S_M(B)=M_{D}(\mathbb {C})\). In particular, \(\varphi \psi ^T\in S_M(B)\). Taking \(m=M\) proves (3).

Theorem D.4.6 Fixed-length word-span saturation via blocking

If \(A\) is a normal MPS tensor with bond dimension \(D{\gt}0\), then there exists \(N\) such that \(S_N(A)=M_{D}(\mathbb {C})\). This is a blocked fixed-length construction under the stated normality hypothesis. The quantitative result of [ SPGWC10 , Lemma 2(b) ] is Theorem 8.4.5.

Proof

By normality, some \(N_0{\gt}0\) has \(S_{N_0}(A)=M_{D}(\mathbb {C})\). Theorem D.4.5 produces eigenvectors and a rank-one element \(\varphi \psi ^T\in S_m(A^{[N_0]})\). Theorem D.4.4 then gives \(S_{((D-1)+m+(D-1))N_0}(A)=M_{D}(\mathbb {C})\).

D.5 Complementary-gap consequences

This section proves the complementary-gap consequences used in Lemma 8.7.2.1, Lemma 8.7.4.1, and Theorem 8.7.4.2.

Theorem D.5.1 Primitive overlap convergence

If \(A\) is a primitive MPS tensor, then \(O_{AA}(N)\to 1\).

Proof

The claim follows from the self-overlap convergence under a complementary transfer-map gap (Theorem 7.11.2).

Theorem D.5.2 Peripheral primitivity and irreducibility give normalized overlap

Let \(A\) have positive bond dimension and satisfy \(\sum _i(A^i)^\dagger A^i=\mathbb {1}\). If \(A\) is tensor-irreducible and the transfer map is primitive, then \(O_{AA}(N)\to 1\).

Proof

Irreducible Perron–Frobenius theory supplies a nonzero positive fixed point. Peripheral primitivity gives a strict spectral-radius bound on the complementary transfer map. Thus \(A\) is a primitive MPS tensor, and Theorem D.5.1 applies.

Lemma D.5.3 Primitive MPS tensors have nonzero word products

If \(A\) is a primitive MPS tensor, then for every \(n\ge 0\) there exists a word \(w\) of length exactly \(n\) with \(A^w\neq 0\).

Proof

The PSD fixed point \(\rho \) of \(\mathcal{E}_A\) satisfies \(\mathcal{E}_A^n(\rho )=\rho \neq 0\). Since \(\mathcal{E}_A^n(\rho )=\sum _{|w|=n}A^w\rho (A^w)^\dagger \), at least one summand is nonzero, hence some \(A^w\neq 0\).

Lemma D.5.4 Iterated transfer does not vanish

If \(A\) is a primitive MPS tensor, then \(\mathcal{E}_A^n\neq 0\) for all \(n\ge 0\).

Proof

By Lemma D.5.3, there exists a word \(w\) of length \(n\) with \(A^w\neq 0\). The expansion \(\mathcal{E}_A^n(\mathbb {1})=\sum _{|u|=n}A^u(A^u)^\dagger \) contains the nonzero positive semidefinite summand \(A^w(A^w)^\dagger \), so \(\mathcal{E}_A^n(\mathbb {1})\neq 0\).

Lemma D.5.5 Fixed-point uniqueness from a complementary transfer-map gap

If \(A\) is a primitive MPS tensor with PSD fixed point \(\rho \), then every fixed point \(\sigma \) of \(\mathcal{E}_A\) is proportional to \(\rho \): \(\sigma =\frac{\operatorname{tr}(\sigma )}{\operatorname{tr}(\rho )}\rho \).

Proof

Set \(\sigma '=\sigma -\frac{\operatorname{tr}(\sigma )}{\operatorname{tr}(\rho )}\rho \). Then \(\operatorname{tr}(\sigma ')=0\) and \((\mathcal{E}_A-P_\rho )(\sigma ')=\sigma '\). If \(\sigma '\neq 0\), then \(1\) is an eigenvalue of \(\mathcal{E}_A-P_\rho \), contradicting the complementary transfer-map gap \(\rho _{\operatorname{spec}}(\mathcal{E}_A-P_\rho ){\lt}1\).

Lemma D.5.6 Complement powers tend to zero

If \(A\) is a primitive MPS tensor with PSD fixed point \(\rho \), then \((\mathcal{E}_A-P_\rho )^n\to 0\) in operator norm.

Proof

The spectral radius of \(\mathcal{E}_A-P_\rho \) is strictly less than \(1\) by the complementary transfer-map gap hypothesis. Apply the general result that powers of an operator with spectral radius \({\lt}1\) tend to zero.

Lemma D.5.7 Primitive tensors with positive-definite fixed point have irreducible transfer map

If \(A\) is a primitive MPS tensor with positive-definite fixed point \(\rho \), then the transfer map \(\mathcal{E}_A\) is irreducible.

The proof uses fixed-point uniqueness (Lemma D.5.5): every PSD fixed point is proportional to \(\rho \), so Wolf’s criterion for irreducibility (a positive-definite fixed point together with uniqueness of positive fixed points implies irreducibility) applies directly.

Proof

By Lemma D.5.5, if \(\sigma \ge 0\) and \(\mathcal{E}_A(\sigma )=\sigma \), then \(\sigma =\frac{\operatorname{tr}(\sigma )}{\operatorname{tr}(\rho )}\rho \). Since \(\rho {\gt}0\), Wolf’s uniqueness criterion for irreducibility applies.

D.6 Identity in the one-step span

This section proves the one-step padding conversions used in Theorem 8.8.2. It also records why cumulative spanning alone does not imply normality.

Remark D.6.1 Identity-in-the-one-step-span condition
#

The one-step padding condition is \(\mathbb {1}\in S_1(A)\): the identity matrix lies in the span of the Kraus operators \(\{ A^i\} _{i=0}^{d-1}\). This is an additional hypothesis. The normalization \(\sum _i(A^i)^\dagger A^i=\mathbb {1}\) gives a quadratic identity and does not imply \(\mathbb {1}\in S_1(A)\). Theorem 8.7.4.2 obtains normality from a positive-definite fixed point and a complementary gap without this padding condition.

Remark D.6.2 Counterexample: cumulative spanning does not imply normality
#

In \(M_{2}(\mathbb {C})\), let \(A^0=E_{12}\) and \(A^1=E_{21}\) be the off-diagonal matrix units. Then \(\operatorname{alg}(A)=M_{2}(\mathbb {C})\) and \(T_2(A)=M_{2}(\mathbb {C})\), but the word spans alternate: \(S_n(A)\) contains only off-diagonal matrices for odd \(n\) and only diagonal matrices for even \(n\). Hence \(S_n(A)\neq M_{2}(\mathbb {C})\) for every \(n\), and \(A\) is not normal. The one-step padding condition fails because \(\mathbb {1}\notin S_1(A)=\operatorname{span}_{\mathbb {C}}\{ E_{12},E_{21}\} \).

Theorem D.6.3 Word-span monotonicity from one-step padding

If \(\mathbb {1}\in S_1(A)\), then \(S_n(A)\le S_{n+1}(A)\) for every \(n\).

Proof

For any \(M\in S_n(A)\), one has \(M=M\mathbb {1}\in S_n(A)S_1(A)\subseteq S_{n+1}(A)\) by Lemma D.1.1.

Theorem D.6.4 Cumulative span equals word span under one-step padding

If \(\mathbb {1}\in S_1(A)\), then \(T_n(A)=S_n(A)\) for every \(n\).

Proof

By Theorem D.6.3, the word spans form the chain \(S_0(A)\le S_1(A)\le \cdots \le S_n(A)\). Therefore their sum \(T_n(A)=S_0(A)+\cdots +S_n(A)\) equals the largest term \(S_n(A)\).

Theorem D.6.5 Cumulative spanning plus one-step padding implies normality

If \(T_N(A)=M_{D}(\mathbb {C})\) and \(\mathbb {1}\in S_1(A)\), then \(A\) is normal.

Proof

Theorem D.6.4 gives \(S_N(A)=T_N(A)=M_{D}(\mathbb {C})\).