Partial inverse of a matrix

This article is about the partial inverse of a matrix. For the partial inverse of a function, see Inverse function § Partial inverses.

Definition

In linear algebra and statistics, the partial inverse of a matrix is an operation related to Gaussian elimination which has applications in numerical analysis, statistics and physics. It is also known by various authors as the principal pivot transform, or as the sweep, gyration, or exchange operator, represented by ${\displaystyle \mathrm {inv} _{k}}$ if restricted to blocks along the main diagonal, or by ${\displaystyle {\hat {Y}}_{k\ell }}$ if considering the general case of any arbitrary block from the matrix. ^[1]

Given an ${\displaystyle n\times n}$ matrix ${\displaystyle A}$ over a vector space ${\displaystyle V}$ partitioned into blocks:

${\displaystyle A={\begin{pmatrix}A_{11}&A_{12}\\A_{21}&A_{22}\end{pmatrix}}}$

If ${\displaystyle A_{11}}$ is invertible, then the partial inverse of ${\displaystyle A}$ around the pivot block${\displaystyle A_{11}}$ is created by inverting ${\displaystyle A_{11}}$, putting the Schur complement ${\displaystyle A/A_{11}}$ in place of ${\displaystyle A_{22}}$, and adjusting the off-diagonal elements accordingly: ^[2]

${\displaystyle \operatorname {inv} _{1}A={\begin{pmatrix}(A_{11})^{-1}&-(A_{11})^{-1}A_{12}\\A_{21}(A_{11})^{-1}&A_{22}-A_{21}(A_{11})^{-1}A_{12}\end{pmatrix}}}$

Conceptually, partial inversion corresponds to a rotation ^[3] of the graph of the matrix ${\displaystyle (X,AX)\in V\times V}$, such that, for conformally-partitioned column matrices ${\displaystyle (x_{1},x_{2})^{T}}$ and ${\displaystyle (y_{1},y_{2})^{T}}$: ^[2]

${\displaystyle A{\begin{pmatrix}x_{1}\\x_{2}\end{pmatrix}}={\begin{pmatrix}y_{1}\\y_{2}\end{pmatrix}}\Leftrightarrow \operatorname {inv} _{1}(A){\begin{pmatrix}y_{1}\\x_{2}\end{pmatrix}}={\begin{pmatrix}x_{1}\\y_{2}\end{pmatrix}}}$

As defined this way, this operator is its own inverse: ${\displaystyle \operatorname {inv} _{k}(\operatorname {inv} _{k}(A))=A}$, and if the pivot block ${\displaystyle A_{11}}$ is chosen to be the entire matrix, then the transform simply gives the matrix inverse ${\displaystyle A^{-1}}$. Note that some authors define a related operation (under one of the other names) which is not an inverse per se; particularly, one common definition instead has ${\displaystyle (\operatorname {inv} _{k})^{2}(A)=-A}$.

The transform is often presented as a pivot around a single non-zero element ${\displaystyle a_{kk}}$, in which case one has

${\displaystyle \left[\operatorname {inv} _{k}(A)\right]_{ij}={\begin{cases}{\frac {1}{a_{kk}}}&i=j=k\\-{\frac {a_{kj}}{a_{kk}}}&i=k,j\neq k\\{\frac {a_{ik}}{a_{kk}}}&i\neq k,j=k\\a_{ij}-{\frac {a_{ik}a_{kj}}{a_{kk}}}&i\neq k,j\neq k\end{cases}}}$

Properties

Restricted Partial Inversion

Restricted partial inverses obey a number of nice properties: ^[4]

• inversions around different blocks commute, so larger pivots may be built up from sequences of smaller ones.
• partial inversion preserves the space of symmetric matrices.
• partial inversion over a block of size 1 along the main diagonal of a matrix can be expressed in terms of a composition of an identity operator, a commutator operator and a special commutator that resembles the Yang-Baxter equation. ^[1]

General Partial Inversion

The general partial inversion group ${\displaystyle Z(n)}$ of generators ${\displaystyle {\hat {Y}}_{k\ell }}$ that act on objects of size ${\displaystyle n}$ is a non-Abelian group, since it is a composition of the symmetric group ${\displaystyle S(n)}$, which is non-Abelian, with the restricted partial inversion group ${\displaystyle V(n)}$ (which is Abelian) . ^[1] ${\displaystyle Z(n)}$ admits representations of the dihedral group and the unitary group.

