§6.10, Theorem 1 — Minimum-norm solution through the adjoint
ProvedVectorSpaceOpt.minimum_norm_solution_via_adjointadjointclosed-rangefunctional-analysishilbert-spaceminimum-norm
Let be a continuous linear map between real Hilbert spaces with closed range. Fix and . Then solves with minimum norm among all exact solutions if and only if there is such that
The explicit membership y ∈ range A records the solvability implicit in the source's phrase “solution of Ax = y.” This equivalence characterizes the canonical exact solution as lying in the adjoint range and prepares the pointwise minimum-norm choice used to define the pseudoinverse operator.
Preamble
import Mathlib open scoped InnerProduct
Formal statement
namespace VectorSpaceOpt
theorem minimum_norm_solution_via_adjoint
{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))
(y : H) (hy : y ∈ A.range) (x : G) :
(A x = y ∧ ∀ u : G, A u = y → ‖x‖ ≤ ‖u‖) ↔
∃ z : H, (A ∘L (A†)) z = y ∧ x = (A†) z := by sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods, §6.10, Theorem 1, book pp. 161–162 (PDF physical pp. 181–182), https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf