Neumann series

Mathematical series

A Neumann series is a mathematical series of the form

∑ k = 0 ∞ T k {\displaystyle \sum _{k=0}^{\infty }T^{k}}

where  T {\displaystyle T} is an operator and  T k := T k − 1 ∘ T {\displaystyle T^{k}:={}T^{k-1}\circ {T}} its  k {\displaystyle k} times repeated application. This generalizes the geometric series.

The series is named after the mathematician Carl Neumann, who used it in 1877 in the context of potential theory. The Neumann series is used in functional analysis. It forms the basis of the Liouville-Neumann series, which is used to solve Fredholm integral equations. It is also important when studying the spectrum of bounded operators.

## Properties[edit]

Suppose that  T {\displaystyle T} is a bounded linear operator on the normed vector space X {\displaystyle X} . If the Neumann series converges in the operator norm, then  Id − T {\displaystyle {\text{Id}}-T} is invertible and its inverse is the series:

( I d − T ) − 1 = ∑ k = 0 ∞ T k {\displaystyle (\mathrm {Id} -T)^{-1}=\sum _{k=0}^{\infty }T^{k}} ,

where  I d {\displaystyle \mathrm {Id} } is the identity operator in  X {\displaystyle X} . To see why, consider the partial sums

S n := ∑ k = 0 n T k {\displaystyle S_{n}:=\sum _{k=0}^{n}T^{k}} .

Then we have

lim n -> ∞ ( I d − T ) S n = lim n -> ∞ ( ∑ k = 0 n T k − ∑ k = 0 n T k + 1 ) = lim n -> ∞ ( I d − T n + 1 ) = I d . {\displaystyle \lim _{n\rightarrow \infty }(\mathrm {Id} -T)S_{n}=\lim _{n\rightarrow \infty }\left(\sum _{k=0}^{n}T^{k}-\sum _{k=0}^{n}T^{k+1}\right)=\lim _{n\rightarrow \infty }\left(\mathrm {Id} -T^{n+1}\right)=\mathrm {Id} .}

This result on operators is analogous to geometric series in  R {\displaystyle \mathbb {R} } , in which we find that:

( 1 − x ) ⋅ ( 1 + x + x 2 + ⋯ + x n − 1 + x n ) = 1 − x n + 1 , {\displaystyle (1-x)\cdot (1+x+x^{2}+\cdots +x^{n-1}+x^{n})=1-x^{n+1},}
1 + x + x 2 + ⋯ = 1 1 − x . {\displaystyle 1+x+x^{2}+\cdots ={\frac {1}{1-x}}.}

One case in which convergence is guaranteed is when  X {\displaystyle X} is a Banach space and  | T | < 1 {\displaystyle |T|<1} in the operator norm or  ∑ | T n | {\displaystyle \sum |T^{n}|} is convergent. However, there are also results which give weaker conditions under which the series converges.

## Example[edit]

Let  C ∈ R 3 × 3 {\displaystyle C\in \mathbb {R} ^{3\times 3}} be given by:

( 0 1 2 1 4 5 7 0 1 7 3 10 3 5 0 ) . {\displaystyle {\begin{pmatrix}0&{\frac {1}{2}}&{\frac {1}{4}}\\\\{\frac {5}{7}}&0&{\frac {1}{7}}\\\\{\frac {3}{10}}&{\frac {3}{5}}&0\end{pmatrix}}.}

We need to show that C is smaller than unity in some norm. Therefore, we calculate:

| | C | | ∞ = max i ∑ j | c i j | = max { 3 4 , 6 7 , 9 10 } = 9 10 < 1. {\displaystyle {\begin{aligned}||C||_{\infty }&=\max _{i}\sum _{j}|c_{ij}|=\max \left\lbrace {\frac {3}{4}},{\frac {6}{7}},{\frac {9}{10}}\right\rbrace ={\frac {9}{10}}<1.\end{aligned}}}

Thus, we know from the statement above that  ( I − C ) − 1 {\displaystyle (I-C)^{-1}} exists.

## Approximate matrix inversion[edit]

A truncated Neumann series can be used for approximate matrix inversion. To approximate the inverse of an invertible matrix  A {\displaystyle \mathbf {A} } , we can assign the linear operator as:

T ( x ) = ( I − A ) x {\displaystyle T(\mathbf {x} )=(\mathbf {I} -\mathbf {A} )\mathbf {x} }

where  I {\displaystyle \mathbf {I} } is the identity matrix. If the norm condition on  T {\displaystyle T} is satisfied, then truncating the series at  n {\displaystyle n} , we get:

A − 1 ≈ ∑ i = 0 n ( I − A ) i {\displaystyle \mathbf {A} ^{-1}\approx \sum _{i=0}^{n}(\mathbf {I} -\mathbf {A} )^{i}}

## The set of invertible operators is open[edit]

A corollary is that the set of invertible operators between two Banach spaces  B {\displaystyle B} and  B ′ {\displaystyle B'} is open in the topology induced by the operator norm. Indeed, let  S : B -> B ′ {\displaystyle S:B\to B'} be an invertible operator and let  T : B -> B ′ {\displaystyle T:B\to B'} be another operator. If  | S − T | < | S − 1 | − 1 {\displaystyle |S-T|<|S^{-1}|^{-1}} , then  T {\displaystyle T} is also invertible. Since  | I d − S − 1 T | < 1 {\displaystyle |\mathrm {Id} -S^{-1}T|<1} , the Neumann series  ∑ ( I d − S − 1 T ) k {\displaystyle \sum (\mathrm {Id} -S^{-1}T)^{k}} is convergent. Therefore, we have

T − 1 S = ( I d − ( I d − S − 1 T ) ) − 1 = ∑ k = 0 ∞ ( I d − S − 1 T ) k {\displaystyle T^{-1}S=(\mathrm {Id} -(\mathrm {Id} -S^{-1}T))^{-1}=\sum _{k=0}^{\infty }(\mathrm {Id} -S^{-1}T)^{k}}

Taking the norms, we get

| T − 1 S | ≤ 1 1 − | I d − ( S − 1 T ) | {\displaystyle |T^{-1}S|\leq {\frac {1}{1-|\mathrm {Id} -(S^{-1}T)|}}}

The norm of  T − 1 {\displaystyle T^{-1}} can be bounded by

| T − 1 | ≤ 1 1 − q | S − 1 | where q = | S − T | | S − 1 | . {\displaystyle |T^{-1}|\leq {\tfrac {1}{1-q}}|S^{-1}|\quad {\text{where}}\quad q=|S-T|\,|S^{-1}|.}

## Applications[edit]

The Neumann series has been used for linear data detection in massive multiuser multiple-input multiple-output (MIMO) wireless systems. Using a truncated Neumann series avoids computation of an explicit matrix inverse, which reduces the complexity of linear data detection from cubic to square.[1]

Another application is the theory of Propagation graphs which takes advantage of Neumann series to derive closed form expression for the transfer function.

## References[edit]

1. ^ Wu, M.; Yin, B.; Vosoughi, A.; Studer, C.; Cavallaro, J. R.; Dick, C. (May 2013). "Approximate matrix inversion for high-throughput data detection in the large-scale MIMO uplink". 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013). pp. 2155–2158. doi:10.1109/ISCAS.2013.6572301. hdl:1911/75011. ISBN 978-1-4673-5762-3. S2CID 389966.

* Werner, Dirk (2005). Funktionalanalysis (in German). Springer Verlag. ISBN 3-540-43586-7.