Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. The geometric facts used on published pp. 222, 230 and 233; the proof below supplies the omitted finite-dimensional details. (canonical PDF).
For a finite spherical set , the containing sphere with center in is unique and has minimal containing-sphere radius. If , then
For spherical nonempty in orthogonal coordinate spaces, . The squared circumradius of a simplex is a continuous function of its squared pair distances in the open region where the simplex is affinely independent.
Proof.
Let and let be the orthogonal projection of the origin onto . For every , is orthogonal to , so . Hence is a containing-sphere center in . If is another such center in , subtraction of the equal distance equations makes orthogonal to all differences of points of , which span the direction space of . Since belongs to that space, it is zero. Any other containing center projects to this one, and Pythagoras shows its radius is no smaller. This also proves the formula. If , the radius is strictly smaller than .
Center and at their intrinsic circumcenters. Their affine spans are then linear. The direction space of contains and , and these span the product of the two direction spaces. Thus the affine hull is exactly the product hull and contains . Every product point has squared norm , proving the asserted intrinsic radius.
For continuity, write a simplex as and let be its squared distances. Its positive definite anchored Gram matrix and a vector are
The circumcenter must satisfy , so . Consequently
Positive definiteness persists under a sufficiently small perturbation. The inverse is continuous there, for example by its cofactor formula with nonzero determinant. The displayed expression proves continuity. The positive square root is also continuous. This justifies choosing an arbitrarily small off-diagonal perturbation while retaining a prescribed strict upper bound on the circumradius.
Dependencies. theorem_2_1 gives the exact negative-type/Gram criterion. The Gram proof itself is linked there.
Bears on. #174.