Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6.10, Theorem 1 — Minimum-norm solution through the adjoint

Proved
VectorSpaceOpt.minimum_norm_solution_via_adjoint

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

adjointclosed-rangefunctional-analysishilbert-spaceminimum-norm

Let A ⁣:G→HA \colon G \to HA:G→H be a continuous linear map between real Hilbert spaces with closed range. Fix y∈range⁡Ay \in \operatorname{range} Ay∈rangeA and x∈Gx \in Gx∈G. Then xxx solves Ax=yAx = yAx=y with minimum norm among all exact solutions if and only if there is z∈Hz \in Hz∈H such that

AA†z=y,x=A†z.AA^\dagger z=y,\qquad x=A^\dagger z.AA†z=y,x=A†z.

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

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

Let GGG and HHH be complete real inner-product spaces, let A:G→HA : G → HA:G→H be continuous and real-linear with closed range, let y∈Hy ∈ Hy∈H be explicitly assumed to belong to that range, and let x∈Gx ∈ Gx∈G be arbitrary. The conjunction that A(x)=yA(x)=yA(x)=y and ‖x‖≤‖u‖‖x‖ ≤ ‖u‖‖x‖≤‖u‖ for every exact solution u∈Gu ∈ Gu∈G with A(u)=yA(u)=yA(u)=y holds if and only if there exists some z∈Hz ∈ Hz∈H such that A(A†(z))=yA(A†(z))=yA(A†(z))=y and x=A†(z)x=A†(z)x=A†(z). The witness zzz is only existential and is not asserted to be unique; the statement also covers y=0y=0y=0 and trivial spaces.

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