Generalized inverse

<h2 id="motivation">Motivation</h2>
Consider the <a href="/facts/System_of_linear_equations/fk9CFdgp">linear system</a>

A
        x
        =
        y
      
    
    {\displaystyle Ax=y}

where 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is an 
 
 
 
 m
 ×
 n
 
 
 {\displaystyle m\times n}
 
 matrix and 
 
 
 
 y
 ∈
 
 
 C
 
 
 (
 A
 )
 ,
 
 
 {\displaystyle y\in {\mathcal {C}}(A),}
 
 the <a href="/facts/Column_space/INXbQVNI">column space</a> of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. If 
 
 
 
 m
 =
 n
 
 
 {\displaystyle m=n}
 
 and 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is <a href="/facts/Invertible_matrix/fPqXk3V8">nonsingular</a> then 
 
 
 
 x
 =
 
 A
 
 −
 1
 
 
 y
 
 
 {\displaystyle x=A^{-1}y}
 
 will be the solution of the system. Note that, if 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is nonsingular, then

A
        
          A
          
            −
            1
          
        
        A
        =
        A
        .
      
    
    {\displaystyle AA^{-1}A=A.}

Now suppose 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is rectangular (
 
 
 
 m
 ≠
 n
 
 
 {\displaystyle m\neq n}
 
), or square and singular. Then we need a right candidate 
 
 
 
 G
 
 
 {\displaystyle G}
 
 of order 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 such that for all 
 
 
 
 y
 ∈
 
 
 C
 
 
 (
 A
 )
 ,
 
 
 {\displaystyle y\in {\mathcal {C}}(A),}

A
 G
 y
 =
 y
 .
 
 
 {\displaystyle AGy=y.}
 
<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a>
That is, 
 
 
 
 x
 =
 G
 y
 
 
 {\displaystyle x=Gy}
 
 is a solution of the linear system 
 
 
 
 A
 x
 =
 y
 
 
 {\displaystyle Ax=y}
 
. 
Equivalently, we need a matrix 
 
 
 
 G
 
 
 {\displaystyle G}
 
 of order 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 such that

A
        G
        A
        =
        A
        .
      
    
    {\displaystyle AGA=A.}

Hence we can define the generalized inverse as follows: Given an 
 
 
 
 m
 ×
 n
 
 
 {\displaystyle m\times n}
 
 matrix 
 
 
 
 A
 
 
 {\displaystyle A}
 
, an 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 matrix 
 
 
 
 G
 
 
 {\displaystyle G}
 
 is said to be a generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 if 
 
 
 
 A
 G
 A
 =
 A
 .
 
 
 {\displaystyle AGA=A.}
 
‍<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a><a class="footnote-ref" id="fnref:7" href="#fn:7">7</a><a class="footnote-ref" id="fnref:8" href="#fn:8">8</a> The matrix 
 
 
 
 
 A
 
 −
 1
 
 
 
 
 {\displaystyle A^{-1}}
 
 has been termed a regular inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 by some authors.<a class="footnote-ref" id="fnref:9" href="#fn:9">9</a>

<h2 id="types">Types</h2>
Important types of generalized inverse include:

<ul><li><a href="/facts/One-sided_inverse/CwMygHSj">One-sided inverse</a> (right inverse or left inverse)
<ul><li>Right inverse: If the matrix 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has dimensions 
 
 
 
 m
 ×
 n
 
 
 {\displaystyle m\times n}
 
 and 
 
 
 
 
 
 rank
 
 
 (
 A
 )
 =
 m
 
 
 {\displaystyle {\textrm {rank}}(A)=m}
 
, then there exists an 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 matrix 
 
 
 
 
 A
 
 
 R
 
 
 
 −
 1
 
 
 
 
 {\displaystyle A_{\mathrm {R} }^{-1}}
 
 called the right inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 such that 
 
 
 
 A
 
 A
 
 
 R
 
 
 
 −
 1
 
 
 =
 
 I
 
 m
 
 
 
 
 {\displaystyle AA_{\mathrm {R} }^{-1}=I_{m}}
 
, where 
 
 
 
 
 I
 
 m
 
 
 
 
 {\displaystyle I_{m}}
 
 is the 
 
 
 
 m
 ×
 m
 
 
 {\displaystyle m\times m}
 
 <a href="/facts/Identity_matrix/Glbcf6ol">identity matrix</a>.</li>
