Alphabeta Math
LemmaStatement: 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.

Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas

Statement

Let C=(cij) be a real symmetric positive-definite (n+1)×(n+1) matrix with diagonal 1, and let L, u0,…,un, K(C), Σ(C) be as in Spherical Gram simplices and angular links of Euclidean faces.

(i) Existence and uniqueness of the Gram realisation. The vectors ui are unit vectors with ui⋅uj=cij, they are linearly independent and span Rn+1, and every other family ui′ of unit vectors in a Euclidean space with ui′⋅uj′=cij is the image of (u0,…,un) under a linear isometry of Rn+1 onto the span of the ui′. Hence Σ(C) is well-defined up to an isometry of Sn mapping vertices to vertices.

(ii) Hemisphere, radial coordinates and bi-Lipschitz comparison. The linear functional φ determined by φ(ui)=1 for all i satisfies φ(∑iλiui)=∑iλi; consequently φ>0 on K(C)∖{0} and Σ(C) is contained in the open hemisphere {x∈Sn:φ(x)>0}. Radial normalisation ρ(x):=x/∣x∣ restricts to a bijection Δ(C)→Σ(C), where Δ(C):={∑iλiui:λi≥0, ∑iλi=1}, with inverse y↦y/φ(y); every point of Σ(C) therefore has unique barycentric ray coordinates λi≥0 with ∑iλi=1. Moreover ρ and ρ−1 satisfy the explicit Lipschitz estimates ∣ρ(x)−ρ(y)∣≤2min⁡z∈Δ(C)∣z∣∣x−y∣ and ∣ρ−1(y)−ρ−1(y′)∣≤(1+∥φ∥)∣y−y′∣, proved directly from the formulas without differentiability; here ∥φ∥=∣w∣ for the unique coordinate vector w with φ(x)=w⋅x. Hence the round metric dang(ξ,η)=arccos⁡⟨ξ,η⟩ on Σ(C) is bi-Lipschitz equivalent to the Euclidean metric of the compact convex cell Δ(C) carried by ρ (on a subset of the unit sphere the round distance and the chord distance satisfy chord≤round≤π2 chord).

(iii) Finite spherical complexes. Let K be a finite abstract simplicial complex (An abstract simplicial complex) whose nonempty simplices σ carry positive-definite Gram matrices Cσ of diagonal 1, compatible with faces. Form X:=∣K∣C by gluing the spherical simplices Σ(Cσ) along their vertex-wise face identifications. On each component define the chain metric d as the infimum of ∑idpi(xi−1,xi) over finite chains in common cells, with dp 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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric). The inverse cellwise radial maps descend to a homeomorphism X→Y, where Y is the Euclidean gluing with cells Δ(Cσ); it is bi-Lipschitz on every component. Each component of X is a compact proper complete length space whose metric topology is the weak topology, and X is a finite disjoint union of these components. For the empty complex, X=Y=∅. Under the Axiom of Choice (The Axiom of Choice), every two points in a component are joined by a minimizing geodesic of length d(x,y), 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 A consists of the unit tangent directions perpendicular to PA:=span⁡{ua:a∈A} that point into Σ(C) at a relative interior point of the face. For n≥1 and 1≤i≤n put vi:=(ui−ci0u0)/1−ci02∈u0⊥∩Sn. The link of the vertex u0 in Σ(C) is the spherical simplex with vertices v1,…,vn, and its Gram matrix is cijlk=cij−ci0cj0(1−ci02)(1−cj02)(1≤i,j≤n), which is positive definite: the projection formula follows by expanding vi⋅vj, and positivity follows from the positive definiteness of the unnormalised Schur complement (cij−ci0cj0)i,j≥1, whose quadratic form is wTCw>0 for the nonzero vector w=(−x1c10−⋯−xncn0, x1,…,xn). Iterating the formula over the vertices of a face of Σ(C) 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 n=0 is empty. More generally, for a nonempty proper vertex set A, let CA=(cab)a,b∈A, bi=(cai)a∈A and wi:=ui−∑a∈A(CA−1bi)aua for i∉A. These are the orthogonal projections onto PA⊥, with zij:=⟨wi,wj⟩=cij−biTCA−1bj; the face-link Gram matrix is zij/ziizjj.

