How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Crouzeix–Raviart finite elements
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Distributions Test Functions and Differentiation
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite-element meshes and interpolation
- Foundations of the Real Numbers for Analysis
- Fredholm Elliptic Problems and the Elliptic Spectrum
- Fubini and Change of Variables
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Harmonic Functions and Mean Values in Rn
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lax--Milgram and Weak Elliptic Solutions
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Schwartz Space and the Plancherel Theorem
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Approximation and Sobolev Extension
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Sobolev Traces and Zero Boundary Values
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Variational crimes and Strang lemmas
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Derivatives and Sobolev Spaces
2 · Summary
The P1 Crouzeix–Raviart space consists of cellwise affine functions whose facet means agree on interior facets and vanish on boundary facets. These degrees of freedom do not impose pointwise continuity. The chapter constructs the local and global face bases, defines the face-average interpolant, and proves trace, interpolation, jump, and discrete Poincare estimates on matching shape-regular simplex meshes.
For Poisson's problem, cellwise Green identities give a consistency residual; the face means cancel while the remaining terms are bounded by local trace fluctuations and jumps. The energy estimate uses the nonconforming second Strang theorem through a bounded cellwise-gradient extension. The L2 estimate is conditional on a Dirichlet Poisson smoothing index . Normal-gradient traces require with ; these strict regularity conditions are part of the claims.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The local P1 Crouzeix–Raviart element
Definition
Let and let be a nondegenerate affine -simplex with vertices and facets opposite . Write for its barycentric coordinate functions, so and . The local Crouzeix–Raviart polynomial space is , the real affine functions on . Its face-average functionals are The candidate dual shape polynomial associated with is The next item proves that these functionals are unisolvent and that the displayed polynomials form their dual basis. No pointwise continuity across different cells is part of this local element.
Fractional Sobolev regularity on a simplex
Definition
Assume Countable Choice. Let be a bounded open set, , and let be a measurable real function on . Define with the diagonal integrand set to zero, and , using almost-everywhere classes and norm . For , write when each weak derivative belongs to , and define For vector fields, use the sum of the componentwise squared norms. Use these definitions on each cell and on the full domain , with . At , set , interpret , and set with the integer-order membership of Integer-order Sobolev spaces and their norms, retaining the displayed full-norm rule. Thus . This Hessian convention counts mixed derivatives twice: its full norm is equivalent to, rather than identical with, the ordinary multi-index norm, with . The local seminorm is the restriction of the Slobodeckij convention in The Gagliardo--Slobodeckij space on Euclidean space to .
A Poincare bound on a slab-bounded domain
Statement
Let be open and satisfy for a unit vector and all , with . Then every satisfies The argument assumes Countable Choice through the stated Sobolev, product-measure, and affine change-of-variables interfaces; it does not use the Axiom of Choice.
Facts & Assumptions
Given: Countable Choice, an open domain contained in the slab , and , where is the -closure of .
The vector-valued fundamental theorem of calculus applies to smooth functions on a compact interval. (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz)
Countable Choice gives Tonelli/Fubini for nonnegative integrands on the Euclidean product spaces used below. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, The Axiom of Countable Choice ())
For an orthogonal matrix , and ; the linear affine map is a diffeomorphism, so change of variables preserves integrals of nonnegative measurable functions. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
Holder's inequality with exponents gives and, in particular, . (Holder's inequality for integrals, including the endpoint cases)
Proof
First let and extend it by zero to . Write with . For fixed and , the fundamental theorem [F1] gives , since the zero extension vanishes at . Holder's inequality [F4], applied on and then enlarged to , yields .
Integrate step 1.1 over and . Choose an orthonormal basis of and let have those basis vectors followed by as its columns. Then sends to ; Tonelli [F2] and , in [F3] give the coordinate integral over the slab. The zero extension of and its derivative vanish off , so those slab integrals equal their integrals over . Thus .
Let . By the closure definition of , choose a single with . The triangle inequality follows by expanding and applying [F4] to the cross term; hence [F4] and step 2.1 give . This holds for every , so letting proves the statement without selecting a sequence of approximants.
Face averages are unisolvent for the local Crouzeix–Raviart element
Statement
For the element of The local P1 Crouzeix–Raviart element, the face-average functionals form an isomorphism . In particular, so every has the unique expansion .
Facts & Assumptions
Given: A nondegenerate affine -simplex , its facets , barycentric coordinates , and the face-average functionals and candidate shape polynomials of The local P1 Crouzeix–Raviart element.
The barycentric coordinates are affine, satisfy , and sum to one on . (The local P1 Crouzeix–Raviart element)
The average of an affine function over a simplex facet equals its value at that facet's barycenter; this follows by integrating each affine coordinate in the affine parametrization of the facet. (The local P1 Crouzeix–Raviart element)
Proof
Let be the barycenter of . By [F2], the face average of an affine polynomial on is . At , the barycentric coordinates of the vertices of are all , while the coordinate opposite is zero. Therefore if and if . Hence , which proves the displayed duality identities.
The polynomials are linearly independent: applying to gives by step 1.1. Since has dimension , they form a basis. Applying the same functionals to gives zero for every face; expansion in this basis then gives zero coefficients. This proves existence and uniqueness of the stated expansion.
The global homogeneous Crouzeix–Raviart space
Definition
Let be a bounded connected Lipschitz polyhedral domain with a finite matching affine simplicial mesh . Here Lipschitz polyhedral means that the boundary is a finite union of flat simplex faces and, near each boundary point after a rigid coordinate change, lies on one side of a Lipschitz graph. Let and be its interior and boundary facets. For a cellwise affine function , write for its polynomial restriction to . The broken gradient is defined by . For a facet and an integrable function on , let and write . The homogeneous Crouzeix–Raviart space is The ordering on an interior facet is arbitrary; the zero-mean condition is independent of that ordering. The functions need not agree pointwise on a facet and need not belong to .
Fractional face traces and cellwise Green identity on a simplex
Statement
Assume Countable Choice. Let be a shape-regular affine -simplex, a facet, and . Every has a single-valued trace . For , and while for , and the face-mean fluctuation is bounded by . The constant depends only on , the shape-regularity bound, and .
If , , and distributionally, then for every , Here is the outward unit normal. The trace threshold is used to make the normal-gradient trace an function.
The two cell traces of a global function agree on a shared interior facet, and the trace of a global function vanishes on a boundary facet. More generally, if and , then its two traces on each shared interior facet agree almost everywhere.
Facts & Assumptions
Given: Countable Choice, a shape-regular affine simplex, the local Slobodeckij convention of Fractional Sobolev regularity on a simplex, and the real Sobolev spaces of Integer-order Sobolev spaces and their norms.
For a measurable face or cell of positive measure, write .
On , the double-integral Slobodeckij seminorm is equivalent to the sum of coordinate-direction difference integrals; in particular it controls the integral in any chosen orthonormal direction. (The coordinate-direction form of the Slobodeckij seminorm)
Smooth functions are dense in on the reference simplex and in for . (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex, Compactly supported smooth functions are dense in Slobodeckij spaces)
A smooth vector field on an affine simplex satisfies Gauss–Green with the outward facet normals. (Gauss–Green formula on an affine simplex)
The affine map of a shape-regular simplex has determinant comparable to , singular values comparable to , and facet Jacobians comparable to . (Shape regularity controls affine simplex geometry)
A compact set inside an open set has a smooth cutoff supported in the open set and equal to one near the compact set; compactness gives a finite subcover of the closed simplex. (Test function cutoffs and euclidean localization, Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line)
For nonnegative measurable integrands, Tonelli permits the iterated integrals and the changes between layer, face, and volume integrations used below. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, The Axiom of Countable Choice ())
Smooth functions on an open set are dense in its finite-order Sobolev spaces; is the closure of compactly supported smooth functions. (Meyers–Serrin density on an arbitrary open set, Zero-boundary Sobolev space as a norm closure)
The Poincare–Wirtinger inequality controls a mean-zero function on the reference simplex by its gradient. (Poincare–Wirtinger inequality on a reference simplex)
A smooth cutoff supported in an interior neighborhood can localize a function, and smooth functions are dense in for . (Test function cutoffs and euclidean localization, Compactly supported smooth functions are dense in Slobodeckij spaces)
Countable unions of measurable null sets are null. (Finite and countable subadditivity of measures)
For , standard mollifiers converge in ; in they converge together with all first weak derivatives. (Complex translation, convolution, approximate identities, and mollification, Interior mollification commutes with weak derivatives)
Smooth functions compactly supported in an open set are dense in its space, so affine dilations are continuous in by approximation and change of variables. (Smooth compactly supported functions of an open set are dense in , A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
Under an invertible affine map , weak derivatives obey ; in particular the homothety gives . The assertion follows by testing against compactly supported smooth functions and applying affine change of variables. (Affine pullback of weak derivatives and Sobolev seminorms)
For a smooth scalar cutoff , weakly. (Weak Leibniz rule with a smooth factor)
Holder's inequality with exponents makes products of volume or face functions integrable and gives . (Holder's inequality for integrals, including the endpoint cases)
A compactly supported function on an open set extends by zero to . (Compactly supported Sobolev functions extend by zero in every integer order)
Proof
Fractional Poincare inequality. Put . Since on and by [F4], The equality follows by expanding the square and evaluating the two cross terms; the inequality follows by multiplying the Gagliardo integrand by .
Fractional extension from the reference simplex. Cover its closed simplex by finitely many affine coordinate neighborhoods: at a point on a face of codimension , the vanishing barycentric coordinates are independent and the simplex is locally the orthant where those coordinates are positive. Compactness gives a finite cover with smaller compact subsets still covering the closed simplex. By [F5], choose smooth cutoffs supported in the corresponding neighborhoods and equal to one on those smaller sets; divide them by their positive sum near the closed simplex to obtain a finite smooth partition of unity. Multiplication by a smooth cutoff is bounded on : split into and , use , and integrate the latter radial kernel, finite exactly for . Each localized piece is supported away from the artificial edge of its chart, so extending by zero there adds at most to the seminorm: all cross-pairs have distance at least the support-to-edge distance. In orthant coordinates extend across each active coordinate hyperplane by even reflection. Same-side pairs reproduce the original integral; for opposite-side pairs with , , so their Gagliardo integrand is bounded by the corresponding original-side integrand. Iterating over the finitely many active coordinates, pulling back the nonsingular affine charts, and summing the finitely many extensions gives a bounded linear extension . The same construction for uses the ordinary even-reflection weak derivative formula; the zero extension of each compactly supported localized piece is justified by [F16].
The trace bound. First take smooth on the closed reference simplex. Fix a facet and its opposite vertex , and set . Then on every other facet , while on . Gauss–Green applied to gives On the fixed reference simplex, and is bounded, so Holder [F15] gives . By the density in [F2], this defines the trace for every and proves its boundedness. On a physical cell, apply the affine scaling in [F4] to obtain The constants are uniform over shape-regular cells.
Trace on a hyperplane for . For a smooth on , let . For each , Cauchy–Schwarz and the identity give . The geometric series converges because , and . Integrating in and using [F1] on the normal direction yields By density [F2] this restriction extends uniquely to . Apply it to the extension in step 1.2, after an orthogonal change of coordinates, to define and obtain a bounded trace on each reference facet. If two extensions agree on the simplex, their difference vanishes on the one-sided normal slices; the same dyadic averages show its trace is zero, so the trace is independent of the extension.
Density in the graph norm. Let with , where , and write . Contract the simplex toward its barycenter by . For each fixed , maps an open neighborhood of into , so is defined there. Apply the affine pullback rule [F13] on (with image ) to obtain distributionally. For , pull back to the reference simplex by the affine reference map; change of variables in the double integral and the fixed positive affine Jacobian bounds give equivalent local norms. Transfer the finite-chart reflection extension of step 1.2 to by the same affine change of variables. Euclidean smooth density [F2] then supplies functions smooth near with in . Put . For , changing variables , gives and , so these pullbacks are uniformly bounded on . The same change-of-variables estimate holds for every input in , so the pullback operator norms are uniformly bounded for . For a fixed smooth , and its Lipschitz constant tend uniformly to zero; the estimate and finiteness of that integral for give convergence in . Approximation and the uniform pullback bound therefore give . For , transfer the reference-simplex smooth density [F2] to using [F13]; its affine derivative rule and change of variables give a uniform pullback bound when , and smooth approximants converge under in , hence so does . By [F12], in , so there as well. For each fixed , choose by [F5] a smooth cutoff equal to one near . The weak product rule [F14] gives . The zero extension of belongs to : the fractional multiplier and separated-boundary estimates are those already proved in step 1.2, and for the product rule and compact support give the same conclusion. Its distributional divergence is the zero extension of : for a test function on , insert a cutoff equal to one near the compact support of and use the weak divergence identity in . This divergence is in . Mollify . The fractional density proof [F2] gives convergence in when ; the convergence follows from [F11] when . For a test function, the divergence of each mollification equals the mollification of : expand the convolution integral and use the distributional divergence identity; all integrals are absolutely integrable by [F15] on the compact supports, so Tonelli applied to the absolute values justifies the interchange in [F6]. By [F11], these divergences converge in . For small radii the cutoff is identically one throughout every convolution neighborhood of points of , so the smooth fields restrict to approximations of and on . Choose for each a radius small enough that both local errors are below . The resulting smooth converge to in and their divergences converge to in . This is convergence in the graph norm of .
Face-mean fluctuation. On the reference simplex, for , apply step 2.1 to and use step 1.1; the trace seminorm is unchanged by subtracting a constant. Since the face average is the best constant, For , take smooth and apply [F3] to with the vector field from step 1.3. Holder [F15] and [F8] give on the reference simplex; density and step 1.3 extend this to . The affine scaling factors in [F4] give the stated physical powers and . For , the full trace bound follows by applying step 2.1 to and adding the trace of the cell mean, . For , the full bound is step 1.3.
Green identity. For each smooth field from step 2.2 and smooth on a neighborhood of , [F3] applied to gives For arbitrary , transfer to the reference simplex by an affine map, using [F13] to get norm equivalence; approximate there by functions smooth near its closure using [F2], then compose with the inverse affine map. This gives smooth-near- approximants converging to in . Holder's inequality [F15] makes the volume products integrable, and the bounded traces of step 1.3 and [F15] justify passage in both volume terms and the trace pairings. Now pass to using step 2.2: the volume terms converge by and graph convergence, while the boundary terms converge by the trace estimate of step 2.1 applied to . Taking , , proves the asserted identity. Interior trace compatibility for a global H^1 function follows as follows. Approximate it in H^1(Ω) by smooth functions on Ω using [F7]. On each compact subfacet G in the relative interior of a shared facet F, G lies inside Ω, so each approximant is a single smooth function near G and its two restrictions have the same trace there. The bounded cell trace map of step 1.3 makes both traces converge in L^2(G); hence the limits agree on G. Exhaust the relative interior of F by countably many compact subfacets; the remaining facet boundary is a finite union of lower-dimensional affine faces and has (d−1)-measure zero by a grid cover. Thus the traces agree almost everywhere on F. For a boundary facet, approximate an H^1_0(Ω) function by smooth compactly supported functions and use the same trace bound to see its trace is zero.
For and a compact subfacet in the relative interior of an interior mesh facet, choose by [F9] a smooth cutoff supported in and equal to one near . The product extends by zero to : within the smooth multiplier estimate follows by splitting the difference as in step 1.2, and pairs across have one point a positive distance from the compact support. Approximate this extension in by smooth functions using [F9]. The trace estimate of step 2.1 on each incident simplex shows that both restrictions converge in to the same limit, because each approximant is one smooth function across . Exhaust the relative interior of the facet by a countable increasing sequence of compact subfacets. Its boundary is a finite union of lower-dimensional affine faces and has -dimensional measure zero by covering those faces with arbitrarily thin grids. The exceptional sets on the compact subfacets are null, so [F10] gives equality almost everywhere on the full facet.
A Dirichlet Poisson smoothing index
Definition
Assume Countable Choice. Let be a bounded domain and let . Say that has a Dirichlet Poisson smoothing index with constant if, for every , there is a unique satisfying and with This is a hypothesis about the continuous adjoint Poisson problem. It is not asserted for every bounded domain.
Interior face means form the global Crouzeix–Raviart degrees of freedom
Statement
For every interior facet , define to equal on each cell incident to and zero on all other cells, where is the local shape polynomial of The local P1 Crouzeix–Raviart element. Then is a basis of the space in The global homogeneous Crouzeix–Raviart space. The face mean is single-valued for and .
Facts & Assumptions
Given: A finite matching affine simplicial mesh, the homogeneous global space of The global homogeneous Crouzeix–Raviart space, and local unisolvence from Face averages are unisolvent for the local Crouzeix–Raviart element.
On each cell the face-average functionals are a basis of the dual of , and has face means . (Face averages are unisolvent for the local Crouzeix–Raviart element)
Proof
The two traces of on an interior facet have equal integrals by definition, so is single-valued. For an interior facet , the function has mean one on , mean zero on every other facet of each incident cell by [F1], and is zero on cells not incident to . Thus and for all interior facets .
Let and set . On each cell, and have the same mean on every interior facet and both have mean zero on every boundary facet. Local unisolvence [F1] therefore gives for every cell. Hence the global functions span. Their linear independence follows by applying each single-valued face mean to a linear combination and using step 1.1. The number of basis functions is the number of interior facets, which proves the dimension formula.
The face-average Crouzeix–Raviart interpolant
Definition
Assume Countable Choice. For , use the facet traces of Fractional face traces and cellwise Green identity on a simplex and define its local face-average interpolant by where is the explicit polynomial in The local P1 Crouzeix–Raviart element. On a finite matching mesh, define cellwise by . For a global , the cell traces agree on interior facets and vanish on boundary facets, so this formula has the intended global Crouzeix–Raviart degrees of freedom. The local estimate item proves its fractional approximation bounds.
Face jumps are controlled by the broken gradient
Statement
Assume Countable Choice. For every matching shape-regular simplicial mesh and , On an interior facet, ; on a boundary facet, . The constant depends only on and the shape-regularity bound.
Facts & Assumptions
Given: Countable Choice, a finite matching shape-regular simplicial mesh, and in the global CR space of The global homogeneous Crouzeix–Raviart space.
Countable Choice is required by the shape-regular affine simplex scaling interface used below. (The Axiom of Countable Choice ())
The mean of every interior jump and every boundary trace jump is zero by the defining face-average constraints. (The global homogeneous Crouzeix–Raviart space)
On a shape-regular simplex, , , and adjacent cell/facet diameters are comparable. (Shape regularity controls affine simplex geometry)
Proof
Let be a facet of and let be its barycenter. For any affine on , and by the definition ; hence its face average is exactly . On an interior facet, the jump is affine with zero mean by [F1], hence . On a boundary facet, has zero mean and likewise . Therefore for every , with the absent cell term omitted on the boundary.
Squaring step 1.1 and integrating on gives , where the factor is . By [F2], for each incident cell. Summing over facets counts each cell at most times, proving the estimate.
The Crouzeix–Raviart method for the homogeneous Poisson problem
Definition
Assume Countable Choice. Let and be as in The global homogeneous Crouzeix–Raviart space, let , let , and let . The exact Poisson form and load are An exact solution is a satisfying for every . For , define the broken form and discrete load by The discrete problem is to find such that for every .
Put . For each cell facet , let denote the trace supplied by Fractional face traces and cellwise Green identity on a simplex. For and , define the comparison-space extension Each restriction belongs to , and this extension agrees with when .
On an interior facet choose either ordering and define ; on a boundary facet of set . The mesh-dependent comparison expression is The next items prove the required definiteness, stability, and consistency properties; this definition makes no assertion that .
The broken gradient is a norm on the homogeneous Crouzeix–Raviart space
Statement
For a finite matching mesh of a bounded connected polyhedral domain, is a norm on of The global homogeneous Crouzeix–Raviart space.
Facts & Assumptions
Given: A finite matching affine simplicial mesh of a bounded connected domain and .
A connected open subset of Euclidean space is polygonally connected. (Every connected component of an open subset of is open and polygonally connected)
Interior face averages of agree, and boundary face averages vanish. (The global homogeneous Crouzeix–Raviart space)
Holder's inequality gives the Cauchy--Schwarz bound . (Holder's inequality for integrals, including the endpoint cases)
Proof
Suppose . Then the affine restriction has zero gradient on every cell and is constant . If two cells share an interior facet, [F2] gives , hence .
The cell-adjacency graph is connected. Join interior points of any two cells by a polygonal path in using [F1]. Its compact image has positive distance from . Subdivide the path if necessary to have intermediate vertices and perturb them in small open balls so every segment remains in . For a fixed endpoint and a mesh face of codimension at least two, every endpoint for which meets lies in the proper affine subspace , of dimension at most . Also avoid each facet hyperplane so no perturbed segment lies in one. A finite union of proper affine subspaces cannot cover an open ball: each has empty interior, so successively choose a smaller nonempty open ball disjoint from each one. Choose intermediate vertices successively outside the finitely many forbidden subspaces from the previous vertex; for the last vertex also avoid those from the fixed endpoint at the end of the path. Thus no segment meets the codimension-at-least-two skeleton or lies in a facet hyperplane, so every cell transition is through a relative interior of a whole facet. When mesh faces are endpoints and each crossing is itself a whole facet. This gives an adjacency chain, so all cell constants in step 1.1 agree. Since the bounded mesh has a boundary facet and its face mean is zero by [F2], the common constant is zero.
The broken gradient is linear, and its norm is nonnegative and absolutely homogeneous. For the triangle inequality, expand using the inner product; [F3] bounds the cross term by , so the square is at most . Taking nonnegative square roots gives the triangle inequality. Step 2.1 proves that its kernel is ; hence it is a norm.
Local approximation by the face-average Crouzeix–Raviart interpolant
Statement
Assume Countable Choice and the setup of The face-average Crouzeix–Raviart interpolant, a shape-regular affine mesh, and . The face-average interpolant is defined for every by the traces of Fractional face traces and cellwise Green identity on a simplex and reproduces . Uniformly over all cells, For each facet , If , then the global interpolant has matching interior face means and zero boundary face means, so .
Facts & Assumptions
Given: Countable Choice, a shape-regular affine simplex, the local and global face-average interpolants, and the Slobodeckij regularity convention of Fractional Sobolev regularity on a simplex.
Countable Choice is required by the simplex trace, reference Poincare, and affine shape-scaling suppliers. (The Axiom of Countable Choice ())
For a cell or face of positive measure, write .
The face mean of a continuous affine polynomial is its value at the face barycenter, and the face-average interpolant reproduces every affine polynomial. (Face averages are unisolvent for the local Crouzeix–Raviart element)
Face traces on a simplex are bounded on ; for they satisfy the face-mean estimate in the preceding item. (Fractional face traces and cellwise Green identity on a simplex)
The mean-zero Poincare–Wirtinger inequality holds on the reference simplex. (Poincare–Wirtinger inequality on a reference simplex)
Shape regularity gives , , , and . (Shape regularity controls affine simplex geometry)
Proof
On the reference simplex, each face mean of is bounded by by [F2]. The interpolant is a finite sum of these means times fixed affine shape polynomials, so it is bounded from to . The trace-defined formula of The face-average Crouzeix–Raviart interpolant is therefore continuous on .
First work on the reference simplex. Choose an affine polynomial with and . For , applying the fractional Poincare estimate proved in step 1.1 of Fractional face traces and cellwise Green identity on a simplex to each component of gives . The mean-zero Poincare–Wirtinger inequality [F3] then gives . At , apply [F3] to the mean-zero first derivatives, then again to , obtaining .
Since is affine, reproduction [F1] gives . The reference stability from step 1.1 and the estimates of step 2.1 bound the reference error by . Under the affine map , each face surface Jacobian is constant, so face averages and the interpolant commute with pullback. The fractional gradient seminorm obeys : substitute in the double integral, use and from [F4], and include the factor in the pulled-back gradient. The physical gradient and error scaling factors are respectively and , yielding the two stated powers.
Apply the scaled trace bound [F2] to : Substituting step 3.1 gives the stated face estimate. On an interior facet, both adjacent restrictions of have the same Sobolev trace because ; on a boundary facet the trace of is zero. The global interpolant therefore has matching interior face means and zero boundary means.
A conforming averaging companion for Crouzeix–Raviart functions
Statement
Assume Countable Choice. Let be the bounded connected Lipschitz polyhedral domain and a finite matching shape-regular simplicial mesh of The global homogeneous Crouzeix–Raviart space. For every there is a continuous piecewise affine function with zero boundary trace such that where . In particular, .
Facts & Assumptions
Given: Countable Choice and a finite matching shape-regular triangulation of a bounded connected Lipschitz polyhedral domain and .
Countable Choice is required by the affine shape-scaling and simplex Green interfaces used below. (The Axiom of Countable Choice (), Shape regularity controls affine simplex geometry, Gauss–Green formula on an affine simplex)
The affine bounds in Shape regularity controls affine simplex geometry imply uniform neighboring-cell diameter comparability. At any vertex, the edge matrix of an incident simplex is for one of finitely many fixed invertible reference matrices ; its largest and smallest singular values are therefore both comparable to . Normalize each edge vector to make the columns of unit vectors. The singular-value bounds make each original edge length comparable to and the determinant magnitude of comparable to ; dividing that determinant by the product of edge lengths gives the absolute determinant of a positive uniform lower bound. Write for this uniform bound. Unit column lengths give . Let , a fixed open cube in the positive orthant. Then on , so lies in the open physical vertex cone and in . Apply the actual Lebesgue change-of-variables theorem to the linear diffeomorphism and the indicator of : . Both sets are Borel, since is an invertible continuous linear map, and box volume gives . Thus every physical cone has unit-ball section of volume at least . Distinct incident simplices have disjoint open vertex cones: an overlap direction would put a sufficiently short ray from the common vertex inside both simplex interiors, contrary to the matching mesh. Their unit-ball sections are therefore disjoint and lie in a ball of finite volume, so the number of incident cells is at most , uniformly over all vertices and meshes. Equivalently the polar formula applied to the indicator of each cone's unit-ball section gives its solid angle as times this volume, hence a uniform positive lower bound; no spherical-Jacobian formula is assumed. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions, A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, Measures are monotone, Euclidean balls have positive finite Lebesgue measure, Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma)
On a shared facet, the two face means of agree; on a boundary facet the face mean is zero. (The global homogeneous Crouzeix–Raviart space)
Cellwise Gauss–Green holds on every affine simplex, and opposite interior facet orientations cancel in a matching mesh. (Gauss–Green formula on an affine simplex, Interior facet orientations cancel in a matching mesh)
is the norm closure of ; compactly supported functions extend by zero, and compactly supported functions admit smooth compactly supported approximants. (Zero-boundary Sobolev space as a norm closure, Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n))
A decreasing sequence of measurable subsets of a bounded set has measures tending to the measure of its intersection. (Continuity from above when one set has finite measure)
Smooth multipliers preserve , a unit-mass mollifier smooths locally integrable functions, and its convolution derivative is obtained by differentiating the kernel. (Weak Leibniz rule with a smooth factor, The mollifier family generated by a unit-mass smooth bump, Convolution with a mollifier is smooth, and derivatives pass under the integral sign)
The cutoff from Explicit compactly supported smooth cutoffs is nonnegative, compactly supported and equals one on the unit ball. Scaling it to support in the unit ball and dividing by its integral gives a nonnegative unit-mass smooth bump; the integral is finite by compact support and positive because the bump is one on a ball of positive measure. (Explicit compactly supported smooth cutoffs, Euclidean balls have positive finite Lebesgue measure)
The standard smooth step is smooth, takes values in , is zero for and is one for ; thus is zero for and one for . (The standard smooth step function)
Since is bounded, it is contained in a finite box; box volume and measure monotonicity give . (A box in with parameters is Lebesgue measurable of measure , whichever of its faces are included, Measures are monotone)
If is compact and open, there is a smooth cutoff in equal to one near . (Test function cutoffs and euclidean localization)
A closed bounded subset of Euclidean space is compact. (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line)
Proof
Vertex stars are facet-connected. Fix a mesh vertex . Finiteness of the mesh lets us choose a ball meeting no closed cell that does not contain ; within this ball the union of incident cells is exactly the polyhedral cone obtained by joining to their opposite facets. Its intersection with a sufficiently small centered sphere is a finite face-to-face spherical triangulation. At an interior vertex is the whole sphere. At a boundary vertex, the Lipschitz polyhedral definition in [given] gives, after a rigid motion and shrinking , an epigraph where is a positively homogeneous piecewise-linear Lipschitz function; this is the local tangent cone, and radial projection maps onto . The cone is path-connected: for two points, join each vertically to a height above the maximum of on the horizontal segment between their base coordinates, then join horizontally at height . Radial projection therefore makes path-connected. Any two interiors of top-dimensional spherical simplices in this link can be joined by a compact path in . In spherical charts covering that path, each codimension-two simplex lies in a set of dimension at most , where ; for a fixed path endpoint, next endpoints whose straight chart segment meets such a set lie in a cone of dimension at most , hence have empty interior. Choose the perturbation balls small enough to remain in and successively avoid the finitely many such cones. The resulting path avoids the codimension-two skeleton and changes simplices only across codimension-one faces. Hence the cells incident to form a connected graph using facets containing . At a boundary vertex some boundary mesh facet contains , so the star graph reaches a boundary facet. Its number of cells is uniformly bounded by [F1].
For an interior mesh vertex , define as the arithmetic mean of the values over cells incident to . For a boundary vertex set . On each cell define as the affine polynomial with these vertex values. Adjacent cell restrictions agree at every vertex of their common facet, hence agree on the whole facet, so is continuous and piecewise affine. Every boundary facet has all its vertices assigned zero, so its polynomial trace is identically zero.
If cells share a facet containing a vertex , then the restriction of an affine function satisfies on , and by the definition of the barycenter; hence its face mean is . By [F2] the means of agree, and therefore . If is a boundary facet containing , its mean is zero, so . Following the bounded facet paths of step 1.1 gives, for every cell and vertex , , where adjacent diameters are comparable by [F1]. The affine barycentric formula on now gives and . Each patch contains a uniformly bounded number of cells and overlaps only a uniformly bounded number of times by [F1]; summing the squared inequalities proves both displayed norm bounds, except for membership.
It remains to prove . Extend by zero to on . Apply [F3] cellwise to for any . Interior fluxes cancel because the traces of agree, and boundary fluxes vanish because its boundary-facet trace is zero. Thus the zero extension has the cellwise gradient as its weak gradient and belongs to . Let be the maximum of the finitely many cellwise gradient magnitudes. Restricting to any line segment partitions it into finitely many cell/exterior pieces; on each piece it is affine with slope at most , and continuity at piece endpoints gives . If a segment lies in a mesh face, its restriction is affine there with the same bound. Hence is globally Lipschitz. For , the triangle inequality gives ; since vanishes on the complement, .
Let be the nonnegative unit-mass smooth bump supplied by [F7], let be supplied by [F8], and set and . The function is bounded and -Lipschitz; convolution with the compactly supported smooth bump makes smooth and preserves this Lipschitz bound, so . Since is supported in the radius- ball, implies throughout the convolution neighborhood, while implies there. Therefore , a closed bounded subset of and hence compact by [F11], and with on . The product rule [F6] shows that and its weak gradient are supported in . On this layer and , while almost everywhere. Thus . The sets decrease to the empty set and are contained in the finite-measure set by [F9]; continuity from above [F5] gives . For , , so in .
Fix . The function is a compactly supported function whose support is a compact subset of . By [F10], choose equal to one near . By [F4], choose converging to in . The weak product rule [F6] makes in , and each product belongs to . Hence . By step 4.1, these functions converge to in as ; the closure definition [F4] proves .
The broken comparison expression is a norm
Statement
In the Poisson setting of The Crouzeix–Raviart method for the homogeneous Poisson problem, is a norm on . Its restriction to is the gradient norm, equivalent to the norm, and its restriction to is a norm.
Facts & Assumptions
Given: A finite matching mesh of a bounded connected Lipschitz polyhedral domain, and from The Crouzeix–Raviart method for the homogeneous Poisson problem, and Countable Choice.
The expression is the sum of squared broken-gradient and scaled facet-jump terms; on all jumps vanish. (The Crouzeix–Raviart method for the homogeneous Poisson problem, Fractional face traces and cellwise Green identity on a simplex)
A zero-gradient function on a simplex is constant by its Poincare–Wirtinger inequality; shape-regular affine scaling transfers the inequality from the reference simplex. (Poincare–Wirtinger inequality on a reference simplex, Shape regularity controls affine simplex geometry)
Interior points of a connected open domain can be joined by a polygonal path in the domain. (Every connected component of an open subset of is open and polygonally connected)
The gradient norm is equivalent to the norm on . (A Poincare bound on a slab-bounded domain)
Every nonempty Euclidean ball has positive Lebesgue measure. (Euclidean balls have positive finite Lebesgue measure)
A finite union of measurable null sets is null by finite subadditivity. (Finite and countable subadditivity of measures)
Cauchy--Schwarz in a real inner-product space gives , and expansion of then gives the triangle inequality for its induced norm. (Cauchy–Schwarz: , with equality exactly for linearly dependent vectors)
Proof
Let and suppose . Each nonnegative term in the finite sum is zero, so on every cell and every interior and boundary facet jump vanishes. By [F2], each restriction is a constant almost everywhere. To see that the cell-adjacency graph is connected, choose interior points in any two cells and join them by a polygonal path in using [F3]. Its compact image has positive distance from . Subdivide its segments if necessary to obtain at least one intermediate vertex; perturb each intermediate vertex in a small open ball so all joining segments stay in . For a fixed endpoint off a mesh face of codimension at least two, candidate points in a bounded perturbation ball whose segment from meets lie in a truncated cone ; because is a positive distance from the compact face and the candidate ball is bounded. If has dimension , cover the bounded parameter set by cubes of side . The cone map is Lipschitz, so their images fit in -cubes of side with total volume . Bounded portions of facet hyperplanes are also null by the same covering count with . Thus all forbidden sets are measurable null sets, and [F6] makes each finite union null. By [F5], a perturbation ball has positive measure and so contains a point outside that union. Choose the intermediate vertices successively outside the finitely many cones from the previous vertex and facet hyperplanes; for the last vertex also avoid the cones from the fixed endpoint at the end of the path. No segment meets the codimension-at-least-two skeleton or lies in a facet hyperplane, so cell transitions occur only through relative interiors of whole facets. When , the mesh faces are endpoints and each crossing is itself a whole facet. The crossings give a cell-adjacency chain. Zero interior jumps therefore make all constants equal, while a zero boundary-facet jump makes the constant zero. Every cell is connected to that boundary cell, so in . Thus the kernel is trivial.
Map to the finite direct sum by . The sum of the component integral pairings is an inner product on , and its induced norm satisfies . Cauchy--Schwarz [F7] and expansion of the squared norm give the triangle inequality; step 1.1 shows is injective, proving positive definiteness on . If , its interior and boundary jumps vanish by the local trace theorem, so the expression equals , equivalent to the norm by [F4]. Finally, on the finite-dimensional space the restriction is an inner-product norm; in its explicit face basis its Gram matrix is positive definite, so that norm is equivalent to the Euclidean coefficient norm and is complete. Thus is Hilbert in the comparison norm.
Well-posedness of the homogeneous Poisson and CR problems
Statement
Assume Countable Choice, let and be as in The Crouzeix–Raviart method for the homogeneous Poisson problem, and let . The exact weak problem has a unique solution , and the discrete problem has a unique solution . The exact existence argument uses Countable Choice through Hilbert-space structure and Lax–Milgram. The finite-dimensional discrete existence and uniqueness argument uses no choice principle.
Facts & Assumptions
Given: Countable Choice, the bounded domain and mesh of The Crouzeix–Raviart method for the homogeneous Poisson problem, , and a slab containing for some unit vector . Throughout, the datum and the Sobolev and spaces are real-valued, consistently with the real affine polynomials defining the CR space.
is a Hilbert space under its inner product; the load is bounded when controlled by the norm. (The Sobolev space is a Hilbert space, Holder's inequality for integrals, including the endpoint cases)
The continuous Poincare inequality controls by on . (A Poincare bound on a slab-bounded domain)
Lax–Milgram gives a unique exact solution for a bounded coercive form and bounded load on a Hilbert space under Countable Choice. (The Lax--Milgram theorem)
has a finite basis indexed by interior facets. (Interior face means form the global Crouzeix–Raviart degrees of freedom)
Proof
Let with its Hilbert norm. For , By [F2], , so . Also . Thus [F3] gives a unique exact weak solution.
By [F4], write the finite-dimensional space in its explicit face basis. The matrix of in this basis is positive definite: for any coefficient vector , its quadratic form is , which vanishes only for the zero coefficient vector by [F5] and basis independence. Hence the matrix is invertible by finite-dimensional linear algebra. The load vector has finite entries because every basis function is piecewise affine and in , so Holder [F1] gives . Solving the finite linear system gives exactly one . If there are no interior facets, the space is zero and its unique element solves the vacuous equations. This discrete argument is the explicit face-basis matrix solve; [F3] is used only for the exact continuous problem in step 1.1. Thus the discrete proof itself makes no choice.
Discrete Poincare inequality for homogeneous Crouzeix–Raviart functions
Statement
Assume Countable Choice. Let be a bounded connected Lipschitz polyhedral domain and any finite matching shape-regular simplicial mesh. There is a constant depending only on , , and the shape-regularity bound such that every satisfies
Facts & Assumptions
Given: Countable Choice, the mesh and homogeneous CR space of The global homogeneous Crouzeix–Raviart space, , and a slab containing .
Countable Choice is required by the conforming-companion interface used below. (The Axiom of Countable Choice (), A conforming averaging companion for Crouzeix–Raviart functions)
The conforming companion satisfies , , and . (A conforming averaging companion for Crouzeix–Raviart functions)
Every function satisfies . (A Poincare bound on a slab-bounded domain)
Proof
Apply [F2] to and use [F1] to obtain .
By the triangle inequality and [F1], The mesh cells lie in the bounded domain, so ; absorb this fixed bound into .
Consistency bounds for the Crouzeix–Raviart Poisson method
Statement
Assume Countable Choice. Let , let solve distributionally, and let be the maximum cell diameter of a finite matching shape-regular mesh. With the method of The Crouzeix–Raviart method for the homogeneous Poisson problem, define where is the cellwise extension in The Crouzeix–Raviart method for the homogeneous Poisson problem. Then If also and , then The constants depend only on , the shape-regularity bound, , and .
Facts & Assumptions
Given: Countable Choice, a bounded connected Lipschitz polyhedral domain, a finite matching shape-regular simplicial mesh, as in the Statement, and the definitions of The Crouzeix–Raviart method for the homogeneous Poisson problem and The face-average Crouzeix–Raviart interpolant.
Countable Choice is assumed by the trace/Green, jump, interpolation, and CR-method interfaces used below. (The Axiom of Countable Choice (), Fractional face traces and cellwise Green identity on a simplex, Face jumps are controlled by the broken gradient, Local approximation by the face-average Crouzeix–Raviart interpolant, The Crouzeix–Raviart method for the homogeneous Poisson problem)
Cellwise Green's identity holds for and every test, and traces of global functions vanish on boundary facets. (Fractional face traces and cellwise Green identity on a simplex)
The normal traces of agree across shared facets; all CR interior jumps and boundary traces have zero face mean. (Fractional face traces and cellwise Green identity on a simplex, The global homogeneous Crouzeix–Raviart space)
The mean fluctuation of a normal trace of on a facet is bounded by . (Fractional face traces and cellwise Green identity on a simplex)
The scaled face-jump norm of is bounded by . (Face jumps are controlled by the broken gradient)
The face-average interpolant has matching interior face means, zero boundary face means, and . (Local approximation by the face-average Crouzeix–Raviart interpolant)
Holder's inequality with exponents makes the volume and facet products below integrable and bounds their integrals by the product of the norms. (Holder's inequality for integrals, including the endpoint cases)
Proof
Apply [F1] on each cell and sum. The volume products are integrable by [F6] because on each cell. For an interior facet , [F2] identifies both traces of , and the two outward normals are opposite. Their normal traces and the jumps are in , so [F6] also makes each boundary product integrable. The boundary terms therefore combine to The sign follows from in the Green identity.
Write . On an interior facet the common trace of gives . On a boundary facet, because has zero trace. Applying [F5], summing over the at most facets of each cell, and using nonnegativity of the local fractional seminorm integrals gives The face mean of each such jump is zero by [F5].
Each jump in step 1.1 has zero face mean by [F2], so subtract the mean of its normal-gradient factor. Regard the finitely many facets as a disjoint union with surface measure on each component; Holder [F6] with the component functions and gives where denotes the corresponding outward normal trace (and the boundary jump is ). By [F3], the first factor is at most : each cell contributes at most facet terms, and the sum of the cell Gagliardo seminorms is bounded by the global seminorm because the integrands are nonnegative and . The second factor is at most by [F4]. This proves the general bound.
Use the same face representation as step 1.1 with . Subtract the normal-trace means as in step 2.1. Holder [F6] on the disjoint union of facets bounds the product of the first weighted factor, at most by [F3], and the second, at most by step 1.2. Their product is the sharper asserted bound.
Energy error estimate for the Crouzeix–Raviart Poisson method
Statement
Assume Countable Choice. Let , and let solve on a bounded connected Lipschitz polyhedral domain. On any finite matching shape-regular mesh, the solution of the Crouzeix–Raviart method satisfies In particular, obeys the same bound. The constant is independent of the mesh size and may depend on , , the shape-regularity bound, and .
Facts & Assumptions
Given: Countable Choice; the Poisson method of The Crouzeix–Raviart method for the homogeneous Poisson problem; a finite shape-regular mesh; and the regular exact solution and datum in the Statement.
The exact and discrete solutions exist uniquely; the exact branch uses Countable Choice, while the finite discrete branch is solved by a face-basis matrix. (Well-posedness of the homogeneous Poisson and CR problems)
The comparison expression is induced by an inner product on , and it restricts to the gradient norm on . (The broken comparison expression is a norm)
The local face-average interpolant has and its facet trace errors are bounded by . (Local approximation by the face-average Crouzeix–Raviart interpolant)
The scaled CR face-jump norm is bounded by the broken gradient. (Face jumps are controlled by the broken gradient)
The consistency residual obeys . (Consistency bounds for the Crouzeix–Raviart Poisson method)
The second Strang estimate for a nonconforming method with bounded form extension is Its hypotheses include Countable Choice, a Hilbert exact space, a finite-dimensional test space, a common comparison norm, bounded extension, coercivity, and bounded loads. (Second Strang estimate with a bounded extension to the comparison space)
The discrete space is finite-dimensional with the explicit face basis, and its norm is controlled by the broken-gradient norm. (Interior face means form the global Crouzeix–Raviart degrees of freedom, Discrete Poincare inequality for homogeneous Crouzeix–Raviart functions)
is Hilbert in the norm, and the continuous Poincare inequality makes the gradient norm equivalent to that norm, hence complete. (The Sobolev space is a Hilbert space, A Poincare bound on a slab-bounded domain)
A finite-dimensional real inner-product space is complete: in the explicit face basis its positive-definite Gram matrix makes the induced norm equivalent to the Euclidean coefficient norm. The comparison norm supplies this inner product on . (Interior face means form the global Crouzeix–Raviart degrees of freedom, The broken comparison expression is a norm)
Holder's inequality with exponents bounds all displayed pairings. (Holder's inequality for integrals, including the endpoint cases)
Proof
The interpolant belongs to . Summing the local gradient estimates in [F3] over cells gives since the cell-pair domains are disjoint subsets of for each gradient component.
The exact space is Hilbert in the gradient norm: it is Hilbert in by [F8], and continuous Poincare gives , so the equivalent gradient norm is complete. In that norm is bounded and coercive with constants . The discrete space has its explicit finite face basis [F7]; the common comparison inner product restricts to its norm by [F2], and [F9] makes Hilbert. Thus the two Hilbert-space hypotheses of [F6] hold. By [F10], the exact load satisfies , and the discrete load satisfies using [F7]. Finally, Holder gives , so the bounded-extension constant is .
By [F4], choose a constant such that Thus is coercive in the comparison norm with , uniformly in the mesh.
If , [F6] defines , which satisfies the required bound. Otherwise, the residual in [F6] is because [F5] gives the numerator bound and .
On an interior facet, because has a common trace; on a boundary facet its trace is because has zero trace. The face terms in [F3], squared and summed over facets with each cell incident to at most facets, give Together with step 1.1, this proves , hence the same upper bound for the infimum in [F6].
Apply [F6] using steps 2.1, 1.2, 1.3, and 1.4. The constants and are uniform, so its estimate gives . The interpolation and consistency constants depend only on , shape regularity, and , and the jump constant has the same dependence. The Poincare constants in step 1.2 establish Hilbert-space/load hypotheses but do not enter the Strang error bound. Thus this proof yields an error constant depending only on , shape regularity, and (and is compatible with the weaker dependence stated above). The broken-gradient term is one of the nonnegative terms in the squared comparison norm, yielding the final assertion.
L2 error estimate under a Dirichlet Poisson smoothing index
Statement
Assume the hypotheses of the energy estimate with , and suppose the domain has Dirichlet Poisson smoothing index with and constant . Then The constant depends only on , the mesh shape-regularity bound, , and . No smoothing index is asserted for every bounded domain.
Facts & Assumptions
Given: Countable Choice; the method, regular exact solution, and mesh of Energy error estimate for the Crouzeix–Raviart Poisson method; and a Dirichlet Poisson smoothing index .
For each , the smoothing index supplies a unique with weakly and . (A Dirichlet Poisson smoothing index)
The local Green identity holds for cellwise tests and the normal-gradient trace fluctuation is bounded by . (Fractional face traces and cellwise Green identity on a simplex)
The face-average interpolant has and the matching local face-trace error bound for . (Local approximation by the face-average Crouzeix–Raviart interpolant)
CR face jumps have for . (Face jumps are controlled by the broken gradient)
The energy estimate's proof gives with depending only on , shape regularity, and : its actual error constant is built from the jump, interpolation, residual, extension, and coercivity constants in its proof, while the domain-dependent Poincare constants there are used only to establish completeness and bounded loads. (Energy error estimate for the Crouzeix–Raviart Poisson method)
The consistency defect at the dual interpolant satisfies . (Consistency bounds for the Crouzeix–Raviart Poisson method)
The method defines and this extension agrees with when . (The Crouzeix–Raviart method for the homogeneous Poisson problem)
Holder's inequality with exponents bounds the volume and face pairings by the corresponding norms; on a finite disjoint union of facets it also gives the weighted sum Cauchy--Schwarz bound. (Holder's inequality for integrals, including the endpoint cases)
Proof
Put . If in , the conclusion holds. Otherwise apply [F1] with to obtain with . Testing its weak equation on gives distributionally.
Let be the global interpolant and put . The jump of decomposes as . The local face estimate in [F3], using the common trace of on interior facets and its zero boundary trace, gives By [F4] and the triangle inequality (which follows for the finite direct sum of face spaces by expanding squares and applying [F8]), where [F3] bounds the first term and [F5] the second. Combining these estimates yields Each has zero face mean: on interior facets the means of and match, and on boundary facets both are zero.
Apply [F2] on every cell with and sum. Write for the difference of its two traces on an interior facet and its trace on a boundary facet. Since , For interior , is the outward normal of either fixed plus cell; for a boundary facet it is the outward cell normal. The global traces of match across interior facets by [F2].
By the trace fluctuation bound [F2], Holder [F8] on the disjoint union of facets gives where is the corresponding normal trace. The last inequality uses that each cell has facets, , and the cell Gagliardo seminorms sum to at most the global seminorm.
Split the volume term in step 2.1 as By [F7], linearity, and the discrete equation , the second term is , the consistency residual in [F6]. Holder [F8] on the cells bounds the first term, and [F3] applied with exponent together with [F5] gives Together with [F6], its magnitude is at most .
Substitute the bounds from steps 2.2 and 3.1 in the identity of step 2.1. This gives by step 1.1. Since , divide by to obtain the stated result.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VIII, Chapter 36, Crouzeix–Raviart approximation
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 25, Non-conforming Finite Element Methods
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 3, Traces and Poincare inequalities
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations, Chapter 3