<li>Left inverse: If the matrix 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has dimensions 
 
 
 
 m
 ×
 n
 
 
 {\displaystyle m\times n}
 
 and 
 
 
 
 
 
 rank
 
 
 (
 A
 )
 =
 n
 
 
 {\displaystyle {\textrm {rank}}(A)=n}
 
, then there exists an 
 
 
 
 n
 ×
 m
 
 
 {\displaystyle n\times m}
 
 matrix 
 
 
 
 
 A
 
 
 L
 
 
 
 −
 1
 
 
 
 
 {\displaystyle A_{\mathrm {L} }^{-1}}
 
 called the left inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 such that 
 
 
 
 
 A
 
 
 L
 
 
 
 −
 1
 
 
 A
 =
 
 I
 
 n
 
 
 
 
 {\displaystyle A_{\mathrm {L} }^{-1}A=I_{n}}
 
, where 
 
 
 
 
 I
 
 n
 
 
 
 
 {\displaystyle I_{n}}
 
 is the 
 
 
 
 n
 ×
 n
 
 
 {\displaystyle n\times n}
 
 identity matrix.<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a></li></ul></li>
<li><a href="/facts/Bott%25E2%2580%2593Duffin_inverse/pzyRe6Mq">Bott–Duffin inverse</a></li>
<li><a href="/facts/Drazin_inverse/AYl1kzeH">Drazin inverse</a></li>
<li><a href="/facts/Moore%25E2%2580%2593Penrose_inverse/CU73tntq">Moore–Penrose inverse</a></li></ul>
Some generalized inverses are defined and classified based on the Penrose conditions:

<ol><li>
 
 
 
 A
 
 A
 
 
 g
 
 
 
 A
 =
 A
 
 
 {\displaystyle AA^{\mathrm {g} }A=A}
 
</li>
<li>
 
 
 
 
 A
 
 
 g
 
 
 
 A
 
 A
 
 
 g
 
 
 
 =
 
 A
 
 
 g
 
 
 
 
 
 {\displaystyle A^{\mathrm {g} }AA^{\mathrm {g} }=A^{\mathrm {g} }}
 
</li>
<li>
 
 
 
 (
 A
 
 A
 
 
 g
 
 
 
 
 )
 
 ∗
 
 
 =
 A
 
 A
 
 
 g
 
 
 
 
 
 {\displaystyle (AA^{\mathrm {g} })^{*}=AA^{\mathrm {g} }}
 
</li>
<li>
 
 
 
 (
 
 A
 
 
 g
 
 
 
 A
 
 )
 
 ∗
 
 
 =
 
 A
 
 
 g
 
 
 
 A
 ,
 
 
 {\displaystyle (A^{\mathrm {g} }A)^{*}=A^{\mathrm {g} }A,}
 
</li></ol>
where

∗
 
 
 
 
 {\displaystyle {}^{*}}
 
 denotes conjugate transpose. If 
 
 
 
 
 A
 
 
 g
 
 
 
 
 
 {\displaystyle A^{\mathrm {g} }}
 
 satisfies the first condition, then it is a generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. If it satisfies the first two conditions, then it is a reflexive generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. If it satisfies all four conditions, then it is the pseudoinverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
, which is denoted by 
 
 
 
 
 A
 
 +
 
 
 
 
 {\displaystyle A^{+}}
 
 and also known as the Moore–Penrose inverse, after the pioneering works by <a href="/facts/E._H._Moore/1lJXH5jn">E. H. Moore</a> and <a href="/facts/Roger_Penrose/r4mlrFUH">Roger Penrose</a>.<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a><a class="footnote-ref" id="fnref:12" href="#fn:12">12</a><a class="footnote-ref" id="fnref:13" href="#fn:13">13</a><a class="footnote-ref" id="fnref:14" href="#fn:14">14</a><a class="footnote-ref" id="fnref:15" href="#fn:15">15</a><a class="footnote-ref" id="fnref:16" href="#fn:16">16</a> It is convenient to define an 
 
 
 
 I
 
 
 {\displaystyle I}
 
-inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 as an inverse that satisfies the subset 
 
 
 
 I
 ⊂
 {
 1
 ,
 2
 ,
 3
 ,
 4
 }
 
 
 {\displaystyle I\subset \{1,2,3,4\}}
 
 of the Penrose conditions listed above. Relations, such as 
 
 
 
 
 A
 
 (
 1
 ,
 4
 )
 
 
 A
 
 A
 
 (
 1
 ,
 3
 )
 
 
 =
 
 A
 
 +
 
 
 
 
 {\displaystyle A^{(1,4)}AA^{(1,3)}=A^{+}}
 
, can be established between these different classes of 
 
 
 
 I
 
 
 {\displaystyle I}
 
-inverses.<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a>
When 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is non-singular, any generalized inverse 
 
 
 
 
 A
 
 
 g
 
 
 
 =
 
 A
 
 −
 1
 
 
 
 
 {\displaystyle A^{\mathrm {g} }=A^{-1}}
 
 and is therefore unique. For a singular 
 
 
 
 A
 
 
 {\displaystyle A}
 
, some generalised inverses, such as the Drazin inverse and the Moore–Penrose inverse, are unique, while others are not necessarily uniquely defined.

<h2 id="examples">Examples</h2>
<h3>Reflexive generalized inverse</h3>
Let

A
        =
        
          
            [
            
              
                
                  1
                
                
                  2
                
                
                  3
                
              
              
                
                  4
                
                
                  5
                
                
                  6
                
              
              
                
                  7
                
                
                  8
                
                
                  9
                
              
            
            ]
          
        
        ,
        
        G
        =
        
          
            [
            
              
                
                  −
                  
                    
                      5
                      3
                    
                  
                
                
                  
                    
                      2
                      3
                    
                  
                
                
                  0
                
              
              
                
                  
                    
                      4
                      3
                    
                  
                
                
                  −
                  
                    
                      1
                      3
                    
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  0
                
              
            
            ]
          
        
        .
      
    
    {\displaystyle A={\begin{bmatrix}1&2&3\\4&5&6\\7&8&9\end{bmatrix}},\quad G={\begin{bmatrix}-{\frac {5}{3}}&{\frac {2}{3}}&0\\[4pt]{\frac {4}{3}}&-{\frac {1}{3}}&0\\[4pt]0&0&0\end{bmatrix}}.}

Since 
 
 
 
 det
 (
 A
 )
 =
 0
 
 
 {\displaystyle \det(A)=0}
 
, 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is singular and has no regular inverse. However, 
 
 
 
 A
 
 
 {\displaystyle A}
 
 and 
 
 
 
 G
 
 
 {\displaystyle G}
 
 satisfy Penrose conditions (1) and (2), but not (3) or (4). Hence, 
 
 
 
 G
 
 
 {\displaystyle G}
 
 is a reflexive generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
.

<h3>One-sided inverse</h3>
Let

A
        =
        
          
            [
            
              
                
                  1
                
                
                  2
                
                
                  3
                
              
              
                
                  4
                
                
                  5
                
                
                  6
                
              
            
            ]
          
        
        ,
        
        
          A
          
            
              R
            
          
          
            −
            1
          
        
        =
        
          
            [
            
              
                
                  −
                  
                    
                      17
                      18
                    
                  
                
                
                  
                    
                      8
                      18
                    
                  
                
              
              
                
                  −
                  
                    
                      2
                      18
                    
                  
                
                
                  
                    
                      2
                      18
                    
                  
                
              
              
                
                  
                    
                      13
                      18
                    
                  
                
                
                  −
                  
                    
                      4
                      18
                    
                  
                
              
            
            ]
          
        
        .
      
    
    {\displaystyle A={\begin{bmatrix}1&2&3\\4&5&6\end{bmatrix}},\quad A_{\mathrm {R} }^{-1}={\begin{bmatrix}-{\frac {17}{18}}&{\frac {8}{18}}\\[4pt]-{\frac {2}{18}}&{\frac {2}{18}}\\[4pt]{\frac {13}{18}}&-{\frac {4}{18}}\end{bmatrix}}.}

Since 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is not square, 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has no regular inverse. However, 
 
 
 
 
 A
 
 
 R
 
 
 
 −
 1
 
 
 
 
 {\displaystyle A_{\mathrm {R} }^{-1}}
 
 is a right inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. The matrix 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has no left inverse.

<h3>Inverse of other semigroups (or rings)</h3>
The element b is a generalized inverse of an element a if and only if 
 
 
 
 a
 ⋅
 b
 ⋅
 a
 =
 a
 
 
 {\displaystyle a\cdot b\cdot a=a}
 
, in any semigroup (or <a href="/facts/Ring_(mathematics)/JnCUXz63">ring</a>, since the <a href="/facts/Multiplication/VtcUjpNv">multiplication</a> function in any ring is a semigroup).
The generalized inverses of the element 3 in the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
 are 3, 7, and 11, since in the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
:

3
        ⋅
        3
        ⋅
        3
        =
        3
      
    
    {\displaystyle 3\cdot 3\cdot 3=3}

3
        ⋅
        7
        ⋅
        3
        =
        3
      
    
    {\displaystyle 3\cdot 7\cdot 3=3}

3
        ⋅
        11
        ⋅
        3
        =
        3
      
    
    {\displaystyle 3\cdot 11\cdot 3=3}

The generalized inverses of the element 4 in the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
 are 1, 4, 7, and 10, since in the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
:

4
        ⋅
        1
        ⋅
        4
        =
        4
      
    
    {\displaystyle 4\cdot 1\cdot 4=4}

4
        ⋅
        4
        ⋅
        4
        =
        4
      
    
    {\displaystyle 4\cdot 4\cdot 4=4}

4
        ⋅
        7
        ⋅
        4
        =
        4
      
    
    {\displaystyle 4\cdot 7\cdot 4=4}

4
        ⋅
        10
        ⋅
        4
        =
        4
      
    
    {\displaystyle 4\cdot 10\cdot 4=4}

If an element a in a semigroup (or ring) has an inverse, the inverse must be the only generalized inverse of this element, like the elements 1, 5, 7, and 11 in the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
.
In the ring 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
 any element is a generalized inverse of 0; however 2 has no generalized inverse, since there is no b in 
 
 
 
 
 Z
 
 
 /
 
 12
 
 Z
 
 
 
 {\displaystyle \mathbb {Z} /12\mathbb {Z} }
 
 such that 
 
 
 
 2
 ⋅
 b
 ⋅
 2
 =
 2
 
 
 {\displaystyle 2\cdot b\cdot 2=2}
 
.

<h2 id="construction">Construction</h2>
The following characterizations are easy to verify:

<ul><li>A right inverse of a <a href="/facts/Square_matrix/5TP9mNNn">non-square matrix</a> 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is given by 
 
 
 
 
 A
 
 
 R
 
 
 
 −
 1
 
 
 =
 
 A
 
 ⊺
 
 
 
 
 (
 
 A
 
 A
 
 ⊺
 
 
 
 )
 
 
 −
 1
 
 
 
 
 {\displaystyle A_{\mathrm {R} }^{-1}=A^{\intercal }\left(AA^{\intercal }\right)^{-1}}
 
, provided 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has full row rank.<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a></li>
<li>A left inverse of a non-square matrix 
 
 
 
 A
 
 
 {\displaystyle A}
 
 is given by 
 
 
 
 
 A
 
 
 L
 
 
 
 −
 1
 
 
 =
 
 
 (
 
 
 A
 
 ⊺
 
 
 A
 
 )
 
 
 −
 1
 
 
 
 A
 
 ⊺
 
 
 
 
 {\displaystyle A_{\mathrm {L} }^{-1}=\left(A^{\intercal }A\right)^{-1}A^{\intercal }}
 
, provided 
 
 
 
 A
 
 
 {\displaystyle A}
 
 has full column rank.<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a></li>
<li>If 
 
 
 
 A
 =
 B
 C
 
 
 {\displaystyle A=BC}
 
 is a <a href="/facts/Rank_factorization/7pbe4yfK">rank factorization</a>, then 
 
 
 
 G
 =
 
 C
 
 
 R
 
 
 
 −
 1
 
 
 
 B
 
 
 L
 
 
 
 −
 1
 
 
 
 
 {\displaystyle G=C_{\mathrm {R} }^{-1}B_{\mathrm {L} }^{-1}}
 
 is a g-inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
, where 
 
 
 
 
 C
 
 
 R
 
 
 
 −
 1
 
 
 
 
 {\displaystyle C_{\mathrm {R} }^{-1}}
 
 is a right inverse of 
 
 
 
 C
 
 
 {\displaystyle C}
 
 and 
 
 
 
 
 B
 
 
 L
 
 
 
 −
 1
 
 
 
 
 {\displaystyle B_{\mathrm {L} }^{-1}}
 
 is left inverse of 
 
 
 
 B
 
 
 {\displaystyle B}
 
.</li>
<li>If 
 
 
 
 A
 =
 P
 
 
 [
 
 
 
 
 I
 
 r
 
 
 
 
 0
 
 
 
 
 0
 
 
 0
 
 
 
 ]
 
 
 Q
 
 
 {\displaystyle A=P{\begin{bmatrix}I_{r}&0\\0&0\end{bmatrix}}Q}
 
 for any non-singular matrices 
 
 
 
 P
 
 
 {\displaystyle P}
 
 and 
 
 
 
 Q
 
 
 {\displaystyle Q}
 
, then 
 
 
 
 G
 =
 
 Q
 
 −
 1
 
 
 
 
 [
 
 
 
 
 I
 
 r
 
 
 
 
 U
 
 
 
 
 W
 
 
 V
 
 
 
 ]
 
 
 
 P
 
 −
 1
 
 
 
 
 {\displaystyle G=Q^{-1}{\begin{bmatrix}I_{r}&U\\W&V\end{bmatrix}}P^{-1}}
 
 is a generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 for arbitrary 
 
 
 
 U
 ,
 V
 
 
 {\displaystyle U,V}
 
 and 
 
 
 
 W
 
 
 {\displaystyle W}
 
.</li>
<li>Let 
 
 
 
 A
 
 
 {\displaystyle A}
 
 be of rank 
 
 
 
 r
 
 
 {\displaystyle r}
 
. Without loss of generality, let
 
 
 
 A
 =
 
 
 [
 
 
 
 B
 
 
 C
 
 
 
 
 D
 
 
 E
 
 
 
 ]
 
 
 ,
 
 
 {\displaystyle A={\begin{bmatrix}B&C\\D&E\end{bmatrix}},}
 
where 
 
 
 
 
 B
 
 r
 ×
 r
 
 
 
 
 {\displaystyle B_{r\times r}}
 
 is the non-singular submatrix of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. Then,
 
 
 
 G
 =
 
 
 [
 
 
 
 
 B
 
 −
 1
 
 
 
 
 0
 
 
 
 
 0
 
 
 0
 
 
 
 ]
 
 
 
 
 {\displaystyle G={\begin{bmatrix}B^{-1}&0\\0&0\end{bmatrix}}}
 
is a generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
 if and only if 
 
 
 
 E
 =
 D
 
 B
 
 −
 1
 
 
 C
 
 
 {\displaystyle E=DB^{-1}C}
 
.</li></ul>
<h2 id="uses">Uses</h2>
Any generalized inverse can be used to determine whether a <a href="/facts/System_of_linear_equations/fk9CFdgp">system of linear equations</a> has any solutions, and if so to give all of them. If any solutions exist for the n × m linear system

A
 x
 =
 b
 
 
 {\displaystyle Ax=b}
 
,
with vector 
 
 
 
 x
 
 
 {\displaystyle x}
 
 of unknowns and vector 
 
 
 
 b
 
 
 {\displaystyle b}
 
 of constants, all solutions are given by

x
 =
 
 A
 
 
 g
 
 
 
 b
 +
 
 [
 
 I
 −
 
 A
 
 
 g
 
 
 
 A
 
 ]
 
 w
 
 
 {\displaystyle x=A^{\mathrm {g} }b+\left[I-A^{\mathrm {g} }A\right]w}
 
,
parametric on the arbitrary vector 
 
 
 
 w
 
 
 {\displaystyle w}
 
, where 
 
 
 
 
 A
 
 
 g
 
 
 
 
 
 {\displaystyle A^{\mathrm {g} }}
 
 is any generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
. Solutions exist if and only if 
 
 
 
 
 A
 
 
 g
 
 
 
 b
 
 
 {\displaystyle A^{\mathrm {g} }b}
 
 is a solution, that is, if and only if 
 
 
 
 A
 
 A
 
 
 g
 
 
 
 b
 =
 b
 
 
 {\displaystyle AA^{\mathrm {g} }b=b}
 
