Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Berestovskii's cone criterion and the polyhedral link criterion

Statement

(i) Berestovskii's theorem. Let L be a metric space, let dπ:=min⁡{π,d}, and let C(L)={o}∪((0,∞)×L) be the Euclidean cone with the apex o separately included and the metric dC(o,(r,x))=r, dC2((r,x),(s,y))=r2+s2−2rscos⁡dπ(x,y) (The angular path metric, the Euclidean cone and spherical joins). Then C(L) is CAT(0) if and only if (L,dπ) 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 C(∅)={o}, the empty link is CAT(1) vacuously and its cone is the one-point CAT(0) space, so the equivalence also covers L=∅.

(ii) Polyhedral link criterion. Let X 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 F be a k-dimensional face and let p∈relint⁡F. Then X is locally CAT(0) at p if and only if the angular link Lk⁡X(F), with its truncated metric, is CAT(1). A sufficiently small ball about p is isometric to the ball of the same radius about (0,o) in Rk×C(Lk⁡X(F)) with the product metric (The cone and join metrics and the local product chart of a polyhedral gluing). In particular X is locally CAT(0) if and only if the angular link of every vertex of X is CAT(1).

Facts & Assumptions

Given: An angular link (L,dpath,dπ) with its cone C(L) as in the Statement; in (ii) a connected isometric polyhedral gluing X with finitely many shapes and local finiteness, a face F and p∈relint⁡F.

[F1]

The truncated metric dπ is a metric of diameter at most π; dπ agrees with dpath wherever the latter is <π; every dπ-triangle of perimeter <2π has at most one side equal to π and is intrinsic whenever it has none; the cone metric dC is a metric, its geodesics are the sector developments and, when dπ(x,y)=π, the path through the apex; C(L) is a geodesic space when L is Dπ-geodesic; and the local product chart B(p,ε)≅B((0,o),ε)⊂Rk×C(Lk⁡X(F)) 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).

[F4]

At every point of a face F, 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).

Proof

1.1F1F5givenalgebra

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 dπ. A minimizing segment from the apex is radial: for a point (t,z) on it, equality t+dC((t,z),(r,x))=r and the cone formula force z=x when t>0. On a minimizing cone segment from (r,x) to (s,y), r,s>0, a point (t,z) satisfies equality in the triangle inequality. If α=dπ(x,z) and β=dπ(z,y) have sum greater than π and t>0, the strict cone triangle inequality proved in [F1] excludes equality. Otherwise develop the radii in the plane at angles 0,α,α+β: 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 γ=dπ(x,y)<π, equality also forces α+β=γ, and the segment avoids the apex; its polar angle varies continuously and monotonically from 0 to γ (unless γ=0, when it is radial). The angular projection, parametrised by that angle, is a minimizing segment in (L,dπ): apply the same equality argument to every subsegment. If γ=π, the developed segment is a diameter, so every nonapex point has direction x or y and the segment is the through-apex path. Assume now C(L) 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.

2.1step 1.1F1F2F5algebra

Forward comparison with the actual chord radii. Let a triangle of short angular segments in L have perimeter <2π, and choose its spherical comparison triangle (yˉ1,yˉ2,yˉ3). Take cone vertices Pi=syi, s>0, and Euclidean vertices Pˉi=syˉi∈R3. Their pairwise distances agree by the cosine formula, so their affine plane is a Euclidean comparison triangle. If y lies on an angular side, let P=ty be the point on the corresponding cone geodesic whose angular projection is y, as supplied by step 1.1. Its radius t is the radius of the point Pˉ=tyˉ on the corresponding straight chord: both sectors have the same opening angle, endpoint radii and polar position. In particular P and Pˉ have the same side parameter; generally t≠s. For any two points y,y′ on angular sides, use the corresponding chord points P=ty, P′=t′y′ and their comparison points. CAT(0) gives t2+t′2−2tt′cos⁡dπ(y,y′)≤∣tyˉ−t′yˉ′∣2=t2+t′2−2tt′cos⁡dS(yˉ,yˉ′). Since t,t′>0, decreasing cosine on [0,π] yields dπ(y,y′)≤dS(yˉ,yˉ′). With step 1.1 this proves CAT(1).

2.2assume-case shortstep 1.1F1F2F3algebra

