Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-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.

The orientation-normalized lifted determinant records the side of a sphere

Statement

Let p0,…,pd be points in Dd, d∈{2,3}, with Od≠0 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 S(c,r)={x:∑j(xj−cj)2=r2} through p0,…,pd. For q=pd+1 and its lifted determinant Ld,

Ld=−Od(∑j(qj−cj)2−r2).

Consequently OdLd is positive for q 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, Od≠0, and a sphere S(c,r) through p0,…,pd.

[F1]

Dyadic orientation and lifted sphere determinants: Od is the determinant of rows (pi,1) and Ld is the determinant of rows (pi,∑jpi,j2,1).

[F2]

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.

[F3]

A nondegenerate dyadic simplex determines a unique sphere: every base tuple with Od≠0 determines a unique center c and nonnegative radius r whose sphere contains all base points.

[A1]

The sphere equation is ∑j(pi,j−cj)2=r2 for i=0,…,d, and q=pd+1.

Proof

1.1givenF1algebra

Let A be the d×d matrix with rows pi−p0 for i=1,…,d. Subtracting row p0 from the other rows of the matrix defining Od 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 det⁡A=(−1)dOd.

1.2givenF2F3A1algebra

Expanding the equal sphere radii in [A1], which exist uniquely by [F3], gives ∑jpi,j2−∑jp0,j2=2∑jcj(pi,j−p0,j) for i=1,…,d. For q, put R=∑j(qj−cj)2−r2; the same expansion gives ∑jqj2−∑jp0,j2=2∑jcj(qj−p0,j)+R.

2.1givenF1step 1.1step 1.2algebra

Subtract row p0 from the other rows of the matrix defining Ld, then expand along its final column. The cofactor sign is (−1)d+3, and the remaining determinant has rows (pi−p0,∑jpi,j2−∑jp0,j2), including the row for q. Subtracting 2cj times coordinate column j from the last column makes its first d entries zero by [step 1.2] and its final entry R. The resulting determinant is det⁡A R. 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 Ld=(−1)d+3det⁡A R=−OdR.

3.1givenF2step 2.1algebra∎

Multiplication by Od gives OdLd=−Od2R. Since Od≠0, Od2>0 in the ordered field [F2]; therefore the product is positive exactly when R<0, zero exactly when R=0, and negative exactly when R>0.

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