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.
Stable-id lexicographic lift perturbation for cocircular and power ties
Definition
Take a fixed finite universe of indexed sites as in Finite indexed geometric site sets and duplicate handling, dimension , and an ordered tuple of sites from with distinct identifiers. A computation using auxiliary sites, such as a planar supertriangle, includes those sites in from the start and assigns them distinct deterministic integer identifiers. Require that the first sites are affinely independent. Put , with absent weights interpreted as . Rank all identifiers of in increasing order, starting at rank , and define Regard as a positive formal infinitesimal in the rational-function field , ordered so a nonzero polynomial has the sign of its coefficient at its least nonzero exponent. Expand this finite polynomial exactly and return the sign of its coefficient at the least exponent with nonzero coefficient. If the base is degenerate, return status degenerate-base. The same universe and ranks are used for every predicate tuple. The procedure never chooses or evaluates a numerical . Its returned sign is the declared stable-id convention for the displayed weighted lifted determinant. When all weights are zero, its constant term is the raw lifted determinant in Dyadic orientation and lifted sphere determinants; for nonzero weights, replace that determinant's squared-norm column by before applying this convention.
Depends on
Used by
- Finite exact 3D Delaunay and regular lower-hull cavity repair Algorithm
- Incremental planar Delaunay insertion with exact edge flips Algorithm
- Planar triangulations, Delaunay structures, and Voronoi cells Definition
- Three-dimensional Delaunay and weighted regular triangulations by lifting Definition
- A cocircular four-site tie selects the stable-id diagonal Example
- An illegal planar Delaunay flip strictly decreases lifted interpolation volume Lemma
- Generic lower lifted facets project to a triangulation of the convex hull Lemma
- The finite lexicographic lift tie-break is coherent Theorem
Dependency tree · two levels
5 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
- Don Sheehy, Computational Geometry, Fall 2014, Lecture 22: Weighted Delaunay Triangulations (standard reference, not scraped)
- CGAL 6.3 User Manual, 3D Triangulations, Regular Triangulation (standard reference, not scraped)