(v) Angular links of Euclidean faces. For a compact convex polyhedral cell C and a face F as in Spherical Gram simplices and angular links of Euclidean faces, with direction space U(F) and normal cone NFC=TFC∩U(F)⊥, after constant defining inequalities are discarded, the two descriptions of the tangent cone agree: TFC={λ(x−p):x∈C, λ≥0}‾ for every p in the relative interior of F, and TFC={ξ:⟨ξ,nj⟩≥0 (j∈I(F))} for the inward unit normals of the active defining hyperplanes; the tangent cone and the normal cone depend only on F. The cone NFC is pointed, and is closed under nonnegative combinations, so for ξ,η∈NFC∩S(V) the shorter great-circle arc between them stays in NFC∩S(V) and realises arccos⁡⟨ξ,η⟩ as an intrinsic path in the link; conversely every path in NFC∩S(V) 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 Lk⁡C(F), it is a metric of diameter at most π, and the links Lk⁡Cp(F) of the cells containing a face F of an isometric polyhedral gluing depend only on F, so their quotient Lk⁡X(F) 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 (n+1)×(n+1) matrix C with diagonal 1, its Cholesky factor L, the vectors ui, the cone K(C) and simplex Σ(C) of Spherical Gram simplices and angular links of Euclidean faces; in clauses (iii) and (vi) additionally a finite abstract simplicial complex K with compatible Gram matrices Cσ as in the Statement.

[F1]

A real symmetric positive-definite matrix has a unique Cholesky factorisation C=LLT with lower triangular L and positive diagonal; then L is invertible and C=LLT 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).

[F2]

In a real inner-product space, ⟨⋅,⋅⟩ is bilinear and symmetric, ∣v∣=⟨v,v⟩ is a norm, ∣⟨u,v⟩∣≤∣u∣∣v∣ with equality exactly for linearly dependent u,v, every finite-dimensional subspace has an orthogonal complement and orthogonal projection by For a subspace W of a finite-dimensional inner product space, V=W⊕W⊥ and The orthogonal projection PWv is the W-component in V=W⊕W⊥, the unit sphere is Sn={x∈Rn+1:∣x∣=1} (Euclidean spheres and closed balls as subspaces of Rn), and arccos⁡:[−1,1]→[0,π] is the inverse of the strictly decreasing restriction of cos⁡ to [0,π], continuous on [−1,1] (Principal inverse sine and inverse cosine, The induced length is a norm, Real and complex inner-product spaces and their induced length, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs).

[F3]

cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y and sin⁡(x+y)=sin⁡xcos⁡y+cos⁡xsin⁡y for all real x,y (The addition formulas for sine and cosine); sin⁡′=cos⁡ and cos⁡′=−sin⁡ (The derivatives of sine and cosine are cosine and minus sine); sin⁡(π/2)=1, cos⁡(π/2)=0, sin⁡π=0 and cos⁡π=−1 (Quarter-turn values and shifts by pi/2 and pi); cos⁡2t+sin⁡2t=1 and sin⁡(−t)=−sin⁡t (Parity and the Pythagorean identity for sine and cosine); cos⁡ is strictly decreasing on [0,π], and sin⁡ is strictly increasing on [0,π/2] (Signs, monotonicity intervals, and ranges of sine and cosine); for 0<x≤2 one has sin⁡x≥x−x3/6≥x/3>0, and cos⁡2≤−1/3, so cos⁡ is strictly decreasing on [0,2] and π/2<2 (Sine is positive and cosine is strictly decreasing on (0,2), with cos 2 at most -1/3); lim⁡x→0sin⁡x/x=1 (The limit of sin x divided by x at zero is one); and sin⁡u≤u for u≥0, since for u>0 the mean value theorem gives sin⁡u=ucos⁡ξ for some ξ∈(0,u) with cos⁡ξ≤1 (The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a)).

[F5]

A compact convex polyhedral cell is given by finitely many affine inequalities ℓj≥0; 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).

[F6]

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

[F7]

For an isometric polyhedral gluing: the cells are compact convex polyhedral cells, the face relation and gluing isometries hp,q 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).

[F9]

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

1.1givenF1F2algebra

Gram realisation. By [F1], C=LLT with L invertible, so the rows ui of L satisfy ui⋅uj=(LLT)ij=cij, in particular ∣ui∣2=cii=1, and they are linearly independent because det⁡L≠0. If (ui′) is any family of unit vectors of a Euclidean space with ui′⋅uj′=cij and ∑iλiui=0, then ∣∑iλiui′∣2=λTCλ=∣∑iλiui∣2=0, so ∑iλiui′=0; the two families therefore obey the same linear relations, the map T sending ui to ui′ 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; T extends to a linear isometry of Rn+1 onto the span of the ui′, which carries K(C) onto the cone generated by the ui′ and Σ(C) onto its unit section.

