Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Quality and finite termination for the curved square NVB family

Statement

For every tolerance 0<τ≤σ/4=1/4, the algorithm Delaunay-seeded curved uniform NVB refinement with square boundary angle α=π/2 and nonincident-feature separation σ=1 terminates after finitely many three-generation cycles. Its reference triangles remain right isosceles with minimum angle π/4, all interfaces match, and every curved cell map is orientation preserving. Pointwise on each cell, if aK is an affine parametrization of its reference triangle, then the induced metric GΦ,K=(D(Φ∘aK))TD(Φ∘aK) has spectral condition number κ2(GΦ,K)≤(81/16)κ2(Gref,K), where Gref,K=(DaK)TDaK. The returned maximum curved-cell diameter is at most τ. This is a guarantee for this square/shear family; it asserts no general Delaunay minimum-angle theorem, adaptive complexity bound, or 3D shape bound.

Facts & Assumptions

Given: The four square-corner sites, a successful exact Delaunay triangulation, compatible initial labels, the shear Φ(x,y)=(x,y+x2/4), tolerance 0<τ≤1/4, boundary angle π/2, and feature separation σ=1.

[F1]

Exact planar insertion terminates with a weak empty-circle triangulation: the exact planar algorithm returns a triangulation of the convex hull with a coherent tie convention.

[F2]

Compatible 2D newest-vertex-bisection meshes: a bisection splits its reference edge at the midpoint and retains the prescribed generation labels.

[F3]

Shape regularity and local reduction under 2D newest-vertex bisection: three complete generations give shape-regular descendants and child diameters at most half the parent diameter.

[F4]

Conforming NVB closure preserves curved shared traces: recursive closure yields matching affine edges, and a common admissible map sends them to matching curved interfaces.

[F6]

Dorfler marking and conforming newest-vertex refinement: a budget-exhausted call discards the tentative forest and returns the original mesh.

[A1]

The algorithm input certifies that the four square corners have interior angles π/2 and that the minimum distance between nonincident boundary features is at least 1 (Delaunay-seeded curved uniform NVB refinement).

[F5]

Admissible isoparametric curved cells and Curved-domain geometry approximation errors: positive Jacobian and derivative/inverse bounds define admissible curved-cell geometry.

Proof

1.1F1A1givenalgebra

Directly from the square coordinates, each interior angle is π/2, opposite edges and nonincident vertices/edges are separated by distance 2, so σ=1 is a valid lower certificate [A1]. The four corners are distinct dyadic sites in convex position. By [F1] the returned Delaunay triangulation covers the square; with four extreme vertices it has exactly two triangles sharing one diagonal. Each is right isosceles. Labeling the shared diagonal as reference on both sides gives compatible initial labels. The two seed triangles have different vertex-site sets, hence distinct sorted site-index triples; their lexicographic ranks initialize two distinct operational roots without changing those edge labels.

1.2F2F4F6givenconstruct

In each call the squared estimator array is constantly one and the oscillation array is zero. With θE=1, the shortest initial segment whose sum reaches the total contains every cell, so every current cell is requested for three generations. The persistent root-and-binary-path identifiers in [F2] assign a unique order to every generated pending leaf; child identifiers are determined by the stored parent vertex list before it is replaced. At every stage the pending set is finite, so its least identifier exists. The recursive closure theorem [F4] says this finite request terminates, so some finite number N of bisections suffices. By [F6], failed budget calls discard tentative splits and their identifiers, leaving the same ordered input mesh for retry; repeated doubling eventually reaches B≥N and a complete call.

1.3F4F5givenalgebra

The shear extends to the global C2 diffeomorphism Φ(x,y)=(x,y+x2/4) of R2, with explicit inverse Φ−1(X,Y)=(X,Y−X2/4) and determinant det⁡DΦ=1. On the square, DΦ=(10x/21) and both ∥DΦ∥op and ∥DΦ−1∥op are at most 3/2 by the Frobenius bound. The second derivatives of the map and its inverse have operator norm 1/2. Thus the shear satisfies the positive-Jacobian, derivative, inverse-derivative and C2 bounds of [F5]; its cell traces agree because every cell uses the same global map, and its injectivity verifies the common-map hypothesis of [F4].

2.1F2F3step 1.1algebra

Each right-isosceles triangle has its hypotenuse as reference edge. Bisection at the hypotenuse midpoint joins that point to the right-angle vertex; the two resulting triangles have equal legs of half the parent hypotenuse and hence are right isosceles, with their inherited leg as hypotenuse/reference. Thus every bisection in the closure process preserves the 45∘ minimum angle; [F3] supplies the uniform shape bound and three-generation diameter reduction.

2.2F3F5step 1.2algebra

By [F3], each complete three-generation request reduces every requested parent diameter by at least one half; closure only adds bisections, which cannot increase diameter. The initial reference diameter is 22. Since ∥DΦ∥op≤∥DΦ∥F≤3/2 on the square, the mean-value inequality gives mapped diameter at most (3/2)2−k22. A finite integer k satisfies the stopping inequality for every τ>0.

3.1F2F5step 2.1step 2.2step 1.3algebra∎

Let AK=DaK. The bounds in step 1.3 imply κ2(DΦ)≤∥DΦ∥op∥DΦ−1∥op≤9/4. Since D(Φ∘aK)=DΦ(aK)AK, submultiplicativity gives κ2(D(Φ∘aK))≤(9/4)κ2(AK). The spectral condition number of D(Φ∘aK)TD(Φ∘aK) is the square of that derivative condition number, and κ2(AKTAK)=κ2(AK)2, proving the stated 81/16 metric bound. The reference triangles have disjoint interiors in a square of area 4. Any right-isosceles reference triangle of diameter at least τ/(3/2) has area at least τ2/9; disjoint interiors therefore allow at most 36/τ2 such cells. This packing bound is consistent with the finite uniform refinement and the stated positive feature and angle certificates.

Depends on

Used by

Nothing in the library uses this result yet.

Cited to discharge well-definedness by Delaunay-seeded curved uniform NVB refinement.

Dependency tree · two levels

22 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