Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

Lecture 2 — Function spaces, meshes, and affine scaling

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:

  1. an analytic layer, which measures integrability and differentiability in LpL^p and Sobolev norms;

  2. 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 Ω⊂Rd\Omega\subset\mathbb{R}^d be an open, bounded domain. A classical formulation of a boundary-value problem asks for a function uu satisfying a differential equation at every point of Ω\Omega. This formulation is often too restrictive:

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 L2(Ω)L^2(\Omega), which leads naturally to H1(Ω)H^1(\Omega) and H01(Ω)H_0^1(\Omega).

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 α=(α1,…,αd)∈N0d\alpha=(\alpha_1,\ldots,\alpha_d)\in\mathbb{N}_0^d. We use the notation

∣α∣:=α1+⋯+αd,Dαu:=∂∣α∣u∂x1α1⋯∂xdαd.|\alpha| := \alpha_1+\cdots+\alpha_d, \qquad D^\alpha u := \frac{\partial^{|\alpha|}u} {\partial x_1^{\alpha_1}\cdots\partial x_d^{\alpha_d}}.

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 u∈Lloc1(Ω)u\in L^1_{\mathrm{loc}}(\Omega). A function v∈Lloc1(Ω)v\in L^1_{\mathrm{loc}}(\Omega) is the weak derivative DαuD^\alpha u if

∫Ωv φ dx=(−1)∣α∣∫Ωu Dαφ dx∀φ∈C0∞(Ω).\int_\Omega v\,\varphi\,\mathrm{d}x =(-1)^{|\alpha|}\int_\Omega u\,D^\alpha\varphi\,\mathrm{d}x \qquad\forall \varphi\in C_0^\infty(\Omega).

The test function φ\varphi 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 u(x)=∣x∣u(x)=|x| on (−1,1)(-1,1). The function is not differentiable at the origin, but it has the weak derivative

u′(x)=sign⁡(x)for almost every x.u'(x)=\operatorname{sign}(x)\quad\text{for almost every }x.

Since sign⁡(x)∈Lp(−1,1)\operatorname{sign}(x)\in L^p(-1,1) for every finite pp, we have u∈W1,p(−1,1)u\in W^{1,p}(-1,1). The second distributional derivative is 2δ02\delta_0, which is not an LpL^p-function. Therefore u∉W2,p(−1,1)u\notin W^{2,p}(-1,1).

By contrast, a jump is already too singular for W1,pW^{1,p}. Let H(x)=0H(x)=0 for x<0x<0 and H(x)=1H(x)=1 for x>0x>0. Its distributional derivative is δ0\delta_0, so H∉W1,p(−1,1)H\notin W^{1,p}(-1,1) for any finite pp. This is the analytic reason why a globally H1H^1-conforming finite element function must be continuous across an interior edge in two dimensions.

3. Lebesgue spaces

For 1≤p<∞1\leq p<\infty, the Lebesgue space Lp(Ω)L^p(\Omega) is

Lp(Ω):={u measurable:∫Ω∣u(x)∣p dx<∞},L^p(\Omega):=\left\{u\text{ measurable}: \int_\Omega |u(x)|^p\,\mathrm{d}x<\infty\right\},

with norm

∥u∥Lp(Ω):=(∫Ω∣u(x)∣p dx)1/p.\|u\|_{L^p(\Omega)} :=\left(\int_\Omega |u(x)|^p\,\mathrm{d}x\right)^{1/p}.

For p=∞p=\infty, we use the essential supremum:

∥u∥L∞(Ω):=ess sup⁡x∈Ω∣u(x)∣.\|u\|_{L^\infty(\Omega)} :=\operatorname*{ess\,sup}_{x\in\Omega}|u(x)|.

The adjective essential means that changing uu on a set of measure zero does not change the norm.

If 1≤p≤∞1\leq p\leq\infty and qq is its conjugate exponent,

1p+1q=1,\frac1p+\frac1q=1,

then Hölder’s inequality states

∣∫Ωuv dx∣≤∥u∥Lp(Ω)∥v∥Lq(Ω).\left|\int_\Omega uv\,\mathrm{d}x\right| \leq \|u\|_{L^p(\Omega)}\|v\|_{L^q(\Omega)}.

For p=q=2p=q=2, this is the Cauchy–Schwarz inequality. Minkowski’s inequality

