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.
An illegal planar Delaunay flip strictly decreases lifted interpolation volume
Statement
Let be a strictly convex planar quadrilateral in counterclockwise boundary order. Lift its four sites using the common formal heights of Stable-id lexicographic lift perturbation for cocircular and power ties. Let and be the piecewise-affine interpolants on the two diagonal triangulations. Define each interpolant's integral over the quadrilateral as the sum over its two triangles of triangle area times the average of the three vertex heights. If the lifted point lies strictly below the affine plane through the lifts of (the illegal-incircle sign by the coefficientwise determinant identity), then in the lexicographic order of the formal lift field.
Facts & Assumptions
Given: A strictly convex quadrilateral , its common formal lifted heights, and a formal lifted height at strictly below the plane through .
Planar triangulations, Delaunay structures, and Voronoi cells: a planar triangulation is made of nondegenerate triangles meeting along complete common faces.
The lifted determinant records a power-sphere side: the lifted determinant sign is the oriented power-distance side of the base circumcircle.
Stable-id lexicographic lift perturbation for cocircular and power ties: every site uses the same formal perturbed height, ordered by the first nonzero coefficient.
The finite lexicographic lift tie-break is coherent: this finite perturbation gives coherent nonzero signs for all nondegenerate predicate tuples and preserves nonzero constant-term signs.
The diagonals intersect at an interior point , and the formal lifted height at is strictly below the affine plane through the lifts of .
Proof
The two interpolants agree at the four boundary vertices. Their common diagonal intersection lies strictly inside both diagonals. On the four triangles formed by and the four boundary edges, each interpolant is affine; their difference is zero at the two boundary endpoints and equals at .
Write with . The plane through agrees with at because , and its value at equals the lifted height of . By [A1] its value at is strictly larger than the lifted height of . Affinity along therefore gives , so .
On a triangle, the integral of an affine function is its area times the average of its three vertex values; this follows by mapping to the reference triangle, where each barycentric coordinate has integral one third of its area. Thus each of the four overlay triangles contributes its area times to the integral of . Their areas sum to the quadrilateral area, so the total difference is .
The row-subtraction and height-column elimination used in [F2] are polynomial determinant identities in the site heights, so they remain valid coefficientwise after each height is replaced by its formal perturbation. Writing for the query height minus that plane's height at and for the base orientation determinant, the identity is . The normalized determinant therefore has the opposite sign to , so the strict below-plane condition gives a positive, illegal sign. By [F3]–[F4], one common formal configuration resolves a zero constant term. Thus the below-plane condition is exactly the illegal incircle sign and its flip strictly decreases the potential.
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
- Mark de Berg et al., Computational Geometry: Algorithms and Applications, 3rd ed., Chapter 9, Section 9.2 (standard reference, not scraped)
- David M. Mount, CMSC 754 Computational Geometry, Lecture 13 (standard reference, not scraped)
- Don Sheehy, Computational Geometry, Fall 2014, Lecture 22 (standard reference, not scraped)