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.
Boundedness and divergence commutation of RT0 interpolation
Statement
Assume Countable Choice, a shape-regular mesh with , and from Canonical RT0 interpolation on H1 fields. There is depending only on dimension and the shape bound such that every satisfies If , then .
Facts & Assumptions
Given: Countable Choice, a shape-regular conforming mesh, and a vector field .
Countable Choice is inherited through the Sobolev trace and interpolation interfaces. (The Axiom of Countable Choice ())
is the unique RT0 field with the facet moments of ; matching moments give a global H(div) field. (Canonical RT0 interpolation on H1 fields, RT0 facet-flux unisolvence and global H(div) conformity)
The simplex trace inequality is . (H1 facet trace inequality on shape-regular simplices)
Shape regularity gives , , and each altitude comparable to . (Shape regularity controls affine simplex geometry)
The Gauss–Green formula holds on smooth fields on each affine simplex. (Gauss–Green formula on an affine simplex)
Smooth-neighborhood functions are dense in H1 on every cell, and H1_0 is the H1 closure of compactly supported smooth functions. (Smooth-neighborhood density in H1 of a simplex, Zero-boundary Sobolev space as a norm closure)
is the intersection of the global RT0 space with . (Affine simplicial meshes and RT/BDM spaces)
The facet moment is bounded by the product of the facet norms. (Cauchy-Schwarz inequality for )
Proof
Let be the vertex opposite facet in and define . On , is the altitude , so by the simplex pyramid identity . On any other facet, and lie in its hyperplane, hence . Thus , where is the outward moment. By [F2], [F7], and Cauchy–Schwarz, . Also [F3] gives . Multiplying and summing the fixed terms proves . Squaring and summing cells yields the global stability estimate since .
The divergence of is constant. For smooth-neighborhood approximants to from [F5], Gauss–Green [F4] says the sum of their outward facet moments equals the integral of their divergence. The trace bound [F2] and H1 convergence let both sides pass to the limit, so . Dividing by gives the stated cell average.
If , choose compactly supported smooth vector fields converging to it in H1 by [F5]. Their boundary facet moments are zero; the trace bound [F2] passes this zero moment to . Hence has zero boundary facet flux, and [F1] gives membership in ; [F6] then gives .
Depends on
- Canonical RT0 interpolation on H1 fields
- Affine simplicial meshes and RT/BDM spaces
- RT0 facet-flux unisolvence and global H(div) conformity
- H1 facet trace inequality on shape-regular simplices
- Shape regularity controls affine simplex geometry
- Zero-normal-trace H(div) space
- Gauss–Green formula on an affine simplex
- Smooth-neighborhood density in H1 of a simplex
- Zero-boundary Sobolev space as a norm closure
- Cauchy-Schwarz inequality for $L^2$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
44 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)