∥u+v∥Lp(Ω)≤∥u∥Lp(Ω)+∥v∥Lp(Ω)\|u+v\|_{L^p(\Omega)} \leq \|u\|_{L^p(\Omega)}+\|v\|_{L^p(\Omega)}

makes Lp(Ω)L^p(\Omega) a Banach space. The special space L2(Ω)L^2(\Omega) is a Hilbert space with inner product

(u,v)L2(Ω):=∫Ωu(x)v(x) dx.(u,v)_{L^2(\Omega)} :=\int_\Omega u(x)v(x)\,\mathrm{d}x.

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 Rd\mathbb{R}^d, consider u(x)=∣x∣−βu(x)=|x|^{-\beta}. In polar coordinates,

∫B1(0)∣u∣p dx∼∫01rd−1−βp dr.\int_{B_1(0)}|u|^p\,\mathrm{d}x \sim \int_0^1 r^{d-1-\beta p}\,\mathrm{d}r.

Consequently,

∣x∣−β∈Lp(B1(0))⟺βp<d.|x|^{-\beta}\in L^p(B_1(0)) \quad\Longleftrightarrow\quad \beta p<d.

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 k≥0k\geq0 and 1≤p≤∞1\leq p\leq\infty, define

Wk,p(Ω):={u∈Lp(Ω):Dαu∈Lp(Ω) for every ∣α∣≤k},W^{k,p}(\Omega) :=\left\{u\in L^p(\Omega): D^\alpha u\in L^p(\Omega)\text{ for every }|\alpha|\leq k\right\},

where the derivatives are weak derivatives. For p<∞p<\infty, the standard norm is

∥u∥Wk,p(Ω):=(∑∣α∣≤k∥Dαu∥Lp(Ω)p)1/p.\|u\|_{W^{k,p}(\Omega)} :=\left(\sum_{|\alpha|\leq k} \|D^\alpha u\|_{L^p(\Omega)}^p\right)^{1/p}.

For p=∞p=\infty, replace the sum by a maximum:

∥u∥Wk,∞(Ω):=max⁡∣α∣≤k∥Dαu∥L∞(Ω).\|u\|_{W^{k,\infty}(\Omega)} :=\max_{|\alpha|\leq k} \|D^\alpha u\|_{L^\infty(\Omega)}.

The order-kk seminorm keeps only the derivatives of exactly order kk:

∣u∣Wk,p(Ω):=(∑∣α∣=k∥Dαu∥Lp(Ω)p)1/p(p<∞).|u|_{W^{k,p}(\Omega)} :=\left(\sum_{|\alpha|=k} \|D^\alpha u\|_{L^p(\Omega)}^p\right)^{1/p} \qquad (p<\infty).

For p=∞p=\infty, use the maximum over ∣α∣=k|\alpha|=k. The seminorm may vanish for nonzero functions: if Ω\Omega is connected, then ∣u∣Wk,p(Ω)=0|u|_{W^{k,p}(\Omega)}=0 implies that uu is a polynomial of degree at most k−1k-1.

The Hilbert-space case is denoted by

Hk(Ω):=Wk,2(Ω).H^k(\Omega):=W^{k,2}(\Omega).

Its inner product and norm are

(u,v)Hk(Ω):=∑∣α∣≤k(Dαu,Dαv)L2(Ω),∥u∥Hk(Ω):=(u,u)Hk(Ω).(u,v)_{H^k(\Omega)} :=\sum_{|\alpha|\leq k}(D^\alpha u,D^\alpha v)_{L^2(\Omega)}, \qquad \|u\|_{H^k(\Omega)}:=\sqrt{(u,u)_{H^k(\Omega)}}.

We often write ∥u∥k,p,Ω\|u\|_{k,p,\Omega} and ∣u∣k,p,Ω|u|_{k,p,\Omega} for the norm and seminorm, and omit Ω\Omega when it is clear from the context.

4.1 The spaces W0k,pW_0^{k,p} and H01H_0^1

The space with homogeneous boundary values is defined by closure:

W0k,p(Ω):=C0∞(Ω)‾∥⋅∥Wk,p(Ω).W_0^{k,p}(\Omega) :=\overline{C_0^\infty(\Omega)}^{\|\cdot\|_{W^{k,p}(\Omega)}}.

