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.
Bounded commuting projection onto the zero-normal RT0 space
Statement
Assume Countable Choice and a shape-regular mesh. Let be the cellwise -orthogonal projection onto piecewise constants, let be the stable right inverse above, and put . There is a linear projection such that where depends on the domain and mesh shape bound, not mesh size. The construction uses the finite-dimensional -orthogonal projection onto and never applies facet moments to rough H(div)-only fields.
Facts & Assumptions
Given: Countable Choice, a shape-regular mesh, and .
Countable Choice is inherited through the H(div) and real interfaces; the finite-dimensional projection is constructed below. (The Axiom of Countable Choice ())
has zero mean, so belongs to ; is an contraction and preserves the integral. (Zero mean of the divergence under zero normal trace, Cell averaging is the projection onto P0)
The right inverse obeys , , and , where . (Uniform RT0/P0 divergence lift and inf-sup bound)
is finite-dimensional, since the mesh is finite and each local RT0 space has dimension . Real has the integral inner product used below. ( with the integral pairing is a Hilbert space)
The divergencefree members of are exactly the discrete kernel . (The RT0/P0 discrete kernel is exactly divergence-free)
Proof
If , set . Otherwise take a basis of and its Gram matrix . For nonzero , , so is invertible. For any , solve and set . This is linear, and for every basis vector. Thus is orthogonal to , for , and gives . These conclusions hold also for .
Define , , and let be the orthogonal projection constructed in step 1.1. Set Both terms are in , and the second lies in . Thus [F2] and [F4] give . The cell-average map, , and the orthogonal projection are linear, so is linear.
If , then is cellwise constant, so . Consequently has zero divergence and lies in by [F4]. Its orthogonal projection is itself; substituting in the formula of step 2.1 gives . Hence is a projection.
Let . Since , [F2] gives , hence . Also and its divergence is zero. Therefore [F2] gives This bound is uniform in mesh size. The formula uses only the divergence, the discrete right inverse, and a finite-dimensional projection, so no facet trace of is used.
Depends on
- Affine simplicial meshes and RT/BDM spaces
- Zero-normal-trace H(div) space
- Zero mean of the divergence under zero normal trace
- Cell averaging is the $L^2$ projection onto P0
- Uniform RT0/P0 divergence lift and inf-sup bound
- The RT0/P0 discrete kernel is exactly divergence-free
- $L^2$ with the integral pairing is a Hilbert space
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
35 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 III Chapter 16: Local interpolation in H(div) and H(curl) (I) (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi and Michel Fortin, Mixed Finite Element Methods and Applications (standard reference, not scraped)