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.
Shape regularity and local reduction under 2D newest-vertex bisection
Statement
For any compatible 2D initial labeling from Compatible 2D newest-vertex-bisection meshes, every conforming NVB descendant has shape regularity bounded by a constant depending only on the initial mesh. Three complete generations of uniform bisection of a triangle split each original edge at its midpoint, create a new interior midpoint on the median from the opposite vertex, and give child diameters at most half the parent diameter.
Three-generation reference picture
The drawing shows three uniform NVB generations of with reference edge . are the midpoints of the three original sides; is the midpoint of median and is interior; are the midpoints of . The eight leaves and their coordinates are verified in proof step 2.1. The dashed original edge is the reference edge. The picture fixes the point conventions only; no proof relies on it.
Facts & Assumptions
Given: A finite shape-regular conforming triangular initial mesh with compatible edge labels as in Compatible 2D newest-vertex-bisection meshes.
Each bisection splits the reference edge at its midpoint and assigns the two newly created edges and inherited edges the labels specified by generation; shared edges have one common label (Compatible 2D newest-vertex-bisection meshes).
Proof
Write the parent vertices as , with reference edge , midpoint , and squared side lengths , , . The two first children have edge-length squares and , where by expanding the squared norm. The four labeled types have squared edge lists , , , and . In type 1 the reference side has square , and the new median square is ; its children therefore have side lists and , which are a quarter-scale type 0 and type 3. The type 2 calculation interchanges . In type 3 the reference side has square , and its median square is ; its children are quarter-scale types 1 and 2. Type 0 gives types 1 and 2 by the first bisection. Hence this finite list is closed under every labeled bisection and no other normalized shape occurs.
Each of the finitely many normalized triangles in step 1.1 is nondegenerate: its area is half the parent area at each bisection and its side lengths are the explicit midpoint lengths, so its three angles are positive. The minimum of these finitely many angles and the initial minimum angle is positive. Hence all descendants have a common positive minimum angle and a common shape-regularity bound. The angle minimum over this finite list is positive; the maximum shape-regularity constant over it and the initial cells is therefore finite.
After the first generation the midpoint of is present. The second generation bisects and , adding their midpoints and . The four second-generation triangles have reference edges on the segments ; the third generation bisects those segments, in particular , adding its midpoint in the interior of . The eight leaves have vertex triples , where and . Subtracting these vertex coordinates shows that each leaf side is an original side divided by , the median divided by , or the reference side divided by . Since lies on , convexity of the norm gives . Thus every leaf side, and hence every leaf diameter, is at most half the parent diameter.
Depends on
Used by
- Delaunay-seeded curved uniform NVB refinement Algorithm
- Projected data oscillation on a reference triangle Example
- Common NVB refinement and overlay cardinality Lemma
- Data oscillation reduction under three-generation refinement Lemma
- Reduction of the P1 residual estimator after marked refinement Lemma
- Termination and cumulative complexity of NVB conformity closure Lemma
- Linear contraction of AFEM energy error and oscillation Theorem
- Quality and finite termination for the curved square NVB family Theorem
- Residual reliability and local efficiency for P1 AFEM Theorem
Dependency tree · two levels
7 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
- Bonito, Canuto, Nochetto & Veeser, Adaptive Finite Element Methods (2024) (standard reference, not scraped)
- Ricardo H. Nochetto, Adaptive Finite Element Methods, Lecture 1 (standard reference, not scraped)