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 orientation-normalized lifted determinant records the side of a sphere
Statement
Let be points in , , with under the determinant convention in Dyadic orientation and lifted sphere determinants. By A nondegenerate dyadic simplex determines a unique sphere, there is a unique sphere through . For and its lifted determinant ,
Consequently is positive for inside the sphere, zero on it, and negative outside it.
Facts & Assumptions
Given: The point and lifted determinant row conventions in Dyadic orientation and lifted sphere determinants, , and a sphere through .
Dyadic orientation and lifted sphere determinants: is the determinant of rows and is the determinant of rows .
Dedekind-complete ordered real field: the coordinates, sphere center, and radius are in an ordered real field, so positive squares and their order comparisons have their usual meanings.
A nondegenerate dyadic simplex determines a unique sphere: every base tuple with determines a unique center and nonnegative radius whose sphere contains all base points.
The sphere equation is for , and .
Proof
Let be the matrix with rows for . Subtracting row from the other rows of the matrix defining leaves its determinant unchanged: the Leibniz formula is linear in each row, and the added determinant has two equal rows, whose terms cancel in pairs under the transposition of those rows. Expansion along the final column then gives .
Expanding the equal sphere radii in [A1], which exist uniquely by [F3], gives for . For , put ; the same expansion gives .
Subtract row from the other rows of the matrix defining , then expand along its final column. The cofactor sign is , and the remaining determinant has rows , including the row for . Subtracting times coordinate column from the last column makes its first entries zero by [step 1.2] and its final entry . The resulting determinant is . These row and column operations preserve the Leibniz determinant: multilinearity in columns follows from the same permutation formula, and the added determinant has equal columns whose terms cancel in pairs under their transposition. Thus .
Multiplication by gives . Since , in the ordered field [F2]; therefore the product is positive exactly when , zero exactly when , and negative exactly when .
Depends on
Used by
Dependency tree · two levels
7 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
- Jonathan R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, §4.2 (standard reference, not scraped)
- Mark de Berg et al., Computational Geometry: Algorithms and Applications, 2nd ed., §1.2 (standard reference, not scraped)