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.
Dyadic orientation and lifted sphere determinants
Definition
Use Dyadic floating-point format and directed rounding: each finite binary coordinate is interpreted as its exact dyadic rational . Write . All real signs and squared-distance comparisons use the order of Dedekind-complete ordered real field. For a positive integer and a square matrix over , define
where is the set of permutations of and with .
For and ordered points , let have row equal to and put . The orientation predicate returns , where for , for , and for . For ordered points , let have row equal to and put . The raw incircle predicate () or insphere predicate () returns ; its zero is an exact determinant zero. The row order is the point order displayed, and the column order is the coordinate columns, then squared norm, then . If , define the orientation-normalized side sign algebraically to be . Whenever a sphere through is specified, positive means inside it, zero means on it, and negative means outside. If , the base simplex is degenerate and only the raw lifted determinant sign is specified.
An uncertain coordinate input is a real interval with finite dyadic endpoints, as defined in Real intervals, complex rectangles and ball enclosures. Its values remain uncertain throughout a certified computation; a midpoint is not substituted. For real and , write ; inside, on, and outside mean that this squared distance is less than, equal to, or greater than .
Depends on
Used by
- Certified geometric predicate for interval-valued coordinates Algorithm
- Certified predicate for exact dyadic geometric inputs Algorithm
- Exact dyadic determinant sign by integer clearance Algorithm
- Outward-bounded floating determinant filter Algorithm
- Shared formal perturbation for declared determinant tie-breaking Algorithm
- Stable-id lexicographic lift perturbation for cocircular and power ties Definition
- A nearly cocircular quadruple has a certified lifted sign Example
- A nearly collinear dyadic triangle falls through to the exact sign Example
- An uncertain coordinate interval does not decide orientation Example
- A left-to-right Leibniz determinant has an explicit forward error bound Lemma
- A nondegenerate dyadic simplex determines a unique sphere Lemma
- A nonzero 2-by-2 or 3-by-3 dyadic determinant gives a unique real solution Lemma
- Clearing dyadic row denominators preserves determinant sign Lemma
- The integer-clearance determinant-sign algorithm is correct and terminates Lemma
- The lifted determinant records a power-sphere side Lemma
- The orientation-normalized lifted determinant records the side of a sphere Lemma
- The filtered exact dyadic predicate is sound and terminates Theorem
- The finite lexicographic lift tie-break is coherent Theorem
- The formal determinant tie-break is nondegenerate and consistent Theorem
- The interval geometric filter certifies only uniform signs Theorem
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
- Jonathan R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, §§4.2–4.4 (standard reference, not scraped)
- Mark de Berg et al., Computational Geometry: Algorithms and Applications, 2nd ed., §1.2 (standard reference, not scraped)