Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 d∈{2,3} and let p0,…,pd∈Dd have Od≠0 under Dyadic orientation and lifted sphere determinants. There is a unique c∈Rd and r≥0 such that ∑j=1d(pi,j−cj)2=r2(i=0,…,d).

Facts & Assumptions

Given: d∈{2,3}, dyadic points p0,…,pd, and their homogeneous orientation determinant Od≠0.

[F1]

Dyadic orientation and lifted sphere determinants: Od is the determinant of the rows (pi,1), and D is embedded in the real field.

[F2]

Dedekind-complete ordered real field: the coordinates lie in an ordered field, so squares are nonnegative; 1>0 and the order is compatible with addition.

[F3]

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.

[F4]

Nonnegative real square roots exist uniquely: every nonnegative real has a unique nonnegative square root.

Proof

1.1givenF1algebra

Let A have row i equal to pi−p0 for i=1,…,d. Subtracting the first row from every later row of the matrix defining Od 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 Od=(−1)ddet⁡A, so det⁡A≠0.

2.1givenF2F3step 1.1algebra

Put bi=(∑jpi,j2−∑jp0,j2)/2 for i=1,…,d. Since 1>0 and the order is compatible with addition, 2=1+1>0 and is nonzero. By [F3] and [step 1.1], there is a unique c∈Rd with Ac=b.

3.1givenF2F4step 2.1algebra

Expanding Ac=b gives 2∑jcj(pi,j−p0,j)=∑jpi,j2−∑jp0,j2. Rearranging shows ∑j(pi,j−cj)2=∑j(p0,j−cj)2 for every i=1,…,d. Let s=∑j(p0,j−cj)2≥0; by [F4], the unique r≥0 with r2=s exists. Hence S(c,r) passes through all base points.

4.1givenF3F4step 2.1step 3.1algebra∎

If (c′,r′) is any other center and nonnegative radius through the base points, equal squared distances give Ac′=b. Uniqueness in [F3] forces c′=c. Then r′2=s=r2, and uniqueness of the nonnegative square root [F4] gives r′=r. 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