Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

The cone and join metrics and the local product chart of a polyhedral gluing

Statement

Let (L,dpath,dπ) 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 L1,L2 be angular links. Then:

(1) Truncation agreement. dπ is a metric on L of diameter at most π; it agrees with dpath on every pair at distance <π; every triple with dπ-perimeter <2π has at most one side equal to π, and if no side equals π then the triple lies in a single component of dpath 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 (Dπ-geodesics and comparisons for perimeter <2π) 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 C(L), including the cases where one radius is zero, where dπ(x,y)=π and where x,y lie in different components; the metric is finite-valued and C(∅)={o} is a point. If dπ(x,y)=π then the path through the apex has length r+s=dC((r,x),(s,y)) and is minimizing. If dπ(x,y)<π and x,y are joined in L by a minimizing segment, then the development of that segment into the planar sector of angle dπ(x,y) is a minimizing geodesic of C(L) from (r,x) to (s,y) of length dC((r,x),(s,y)); if in addition L is Dπ-geodesic, then C(L) is a geodesic space and every minimizing geodesic joining two points of C(L) is contained in the closed ball of radius max⁡{r,s} about o (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 L1∗L2 (descent to the quotient, symmetry and the triangle inequality included) of diameter at most π; L1 and L2 sit in L1∗L2 as the classes with θ=0 and θ=π/2, and the conventions L∗∅=L, ∅∗∅=∅ are consistent with the construction. The map ((r,x),(s,y))↦ξ(R),R=r2+s2,cos⁡θ=rR,sin⁡θ=sR, where ξ(R) is the point of C(L1∗L2) at distance R from the apex in the direction (cos⁡θ)x+(sin⁡θ)y, is an isometry C(L1)×C(L2)→C(L1∗L2) for the square-sum product metric; consequently L1∗L2 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 Sm−1∗Sn−1≅Sm+n−1.

(4) Local product chart. Let X 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 p∈X lie in the relative interior of a k-dimensional cell F (Finite convex cell complex and linear subdivision). Then the connected component Xp of p carries its chain metric, and the angular link of the point p, that is the set Lk⁡X(p) of unit directions of the tangent cone TpX (the finitely many sets TFCr∩S(Vr) for the cells Cr containing p, identified by the gluing), is the spherical join Lk⁡X(p)≅Sk−1∗Lk⁡X(F), where Sk−1 is the round unit sphere of the direction space of F; and there is ε>0 such that the metric ball BXp(p,ε) in Xp is isometric to the ball of radius ε about the cone point of C(Lk⁡X(p)) and to the ball of radius ε about (0,o) in Rk×C(Lk⁡X(F)), these charts preserving intrinsic lengths. In particular the cone receives only the truncated angular metric: the auxiliary value +∞ of dpath is never an ordinary distance value.

Facts & Assumptions

Given: Angular links (L,dpath,dπ), L1, L2 as in The angular path metric, the Euclidean cone and spherical joins, with C(L), C(L1), C(L2) their Euclidean cones; in clause (4) an isometric polyhedral gluing X with (H2) and (H3), a point p in the relative interior of a k-dimensional cell F, and its connected component Xp with its chain metric.

[F1]

dπ=min⁡{π,dpath} with min⁡{π,∞}=π; dpath 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).

[F2]

cos⁡ is strictly decreasing on [0,π], sin⁡ is strictly increasing on [0,π/2], cos⁡(π)=−1, cos⁡0=1, cos⁡2+sin⁡2=1, the addition formulas hold and arccos⁡ is the inverse of cos⁡∣[0,π] (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).

[F3]

For unit vectors in a Euclidean space ∣x−y∣2=2−2⟨x,y⟩ and the Euclidean plane with the standard norm is a metric space (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Euclidean spheres and closed balls as subspaces of Rn).

[F4]

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).

[F5]

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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it).

Proof

1.1givenF1algebra

Truncation. The function dπ(x,y)=min⁡{π,dpath(x,y)} is symmetric and vanishes exactly when dpath(x,y)=0, i.e. when x=y; it has values in [0,π], so its diameter is at most π; and for real a,b≥0 one has min⁡{π,a+b}≤min⁡{π,a}+min⁡{π,b}, so the triangle inequality of dpath passes to dπ. On a pair with dpath(x,y)<π clearly dπ=dpath.

1.2givenF2algebra

