§6.11, Definition consequence — Existence and uniqueness of the pseudoinverse
ProvedVectorSpaceOpt.pseudoinverse_exists_uniqueLet be a continuous linear map between real Hilbert spaces, and assume is closed. Then there exists a unique continuous linear map that selects, for every , the minimum-norm vector among all least-squares minimizers:
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.
import Definitions.Def_VectorSpaceOpt_pseudoinverse_predicate
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 VectorSpaceOptRead-back
What the Lean code literally says, in plain math · gpt-5
Let and be complete real inner-product spaces, and let be a continuous real-linear map with closed range. There exists exactly one continuous real-linear map having the following property: for every , for every , and for every that itself satisfies for every , one has . 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.
Confirmed by the mission captain (proposal self-audit).