SearcharxivSearch

arXiv · 1912.05948

Reverse order laws for generalized inverses of products of two or three matrices with applications

Abstract

One of the fundamental research problems in the theory of generalized inverses of matrices is to establish reverse order laws for generalized inverses of matrix products. Under the assumption that $A$, $B$, and $C$ are three nonsingular matrices of the same size, the products $AB$ and $ABC$ are nonsingular as well, and the inverses of $AB$ and $ABC$ admit the reverse order laws $(AB)^{-1} = B^{-1} A^{-1}$ and $(ABC)^{-1} = C^{-1}B^{-1}A^{-1}$, respectively. If some or all of $A$, $B$, and $C$ are singular, two extensions of the above reverse order laws to generalized inverses can be written as $(AB)^{(i,\ldots,j)} = B^{(i_2,\ldots,j_2)} A^{(i_1,\ldots,j_1)}$ and $(ABC)^{(i,\ldots,j)} = C^{(i_3,\ldots,j_3)} B^{(i_2,\ldots,j_2)}A^{(i_1,\ldots,j_1)}$, or other mixed reverse order laws. These equalities do not necessarily hold for different choices of generalized inverses of the matrices. Thus it is a tremendous work to classify and derive necessary and sufficient conditions for the reverse order law to hold because there are all 15 types of $\{i,\ldots, j\}$-generalized inverse for a given matrix according to combinatoric choices of the four Penrose equations. In this paper, we first establish several decades of mixed reverse order laws for $\{1\}$- and $\{1,2\}$-generalized inverses of $AB$ and $ABC$. We then give a classified investigation to a special family of reverse order laws $(ABC)^{(i,\ldots,j)} = C^{-1}B^{(k,\ldots,l)}A^{-1}$ for the eight commonly-used types of generalized inverses using definitions, formulas for ranges and ranks of matrices, as well as conventional operations of matrices. Furthermore, the special cases $(ABA^{-1})^{(i,\ldots,j)} = AB^{(k,\ldots,l)}A^{-1}$ are addressed and some applications are presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Yongge Tian. 2019-12-10. Reverse order laws for generalized inverses of products of two or three matrices with applications. https://arxiv.org/abs/1912.05948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM