90. Pseudoinverse

The Moore–Penrose pseudoinverse 𝐴+ generalizes the matrix inverse to every matrix — square, rectangular, full-rank, or rank-deficient.

For invertible square 𝐴, 𝐴+=𝐴1. For other matrices, 𝐴+ provides the “best possible inverse” in a precise least-squares sense.

90.1. Definition via SVD

If 𝐴=𝑈Σ𝑉𝑇 is the SVD of 𝐴, then:

𝐴+=𝑉Σ+𝑈𝑇

where Σ+ is the transpose of Σ with each non-zero singular value 𝜎𝑖 replaced by 1𝜎𝑖 (zero singular values stay zero).

90.2. Four defining properties

𝐴+ is uniquely characterized by the Moore–Penrose conditions:

  1. 𝐴𝐴+𝐴=𝐴
  2. 𝐴+𝐴𝐴+=𝐴+
  3. (𝐴𝐴+)𝑇=𝐴𝐴+ — symmetric
  4. (𝐴+𝐴)𝑇=𝐴+𝐴 — symmetric

These force a unique 𝐴+ for every matrix.

90.3. Special cases

Full column rank (𝑚𝑛, rank(𝐴)=𝑛):

𝐴+=(𝐴𝑇𝐴)1𝐴𝑇

Full row rank (𝑚𝑛, rank(𝐴)=𝑚):

𝐴+=𝐴𝑇(𝐴𝐴𝑇)1

Square invertible: 𝐴+=𝐴1.

90.4. Least-squares solution

For the overdetermined system 𝐴𝑥=𝑏 (more equations than unknowns), the minimum-norm least-squares solution is:

𝑥̂=𝐴+𝑏

Properties:

This is the foundation of linear regression and least-squares fitting.

Example
𝐴=[100000]𝑏=[345]

No exact solution (rows 2 and 3 are inconsistent with non-zero 𝑏 entries).

SVD: 𝜎1=1, 𝜎2=0. So Σ+=[100000] (transpose of Σ with 𝜎2 left zero).

𝐴+=[100000]𝑥̂=𝐴+𝑏=[30]

This minimizes 𝐴𝑥𝑏 and has minimum norm among minimizers.

90.5. Why it generalizes the inverse

90.6. See also