Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.11, Definition consequence — Existence and uniqueness of the pseudoinverse

Proved
VectorSpaceOpt.pseudoinverse_exists_unique

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

closed-rangefunctional-analysishilbert-spaceleast-squarespseudoinverse

Let A ⁣:G→HA \colon G \to HA:G→H be a continuous linear map between real Hilbert spaces, and assume range⁡A\operatorname{range} ArangeA is closed. Then there exists a unique continuous linear map B ⁣:H→GB \colon H \to GB:H→G that selects, for every y∈Hy \in Hy∈H, the minimum-norm vector among all least-squares minimizers:

∃! B:H→G,IsPseudoinverse⁡(A,B).\exists!\,B:H\to G,\quad \operatorname{IsPseudoinverse}(A,B).∃!B:H→G,IsPseudoinverse(A,B).

The conclusion includes more than pointwise unique minimizers: their assignment is a single bounded linear operator. This theorem validates the mission's predicate as a canonical operator construction and supplies the uniquely determined B to which the algebraic identities of Proposition 1 apply.

Preamble
import Definitions.Def_VectorSpaceOpt_pseudoinverse_predicate
Formal statement
namespace VectorSpaceOpt

theorem pseudoinverse_exists_unique
    {G H : Type*} [NormedAddCommGroup G] [InnerProductSpace ℝ G] [CompleteSpace G]
    [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
    (A : G →L[ℝ] H) (hA : IsClosed (A.range : Set H)) :
    ∃! B : H →L[ℝ] G, IsPseudoinverse A B := by sorry

end VectorSpaceOpt
Source
David G. Luenberger, Optimization by Vector Space Methods, §6.11, definition and existence/uniqueness 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

Let GGG and HHH be complete real inner-product spaces, and let A:G→HA : G → HA:G→H be a continuous real-linear map with closed range. There exists exactly one continuous real-linear map B:H→GB : H → GB:H→G having the following property: for every y∈Hy ∈ Hy∈H, ‖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 for every x∈Gx ∈ Gx∈G that itself satisfies ‖A(x)−y‖≤‖A(z)−y‖‖A(x)-y‖ ≤ ‖A(z)-y‖‖A(x)−y‖≤‖A(z)−y‖ for every z∈Gz ∈ Gz∈G, one has ‖B(y)‖≤‖x‖‖B(y)‖ ≤ ‖x‖‖B(y)‖≤‖x‖. Uniqueness is equality among continuous linear maps satisfying this full pointwise residual-minimization and minimum-norm condition; the condition itself does not state that an arbitrary residual minimizer is unique, and no nontriviality or finite-dimensionality assumption is present.

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