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.
Mesh-uniform fractional boundary flux trace
Statement
Assume Countable Choice and the fixed nonempty bounded polyhedral domain, matching shape-regular affine simplicial mesh, and Nitsche face-height convention of Symmetric and nonsymmetric Nitsche boundary forms. Let , , and . For every , with no boundary-value or PDE assumption, The trace is the restriction of the whole-space Fourier hyperplane trace and agrees with the facet trace in Fractional Bessel-potential traces on simplex facets. The constant may depend on the fixed domain, , , and the Fourier normalization, but not on the mesh.
Facts & Assumptions
Given: Countable Choice; a fixed nonempty bounded polyhedral with its matching shape-regular mesh; ; and for in the restriction convention.
The restriction norm is the infimum over whole-space Bessel-potential extensions, and the whole-space norm is the exact weighted Fourier norm (Restriction Bessel-potential spaces on polyhedral domains, Real-order Bessel-potential completion H^s, Real-order H^s as weighted Fourier distributions).
For a whole-space extension with , the unique hyperplane trace restricts on a simplex facet to the existing trace, independently of the chosen extension (Fractional Bessel-potential traces on simplex facets).
The Fourier norm is (Real-order Bessel-potential completion H^s, Real-order H^s as weighted Fourier distributions).
Countable Choice is the only choice principle assumed when selecting extensions approaching the quotient norm (The Axiom of Countable Choice ()).
Proof
Given: The hypotheses and [F1]–[F3].
The boundary of the fixed polyhedral domain lies in finitely many supporting hyperplanes . Choose any whole-space extension of . Its distributional derivative has Fourier multiplier ; hence by [F3], and . For each , choose affinely independent points in that plane and a point off it to form a nondegenerate simplex having a facet in ; this only names the plane trace in [F2] and imposes no mesh condition. Apply the scalar Fourier hyperplane trace estimate in [F2] to every component and sum the finitely many squared inequalities. After a rigid coordinate change this gives the componentwise vector trace and .
Group the boundary facets by their supporting planes. On a facet , the scalar normal derivative is the dot product of the same plane trace with a fixed unit normal, so . The boundary facets in one supporting plane have disjoint relative interiors: their relative interiors are boundary points of the polyhedral domain, and the matching mesh has disjoint cell interiors and whole-face intersections. The face-height convention gives . Consequently using step 1.1 for the last inequality.
For every , the restriction norm supplies an extension with . Apply step 2.1 to and let . Taking square roots proves the first estimate; since is fixed, writing gives the displayed normalization.
Source notes
The estimate groups facets by the finitely many fixed domain planes, so each whole-space hyperplane trace is counted once rather than once per mesh face. The face-height bound supplies the single factor ; no mesh-dependent facet count, zero-boundary condition, or dual PDE is used.
Depends on
- Matching affine simplicial meshes and shape regularity
- Symmetric and nonsymmetric Nitsche boundary forms
- Restriction Bessel-potential spaces on polyhedral domains
- Real-order Bessel-potential completion H^s
- Real-order H^s as weighted Fourier distributions
- Fractional Bessel-potential traces on simplex facets
- Scaled fractional traces on shape-regular simplices
- Shape regularity controls affine simplex geometry
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
45 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)