Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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 disconnected universal-Coxeter nerve and the angular truncation convention

Example

Let n≥2 and let L={x1,…,xn} be the universal-Coxeter nerve: the finite spherical complex (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii)) whose cells are n one-point spherical simplices, the nerve of the Coxeter system on n generators in which mst=∞ for all s≠t, so that no subset containing two distinct generators is spherical, and the nerve has no edge (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups; here the nerve has simplices the subsets T⊆S whose standard parabolic subgroups WT=⟨T⟩ are finite); the presentation argument is verified in step 1.1 below. Write dpath for its componentwise intrinsic path distance and dπ=min⁡{π,dpath} for its truncated angular metric (The angular path metric, the Euclidean cone and spherical joins). Then:

(i) every component of L is a single point, dpath(x,y)=+∞ for x≠y, and dπ(x,y)=π for x≠y. Thus dπ is a metric of diameter π that agrees with dpath nowhere off the diagonal; the infinite value dpath(x,y) is not an ordinary metric value (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), which is precisely why the truncation is needed.

(ii) In the cone C(L) the distance of (r,x) and (s,y) with x≠y is r+s: the formula of The angular path metric, the Euclidean cone and spherical joins(3) gives dC2=r2+s2−2rscos⁡π=(r+s)2, and the path through the apex realises it. Hence C(L) is the metric star of n rays of infinite length glued at the apex, and every path between two different rays passes through the apex.

(iii) L is vacuously Dπ-geodesic: no pair of distinct points has distance <π. Hence The cone and join metrics and the local product chart of a polyhedral gluing(2) applies and shows that C(L) is a geodesic metric space, and a geodesic joining points of two different rays is the two-segment path through the apex.

(iv) Any truncation value θ<π would be inconsistent with this star geometry: with distance r2+s2−2rscos⁡θ<r+s between the branches and every path between them passing through the apex, no geodesic would join the two branches, while with the value π the through-apex path is one. Thus dπ=π, and not dpath, is the value the cone formula must receive, and the auxiliary infinity is never passed to a metric value.

Facts & Assumptions

Given: An integer n≥2 and the finite spherical complex L={x1,…,xn} whose cells are the n one-point spherical simplices Σ(Ci) with Ci=(1), the nerve of the universal Coxeter system on n generators; in parts (ii)-(iv) also real numbers r,s>0 and distinct x,y∈L.

[F1]

For a real symmetric positive-definite matrix C with diagonal 1 and Cholesky factor L with rows ui, the positive cone is K(C)={∑iλiui:λi≥0} and the spherical simplex is Σ(C)=K(C)∩Sn; for C=(1) one has u0=1∈R1, K(C)=[0,∞) and Σ(C)={1}, a single point (Spherical Gram simplices and angular links of Euclidean faces).

[F2]

A finite spherical complex X=∣K∣C is the quotient of the disjoint union of the spherical simplices Σ(Cσ) by the vertex-wise identifications of faces, with the componentwise chain metric d; its components are the classes under the relation "joined by a chain of points in common cells" and the componentwise path distance is dpath(x,y)=+∞ between distinct components, a value that is auxiliary notation only and is truncated in the cone formulas (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), (vi)).

[F3]

The angular link carries the extension dpath, the truncated angular metric is dπ(x,y)=min⁡{π,dpath(x,y)} with the convention min⁡{π,∞}=π, the Euclidean cone is C(L)={o}⊔((0,∞)×L) with dC(o,(r,x))=r and dC((r,x),(s,y))2=r2+s2−2rscos⁡dπ(x,y), and a link is Dπ-geodesic if every pair at distance <π is joined by a minimizing segment (The angular path metric, the Euclidean cone and spherical joins(1)-(4)).

[F4]

dπ is a metric of diameter at most π and agrees with dpath on every pair at distance <π; if dπ(x,y)=π then the path through the apex has length r+s=dC((r,x),(s,y)) and is minimizing; and if L is Dπ-geodesic then C(L) is a geodesic space, every minimizing geodesic joining two of its points being contained in the closed ball of radius max⁡{r,s} about o (The cone and join metrics and the local product chart of a polyhedral gluing(1)-(2)).

