Coercive self-adjoint operators are bijective
ProvedVectorSpaceOpt.coercive_selfadjoint_bijectivebijectivecoercive-operatorhilbert-spaceself-adjoint
Let H be a real Hilbert space and Q : H →L[ℝ] H a bounded self-adjoint operator. Suppose a constant m > 0 and an upper constant M satisfy the two-sided quadratic estimate
for every x ∈ H. Then Q is bijective. In particular, every right-hand side b has one and only one solution of Q x = b. This result is recorded by Luenberger as Chapter 10, Problem 10 and is used implicitly when the conjugate-gradient theorem names Q⁻¹ b. The milestone makes solvability explicit before any algorithmic convergence claim and is reusable for other coercive quadratic methods.
Preamble
import Definitions.Def_VectorSpaceOpt_conjugate_gradient
Formal statement
namespace VectorSpaceOpt
/-- The operator-invertibility fact recorded as Chapter 10, Problem 10. -/
theorem coercive_selfadjoint_bijective
{H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℝ H] [CompleteSpace H]
(Q : H →L[ℝ] H) (m M : ℝ) (hm : 0 < m)
(hself : IsRealSelfAdjoint Q) (hbounds : IsCoerciveBetween Q m M) :
Function.Bijective Q := by
sorry
end VectorSpaceOptSource
David G. Luenberger, Optimization by Vector Space Methods (Wiley, 1969), Chapter 10, Problem 10, printed p. 309 (physical PDF p. 327), used by §10.8, Theorem 1. Scan: https://sites.science.oregonstate.edu/~show/old/142_Luenberger.pdf