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.
Poincare–Wirtinger inequality on a reference simplex
Statement
Assume Countable Choice. For every there is such that for all ,
Facts & Assumptions
Given: Countable Choice, the bounded convex reference simplex and .
Smooth functions on a neighbourhood of the closed simplex are dense in . (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)
Along a segment, the fundamental theorem gives the integral of the directional derivative, bounded by segment length times the integral of . (If is differentiable with integrable then ; and a bounded derivative makes Lipschitz)
Jensen bounds the th power of an average by the average of the th powers; Tonelli/Fubini permits the pair and parameter integrals; Holder controls integrals on the finite-measure simplex; affine change of variables has its determinant factor. (Jensen's integral inequality for a probability measure, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Holder's inequality for integrals, including the endpoint cases, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)
The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
First take smooth. For , convexity keeps in the simplex. The segment identity and give by [F2] and Jensen on the unit interval. Jensen again gives
Integrate the last bound over . For , fix and use ; its Jacobian is , and its image is contained in the simplex, so its integral is at most . For , fix and use , whose inverse Jacobian is at most , giving the same bound. Tonelli [F3] therefore yields Taking th roots proves the estimate for smooth .
For arbitrary choose smooth in by [F1]. Holder on the finite-measure simplex gives , so ; also and . Passing to the limit in the smooth inequality of step 2.1 proves the statement.
Depends on
- Matching affine simplicial meshes and shape regularity
- Smooth functions are dense in finite-order Sobolev spaces on a reference simplex
- Integer-order Sobolev spaces and their norms
- If $f : [a,b] \to \mathbb{R}^m$ is differentiable with integrable $f'$ then $\int_a^b f' = f(b)-f(a)$; and a bounded derivative makes $f$ Lipschitz
- Holder's inequality for integrals, including the endpoint cases
- Tonelli and Fubini for the completed product, with only almost-everywhere section measurability
- Jensen's integral inequality for a probability measure
- A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- A uniformly bounded Fortin map for the practical P1/R3 DPG family Lemma
- Boundary-preserving face-average P1 interpolation Lemma
- Cell averaging preserves constant box bounds and has an H1 error bound Lemma
- Finite-volume companions, mean tests and weak-gradient closure Lemma
- Fractional face traces and cellwise Green identity on a simplex Lemma
- Local approximation by the face-average Crouzeix–Raviart interpolant Lemma
- Scaled fractional traces on shape-regular simplices Lemma
- The broken comparison expression is a norm Lemma
- Uniform Poincare inequalities on vertex and cell patches Lemma
- Bramble–Hilbert approximation on a reference simplex Theorem
- Uniform Fortin stability of the mini element Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · two levels
76 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, Chapter 12 (standard reference, not scraped)
- Joachim Schöberl, Numerical Methods for Partial Differential Equations, Chapter 4 (standard reference, not scraped)