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.
The lifted determinant records a power-sphere side
Statement
Let , let , and let their dyadic weights be (zero when absent). Assume are affinely independent. If and satisfy define the power difference Let be the determinant of the rows for , and let be the determinant of the rows , including the query row . Then Thus the sign of is positive, zero or negative exactly when is respectively inside, on or outside the power sphere. When all weights are zero, this is the ordinary circumsphere convention.
Facts & Assumptions
Given: The ordered points, weights, determinant row conventions and a common power sphere for the base sites.
Dyadic orientation and lifted sphere determinants: orientation determinants use rows ; lifted sphere determinants use point coordinates, the lifted height, and a final column of in the displayed row order.
Finite indexed geometric site sets and duplicate handling: site coordinates and weights are exact dyadic rationals; absent weights are zero.
The points are affinely independent, and for each base site.
Proof
Put . Let be the matrix whose rows are for . Subtract row from each other row of the orientation matrix defining , then expand along its final column. Since the base points are affinely independent, , and the cofactor sign gives .
Expanding the equal power-sphere equations in [A1] gives for . For the query row, the same expansion gives .
In the lifted determinant defining , subtract row from all other rows and expand along the final column. The cofactor sign is . Subtract times coordinate column from the lifted-height column for every ; by [step 1.2] the first height entries become zero and the query height entry becomes . The remaining determinant is , so by [step 1.1].
Multiplying the identity in [step 2.1] by gives . Since affine independence gives , the factor is positive; hence the product has the claimed inside/on/outside sign.
Depends on
Used by
- Three-dimensional Delaunay and weighted regular triangulations by lifting Definition
- An illegal planar Delaunay flip strictly decreases lifted interpolation volume Lemma
- Generic lower lifted facets project to a triangulation of the convex hull Lemma
- Exact 3D lower-hull insertion covers the hull and terminates Theorem
- Exact planar insertion terminates with a weak empty-circle triangulation Theorem
- The finite lexicographic lift tie-break is coherent Theorem
- Uniform random insertion gives expected O(n log n) location work 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
- David M. Mount, CMSC 754 Computational Geometry, Lecture 13: Delaunay Triangulations: Incremental Construction (standard reference, not scraped)
- 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)