Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 ABC with reference edge AB. M,N,P are the midpoints of the three original sides; S is the midpoint of median CM and is interior; Q,R are the midpoints of AM,BM. The eight leaves and their coordinates are verified in proof step 2.1. The dashed original edge AB is the reference edge. The picture fixes the point conventions only; no proof relies on it.

ABCMNPSQR

Facts & Assumptions

Given: A finite shape-regular conforming triangular initial mesh with compatible edge labels as in Compatible 2D newest-vertex-bisection meshes.

[F1]

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

1.1F1givenalgebra

Write the parent vertices as A,B,C, with reference edge AB, midpoint M, and squared side lengths X=∣AC∣2, Y=∣BC∣2, Z=∣AB∣2. The two first children have edge-length squares {X,Z/4,W} and {Y,Z/4,W}, where W=∣(A+B)/2−C∣2=(2X+2Y−Z)/4 by expanding the squared norm. The four labeled types have squared edge lists {X,Y,Z}, {Z/4,X,W}, {Z/4,Y,W}, and {X/4,Y/4,W}. In type 1 the reference side has square X, and the new median square is (2(Z/4)+2W−X)/4=Y/4; its children therefore have side lists {X/4,Z/4,Y/4} and {X/4,W,Y/4}, which are a quarter-scale type 0 and type 3. The type 2 calculation interchanges X,Y. In type 3 the reference side has square W, and its median square is (2(X/4)+2(Y/4)−W)/4=Z/16; 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.

2.1F1step 1.1given

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.

3.1F1step 1.1algebra∎

After the first generation the midpoint M of AB is present. The second generation bisects AC and BC, adding their midpoints N and P. The four second-generation triangles have reference edges on the segments AM,BM,CM; the third generation bisects those segments, in particular CM, adding its midpoint S in the interior of ABC. The eight leaves have vertex triples (A,N,Q),(Q,M,N),(N,M,S),(N,S,C),(P,M,R),(P,R,B),(P,C,S),(P,S,M), where Q=(A+M)/2 and R=(B+M)/2. Subtracting these vertex coordinates shows that each leaf side is an original side divided by 2, the median ∣C−M∣ divided by 2, or the reference side divided by 4. Since M lies on AB, convexity of the norm gives ∣C−M∣≤max⁡{∣C−A∣,∣C−B∣}≤diam⁡(ABC). Thus every leaf side, and hence every leaf diameter, is at most half the parent diameter.

Depends on

Used by

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