Reverse comparison, short angular perimeter. Assume (L,dπ) 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 P1=ay1, and a point Q at fraction v∈[0,1] of the side from P2=ry2 to P3=sy3. If a=0, the criterion is equality by the developed chord norm. If r=0 or s=0, the side is radial and the same equality follows by expanding the cone formula. Otherwise put α=dπ(y1,y2), β=dπ(y1,y3) and γ=dπ(y2,y3). For γ=0 the side is radial and again equality holds. Suppose 0<γ<π and write Q=ty with angular position τ=dπ(y2,y). In its developed sector, A:=(1−v)rt=sin⁡(γ−τ)sin⁡γ,B:=vst=sin⁡τsin⁡γ. If α+β+γ<2π, the spherical comparison inequality gives cos⁡dπ(y1,y)≥Acos⁡α+Bcos⁡β, since the comparison direction at position τ is Ayˉ2+Byˉ3. Expanding the cone formula therefore gives dC(P1,Q)2≤(1−v)dC(P1,P2)2+vdC(P1,P3)2−v(1−v)dC(P2,P3)2.

3.1assume-case largestep 2.2F1F2algebra

Reverse comparison, large angular perimeter. Retain 0<γ<π but suppose α+β+γ≥2π. Put g(τ)=Acos⁡α+Bcos⁡β, l=π−α and u=β+γ−π, so 0≤l≤u≤γ. Since β≥2π−α−γ and α+γ∈[π,2π], reflection cos⁡(α+γ)=cos⁡(2π−α−γ) and decreasing cosine on [0,π] give cos⁡β≤cos⁡(α+γ); the addition formulas consequently give g(τ)≤cos⁡(α+τ) on [0,l]. Likewise g(τ)≤cos⁡(β+γ−τ) on [u,γ]. In particular g(l),g(u)≤−1. If l<u, sine interpolation on this interval (length u−l<π) gives g(τ)=sin⁡(u−τ)sin⁡(u−l)g(l)+sin⁡(τ−l)sin⁡(u−l)g(u)≤−1(l≤τ≤u), because the coefficients are nonnegative and their sum is cos⁡(τ−(l+u)/2)/cos⁡((u−l)/2)≥1; if l=u use g(l)≤−1. The triangle inequality bounds dπ(y1,y)≤min⁡{π,α+τ,β+γ−τ}. Thus on the two outer intervals its cosine is at least the corresponding cosine above, and on the middle interval it is at least −1≥g(τ). Hence cos⁡dπ(y1,y)≥g(τ) everywhere, and the expansion in step 2.2 proves the same squared comparison inequality.

4.1assume-case antipodalstep 1.1step 2.2step 3.1F1F2F3cases-exhaustivealgebra

Reverse comparison, antipodal side. Suppose γ=π. Step 1.1 makes the side the through-apex path and the triangle inequality gives α+β≥π. Thus cos⁡α+cos⁡β=2cos⁡((α+β)/2)cos⁡((α−β)/2)≤0. If Q is on the y2 branch, its radius is t=r−v(r+s)≥0. The difference between the right side of the squared inequality in step 2.2 and dC(P1,Q)2 is exactly −2avs(cos⁡α+cos⁡β)≥0, by expansion. On the y3 branch it is −2a(1−v)r(cos⁡α+cos⁡β)≥0. 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.

5.1step 2.1step 4.1

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.

6.1step 5.1F1F3F5algebra

Local charts and cone dilation. Put Y=Rk×C(Lk⁡X(F)). By [F1], a small ball at p is isometric to a ball at (0,o) in Y. If Y is CAT(0), its convex balls are CAT(0). Conversely if a ball about (0,o) is CAT(0), the maps (u,(r,x))↦(λu,(λr,x)), λ>0, are bijective similarities of Y, since both coordinate metrics scale by λ. Any two points can be scaled into that ball, joined there and scaled back, so Y 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 Y. 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 Rk is CAT(0), (i) now proves that X is locally CAT(0) at p exactly when its normal face link is CAT(1).

7.1step 5.1step 6.1F1F4F5algebra∎

Vertex reduction. Necessity follows from step 6.1 with F={v}. Conversely suppose every vertex link is CAT(1); then its entire cone is CAT(0) by step 5.1. For any point p∈relint⁡F, choose a vertex v of F. In the tangent-cone gluing at v, the ray representing the cell segment from v to p has a point q at small positive radius. Its incident cells are exactly those containing F: in every incident cell the relative interior of the ray is the relative interior of the tangent face corresponding to F. The active facet inequalities at q are therefore precisely those containing F, the same as at p, and their Euclidean linear parts and gluing maps agree. Thus the tangent-cone gluing at q is isometric to that at p. 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 v is CAT(0), its small convex ball at q is CAT(0), so the corresponding ball at p is CAT(0). Hence X 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

Used by

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