Lecture 1 introduced the variational formulation of the Poisson problem and the Ritz–Galerkin approximation. The next question is more basic:
What does it mean for a function to be an admissible solution, and how can we systematically build finite-dimensional spaces that approximate it?
This lecture develops the analytical and geometrical language needed for that construction. We introduce Lebesgue and Sobolev spaces, explain weak derivatives, describe triangulations and shape regularity, and derive the scaling rules induced by affine maps from a reference element. These rules are the mechanism behind the interpolation estimates used later in the course.
The guiding principle is that a finite element calculation separates into two layers:
an analytic layer, which measures integrability and differentiability in and Sobolev norms;
a geometric layer, which transfers functions and polynomial bases between a fixed reference element and every physical cell of the mesh.
The constants in the second layer are harmless only when the mesh is shape-regular. This is why mesh geometry is part of the approximation theory, not merely an implementation detail.
1. Why function spaces enter finite element methods¶
Let be an open, bounded domain. A classical formulation of a boundary-value problem asks for a function satisfying a differential equation at every point of . This formulation is often too restrictive:
the data may be integrable without being continuous;
the exact solution may have derivatives that are not classical functions;
the boundary of may be only piecewise smooth;
a finite element approximation is usually only piecewise polynomial and its higher derivatives may jump across element interfaces.
Instead of asking for pointwise differentiability, we measure the function and its derivatives in integral norms. The weak formulation from Lecture 1 is an example: for Poisson’s equation, it is enough to control first derivatives in , which leads naturally to and .
Throughout this lecture, functions that agree almost everywhere are identified. The spaces therefore contain equivalence classes of functions, rather than a preferred pointwise representative.
2. Multi-indices and weak derivatives¶
A multi-index is a vector . We use the notation
For a smooth function, this is the usual derivative. For a function that is only locally integrable, the same notation can be defined in the sense of distributions.
Let . A function is the weak derivative if
The test function is smooth and compactly supported, so no boundary term appears. If a classical derivative exists and is locally integrable, it is also the weak derivative. Conversely, the weak derivative extends the notion of derivative to functions that are not classically differentiable everywhere.
2.1 Two one-dimensional examples¶
Consider on . The function is not differentiable at the origin, but it has the weak derivative
Since for every finite , we have . The second distributional derivative is , which is not an -function. Therefore .
By contrast, a jump is already too singular for . Let for and for . Its distributional derivative is , so for any finite . This is the analytic reason why a globally -conforming finite element function must be continuous across an interior edge in two dimensions.
3. Lebesgue spaces¶
For , the Lebesgue space is
with norm
For , we use the essential supremum:
The adjective essential means that changing on a set of measure zero does not change the norm.
If and is its conjugate exponent,
then Hölder’s inequality states
For , this is the Cauchy–Schwarz inequality. Minkowski’s inequality
makes a Banach space. The special space is a Hilbert space with inner product
For complex-valued functions, the second factor is conjugated. We use real functions in this course unless stated otherwise.
3.1 A useful integrability test¶
Near the origin in , consider . In polar coordinates,
Consequently,
This elementary calculation is a useful reminder that integrability depends on both the strength of a singularity and the dimension of the domain.
4. Sobolev spaces¶
For an integer and , define
where the derivatives are weak derivatives. For , the standard norm is
For , replace the sum by a maximum:
The order- seminorm keeps only the derivatives of exactly order :
For , use the maximum over . The seminorm may vanish for nonzero functions: if is connected, then implies that is a polynomial of degree at most .
The Hilbert-space case is denoted by
Its inner product and norm are
We often write and for the norm and seminorm, and omit when it is clear from the context.
4.1 The spaces and ¶
The space with homogeneous boundary values is defined by closure:
In particular, . On a bounded Lipschitz domain, the trace theorem identifies with the -functions whose trace vanishes on . In the weak Poisson problem of Lecture 1, this is the correct space for both the solution and the test functions.
Poincaré’s inequality states that there is a constant such that
Thus, on , the seminorm
is a norm equivalent to the full -norm. This is exactly what allows the Poisson bilinear form to be coercive in Lecture 1.
4.2 Regularity and continuity¶
Sobolev regularity is not the same as pointwise smoothness. A useful rule of thumb is that -functions become continuous when , although the precise statement involves the Sobolev embedding theorems and the regularity of the domain. In two dimensions:
is generally not contained in ;
for ;
.
This distinction matters for finite elements. A piecewise polynomial function can be smooth inside each cell and still fail to belong to if it has a jump across an interior face.
5. Triangulations and mesh geometry¶
A mesh is a finite collection of cells that covers the computational domain. For a simplicial mesh in two dimensions, the cells are triangles; in three dimensions, they are tetrahedra. The word triangulation is used more generally here for a partition into simple cells such as triangles, quadrilaterals, tetrahedra, or hexahedra.
We write
where is the triangulation and denotes an individual cell. Distinct cells may intersect only in a common lower-dimensional entity:
the empty set;
a common vertex;
a common edge in two dimensions;
a common face in three dimensions.
The partition must not contain gaps or overlaps in its interior. A mesh may approximate a curved domain by straight-sided cells, or it may use curved geometry through an appropriate mapping. The annular domain used in Lecture 1 is a useful example: the mesh has an inner and an outer boundary, and the finite element calculation must know which faces belong to each boundary.
5.1 Local and global length scales¶
For a cell , let denote its diameter:
For a simplex, let denote its inradius, the radius of the largest ball contained in . For a general cell, one may use an analogous inscribed radius. The global mesh size and minimum inradius are
A family of meshes is shape-regular if there is a constant , independent of the refinement level, such that
Equivalently, no cell is allowed to become arbitrarily thin relative to its diameter. The constant controls the constants in the scaling estimates below.
A mesh is quasi-uniform when all its cells have comparable size, for example
Shape regularity is compatible with local refinement: neighbouring cells may have different sizes, as long as their shapes do not degenerate. Quasi-uniformity is stronger and is often convenient for global estimates, but is not necessary for adaptive finite element methods.
5.2 Broken norms¶
If a function is smooth only on each cell, we use a broken Sobolev seminorm:
The corresponding broken norm is defined by summing all derivatives of order at most cell by cell. A broken norm does not control jumps across faces. To obtain a conforming subspace of , the local polynomial pieces must be glued with matching traces on every interior face.
6. The reference element and affine maps¶
The central implementation idea of finite elements is to define shape functions once on a reference cell and transport them to every physical cell.
For a -simplex, use the reference simplex
where are the canonical basis vectors. For a triangle, has vertices , , and .
Let be a physical simplex with vertices . The affine map is
If the vertices are not degenerate, is invertible and
The absolute Jacobian determinant is constant on :
The change-of-variables formula is therefore particularly simple:
We use a hat for a function on the reference element:
For first derivatives, the chain rule gives
The matrix , not itself, transforms gradients. This transpose is easy to miss and is important when implementing local stiffness matrices.
7. Scaling of and Sobolev norms¶
The change of variables already gives the exact scaling. If , then, for ,
For , the Jacobian does not appear:
For a first derivative, the gradient transformation and the change of variables give
and, in the other direction,
More generally, for integer , affine changes of variables yield the estimates
and
The hidden constants depend on , , the dimension, and the reference element, but not on the particular physical cell. The estimates use the fact that the derivative of an affine map is the constant matrix . For a non-affine map, higher derivatives of the map also enter the chain rule.
7.1 Shape-regular scaling¶
For a shape-regular family of -dimensional simplices,
The last relation uses shape regularity. Without it, the determinant can be much smaller than because a cell can be long and thin.
Combining these estimates gives the familiar rule
and the reverse inequality
The exponent has a clear interpretation:
comes from the volume scaling of the -integral;
comes from differentiating times;
the geometry is summarized by the single length scale only because the mesh is shape-regular.
For , the lower-order terms can be absorbed into the highest-order term, giving analogous full-norm estimates:
8. Two sanity checks¶
8.1 An interval¶
Let and . The affine map is
If , then
Equivalently,
For , this is the volume scaling . Every derivative adds a factor , as expected from the chain rule.
8.2 The Poisson energy on one cell¶
For and , the Dirichlet energy on one cell is
up to constants controlled by shape regularity. Therefore:
in , the local stiffness contribution scales like ;
in , it is scale-invariant up to the shape of the cell;
in , it scales like .
The local mass integral instead scales as
These two rules already explain important differences between mass matrices and stiffness matrices and are useful when checking an assembly routine.
9. What fails without shape regularity?¶
Consider a family of triangles whose diameter is approximately , but whose altitude is with . Then
The inverse-gradient estimate contains , so its constant grows like . A formula that depends only on is no longer uniform. In practice, badly shaped cells can lead to:
large interpolation constants;
inaccurate numerical integration;
poorly conditioned stiffness matrices;
slower or unreliable iterative solver convergence.
Shape regularity is therefore the geometric hypothesis that lets us replace a matrix estimate by a scalar estimate involving .
10. From scaling to finite element approximation¶
Let be a polynomial space on the reference element. The corresponding physical-cell space is
The reference element has finitely many basis functions. Once these are known, the affine map transports them to every cell. This has three consequences:
locality: element matrices and vectors can be computed cell by cell;
reuse: the reference basis and quadrature rule are shared by all cells;
scaling: estimates on transfer to with constants controlled by and shape regularity.
The global space is assembled by identifying local degrees of freedom on shared entities. For a continuous Lagrange space, neighbouring polynomial pieces must have matching values on their common face. This produces a conforming space
and makes Céa’s lemma applicable. If the pieces are allowed to jump, we obtain a broken or discontinuous space instead; that will be the subject of the later DG lectures.
The next analytical step is to quantify how well approximates a smooth function. The Bramble–Hilbert lemma does exactly this on the reference element, while the affine scaling estimates transfer the result to every cell. This is the bridge from the abstract estimate in Lecture 1 to the concrete -dependent error bounds of Lecture 3.
11. Worked checklist¶
For a new mesh and a new finite element implementation, the following checklist captures the logic of this lecture:
Identify the domain and the regularity required of its boundary.
Choose the Sobolev space in which the weak solution is sought.
Specify the cells , their diameters , and their inradii .
Check whether the mesh family is shape-regular and, if needed, quasi-uniform.
Choose a reference cell and write the affine map .
Compute , , and .
Transform functions, gradients, and integrals to .
Use the scaling rules to track the powers of .
Glue local degrees of freedom only when the desired global Sobolev conformity is satisfied.
Summary¶
-spaces measure integrability; -spaces also control weak derivatives up to order .
is a Hilbert space, and is the natural energy space for Poisson’s equation with homogeneous Dirichlet data.
A triangulation partitions the domain into cells, while shape regularity prevents cells from becoming arbitrarily thin.
Every physical simplex is an affine image of a reference simplex.
The Jacobian controls volume scaling, while and control derivative scaling.
The factor is the fundamental Sobolev scaling law on a shape-regular mesh.
These estimates allow reference-element calculations to become uniform finite element estimates on the physical mesh.
For further reading, see the discussions of Sobolev spaces and affine scaling in Brenner & Scott (2010) and Ern & Guermond (2004), and the finite element framework in Ciarlet (1978).
- Brenner, S. C., & Scott, L. R. (2010). The mathematical theory of finite element methods (3. ed.). Springer.
- Ern, A., & Guermond, J.-L. (2004). Theory and Practice of Finite Elements (S. S. Antman, J. E. Marsden, & L. Sirovich, Eds.; Vol. 159). Springer New York. 10.1007/978-1-4757-4355-5
- Ciarlet, P. G. (1978). The finite element method for elliptic problems. North-Holland Pub. Co. Sole distributors for the U.S.A.