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.
Symmetric and nonsymmetric Nitsche boundary forms
Definition
Assume Countable Choice. Let , let be a nonempty bounded connected polyhedral open set, and let be a finite matching affine simplicial mesh of as in Matching affine simplicial meshes and shape regularity. Fix a polynomial degree . Let be the real scalar conforming polynomial space of Broken and conforming polynomial spaces on a matching mesh, viewed as a subspace of by Continuous matching piecewise polynomials belong to W1p, and let , where is the closure convention of Zero-boundary Sobolev space as a norm closure; Zero facet traces of functions in H1_0 on an affine mesh proves its facet-trace consequence. Boundary facets form . If , let be its unique incident cell, its outward unit normal, its -dimensional measure, and set . For functions with a defined boundary normal trace write on .
Let consist of such that for every cell there is with . By Fractional Bessel-potential traces on simplex facets, has an trace on each facet, and each component of is in , hence has an trace by the same lemma; the derivative mapping follows from in the Bessel-potential norm. Thus and all displayed integrals are defined. In particular, and the exact/adjoint functions in the later regularity hypotheses lie in . For a dimensionless penalty coefficient and symmetry parameter , define the same bilinear formula on : For and boundary data with the displayed integrals finite, define The nonsymmetric Nitsche form is ; it has the consistency flux in the trial slot only. The symmetric Nitsche form is ; it has both transposed consistency fluxes. The discrete weak-boundary problem is the standard Nitsche method when : it seeks such that for every . This extension makes expressions such as and well-defined when the exact and adjoint functions have the stated cellwise regularity. The boundary penalty is ; is the cell-face height divided by , not the face diameter. The zero value is used only for the penalty-free algebraic comparison.
The energy seminorm and the comparison seminorm used below are These expressions are used only on functions for which their volume and facet traces are defined. The parameter fixes the sign convention; no convention based on a reciprocal small stabilization parameter is implicit.
Depends on
- Restriction Bessel-potential spaces on polyhedral domains
- Fractional Bessel-potential traces on simplex facets
- Zero facet traces of functions in H1_0 on an affine mesh
- Matching affine simplicial meshes and shape regularity
- Broken and conforming polynomial spaces on a matching mesh
- Continuous matching piecewise polynomials belong to W1p
- Integer-order Sobolev spaces and their norms
- Zero-boundary Sobolev space as a norm closure
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Exact affine data under weak imposition Example
- Penalties below and above the Nitsche coercivity threshold Example
- Symmetric cancellation and the nonsymmetric L2 boundary defect Example
- Global boundary-flux estimate on a matching mesh Lemma
- Mesh-uniform fractional boundary flux trace Lemma
- Nitsche coercivity above the inverse-trace threshold Lemma
- Nitsche consistency and energy quasi-optimality Theorem
- 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
36 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)