Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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.

Three-dimensional Delaunay and weighted regular triangulations by lifting

Definition

For a weighted site (p,w), define its power distance from x∈R3 by π(p,w)(x)=∥x−p∥2−w. Its lifted point is p^=(p,∥p∥2−w)∈R4. A lower face of the lifted convex hull is a face supported by a nonvertical hyperplane z=ℓ(x) with every lifted site on or above that hyperplane. The projection of the union of lower faces is the regular subdivision of the projected sites; a simplex in that subdivision has an empty power sphere, meaning its common power distance is no larger than that of any input site.

The lex-refined lift is interpreted over the ordered rational-function field of Stable-id lexicographic lift perturbation for cocircular and power ties, using one fixed finite universe of all input sites. When every weight is zero, the regular subdivision is the ordinary 3D Delaunay subdivision and power spheres are circumspheres. A weighted site is original-hidden if its unperturbed lift is not a vertex of any lower face of the original lifted convex hull, and formal-hidden if its lex-refined lift is not a vertex of any lower face of the fixed formal lifted convex hull. These notions can differ; the algorithm's hidden report means formal-hidden. A nonsimplicial lower face is refined with the same fixed-universe lexicographic lift convention. For projected affine dimension below three, the algorithm reports lower-dimensional with that dimension and the exact deduplicated site list, and makes no tetrahedralization claim. A tetrahedral output is claimed only on the full-dimensional branch with nondegenerate projected bases.

Depends on

Used by

Dependency tree · two levels

4 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