In particular, H01(Ω)=W01,2(Ω)H_0^1(\Omega)=W_0^{1,2}(\Omega). On a bounded Lipschitz domain, the trace theorem identifies H01(Ω)H_0^1(\Omega) with the H1H^1-functions whose trace vanishes on ∂Ω\partial\Omega. 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 CΩ>0C_\Omega>0 such that

∥v∥L2(Ω)≤CΩ∥∇v∥L2(Ω)∀v∈H01(Ω).\|v\|_{L^2(\Omega)} \leq C_\Omega\|\nabla v\|_{L^2(\Omega)} \qquad\forall v\in H_0^1(\Omega).

Thus, on H01(Ω)H_0^1(\Omega), the seminorm

∣v∣H1(Ω)=∥∇v∥L2(Ω)|v|_{H^1(\Omega)}=\|\nabla v\|_{L^2(\Omega)}

is a norm equivalent to the full H1H^1-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 Wk,pW^{k,p}-functions become continuous when kp>dkp>d, although the precise statement involves the Sobolev embedding theorems and the regularity of the domain. In two dimensions:

This distinction matters for finite elements. A piecewise polynomial function can be smooth inside each cell and still fail to belong to H1(Ω)H^1(\Omega) 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

Ω=⋃T∈ThT‾˚,\Omega=\mathring{\overline{\bigcup_{T\in\mathcal{T}_h}T}},

where Th\mathcal{T}_h is the triangulation and TT denotes an individual cell. Distinct cells may intersect only in a common lower-dimensional entity:

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 TT, let hTh_T denote its diameter:

hT:=sup⁡x,y∈T∣x−y∣.h_T:=\sup_{x,y\in T}|x-y|.

For a simplex, let ρT\rho_T denote its inradius, the radius of the largest ball contained in TT. For a general cell, one may use an analogous inscribed radius. The global mesh size and minimum inradius are

h:=max⁡T∈ThhT,ρ:=min⁡T∈ThρT.h:=\max_{T\in\mathcal{T}_h}h_T, \qquad \rho:=\min_{T\in\mathcal{T}_h}\rho_T.

A family of meshes is shape-regular if there is a constant σ>0\sigma>0, independent of the refinement level, such that

ρT≥σhT∀T∈Th.\rho_T\geq \sigma h_T \qquad\forall T\in\mathcal{T}_h.

Equivalently, no cell is allowed to become arbitrarily thin relative to its diameter. The constant σ\sigma controls the constants in the scaling estimates below.

A mesh is quasi-uniform when all its cells have comparable size, for example

hT∼h∀T∈Th.h_T\sim h \qquad\forall T\in\mathcal{T}_h.

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:

∣v∣Wk,p(Th):=(∑T∈Th∣v∣Wk,p(T)p)1/p.|v|_{W^{k,p}(\mathcal{T}_h)} :=\left(\sum_{T\in\mathcal{T}_h} |v|_{W^{k,p}(T)}^p\right)^{1/p}.

The corresponding broken norm is defined by summing all derivatives of order at most kk cell by cell. A broken norm does not control jumps across faces. To obtain a conforming subspace of H1(Ω)H^1(\Omega), 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 dd-simplex, use the reference simplex

T^:=conv⁡{0,e1,…,ed},\widehat{T} :=\operatorname{conv}\{0,e_1,\ldots,e_d\},

where e1,…,ede_1,\ldots,e_d are the canonical basis vectors. For a triangle, T^\widehat T has vertices (0,0)(0,0), (1,0)(1,0), and (0,1)(0,1).

Let TT be a physical simplex with vertices x0,…,xdx_0,\ldots,x_d. The affine map FT:T^→TF_T:\widehat T\to T is

FT(x^)=BTx^+bT,bT=x0,BT=[x1−x0  ⋯  xd−x0].F_T(\widehat x)=B_T\widehat x+b_T, \qquad b_T=x_0, \qquad B_T=[x_1-x_0\;\cdots\;x_d-x_0].

If the vertices are not degenerate, BTB_T is invertible and

x^=FT−1(x)=BT−1(x−bT).\widehat x=F_T^{-1}(x)=B_T^{-1}(x-b_T).

The absolute Jacobian determinant is constant on TT:

JT:=∣det⁡BT∣.J_T:=|\det B_T|.

The change-of-variables formula is therefore particularly simple:

