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 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 .
Depends on
- Abstract isometric polyhedral gluings and the chain metric
- The angular path metric, the Euclidean cone and spherical joins
- Spherical Gram simplices and angular links of Euclidean faces
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Finite convex cell complex and linear subdivision
- Geodesics and geodesic metric spaces
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Principal inverse sine and inverse cosine
- Sine and cosine defined by their real power series
- Face coherence, global hat coordinates and a uniform star radius
- Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
- Finite convex cell complexes admit compatible triangulations
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- A finite simplicial complex has a compact Hausdorff realization
- The chain metric is a metric, its topology is the weak topology, and the space is proper and complete
- The addition formulas for sine and cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Pi is the first positive zero of sine
Used by
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles Definition
- The disconnected universal-Coxeter nerve and the angular truncation convention Example
- Face links of large metric flag complexes, and the inductive local CAT(1) criterion Lemma
- Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π Lemma
- Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres Lemma
- The angular link of a vertex of the Davis complex is the large metric flag nerve Lemma
- The spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk Lemma
- Berestovskii's cone criterion and the polyhedral link criterion Theorem
- The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem) Theorem
Cited to discharge well-definedness by The angular path metric, the Euclidean cone and spherical joins.
Dependency tree · two levels
94 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
- Martin R. Bridson and Andre Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF) (standard reference, not scraped)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008) (standard reference, not scraped)