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.
Sobolev face traces and Gauss–Green on a reference simplex
Statement
Assume Countable Choice. Let and . For each facet of , restriction of smooth functions extends uniquely to a bounded linear trace map For real-valued and , the facet traces satisfy Here is the componentwise trace and is the outward unit normal. The bounded C1-domain trace and Green theorems are not used for the simplex.
Facts & Assumptions
Given: Countable Choice, the reference simplex, , and the Sobolev spaces specified in Integer-order Sobolev spaces and their norms.
Smooth functions on a neighbourhood of the closed simplex are dense in for every finite . (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)
For vector fields on a nondegenerate affine simplex, the divergence integral equals the sum of outward facet fluxes. (Gauss–Green formula on an affine simplex)
The spaces are complete for finite , and Holder's inequality gives . (Riesz-Fischer completeness of for , Holder's inequality for integrals, including the endpoint cases)
The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice ())
Proof
Fix a facet opposite the vertex , let be the altitude from to , and put . On , ; on every other facet, which contains , is tangent, so its normal component is zero. For a smooth scalar , apply [F2] to . Since , is continuously differentiable, and ; hence Holder bounds the last integral by . For and , if then , while if then . Thus the product is at most . Since , the resulting inequality gives .
Let be a smooth sequence converging to in , which exists by [F1]. Applying the estimate of step 1.1 to shows is Cauchy in the complete space ; define to be its limit. The same estimate shows the limit is independent of the chosen smooth approximating sequence and . Linearity follows by taking approximating sequences for sums and scalar multiples.
For smooth , apply [F2] to the vector field . Its divergence is , so the displayed Green identity holds with ordinary restrictions. Choose smooth approximations in and componentwise in by [F1]. By step 2.1 their facet traces converge in and ; Holder [F3] makes the boundary products converge in . The volume products converge in by Holder and convergence of both Sobolev norms. Passing to the limit in the smooth identity proves the formula for .
Depends on
- Gauss–Green formula on an affine simplex
- Smooth functions are dense in finite-order Sobolev spaces on a reference simplex
- Integer-order Sobolev spaces and their norms
- Riesz-Fischer completeness of $L^p$ for $1 \le p \le \infty$
- Holder's inequality for integrals, including the endpoint cases
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Boundary-preserving face-average P1 interpolation Lemma
- Constructive varying-degree triangle interpolation in unweighted H1 Lemma
- Element and edge residual representation for P1 Galerkin errors Lemma
- Finite-volume companions, mean tests and weak-gradient closure Lemma
- Local and global dimensions of the mini element Lemma
- Scaled fractional traces on shape-regular simplices Lemma
- Sobolev traces and Gauss–Green formula on physical simplices Lemma
- Uniform Poincare inequalities on vertex and cell patches Lemma
- Zero facet traces of functions in H1₀ on an affine mesh Lemma
- Local approximation and reproduction of the P1 moment interpolant Theorem
- Uniform Fortin stability of the mini element Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
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, Chapter 14 (standard reference, not scraped)
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapter 15 (standard reference, not scraped)