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.
A cocircular four-site tie selects the stable-id diagonal
Statement
For the square sites with identifiers and zero weights, the unperturbed lifts are coplanar. In the four-site universe the perturbation selects diagonal . Adding three synthetic identifiers below these four sites multiplies all four perturbation exponents by , so the algorithm's augmented universe selects the same diagonal. Both selected triangles are weakly empty in the original, unperturbed sense.
Facts & Assumptions
Given: The four indexed sites and the fixed-universe lexicographic height rule.
Finite indexed geometric site sets and duplicate handling: the four stable identifiers are distinct, and absent weights are zero.
Stable-id lexicographic lift perturbation for cocircular and power ties: rank receive height perturbations , respectively.
The finite lexicographic lift tie-break is coherent: the first nonzero coefficient decides the one coherent formal lifted configuration.
Planar triangulations, Delaunay structures, and Voronoi cells: a triangle is weakly empty-circle if no site lies strictly inside its circumdisk.
Exact planar insertion terminates with a weak empty-circle triangulation: the fixed formal lift selects a terminating empty-circle triangulation.
The square is listed counterclockwise, all four weights are zero, and the four-site hand calculation uses exactly the universe .
Proof
The unperturbed heights are . Each is at its site, so the four lifted points lie in the plane .
All four original sites lie on the circle centered at with radius squared . No other sites are present, so neither selected triangle has a site strictly inside its circumdisk. They are weakly empty by [F4].
With the perturbation from [F2], the plane through has value at , while 's lifted height is . Their difference is , whose least nonzero exponent is with coefficient . Thus lies formally below the plane through , and diagonal is illegal. The flip selects by [F3].
The plane through has value at ; subtracting from 's height gives , which is formally positive. The plane through has value at ; subtracting from 's height gives , also formally positive. Hence both and are lower triangles for the common lift.
When three synthetic identifiers are inserted below , each input rank increases by three and each exponent is multiplied by . Thus every input-only determinant polynomial becomes the four-site polynomial with replaced by , which preserves the first nonzero coefficient sign. The augmented run therefore retains diagonal , and [F5] returns the stated weakly empty triangulation.
Depends on
- Finite indexed geometric site sets and duplicate handling
- Planar triangulations, Delaunay structures, and Voronoi cells
- Stable-id lexicographic lift perturbation for cocircular and power ties
- The finite lexicographic lift tie-break is coherent
- Exact planar insertion terminates with a weak empty-circle triangulation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
13 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 (standard reference, not scraped)
- Don Sheehy, Computational Geometry, Fall 2014, Lecture 22 (standard reference, not scraped)