1.2givenF5F2algebra

The two tangent-cone descriptions. Let C be given by the nonconstant inequalities ℓj≥0 after the discarding prescribed in the definition, and let p lie in the relative interior of the face F, with I(F) the set of j with ℓj(p)=0 and nj=∇ℓj/∣∇ℓj∣ inward. If ξ satisfies ⟨ξ,nj⟩≥0 for all j∈I(F), then for small ε>0 the point p+εξ satisfies ℓj(p+εξ)=ℓj(p)+ε⟨∇ℓj,ξ⟩=ε∣∇ℓj∣⟨nj,ξ⟩≥0 for j∈I(F) and ℓj(p+εξ)>0 for j∉I(F) by continuity and ℓj(p)>0, so p+εξ∈C and ξ is a limit of vectors λ(x−p) with x∈C. Conversely, for x∈C and j∈I(F) the affine identity ℓj(x)=ℓj(p)+⟨x−p,∇ℓj⟩ gives ⟨x−p,nj⟩=ℓj(x)/∣∇ℓj∣≥0, so every λ(x−p) with λ≥0 lies in the closed cone {ξ:⟨ξ,nj⟩≥0 (j∈I(F))}; the two cones agree, and since an affine function nonnegative on F vanishes at a relative interior point exactly when it vanishes throughout F, the active set does not depend on p, and the tangent cone TFC does not depend on the chosen point of the relative interior. The common kernel of the active gradients is U(F): it contains U(F) because the active functions vanish on F; conversely, for a vector in that kernel, sufficiently small displacements p±εξ remain in C and satisfy all active equalities, hence belong to F by [F5], so ξ∈U(F).

1.3givenF2F3algebra

The angular distance is a metric. For unit vectors ξ,η the number dang(ξ,η)=arccos⁡⟨ξ,η⟩∈[0,π] is well defined by [F2], is symmetric, vanishes exactly when ⟨ξ,η⟩=1, i.e. ξ=η, and is at most π. If ξ,ζ,η are unit, α:=dang(ξ,ζ) and β:=dang(ζ,η) satisfy α+β≤π, write (trivially if α=0 or β=0) ξ=cos⁡α ζ+sin⁡α a and η=cos⁡β ζ+sin⁡β b with a,b unit and orthogonal to ζ by [F2]; then ⟨ξ,η⟩=cos⁡αcos⁡β+sin⁡αsin⁡β⟨a,b⟩≥cos⁡αcos⁡β−sin⁡αsin⁡β=cos⁡(α+β) by [F2] and [F3], so dang(ξ,η)≤α+β because arccos⁡ is the inverse of the strictly decreasing cos⁡ on [0,π]; if α+β>π the same inequality is trivial. So dang is a metric of diameter at most π on every set of unit vectors.

2.1step 1.1F2algebra

The hemisphere functional. Since (ui) is a basis of Rn+1 by step 1.1, there is a unique linear functional φ with φ(ui)=1 for all i, and φ(∑iλiui)=∑iλi for all λ. If x=∑iλiui∈K(C)∖{0} with λi≥0, then some λi>0, so φ(x)=∑iλi>0; hence Σ(C)⊆{x∈Sn:φ(x)>0} and 0∉Δ(C):={x∈K(C):φ(x)=1}, which is the set of convex combinations ∑iλiui with λi≥0, ∑iλi=1. In standard coordinates φ(x)=w⋅x for a unique nonzero vector w; [F2] gives ∣φ(x)∣≤∣w∣∣x∣, with equality at x=w/∣w∣, so ∥φ∥:=∣w∣ is the finite operator norm.

2.2step 1.1F2algebra

Schur complements. Since ∣ci0∣<1 for i≥1 by [F2] and the linear independence of ui,u0 of step 1.1, the vectors vi:=(ui−ci0u0)/1−ci02 are well defined; they satisfy vi⋅u0=0 and ∣vi∣=1, and expanding vi⋅vj gives vi⋅vj=(cij−ci0cj0)/(1−ci02)(1−cj02)=cijlk, in particular ciilk=1. Writing w:=(−∑jc0jxj, x1,…,xn) for x∈Rn∖{0}, the vector w is nonzero and, with c00=1, wTCw=∑i,j≥1cijxixj−(∑jc0jxj)2>0; the quadratic form on the right is that of the unnormalised Schur complement Z:=(cij−ci0cj0)i,j≥1, so Z is positive definite, and Clk=S−1/2ZS−1/2 with the positive diagonal S=diag⁡(1−ci02) is positive definite as well.

