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 nondegenerate dyadic simplex determines a unique sphere
Statement
Let and let have under Dyadic orientation and lifted sphere determinants. There is a unique and such that
Facts & Assumptions
Given: , dyadic points , and their homogeneous orientation determinant .
Dyadic orientation and lifted sphere determinants: is the determinant of the rows , and is embedded in the real field.
Dedekind-complete ordered real field: the coordinates lie in an ordered field, so squares are nonnegative; and the order is compatible with addition.
A nonzero 2-by-2 or 3-by-3 dyadic determinant gives a unique real solution: a 2-by-2 or 3-by-3 dyadic matrix with nonzero determinant gives a unique real solution for every real right-hand side.
Nonnegative real square roots exist uniquely: every nonnegative real has a unique nonnegative square root.
Proof
Let have row equal to for . Subtracting the first row from every later row of the matrix defining preserves its determinant: multilinearity in each row follows from the finite Leibniz sum, and every added determinant has two equal rows, whose permutation terms cancel in pairs. Expanding along the final column gives , so .
Put for . Since and the order is compatible with addition, and is nonzero. By [F3] and [step 1.1], there is a unique with .
Expanding gives . Rearranging shows for every . Let ; by [F4], the unique with exists. Hence passes through all base points.
If is any other center and nonnegative radius through the base points, equal squared distances give . Uniqueness in [F3] forces . Then , and uniqueness of the nonnegative square root [F4] gives . All objects are obtained from finite data and unique solutions; no choice axiom is used.
Depends on
Used by
Dependency tree · two levels
6 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)