§6.11, Definition — Minimum-norm least-squares pseudoinverse
DefinitionVectorSpaceOpt_pseudoinverse_predicatedefinitionfunctional-analysisleast-squaresoptimizationpseudoinverse
Let and be real normed spaces, let be continuous linear, and let be continuous linear. Define IsPseudoinverse A B to mean that for every target , the vector first minimizes residual norm and then has minimum norm among all residual minimizers:
The two-stage condition covers inconsistent as well as underdetermined equations. It is the shared interface for the existence theorem and all operator identities in the mission, while the continuous-linear-map type records the source's linearity and boundedness requirements.
Definition code
import Mathlib
namespace VectorSpaceOpt
/-- `B` is the minimum-norm least-squares pseudoinverse of `A` when, for each target `y`,
`B y` minimizes the residual norm and has minimum norm among all residual minimizers. -/
def IsPseudoinverse
{G H : Type*} [NormedAddCommGroup G] [NormedSpace ℝ G]
[NormedAddCommGroup H] [NormedSpace ℝ H]
(A : G →L[ℝ] H) (B : H →L[ℝ] G) : Prop :=
∀ y : H,
(∀ x : G, ‖A (B y) - y‖ ≤ ‖A x - y‖) ∧
(∀ x : G, (∀ z : G, ‖A x - y‖ ≤ ‖A z - y‖) → ‖B y‖ ≤ ‖x‖)
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, §6.11, definition and discussion, book pp. 163–164 (PDF physical pp. 183–184), https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf