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.
Local inverse trace bound for a polynomial normal flux
Statement
Assume Countable Choice. Fix , a degree , and a shape-regular matching affine simplicial mesh family as in Matching affine simplicial meshes and shape regularity. There is a selected constant , depending only on and the shape-regularity bound, such that for every cell , every facet , and every scalar , where and is the outward unit normal of on .
Facts & Assumptions
Given: Countable Choice; a shape-regular matching affine simplicial mesh; ; a cell polynomial ; a facet ; and .
For every cell polynomial of degree at most , the polynomial facet trace satisfies (Polynomial inverse and discrete trace inequalities).
Shape regularity gives for each facet (Shape regularity controls affine simplex geometry).
The gradient of a degree- polynomial has components in , and pointwise.
The polynomial inverse-trace theorem and the affine simplex scaling results used in [F1]–[F2] assume Countable Choice (The Axiom of Countable Choice ()).
Proof
Given: Countable Choice, , and the bounds in [F1]–[F4].
Apply [F1] to each component , which has degree at most . Summing the squared inequalities and using [F3] gives for a finite depending only on and the shape bound.
Multiply step 1.1 by and use from [F2]. Choose ; this is positive, finite, uniform over the family, and proves the required bound.
If the family contains a cell, fix one of its facets and test the inequality with the affine polynomial , which belongs to because . Then and , so . Thus, for a family containing a cell, every admissible positive constant satisfies . For an empty family the bound is vacuous; in either case step 2.1 selects .
Depends on
Used by
Dependency tree · two levels
13 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)