Math 2.0

Partial differential equations Generalized solutions and function spaces Theorem

Lax–Milgram theorem

Builds on Hilbert spaceBilinear formCoercive bilinear formContinuous dual spaceRiesz representation theoremWeak solutionSobolev spacePoincaré inequality

Statement

Let HH be a real Hilbert space with norm ∥⋅∥\norm{\cdot}. Let B ⁣:H×H→ℝB \colon H \times H \to \R be a bilinear form with these two properties:

  1. BB is bounded: there is M≥0M \ge 0 with ∣B(u,v)∣≤M∥u∥∥v∥\abs{B(u, v)} \le M \norm{u} \norm{v} for all u,v∈Hu, v \in H.
  2. BB is coercive: there is α>0\alpha > 0 with B(u,u)≥α∥u∥2B(u, u) \ge \alpha \norm{u}^2 for all u∈Hu \in H.

Then for every bounded linear functional ff on HH, an element of the continuous dual space H′H', there is a unique u∈Hu \in H such that B(u,v)=f(v)for all v∈H.B(u, v) = f(v) \quad \text{for all } v \in H. Moreover ∥u∥≤∥f∥H′/α\norm{u} \le \norm{f}_{H'} / \alpha.

Remarks

The form BB need not be symmetric. By the Riesz representation theorem, there are a bounded linear operator AA on HH with B(u,v)=⟨Au,v⟩B(u, v) = \ip{Au}{v} and an element ww with f(v)=⟨w,v⟩f(v) = \ip{w}{v}. Coercivity gives α∥u∥≤∥Au∥\alpha \norm{u} \le \norm{Au}, so AA is injective with closed range. If vv is orthogonal to the range, then B(v,v)=⟨Av,v⟩=0B(v, v) = \ip{Av}{v} = 0, so v=0v = 0; hence AA is onto and u=A−1wu = A^{-1} w. The bound follows from α∥u∥2≤B(u,u)=f(u)≤∥f∥H′∥u∥\alpha \norm{u}^2 \le B(u, u) = f(u) \le \norm{f}_{H'} \norm{u}. When BB is symmetric, the theorem is the Riesz representation theorem for the inner product BB.

Example: let U⊂ℝnU \subset \R^n be a bounded open set and g∈L2(U)g \in L^2(U). On H=H01(U)H = H^1_0(U), the Sobolev space, take B(u,v)=∫U∇u⋅∇v dxB(u, v) = \int_U \nabla u \cdot \nabla v \, dx and f(v)=∫Ugv dxf(v) = \int_U g v \, dx. The Poincaré inequality shows that BB is coercive, so there is a unique weak solution u∈H01(U)u \in H^1_0(U) of −Δu=g-\Delta u = g with u=0u = 0 on ∂U\partial U.

Coercivity cannot be dropped. On H=ℓ2H = \ell^2, let SS be the right shift and B(u,v)=⟨Su,v⟩B(u, v) = \ip{Su}{v}, which is bounded. For f(v)=⟨e1,v⟩f(v) = \ip{e_1}{v}, a solution would satisfy Su=e1S u = e_1, which is impossible since the first coordinate of SuSu is 00.

Going deeper

For a student

This is the standard existence theorem for weak solutions of linear elliptic equations in divergence form. One checks boundedness from bounds on the coefficients and coercivity from uniform ellipticity together with the Poincaré inequality, possibly after adding a multiple of uu to the equation. The proof is also the basis of finite element error analysis. Restricting the problem to a finite-dimensional subspace gives the Galerkin approximation, and the constants MM and α\alpha control its error. The Babuška version replaces coercivity by an inf-sup condition and allows different trial and test spaces.

Reading path

To understand this page from the ground up, read these 95 pages in order. The foundations come first.

  1. Bilinear form concept
  2. Closed set concept
  3. Coercive bilinear form concept
  4. Compact operator concept
  5. Continuous dual space concept
  6. Convex set concept
  7. Element definition
  8. Extended real number line object
  9. Hilbert space concept
  10. Hölder continuity concept
  11. Inequality of arithmetic and geometric means statement
  12. Linear form concept
  13. Lp space concept
  14. Orthogonal complement concept
  15. Proposition concept
  16. Real numbers object
  17. Set bounded above definition
  18. Sobolev space concept
  19. Uniform metric on bounded functions example
  20. Vector space definition
  21. Weak derivative concept
  22. Weak solution concept
  23. Set definition
  24. Young's inequality for products statement
  25. Sobolev embedding theorem statement
  26. Conjunction definition
  27. Disjunction definition
  28. Implication definition
  29. Predicate definition
  30. Supremum definition
  31. Inner product definition
  32. Linear map definition
  33. Linear subspace definition
  34. Norm definition
  35. Empty set object
  36. Family of sets definition
  37. Ordered pair definition
  38. Hölder's inequality statement
  39. Intersection definition
  40. Union definition
  41. Existential quantifier definition
  42. Universal quantifier definition
  43. Inner product space definition
  44. Orthogonal vectors definition
  45. Endomorphism definition
  46. Linear form definition
  47. Sum of subspaces definition
  48. Cartesian product definition
  49. Union of a family of sets definition
  50. Subset definition
  51. Uniqueness quantifier definition
  52. Norm induced by an inner product definition
  53. Orthogonal complement definition
  54. Riesz representation theorem in finite dimensions statement
  55. Sobolev inequality statement
  56. Direct sum of subspaces definition
  57. Binary relation definition
  58. Topological space definition
  59. Parallelogram law statement
  60. A space is the direct sum of a subspace and its orthogonal complement statement
  61. Projection definition
  62. Sequential compactness definition
  63. Function definition
  64. Subspace topology definition
  65. Orthogonal projection definition
  66. Preimage of a set definition
  67. Restriction of a function definition
  68. Orthogonal projection is the closest point statement
  69. Metric space definition
  70. Subspace metric definition
  71. Convergence of a sequence in a metric space definition
  72. Open ball definition
  73. Hilbert projection theorem statement
  74. Diameter of a set definition
  75. Metric topology definition
  76. Epsilon characterisation of Cauchy sequences statement
  77. Totally bounded set definition
  78. Riesz representation theorem statement
  79. Open set definition
  80. Complete metric space definition
  81. Open cover definition
  82. Open sets characterised by neighbourhoods statement
  83. Open sets of a metric space statement
  84. Compact space definition
  85. Continuity at a point of a topological space definition
  86. Compact set definition
  87. Lebesgue number lemma statement
  88. Epsilon-delta continuity in metric spaces statement
  89. Compactness and sequential compactness agree in metric spaces statement
  90. Equicontinuity definition
  91. Compact iff complete and totally bounded statement
  92. Arzelà–Ascoli theorem statement
  93. Rellich–Kondrachov theorem statement
  94. Poincaré inequality statement
  95. Lax–Milgram theorem statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Babu%C5%A1ka%E2%80%93Lax%E2%80%93Milgram_theorem
About this page
Tag85KK79FCN5
URIm2://85KK79FCN5
Kindstatement, theorem
WritingW0 stub
MSC35A15, 47A07, 35J20
StatusThis copy of the site has no build data. Run m2 status 85KK79FCN5.
AboutCoercive bilinear form
UsesHilbert space, Bilinear form, Coercive bilinear form, Continuous dual space, Riesz representation theorem, Weak solution, Sobolev space, Poincaré inequality
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by