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 Simplex Metrics, Angular Links, and Cones
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Determinants of Matrices over a Commutative Ring
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Function Space Topologies and the Exponential Law
- Further Trigonometric Identities and Inverse Functions
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Ascoli–Arzelà Theorem
- The Derivative and the Mean Value Theorems
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Combinatorial links already exist in the library. Here they receive angular metrics, and tangent neighbourhoods become cones over those links. Their spherical geometry must be proved before a link criterion can be used: every construction below is a named supplier contract, and the definitions are justified by the separately named existence, descent or uniqueness proofs before any application consumes their properties.
Spherical Gram simplices and angular links of Euclidean faces constructs the spherical simplex from the Cholesky factor of a real symmetric positive-definite Gram matrix with diagonal , and defines the tangent cone , the normal cone along the direction space of a face, the angular link of a Euclidean face and the angular distance ; the normal direction sets of the cells of an isometric polyhedral gluing glue to with the componentwise intrinsic path distance, extended by auxiliary infinity between components, and the link of a point of a relative interior is the join . No combinatorial link is redefined: in a simplicial complex the cells of the face link are those of its combinatorial link; general polyhedral gluings instead have polyhedral face links with cells indexed by the cofaces.
Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas proves that the Cholesky realisation realises the prescribed inner products, uniquely up to a linear isometry, and that the vertices lie in an open hemisphere: a linear functional with is positive on , radial normalisation is a bijection with unique barycentric ray coordinates, and both maps satisfy explicit Lipschitz estimates, so the round metric of is bi-Lipschitz equivalent to the Euclidean metric of with explicit constants. Finite spherical complexes have compact proper complete length-space components with minimizing geodesics (the Axiom of Choice selects near-minimizing chains and supplies the proper-target Ascoli hypothesis), and the link of a vertex is the spherical simplex with Schur-complement Gram matrix , positive definite and compatible with iterated faces. Clause (v) identifies the tangent cone with the intersection of the inward half-spaces of the active defining inequalities and proves that is the intrinsic path metric of the link; only in the cone formulas is the componentwise value used, as auxiliary notation.
The angular path metric, the Euclidean cone and spherical joins fixes the conventions: the componentwise intrinsic path distance (with between components), its finite-valued truncation , the -geodesic angular CAT(1) convention for triangles of perimeter , the Euclidean cone with and (so ), and the spherical join as the quotient of by the endpoint identifications, with its cosine formula and the conventions , . No metric axiom, geodesic or associativity statement is asserted here; all of them are conclusions of the justifying theorem.
The cone and join metrics and the local product chart of a polyhedral gluing proves them. The truncation is a metric of diameter at most agreeing with below , and every triangle of perimeter has at most one side and lies in one intrinsic component. The cone formula defines a metric including angle , vanishing radii and disconnected links; the through-apex path is minimizing when , a minimizing angular segment develops into its planar sector otherwise, and a -geodesic link gives a geodesic cone whose minimizing geodesics stay in the ball of radius . The join is a metric of diameter at most — the triangle inequality is read off from the product-cone isometry , which also gives associativity, the face metrics and — and at a point in the relative interior of a -cell of an isometric polyhedral gluing with local finiteness and finitely many shapes the angular link is the join and a small metric ball about in its connected component is isometric to the ball of the same radius about in and to the cone ball over , preserving intrinsic lengths. The auxiliary value is never an ordinary distance value.
Required earlier pages: coxeter-polyhedral-gluings-and-intrinsic-metrics, real-forms-and-reflection-geometry, direct-matrix-factorisations-lu-cholesky-and-qr, simplicial-complexes-and-simplicial-homology, further-trigonometric-identities-and-inverses and hilbert-space-geometry-and-riesz-representation. The companion spherical-simplex-metrics-angular-links-and-cones-examples computes the Schur complement of a spherical simplex, compares link edge lengths with dihedral mirror angles and tests the truncation convention on a disconnected universal-Coxeter nerve. This page is a draft: its proofs are local, and the link criterion that consumes them is developed on cat-comparison-link-criteria-and-local-globalization.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Spherical Gram simplices and angular links of Euclidean faces
Definition
Spherical Gram simplices. Let and let be a real symmetric positive-definite matrix with for every (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 be its unique Cholesky factorisation with lower triangular and positive diagonal, and let be the -th row of , regarded as a column vector. Define the positive cone on the vertices and the spherical simplex where 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 ); the vertices of are . The definition asserts neither that the are unit vectors with the prescribed inner products, nor that 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 be a compact convex polyhedral cell in its Euclidean affine hull with direction space , given by finitely many affine inequalities , and let be a nonempty face (Finite convex cell complex and linear subdivision). Discard inequalities constant on the affine hull: their constants are nonnegative since is nonempty, so this does not change . The remaining gradients are nonzero; in dimension zero no inequalities remain. Write for the set of remaining with vanishing on , for the inward unit normal of the defining hyperplane (a facet normal when that hyperplane cuts out a facet), and for the direction space of , the linear span of the differences of points of , which is exactly when is a vertex. The tangent cone of at is equivalently the closure of for any (hence every) in the relative interior of , and the normal cone of in is the angular link of in is the set of unit inward directions normal to , and the angular distance of is , 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: iff , symmetry, and the triangle inequality; pseudometric and ultrametric; proved in Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗(v), using that is a convex cone). For a point in the relative interior of the set of all unit inward directions at is ; when it is the spherical join of the round unit sphere of with the link of , and for a vertex it coincides with (proved in The cone and join metrics and the local product chart of a polyhedral gluing(4)).
For an isometric polyhedral gluing with cells (Abstract isometric polyhedral gluings and the chain metric) the links of the cells containing a face are identified along the isometries induced by the gluing maps , giving the angular link 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 of the point glue in the same way to . Its link cells are the unit normal direction sets in the cofaces , with the induced face incidences. When is simplicial, the correspondence 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 points into along the increasing direction of , so the tangent cone at a face is cut out by . With outward normals every inequality would be reversed. The two descriptions of displayed above are proved to agree in Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas ↗(v), together with the facts that is independent of the chosen point in the relative interior of 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 and the uniqueness of up to an isometry of (clause (i)), the hemisphere and radial coordinates (clause (ii)), the metric axioms and intrinsic description of (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 is used only as a convenient ambient realisation; that its rows are unit vectors with inner products is the content of clause (i) of the justifier, not part of the construction.
- Face link versus point link. The angular link of a face collects only the directions normal to and has dimension , with the empty link in codimension zero. In the simplicial case its cells are those of the combinatorial link of . The larger set of all inward directions at a point in the relative interior of is the join , and the two notions coincide exactly when is a vertex. The cone charts of The cone and join metrics and the local product chart of a polyhedral gluing(4) use , while the Schur-complement and metric-flag computations use the face link .
Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
Statement
Let be a real symmetric positive-definite matrix with diagonal , and let , , , be as in Spherical Gram simplices and angular links of Euclidean faces.
(i) Existence and uniqueness of the Gram realisation. The vectors are unit vectors with , they are linearly independent and span , and every other family of unit vectors in a Euclidean space with is the image of under a linear isometry of onto the span of the . Hence is well-defined up to an isometry of mapping vertices to vertices.
(ii) Hemisphere, radial coordinates and bi-Lipschitz comparison. The linear functional determined by for all satisfies ; consequently on and is contained in the open hemisphere . Radial normalisation restricts to a bijection , where , with inverse ; every point of therefore has unique barycentric ray coordinates with . Moreover and satisfy the explicit Lipschitz estimates and , proved directly from the formulas without differentiability; here for the unique coordinate vector with . Hence the round metric on is bi-Lipschitz equivalent to the Euclidean metric of the compact convex cell carried by (on a subset of the unit sphere the round distance and the chord distance satisfy ).
(iii) Finite spherical complexes. Let be a finite abstract simplicial complex (An abstract simplicial complex) whose nonempty simplices carry positive-definite Gram matrices of diagonal , compatible with faces. Form by gluing the spherical simplices along their vertex-wise face identifications. On each component define the chain metric as the infimum of over finite chains in common cells, with the angular metric of that cell; equivalently it is the infimum of lengths of continuous paths. Between different components this infimum is , auxiliary notation rather than a metric value (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric). The inverse cellwise radial maps descend to a homeomorphism , where is the Euclidean gluing with cells ; it is bi-Lipschitz on every component. Each component of is a compact proper complete length space whose metric topology is the weak topology, and is a finite disjoint union of these components. For the empty complex, . Under the Axiom of Choice (The Axiom of Choice), every two points in a component are joined by a minimizing geodesic of length , in particular every pair at distance . The proper-target argument is written locally below, using Length in a metric target: lower semicontinuity and arc-length reparametrization and Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence; compare Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics.
(iv) Vertex and face links by Schur complements. The normal link of a nonempty spherical face spanned by vertices indexed by consists of the unit tangent directions perpendicular to that point into at a relative interior point of the face. For and put . The link of the vertex in is the spherical simplex with vertices , and its Gram matrix is which is positive definite: the projection formula follows by expanding , and positivity follows from the positive definiteness of the unnormalised Schur complement , whose quadratic form is for the nonzero vector . Iterating the formula over the vertices of a face of gives the link of that face; the result is independent of the order of iteration, and the link of a face of a link is the link of a higher face. If no vertices remain, the link is empty; in particular the vertex link for is empty. More generally, for a nonempty proper vertex set , let , and for . These are the orthogonal projections onto , with ; the face-link Gram matrix is .
(v) Angular links of Euclidean faces. For a compact convex polyhedral cell and a face as in Spherical Gram simplices and angular links of Euclidean faces, with direction space and normal cone , after constant defining inequalities are discarded, the two descriptions of the tangent cone agree: for every in the relative interior of , and for the inward unit normals of the active defining hyperplanes; the tangent cone and the normal cone depend only on . The cone is pointed, and is closed under nonnegative combinations, so for the shorter great-circle arc between them stays in and realises as an intrinsic path in the link; conversely every path in has length at least the round distance of its endpoints. Hence the angular distance of Spherical Gram simplices and angular links of Euclidean faces is the intrinsic path metric of the round sphere restricted to , it is a metric of diameter at most , and the links of the cells containing a face of an isometric polyhedral gluing depend only on , so their quotient is well defined up to canonical isometry.
(vi) Disconnected components. If the angular link of a face of a complex is disconnected, the componentwise path distance is between distinct components; this value is auxiliary notation only and is truncated in the cone formulas of The angular path metric, the Euclidean cone and spherical joins.
Facts & Assumptions
Given: A real symmetric positive-definite matrix with diagonal , its Cholesky factor , the vectors , the cone and simplex of Spherical Gram simplices and angular links of Euclidean faces; in clauses (iii) and (vi) additionally a finite abstract simplicial complex with compatible Gram matrices as in the Statement.
A real symmetric positive-definite matrix has a unique Cholesky factorisation with lower triangular and positive diagonal; then is invertible and is its own real case (A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique, Hermitian positive-definite matrices and Cholesky factorisation A = LL* with positive diagonal).
In a real inner-product space, is bilinear and symmetric, is a norm, with equality exactly for linearly dependent , every finite-dimensional subspace has an orthogonal complement and orthogonal projection by For a subspace of a finite-dimensional inner product space, and The orthogonal projection is the -component in , the unit sphere is (Euclidean spheres and closed balls as subspaces of ), and is the inverse of the strictly decreasing restriction of to , continuous on (Principal inverse sine and inverse cosine, The induced length is a norm, Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: , with equality exactly for dependent pairs).
and for all real (The addition formulas for sine and cosine); and (The derivatives of sine and cosine are cosine and minus sine); , , and (Quarter-turn values and shifts by pi/2 and pi); and (Parity and the Pythagorean identity for sine and cosine); is strictly decreasing on , and is strictly increasing on (Signs, monotonicity intervals, and ranges of sine and cosine); for one has , and , so is strictly decreasing on and (Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3); (The limit of sin x divided by x at zero is one); and for , since for the mean value theorem gives for some with (The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with ).
A continuous real function on an interval assumes every value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
A compact convex polyhedral cell is given by finitely many affine inequalities ; its nonempty faces arise by turning some of them into equalities, and each nonempty face is the cell itself or its intersection with a supporting hyperplane (Finite convex cell complex and linear subdivision).
A finite abstract simplicial complex has a compact Hausdorff geometric realization, and a closed subspace of a compact space is compact (A finite simplicial complex has a compact Hausdorff realization, A closed subset of a compact metric space is compact, An abstract simplicial complex).
For an isometric polyhedral gluing: the cells are compact convex polyhedral cells, the face relation and gluing isometries satisfy the cocycle and intersection conditions, the topology is the weak topology, and the chain metric is the infimum of chain lengths over points lying in common cells; its metric axioms, the agreement of its topology with the weak topology and properness and completeness under (H1)-(H3) are the conclusions of The chain metric is a metric, its topology is the weak topology, and the space is proper and complete, the proper-target geodesic argument is recorded in Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics, and arc-length reparametrisation together with lower semicontinuity of length under uniform convergence is Length in a metric target: lower semicontinuity and arc-length reparametrization (Abstract isometric polyhedral gluings and the chain metric).
Assume the Axiom of Choice; the proper-target Ascoli theorem states that a pointwise bounded equicontinuous sequence of continuous maps from a nonempty compact metric space into a proper metric space has a uniformly convergent subsequence, and a compact metric space is proper because its closed balls are closed, hence compact (The Axiom of Choice, Under the Axiom of Choice, a pointwise bounded equicontinuous sequence on a nonempty compact metric domain into a proper metric target has a uniformly convergent subsequence, Open cover, subcover, compact metric space, and compact subset of a metric space, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Pointwise convergence, uniform convergence, and the uniformly Cauchy condition for sequences of real-valued functions, Bilipschitz embeddings and bilipschitz equivalences of metric spaces, Complete metric space: every Cauchy sequence converges in the space, Geodesics and geodesic metric spaces, Upper bound, least upper bound, and strict upper bound, as the set of functions , and , , are metrics on it).
A continuous real-valued function on a nonempty compact metric space attains its minimum and maximum, without Choice (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Proof
Gram realisation. By [F1], with invertible, so the rows of satisfy , in particular , and they are linearly independent because . If is any family of unit vectors of a Euclidean space with and , then , so ; the two families therefore obey the same linear relations, the map sending to is a well-defined linear isomorphism of their spans, and it preserves inner products because these are given by the Gram matrices on both sides; extends to a linear isometry of onto the span of the , which carries onto the cone generated by the and onto its unit section.
The two tangent-cone descriptions. Let be given by the nonconstant inequalities after the discarding prescribed in the definition, and let lie in the relative interior of the face , with the set of with and inward. If satisfies for all , then for small the point satisfies for and for by continuity and , so and is a limit of vectors with . Conversely, for and the affine identity gives , so every with lies in the closed cone ; the two cones agree, and since an affine function nonnegative on vanishes at a relative interior point exactly when it vanishes throughout , the active set does not depend on , and the tangent cone does not depend on the chosen point of the relative interior. The common kernel of the active gradients is : it contains because the active functions vanish on ; conversely, for a vector in that kernel, sufficiently small displacements remain in and satisfy all active equalities, hence belong to by [F5], so .
The angular distance is a metric. For unit vectors the number is well defined by [F2], is symmetric, vanishes exactly when , i.e. , and is at most . If are unit, and satisfy , write (trivially if or ) and with unit and orthogonal to by [F2]; then by [F2] and [F3], so because is the inverse of the strictly decreasing on ; if the same inequality is trivial. So is a metric of diameter at most on every set of unit vectors.
The hemisphere functional. Since is a basis of by step 1.1, there is a unique linear functional with for all , and for all . If with , then some , so ; hence and , which is the set of convex combinations with , . In standard coordinates for a unique nonzero vector ; [F2] gives , with equality at , so is the finite operator norm.
Schur complements. Since for by [F2] and the linear independence of of step 1.1, the vectors are well defined; they satisfy and , and expanding gives , in particular . Writing for , the vector is nonzero and, with , ; the quadratic form on the right is that of the unnormalised Schur complement , so is positive definite, and with the positive diagonal is positive definite as well.
The intrinsic path metric of a link. For a continuous path in write for the supremum of over finite partitions of its parameter interval, and for let be the infimum of over continuous paths in from to . Let . The cone is pointed: a vector and its negative lying in it satisfy every active facet equality, hence lie in the direction space of the affine hull of , namely ; orthogonality to then forces the vector to be zero. Thus distinct unit directions are never antipodal and . If , pick a unit with and put for ; then because is a nonnegative combination of for , and for every partition while the uniform partition into parts has sum as by [F3]; hence and . Conversely let be any continuous path from to and let , a continuous function with and ; for each successively applying [F4] on gives with , and then with by step 1.3 and [F2]; since and is strictly increasing on , each term is at least , so and ; for both numbers are . Hence on , the link has diameter at most , and is the intrinsic path metric of the round unit sphere restricted to the link.
Links of gluings. Let be an isometric polyhedral gluing with cells and let be a face. By step 1.2 the tangent cone and the angular link depend only on , and for the isometry maps onto , so its linear part maps isometrically into and maps its normal section onto the corresponding link face that is compatible with the cocycle condition; the intersection condition makes the intersections of the resulting images correspond to the common faces, so the cell links glue to a well-defined quotient , and replacing the point of changes nothing by step 1.2. The normal sections in cofaces inherit their polyhedral face incidences; when is simplicial these correspond to the simplices of its combinatorial link. A general polyhedral face link need not itself be simplicial.
Radial coordinates. For the vector lies in , and for , written with , the number is positive, the point lies in and normalises back to ; so is an inverse of and is a bijection . It is injective because gives with . The coefficients of a point of in the basis are unique, so every point of has unique barycentric ray coordinates with .
Iterated links and face compatibility. Let be a nonempty proper set of vertices (if it is the full set, the normal link is empty), put , and write . The orthogonal projection of onto is : pairing with each gives zero, while the subtracted vector lies in . Consequently , the Schur complement of , and is positive definite since for nonzero on the complementary indices, , where . In particular all are nonzero; normalising them gives the diagonal- Gram matrix . These projected rays describe the normal link: at an interior point of the face, coefficients of the face vertices can vary in both directions, whereas coefficients of the remaining vertices must be nonnegative; quotienting out the face span therefore leaves exactly the cone generated by the . For iteration, after removing a vertex, project the remaining vectors onto the perpendicular of its residual projected direction, not onto the perpendicular of the original vector. For a relative interior point of the spherical face, is a positive combination of its face vertices. A tangent vector with points into the simplex exactly when its coefficients outside are nonnegative: for small , the vector retains positive coefficients in , and its normalisation has initial direction , as . Removing the tangent face directions leaves and the projected rays , proving the asserted geometric link identification. Those residual directions obtained from an ordering of are orthogonal and span (each new residual is orthogonal to the preceding span and is nonzero by independence); their successive perpendicular projections therefore equal the single orthogonal projection onto . Intermediate normalisations only rescale rays by positive factors, so the final normalised Gram matrix is the same in every order. Restricting to a subface retains the corresponding subset of remaining rays, while linking a further face enlarges and repeats this operation.
Lipschitz estimates and the chord bound. is a nonempty compact convex cell and avoids by step 2.1 and [F5]. The reverse norm triangle inequality makes continuous, so [F9] gives an attained minimum , and for the estimate holds. On one has and (because with and ), so writing gives . For unit vectors put ; then by [F3], so the chord length is , the last step because for by [F3]. For the reverse comparison note first that : for the mean value theorem gives with , and because is strictly decreasing on [F3], so and ; the restriction of to is strictly decreasing with and by [F2] and [F3], so and is the unique point of with , lying in ; the function therefore has by [F3], positive on and negative on . The mean value theorem [F3] gives on and on (with ), that is, on . Applied to this gives , so the chord and round distances satisfy .
The finite spherical complex and the descent map. By steps 1.1 and 3.2 the identifications for are well-defined isometries onto faces, so is a well-defined quotient of the finite disjoint union of the compact simplices by finitely many face identifications. Let be the corresponding isometric polyhedral gluing with cells ; the cell maps , , agree on identified faces, because takes the value on all vertices in and hence restricts to ; so the descend to a bijection .
The link of a face of a finite spherical complex. Let be a finite spherical complex and let be the face corresponding to a nonempty simplex . The cells of are the links of the spherical simplices containing ; by step 3.2 each is again a spherical simplex, with Gram matrix obtained by iterating the Schur complements of step 2.2 over the vertices of , and these matrices are positive definite of diagonal and compatible with faces, because passing to a smaller coface retains a subset of the projected rays, while linking a further face enlarges the projected-out span; the identifications are those induced by and are isometric by step 2.4. Hence is again presented as a finite spherical complex, and clauses (i)-(v) apply to it.
Bi-Lipschitz equivalence of the model and its spherical simplex. With and the operator norm , steps 3.1 and 4.1 give for , the bounds and , so is a bi-Lipschitz equivalence between the Euclidean metric of and the round metric of with the constant .
The radial map is bi-Lipschitz for the chain metrics. If has no nonempty simplex then and there are no distance estimates to check. Otherwise, by step 5.1 each is bi-Lipschitz with constant , and the finitely many simplices of give finite maxima and . Every chain in maps under to a chain in whose one-step Euclidean distances are at most times the angular distances of the original chain, so ; likewise every chain in is the image of a chain in with angular steps at most times the Euclidean steps, so . Hence is a bi-Lipschitz equivalence of the chain metrics.
Component metrics and topology. The classes under being joined by a chain are finite in number. Each is a union of whole cells: any two points of one cell are joined by a single chain step. The trace of a class on every cell is therefore the entire cell or empty, so every class is weakly open and closed; each class is path connected by cell arcs, hence is a connected component. The corresponding component of satisfies (H1)-(H3), so [F7] supplies its metric, weak topology, properness and completeness; step 6.1 transfers these properties to the component of . Each component is compact as a quotient of finitely many compact cells. Its chain metric is a length metric: a chain can be replaced by cell arcs, whose -length is at most its chain length because on a cell, while every path has length at least the distance of its endpoints. Cellwise radial homeomorphisms descend to a homeomorphism for the quotient (weak) topologies, and the components are open and closed, so and are compact finite disjoint unions of the component metric spaces. Distances between distinct components remain auxiliary infinities; no real-valued global chain metric is asserted. The empty case is vacuous.
Minimizing geodesics (AC). Assume AC, fix in one component and put . AC selects, for each , a chain of length ; the infimum definition gives . Replace its steps by cell arcs, traversed at angular speed on (use the constant path for ). Each arc lies in its cell by the nonnegative-combination argument of step 2.3 applied to , and the triangle inequality gives , hence . The paths are equicontinuous and pointwise bounded in the compact proper component of step 7.1. The domain is compact as a nonempty bounded one-dimensional polyhedral cell by [F5]; with AC it satisfies [F8], giving a uniformly convergent subsequence with continuous limit and endpoints . Since , lower semicontinuity [F7] gives , while the endpoint partition gives the reverse bound. Reparametrise by arc length using [F7]. For , the resulting path is -Lipschitz, and forces ; thus equality holds and is a minimizing geodesic. AC is used for the sequence selection and for Ascoli.
The convention. Let be a face of a finite spherical complex . By step 4.3 the angular link is a finite spherical complex, so step 7.1 applies to it: being joined by a chain of directions inside common cells is reflexive (singleton chains), symmetric (reverse a chain) and transitive (concatenate chains), hence an equivalence relation on ; the infimum is finite whenever a chain from to exists and is a metric on each class by step 7.1, while for in different classes no chain joins them and . This infinite value is auxiliary notation, not an ordinary distance of the metric-space definition, and it is replaced by in the truncated metric of The angular path metric, the Euclidean cone and spherical joins.
Remarks
- Choice. In step 8.1 the Axiom of Choice selects the sequence of near-minimizing chains and supplies the hypothesis of the proper-target Ascoli theorem; clauses (i), (ii), (iv), (v) and (vi), and the metric/topology conclusions of (iii), are choice-free; the geodesic conclusion of (iii) assumes AC.
- The two model metrics. Steps 4.1 and 5.1 compare the round metric of with the Euclidean metric of through the chord metric; the constants are explicit ( for round versus chord, in step 5.1) and are not asserted to be optimal.
- No curvature claim. The link metric is proved to be a metric and the intrinsic metric of the round sphere; no CAT(1) assertion is made here, and the -geodesic convention remains a hypothesis of The angular path metric, the Euclidean cone and spherical joins and The cone and join metrics and the local product chart of a polyhedral gluing.
The angular path metric, the Euclidean cone and spherical joins
Definition
(1) Angular path metric. Let be a set with an extended metric , symmetric, vanishing exactly on the diagonal and satisfying the triangle inequality in the extended reals. For the angular link of a face of a finite spherical complex (Spherical Gram simplices and angular links of Euclidean faces, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas) the metric is the componentwise intrinsic path distance: the infimum of lengths of finite chains of directions inside a common cell, with for in different components. The value is auxiliary notation only and is never passed to the published definition of a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(2) Truncated angular metric. With the convention , put . This finite-valued function on is the angular metric; it has values in and its metric axioms are proved in The cone and join metrics and the local product chart of a polyhedral gluing ↗ (Sine and cosine defined by their real power series, Pi is the first positive zero of sine, Principal inverse sine and inverse cosine).
(3) The Euclidean cone. The Euclidean cone on the angular link is the set where is the apex, with In particular is a one-point space, not the empty space; and if — which happens in particular when lie in different components of — then , the length of the path through the apex. The infinite value of is never an ordinary metric value, and the cone receives only .
(4) Angular CAT(1) convention. A link is -geodesic if every pair of points at distance is joined by a minimizing segment. Angular CAT(1) statements about a link concern only triangles of perimeter and their comparison in the unit sphere (Euclidean spheres and closed balls as subspaces of ); every such test lies in one intrinsic component and agrees with the componentwise intrinsic test of whenever no side equals , while a side of length is realised in the model sphere by an antipodal pair; this is proved in The cone and join metrics and the local product chart of a polyhedral gluing ↗.
(5) Spherical join. Let be angular links with metrics . The spherical join is the quotient of by the identifications and ; write for the class of . The distance of and is the unique number in with Conventions: , and ; these are consistent with the product-cone isometry , under which is the unit link of the product cone. Quotient descent to the identified endpoints, the triangle inequality, associativity, the face metrics and the isometry with the unit link are conclusions of The cone and join metrics and the local product chart of a polyhedral gluing ↗; this item asserts only the construction, the formula and the conventions.
Remarks
- What is construction and what is theorem. Clauses (1)–(5) fix notation and conventions only: the truncated metric, the cone with its apex and the join with its empty conventions are defined here, while the metric axioms of , the cone metric and its geodesics, the quotient descent and triangle inequality of the join, associativity and the product-cone isometry are all proved in The cone and join metrics and the local product chart of a polyhedral gluing ↗. This item is the justification target of that theorem and asserts none of its conclusions.
- Why the truncation. The Euclidean cone formula requires a finite angular distance bounded by : the value of across distinct components of a link is replaced by , and the geodesics between the corresponding rays then pass through the apex. The link of a finite spherical complex is the case in which is the componentwise intrinsic path distance of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(vi).
- The square-sum convention. By the product-cone isometry, carries the square-sum product metric and is its unit link; the displayed cosine formula is the law of cosines of that cone, not an independent claim of the definition.
The cone and join metrics and the local product chart of a polyhedral gluing
Statement
Let be an angular link with its componentwise path metric and truncated metric as in The angular path metric, the Euclidean cone and spherical joins, and let be angular links. Then:
(1) Truncation agreement. is a metric on of diameter at most ; it agrees with on every pair at distance ; every triple with -perimeter has at most one side equal to , and if no side equals then the triple lies in a single component of and its three sides are the intrinsic path distances. Consequently the angular CAT(1) conventions of The angular path metric, the Euclidean cone and spherical joins (-geodesics and comparisons for perimeter ) coincide with the componentwise intrinsic tests whenever no side equals , and a side of length — which can arise only from a pair in different components or at intrinsic distance — is realised in the model sphere by an antipodal pair.
(2) Cone metric and geodesics. Clause (3) of The angular path metric, the Euclidean cone and spherical joins defines a metric on , including the cases where one radius is zero, where and where lie in different components; the metric is finite-valued and is a point. If then the path through the apex has length and is minimizing. If and are joined in by a minimizing segment, then the development of that segment into the planar sector of angle is a minimizing geodesic of from to of length ; if in addition is -geodesic, then is a geodesic space and every minimizing geodesic joining two points of is contained in the closed ball of radius about (Geodesics and geodesic metric spaces).
(3) Join, cone and product cone. Clause (5) of The angular path metric, the Euclidean cone and spherical joins defines a metric on (descent to the quotient, symmetry and the triangle inequality included) of diameter at most ; and sit in as the classes with and , and the conventions , are consistent with the construction. The map where is the point of at distance from the apex in the direction , is an isometry for the square-sum product metric; consequently is, up to isometry, the unit link of the product cone, and the join is associative up to canonical isometry. The face metrics of the join are the joins of the corresponding face metrics, and for round unit spheres .
(4) Local product chart. Let be an isometric polyhedral gluing satisfying the standing hypotheses (H2) local finiteness and (H3) finitely many shapes of Abstract isometric polyhedral gluings and the chain metric, and let lie in the relative interior of a -dimensional cell (Finite convex cell complex and linear subdivision). Then the connected component of carries its chain metric, and the angular link of the point , that is the set of unit directions of the tangent cone (the finitely many sets for the cells containing , identified by the gluing), is the spherical join , where is the round unit sphere of the direction space of ; and there is such that the metric ball in is isometric to the ball of radius about the cone point of and to the ball of radius about in , these charts preserving intrinsic lengths. In particular the cone receives only the truncated angular metric: the auxiliary value of is never an ordinary distance value.
Facts & Assumptions
Given: Angular links , , as in The angular path metric, the Euclidean cone and spherical joins, with , , their Euclidean cones; in clause (4) an isometric polyhedral gluing with (H2) and (H3), a point in the relative interior of a -dimensional cell , and its connected component with its chain metric.
with ; is an extended metric, symmetric, vanishing exactly on the diagonal and satisfying the extended triangle inequality (The angular path metric, the Euclidean cone and spherical joins).
is strictly decreasing on , is strictly increasing on , , , , the addition formulas hold and is the inverse of (Principal inverse sine and inverse cosine, Sine and cosine defined by their real power series, The addition formulas for sine and cosine, Signs, monotonicity intervals, and ranges of sine and cosine, Pi is the first positive zero of sine).
For unit vectors in a Euclidean space and the Euclidean plane with the standard norm is a metric space ( as the set of functions , and , , are metrics on it, Euclidean spheres and closed balls as subspaces of ).
In an isometric polyhedral gluing satisfying (H1)-(H3) the chain metric is a metric whose topology is the weak topology and the space is proper and complete; the uniform star radius and compatible triangulation of a face give a positive radius around every point in the relative interior of a cell (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete, Face coherence, global hat coordinates and a uniform star radius, Finite convex cell complexes admit compatible triangulations, Abstract isometric polyhedral gluings and the chain metric).
A geodesic segment is a distance-preserving parametrisation of an interval and a metric space is geodesic when every two points are joined by one; a product of two metric spaces with the square-sum metric is a metric space: the factor triangle inequalities bound its distance by the Euclidean norm of the sum of the two nonnegative distance-coordinate vectors, and the Euclidean triangle inequality bounds that norm by the sum of their norms (Geodesics and geodesic metric spaces, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, as the set of functions , and , , are metrics on it).
Proof
Truncation. The function is symmetric and vanishes exactly when , i.e. when ; it has values in , so its diameter is at most ; and for real one has , so the triangle inequality of passes to . On a pair with clearly .
Cone basics. For points the definition gives , so and is symmetric, vanishes exactly when and , and with ; moreover , that is , and holds exactly when , i.e. . In particular for fixed , and is finite whenever is nonempty, while is a point.
The cone triangle inequality, first case. Let , , with , , and suppose . In the Euclidean plane with origin put , , (if or read the point as the origin); then and by the law of cosines [F2], while and decreasing on give and hence . So .
Development of a minimizing segment. Let have and let be a minimizing segment with . Let be the planar sector of angle and define for , . Then for the identity holds, so is an isometry of onto its image and preserves lengths; the straight segment in from to has Euclidean length and its image is a path in of the same length joining the two points, hence a minimizing geodesic.
The join: descent and first properties. The relation on generated by the stated endpoint identifications is an equivalence relation. Write and , ; then and , so and by [F2], that is . If then depends only on the first coordinates, and if then depends only on the second, so is unchanged when a representative is replaced; the formula therefore descends to a symmetric function on pairs of classes, and is defined by with . Moreover with equality only for : equality forces , that is , and then forces when and when , so the two classes coincide, and conversely equal classes give ; hence exactly for and has diameter at most . The classes with and are the images of and ; when or is empty the quotient of is empty, and the stated conventions , , together with are exactly the cone formula at a one-point link.
Localisation and radial coordinates. Work in the connected component of : chain classes are open and closed unions of cells and are path connected, so this subgluing satisfies (H1)-(H3) and [F4] applies. The union of all cells not containing is weakly closed: its trace on any cell is a union of some of that cell's finitely many closed faces, by the intersection condition. It omits , since a face containing a relative interior point of contains . Thus for some . There are finitely many incident cells by (H2). In each, the facet inequalities not active at have positive values at ; choosing smaller than all their distances to their supporting hyperplanes ensures that, within Euclidean radius , the cell agrees exactly with . Choose and let be the gluing of the incident tangent cones, with Euclidean chain metric. On the radial subset , the map into the incident cell, followed by its inclusion in , is well defined and injective: the common-face condition and the gluing cocycle identify exactly the same vectors in and points in . For a chain of length starting at , all its vertices lie in , hence in incident cells, and radial norms along it are at most by the Euclidean reverse triangle inequality. Its pullback into has the same length. Conversely a radial segment of length maps to a path in of that length. Taking infima shows for , and every point of has such coordinates by pulling back a chain from of length less than .
Triples and antipodal pairs. If a triple has , then by the triangle inequality of step 1.1, so its perimeter is at least ; hence a triple of perimeter has no side equal to , and a fortiori at most one. If no side equals then all three -distances are , hence finite -distances, hence all three points lie in one component and the sides are intrinsic path distances, because on a pair at distance the truncated metric is the componentwise path distance. Finally, a pair of points of the model sphere at round distance is antipodal, since the round distance is of the inner product.
The cone triangle inequality, second case. With the same notation assume ; then because and . The identity gives , and similarly ; hence , with strict inequality when , where the last inequality is step 1.2.
The product-cone isometry. Let , , for with , and map to the point of at distance from the apex in the direction ; this map is a bijection onto (the collapsed cases or giving the points over or , and the apex) and it carries the square-sum product distance of two points to the cone distance: expanding with gives , which is the square of the cone distance of step 1.2 computed with the join formula.
The cone is a metric. Steps 1.2, 1.3 and 2.2 cover all triples: those with a vanishing radius, those with and those with , so satisfies the triangle inequality; symmetry and positivity were noted in step 1.2, and forces and , i.e. . Hence is a metric on in all cases, including , different components and , and it is finite-valued on nonempty .
The apex paths. If then step 1.2 gives ; the two radial segments from to and from to have length and by step 1.2 and concatenate to a path of length , so it is minimizing, and for or the same argument with a single radial segment applies. Thus radial segments are geodesics from the apex and the through-apex path realizes the distance whenever .
The join is a metric space. Let be the bijection of step 2.3 and let be the cone function on built by the cone formula of step 1.2 from the join function of step 1.5; the identity of step 2.3 says exactly that for all , where is the square-sum product metric of . The cone metrics on and are metrics by step 3.1, so is a metric by [F5] and , the pushforward of along , is a metric as well; in particular for all . Now let and put , , ; applying that inequality to the cone points of radii over gives for every , by the cone formula of step 1.2. If then by step 1.5; otherwise let and in the plane. If put and ; then the point satisfies and — the middle equality being the addition formulas, since — so lies on the segment ; if instead then with , the only cases being , and the choice gives or . Either way lies on , and expanding the three squares gives , and ; hence at . Both and lie in , where is strictly increasing and for by [F2], so . Hence the join function satisfies the triangle inequality and, with step 1.5, is a metric on of diameter at most .
The cone over a sphere. For the map , and , is a bijection, and for two points it preserves distances because ; hence . For the sphere is empty and by the empty convention.
The tangent-cone metric and the cone formula. Put with its cellwise intrinsic angular chain distance. Initially this is an extended pseudometric: reversing and concatenating chains prove symmetry and the triangle inequality, but separation has not yet been proved. The following comparison uses the cosine cone function on the direction quotient and does not assume separation. For the upper bound, if the truncated angular distance is , use the two radial segments through the origin. Otherwise take a link chain of total angle approaching that distance, and develop its successive sectors in a plane: the straight segment between the endpoint radii intersects the intermediate rays and yields a chain in of length . For the lower bound replace a chain in by its straight cell segments. If any segment passes through the origin, its total length is at least . Otherwise its radial projections give a link chain; develop the segments with monotonically increasing polar angle, of total angle at least the intrinsic angular distance. If , the endpoint chord has length at least the cone distance. If , split at the first crossing of the opposite ray, at radius : the preceding polyline has length at least , and the remainder at least , so the total is at least . These bounds prove the equality, without passing an infinite value to the cosine. Let . Cone chains realizing the upper bound between radii below remain at radii below , so they map to . Conversely chains in of length below between points of lie in and pull back with unchanged length; chains longer than that already exceed the cone distance, which is at most . Hence preserves distances bijectively between these balls. Distinct directions with zero angular distance would give distinct points at the same radius with zero distance in , contradicting [F4]. Thus the angular chain distance separates directions; the cone function is a metric by step 3.1, and is an isometry . Scaling tangent vectors scales every Euclidean chain length, so the cone formula and separation also hold on all of .
Geodesic space. Assume in addition that is -geodesic. For two points , : if or or use the radial or the through-apex path of step 4.1; if the hypothesis supplies a minimizing segment in and step 1.4 supplies a minimizing geodesic in joining to . So every two points of are joined by a geodesic segment and is a geodesic metric space.
Associativity, faces and spheres. The unit link of a cone is recovered by , so step 2.3 identifies with the unit link of ; iterating gives , so the two bracketed joins are isometric up to a canonical isometry; when are round unit spheres the same computation with the round inner product gives , and the face metrics of the join are the joins of the face metrics because the formula restricts to sub-links.
Containment in the ball. Let be a minimizing geodesic from to in and let be a point of its image with , , , so that . If the claimed radius bound is immediate, so suppose . If , the strict inequality of step 2.2 contradicts this equality; hence . Then, with as in step 1.3, the chain is an equality throughout, so are collinear with between and ; since the norm is convex along the segment from to , one has . This includes and the endpoints, so every minimizing geodesic joining to is contained in the closed ball of radius about .
The face product and its angular link. Let . Every active facet normal is perpendicular to , so each tangent cone splits orthogonally as , and the gluing maps respect the common and the normal sections. Thus is the gluing of . The chain comparison of step 4.4 applied to the normal cones identifies their glued chain distance with the cosine cone function on their angular direction quotient; separation is checked below. The chain metric of is the square-sum product metric: each chain has length at least by the triangle inequality in , applied to its nonnegative coordinate lengths; conversely choose a piecewise straight normal path with length approaching , parametrise it proportionally to length, and move the coordinate linearly over the same interval. The resulting cellwise path has length , proving the reverse bound on taking infima (constant normal paths cover coincident endpoints; a zero infimum is handled by arbitrarily short chains). Since the chain distance on is a metric by step 4.4, the product identity forces to separate points. The cone formula then forces the angular chain distance of distinct normal directions to be positive; reversal and concatenation give its extended metric axioms. Consequently , with the genuine cone metric of step 3.1. Steps 2.3, 4.2 and 4.3 identify this product with by a map preserving radial norm. Recovering the truncated angular distance from the distances of unit radial points as in step 5.2 gives with its angular metric. The ball isometries and all charts preserve intrinsic lengths.
Remarks
- Source of the route. Clauses (1)-(3) are Bridson-Haefliger I.5.6-I.5.16 (cone, truncation, geodesic characterisation, join and product-cone isometry) with Davis Appendix I.2 (Proposition I.2.17, Lemma I.2.18) for the cone and join; clause (4) is Bridson-Haefliger I.7.14-I.7.16 together with the facial identification used in the proof of Davis Theorem I.3.5.
- Triangle inequality of the join. The proof replaces an earlier, false argument (embedding three points of each factor into the round circle) by the product-cone pullback of step 4.2: the join formula is the apex-angle formula of the cone over the join, whose cone function is a metric because it is the pushforward of the square-sum product of the two Euclidean cones, and the chord comparison at the radii then transfers the triangle inequality to the three classes, uniformly in all cases including disconnected links and sides of length .
5 · Examples, counterexamples and false statements
None yet.