Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.11, Definition — Minimum-norm least-squares pseudoinverse

Definition
VectorSpaceOpt_pseudoinverse_predicate

by wenxinzhang · Aug 25, 2026 · Mathlib c5ea003 (Lean v4.30.0)

definitionfunctional-analysisleast-squaresoptimizationpseudoinverse

Let GGG and HHH be real normed spaces, let A ⁣:G→HA \colon G \to HA:G→H be continuous linear, and let B ⁣:H→GB \colon H \to GB:H→G be continuous linear. Define IsPseudoinverse A B to mean that for every target y∈Hy \in Hy∈H, the vector ByB yBy first minimizes residual norm and then has minimum norm among all residual minimizers:

∥A(By)−y∥≤∥Ax−y∥(∀x∈G),∥By∥≤∥x∥for every residual minimizer x.\|A(By)-y\| \le \|Ax-y\|\quad(\forall x\in G),\qquad \|By\|\le\|x\|\quad\text{for every residual minimizer }x.∥A(By)−y∥≤∥Ax−y∥(∀x∈G),∥By∥≤∥x∥for every residual minimizer x.

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 VectorSpaceOpt
Source
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
Read-back

What the Lean code literally says, in plain math · gpt-5

For arbitrary real normed vector spaces GGG and HHH, a continuous real-linear map A:G→HA : G → HA:G→H, and a continuous real-linear map B:H→GB : H → GB:H→G, IsPseudoinverse⁡(A,B)\operatorname{IsPseudoinverse}(A,B)IsPseudoinverse(A,B) is defined to mean the following for every target y∈Hy ∈ Hy∈H: first, ‖A(B(y))−y‖≤‖A(x)−y‖‖A(B(y))-y‖ ≤ ‖A(x)-y‖‖A(B(y))−y‖≤‖A(x)−y‖ for every x∈Gx ∈ Gx∈G; and second, for every x∈Gx ∈ Gx∈G, if ‖A(x)−y‖≤‖A(z)−y‖‖A(x)-y‖ ≤ ‖A(z)-y‖‖A(x)−y‖≤‖A(z)−y‖ for every z∈Gz ∈ Gz∈G, then ‖B(y)‖≤‖x‖‖B(y)‖ ≤ ‖x‖‖B(y)‖≤‖x‖. Thus B(y)B(y)B(y) is a global residual-norm minimizer and has norm no larger than any other global residual-norm minimizer. The definition quantifies over every target and every competitor, does not assert uniqueness of either kind of minimizer, and assumes neither inner products, completeness, nor nontriviality; continuity and linearity of the total assignment y↦B(y)y ↦ B(y)y↦B(y) are built into the type of BBB.

Human review
  • Endorsed by Shuze Chen · Aug 25, 2026

  • Endorsed by wenxinzhang · Aug 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me