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.
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.
Depends on
Used by
Dependency tree · two levels
21 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)