[F5]

A metric on a set X is a function X×X→R satisfying separation, symmetry and the triangle inequality, so every metric value is an honest real number; along a path γ ⁣:[0,1]→X and any partition 0=t0<⋯<tm=1 the triangle inequality gives ∑id(γ(ti−1),γ(ti))≥d(γ(0),γ(1)) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F6]

A geodesic segment from x to y in a metric space is a map γ ⁣:[0,ℓ]→X with γ(0)=x, γ(ℓ)=y and d(γ(s),γ(t))=∣s−t∣ for all s,t; a metric space is geodesic when every two of its points are joined by one (Geodesics and geodesic metric spaces).

[F7]

cos⁡π=−1, and cosine is strictly decreasing on [0,π], hence injective there (Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine).

[F8]

Endowed with the subspace topology of R, the interval [0,1] is a connected subset of R; the continuous image of a connected space is connected; and a nonempty connected subset of a discrete space is a singleton, because for a≠b in a connected set A the sets {a} and A∖{a} are nonempty, disjoint and open in A (The connected subspaces of R with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in R", A continuous image of a connected space is connected, and connectedness is a topological property, Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).

[F9]

The universal Coxeter group has presentation ⟨S∣s2=1 (s∈S)⟩: its universal property sends any assignment of involutions in a group to a homomorphism from W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). Here the nerve means the complex whose simplices are the subsets T⊆S with finite WT=⟨T⟩; step 1.1 verifies that these are exactly the empty simplex and singletons. Bijections of R form the group Sym⁡(R) under composition (The symmetric group Sym⁡(X): the bijections of a set X under composition, Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements).

Verification

1.1givenF1F2F9algebra

The nerve and its path distance. Fix distinct s,t∈S. Send s to the involution a(u)=−u, t to b(u)=2−u, and every other generator to the identity in Sym⁡(R). By [F9] this extends to a homomorphism from W. The product ab is the translation u↦u−2, whose k-th power sends 0 to −2k; these images are distinct for distinct nonnegative integers k. Hence W{s,t} is infinite. Every WT with s,t∈T contains it, and is infinite; a singleton generates at most the two elements 1,s, so the nerve consists exactly of the empty simplex and the n singletons. Every cell Σ(Ci) of its spherical realization L is a point by [F1]. Any step of a chain in L therefore has equal endpoints, and no chain joins distinct points. Thus [F2] gives dpath(x,x)=0 and dpath(x,y)=+∞ for x≠y.

2.1step 1.1F2F3F4F5

The truncated metric. By [F3] and the convention min⁡{π,∞}=π, one has dπ(x,y)=min⁡{π,dpath(x,y)}=π for x≠y, while dπ(x,x)=0 by step 1.1. By [F4] the function dπ is a metric of diameter at most π, and since n≥2 there is a pair x≠y with dπ(x,y)=π, so the diameter is exactly π. Comparing values, dπ agrees with dpath exactly for x=y and nowhere off the diagonal, and by [F5] a metric takes real values while +∞ is not a real number, so dpath itself is not a metric on L and the truncation is what produces one.

3.1givenstep 2.1F3F7algebra

The cone distances. For r,s>0 the cone formula of [F3] and step 2.1 give, for x=y, dC((r,x),(s,x))2=r2+s2−2rscos⁡0=(r−s)2, so that dC=∣r−s∣, and, for x≠y, dC((r,x),(s,y))2=r2+s2−2rscos⁡π=(r+s)2 with cos⁡π=−1 by [F7], so that dC=r+s; also dC(o,(r,x))=r. Restricting to one ray, the map t↦(t,x) with 0↦o therefore satisfies dC=∣t−t′∣ on [0,∞), an isometry onto the ray Rx:={o}∪{(t,x):t>0}, and for x≠y all pairs on different rays satisfy dC=t+t′.

4.1step 3.1F5F8algebra

