In mathematics, the Hilbert projection theorem is a famous result of convex analysis that says that for every vector x {\displaystyle x} in a Hilbert space H {\displaystyle H} and every nonempty closed convex C ⊆ H , {\displaystyle C\subseteq H,} there exists a unique vector m ∈ C {\displaystyle m\in C} for which ‖ c − x ‖ {\displaystyle \|c-x\|} is minimized over the vectors c ∈ C {\displaystyle c\in C} ; that is, such that ‖ m − x ‖ ≤ ‖ c − x ‖ {\displaystyle \|m-x\|\leq \|c-x\|} for every c ∈ C . {\displaystyle c\in C.}
Finite dimensional case Some intuition for the theorem can be obtained by considering the first order condition of the optimization problem. Consider a finite dimensional real Hilbert space H {\displaystyle H} with a subspace C {\displaystyle C} and a point x . {\displaystyle x.} If m ∈ C {\displaystyle m\in C} is a minimizer or minimum point of the function N : C → R {\displaystyle N:C\to \mathbb {R} } defined by N ( c ) := ‖ c − x ‖ {\displaystyle N(c):=\|c-x\|} (which is the same as the minimum point of c ↦ ‖ c − x ‖ 2 {\displaystyle c\mapsto \|c-x\|^{2}} ), then derivative must be zero at m . {\displaystyle m.}
In matrix derivative notation:
∂ ‖ x − c ‖ 2 = ∂ ⟨ c − x , c − x ⟩ = 2 ⟨ c − x , ∂ c ⟩ {\displaystyle {\begin{aligned}\partial \lVert x-c\rVert ^{2}&=\partial \langle c-x,c-x\rangle \\&=2\langle c-x,\partial c\rangle \end{aligned}}}
Since ∂ c {\displaystyle \partial c} is a vector in C {\displaystyle C} that represents an arbitrary tangent direction, it follows that m − x {\displaystyle m-x} must be orthogonal to every vector in C . {\displaystyle C.}
Statement
Detailed elementary proof
Proof by reduction to a special case It suffices to prove the theorem in the case of x = 0 {\displaystyle x=0} because the general case follows from the statement below by replacing C {\displaystyle C} with C − x . {\displaystyle C-x.}
Consequences
Properties Expression as a global minimum The statement and conclusion of the Hilbert projection theorem can be expressed in terms of global minimums of the following functions. Their notation will also be used to simplify certain statements. Given a non-empty subset C ⊆ H {\displaystyle C\subseteq H} and some x ∈ H , {\displaystyle x\in H,} define a function
d C , x : C → [ 0 , ∞ ) by c ↦ ‖ x − c ‖ . {\displaystyle d_{C,x}:C\to [0,\infty )\quad {\text{ by }}c\mapsto \|x-c\|.} A global minimum point of d C , x , {\displaystyle d_{C,x},} if one exists, is any point m {\displaystyle m} in domain d C , x = C {\displaystyle \,\operatorname {domain} d_{C,x}=C\,} such that
… excerpt ends here. Continue reading the full article.