2.3step 1.2step 1.3F2F3F4algebra

The intrinsic path metric of a link. For a continuous path γ in V write ℓ(γ) for the supremum of ∑i∣γ(ti+1)−γ(ti)∣ over finite partitions of its parameter interval, and for ξ,η∈Lk⁡C(F) let dint(ξ,η) be the infimum of ℓ(γ) over continuous paths in Lk⁡C(F) from ξ to η. Let θ=dang(ξ,η). The cone NFC 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 F, namely U(F); orthogonality to U(F) then forces the vector to be zero. Thus distinct unit directions are never antipodal and 0<θ<π. If θ>0, pick a unit w∈ξ⊥ with η=cos⁡θ ξ+sin⁡θ w and put γ(t):=cos⁡t ξ+sin⁡t w for t∈[0,θ]; then γ([0,θ])⊆NFC∩S(V) because γ(t)=sin⁡(θ−t)sin⁡θξ+sin⁡tsin⁡θη is a nonnegative combination of ξ,η∈NFC for 0≤t≤θ, and for every partition ∑i∣γ(ti+1)−γ(ti)∣=∑i2sin⁡ti+1−ti2≤∑i(ti+1−ti)=θ while the uniform partition into m parts has sum 2msin⁡θ2m→θ as m→∞ by [F3]; hence ℓ(γ)=θ and dint(ξ,η)≤θ. Conversely let γ:[a,b]→NFC∩S(V) be any continuous path from ξ to η and let f(t):=dang(ξ,γ(t)), a continuous function with f(a)=0 and f(b)=θ; for each m≥1 successively applying [F4] on [ti−1,b] gives a=t0≤t1≤⋯≤tm=b with f(ti)=iθ/m, and then ∑i∣γ(ti)−γ(ti−1)∣=∑i2sin⁡φi2 with φi:=dang(γ(ti−1),γ(ti))≥∣f(ti)−f(ti−1)∣=θ/m by step 1.3 and [F2]; since φi∈[0,π] and sin⁡ is strictly increasing on [0,π/2], each term is at least 2sin⁡θ2m, so ℓ(γ)≥2msin⁡θ2m→θ and dint(ξ,η)≥θ; for θ=0 both numbers are 0. Hence dint=dang on Lk⁡C(F), the link has diameter at most π, and dang is the intrinsic path metric of the round unit sphere restricted to the link.

2.4step 1.2F7

Links of gluings. Let X be an isometric polyhedral gluing with cells Cp and let F be a face. By step 1.2 the tangent cone TFCp and the angular link Lk⁡Cp(F) depend only on F, and for p≤q the isometry hp,q:Cp→Cq maps F onto F, so its linear part maps TFCp isometrically into TFCq 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 Lk⁡X(F), and replacing the point of F changes nothing by step 1.2. The normal sections in cofaces G>F inherit their polyhedral face incidences; when X is simplicial these correspond to the simplices G∖F of its combinatorial link. A general polyhedral face link need not itself be simplicial.

3.1step 1.1step 2.1F2algebra

Radial coordinates. For x∈Δ(C) the vector ρ(x)=x/∣x∣ lies in K(C)∩Sn=Σ(C), and for y∈Σ(C), written y=∑iλiui with λi≥0, the number φ(y)=∑iλi>0 is positive, the point y/φ(y)=∑i(λi/φ(y))ui lies in Δ(C) and normalises back to y; so y↦y/φ(y) is an inverse of ρ and ρ is a bijection Δ(C)→Σ(C). It is injective because x/∣x∣=x′/∣x′∣ gives x=ax′ with a=∣x∣/∣x′∣=φ(x)/φ(x′)=1. The coefficients λi of a point of Δ(C) in the basis (ui) are unique, so every point of Σ(C) has unique barycentric ray coordinates λi≥0 with ∑iλi=1.

3.2step 1.1step 2.2F2algebra

