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.
Uniform RT0/P0 divergence lift and inf-sup bound
Statement
Assume Countable Choice, a bounded connected Lipschitz polyhedral in dimension two or three, and a shape-regular conforming mesh. Let be the mesh-independent constant in the RT0 interpolation estimate and let be a coordinate-slab width for . If is the actual right inverse of Divergence right inverse on bounded connected Lipschitz domains, define Then is a linear right inverse of divergence and . Consequently . When , the RT0/P0 inf-sup constant satisfies uniformly in mesh size.
Facts & Assumptions
Given: Countable Choice, , a shape-regular mesh, and .
Countable Choice is inherited through the continuous divergence-lift and interpolation suppliers. (The Axiom of Countable Choice ())
maps H1 fields to RT0, commutes with divergence cell averages, is zero-normal on H1_0 inputs, and obeys . (Boundedness and divergence commutation of RT0 interpolation)
for the chosen slab width. (A bounded-domain Poincare inequality for H1-zero fields)
Proof
Since is cellwise constant, its cell average is itself. By [F1] and the commuting identity [F2], . The input is in H1_0, so [F2] gives . Linearity follows from the linear divergence lift and interpolation.
The stability estimate [F2] and [F1], [F3] imply because . The right-inverse identity from step 1.1 then yields .
For nonzero , take . Then and by step 2.1. This admissible test gives the lower bound on the supremum for each ; taking the infimum over nonzero proves the stated bound. The constants depend on , its chosen continuous lift, and the shape bound, but not on .
Depends on
Used by
Dependency tree · two levels
28 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)