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.
Global boundary-flux estimate on a matching mesh
Statement
Assume Countable Choice and the nonempty mesh hypotheses of Symmetric and nonsymmetric Nitsche boundary forms. Let be the maximum number of boundary facets incident to a single cell, and use the selected positive local constant from Local inverse trace bound for a polynomial normal flux. The mesh has at least one boundary facet, so and . For every , Consequently, For simplices ; no sharper face-count bound is needed.
Facts & Assumptions
Given: Countable Choice; the finite matching mesh and boundary facets of Symmetric and nonsymmetric Nitsche boundary forms; the local inverse-trace bound of Local inverse trace bound for a polynomial normal flux; and .
For each boundary facet with incident cell , (Local inverse trace bound for a polynomial normal flux).
A -simplex has exactly facets; when the sum ranges over boundary facets, each cell gradient term is therefore counted at most times.
Distinct mesh-cell interiors are disjoint, and every boundary facet has one incident cell (Matching affine simplicial meshes and shape regularity).
Cauchy–Schwarz for finite sums and for the integrals gives .
Proof
Given: The finite boundary-facet incidence family and [F1]–[F3].
Sum [F1] over all boundary facets. Each cell contributes at most copies of its squared gradient norm, so . Taking square roots proves the first inequality.
Choose a point in the interior of a mesh cell. The finite union of cells is compact and bounded, so the ray has a last point in that union for every unit direction . Choose outside the finitely many measure-zero sets of directions whose ray meets a cell face of dimension at most or is parallel to a facet plane; the excluded directions are measure zero because each such face has dimension at most and radial projection from has dimension at most on the -sphere. The last point therefore lies in the relative interior of a facet and the ray crosses it transversally. If two cells meet at a point in the relative interior of a common facet, their interiors lie on opposite sides: if both lay on the same side of its affine hyperplane, a sufficiently small point displaced to that side near the facet point would lie in the interior of both nondegenerate simplices, contradicting their disjoint interiors in [F3]. Thus such a shared-facet point is interior to the union, contrary to its being the last point on the ray. The last point is consequently on a one-cell boundary facet. Since the local result gives , we obtain and .
Apply [F4] on each facet and then finite-sum Cauchy–Schwarz to obtain Substitute the first inequality from step 1.1 to get the stated bound.
Depends on
Used by
Dependency tree · two levels
18 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)