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.
Uniform Poincare inequalities on vertex and cell patches
Statement
Assume Countable Choice, as in the reference-simplex trace and Poincare suppliers.
Let be a conforming shape-regular triangular mesh. For an interior vertex , let be the union of its incident triangles; for a boundary vertex use the same patch. There is a constant depending only on the shape-regularity bound such that, at an interior vertex, every satisfies where is the patch mean and . On a boundary vertex patch, every satisfies For a cell , define , where is its set of three vertices. If does not meet , the corresponding mean-zero estimate holds on with scale ; if meets and , then
Facts & Assumptions
Countable Choice is assumed in the cited Sobolev and reference-simplex suppliers (The Axiom of Countable Choice ()).
Given: Countable Choice, a conforming triangular mesh with shape-regularity bound , an interior or boundary vertex , and respectively or .
On a reference simplex, mean-zero functions satisfy Poincaré's inequality and the trace is bounded by the norm; affine scaling gives the corresponding cell bounds (Poincare–Wirtinger inequality on a reference simplex, Sobolev face traces and Gauss–Green on a reference simplex, Shape regularity controls affine simplex geometry, Zero-boundary Sobolev space as a norm closure).
Shape regularity bounds the minimum angle away from zero; the polygonal mesh vertex stars are edge-connected and boundary stars meet a boundary edge (Shape regularity controls affine simplex geometry).
Proof
Scaling [F1] to each triangle gives and for every edge . Shape regularity makes comparable to . If share , their traces of agree, so Using for cells in one shape-regular vertex star bounds the difference of neighboring means by the two gradient norms.
The star has at most cells, and its dual edge graph is connected. Join each cell to a fixed cell by a graph path of length at most and apply step 1.1 along that path. The cell Poincaré bound from step 1.1 then gives . Since , replacing by the patch mean proves the interior estimate.
For a boundary vertex patch choose one boundary edge . By the definition of as the -closure of compactly supported smooth functions, and the continuous local trace bound in [F1], the trace of is zero on . The trace inequality in step 1.1 therefore gives for the incident cell . The same bounded-path comparison of cell means from step 2.1 controls every cell mean in the star by . Summing the cell Poincaré bounds proves the boundary estimate.
For a cell patch , the three vertex stars are edge-connected because they all contain , and the number of cells is at most three times the valence bound from [F2]. Along each edge-adjacency path, neighboring cell diameters are comparable by shape regularity, so all diameters in the patch are comparable to . The mean-zero estimate follows by applying the cell-mean comparison of step 2.1 over this connected finite graph. If meets the boundary, contains a boundary edge; apply the zero-trace argument of step 3.1 there and the same path comparison to all cells in the union. These two estimates are the asserted cell-patch inequalities.
Depends on
- Matching affine simplicial meshes and shape regularity
- Poincare–Wirtinger inequality on a reference simplex
- Sobolev face traces and Gauss–Green on a reference simplex
- Shape regularity controls affine simplex geometry
- 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
Dependency tree · two levels
30 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
- Ricardo H. Nochetto, Adaptive Finite Element Methods, Lecture 1 (standard reference, not scraped)
- Bonito, Canuto, Nochetto & Veeser, Adaptive Finite Element Methods (2024) (standard reference, not scraped)