Bramble–Hilbert Lemma

In mathematics, particularly numerical analysis, the Bramble–Hilbert lemma, named after James H. Bramble and Stephen Hilbert, bounds the error of an approximation of a function $\textstyle u$ by a polynomial of order at most $\textstyle m-1$ in terms of derivatives of $\textstyle u$ of order $\textstyle m$. Both the error of the approximation and the derivatives of $\textstyle u$ are measured by $\textstyle L^$ norms on a bounded domain in $\textstyle \mathbb^$. This is similar to classical numerical analysis, where, for example, the error of linear interpolation $\textstyle u$ can be bounded using the second derivative of $\textstyle u$. However, the Bramble–Hilbert lemma applies in any number of dimensions, not just one dimension, and the approximation error and the derivatives of $\textstyle u$ are measured by more general norms involving averages, not just the maximum norm.

Additional assumptions on the domain are needed for the Bramble–Hilbert lemma to hold. Essentially, the boundary of the domain must be "reasonable". For example, domains that have a spike or a slit with zero angle at the tip are excluded. Lipschitz domains are reasonable enough, which includes convex domains and domains with continuously differentiable boundary.

The main use of the Bramble–Hilbert lemma is to prove bounds on the error of interpolation of function $\textstyle u$ by an operator that preserves polynomials of order up to $\textstyle m-1$, in terms of the derivatives of $\textstyle u$ of order $\textstyle m$. This is an essential step in error estimates for the finite element method. The Bramble–Hilbert lemma is applied there on the domain consisting of one element (or, in some superconvergence results, a small number of elements).

The one-dimensional case

Before stating the lemma in full generality, it is useful to look at some simple special cases. In one dimension and for a function $\textstyle u$ that has $\textstyle m$ derivatives on interval $\textstyle \left( a,b\right)$, the lemma reduces to

:$\inf_\bigl\Vert u^-v^\bigr\Vert_\leq C\left( m,k\right) \left( b-a\right) ^\bigl\Vert u^\bigr\Vert_\textk\leq m\textp\geq1,$

where $\textstyle P_$ is the space of all polynomials of degree at most $\textstyle m-1$ and $f^$ indicates
the $k$th derivative of a function $f$.

In the case when $\textstyle p=\infty$, $\textstyle m=2$, $\textstyle k=0$, and $\textstyle u$ is twice differentiable, this means that there exists a polynomial $\textstyle v$ of degree one such that for all $\textstyle x\in\left( a,b\right)$,

:$\left\vert u\left( x\right) -v\left( x\right) \right\vert \leq C\left( b-a\right) ^\sup_\left\vert u^\right\vert.$

This inequality also follows from the well-known error estimate for linear interpolation by choosing $\textstyle v$ as the linear interpolant of $\textstyle u$.

Statement of the lemma

Suppose $\textstyle \Omega$ is a bounded domain in $\textstyle \mathbb^n$, $\textstyle n\geq1$, with boundary $\textstyle \partial\Omega$ and diameter $\textstyle d$. $\textstyle W_p^k(\Omega)$ is the Sobolev space of all function $\textstyle u$ on $\textstyle \Omega$ with weak derivatives $\textstyle D^\alpha u$ of order $\textstyle \left\vert \alpha\right\vert$ up to $\textstyle k$ in $\textstyle L^p(\Omega)$. Here, $\textstyle \alpha=\left( \alpha_1,\alpha_2,\ldots,\alpha_n\right)$ is a multiindex, $\textstyle \left\vert \alpha\right\vert =$ $\textstyle \alpha_1+\alpha_2+\cdots+\alpha_n$ and $\textstyle D^\alpha$ denotes the derivative $\textstyle \alpha_1$ times with respect to $\textstyle x_1$, $\textstyle \alpha_2$ times with respect to $\textstyle x_2$, and so on. The Sobolev seminorm on $\textstyle W_p^m(\Omega)$ consists of the $\textstyle L^p$ norms of the highest order derivatives,

:$\left\vert u\right\vert _=\left( \sum_\left\Vert D^\alpha u\right\Vert_^p\right) ^\text1\leq p<\infty$

and

:$\left\vert u\right\vert _=\max_\left\Vert D^u\right\Vert _$

$\textstyle P_k$ is the space of all polynomials of order up to $\textstyle k$ on $\textstyle \mathbb^n$. Note that $\textstyle D^v=0$ for all $\textstyle v\in P_$ and $\textstyle \left\vert \alpha\right\vert =m$, so $\textstyle \left\vert u+v\right\vert _$ has the same value for any $\textstyle v\in P_$.

Lemma (Bramble and Hilbert) Under additional assumptions on the domain $\textstyle \Omega$, specified below, there exists a constant $\textstyle C=C\left( m,\Omega\right)$ independent of $\textstyle p$ and $\textstyle u$ such that for any $\textstyle u\in W_p^m(\Omega)$ there exists a polynomial $\textstyle v\in P_$ such that for all $\textstyle k=0,\ldots,m,$