Cone basics. For points (r,x),(s,y)∈C(L) the definition gives dC((r,x),(s,y))2=r2+s2−2rscos⁡dπ(x,y), so dC≥0 and dC is symmetric, dC vanishes exactly when r=s and dπ(x,y)=0, and dC(o,(r,x))=r with dC(o,o)=0; moreover (r−s)2≤dC2≤(r+s)2, that is ∣r−s∣≤dC≤r+s, and dC=r+s holds exactly when cos⁡dπ(x,y)=−1, i.e. dπ(x,y)=π. In particular dC((t,x),(t′,x))=∣t−t′∣ for fixed x, and dC is finite whenever L is nonempty, while C(∅)={o} is a point.

1.3assume-case smallgivenF2F3algebra

The cone triangle inequality, first case. Let P=(r,x), Q=(t,z), T=(s,y) with α:=dπ(x,z), β:=dπ(z,y), γ:=dπ(x,y) and suppose α+β≤π. In the Euclidean plane with origin 0 put A:=re0, B:=teα, C:=seα+β (if A=0 or C=0 read the point as the origin); then ∣A−B∣=dC(P,Q) and ∣B−C∣=dC(Q,T) by the law of cosines [F2], while γ≤α+β≤π and cos⁡ decreasing on [0,π] give cos⁡γ≥cos⁡(α+β) and hence dC(P,T)2=r2+s2−2rscos⁡γ≤r2+s2−2rscos⁡(α+β)=∣A−C∣2. So dC(P,T)≤∣A−C∣≤∣A−B∣+∣B−C∣=dC(P,Q)+dC(Q,T).

1.4givenF2F3

Development of a minimizing segment. Let x,y∈L have dπ(x,y)=θ<π and let γ:[0,θ]→L be a minimizing segment with dπ(γ(u),γ(w))=∣u−w∣. Let S:={teu∈R2:t≥0, 0≤u≤θ} be the planar sector of angle θ and define Ψ(teu):=(t,γ(u)) for t>0, Ψ(0):=o. Then for t,t′>0 the identity dC((t,γ(u)),(t′,γ(w)))2=t2+t′2−2tt′cos⁡∣u−w∣=∣teu−t′ew∣2 holds, so Ψ is an isometry of S onto its image and preserves lengths; the straight segment in S from re0 to seθ has Euclidean length r2+s2−2rscos⁡θ=dC((r,x),(s,y)) and its image is a path in C(L) of the same length joining the two points, hence a minimizing geodesic.

1.5givenF1F2algebra

The join: descent and first properties. The relation on L1×L2×[0,π/2] generated by the stated endpoint identifications is an equivalence relation. Write E:=cos⁡θcos⁡θ′cos⁡dπ1(x1,x1′)+sin⁡θsin⁡θ′cos⁡dπ2(x2,x2′) and a:=cos⁡θcos⁡θ′, b:=sin⁡θsin⁡θ′; then a,b≥0 and a+b=cos⁡(θ−θ′)≤1, so E≤a+b≤1 and E≥−a−b≥−1 by [F2], that is E∈[−1,1]. If θ=θ′=0 then E=cos⁡dπ1(x1,x1′) depends only on the first coordinates, and if θ=θ′=π/2 then E=cos⁡dπ2(x2,x2′) depends only on the second, so E is unchanged when a representative is replaced; the formula therefore descends to a symmetric function G on pairs of classes, and d is defined by cos⁡d(x,x′)=G(x,x′) with d(x,x′)∈[0,π]. Moreover G(x,x′)≤1 with equality only for x=x′: equality forces cos⁡(θ−θ′)=1, that is θ=θ′, and then forces cos⁡dπ1(x1,x1′)=1 when cos⁡θ>0 and cos⁡dπ2(x2,x2′)=1 when sin⁡θ>0, so the two classes coincide, and conversely equal classes give G=1; hence d(x,x′)=0 exactly for x=x′ and d has diameter at most π. The classes with θ=0 and θ=π/2 are the images of L1 and L2; when L1 or L2 is empty the quotient of L1×L2×[0,π/2] is empty, and the stated conventions L∗∅:=L, ∅∗L:=L, ∅∗∅:=∅ together with C(∅)={o} are exactly the cone formula at a one-point link.

1.6F4algebra