${\displaystyle Z(n)=V(n)\times S(n)}$

Commutators

It was suggested in ^[1] that a composition ${\displaystyle {\hat {Y}}_{ik}{\hat {Y}}_{j\ell }}$ only commutes if their row indices are different and their column indices are also different:

${\displaystyle {\text{[}}{\hat {Y}}_{ik},{\hat {Y}}_{j\ell }{\text{]}}=0\quad {\text{iff}}\quad i\neq j\quad \mathrm {and} \quad k\neq \ell .}$

The Yang-Baxter equation ${\displaystyle ABA=BAB}$ occurs as a constraint ^[1] of generators of ${\displaystyle Z(n)}$, by introducing the substitutions

${\displaystyle {\begin{aligned}A={\hat {Y}}_{i-1,i},\\B={\hat {Y}}_{i+1,i}.\end{aligned}}}$

Dihedral Group Representation

Compositions of matrix inverse along the main diagonal, ${\displaystyle {\hat {y}}_{1}}$ and a generalized inverse along the secondary diagonal ${\displaystyle {\hat {y}}_{2}}$ form a representation of the dihedral group, ${\displaystyle D(n)}$:

${\displaystyle {\begin{aligned}{\hat {y}}_{1}&=\prod _{k=1}^{n}\mathrm {inv} _{k},\\{\hat {y}}_{2}&=\prod _{k=1}^{n}{\hat {Y}}_{k,n-k+1},\\{\hat {y}}_{3}&:={\hat {y}}_{1}{\hat {y}}_{2}={\hat {J}},\\{\text{[}}{\hat {y}}_{k},\,{\hat {y}}_{\ell }{\text{]}}&=0,\quad \mathrm {with} \quad k,\ell \in \{1,2,3\},\end{aligned}}}$

where ${\displaystyle {\hat {J}}}$ is a similarity transformation made of the reverse permutation matrix.

In three dimensions, the dihedral group ${\displaystyle D(3)}$ over a matrix ${\displaystyle M}$ is represented in terms of the identity ${\displaystyle {\hat {I}}}$ operator and the generators ${\displaystyle {\hat {y}}_{1},{\hat {y}}_{2},{\hat {y}}_{3}}$ as

${\displaystyle {\begin{aligned}{\hat {I}}M&=M,\\{\hat {y}}_{1}M&=\mathrm {inv} _{3}\,\mathrm {inv} _{2}\,\mathrm {inv} _{1}M={\hat {Y}}_{33}{\hat {Y}}_{22}{\hat {Y}}_{11}M,\\{\hat {y}}_{2}M&={\hat {Y}}_{31}{\hat {Y}}_{22}{\hat {Y}}_{13}M,\\{\hat {y}}_{3}M&={\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix}}M{\begin{pmatrix}0&0&1\\0&1&0\\1&0&0\end{pmatrix}}.\end{aligned}}}$

Additional Properties

• A sequence of partial inversions and matrix powers defines the graph operation of Renormalized Growth, ^[1] where the dimension of the matrix is kept constant, while the graph that represents it is interpreted to grow.

Applications

Physics

In S-matrix theory and pseudo-unitary quantum mechanics, partial inversion is used to map S-matrices to T-matrices, and, consequently, unitary matrices to Z-pseudo-unitary matrices. ^[1]

Numerical Analysis

Use of the partial inverse in numerical analysis is due to the fact that there is some flexibility in the choices of pivots, allowing for non-invertible elements to be avoided, and because the operation of rotation (of the graph of the pivoted matrix) has better numerical stability than the shearing operation which is implicitly performed by Gaussian elimination. ^[3] Use in statistics is due to the fact that the resulting matrix nicely decomposes into blocks which have useful meanings in the context of linear regression. ^[4]

References

1. Lima, Dennis; Al-Kuwari, Saif (2024). "Unitarization of pseudo-unitary quantum circuits in the S-matrix framework". Physica Scripta. 99 (4): 045202. doi:10.1088/1402-4896/ad28f7.
2. Tsatsomeros, M. J. (2000). Principal pivot transforms: properties and applications. Linear Algebra and its Applications, 307 (1-3), 151–165.
3. Sweeping a matrix rotates its graph,
4. Exceedingly Simple Principal Pivot Transforms