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.
Berestovskii's cone criterion and the polyhedral link criterion
Statement
(i) Berestovskii's theorem. Let be a metric space, let , and let be the Euclidean cone with the apex separately included and the metric , (The angular path metric, the Euclidean cone and spherical joins). Then is CAT(0) if and only if is CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences). With the convention , the empty link is CAT(1) vacuously and its cone is the one-point CAT(0) space, so the equivalence also covers .
(ii) Polyhedral link criterion. Let be a connected isometric polyhedral gluing with finitely many shapes and local finiteness, with its chain metric (Abstract isometric polyhedral gluings and the chain metric, The chain metric is a metric, its topology is the weak topology, and the space is proper and complete), let be a -dimensional face and let . Then is locally CAT(0) at if and only if the angular link , with its truncated metric, is CAT(1). A sufficiently small ball about is isometric to the ball of the same radius about in with the product metric (The cone and join metrics and the local product chart of a polyhedral gluing). In particular is locally CAT(0) if and only if the angular link of every vertex of is CAT(1).
Facts & Assumptions
Given: An angular link with its cone as in the Statement; in (ii) a connected isometric polyhedral gluing with finitely many shapes and local finiteness, a face and .
The truncated metric is a metric of diameter at most ; agrees with wherever the latter is ; every -triangle of perimeter has at most one side equal to and is intrinsic whenever it has none; the cone metric is a metric, its geodesics are the sector developments and, when , the path through the apex; is a geodesic space when is -geodesic; and the local product chart preserves intrinsic lengths (The cone and join metrics and the local product chart of a polyhedral gluing, The angular path metric, the Euclidean cone and spherical joins, Spherical Gram simplices and angular links of Euclidean faces, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas).
Laws of cosines and angle conventions in and ; sine and cosine addition formulas (The addition formulas for sine and cosine, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
A product of CAT(0) spaces with the square-sum metric is CAT(0), since the hinged inequality holds in each factor and adds; is CAT(0) (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (iv)(c), as the set of functions , and , , are metrics on it, Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
At every point of a face , the local metric germ is the gluing of its incident tangent cones, with the normal face link independent of the relative interior point; the cone charts preserve lengths (The cone and join metrics and the local product chart of a polyhedral gluing, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas).
Metric and geodesic vocabulary: unique geodesics in CAT(0) spaces, convexity of balls there, continuity of the metric, and the round sphere metric (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences clause (iv), Continuity of a map between metric spaces, at a point and globally, in the - form, Euclidean spheres and closed balls as subspaces of , Geodesics and geodesic metric spaces).
Proof
Cone geodesics and angular projections. The cone metric and the sector geodesics of [F1] apply to any truncated metric: their triangle-inequality proof uses only the triangle inequality and diameter bound of . A minimizing segment from the apex is radial: for a point on it, equality and the cone formula force when . On a minimizing cone segment from to , , a point satisfies equality in the triangle inequality. If and have sum greater than and , the strict cone triangle inequality proved in [F1] excludes equality. Otherwise develop the radii in the plane at angles : the Euclidean triangle inequality and the decreasing cosine give the cone triangle inequality, and equality forces the developed middle point onto the straight endpoint segment. If , equality also forces , and the segment avoids the apex; its polar angle varies continuously and monotonically from to (unless , when it is radial). The angular projection, parametrised by that angle, is a minimizing segment in : apply the same equality argument to every subsegment. If , the developed segment is a diameter, so every nonapex point has direction or and the segment is the through-apex path. Assume now is CAT(0). Its geodesics exist and are unique by [F5], so this argument gives existence of short angular segments; their uniqueness follows since two such segments would, by sector development, give two cone geodesics between the same positive-radius endpoints.
Forward comparison with the actual chord radii. Let a triangle of short angular segments in have perimeter , and choose its spherical comparison triangle . Take cone vertices , , and Euclidean vertices . Their pairwise distances agree by the cosine formula, so their affine plane is a Euclidean comparison triangle. If lies on an angular side, let be the point on the corresponding cone geodesic whose angular projection is , as supplied by step 1.1. Its radius is the radius of the point on the corresponding straight chord: both sectors have the same opening angle, endpoint radii and polar position. In particular and have the same side parameter; generally . For any two points on angular sides, use the corresponding chord points , and their comparison points. CAT(0) gives . Since , decreasing cosine on yields . With step 1.1 this proves CAT(1).
Reverse comparison, short angular perimeter. Assume is CAT(1). Short angular segments exist and are unique (the CAT(1) inequality on the degenerate triangle made from two competing short segments forces their equal-parameter points to coincide). Sector development and through-apex paths give cone geodesics, and step 1.1 classifies all of them. To prove CAT(0), use the squared vertex-to-side criterion of Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(c). Fix a vertex , and a point at fraction of the side from to . If , the criterion is equality by the developed chord norm. If or , the side is radial and the same equality follows by expanding the cone formula. Otherwise put , and . For the side is radial and again equality holds. Suppose and write with angular position . In its developed sector, If , the spherical comparison inequality gives , since the comparison direction at position is . Expanding the cone formula therefore gives
Reverse comparison, large angular perimeter. Retain but suppose . Put , and , so . Since and , reflection and decreasing cosine on give ; the addition formulas consequently give on . Likewise on . In particular . If , sine interpolation on this interval (length ) gives because the coefficients are nonnegative and their sum is ; if use . The triangle inequality bounds . Thus on the two outer intervals its cosine is at least the corresponding cosine above, and on the middle interval it is at least . Hence everywhere, and the expansion in step 2.2 proves the same squared comparison inequality.
Reverse comparison, antipodal side. Suppose . Step 1.1 makes the side the through-apex path and the triangle inequality gives . Thus . If is on the branch, its radius is . The difference between the right side of the squared inequality in step 2.2 and is exactly , by expansion. On the branch it is . Both include the apex. Together with the preceding two paragraphs, this case covers every side and every vertex; the vertex-to-side criterion [F3] therefore proves CAT(0), completing the reverse implication.
Cone equivalence. Steps 1.1 and 2.1 prove the forward implication and steps 2.2, 3.1 and 4.1 the reverse implication, with the empty cone a single point. This proves (i) in full.
Local charts and cone dilation. Put . By [F1], a small ball at is isometric to a ball at in . If is CAT(0), its convex balls are CAT(0). Conversely if a ball about is CAT(0), the maps , , are bijective similarities of , since both coordinate metrics scale by . Any two points can be scaled into that ball, joined there and scaled back, so is geodesic; any chosen geodesic triangle is bounded and can likewise be scaled wholly into the ball, where its CAT(0) inequality holds, and scaled back. Thus local CAT(0) at the origin is equivalent to CAT(0) of . A square-sum product is CAT(0) when both factors are, by adding their squared vertex-to-side inequalities; conversely the slices of each factor are convex (a minimizing product segment with equal endpoints in one coordinate must keep that coordinate constant), so CAT(0) of the product implies CAT(0) of each factor. Since is CAT(0), (i) now proves that is locally CAT(0) at exactly when its normal face link is CAT(1).
Vertex reduction. Necessity follows from step 6.1 with . Conversely suppose every vertex link is CAT(1); then its entire cone is CAT(0) by step 5.1. For any point , choose a vertex of . In the tangent-cone gluing at , the ray representing the cell segment from to has a point at small positive radius. Its incident cells are exactly those containing : in every incident cell the relative interior of the ray is the relative interior of the tangent face corresponding to . The active facet inequalities at are therefore precisely those containing , the same as at , and their Euclidean linear parts and gluing maps agree. Thus the tangent-cone gluing at is isometric to that at . The finite-facet proof of the local chart [F4] applies equally to the finitely many incident polyhedral cones, so it identifies sufficiently small balls at both points with balls in this same tangent gluing (choose radii below the finitely many inactive facet distances, as in [F1]). Since the cone at is CAT(0), its small convex ball at is CAT(0), so the corresponding ball at is CAT(0). Hence is locally CAT(0) everywhere, proving the vertex form.
Remarks
- Comparison route. The reverse implication uses the squared vertex-to-side criterion and explicit sine interpolation; steps 3.1 and 4.1 supply the large-perimeter and antipodal cases directly. The forward implication uses the actual variable radii of chord points, and the local-to-global cone passage uses radial similarities.
- Source locator correction. The scaffold's locator "I.3.14–I.3.17, printed pp. 188–191" is a slip: chapter I.3 is "Length Spaces", while Berestovskii's theorem, the join corollary and the cone-over-a-circle example are II.3.14–II.3.17 at exactly those printed pages (the item cites them correctly). The source metadata and owning manifest use the corrected locations.
- Choice. No step of this proof selects from an infinite family; the cases and the gluing of finitely many comparison triangles are explicit.
Depends on
- The addition formulas for sine and cosine
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles
- Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences
- The angular path metric, the Euclidean cone and spherical joins
- The cone and join metrics and the local product chart of a polyhedral gluing
- Spherical Gram simplices and angular links of Euclidean faces
- Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
- Abstract isometric polyhedral gluings and the chain metric
- Face coherence, global hat coordinates and a uniform star radius
- The chain metric is a metric, its topology is the weak topology, and the space is proper and complete
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open ball, closed ball and sphere in a metric space
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Geodesics and geodesic metric spaces
- Complete metric space: every Cauchy sequence converges in the space
- Euclidean spheres and closed balls as subspaces of $\mathbb{R}^n$
- Principal inverse sine and inverse cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- $\mathbb{R}^n$ as the set of functions $n \to \mathbb{R}$, and $d_1$, $d_2$, $d_\infty$ are metrics on it
- Isometry, isometric embedding, and the subspace metric on a subset
Used by
- 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 spherical radius estimate, the quadrilateral separation constant, and the finite midpoint-operation comparison disk Lemma
- The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem) Theorem
Dependency tree · two levels
98 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 André 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)