Localisation and radial coordinates. Work in the connected component Xp of p: chain classes are open and closed unions of cells and are path connected, so this subgluing satisfies (H1)-(H3) and [F4] applies. The union A of all cells not containing F 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 p, since a face containing a relative interior point of F contains F. Thus B(p,a)∩A=∅ for some a>0. There are finitely many incident cells by (H2). In each, the facet inequalities not active at p have positive values at p; choosing b>0 smaller than all their distances to their supporting hyperplanes ensures that, within Euclidean radius b, the cell agrees exactly with p+TFCr. Choose h<min⁡{a,b} and let Z be the gluing of the incident tangent cones, with Euclidean chain metric. On the radial subset ∣v∣<h, the map v↦pr+v into the incident cell, followed by its inclusion in X, is well defined and injective: the common-face condition and the gluing cocycle identify exactly the same vectors in Z and points in X. For a chain of length ℓ<h starting at p, all its vertices lie in B(p,h), hence in incident cells, and radial norms along it are at most ℓ by the Euclidean reverse triangle inequality. Its pullback into Z has the same length. Conversely a radial segment of length t<h maps to a path in X of that length. Taking infima shows dX(p,Φ(v))=∣v∣ for ∣v∣<h, and every point of B(p,h) has such coordinates by pulling back a chain from p of length less than h.

2.1step 1.1F1F2

Triples and antipodal pairs. If a triple has dπ(x,y)=π, then π≤dπ(x,z)+dπ(z,y) by the triangle inequality of step 1.1, so its perimeter is at least 2π; hence a triple of perimeter <2π has no side equal to π, and a fortiori at most one. If no side equals π then all three dπ-distances are <π, hence finite dpath-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 S2 at round distance π is antipodal, since the round distance is arccos⁡ of the inner product.

2.2assume-case largestep 1.2F2algebra

The cone triangle inequality, second case. With the same notation assume α+β>π; then cos⁡α+cos⁡β=2cos⁡α+β2cos⁡α−β2<0 because α+β2∈(π/2,π] and ∣α−β∣2<π/2. The identity dC(P,Q)2=r2+t2−2rtcos⁡α=(r−tcos⁡α)2+t2sin⁡2α gives dC(P,Q)≥r−tcos⁡α, and similarly dC(Q,T)≥s−tcos⁡β; hence dC(P,Q)+dC(Q,T)≥r+s−t(cos⁡α+cos⁡β)≥r+s≥dC(P,T), with strict inequality when t>0, where the last inequality is step 1.2.

2.3givenstep 1.2step 1.5F2algebra

The product-cone isometry. Let R:=r2+s2, cos⁡θ:=r/R, sin⁡θ:=s/R for (r,x),(s,y)∈C(L1)×C(L2) with R>0, and map ((r,x),(s,y)) to the point of C(L1∗L2) at distance R from the apex in the direction (cos⁡θ)x+(sin⁡θ)y; this map is a bijection onto C(L1∗L2) (the collapsed cases r=0 or s=0 giving the points over L2 or L1, and R=0 the apex) and it carries the square-sum product distance of two points to the cone distance: expanding with cos⁡2+sin⁡2=1 gives dC((r,x1),(r′,x1′))2+dC((s,x2),(s′,x2′))2=R2+R′2−2RR′(cos⁡θcos⁡θ′cos⁡dπ1(x1,x1′)+sin⁡θsin⁡θ′cos⁡dπ2(x2,x2′)), which is the square of the cone distance of step 1.2 computed with the join formula.

3.1step 1.2step 1.3step 2.2

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 dC satisfies the triangle inequality; symmetry and positivity were noted in step 1.2, and dC(P,T)=0 forces r=s and dπ(x,y)=0, i.e. P=T. Hence dC is a metric on C(L) in all cases, including dπ(x,y)=π, different components and C(∅)={o}, and it is finite-valued on nonempty L.

4.1step 1.2step 3.1

The apex paths. If dπ(x,y)=π then step 1.2 gives dC((r,x),(s,y))=r+s; the two radial segments from (r,x) to o and from o to (s,y) have length r and s by step 1.2 and concatenate to a path of length r+s, so it is minimizing, and for r=0 or s=0 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 dπ(x,y)=π.

4.2step 1.5step 3.1step 2.3F2F5algebra