∫Tv(x) dx=JT∫T^(v∘FT)(x^) dx^.\int_T v(x)\,\mathrm{d}x =J_T\int_{\widehat T}(v\circ F_T)(\widehat x)\,\mathrm{d}\widehat x.

We use a hat for a function on the reference element:

v^(x^):=v(FT(x^)).\widehat v(\widehat x):=v(F_T(\widehat x)).

For first derivatives, the chain rule gives

∇^v^(x^)=BTT∇v(FT(x^)),∇v(FT(x^))=BT−T∇^v^(x^).\widehat\nabla\widehat v(\widehat x) =B_T^T\nabla v(F_T(\widehat x)), \qquad \nabla v(F_T(\widehat x)) =B_T^{-T}\widehat\nabla\widehat v(\widehat x).

The matrix BT−TB_T^{-T}, not BT−1B_T^{-1} itself, transforms gradients. This transpose is easy to miss and is important when implementing local stiffness matrices.

7. Scaling of LpL^p and Sobolev norms

The change of variables already gives the exact LpL^p scaling. If v^=v∘FT\widehat v=v\circ F_T, then, for 1≤p<∞1\leq p<\infty,

∥v^∥Lp(T^)=JT−1/p∥v∥Lp(T).\|\widehat v\|_{L^p(\widehat T)} =J_T^{-1/p}\|v\|_{L^p(T)}.

For p=∞p=\infty, the Jacobian does not appear:

∥v^∥L∞(T^)=∥v∥L∞(T).\|\widehat v\|_{L^\infty(\widehat T)} =\|v\|_{L^\infty(T)}.

For a first derivative, the gradient transformation and the change of variables give

∣v^∣W1,p(T^)≤∥BT∥JT−1/p∣v∣W1,p(T),|\widehat v|_{W^{1,p}(\widehat T)} \leq \|B_T\|J_T^{-1/p}|v|_{W^{1,p}(T)},

and, in the other direction,

∣v∣W1,p(T)≤∥BT−1∥JT1/p∣v^∣W1,p(T^).|v|_{W^{1,p}(T)} \leq \|B_T^{-1}\|J_T^{1/p} |\widehat v|_{W^{1,p}(\widehat T)}.

More generally, for integer k≥0k\geq0, affine changes of variables yield the estimates

∣v^∣Wk,p(T^)≲∥BT∥kJT−1/p∣v∣Wk,p(T),|\widehat v|_{W^{k,p}(\widehat T)} \lesssim \|B_T\|^kJ_T^{-1/p}|v|_{W^{k,p}(T)},

and

∣v∣Wk,p(T)≲∥BT−1∥kJT1/p∣v^∣Wk,p(T^).|v|_{W^{k,p}(T)} \lesssim \|B_T^{-1}\|^kJ_T^{1/p} |\widehat v|_{W^{k,p}(\widehat T)}.

The hidden constants depend on kk, pp, 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 BTB_T. 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 dd-dimensional simplices,

∥BT∥≲hT,∥BT−1∥≲ρT−1,JT∼hTd.\|B_T\|\lesssim h_T, \qquad \|B_T^{-1}\|\lesssim \rho_T^{-1}, \qquad J_T\sim h_T^d.

The last relation uses shape regularity. Without it, the determinant can be much smaller than hTdh_T^d because a cell can be long and thin.

Combining these estimates gives the familiar rule

∣v∣Wk,p(T)≲hTd/p−k∣v∘FT∣Wk,p(T^),|v|_{W^{k,p}(T)} \lesssim h_T^{d/p-k} |v\circ F_T|_{W^{k,p}(\widehat T)},

and the reverse inequality

∣v∘FT∣Wk,p(T^)≲hTk−d/p∣v∣Wk,p(T).|v\circ F_T|_{W^{k,p}(\widehat T)} \lesssim h_T^{k-d/p}|v|_{W^{k,p}(T)}.

The exponent has a clear interpretation:

For hT≤1h_T\leq1, the lower-order terms can be absorbed into the highest-order term, giving analogous full-norm estimates:

∥v∥Wk,p(T)≲hTd/p−k∥v∘FT∥Wk,p(T^).\|v\|_{W^{k,p}(T)} \lesssim h_T^{d/p-k} \|v\circ F_T\|_{W^{k,p}(\widehat T)}.

8. Two sanity checks

