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.
Domain classes covered by the mean-zero Poincare inequality
Remark
This page proves the mean-zero Poincare-Wirtinger inequality directly for bounded John domains The mean-zero Poincare inequality on bounded John domains and for bounded convex domains Poincare-Wirtinger on bounded convex domains by the direct pairwise argument, both on the same page. Bounded and bounded Lipschitz domains satisfy the uniform interior cone condition, and every nonempty bounded connected open set satisfying that uniform condition is a John domain (Kinnunen, Remark 5.32(1)); hence the inequality applies to those classes as well. The John-class hypothesis is the one used by the direct proof; no Sobolev exponent and no compactness input enter it. The bounded connected extension-domain Sobolev-Poincare form is a separate statement on this page, proved from the local mean-zero estimate and the extension-domain embedding, and it does not supersede the John-domain result.
Source notes
The class inclusions and the "twisted cones" picture are Kinnunen's Remark 5.32, printed p. 141, with Laugesen's Theorem 3.29 supplying the bounded connected smooth-domain Poincare comparison. This remark records scope only: it asserts no inequality of its own, and the two direct John and convex results together with the separate extension-domain statement are proved elsewhere on this page.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Juha Kinnunen, Sobolev Spaces (Aalto University, 2026, complete graduate lecture notes) (standard reference, not scraped)
- Richard S. Laugesen, Linear Analysis and Partial Differential Equations (University of Illinois, complete 158-page graduate notes) (standard reference, not scraped)