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.
Exact affine data under weak imposition
Example
Assume Countable Choice. Let be the open reference triangle with its one-cell mesh, let , and take , , and . Then the weak Nitsche equations have whenever the penalty is above the corresponding coercivity threshold. The same is the exactly representable strongly imposed solution.
The faces are , , and . The arrows are their outward unit normals; the exact boundary fluxes are , , and , respectively.
Facts & Assumptions
Given: Countable Choice; the reference triangle, , , , and a degree- conforming polynomial space; the form definitions Symmetric and nonsymmetric Nitsche boundary forms; and the affine simplex Gauss–Green formula Gauss–Green formula on an affine simplex.
For , , , and the boundary normal derivative is on each straight facet.
If is a nondegenerate affine simplex and , then (Gauss–Green formula on an affine simplex).
Above the stated threshold, each form is coercive (Nitsche coercivity above the inverse-trace threshold).
A function that is polynomial on each cell and belongs to has zero classical boundary restriction on every boundary facet (Zero facet traces of functions in H1_0 on an affine mesh).
Verification
Given: The one-cell triangle and the data in [F1]–[F3].
The function is affine, hence belongs to for every , and it has the prescribed trace . Apply [F2] to : since , its divergence is , and its boundary flux is . Thus the volume term in cancels its first boundary-flux term. The remaining term is , exactly because .
For , the extra form term is , and the extra load term is ; these agree since . Thus satisfies both weak equations. Coercivity [F3] implies uniqueness: the difference of two solutions obeys for every , so testing gives and hence . Therefore . For strong imposition, has the required boundary trace and satisfies the Poisson weak equation on each test in : the simplex Green identity [F2] and the zero boundary restriction [F4] make its boundary flux term vanish. Thus it is the strong Galerkin solution as well.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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)