The join is a metric space. Let Φ:C(L1)×C(L2)→C(L1∗L2) be the bijection of step 2.3 and let D be the cone function on C(L1∗L2) built by the cone formula of step 1.2 from the join function d of step 1.5; the identity of step 2.3 says exactly that D(X,X′)=ρ(Φ−1X,Φ−1X′) for all X,X′∈C(L1∗L2), where ρ is the square-sum product metric of C(L1)×C(L2). The cone metrics on C(L1) and C(L2) are metrics by step 3.1, so ρ is a metric by [F5] and D, the pushforward of ρ along Φ, is a metric as well; in particular D(X,X′′)≤D(X,X′)+D(X′,X′′) for all X,X′,X′′∈C(L1∗L2). Now let x,y,z∈L1∗L2 and put A:=d(x,y), B:=d(y,z), C:=d(x,z); applying that inequality to the cone points of radii 1,s,1 over x,y,z gives 2−2cos⁡C≤1+s2−2scos⁡A+1+s2−2scos⁡B for every s≥0, by the cone formula of step 1.2. If A+B≥π then C≤π≤A+B by step 1.5; otherwise let U:=(1,0) and W:=(cos⁡(A+B),sin⁡(A+B)) in the plane. If sin⁡A+sin⁡B>0 put s∗:=sin⁡(A+B)sin⁡A+sin⁡B and λ:=sin⁡Asin⁡A+sin⁡B∈[0,1]; then the point V:=s∗(cos⁡A,sin⁡A) satisfies (1−λ)⋅0+λsin⁡(A+B)=s∗sin⁡A and (1−λ)⋅1+λcos⁡(A+B)=sin⁡B+sin⁡Acos⁡(A+B)sin⁡A+sin⁡B=sin⁡(A+B)cos⁡Asin⁡A+sin⁡B=s∗cos⁡A — the middle equality being the addition formulas, since sin⁡B=sin⁡(A+B)cos⁡A−sin⁡Acos⁡(A+B) — so V=(1−λ)U+λW lies on the segment [U,W]; if instead sin⁡A+sin⁡B=0 then A,B∈{0,π} with A+B≤π, the only cases being (A,B)=(0,0),(0,π),(π,0), and the choice s∗:=1 gives V=U or V=W. Either way V lies on [U,W], and expanding the three squares gives ∣U−V∣=1+s∗2−2s∗cos⁡A, ∣V−W∣=1+s∗2−2s∗cos⁡B and ∣U−W∣=2−2cos⁡(A+B)=2sin⁡A+B2; hence 2−2cos⁡C≤∣U−V∣+∣V−W∣=∣U−W∣=2sin⁡A+B2 at s=s∗. Both C2 and A+B2 lie in [0,π2], where sin⁡ is strictly increasing and 2−2cos⁡t=2sin⁡t2 for t∈[0,π] by [F2], so C≤A+B. Hence the join function satisfies the triangle inequality and, with step 1.5, is a metric on L1∗L2 of diameter at most π.

4.3step 1.2step 3.1F2F3

The cone over a sphere. For k≥1 the map C(Sk−1)→Rk, (t,ξ)↦tξ and o↦0, is a bijection, and for two points it preserves distances because dC((t,ξ),(t′,ξ′))2=t2+t′2−2tt′cos⁡dπ(ξ,ξ′)=t2+t′2−2tt′⟨ξ,ξ′⟩=∣tξ−t′ξ′∣2; hence C(Sk−1)≅Rk. For k=0 the sphere S−1 is empty and C(∅)={o}=R0 by the empty convention.

4.4step 3.1step 1.6F2F4algebra

The tangent-cone metric and the cone formula. Put M=Lk⁡X(p) 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 C(M) 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 Z of length t2+t′2−2tt′cos⁡Θ. For the lower bound replace a chain in Z by its straight cell segments. If any segment passes through the origin, its total length is at least t+t′. 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 s: the preceding polyline has length at least t+s, and the remainder at least ∣t′−s∣, so the total is at least t+t′. These bounds prove the equality, without passing an infinite value to the cosine. Let ε=h/4. Cone chains realizing the upper bound between radii below ε remain at radii below ε, so they map to X. Conversely chains in X of length below h−ε between points of B(p,ε) lie in B(p,h) and pull back with unchanged length; chains longer than that already exceed the cone distance, which is at most 2ε<h−ε. Hence Φ preserves distances bijectively between these balls. Distinct directions with zero angular distance would give distinct points at the same radius ε/2 with zero distance in X, contradicting [F4]. Thus the angular chain distance separates directions; the cone function is a metric by step 3.1, and Φ is an isometry B(o,ε)⊂C(M)→B(p,ε). Scaling tangent vectors scales every Euclidean chain length, so the cone formula and separation also hold on all of Z.

