Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Spherical Gram simplices and angular links of Euclidean faces

Definition

Spherical Gram simplices. Let n≥0 and let C=(cij)0≤i,j≤n be a real symmetric positive-definite (n+1)×(n+1) matrix with cii=1 for every i (Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal, A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique). Let C=LLT be its unique Cholesky factorisation with lower triangular L and positive diagonal, and let ui∈Rn+1 be the i-th row of L, regarded as a column vector. Define the positive cone on the vertices and the spherical simplex K(C):={∑iλiui:λi≥0},Σ(C):=K(C)∩Sn, where Sn={x∈Rn+1:∣x∣=1} is the unit sphere (Real and complex inner-product spaces and their induced length, The induced length is a norm, Euclidean spheres and closed balls as subspaces of Rn); the vertices of Σ(C) are u0,…,un. The definition asserts neither that the ui are unit vectors with the prescribed inner products, nor that Σ(C) lies in a hemisphere, nor any metric statement about it: all of that is proved in Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗.

Angular link of a Euclidean face. Let C be a compact convex polyhedral cell in its Euclidean affine hull with direction space V, given by finitely many affine inequalities ℓj≥0, and let F be a nonempty face (Finite convex cell complex and linear subdivision). Discard inequalities constant on the affine hull: their constants are nonnegative since C is nonempty, so this does not change C. The remaining gradients are nonzero; in dimension zero no inequalities remain. Write I(F) for the set of remaining j with ℓj vanishing on F, nj:=∇ℓj/∣∇ℓj∣ for the inward unit normal of the defining hyperplane ℓj=0 (a facet normal when that hyperplane cuts out a facet), and U(F):=span⁡{x−y:x,y∈F}⊆V for the direction space of F, the linear span of the differences of points of F, which is {0} exactly when F is a vertex. The tangent cone of C at F is TFC:={ξ∈V:⟨ξ,nj⟩≥0 for all j∈I(F)}, equivalently the closure of {λ(x−p):x∈C, λ≥0} for any (hence every) p in the relative interior of F, and the normal cone of F in C is NFC:=TFC∩U(F)⊥,U(F)⊥={ξ∈V:⟨ξ,u⟩=0 for all u∈U(F)}; the angular link of F in C is the set of unit inward directions normal to F, Lk⁡C(F):=NFC∩S(V),S(V)={ξ∈V:∣ξ∣=1}, and the angular distance of ξ,η∈Lk⁡C(F) is dang(ξ,η):=arccos⁡⟨ξ,η⟩, the principal inverse cosine (Principal inverse sine and inverse cosine); equivalently it is the intrinsic path metric of the round unit sphere restricted to the link, a metric of diameter at most π (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric; proved in Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗(v), using that NFC is a convex cone). For a point p in the relative interior of F the set of all unit inward directions at p is Lk⁡C(p):=TFC∩S(V); when dim⁡F=k it is the spherical join Sk−1∗Lk⁡C(F) of the round unit sphere of U(F) with the link of F, and for a vertex F it coincides with Lk⁡C(F) (proved in The cone and join metrics and the local product chart of a polyhedral gluing(4)).

For an isometric polyhedral gluing X with cells Cp (Abstract isometric polyhedral gluings and the chain metric) the links Lk⁡Cp(F) of the cells containing a face F are identified along the isometries induced by the gluing maps hp,q, giving the angular link Lk⁡X(F) with the componentwise intrinsic path distance of the cells, extended by the auxiliary value +∞ between components (The angular path metric, the Euclidean cone and spherical joins(1)); the links Lk⁡Cp(p) of the point p glue in the same way to Lk⁡X(p). Its link cells are the unit normal direction sets in the cofaces G>F, with the induced face incidences. When X is simplicial, the correspondence G↦G∖F identifies these cells with the nonempty simplices of the existing combinatorial link (Subcomplexes, closures, stars, and links in a simplicial complex); for general polyhedral cells this is a polyhedral face link, not an abstract simplicial link without subdivision.

Remarks

  • Sign convention of the normals. The normals are inward: each nj points into C along the increasing direction of ℓj, so the tangent cone at a face is cut out by ⟨ξ,nj⟩≥0. With outward normals every inequality would be reversed. The two descriptions of TFC displayed above are proved to agree in Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗(v), together with the facts that TFC is independent of the chosen point in the relative interior of F and that the angular distance is the intrinsic metric of the link.
  • What is deferred to the justifier. The unit-norm and inner-product properties of the ui and the uniqueness of Σ(C) up to an isometry of Sn (clause (i)), the hemisphere and radial coordinates (clause (ii)), the metric axioms and intrinsic description of dang (clause (v)) and the Schur-complement formula for vertex links (clause (iv)) are all conclusions of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗; nothing beyond the construction is asserted here.
  • Why the vertices are not assumed to be unit vectors. The Cholesky factor of C is used only as a convenient ambient realisation; that its rows are unit vectors with inner products cij is the content of clause (i) of the justifier, not part of the construction.
  • Face link versus point link. The angular link Lk⁡C(F) of a face collects only the directions normal to F and has dimension codim⁡CF−1, with the empty link in codimension zero. In the simplicial case its cells are those of the combinatorial link of F. The larger set Lk⁡C(p)=TFC∩S(V) of all inward directions at a point p in the relative interior of F is the join Sk−1∗Lk⁡C(F), and the two notions coincide exactly when F is a vertex. The cone charts of The cone and join metrics and the local product chart of a polyhedral gluing(4) use Lk⁡X(p), while the Schur-complement and metric-flag computations use the face link Lk⁡X(F).

Depends on

Used by

Dependency tree · two levels

49 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