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.
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 .
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The global homogeneous Crouzeix–Raviart space
- Matching affine simplicial meshes and shape regularity
- The mollifier family generated by a unit-mass smooth bump
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- The standard smooth step function
- Compactly supported smooth functions are dense in W^{k,p}(R^n)
- Every connected component of an open subset of $\mathbb{R}^n$ is open and polygonally connected
- Gauss–Green formula on an affine simplex
- Face jumps are controlled by the broken gradient
- Compactly supported Sobolev functions extend by zero in every integer order
- Interior facet orientations cancel in a matching mesh
- Shape regularity controls affine simplex geometry
- Euclidean balls have positive finite Lebesgue measure
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ 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
- Test function cutoffs and euclidean localization
- Weak Leibniz rule with a smooth factor
- Explicit compactly supported smooth cutoffs
- Continuity from above when one set has finite measure
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- A box in $\mathbb{R}^n$ with parameters $a_i\le b_i$ is Lebesgue measurable of measure $\prod_{i<n}(b_i-a_i)$, whichever of its faces are included
- Measures are monotone
- Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
Used by
Dependency tree · two levels
127 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Luc Guermond, MATH 661 Fall 2025, Part VIII, Chapter 36, Crouzeix–Raviart approximation (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 25, Non-conforming Finite Element Methods (standard reference, not scraped)