5.1step 1.4step 4.1F5

Geodesic space. Assume in addition that L is Dπ-geodesic. For two points P=(r,x), T=(s,y): if r=0 or s=0 or dπ(x,y)=π use the radial or the through-apex path of step 4.1; if dπ(x,y)<π the hypothesis supplies a minimizing segment in L and step 1.4 supplies a minimizing geodesic in C(L) joining P to T. So every two points of C(L) are joined by a geodesic segment and C(L) is a geodesic metric space.

5.2step 2.3step 4.2F2

Associativity, faces and spheres. The unit link of a cone is recovered by dπ(u,v)=arccos⁡((2−dC((1,u),(1,v))2)/2), so step 2.3 identifies L1∗L2 with the unit link of C(L1)×C(L2); iterating gives C((L1∗L2)∗L3)≅C(L1∗L2)×C(L3)≅C(L1)×C(L2)×C(L3), so the two bracketed joins are isometric up to a canonical isometry; when L1,L2 are round unit spheres the same computation with the round inner product gives Sm−1∗Sn−1≅Sm+n−1, and the face metrics of the join are the joins of the face metrics because the formula restricts to sub-links.

6.1cases-exhaustivestep 1.2step 1.3step 2.2step 5.1F3

Containment in the ball. Let c be a minimizing geodesic from P=(r,x) to T=(s,y) in C(L) and let Q=(t,z) be a point of its image with α:=dπ(x,z), β:=dπ(z,y), γ:=dπ(x,y), so that dC(P,Q)+dC(Q,T)=dC(P,T). If Q=o the claimed radius bound is immediate, so suppose t>0. If α+β>π, the strict inequality of step 2.2 contradicts this equality; hence α+β≤π. Then, with A,B,C as in step 1.3, the chain dC(P,Q)+dC(Q,T)=∣A−B∣+∣B−C∣≥∣A−C∣≥dC(P,T)=dC(P,Q)+dC(Q,T) is an equality throughout, so A,B,C are collinear with B between A and C; since the norm is convex along the segment from A to C, one has t=∣B∣≤max⁡{∣A∣,∣C∣}=max⁡{r,s}. This includes Q=o and the endpoints, so every minimizing geodesic joining P to T is contained in the closed ball of radius max⁡{r,s} about o.

7.1step 2.3step 4.2step 4.3step 5.2step 4.4F3algebra∎

The face product and its angular link. Let U=span⁡(F−p). Every active facet normal is perpendicular to U, so each tangent cone splits orthogonally as U⊕NFCr, and the gluing maps respect the common U and the normal sections. Thus Z is the gluing of U×NFCr. The chain comparison of step 4.4 applied to the normal cones identifies their glued chain distance dN with the cosine cone function on their angular direction quotient; separation is checked below. The chain metric of Z is the square-sum product metric: each chain has length at least ∣u−u′∣2+dN(n,n′)2 by the triangle inequality in R2, applied to its nonnegative coordinate lengths; conversely choose a piecewise straight normal path with length approaching dN(n,n′), parametrise it proportionally to length, and move the U coordinate linearly over the same interval. The resulting cellwise path has length ∣u−u′∣2+ℓN2, 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 Z is a metric by step 4.4, the product identity forces dN 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 Z≅Rk×C(Lk⁡X(F)), with the genuine cone metric of step 3.1. Steps 2.3, 4.2 and 4.3 identify this product with C(Sk−1∗Lk⁡X(F)) by a map preserving radial norm. Recovering the truncated angular distance from the distances of unit radial points as in step 5.2 gives M≅Sk−1∗Lk⁡X(F) 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 Lk⁡(x,Σ)=Sdim⁡F−1∗Lk⁡(F,Σ) 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 2−2cos⁡t=2sin⁡t2 at the radii 1,s∗,1 then transfers the triangle inequality to the three classes, uniformly in all cases including disconnected links and sides of length π.

Depends on

Used by

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