. If A has full column rank, the bracketed expression in this equation is the zero matrix and so the solution is unique.<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a>

<h2 id="generalized-inverses-of-matrices">Generalized inverses of matrices</h2>
The generalized inverses of matrices can be characterized as follows. Let 
 
 
 
 A
 ∈
 
 
 R
 
 
 m
 ×
 n
 
 
 
 
 {\displaystyle A\in \mathbb {R} ^{m\times n}}
 
, and

 
 
 
 A
 =
 U
 
 
 [
 
 
 
 
 Σ
 
 1
 
 
 
 
 0
 
 
 
 
 0
 
 
 0
 
 
 
 ]
 
 
 
 V
 
 T
 
 
 
 
 {\displaystyle A=U{\begin{bmatrix}\Sigma _{1}&0\\0&0\end{bmatrix}}V^{\operatorname {T} }}

be its <a href="/facts/Singular-value_decomposition/8t3v6wk3">singular-value decomposition</a>. Then for any generalized inverse 
 
 
 
 
 A
 
 g
 
 
 
 
 {\displaystyle A^{g}}
 
, there exist<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a> matrices 
 
 
 
 X
 
 
 {\displaystyle X}
 
, 
 
 
 
 Y
 
 
 {\displaystyle Y}
 
, and 
 
 
 
 Z
 
 
 {\displaystyle Z}
 
 such that

 
 
 
 
 A
 
 g
 
 
 =
 V
 
 
 [
 
 
 
 
 Σ
 
 1
 
 
 −
 1
 
 
 
 
 X
 
 
 
 
 Y
 
 
 Z
 
 
 
 ]
 
 
 
 U
 
 T
 
 
 .
 
 
 {\displaystyle A^{g}=V{\begin{bmatrix}\Sigma _{1}^{-1}&X\\Y&Z\end{bmatrix}}U^{\operatorname {T} }.}

Conversely, any choice of 
 
 
 
 X
 
 
 {\displaystyle X}
 
, 
 
 
 
 Y
 
 
 {\displaystyle Y}
 
, and 
 
 
 
 Z
 
 
 {\displaystyle Z}
 
 for matrix of this form is a generalized inverse of 
 
 
 
 A
 
 
 {\displaystyle A}
 
.<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> The 
 
 
 
 {
 1
 ,
 2
 }
 
 
 {\displaystyle \{1,2\}}
 
-inverses are exactly those for which 
 
 
 
 Z
 =
 Y
 
 Σ
 
 1
 
 
 X
 
 
 {\displaystyle Z=Y\Sigma _{1}X}
 
, the 
 
 
 
 {
 1
 ,
 3
 }
 
 
 {\displaystyle \{1,3\}}
 
-inverses are exactly those for which 
 
 
 
 X
 =
 0
 
 
 {\displaystyle X=0}
 
, and the 
 
 
 
 {
 1
 ,
 4
 }
 
 
 {\displaystyle \{1,4\}}
 
-inverses are exactly those for which 
 
 
 
 Y
 =
 0
 
 
 {\displaystyle Y=0}
 
. In particular, the pseudoinverse is given by 
 
 
 
 X
 =
 Y
 =
 Z
 =
 0
 
 
 {\displaystyle X=Y=Z=0}
 
:

 
 
 
 
 A
 
 +
 
 
 =
 V
 
 
 [
 
 
 
 
 Σ
 
 1
 
 
 −
 1
 
 
 
 
 0
 
 
 
 
 0
 
 
 0
 
 
 
 ]
 
 
 
 U
 
 T
 
 
 .
 
 
 {\displaystyle A^{+}=V{\begin{bmatrix}\Sigma _{1}^{-1}&0\\0&0\end{bmatrix}}U^{\operatorname {T} }.}

<h2 id="transformation-consistency-properties">Transformation consistency properties</h2>
In practical applications it is necessary to identify the class of matrix transformations that must be preserved by a generalized inverse. For example, the Moore–Penrose inverse, 
 
 
 
 
 A
 
 +
 
 
 ,
 
 
 {\displaystyle A^{+},}
 
 satisfies the following definition of consistency with respect to transformations involving unitary matrices U and V:

