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.
Zero facet traces of functions in H1_0 on an affine mesh
Statement
Assume Countable Choice. Let have a finite matching affine simplicial mesh as in Matching affine simplicial meshes and shape regularity, and let have the closure convention of Zero-boundary Sobolev space as a norm closure and The notation and the reserved zero-boundary symbol. For every boundary facet there is a bounded affine-simplex trace map agreeing with classical restriction on smooth functions. If , then in . In particular, any globally function that is polynomial on each cell and belongs to has zero classical boundary restriction on every boundary facet.
Facts & Assumptions
Given: Countable Choice; a finite matching affine mesh; a boundary facet of its incident cell ; and the closure-defined real space .
On the reference simplex, restriction of smooth functions extends to a bounded linear trace map (Sobolev face traces and Gauss–Green on a reference simplex).
Each cell is an invertible affine image of the reference simplex, and affine pullback sends to with the weak derivative and norm transformation stated in Matching affine simplicial meshes and shape regularity and Affine pullback of weak derivatives and Sobolev seminorms.
The affine map restricts to a facet map with a positive constant surface Jacobian, so (Gauss–Green formula on an affine simplex).
and is the closure of in this Sobolev norm (The notation and the reserved zero-boundary symbol, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).
Countable Choice permits choosing one approximant for each positive integer from the nonempty sets supplied by the closure condition (The Axiom of Countable Choice ()).
Proof
Given: The mesh, cell , facet , and hypotheses in the Statement and [F1]–[F5].
Let be the reference map and let . By [F2], and its norm is bounded by a finite constant depending on times . The surface Jacobian is positive and constant by [F3]. Define by pullback of ; then Thus the trace is bounded, and it agrees with ordinary restriction for smooth by [F1].
Let . For each , the closure property [F4] and Countable Choice [F5] give with . Restriction to cannot increase this norm, so step 1.1 gives The support of each is compactly contained in , hence vanishes in a neighborhood of the boundary facet and its trace is zero by step 1.1. Letting proves .
If is polynomial on , then it is smooth and step 1.1 identifies with its classical restriction. Therefore for a global piecewise-polynomial , step 2.1 makes that restriction zero on each boundary facet. This proves the final assertion.
Source notes
The zero-trace conclusion is proved from the stated closure convention and a continuous simplex trace map. No trace characterization of is imported.
Depends on
- Matching affine simplicial meshes and shape regularity
- Integer-order Sobolev spaces and their norms
- The notation $H^k$ and the reserved zero-boundary symbol
- Zero-boundary Sobolev space as a norm closure
- Affine pullback of weak derivatives and Sobolev seminorms
- Gauss–Green formula on an affine simplex
- Sobolev face traces and Gauss–Green on a reference simplex
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Symmetric and nonsymmetric Nitsche boundary forms Definition
- Exact affine data under weak imposition Example
- Symmetric cancellation and the nonsymmetric L2 boundary defect Example
- Nonsymmetric Nitsche L2 estimate with its boundary consistency defect Theorem
- Symmetric Nitsche L2 estimate under dual regularity and Nitsche approximation Theorem
- Zero-boundary fractional interpolation in the Nitsche comparison norm Theorem
Dependency tree · two levels
29 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 37, Nitsche boundary penalty method (standard reference, not scraped)
- Mika Juntunen and Rolf Stenberg, Nitsche's method for general boundary conditions, Mathematics of Computation 78 (2009), 1353–1374 (standard reference, not scraped)