 Lax-Milgram theorem

The theorem supplies solvability for a coercive weak formulation.

A bounded bilinear form $a$ on a real Hilbert space $H$ that is a coercive bilinear form represents every bounded linear functional uniquely: for each $\ell \in H^{\prime }$, there is a unique $u\in H$ with $a(u,v)=\ell (v)$ for every $v\in H$.

For a proof, the Riesz representation theorem gives a bounded linear operator $T$ and a vector $g$ with $a(u,v)=⟨Tu,v⟩$ and $\ell (v)=⟨g,v⟩$. Coercivity and the Cauchy-Schwarz inequality give $\Vert Tu\Vert \ge \alpha \Vert u\Vert$, so $T$ is injective and its image is closed: convergence of $T{u}_n$ makes $u_n$ a Cauchy sequence, whose limit supplies the image limit. If $v$ belongs to the orthogonal complement of the image, then $a(u,v)=0$ for every $u$; setting $u=v$ and using coercivity forces $v=0$. Thus the image is also dense and equals $H$. There is consequently a unique $u$ with $Tu=g$, and $\Vert u\Vert \le \Vert \ell \Vert /\alpha$. The complex version uses a bounded sesquilinear form with $\mathrm{Re}a(u,u)\ge \alpha \Vert u{\Vert }^2$.