(
 U
 A
 V
 
 )
 
 +
 
 
 =
 
 V
 
 ∗
 
 
 
 A
 
 +
 
 
 
 U
 
 ∗
 
 
 
 
 {\displaystyle (UAV)^{+}=V^{*}A^{+}U^{*}}
 
.
The Drazin inverse, 
 
 
 
 
 A
 
 
 D
 
 
 
 
 
 {\displaystyle A^{\mathrm {D} }}
 
 satisfies the following definition of consistency with respect to similarity transformations involving a nonsingular matrix S:

(
 
 S
 A
 
 S
 
 −
 1
 
 
 
 )
 
 
 
 D
 
 
 
 =
 S
 
 A
 
 
 D
 
 
 
 
 S
 
 −
 1
 
 
 
 
 {\displaystyle \left(SAS^{-1}\right)^{\mathrm {D} }=SA^{\mathrm {D} }S^{-1}}
 
.
The unit-consistent (UC) inverse,<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a> 
 
 
 
 
 A
 
 
 U
 
 
 
 ,
 
 
 {\displaystyle A^{\mathrm {U} },}
 
 satisfies the following definition of consistency with respect to transformations involving nonsingular diagonal matrices D and E:

(
 D
 A
 E
 
 )
 
 
 U
 
 
 
 =
 
 E
 
 −
 1
 
 
 
 A
 
 
 U
 
 
 
 
 D
 
 −
 1
 
 
 
 
 {\displaystyle (DAE)^{\mathrm {U} }=E^{-1}A^{\mathrm {U} }D^{-1}}
 
.
The fact that the Moore–Penrose inverse provides consistency with respect to rotations (which are orthonormal transformations) explains its widespread use in physics and other applications in which Euclidean distances must be preserved. The UC inverse, by contrast, is applicable when system behavior is expected to be invariant with respect to the choice of units on different state variables, e.g., miles versus kilometers.

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Block_matrix_pseudoinverse/BSh9Dz6f">Block matrix pseudoinverse</a></li>
<li><a href="/facts/Regular_semigroup/gQ1pytKh">Regular semigroup</a></li></ul>
<h2 id="citations">Citations</h2>

<h2 id="sources">Sources</h2>
<h3>Textbook</h3>
<ul><li><a href="/facts/Adi_Ben-Israel/upsXPzTk">Ben-Israel, Adi</a>; <a href="/facts/Thomas_N._E._Greville/8G0oeaGP">Greville, Thomas Nall Eden</a> (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1007%2Fb97366">10.1007/b97366</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-387-00293-4.</li>
<li>Campbell, Stephen L.; Meyer, Carl D. (1991). <a href="https://archive.org/details/generalizedinver0000camp">Generalized Inverses of Linear Transformations</a>. Dover. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-486-66693-8.</li>
<li><a href="/facts/Roger_Horn/w1J0ArVI">Horn, Roger Alan</a>; <a href="/facts/Charles_Royal_Johnson/Qehgl6tm">Johnson, Charles Royal</a> (1985). Matrix Analysis. <a href="/facts/Cambridge_University_Press/fgEBSSRq">Cambridge University Press</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-521-38632-6.</li>
<li>Nakamura, Yoshihiko (1991). Advanced Robotics: Redundancy and Optimization. Addison-Wesley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0201151985.</li>
<li>Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). <a href="https://archive.org/details/generalizedinver0000raoc">Generalized Inverse of Matrices and its Applications</a>. New York: John Wiley & Sons. pp. <a href="https://archive.org/details/generalizedinver0000raoc/page/240">240</a>. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-471-70821-6.</li></ul>
<h3>Publication</h3>
<ul><li>James, M. (June 1978). "The generalised inverse". <a href="/facts/The_Mathematical_Gazette/2PoBAS9b">The Mathematical Gazette</a>. 62 (420): 109–114. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.2307%2F3617665">10.2307/3617665</a>. <a href="/facts/JSTOR_(identifier)/YTeVmaJ7">JSTOR</a> <a href="https://www.jstor.org/stable/3617665">3617665</a>.</li>
<li><a href="/facts/Jeffrey_Uhlmann/nI76bL9V">Uhlmann, Jeffrey K.</a> (2018). <a href="https://faculty.missouri.edu/uhlmannj/UC-SIMAX-Final.pdf">"A Generalized Matrix Inverse that is Consistent with Respect to Diagonal Transformations"</a> (PDF). <a href="/facts/SIAM_Journal_on_Matrix_Analysis_and_Applications/HGYc2k1q">SIAM Journal on Matrix Analysis and Applications</a>. 239 (2): 781–800. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1137%2F17M113890X">10.1137/17M113890X</a>.</li>
<li>Zheng, Bing; Bapat, Ravindra (2004). "Generalized inverse A(2)T,S and a rank equation". Applied Mathematics and Computation. 155 (2): 407–415. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1016%2FS0096-3003%2803%2900786-0">10.1016/S0096-3003(03)00786-0</a>.</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Nakamura 1991, pp. 41–42 - Nakamura, Yoshihiko (1991). Advanced Robotics: Redundancy and Optimization. Addison-Wesley. ISBN 978-0201151985. <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Rao & Mitra 1971, pp. vii, 20 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">Rao & Mitra 1971, p. 24 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">Nakamura 1991, pp. 41–42 - Nakamura, Yoshihiko (1991). Advanced Robotics: Redundancy and Optimization. Addison-Wesley. ISBN 978-0201151985. <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Rao & Mitra 1971, pp. vii, 20 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">Rao & Mitra 1971, pp. 19–20 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Rao & Mitra 1971, p. 19 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">Nakamura 1991, pp. 41–42 - Nakamura, Yoshihiko (1991). Advanced Robotics: Redundancy and Optimization. Addison-Wesley. ISBN 978-0201151985. <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Rao & Mitra 1971, pp. 20, 28, 50–51 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Ben-Israel & Greville 2003, p. 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Campbell & Meyer 1991, p. 10 - Campbell, Stephen L.; Meyer, Carl D. (1991). Generalized Inverses of Linear Transformations. Dover. ISBN 978-0-486-66693-8. <a href="https://archive.org/details/generalizedinver0000camp" target="_blank">https://archive.org/details/generalizedinver0000camp</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">James 1978, p. 114 - James, M. (June 1978). "The generalised inverse". The Mathematical Gazette. 62 (420): 109–114. doi:10.2307/3617665. JSTOR 3617665. <a href="https://doi.org/10.2307%2F3617665" target="_blank">https://doi.org/10.2307%2F3617665</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">Nakamura 1991, p. 42 - Nakamura, Yoshihiko (1991). Advanced Robotics: Redundancy and Optimization. Addison-Wesley. ISBN 978-0201151985. <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Rao & Mitra 1971, p. 19 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Rao & Mitra 1971, p. 19 - Rao, C. Radhakrishna; Mitra, Sujit Kumar (1971). Generalized Inverse of Matrices and its Applications. New York: John Wiley & Sons. pp. 240. ISBN 978-0-471-70821-6. <a href="https://archive.org/details/generalizedinver0000raoc" target="_blank">https://archive.org/details/generalizedinver0000raoc</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">James 1978, pp. 109–110 - James, M. (June 1978). "The generalised inverse". The Mathematical Gazette. 62 (420): 109–114. doi:10.2307/3617665. JSTOR 3617665. <a href="https://doi.org/10.2307%2F3617665" target="_blank">https://doi.org/10.2307%2F3617665</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">Ben-Israel & Greville 2003, pp. 2, 7 - Ben-Israel, Adi; Greville, Thomas Nall Eden (2003). Generalized Inverses: Theory and Applications (2nd ed.). New York, NY: Springer. doi:10.1007/b97366. ISBN 978-0-387-00293-4. <a href="https://doi.org/10.1007%2Fb97366" target="_blank">https://doi.org/10.1007%2Fb97366</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Uhlmann 2018 - Uhlmann, Jeffrey K. (2018). "A Generalized Matrix Inverse that is Consistent with Respect to Diagonal Transformations" (PDF). SIAM Journal on Matrix Analysis and Applications. 239 (2): 781–800. doi:10.1137/17M113890X. <a href="https://faculty.missouri.edu/uhlmannj/UC-SIMAX-Final.pdf" target="_blank">https://faculty.missouri.edu/uhlmannj/UC-SIMAX-Final.pdf</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
</ol>

Generalized inverse open-in-new

Generalized inverse