8.1 An interval

Let T=[a,a+h]T=[a,a+h] and T^=[0,1]\widehat T=[0,1]. The affine map is

FT(x^)=a+hx^,JT=h.F_T(\widehat x)=a+h\widehat x, \qquad J_T=h.

If v^=v∘FT\widehat v=v\circ F_T, then

∣v^∣Wk,p(0,1)=hk−1/p∣v∣Wk,p(a,a+h).|\widehat v|_{W^{k,p}(0,1)} =h^{k-1/p}|v|_{W^{k,p}(a,a+h)}.

Equivalently,

∣v∣Wk,p(a,a+h)=h1/p−k∣v^∣Wk,p(0,1).|v|_{W^{k,p}(a,a+h)} =h^{1/p-k}|\widehat v|_{W^{k,p}(0,1)}.

For k=0k=0, this is the volume scaling h1/ph^{1/p}. Every derivative adds a factor h−1h^{-1}, as expected from the chain rule.

8.2 The Poisson energy on one cell

For p=2p=2 and k=1k=1, the Dirichlet energy on one cell is

∫T∣∇v∣2 dx∼hTd−2∫T^∣∇^(v∘FT)∣2 dx^,\int_T|\nabla v|^2\,\mathrm{d}x \sim h_T^{d-2} \int_{\widehat T}|\widehat\nabla(v\circ F_T)|^2 \,\mathrm{d}\widehat x,

up to constants controlled by shape regularity. Therefore:

The local mass integral instead scales as

∫Tv2 dx∼hTd∫T^(v∘FT)2 dx^.\int_T v^2\,\mathrm{d}x \sim h_T^d\int_{\widehat T}(v\circ F_T)^2\,\mathrm{d}\widehat x.

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 hTh_T, but whose altitude is εhT\varepsilon h_T with ε→0\varepsilon\to0. Then

ρT≈εhT,∥BT−1∥≈(εhT)−1.\rho_T\approx \varepsilon h_T, \qquad \|B_T^{-1}\|\approx(\varepsilon h_T)^{-1}.

The inverse-gradient estimate contains ∥BT−1∥\|B_T^{-1}\|, so its constant grows like ε−1\varepsilon^{-1}. A formula that depends only on hTh_T is no longer uniform. In practice, badly shaped cells can lead to:

Shape regularity is therefore the geometric hypothesis that lets us replace a matrix estimate by a scalar estimate involving hTh_T.

10. From scaling to finite element approximation

Let Pk(T^)P^k(\widehat T) be a polynomial space on the reference element. The corresponding physical-cell space is

Pk(T):={v^∘FT−1:v^∈Pk(T^)}.P^k(T):=\{\widehat v\circ F_T^{-1}: \widehat v\in P^k(\widehat T)\}.

The reference element has finitely many basis functions. Once these are known, the affine map transports them to every cell. This has three consequences:

  1. locality: element matrices and vectors can be computed cell by cell;

  2. reuse: the reference basis and quadrature rule are shared by all cells;

  3. scaling: estimates on T^\widehat T transfer to TT with constants controlled by hTh_T 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

Vh⊂H1(Ω)V_h\subset H^1(\Omega)

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 Pk(T)P^k(T) 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 hh-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:

  1. Identify the domain Ω\Omega and the regularity required of its boundary.

  2. Choose the Sobolev space in which the weak solution is sought.

  3. Specify the cells T∈ThT\in\mathcal{T}_h, their diameters hTh_T, and their inradii ρT\rho_T.

  4. Check whether the mesh family is shape-regular and, if needed, quasi-uniform.

  5. Choose a reference cell T^\widehat T and write the affine map FTF_T.

  6. Compute BTB_T, BT−1B_T^{-1}, and JT=∣det⁡BT∣J_T=|\det B_T|.

  7. Transform functions, gradients, and integrals to T^\widehat T.

  8. Use the scaling rules to track the powers of hTh_T.

  9. Glue local degrees of freedom only when the desired global Sobolev conformity is satisfied.

Summary

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).

References
  1. Brenner, S. C., & Scott, L. R. (2010). The mathematical theory of finite element methods (3. ed.). Springer.
  2. 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
  3. Ciarlet, P. G. (1978). The finite element method for elliptic problems. North-Holland Pub. Co. Sole distributors for the U.S.A.