Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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 Voronoi vertex has a common empty circle of nearest sites

Statement

Let P⊂R2 be finite and nonempty, and define V(p)={x:∥x−p∥2≤∥x−q∥2 for all q∈P}. If x belongs to at least three distinct cells, then all sites whose cells contain x lie on one circle centered at x, no site lies strictly inside that circle, and their convex hull is a polygon with those sites as its vertices.

Facts & Assumptions

Given: A finite nonempty planar site set P and a point x in at least three distinct closed nearest-site cells.

[F1]

Finite indexed geometric site sets and duplicate handling: after duplicate collapse, the sites are distinct points in the Euclidean plane.

[A1]

The Voronoi cell convention is the closed nearest-site inequality in the Statement.

Proof

1.1givenF1A1algebra

Choose three distinct sites p1,p2,p3 whose cells contain x. From x∈V(pi), ∥x−pi∥2≤∥x−pj∥2 for every j; reversing i,j gives equality. Thus all sites whose cells contain x have the same squared distance r2 from x. For every other site q, the defining inequality gives r2≤∥x−q∥2, so none is strictly inside the circle.

2.1step 1.1F1algebraalgebra∎

The common radius is positive, since radius zero would force every site whose cell contains x to equal x, contradicting distinctness and the existence of three sites. A line intersects the circle ∥y−x∥2=r2 in at most two points: parameterizing the line as y=a+tv gives a nonzero quadratic equation in t. Hence no three of the sites on the circle are collinear. For any one such site p, the tangent line at p supports the disk and meets the circle only at p; therefore p cannot be a convex combination of the other circle sites. All nearest sites are extreme points of their convex hull, so that hull is a polygon with these sites as its vertices.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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