Iterated links and face compatibility. Let A be a nonempty proper set of vertices (if it is the full set, the normal link is empty), put PA:=span⁡{ua:a∈A}, and write bi=(cai)a∈A. The orthogonal projection of ui onto PA⊥ is wi=ui−∑a∈A(CA−1bi)aua: pairing with each ua gives zero, while the subtracted vector lies in PA. Consequently ⟨wi,wj⟩=cij−biTCA−1bj, the Schur complement Z of CA, and Z is positive definite since for nonzero x on the complementary indices, (−CA−1Bx,x)TC(−CA−1Bx,x)=xTZx>0, where B=(cai). In particular all wi are nonzero; normalising them gives the diagonal-1 Gram matrix zij/ziizjj. 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 wi. 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 p of the spherical face, p is a positive combination of its face vertices. A tangent vector v with v⊥p points into the simplex exactly when its coefficients outside A are nonnegative: for small ε>0, the vector p+εv retains positive coefficients in A, and its normalisation has initial direction v, as (p+εv)/∣p+εv∣=p+εv+O(ε2). Removing the tangent face directions PA∩p⊥ leaves PA⊥ and the projected rays wi, proving the asserted geometric link identification. Those residual directions obtained from an ordering of A are orthogonal and span PA (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 PA⊥. 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 A and repeats this operation.

4.1step 2.1step 3.1F2F3F5F9algebra

Lipschitz estimates and the chord bound. Δ(C) is a nonempty compact convex cell and avoids 0 by step 2.1 and [F5]. The reverse norm triangle inequality makes z↦∣z∣ continuous, so [F9] gives an attained minimum m0:=min⁡z∈Δ(C)∣z∣>0, and for x,y∈Δ(C) the estimate ∣x∣x∣−y∣y∣∣≤∣x−y∣∣x∣+∣∣x∣−∣y∣∣∣x∣≤2∣x−y∣m0 holds. On Σ(C) one has ∣y∣=1 and φ(y)≥1 (because y=z/∣z∣ with z∈Δ(C) and ∣z∣≤1), so writing y/φ(y)−y′/φ(y′)=(y−y′)φ(y)+y′(φ(y′)−φ(y))φ(y)φ(y′) gives ∣ρ−1(y)−ρ−1(y′)∣≤∣y−y′∣+∥φ∥∣y−y′∣. For unit vectors ξ,η put θ:=dang(ξ,η)=arccos⁡⟨ξ,η⟩; then ∣ξ−η∣2=2−2⟨ξ,η⟩=2−2cos⁡θ=4sin⁡2(θ/2) by [F3], so the chord length is chord=2sin⁡(θ/2)≤θ=round, the last step because sin⁡u≤u for u≥0 by [F3]. For the reverse comparison note first that π>2: for 0<u≤π/2 the mean value theorem gives sin⁡u=ucos⁡ξ with ξ∈(0,u), and cos⁡ξ<cos⁡0=1 because cos⁡ is strictly decreasing on [0,π] [F3], so sin⁡u<u and 1=sin⁡(π/2)<π/2; the restriction of cos⁡ to [0,π] is strictly decreasing with cos⁡0=1 and cos⁡(π/2)=0 by [F2] and [F3], so 2/π∈(0,1) and u∗:=arccos⁡(2/π) is the unique point of [0,π] with cos⁡u∗=2/π, lying in (0,π/2); the function f(u):=sin⁡u−2u/π therefore has f′(u)=cos⁡u−2/π by [F3], positive on [0,u∗) and negative on (u∗,π/2]. The mean value theorem [F3] gives f(u)≥f(0)=0 on [0,u∗] and f(u)≥f(π/2)=0 on [u∗,π/2] (with f(π/2)=sin⁡(π/2)−1=0), that is, sin⁡u≥2u/π on [0,π/2]. Applied to u=θ/2≤π/2 this gives θ≤(π/2) 2sin⁡(θ/2)=(π/2) chord, so the chord and round distances satisfy chord≤round≤π2 chord.

4.2step 1.1step 3.2

The finite spherical complex and the descent map. By steps 1.1 and 3.2 the identifications Σ(Cτ)→Σ(Cσ) for τ⊆σ are well-defined isometries onto faces, so X=∣K∣C is a well-defined quotient of the finite disjoint union of the compact simplices Σ(Cσ) by finitely many face identifications. Let Y be the corresponding isometric polyhedral gluing with cells Δ(Cσ); the cell maps Φσ:Σ(Cσ)→Δ(Cσ), Φσ(y):=y/φσ(y), agree on identified faces, because φσ takes the value 1 on all vertices in σ and hence restricts to φτ; so the Φσ descend to a bijection Φ:X→Y.

4.3step 2.2step 3.2step 2.4

The link of a face of a finite spherical complex. Let X=∣K∣C be a finite spherical complex and let F be the face corresponding to a nonempty simplex σ. The cells of Lk⁡X(F) are the links Lk⁡Cτ(F) of the spherical simplices containing F; 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 1 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 K and are isometric by step 2.4. Hence Lk⁡X(F) is again presented as a finite spherical complex, and clauses (i)-(v) apply to it.

5.1step 3.1step 4.1F8

Bi-Lipschitz equivalence of the model and its spherical simplex. With m0=min⁡z∈Δ(C)∣z∣>0 and the operator norm ∥φ∥, steps 3.1 and 4.1 give for y=ρ(x), y′=ρ(x′) the bounds dang(y,y′)≤π2∣y−y′∣≤πm0∣x−x′∣ and ∣x−x′∣≤(1+∥φ∥)∣y−y′∣≤(1+∥φ∥)dang(y,y′), so ρ is a bi-Lipschitz equivalence between the Euclidean metric of Δ(C) and the round metric of Σ(C) with the constant L:=max⁡{π/m0, 1+∥φ∥}.

6.1step 5.1step 4.2

The radial map is bi-Lipschitz for the chain metrics. If K has no nonempty simplex then X=Y=∅ and there are no distance estimates to check. Otherwise, by step 5.1 each Φσ is bi-Lipschitz with constant Lσ=max⁡{π/m0σ,1+∥φσ∥}, and the finitely many simplices of K give finite maxima L′:=max⁡σ(1+∥φσ∥) and L′′:=max⁡σπ/m0σ. Every chain in X maps under Φ to a chain in Y whose one-step Euclidean distances are at most L′ times the angular distances of the original chain, so dY(Φx,Φx′)≤L′ dX(x,x′); likewise every chain in Y is the image of a chain in X with angular steps at most L′′ times the Euclidean steps, so dX(x,x′)≤L′′ dY(Φx,Φx′). Hence Φ is a bi-Lipschitz equivalence of the chain metrics.

7.1step 4.2step 6.1F6F7

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 Y satisfies (H1)-(H3), so [F7] supplies its metric, weak topology, properness and completeness; step 6.1 transfers these properties to the component of X. 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 d-length is at most its chain length because d≤dang 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 X and Y 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.

8.1step 2.3step 7.1F5F7F8

Minimizing geodesics (AC). Assume AC, fix x,y in one component and put R=d(x,y). AC selects, for each n≥1, a chain of length Ln<R+1/n; the infimum definition gives R≤Ln. Replace its steps by cell arcs, traversed at angular speed Ln on [0,1] (use the constant path for Ln=0). Each arc lies in its cell by the nonnegative-combination argument of step 2.3 applied to K(Cσ), and the triangle inequality gives d(γn(s),γn(t))≤Ln∣s−t∣, hence R≤ℓ(γn)≤Ln. The paths are equicontinuous and pointwise bounded in the compact proper component of step 7.1. The domain [0,1] 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 x,y. Since R≤ℓ(γn)≤Ln→R, lower semicontinuity [F7] gives ℓ(γ)≤R, while the endpoint partition gives the reverse bound. Reparametrise by arc length using [F7]. For 0≤u≤v≤R, the resulting path γˉ is 1-Lipschitz, and R=d(x,y)≤u+d(γˉ(u),γˉ(v))+R−v forces d(γˉ(u),γˉ(v))≥v−u; thus equality holds and γˉ is a minimizing geodesic. AC is used for the sequence selection and for Ascoli.

9.1step 4.3step 7.1∎

The +∞ convention. Let F be a face of a finite spherical complex X. By step 4.3 the angular link Lk⁡X(F) 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 Lk⁡X(F); the infimum dpath(x,y) is finite whenever a chain from x to y exists and is a metric on each class by step 7.1, while for x,y in different classes no chain joins them and dpath(x,y)=+∞. 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 Σ(C) with the Euclidean metric of Δ(C) through the chord metric; the constants are explicit (π/2 for round versus chord, max⁡{π/m0,1+∥φ∥} 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 Dπ-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.

Depends on

Used by

Cited to discharge well-definedness by Spherical Gram simplices and angular links of Euclidean faces.

Dependency tree · two levels

152 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