:$\left\vert u-v\right\vert _\leq Cd^\left\vert u\right\vert _.$

The original result

The lemma was proved by Bramble and Hilbert J. H. Bramble and S. R. Hilbert. Estimation of linear functionals on Sobolev spaces with application to Fourier transforms and spline interpolation. ''SIAM J. Numer. Anal.'', 7:112–124, 1970.

under the assumption that $\textstyle \Omega$ satisfies the strong cone property; that is, there exists a finite open covering $\textstyle \left\$ of $\textstyle \partial\Omega$ and corresponding cones $\textstyle \$ with vertices at the origin such that $\textstyle x+C_$ is contained in $\textstyle \Omega$ for any $\textstyle x$ $\textstyle \in\Omega\cap O_$.

The statement of the lemma here is a simple rewriting of the right-hand inequality stated in Theorem 1 in. The actual statement in is that the norm of the factorspace $\textstyle W_^(\Omega)/P_$ is equivalent to the $\textstyle W_^(\Omega)$ seminorm. The $\textstyle W_^(\Omega)$ norm is not the usual one but the terms are scaled with $\textstyle d$ so that the right-hand inequality in the equivalence of the seminorms comes out exactly as in the statement here.

In the original result, the choice of the polynomial is not specified, and the value of constant and its dependence on the domain $\textstyle \Omega$ cannot be determined from the proof.

A constructive form

An alternative result was given by Dupont and Scott Todd Dupont and Ridgway Scott. Polynomial approximation of functions in Sobolev spaces. ''Math. Comp.'', 34(150):441–463, 1980. under the assumption that the domain $\textstyle \Omega$ is star-shaped; that is, there exists a ball $\textstyle B$ such that for any $\textstyle x\in\Omega$, the closed convex hull of $\textstyle \left\ \cup B$ is a subset of $\textstyle \Omega$. Suppose that $\textstyle \rho _\max$ is the supremum of the diameters of such balls. The ratio $\textstyle \gamma=d/\rho_\max$ is called the chunkiness of $\textstyle \Omega$.

Then the lemma holds with the constant $\textstyle C=C\left( m,n,\gamma\right)$, that is, the constant depends on the domain $\textstyle \Omega$ only through its chunkiness $\textstyle \gamma$ and the dimension of the space $\textstyle n$. In addition, $v$ can be chosen as $v=Q^m u$, where $\textstyle Q^m u$ is the averaged Taylor polynomial, defined as

:$Q^u=\int_B T_y^mu\left( x\right) \psi\left( y\right) \, dx,$

where

:$T_y^m u\left( x\right) =\sum\limits_^\sum\limits_\fracD^\alpha u\left( y\right) \left( x-y\right)^\alpha$

is the Taylor polynomial of degree at most $\textstyle m-1$ of $\textstyle u$ centered at $\textstyle y$ evaluated at $\textstyle x$, and $\textstyle \psi\geq0$ is a function that has derivatives of all orders, equals to zero outside of $\textstyle B$, and such that

:$\int_B\psi \, dx=1.$

Such function $\textstyle \psi$ always exists.

For more details and a tutorial treatment, see the monograph by Brenner and Scott. Susanne C. Brenner and L. Ridgway Scott. ''The mathematical theory of finite element methods'', volume 15 of ''Texts in Applied Mathematics''. Springer-Verlag, New York, second edition, 2002.

The result can be extended to the case when the domain $\textstyle \Omega$ is the union of a finite number of star-shaped domains, which is slightly more general than the strong cone property, and other polynomial spaces than the space of all polynomials up to a given degree.

Bound on linear functionals

This result follows immediately from the above lemma, and it is also called sometimes the Bramble–Hilbert lemma, for example by Ciarlet.Philippe G. Ciarlet. ''The finite element method for elliptic problems'', volume 40 of ''Classics in Applied Mathematics''. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2002. Reprint of the 1978 original orth-Holland, Amsterdam

It is essentially Theorem 2 from.

Lemma Suppose that $\textstyle \ell$ is a continuous linear functional on $\textstyle W_^(\Omega)$ and $\textstyle \left\Vert \ell\right\Vert _$ its dual norm. Suppose that $\textstyle \ell\left( v\right) =0$ for all $\textstyle v\in P_$. Then there exists a constant $\textstyle C=C\left( \Omega\right)$ such that

:$\left\vert \ell\left( u\right) \right\vert \leq C\left\Vert \ell\right\Vert _\left\vert u\right\vert _.$

References

External links

*
* https://arxiv.org/abs/0710.5148 – Jan Mandel: The Bramble–Hilbert Lemma

{{DEFAULTSORT:Bramble-Hilbert Lemma
Lemmas in analysis
Approximation theory
Finite element method