The Lax–Milgram theorem
ProvedFamousTheorems.lax_milgramThe Lax–Milgram theorem.
Let be a continuous bilinear form on a real Hilbert space that is coercive, meaning
Then induces a continuous linear isomorphism with continuous inverse.
Equivalently, for every bounded linear functional there is a unique with for all . Symmetry of is not required — when is symmetric the result reduces to the Riesz representation theorem, and the content of Lax–Milgram is precisely that symmetry can be dropped provided coercivity holds.
This is the standard existence-and-uniqueness theorem for weak solutions of elliptic partial differential equations: one recasts the equation as a bilinear form, checks continuity and coercivity (usually a Poincaré inequality), and reads off a unique weak solution with continuous dependence on the data. It is also the theoretical basis of the finite element method, where Céa's lemma turns coercivity into a quasi-optimality estimate.
Lax and Milgram proved it in 1954.
Formalization note. V →L[ℝ] V →L[ℝ] ℝ is the type of continuous bilinear forms and
IsCoercive B is the coercivity estimate; the conclusion is a continuous linear equivalence,
which is data, hence Nonempty. The result is Mathlib's
IsCoercive.continuousLinearEquivOfBilin.
import Mathlib
namespace FamousTheorems
universe u v
open Filter Set Topology DirectSum
theorem lax_milgram {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
[CompleteSpace V] {B : V →L[ℝ] V →L[ℝ] ℝ} (coercive : IsCoercive B) :
Nonempty (V ≃L[ℝ] V) := by sorry
end FamousTheorems