The rays meet only at the apex. Let x≠y, r,s>0 and let γ ⁣:[0,1]→C(L) be a path with γ(0)=(r,x) and γ(1)=(s,y). By step 3.1 the ball of radius r about (r,x) consists of the points (t,x) with ∣t−r∣<r, since a point (t,z) with z≠x has distance r+t≥r; so the open ray Rx∖{o} is open in C(L), and likewise every Rz∖{o}. These open rays are pairwise disjoint with union C(L)∖{o}, and the projection π sending Rz∖{o} to z is continuous for the discrete topology on L, its fibres being open. If γ avoided o, then π∘γ would be a continuous map [0,1]→L: by [F8] the interval [0,1] is connected, so its image is connected, and a connected subset of the discrete space L is a singleton, contradicting π(γ(0))=x≠y=π(γ(1)). Hence every path from (r,x) to (s,y) passes through the apex o.

5.1step 2.1step 3.1step 4.1F4F6

The through-apex geodesic and geodesic space. For x≠y and r,s>0, step 2.1 gives dπ(x,y)=π, so [F4] shows that the two-segment path through o has length r+s=dC((r,x),(s,y)) and is minimizing; in particular it is a geodesic segment by [F6]. For the Dπ-condition, a pair (z,w) with dπ(z,w)<π has z=w by step 2.1 and is joined by the constant segment γ ⁣:[0,0]→L with γ(0)=z, so the hypothesis of [F4] holds vacuously and C(L) is a geodesic metric space. Finally, if γ ⁣:[0,r+s]→C(L) is a geodesic from (r,x) to (s,y) with x≠y, then γ is a path, so by step 4.1 there is t0 with γ(t0)=o, and since γ is distance-preserving of length r+s=dC((r,x),(s,y)) while dC((r,x),o)=r and dC(o,(s,y))=s, one gets t0=r; the restriction of γ to [0,r) avoids o, hence lies in the single ray Rx by the argument of step 4.1, and for u∈[0,r) the distance to γ(r)=o gives γ(u)=(r−u,x); symmetrically γ(r+u′)=(u′,y) for u′∈(0,s], with γ(r)=o. So the geodesic is the two-segment path through the apex.

6.1step 4.1step 5.1F3F5F6F7algebra∎

The truncation value is forced. Let x≠y and r,s>0. The value θ=0 is excluded at once: it would give dC((r,x),(r,y))=0 for distinct points and violate separation, so let θ∈(0,π). If the cone formula received the value θ in place of π, it would assign the points (r,x) and (s,y) the distance L:=r2+s2−2rscos⁡θ, which is <r+s because cosine is strictly decreasing on [0,π] by [F7]; and the open rays would still be open for the distance function so defined, since a point of another branch is at distance at least t0sin⁡θ>0 from (t0,x) for every t0>0 (the quadratic t02+t2−2t0tcos⁡θ in t≥0 is minimised at t=t0cos⁡θ when this is nonnegative and at t=0 otherwise). Hence the argument of step 4.1 applies verbatim: a geodesic γ ⁣:[0,L′]→C(L) from (r,x) to (s,y) would be a path, hence would pass through the apex at some time t0; distance-preservation would then give t0=dC((r,x),o)=r and L′−t0=dC(o,(s,y))=s, so L′=r+s, contradicting L′=dC((r,x),(s,y))=L<r+s. Hence no geodesic joins the two branches once a value θ<π is used, whereas with the value π the through-apex path is a geodesic by step 5.1: among the values in [0,π], only π makes C(L) the metric star with its through-apex geodesics. Since a metric value must be a real number by [F5], the auxiliary value +∞ cannot be passed either; so the formula receives π, the unique θ∈[0,π] with cos⁡θ=−1 by [F7].

Remarks

  • The two conventions tested. The example separates the two degenerate values of the componentwise path distance: +∞ across components, which is never a metric value, and its truncation π, which is. The star C(L) is the simplest cone in which the truncation is visible: the two rays meet only at the apex, and the through-apex path is the only way between them.
  • Relation to the sources. The identity d((r,x),(s,y))=r+s for dπ(x,y)≥π is Bridson-Haefliger I.5.7, and the characterisation of geodesics through the cone point is I.5.10; Davis Appendix I.2 records the truncation θ=min⁡{π,d} in the cone formula. The example instantiates both on the discrete universal-Coxeter nerve, whose components are single points.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

104 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