Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 3 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Large Spherical Metric Flags and the Moussong Girth Theorem

1 · Prerequisites

2 · Summary

A finite piecewise spherical complex is large here when each simplex has Gram off-diagonal entries at most zero, equivalently when each edge has length at least π/2. It is metric flag when a pairwise adjacent vertex set spans a simplex exactly when its prescribed cosine matrix is positive definite. This metric criterion allows cliques that are not filled when their Gram matrix is singular or indefinite.

The page's authored chain connects that local matrix condition to the CAT(1) property and to the Coxeter nerve. Its proofs use compact untruncated components, confined radial insertion, and dimension induction. The page remains draft pending the build's independent review and publication controls.

Large spherical metric flags

Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links fixes the edge-length convention, the almost-negative matrix with value −1 on nonedges, the positive-definite metric-flag test, and the Schur-complement description of face links. It does not assert CAT(1) curvature.

Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres proves the CAT(0) product and CAT(1) spherical-join facts used by the local models. Face links of large metric flag complexes, and the inductive local CAT(1) criterion proves that face links remain large metric flag complexes, identifies the local spherical-cone charts, and states the curvature step conditionally on CAT(1) for all smaller-dimensional links.

The Coxeter nerve and its Moussong metric constructs the nerve from the positive-definite principal submatrices of the Coxeter cosine form. It distinguishes prescribed one-cell lengths from global chain distances and defines the finite truncated angular metric across disconnected components.

The short-loop route

For a finite large metric flag complex that is locally CAT(1) and not CAT(1), the short-loop supplier applies to its compact untruncated geodesic components and gives an attained minimum nonshrinkable circle under AC. The radial-insertion lemma reduces a minimum loop chosen to maximize vertex visits to a locally geodesic loop in the 1-skeleton with at most three vertices. Its proof establishes the CAT(1) vertex link from a small local chart, develops only the actual excursion trace, and inserts its centre by a constant-length homotopy inside that trace cone. The first-exit and tangent-direction arguments then force the loop to follow edges in Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π.

Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1) proves the short edge-loop count, the three-edge Gram determinant calculation, and the corner shortening. Together with the minimum-loop reduction, these steps prove that a finite locally CAT(1) large metric flag complex is CAT(1).

Coxeter nerve and CAT(1)

Finite large metric flag complexes are CAT(1) supplies the zero-dimensional base, the component reduction, and the dimension-induction link step. The short-loop contradiction theorem closes the induction and gives CAT(1) in every finite dimension.

The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least 2π uses the finite-type/positive-definite dictionary to identify the nerve as a large metric flag complex and then transfers CAT(1) and girth conclusions to all face links. The induction theorem yields these conclusions. Its AC assumption is explicit and propagates from finite spherical minimizing geodesics and the Bowditch short-loop argument.

The proof route does not consume Moussong's Lemma 9.11. Möller gives a counterexample to that lemma in its stated generality; the repair for the hyperbolicity criterion remains outside this page's claims. This page asserts no Coxeter-group hyperbolicity theorem.

Companion examples

The companion large-spherical-metric-flags-and-the-moussong-girth-theorem-examples gives two explicit calculations: the affine A~2 nerve and the contrast between a filled all-right triangle and a disconnected universal-Coxeter nerve. Their local matrix and metric conclusions are checked directly.

Prerequisites

The required earlier pages are cat-comparison-link-criteria-and-local-globalization, finite-coxeter-diagrams-and-complete-classification, and short-loop-polygons-and-quantitative-energy-decrease. Dependency evidence and source locators are recorded in the batch manifest and coverage file.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links

Definition

Fix the following notions; no theorem about them is asserted here beyond well-definedness.

(1) Finite spherical complexes. Let K be a finite abstract simplicial complex (An abstract simplicial complex) whose simplices σ carry positive-definite Gram matrices Cσ of diagonal 1 on their vertices, compatible on common faces, and let X=∣K∣C be the associated finite spherical complex with its chain metric d and its truncated angular metric dπ=min⁡{π,d} (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), Spherical Gram simplices and angular links of Euclidean faces, The angular path metric, the Euclidean cone and spherical joins(2)). X is large when for every simplex σ and all distinct s,t∈σ the edge length arccos⁡cst is at least π/2, equivalently every off-diagonal entry of every Cσ is at most 0. Here “large” names this edge-length condition; it does not assert the distinct unique-geodesic-below-π property called “large” for piecewise-spherical spaces in Charney–Davis §2.1.1.

(2) The associated almost-negative matrix. Let X be large. Since K is simplicial, a pair of vertices spans at most one edge. For an edge {s,t}, let cst=cts be the corresponding entry of its prescribed Gram matrix, and let ℓst:=arccos⁡(cst)∈[π/2,π) be its one-cell spherical length. Define the symmetric matrix C=C(X) on the vertex set by css=1, by the prescribed edge entry cst when {s,t} is an edge of K, and by cst=cts:=−1 when {s,t} is not an edge. Its off-diagonal entries are non-positive: this is the almost-negative matrix associated with X. The edge entry is taken from the prescribed local Gram data because a gluing's global chain metric need not restrict to a cell metric in general (Abstract isometric polyhedral gluings and the chain metric).

(3) The metric flag condition. Let X be large. A set T of vertices of K is pairwise adjacent when every two distinct members of T span an edge; in that case CT:=(cst)s,t∈T is the cosine matrix of T. We regard the empty matrix as positive definite, so the empty set passes this test. Say that X is metric flag when for every pairwise adjacent T: T is the vertex set of a simplex of K if and only if CT is positive definite (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form). The forward implication is automatic for complexes of spherical simplices, since a principal submatrix of a positive-definite Gram matrix is positive definite; the content of the condition is the converse. A large metric flag complex is a large finite spherical complex satisfying (3).

(4) Links. For a face F of X (that is, a simplex of K) the link Lk⁡X(F) is the finite spherical complex whose simplices are the links Lk⁡σ(F) of the simplices σ⊇F (Subcomplexes, closures, stars, and links in a simplicial complex), carrying the Gram matrices obtained by the iterated Schur complement of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv): its vertices are the vertices t∉F for which F∪{t} is a simplex of K, and its cells are the sets T disjoint from F with F∪T a simplex of K. Adjacency to every vertex of F alone does not suffice: the resulting clique may have a non-positive-definite cosine matrix. No assertion is made here about complexes with edges shorter than π/2; the metric flag test is used only in the large case.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres

Statement

Let (X,dX) and (Y,dY) be metric spaces (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

(i) The l2-product. Give X×Y the l2-product metric d((x,y),(x′,y′)):=(dX(x,x′)2+dY(y,y′)2)1/2 (Rn as the set of functions n→R, and d1, d2, d∞ are metrics on it, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs). If X and Y are geodesic spaces, then X×Y is geodesic: for endpoints with factor distances a and b, a geodesic is exactly a pair of factor geodesics traversed at constant proportional speeds a/a2+b2 and b/a2+b2 (with the constant path when a=b=0). If X and Y are CAT(0) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)), then X×Y is CAT(0). The same conclusions hold with either factor replaced by a Euclidean space En with its Euclidean metric.

(ii) Joins. Let L1,L2 be nonempty metric spaces of diameter at most π, carrying their truncated metrics dπ=min⁡{π,d} (The angular path metric, the Euclidean cone and spherical joins(2)). The construction and formula of The angular path metric, the Euclidean cone and spherical joins(5) — the quotient of L1×L2×[0,π/2] by the identifications at θ=0 and θ=π/2, with d(x,x′) the unique number in [0,π] satisfying cos⁡d(x,x′)=cos⁡θcos⁡θ′cos⁡dπ1(x1,x1′)+sin⁡θsin⁡θ′cos⁡dπ2(x2,x2′) — is a metric of diameter at most π on the spherical join L1∗L2, still with the conventions L∗∅=∅∗L=L. The natural radial map C(L1)×C(L2)→C(L1∗L2), sending ((r,x),(s,y)) to the apex if R=0 and otherwise to radius R=r2+s2 in the join direction (cos⁡θ)x+(sin⁡θ)y with cos⁡θ=r/R and sin⁡θ=s/R, is an isometry for the square-sum product metric of (i) (The angular path metric, the Euclidean cone and spherical joins(3)). Consequently, if L1 and L2 are CAT(1), then L1∗L2 is CAT(1). In particular, for a one-point space {p} the spherical cone {p}∗L is CAT(1) if and only if L is CAT(1).

(iii) Round spheres, balls and convex subspaces. For every k≥0 the round sphere Sk with the metric dS(x,y)=arccos⁡⟨x,y⟩ (Euclidean spheres and closed balls as subspaces of Rn, Principal inverse sine and inverse cosine, Pi is the first positive zero of sine) is CAT(1); every closed ball Bˉ(x,ρ)⊆Sk with 0<ρ<π/2 (Open ball, closed ball and sphere in a metric space) is convex and CAT(1) for the induced metric; and every nonempty convex subset Z of a CAT(1) space, with the induced metric, is CAT(1), where convex means that every pair of points of Z at distance <π is joined by a geodesic segment of the ambient space lying in Z (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(ii), (v)). Consequently, if L is CAT(1) of diameter at most π and D is a nonempty closed ball of positive radius <π/2 in some Sk, then the join D∗L is CAT(1).

Facts & Assumptions

Given: Metric spaces (X,dX), (Y,dY) and, in (ii) and (iii), nonempty metric spaces L1,L2,L of diameter at most π carrying their truncations dπ=min⁡{π,d}.

[F1]

A metric space is CAT(0) when it is geodesic and every geodesic triangle satisfies the Euclidean comparison inequality; it is CAT(1) when every pair of points at distance <π is joined by a geodesic segment and every geodesic triangle of perimeter <2π satisfies the spherical comparison inequality; the empty metric space satisfies both tests vacuously and a one-point space is CAT(0) and CAT(1). (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles)

[F2]

A continuous path has length the supremum of its polygonal sums, and a space is a length space when every pair of points is joined by paths of length arbitrarily close to their distance; geodesic segments are isometric parametrizations of intervals. (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles)

[F3]

The Euclidean plane is CAT(0); for n≥2 the round sphere Sn−1 with dS(x,y)=arccos⁡(x⋅y) is a geodesic space whose geodesic segments are the minimal great-circle arcs, pairs at distance <π have a unique such segment, and every closed ball of positive radius <π/2 is convex. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)

[F4]

A geodesic space is CAT(0) if and only if for every geodesic triangle with vertices z,x,y and every point pt of a side [x,y] at fraction t one has d(z,pt)2≤(1−t)d(z,x)2+t d(z,y)2−t(1−t)d(x,y)2. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)

[F5]

In a CAT(1) space every closed ball of positive radius <π/2 is convex, and the round circle Sℓ1 is CAT(1) if and only if ℓ≥2π. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)

[F6]

A metric space is CAT(1) exactly when its Euclidean cone is CAT(0), and the cone is formed with the truncation at π. (Berestovskii's cone criterion and the polyhedral link criterion)

[F7]

The Euclidean cone C(L) on a metric space L with truncated metric dπ is {o}⊔((0,∞)×L) with dC(o,(r,x))=r and dC((r,x),(s,y))2=r2+s2−2rscos⁡dπ(x,y), and the spherical join L1∗L2 is the quotient of L1×L2×[0,π/2] with cos⁡d(x,x′)=cos⁡θcos⁡θ′cos⁡dπ1(x1,x1′)+sin⁡θsin⁡θ′cos⁡dπ2(x2,x2′), with the conventions L∗∅=L and ∅∗∅=∅. (The angular path metric, the Euclidean cone and spherical joins)

[F8]

The cone formula defines a metric, the join formula defines a metric of diameter at most π, and the radial map ((r,x),(s,y))↦ξ(r2+s2) is an isometry C(L1)×C(L2)→C(L1∗L2) for the square-sum product metric; for round spheres Sm−1∗Sn−1≅Sm+n−1. (The cone and join metrics and the local product chart of a polyhedral gluing)

[F9]

A metric is a symmetric function vanishing exactly on the diagonal and satisfying the triangle inequality, and the Euclidean norm on Rn satisfies the triangle inequality. (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)

[F10]

In an inner product space, ∣⟨u,v⟩∣≤∣u∣∣v∣, and ∣u∣=⟨u,u⟩1/2 is a norm. (Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs, The induced length is a norm)

[F11]

For a sphere Sn−1⊂Rn the round distance is dS(x,y)=arccos⁡(x⋅y) with arccos⁡ the principal inverse cosine, and cos⁡π=−1. (Euclidean spheres and closed balls as subspaces of Rn, Principal inverse sine and inverse cosine, Pi is the first positive zero of sine)

Proof

1.1F9F10algebra

The function d((x,y),(x′,y′)):=(dX(x,x′)2+dY(y,y′)2)1/2 is a metric on X×Y: symmetry and vanishing exactly on the diagonal are immediate from [F9], and the triangle inequality is the triangle inequality of the Euclidean norm on R2 applied to the vectors (dX(x,x′),dY(y,y′)) and (dX(x′,x′′),dY(y′,y′′)) [F9, F10].

1.2F2F9F10algebra

Let γ=(γX,γY) be a rectifiable path and put A:=L(γX), B:=L(γY). For any ε>0, choose partitions whose coordinate polygonal sums exceed A−ε and B−ε, and take a common refinement. If ai,bi are the two coordinate distances on its successive subintervals, then the product polygonal sum is ∑iai2+bi2≥(∑iai)2+(∑ibi)2 by the Euclidean triangle inequality [F9, F10]. Letting ε↓0 gives L(γ)≥A2+B2. For endpoints with factor distances a,b, this is at least D:=a2+b2. If both factors are geodesic, pair constant-speed factor segments, parametrized on [0,D] at speeds a/D,b/D when D>0, give a product geodesic because their product distance between parameters s,t is ∣s−t∣; if D=0 use the constant path. Conversely, if γ:[0,D]→X×Y is a product geodesic, then L(γ)=D and this bound forces A=a and B=b. For any t∈[0,D], apply the same bound to the two restrictions [0,t] and [t,D]. Their product distances are t and D−t, so equality must hold in the coordinate-length bounds and in the Euclidean triangle inequality for the two vectors of coordinate lengths. Thus those lengths are (ta/D,tb/D) and ((D−t)a/D,(D−t)b/D); each coordinate distance equals its path length, so both coordinate paths are geodesics with constant proportional speeds. This proves the stated characterization when D>0; when D=0 both factors are constant.

1.3F7F8algebra

For a metric space L of diameter at most π, the formula of [F7] defines a metric on C(L): the case analysis of [F8] uses only that dπ is a metric of diameter at most π (the zero-radius case reduces to the triangle inequality, the case α+β≤π places three points in the plane and uses monotonicity of cos⁡ on [0,π], and the case α+β>π uses the projection estimates r−scos⁡α, t−scos⁡β and cos⁡α+cos⁡β≤0), so it applies verbatim to the spaces L1 and L2.

2.1F1F4step 1.2algebra

The product is CAT(0) if X and Y are: by 1.2 its geodesic triangles have componentwise geodesic sides, and for a triangle with vertices z,x,y and the point pt of [x,y] at fraction t the hinged criterion [F4] applied in each factor and added gives d(z,pt)2≤(1−t)d(z,x)2+t d(z,y)2−t(1−t)d(x,y)2, because squared product distances add; by [F4] the product is CAT(0).

2.2F7F8step 1.1step 1.3algebra

Let E be the cosine expression in the join formula [F7]. Its two coefficients are nonnegative and sum to cos⁡(θ−θ′)≤1, so E∈[−1,1]; the function dJ=arccos⁡E descends to the endpoint quotient and separates its classes by the equality case E=1. The unit-radius map Ψ into C(L1)×C(L2) satisfies D(Ψx,Ψy)2=2−2cos⁡dJ(x,y), where D is the product metric: this is the chord distance, not dJ. For arbitrary radii, the same expansion transports D along the radial bijection to the cone function built from dJ, so that cone function is a metric. The triangle inequality for dJ follows from the radius-1,s,1 argument in [F8], in its proof paragraph "The join is a metric space": if A=dJ(x,y), B=dJ(y,z) and A+B<π, choose s=sin⁡(A+B)/(sin⁡A+sin⁡B) when A+B>0. The intermediate planar point s(cos⁡A,sin⁡A) lies on the chord from (1,0) to (cos⁡(A+B),sin⁡(A+B)), so the cone triangle inequality gives 2sin⁡(dJ(x,z)/2)≤2sin⁡((A+B)/2) and hence dJ(x,z)≤A+B. The case A+B=0 follows from separation, and A+B≥π follows from dJ≤π. Thus the join formula defines the required angular metric.

3.1F7step 2.2algebra

The radial map in (ii) is an isometry C(L1)×C(L2)→C(L1∗L2): for general radii the expansion of 2.2 gives dC(ξ(R),ξ(R′))2=R2+R′2−2RR′cos⁡d with d the join distance, which equals the sum of the two squared cone distances, namely the square-sum product distance; the conventions L∗∅=L and ∅∗∅=∅ of [F7] cover the empty cases.

3.2F3step 1.2step 2.1algebra

A Euclidean space En is CAT(0) [F3], so replacing either factor in 2.1 by En is the special case in which that factor's hinged inequality is an equality; the componentwise description of geodesics of 1.2 and the CAT(0) conclusion of 2.1 therefore yield the clause as stated.

4.1F1F6F7step 2.1step 3.1discharge-construct

If L1 and L2 are CAT(1) then L1∗L2 is CAT(1): by [F6] the cones C(L1),C(L2) are CAT(0), by 2.1 their l2-product is CAT(0), by 3.1 it is isometric to C(L1∗L2), and by [F6] again the join is CAT(1); if one factor is empty the join is the other factor [F7], which is CAT(1), and a point is CAT(1) [F1].

5.1F6step 1.2step 2.1step 4.1suffices

For a one-point space {p} the spherical cone {p}∗L is CAT(1) exactly when L is: if L is CAT(1) then {p}∗L is CAT(1) by 4.1; conversely if {p}∗L is CAT(1) then C({p}∗L) is CAT(0) [F6] and is isometric to C({p})×C(L) by the radial map of (ii), and C(L) is CAT(0) because a geodesic of this product joining two points of a slice {0}×C(L) has constant first coordinate by 1.2, so triangles in the slice lift to the product with their side lengths unchanged and the product comparison inequality of 2.1 restricts to the CAT(0) inequality of C(L); hence L is CAT(1) [F6].

5.2F3F5F8F11step 4.1inductiondischarge-induction

The round sphere Sk is CAT(1): S0 is a two-point space at distance π [F11], in which every triangle with two distinct vertices has a side of length π and hence perimeter at least 2π, so all admissible tests are degenerate; S1=S0∗S0 of circumference 2π is CAT(1) [F5, F8]; and Sk=Sk−1∗S0 for k≥1 [F8], so induction on k with 4.1 gives the claim. Every closed ball Bˉ(x,ρ)⊆Sk with 0<ρ<π/2 is convex (by [F3] for k≥1, and because it is a singleton for k=0) and hence CAT(1) for the induced metric: a triangle of perimeter <2π in a convex subset has its sides, which are ambient geodesic segments of length <π, contained in the subset, and its comparisons hold in the ambient CAT(1) space.

6.1F7step 4.1step 5.2algebra∎

If L is CAT(1) of diameter at most π and D is a nonempty closed ball of positive radius <π/2 in some Sk, then D∗L is CAT(1): D is nonempty, has diameter <π and is CAT(1) with the induced metric by 5.2, so the join step 4.1 applies to the pair (D,L).

Remarks

  • Supplier decision recheck: proof steps 4.1 and 5.1 use both directions of Berestovskii's equivalence from Berestovskii's cone criterion and the polyhedral link criterion(i): step 4.1 transfers CAT(1) of the factors to CAT(0) of their cones and back to the join; step 5.1 uses the converse for the one-point join. The current supplier text contains explicit large-perimeter and antipodal comparison arguments in its proof steps 3.1 and 4.1, which were rechecked against Bridson–Haefliger II.3.14, printed pp. 189–190; the current part-(i) claim and these two uses agree. Its only item receipt has an older hash and remains escalated in the supplier's pair, so this batch records the current clause-(i) dependency as verified for these exact uses and reports the stale supplier decision for owner reconciliation.
DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The Coxeter nerve and its Moussong metric

Definition

Let (W,S) be a Coxeter system of finite rank, so S is finite, with Coxeter matrix m (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). Let V=RS carry the canonical bilinear form B with B(es,es)=1 and B(es,et)=−cos⁡(π/mst) for finite mst, and B(es,et)=−1 when mst=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps). For T⊆S, set CT=(B(es,et))s,t∈T; whenever T⊆T′, CT is a principal submatrix of CT′.

(1) Spherical subsets. A subset T⊆S is spherical when its standard parabolic subgroup WT=⟨s:s∈T⟩ is finite (Coxeter diagrams: edges, labels, components and finite type). The standard parabolic presentation theorem (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification(2)) says (WT,T) is a Coxeter system with restricted Coxeter matrix m∣T×T. Applying the finite-type criterion to this Coxeter system gives T is spherical⟺CT is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1), Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form). The empty subset is spherical: W∅={1} and the empty matrix is positive definite vacuously. Spherical subsets are downward closed, since WT≤WT′ whenever T⊆T′.

(2) The Coxeter nerve and its metric. Let K be the simplicial complex on vertex set S whose nonempty simplices are the spherical subsets. The Coxeter nerve L(W,S)=∣K∣C is obtained by assigning to each nonempty spherical T the spherical simplex Σ(CT) (Spherical Gram simplices and angular links of Euclidean faces) and gluing its faces by the vertex-preserving isometries associated to the principal submatrices CT′ for T′⊂T (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(i)). Thus ∅ is the empty face, not a cell, and every singleton is a point cell. For distinct s,t∈S, {s,t} spans an edge exactly when mst<∞; its prescribed one-cell length is ℓst=arccos⁡ ⁣(−cos⁡(π/mst))=π−π/mst∈[π/2,π). The one-cell length is determined by the spherical Gram data; it is not asserted to equal the global chain distance between the vertices, since a chain may leave that cell and return (Abstract isometric polyhedral gluings and the chain metric).

On each connected component of L, let dL be the chain distance: the infimum of the sums of the round angular distances of successive points that lie in common cells. Set dL(x,y)=+∞ for points in different components as auxiliary extended-distance notation. Define dπ(x,y):=min⁡{π,dL(x,y)},min⁡{π,+∞}:=π. Then dπ is the finite-valued angular metric on the nerve, called here the Moussong metric on the nerve. This is the piecewise-spherical link metric induced by the cosine data; the corresponding piecewise-Euclidean Moussong metric on the Davis complex has the nerve as a vertex link (Davis, §12.1; Moeller, §2).

(3) Well-definedness and scope. The cells of L(W,S) are exactly the nonempty subsets T for which CT is positive definite, by (1). Principal-submatrix restriction makes the face gluings compatible, and the iterated Schur complement computes the Gram matrices of the face links (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv)). If T is spherical, then every off-diagonal entry of CT lies in [−1,0], so every edge cell has length at least π/2; therefore L(W,S) is a finite large spherical complex (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(1)). This definition does not assert that the nerve is metric flag or CAT(1); those properties are proved by The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least 2π.

Facts & Assumptions

Given: The finite-rank Coxeter system (W,S), the Coxeter form B, and the matrices CT above.

[F1]

For every T⊆S, the canonical map from the group presented by the restricted matrix m∣T to WT is an isomorphism; thus (WT,T) is a Coxeter system (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification(2)).

[F2]

For a finite-rank Coxeter system with canonical Coxeter form, the group is finite if and only if its form is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1)).

[F3]

The Coxeter form has diagonal entries 1, off-diagonal entries −cos⁡(π/mst) for finite mst, and entry −1 for mst=∞ (The real Coxeter form, its radical, reflections, and form-preserving maps).

[F4]

A positive-definite diagonal-one matrix defines a spherical Gram simplex unique up to vertex-preserving isometry; the face indexed by a subset of vertices has the corresponding principal submatrix as its Gram matrix (Spherical Gram simplices and angular links of Euclidean faces, Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(i)).

[F5]

Face-link Gram matrices are computed by iterated Schur complements and are compatible with further face links (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv)).

[F6]

Each positive-definite Gram simplex has a face-compatible radial normalization to a compact Euclidean convex cell that is bi-Lipschitz for the round and Euclidean cell metrics (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(ii)). Since there are finitely many cells, the cellwise maps have a common finite bi-Lipschitz bound; applying it to chains and taking infima compares the two chain distances in both directions. On each connected finite Euclidean polyhedral gluing the chain distance is a 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(1)). The componentwise extended-distance and truncation conventions are those of The angular path metric, the Euclidean cone and spherical joins(1)–(2).

[F7]

The cosine is strictly decreasing on [0,π], with range [−1,1], and cos⁡(π−θ)=−cos⁡θ (Principal inverse sine and inverse cosine, The addition formulas for sine and cosine, Quarter-turn values and shifts by pi/2 and pi).

[F8]

A symmetric form is positive definite when its quadratic form is positive on every nonzero vector; this condition is vacuous for the zero-dimensional space and its empty matrix (Positive and negative definiteness, the inertia (p,q,r), rank p+q, and signature p−q of a real symmetric bilinear or quadratic form).

[F9]

A metric is a real-valued function satisfying separation, symmetry and the triangle inequality (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

Proof

1.1F1F2F3F8algebra

Spherical subsets and cells. Fix T⊆S. By [F1], the restricted matrix presents the Coxeter system (WT,T), and its canonical Coxeter form has matrix exactly CT by [F3]. Applying [F2] to this restricted system proves WT finite if and only if CT is positive definite. For T=∅, WT={1} and positive definiteness of the empty matrix is vacuous by [F8]. If T⊆T′ and T′ is spherical, then WT≤WT′ is finite; the principal submatrix CT is also positive definite because it is the restriction of the positive quadratic form of CT′. Thus the nonempty spherical subsets form a finite simplicial complex, and they are exactly the nonempty positive-definite principal submatrices.

1.2F1F2F3F4F7F8algebra

Edges and their prescribed lengths. For distinct s,t, [F1] and [F2] show that {s,t} is spherical exactly when its two-by-two Coxeter Gram matrix is positive definite. If mst<∞, put θ:=π/mst and c:=cos⁡θ. Since mst≥2, 0<θ≤π/2, so 0≤c<1 by [F7]; for (x,y)≠(0,0), x2−2cxy+y2=(x−cy)2+(1−c2)y2>0, so the matrix is positive definite by [F8]. If mst=∞, then C{s,t}=(1−1−11) and its quadratic form (x−y)2 vanishes at (1,1), so it is not positive definite by [F8] and there is no edge. In the finite case the two unit vertices have inner product −cos⁡θ=cos⁡(π−θ) by [F7]; since π−θ∈[π/2,π), their angular separation within that edge cell is arccos⁡(−cos⁡θ)=π−θ=π−π/mst. This computes the local edge length; it makes no claim that the global chain distance cannot be shorter.

2.1F4step 1.1

Face gluing. For every nonempty spherical T, [F4] realizes CT as a spherical simplex. If T′⊂T, its principal submatrix is the Gram matrix of the face spanned by the vertices indexed by T′, so the vertex-preserving face isometry agrees with the one obtained from any larger spherical simplex containing T. Hence these finitely many cells glue consistently along precisely their common faces. Singletons give point cells; the empty subset contributes only the empty face.

3.1F1F2F3F4F5F6F7F9step 1.2step 2.1algebra∎

The componentwise and truncated metrics. There are finitely many cells because S is finite. On each connected component the radial maps in [F6] are compatible on faces by [F4] and have a common finite bi-Lipschitz bound K, the maximum of the finitely many cell bounds. For any chain in the spherical cells, the length of its Euclidean image is at most K times its spherical length; applying the inverse cell maps gives the reverse bound. Taking infima over chains proves that the two component chain distances are bi-Lipschitz equivalent. The Euclidean chain distance is a metric by [F6], since each radial image component is connected, finite, locally finite and has only finitely many cell shapes; therefore dL is a metric on each component. Across components the chain set is empty, and the value +∞ is only auxiliary notation. Truncating a component metric at π preserves the triangle inequality, while assigning distance π between distinct components also satisfies it: if the endpoints are in different components, at least one leg of any two-leg route crosses components; if they are in the same component but the middle point is elsewhere, both legs equal π. The truncated distance separates distinct points and is finite, hence is a metric by [F9]. If s,t lie in a spherical T, then W{s,t}≤WT is finite; applying [F1] and [F2] to the pair shows C{s,t} is positive definite, which by step 1.2 forces mst<∞. Hence B(es,et)=−cos⁡(π/mst)∈[−1,0] by [F3] and [F7]. Thus each spherical cell has nonpositive off-diagonal Gram entries, every edge length is at least π/2, and the finite complex is large. Iterated face links have the Schur-complement Gram data by [F5].

Remarks

  • Choice. No use of AC is made here. The radial simplex comparisons in the spherical Gram supplier's clause (ii) are choice-free; its separate AC-dependent minimizing-geodesic conclusion in clause (iii) is not used.
  • Nerve and metric terminology. Davis defines the nerve combinatorially by spherical subsets (§7.1) and identifies its natural piecewise-spherical metric as the link metric in the Davis complex (§12.1). Möller calls the corresponding metric on the full Davis complex the Moussong metric; this item names its induced truncated angular metric on the nerve.
  • Edge length versus chain distance. ℓst is the distance inside the prescribed spherical edge cell. A gluing's global chain distance need not restrict to each cell's metric, so the statement deliberately does not identify ℓst with dL(s,t).
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π

Statement

Assume AC (The Axiom of Choice). Let X be a finite large metric flag complex, locally CAT(1) and not CAT(1). Its angular metric is dπ=min⁡{π,dY} on a connected component Y, where dY is the untruncated intrinsic spherical length metric; distinct components have distance π. The compact-geodesic short-loop results are applied to (Y,dY), which is compact and geodesic by Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii). Truncation preserves curve lengths, local geodesic germs, short-loop homotopies, short comparison triangles and isometrically embedded circles of length <2π.

Let m be the infimum of the lengths of isometrically embedded circles in X. Then m<2π is attained by a shortest nonshrinkable loop γ, an isometrically embedded circle, and every short loop of length <m is shrinkable (Polygon transfer, the basin as the shrinkable class, and the short-loop criterion(iii), Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle(ii)). Moreover:

(i) Local geodesicity. Every length-m minimum nonshrinkable loop is a local geodesic and an isometrically embedded circle.

(ii) Radius-π/2 vertex cones. For a vertex v, B(v,π/2) is exactly the open radial cap of its star, with pole distance equal to radial coordinate (Face links of large metric flag complexes, and the inductive local CAT(1) criterion(ii)). A path of length <π/2 from v cannot leave its star. In a simplex, use normalized ray coordinates x=(∑iλiui)/N, where λi≥0, ∑iλi=1 and N=∥∑iλiui∥>0. On an opposite face, ⟨v,x⟩=∑i≠vλicvi/N≤0. Thus distinct vertices have distance at least π/2, and no other vertex lies in B(v,π/2). The identity 1=∑iλi⟨x,ui⟩/N shows that the open vertex balls cover X. The radial cap is locally isometric to X at its interior points; an inherited-distance isometry of the entire radius-π/2 ball is not asserted.

(iii) Genuine excursions. The loop cannot lie in one open vertex cap. Every component of its intersection with that cap closes to an arc of length π, with equatorial endpoints and positive-length complement. Hence π<m<2π. In a component attaining m, the untruncated injectivity radius is r=m/2>π/2; every local geodesic arc of length at most r minimizes, and geodesics at distance <r are unique. The minimum of these component injectivity radii is r.

(iv) Confined insertion and the 1-skeleton. There is at most one excursion at each vertex. If its centre is unvisited, the actual angular trace is an isometric link arc of length π; inside the point-join on that arc, rotating the semicircle toward the pole gives a short-loop homotopy of constant length m which inserts that vertex and preserves all old vertex visits. Every resulting length-m loop remains a nonshrinkable isometric circle. A minimum loop chosen to maximize distinct visited vertices therefore visits every centre whose open cap it meets, and visits at most three vertices. Starting at a visited vertex, its actual outgoing ray must follow an edge; continuing around the loop gives a locally geodesic edge loop in the 1-skeleton with at most three distinct vertices.

Facts & Assumptions

Given: AC; a finite large metric flag complex X, locally CAT(1) for its angular truncation and not CAT(1); let m be the infimum of its isometrically embedded-circle lengths. Write dY for the untruncated intrinsic length metric of a connected component Y, and dπ=min⁡{π,dY}.

[F1]

Largeness means all off-diagonal simplex Gram entries are nonpositive, while every simplex Gram matrix is positive definite. Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links

[F2]

Simplex vertex vectors are linearly independent, ray coordinates are x=(∑λiui)/N with λi≥0, ∑λi=1, and N=∥∑λiui∥>0. Vertex links are finite spherical complexes by the projected Gram formula. Under AC each finite spherical component is compact and geodesic for its untruncated intrinsic metric. Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas

[F3]

Short-loop homotopy uses normalized loops and uniform-plus-length continuity. Under AC, in a compact geodesic locally CAT(1) space every short loop below its first isometrically embedded-circle length is shrinkable; that length is attained if below 2π and equals the minimum nonshrinkable length. Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability, Polygon transfer, the basin as the shrinkable class, and the short-loop criterion

[F4]

The compact criterion applies under AC to compact geodesic locally CAT(1) spaces: failure supplies a circle of length twice the injectivity radius, and uniqueness below R≤π gives all-pair comparison for triangles of perimeter below 2R. Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle

[F5]

The spherical cosine rule and midpoint cosine identity hold; a unit-speed local geodesic in a CAT(1) space of length at most π minimizes; nonconstant closed local geodesics have length at least 2π. Squared vertex-to-side comparison characterizes CAT(0). Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences, Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π

[F6]

Point links have the decomposition Sk−1∗Lk⁡(F) at relative-interior points of a k-face. Small spherical neighborhoods have the corresponding polar chart. At a large vertex, the open radius-π/2 ball is the open radial cap as a set, with pole distance equal to radial coordinate; a global inherited-distance isometry of this whole ball is not assumed. Face links of large metric flag complexes, and the inductive local CAT(1) criterion

[F7]

The join metric satisfies cos⁡d=cos⁡θcos⁡θ′+sin⁡θsin⁡θ′cos⁡α, with α the truncated link distance. A one-point join is CAT(1) when its link is CAT(1). The Euclidean cone is CAT(0) exactly when its truncated link is CAT(1); cone sector paths give geodesics when the link has short geodesics. Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres, Berestovskii's cone criterion and the polyhedral link criterion, The cone and join metrics and the local product chart of a polyhedral gluing

[F9]

Absolute convergence of the sine and cosine power series gives sin⁡u=u+O(u3) and cos⁡u=1−u2/2+O(u4) uniformly on bounded scaled arguments. Sine and cosine defined by their real power series, The sine and cosine power series converge absolutely for every real argument

[F10]

Distances obey the triangle inequality; curve lengths are suprema of partition sums, additive under subdivision and invariant under arclength normalization. Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Length in a metric target: lower semicontinuity and arc-length reparametrization

Proof

1.1F1F2F6F10algebra

Vertex geometry with correct ray coordinates. In a simplex containing v, an opposite-face point has x=(∑i≠vλiui)/N, so ⟨v,x⟩=(∑i≠vλicvi)/N≤0. Its cellwise radius from v is at least π/2. This radial function agrees on common faces and is 1-Lipschitz on each incident cell, so a path leaving the star first spends at least π/2. Inside the star a path to a radial point spends at least its radial change; thus pole distance is the cellwise radius whenever that radius is below π/2. Distinct vertices have distance at least π/2. Conversely 1=⟨x,x⟩=(∑iλi⟨x,ui⟩)/N gives a positive pairing with some support vertex, so the open vertex balls cover X.

1.2F2F3F4F5F10construct

Use the compact criterion on untruncated components. Curve lengths are unchanged by truncation: refine partitions until adjacent points have distance below π, when both metrics agree. Their local geodesic germs and uniform-plus-length convergence are also unchanged. A short triangle lies in one component, all its sides are below π, and any two side points have intrinsic distance at most half its perimeter, below π; hence its CAT(1) test is unchanged. An isometrically embedded circle of length below 2π has all its circle distances below π, so it is isometrically embedded for one metric exactly when it is for the other. Therefore failure of CAT(1) occurs in some compact geodesic untruncated component. Apply [F3] and [F4] to these components; there are finitely many, and their isometrically embedded short-circle minima attain a global minimum m<2π. Short-loop homotopies stay in a component, so m is also the minimum nonshrinkable length for X, and it is attained by an isometrically embedded circle. In a component attaining it, the circle gives failure of short uniqueness above m/2, whereas [F4] supplies a circle of length twice the injectivity radius. Thus this radius is r=m/2. Any component containing a nonshrinkable loop of length m also has this same minimum and radius.

2.1step 1.1F2F6F7F8F10construct

The actual cap and its small metric chart. Let L=Lk⁡(v) with its truncated intrinsic metric and let J={v}∗L. Its cellwise radial map Φ:J→X is defined through radius π/2, because every opposite face is at least that far along its ray. The maps agree on faces and are injective: if two incident-cell representatives have the same image, their common support together with v is a common face, where the radial representation is unique. Thus the compact cap maps homeomorphically to its image. It does not increase distances: approximate cap paths by cell chains and map each chain to the same spherical cells of X. For endpoints of radius at most e<π/4, a path leaving the star or reaching radius π/2 costs at least π−2e>2e, whereas the path through the pole costs at most 2e. Consequently sufficiently small cap distances agree with the ambient metric. At an interior cap point the minimal support contains v, so all incident cells contain v; the same finite-cell exit argument gives local isometry there. No metric isometry of the entire radius-π/2 cap into X is asserted.

2.2step 1.2F3F4F5F10construct

All length-m minimum loops are isometric circles. A minimum nonshrinkable loop must be locally geodesic. Otherwise choose a small arc in a CAT(1) chart with a strictly shorter endpoint chord. Replacing the suffix from a variable point of that arc by the unique chord to its terminal endpoint gives arc length at most the original arc length; short-chord endpoint continuity and the variable prefix/chord lengths give uniform-plus-length continuity after normalization. This produces a short-loop homotopy to a loop shorter than m, a contradiction. Now a unit local geodesic arc of length T<r in its component minimizes. Indeed take the maximal minimizing prefix of length t>0. If t<T, append a sufficiently small locally minimizing piece of length δ, with t+δ<r. The endpoint triangle has perimeter at most 2(t+δ)<2r, so [F4] gives CAT(1) comparison. Equal tiny sidepieces of length h about their common point have actual cross-distance 2h; comparison and the model triangle inequality give 2h≤dmodel≤2h, forcing model angle π by the cosine rule. The opposite side consequently has length t+δ, contradicting maximality. Continuity extends minimization to length r. Applying this to each shorter arc of a length-m minimum local loop gives the circle distance formula, so it is isometrically embedded.

3.1step 2.1F2F5F7F8F9F10algebrachoose

A local spherical-to-tangent argument. The empty link is immediate. Otherwise consider the Euclidean cone C(L), which is geodesic because its finite link has minimizing short paths by [F2]. Its radius-M closed ball is compact: it is the continuous image of [0,M]×L with radius zero collapsed. Fix cone points a=(r,u) and b=(s,w), and send a bounded cone point (q,z) to cap radius εq with direction z. For sufficiently small ε these points lie in the CAT(1) neighborhood of v and the small isometry of step 2.1. The exact distance formula and [F9] give cos⁡dε(a,b)=cos⁡(εr)cos⁡(εs)+sin⁡(εr)sin⁡(εs)cos⁡dπ(u,w), hence dε(a,b)2/ε2=dC(a,b)2+O(ε2) uniformly on bounded radii; the bound dε≤ε(r+s) justifies expanding its left side as well. Let mε be the unique small spherical midpoint of the two images. Its radius is at most εr+dε(a,b)/2, so the corresponding cone points lie in one bounded compact ball. Along εn↓0 choose one convergent subsequence, depending only on a,b, with cone limit m0. The midpoint distances show dC(a,m0)=dC(b,m0)=dC(a,b)/2. For any fixed cone test point z, the small triangle is admissible for all sufficiently large n, and its CAT(1) midpoint inequality is cos⁡dε(z,mε)≥[cos⁡dε(z,a)+cos⁡dε(z,b)]/[2cos⁡(dε(a,b)/2)]. Expanding on this same subsequence gives dC(z,m0)2≤12(dC(z,a)2+dC(z,b)2)−14dC(a,b)2. The subsequence was fixed before z was introduced, so one midpoint satisfies this inequality for every z.

4.1step 3.1F5F7F10algebra

Global CAT(1) of the link, without the girth conclusion. Plug any other midpoint of a,b into the last inequality as the test point; the right side is zero, so the midpoint is unique. All cone geodesics are therefore unique by dyadic subdivision and continuity. Iterating the midpoint inequality along the geodesic ct from a to b gives, first for dyadic t and then all t, dC(z,ct)2≤(1−t)dC(z,a)2+t dC(z,b)2−t(1−t)dC(a,b)2. By [F5] this is CAT(0), and [F7] gives CAT(1) of the truncated link L. Thus J is CAT(1). This inference used local CAT(1) of X, not a lower-dimensional girth assertion.

5.1step 2.1step 4.1F3F7F8F9F10algebra

Controlled radial contraction. On a compact radius-R<π/2 subset of J, radial contraction sends θ to tθ. From [F7], cos⁡dt=cos⁡(t(θ−θ′))−(1−cos⁡α)sin⁡(tθ)sin⁡(tθ′)≥cos⁡d1 for 0≤t≤1. It is therefore distance- and length-nonincreasing. The identity sin⁡2(dt/2)=sin⁡2(t(θ−θ′)/2)+sin⁡(tθ)sin⁡(tθ′)sin⁡2(α/2) also proves the required length continuity. For a fixed t0>0, the ratios sin⁡(tu)/sin⁡(t0u) extend at u=0 by t/t0 and tend uniformly to one on the bounded radius ranges; the same holds for the distance ratios, using the continuous function arcsin⁡x/x on the relevant compact interval with value one at zero. Thus the distance distortions between nearby radial parameters tend uniformly to one. At zero the same identity gives a bound dt≤CRt d1. These inequalities control lengths and all partial lengths, giving continuous arclength normalization at positive parameters; at zero both images and lengths converge to the pole. The local isometry of step 2.1 preserves the lengths of these curves, all of which remain in the open cap. Composing with Φ therefore gives a short-loop contraction whenever a short loop lies in this open cap.

6.1step 2.1step 4.1step 1.2step 2.2step 5.1F5F7F10algebra

The excursion is genuinely a cap geodesic of length π. Let γ be a length-m minimum loop, parametrized by arclength. It cannot lie entirely in an open vertex cap, by step 5.1 (also by the closed-local-geodesic obstruction in the CAT(1) cap). A component of its open-cap intersection lifts to a local geodesic in J by the local isometry of step 2.1, with continuous equatorial endpoints. If its length exceeded π, an interior subarc of length π would minimize in J by [F5], although its endpoint radii sum to less than π, a contradiction. If its length were below π, closure of its interior subsegments would be the unique cap geodesic between its equatorial endpoints. Their link distance is below π, so that geodesic lies in the equator, contradicting the open-cap interior. Thus its length is π; interior subsegments and continuity give cap endpoint distance π. The complement cannot consist of one point, since the two cap endpoints would then coincide. Consequently m>π. Every vertex has at most one excursion, since two would spend 2π>m.

7.1step 4.1step 6.1F5F7construct

Wrap only the actual angular trace. If the centre vertex is not visited, the excursion avoids the pole. On each sufficiently short subarc, the nearby link directions have distance below π and a unique link geodesic; its point-join sector contains the model short cap geodesic. CAT(1) uniqueness in J forces the excursion to be this actual sector path. Its angular projection is therefore locally geodesic in L and monotone along that link arc. A radial local piece would propagate radially and could not make an equator-to-equator excursion without hitting the pole, so the nonpole excursion has nonzero angular motion. Parametrize its angular trace by accumulated angular length s and wrap the local sectors using the real coordinates (cos⁡θ,sin⁡θcos⁡s,sin⁡θsin⁡s) in a two-sphere. Overlapping short sectors give one locally geodesic spherical curve, hence one great semicircle; its positive pole coordinate and equatorial endpoints show that s increases by exactly π. The actual link trace is consequently a local geodesic of length π, and [F5], including the endpoint limit, makes it an isometric link arc λ:[0,π]→L. This argument develops the cone on that trace, rather than all cells of the singular star in one ambient sphere.

8.1step 1.1step 2.1step 2.2step 7.1F3F5F7construct

A confined constant-length insertion. The subcone {v}∗λ([0,π]) is isometric, by the join formula, to a spherical quarter-hemisphere. Let A,E,V be its orthonormal model vectors for the first equatorial endpoint, angular midpoint, and pole. The nonpole excursion is hβ(t)=cos⁡t A+sin⁡t(cos⁡β E+sin⁡β V), 0≤t≤π, for some 0<β<π/2. Increase β to π/2. Every intermediate semicircle remains in this same subcone, has endpoints A,−A and length π, and its interior lies in the open cap. Map it by Φ and keep the complementary loop arc fixed. This is a continuous family of normalized loops of constant length m<2π, ending at a loop through v. No other vertex lies in the open cap, so every old vertex visit is preserved and v is added. Every loop remains nonshrinkable by this explicit short homotopy; step 2.2 makes each length-m result an isometrically embedded minimum circle. Thus insertion does not assume preservation of an embedding or lift an arbitrary ambient rotation.

9.1step 1.1step 1.2step 2.2step 8.1F2F10choose

Maximal visits. Choose a length-m minimum circle with the largest number of distinct visited vertices. There are at most three: four distinct cyclic visits would spend at least 4(π/2)=2π by step 1.1. If a vertex cap meets this circle and its centre is not visited, step 8.1 increases the number of visits, a contradiction. The covering property of step 1.1 therefore supplies an actual visited vertex, and every met cap has its centre among the visited vertices.

10.1step 1.1step 1.2step 2.2step 6.1step 9.1F1F2F5F6F7F10algebra

A genuine departure from a visited vertex. Start the circle at an actual visited vertex v and take its outgoing direction. Let σ be the minimal supporting simplex of that direction. The initial local ray is its actual spherical radial geodesic, not a continuation invented from some later interior subarc. If dim⁡σ≥2, write its unit direction as η=∑i≠vbi(ui−cviv) with all bi>0. The ray is x(t)=[cos⁡t−sin⁡t∑i≠vbicvi]v+sin⁡t∑i≠vbiui. All non-v coefficients stay positive until the v coefficient first vanishes at a time T∈[π/2,π). It really is the loop's ray up to that exit: at a relative-interior point of σ, an incoming tangent direction and an outgoing direction with nonzero normal component have point-link distance below π by the join formula, contradicting local geodesicity; the only permissible tangent continuation is the same straight spherical direction. Since T<π<m, the loop reaches its opposite-face exit. At that exit, the positivity identity from step 1.1 supplies another support vertex w with positive pairing. Hence choose a point p just before the exit, in relint⁡σ∩B(w,π/2). Its centre w is visited by step 9.1. The unique w-excursion passes through w and consists of two radial legs, since cap geodesics from the pole are radial; thus the loop's subarc from p to w has length below π/2<r. It is the unique ambient minimizing segment by step 2.2. The radial segment in σ has the same length and minimizes by the first-exit estimate of step 1.1, so these segments agree. At the relative-interior point p, its tangent is both the actual ray from v and the radial ray to w, forcing p∈span⁡{v,w} in this cell. This contradicts its other strictly positive independent support coefficients. Therefore no outgoing direction from a visited vertex has support dimension at least two.

11.1step 1.2step 2.2step 9.1step 10.1F2F3F6F7∎

The edge-loop reduction. Every outgoing direction from a visited vertex is therefore an edge direction. At an interior point of an edge, the point-link decomposition S0∗Lk⁡(edge) gives the same tangent-normal shortcut: a locally geodesic continuation remains the forward edge direction until the next vertex. Starting at the visited vertex and following the closed circle thus traces a locally geodesic edge loop. It has at most three distinct vertices by step 9.1. All arguments used the untruncated component where the loop lies; truncation preserves its short lengths, local geodesic germs, isometric circle, and short-loop homotopy. This proves the full minimum-loop and radial-vertex reduction with explicit AC and without a global star development, unconfined rotation, or circular girth hypothesis.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a finite large metric flag complex which is locally CAT(1).

(i) A nonshrinkable locally geodesic edge loop of X of length <2π has exactly three edges. A closed edge walk with one or two edges is an immediate backtrack — the 1-skeleton is a simple graph, since the complex is simplicial (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(2)) — hence short-loop homotopic to a point; and every edge has length ≥π/2, so a closed edge walk with four or more edges has length ≥4⋅π/2=2π.

(ii) Let v1,v2,v3 be the vertices of such a three-edge loop, and let a,b,c be the assigned spherical lengths of its edges v1v2,v2v3,v3v1. Thus a,b,c∈[π/2,π) and a+b+c<2π. Its cosine matrix C=(1cos⁡acos⁡ccos⁡a1cos⁡bcos⁡ccos⁡b1) is positive definite: with s=(a+b+c)/2, the identity det⁡C=4sin⁡ssin⁡(s−a)sin⁡(s−b)sin⁡(s−c) makes its determinant positive, and the leading principal minors are positive (Sylvester's criterion: a real symmetric n×n matrix with n≥1 is positive definite if and only if all leading principal minors are positive). For an isometrically embedded minimum circle these edge lengths also equal the ambient vertex distances, since each edge is shorter than the sum of the other two.

(iii) By the metric flag condition the three vertices span a simplex σ of X, a spherical triangle with sides a,b,c (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(i)); the loop is the boundary of σ. Since the three vertices are linearly independent, every interior angle of σ lies in (0,π); at a corner take the two points at distance t>0 on the two incident edges: the segment of the round sphere joining them lies in the wedge spanned by the two edge directions and hence in σ, and the spherical cosine rule gives d=arccos⁡(cos⁡2t+sin⁡2tcos⁡α)<2t, where α∈(0,π) is the interior angle. So the loop admits a strict shortening of arbitrarily small scale near each corner and is not locally geodesic, contradicting (Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π(i)).

(iv) Hence X has no minimum nonshrinkable circle: by Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π(iv) some shortest nonshrinkable loop is a locally geodesic edge loop visiting at most three vertices; (i) leaves the three-edge case, which (ii)-(iii) exclude, and fewer than three edges gives a backtrack. Therefore X is CAT(1): if it were not, a minimum nonshrinkable circle would exist (Polygon transfer, the basin as the shrinkable class, and the short-loop criterion(iii), (iv)), and its non-existence is equivalent to the absence of isometrically embedded circles of length <2π, which for each compact geodesic untruncated component is equivalent to CAT(1) (Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle(i)). Disconnected X is treated component by component with the truncated inter-component convention of The angular path metric, the Euclidean cone and spherical joins(2).

Facts & Assumptions

Given: AC and a finite large metric flag complex X that is locally CAT(1), with vertex complex K, and a nonshrinkable locally geodesic edge loop γ of length <2π.

[F1]

Distinct vertices of a simplicial complex span at most one simplex, so each pair spans at most one edge and there are no loop edges; X is large, so every edge of every simplex has length in [π/2,π). (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)

[F2]

A positive-definite Gram matrix realizes its spherical simplex; its points have unique nonnegative barycentric ray coordinates and lie in an open hemisphere. For a finite spherical complex, assume AC, the chain metric makes each component compact and geodesic. The spherical cosine rule holds in the round sphere. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(i)-(iii), Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(iii), The Axiom of Choice)

[F3]

A loop is normalized and short when its length is <2π; short-loop homotopy is homotopy through short loops with continuous uniform-plus-length parameter, and shrinkable means short-loop homotopic to a constant loop. (Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability)

[F4]

Under AC, for a compact geodesic locally CAT(1) component with its untruncated intrinsic metric, CAT(1) is equivalent to the absence of isometrically embedded circles of length <2π, and if X is not CAT(1), it contains an isometrically embedded circle of length 2injrad⁡(X)<2π; every loop of length below the infimum m of the lengths of isometrically embedded circles is shrinkable, and if m<2π then m is attained by a nonshrinkable isometrically embedded circle. (Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle, Polygon transfer, the basin as the shrinkable class, and the short-loop criterion)

[F5]

If a finite large metric flag complex is locally CAT(1) and not CAT(1), some minimum nonshrinkable circle, chosen to maximize its distinct vertex visits, is a locally geodesic edge loop in the 1-skeleton visiting at most three distinct vertices. (Minimum nonshrinkable loops, radial vertex cones, and the excursion of length π)

[F7]

The elementary product and sum formulas for sine and cosine expand 4sin⁡ssin⁡(s−a)sin⁡(s−b)sin⁡(s−c) into 1+2cos⁡acos⁡bcos⁡c−cos⁡2a−cos⁡2b−cos⁡2c for s=12(a+b+c). (The addition formulas for sine and cosine)

Proof

1.1F1F3givenalgebra

Clause (i): a closed edge walk of K with one edge is a loop edge, which does not exist, and with two edges it is an immediate backtrack u,v,u; the backtrack loop is short-loop homotopic to the constant loop at u by the family that pulls the second half back along the first, whose loops have length at most the original length, so it is shrinkable [F3]. Hence a nonshrinkable edge loop has at least three edges; if it had four or more, its length would be at least 4⋅π/2=2π by [F1], contrary to the hypothesis. Therefore it has exactly three edges.

1.2F6F7algebra

Clause (ii): let a,b,c∈[π/2,π) be the three edge lengths, with a+b+c<2π, and put x=cos⁡a, y=cos⁡b, z=cos⁡c. By [F7] the determinant of C equals 4sin⁡ssin⁡(s−a)sin⁡(s−b)sin⁡(s−c) with s=12(a+b+c): here 0<s<π, and s−a=12(b+c−a)>0 because b+c≥π>a, together with s−b>0, s−c>0 and s−a<s, s−b<s, s−c<s<π; hence all four sines are positive and det⁡C>0. The two leading principal minors are 1>0 and 1−x2=sin⁡2a>0, and the principal 2×2 minors are handled the same way as leading minors of submatrices, so by [F6] the matrix C is positive definite.

2.1F1F2step 1.2algebra

Clause (iii): by the metric flag condition and step 1.2 the three vertices of the loop span a simplex σ of X. Its spherical model is K(Cσ)∩S2; for points p,q in this simplex at distance δ<π, the shorter spherical segment has points (sin⁡((1−t)δ)p+sin⁡(tδ)q)/sin⁡δ for 0≤t≤1. The coefficients are nonnegative, so the whole segment remains in the positive cone K(Cσ) and hence in σ. Thus the loop is the boundary of a geodesically convex spherical triangle [F1, F2]. At a corner with interior angle α∈(0,π), take the points at distance t>0 along the two incident edges, with 2t<π; their inner product is cos⁡2t+sin⁡2tcos⁡α, so the spherical segment in σ joins them at distance d(t)=arccos⁡(cos⁡2t+sin⁡2tcos⁡α)<2t, because cos⁡d(t)>cos⁡2t is equivalent to sin⁡2t(1+cos⁡α)>0. Replacing the two boundary subarcs of total length 2t by this strictly shorter segment exhibits a strict local shortening, contradicting local geodesicity by its definition. Thus the boundary of σ, hence γ, is not locally geodesic.

3.1F1F2F4F5step 1.1step 2.1discharge-contradiction∎

Clause (iv): assume for contradiction that [assume-contra] X is not CAT(1). Short triangle tests and circles of length <2π are unchanged by truncation: their intrinsic side-point or circle distances are below π. Thus some untruncated intrinsic component is not CAT(1). It is compact geodesic by [F2], so [F4] supplies an attained minimum nonshrinkable circle; across the finitely many components choose one of global minimum length m<2π. By [F5] some such minimum is a locally geodesic edge loop. Step 1.1 leaves exactly three edges, while step 2.1 excludes that case. This is a contradiction. Therefore each untruncated component is CAT(1), and the same short comparison tests give CAT(1) for the angular truncation of X.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Finite large metric flag complexes are CAT(1)

Statement

Assume the Axiom of Choice (The Axiom of Choice). Every finite large metric flag complex X (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links) is CAT(1) for its truncated angular metric dπ (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)): every connected component of X with the induced metric is CAT(1), and distinct components of X are at truncated distance π from one another, so the CAT(1) tests, which involve only triangles of perimeter <2π, hold in X as well (Face links of large metric flag complexes, and the inductive local CAT(1) criterion(iv)).

The proof is dimension induction: the zero-dimensional case is Face links of large metric flag complexes, and the inductive local CAT(1) criterion(iv). The smaller-dimensional hypothesis gives local CAT(1) by that lemma's clause (iii), and Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1)(iv) gives global CAT(1). Its minimum-loop argument applies the compact short-loop results to untruncated intrinsic component metrics, which are compact geodesic under AC by Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), then transfers the short comparison tests to dπ.

Facts & Assumptions

Given: AC and a finite large metric flag complex X of dimension d, with its vertex complex K and truncated angular metric dπ.

[F1]

X is a finite spherical complex that is large (all simplex off-diagonals at most 0) and metric flag. (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)

[F2]

Face links of finite large metric flag complexes are again finite large metric flag complexes; if every finite large metric flag complex of dimension <d is CAT(1), then every d-dimensional one is locally CAT(1); a 0-dimensional one is a finite set of isolated vertices at truncated distance π with vacuous CAT(1) tests; and every dπ-triangle of perimeter <2π in a finite spherical complex lies in one component with sides the componentwise intrinsic distances. (Face links of large metric flag complexes, and the inductive local CAT(1) criterion)

[F3]

The truncated angular metric is dπ=min⁡{π,dpath} with min⁡{π,∞}:=π, and the componentwise path distance is +∞ between distinct components. (The angular path metric, the Euclidean cone and spherical joins)

[F4]

Assume AC; each connected component of a finite spherical complex, with its untruncated intrinsic metric, is a compact length space whose metric topology is the weak topology and in which every two points are joined by a minimizing geodesic. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), The Axiom of Choice)

[F5]

Under AC, a finite large metric flag complex that is locally CAT(1) is CAT(1). (Nonshrinkable edge loops of length <2π have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1)(iv))

[F6]

A metric space is CAT(1) when pairs at distance <π are joined by geodesic segments and geodesic triangles of perimeter <2π satisfy the spherical comparison inequality. (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles)

Proof

1.1baseF2F3

The empty complex has no CAT(1) tests and is CAT(1) vacuously. Otherwise, at the induction base dim⁡X=0, a finite large metric flag complex is a finite set of isolated vertices; by [F2] and [F3] distinct vertices are at truncated distance π, so any triangle with two distinct vertices has a side π and perimeter at least 2π, every admissible comparison test is degenerate and the only pairs at distance <π are equal points, joined by constant segments. Hence the zero-dimensional complex is CAT(1).

1.2F1F2F3F6algebra

Components: if X has several connected components, then every component, with the induced metric, is again a finite large metric flag complex: it carries the same cell Gram matrices, its intrinsic chain metric has the same angular truncation as the induced metric, and a pairwise adjacent vertex set lies in one component and spans a simplex in the component exactly when it does in X. Distinct components are at truncated distance π by [F3], so a triangle of perimeter <2π has all its vertices in one component and its comparison test is the test inside that component, and a pair at distance <π lies in one component; hence the CAT(1) tests for X are exactly the componentwise tests.

1.3F1F2ih

Induction hypothesis [IH]: assume that every finite large metric flag complex of dimension <d is CAT(1), and let X be a finite large metric flag complex of dimension d. For every nonempty face F, [F2] gives a finite large metric flag link of dimension at most d−dim⁡F−1<d; a nonempty link is CAT(1) by the induction hypothesis, and an empty link is CAT(1) vacuously. The relative interiors of these nonempty faces cover X, so the local models of [F2] make X locally CAT(1). The empty face, whose link is X itself, is not used in this inference.

2.1F4F5step 1.3

By step 1.3, X is locally CAT(1); [F5] gives CAT(1). Its compact-geodesic argument uses the untruncated intrinsic metrics of the connected components supplied by [F4], rather than assuming the angular truncation is globally geodesic.

3.1F1F2F3step 1.1step 1.2step 2.1discharge-induction∎

The base step 1.1 and induction steps 1.3–2.1 establish the theorem in every finite dimension. Step 1.2 also expresses the result componentwise, including disconnected complexes at intercomponent distance π.

CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least 2π

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let (W,S) be a finite-rank Coxeter system and let L=L(W,S) be its Coxeter nerve with the Moussong metric (The Coxeter nerve and its Moussong metric).

(i) L is a finite large metric flag complex. Every off-diagonal entry of every CT lies in [−1,0], so L is large (The Coxeter nerve and its Moussong metric(3)). For a pairwise adjacent nonempty set T⊆S, the matrix CT is its cosine matrix and the nerve definition gives (WT,T) the restricted Coxeter system (The Coxeter nerve and its Moussong metric(1)); applying Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1) to that system shows T spans a simplex exactly when CT is positive definite. The empty set is a simplex face and its empty matrix is positive definite vacuously (The Coxeter nerve and its Moussong metric(1)). Hence the metric flag condition of Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(3) holds.

(ii) L is CAT(1), and every short loop in L is shrinkable. By (i) and Finite large metric flag complexes are CAT(1), L is CAT(1) for its truncated angular metric. Each component with its untruncated intrinsic metric is compact geodesic by Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii); a CAT(1) component is locally CAT(1) with uniform radius π/4 (proof step 2.1), so Polygon transfer, the basin as the shrinkable class, and the short-loop criterion(iv) makes every short loop shrinkable. Hence L has no nonshrinkable loop of length <2π.

(iii) The same for every link. For every face F of L, the link Lk⁡L(F) is again a finite large metric flag complex by Face links of large metric flag complexes, and the inductive local CAT(1) criterion(i), hence CAT(1) by Finite large metric flag complexes are CAT(1). Iterating the Schur complement identifies it with the nerve of the link matrix (The Coxeter nerve and its Moussong metric(3), Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv)). Every nonconstant closed local geodesic in a CAT(1) space has length at least 2π (Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π(iii)); an isometrically embedded circle is such a closed local geodesic. Therefore, with g(Y):=inf⁡{ℓ>0:Y contains an isometrically embedded circle of length ℓ} and g(Y):=+∞ when no such circle exists, the girth of L and of every face link is at least 2π.

(iv) Caveat. Nothing here asserts that W is Gromov hyperbolic; that statement requires a strict form of the girth analysis on spherical links. Möller exhibits a counterexample to Moussong's Lemma 9.11 in its cited generality, so this proof does not use that lemma. The in-library proof uses the confined radial insertion, three-edge reduction and dimension induction, independently of that disputed lemma.

Facts & Assumptions

Given: AC and a Coxeter system (W,S) with finite S, Coxeter matrix m, canonical form B, cosine matrices CT=(B(es,et))s,t∈T and its Coxeter nerve L=L(W,S) with the Moussong metric.

[F1]

The nerve L is the finite spherical complex whose simplices are the spherical subsets T with CT positive definite; a two-element subset spans an edge exactly when mst<∞, of length π−π/mst∈[π/2,π); every off-diagonal entry of every CT lies in [−1,0] and links of faces are computed by the iterated Schur complement. (The Coxeter nerve and its Moussong metric)

[F2]

A finite spherical complex is large when all simplex off-diagonals are at most 0 and is metric flag when every pairwise adjacent vertex set spans a simplex exactly when its cosine matrix is positive definite; its links are again finite spherical complexes. (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)

[F3]

The nerve definition supplies the restricted Coxeter system (WT,T) for every T (The Coxeter nerve and its Moussong metric(1)); for nonempty T, the finite-type criterion says WT is finite if and only if its canonical Coxeter form, with matrix CT, is positive definite. The empty case is handled directly. (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1))

[F4]

Face links of finite large metric flag complexes are again finite large metric flag complexes. (Face links of large metric flag complexes, and the inductive local CAT(1) criterion)

[F5]

Under AC every finite large metric flag complex is CAT(1) for its truncated angular metric, and its untruncated components have the same short comparison tests. (Finite large metric flag complexes are CAT(1))

[F6]

In a compact geodesic locally CAT(1) space, CAT(1) implies that every short loop is shrinkable (Polygon transfer, the basin as the shrinkable class, and the short-loop criterion(iv)); “short” and “shrinkable” have the conventions of Short loops, the uniform-plus-length topology, short-loop homotopies, and nonshrinkability.

[F7]

Iterating the normalized Schur-complement formula over a face identifies each cell link with the spherical simplex on its remaining vertices. The full complex link is obtained by gluing these cell links; its identification with the nerve of the normalized link matrix is derived in step 3.1. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas)

[F8]

In a CAT(1) space every nonconstant closed local geodesic has length at least 2π; a circle is a closed local geodesic by its isometric parametrization. (Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least 2π(iii), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(5),(7))

[F9]

A CAT(1) space is locally CAT(1) with a uniform radius π/4: the closed ball Bˉ(p,π/4) is convex, since a geodesic triangle with vertex p and endpoints in the ball has perimeter at most π<2π and CAT(1) comparison keeps each side point within π/4 of the model vertex; the model ball is convex by Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(ii). CAT(1) comparison restricts to this convex ball.

[F10]

Each component of the finite nerve is compact without Choice; under AC it has minimizing geodesics (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii)). AC is also used with the compact short-loop theorem in step 2.1; the finite-type dictionary is choice-free. (The Axiom of Choice)

Proof

1.1F1F2F3algebra

Clause (i): every off-diagonal entry of every CT lies in [−1,0] [F1], so L is large by [F2]. If T=∅, it is spherical and its empty matrix is positive definite by convention. If T≠∅, [F1] makes (WT,T) the restricted Coxeter system with matrix m∣T, so [F3] applies (including the singleton case) and gives WT finite exactly when CT is positive definite. This is precisely the cell condition in [F1], hence every pairwise adjacent set spans a simplex exactly when its cosine matrix is positive definite. Thus L is metric flag and finite large metric flag.

2.1F1F5F6F9F10step 1.1

Clause (ii): by 1.1 and [F5] the nerve L with its truncated Moussong metric is CAT(1). By [F1] and [F10], each component with its untruncated intrinsic metric is compact and geodesic. It is CAT(1): all sides and cross-distances in a triangle of perimeter <2π are below π, so comparison is unchanged by truncation. Curve lengths and local geodesic germs agree in the two metrics, and their uniform topologies agree; thus short-loop homotopy is unchanged as well. For any point p in a CAT(1) component, the closed ball Bˉ(p,π/4) is convex: its center-and-endpoints triangles have perimeter at most π<2π, and comparison with the convex round ball of radius π/4 keeps each point of a segment in the ball [F9]. Any two points of this ball at distance <π have their geodesic in the ball, and its CAT(1) comparison inequalities are inherited from the component, so the ball is CAT(1). Thus each component is locally CAT(1) with uniform radius π/4. Applying [F6] componentwise makes every short loop shrinkable, so no nonshrinkable loop of length <2π exists in L.

3.1F1F4F5F7F8step 2.1

Clause (iii): by [F4] the link of every face of L is again a finite large metric flag complex, so by [F5] every such link is CAT(1); For nonempty F, let U be the vertices t∉F for which F∪{t} is a simplex, and form the Schur complement Z of CF in CF∪U. Its diagonal entries are positive because each CF∪{t} is positive definite. Put D=diag⁡(ztt−1/2) and A=DZD. Eliminating the vertices of F successively subtracts products of nonpositive entries divided by positive pivots, so Z and A have nonpositive off-diagonal entries. For every T⊆U, the block-completion identity proved in Face links of large metric flag complexes, and the inductive local CAT(1) criterion, gives AT positive definite exactly when CF∪T is positive definite. A nonedge pair in the latter has block (1−1−11), which excludes positive definiteness; for pairwise adjacent sets the nerve's cell test [F1] applies. Hence AT is positive definite exactly when F∪T is a simplex. On these cells, AT is their link Gram matrix by [F7], so the spherical complex with cells Σ(AT) for the positive-definite principal submatrices AT (the nerve of A) is isometric cell by cell, and therefore for the chain and truncated metrics, to Lk⁡L(F). The empty face gives L itself, and an empty U gives an empty link. By [F8], every nonconstant closed local geodesic in L or a face link has length at least 2π. An isometrically embedded circle is a closed local geodesic, so no such circle has length below 2π. Therefore the embedded-circle girth g defined in the Statement satisfies g(L)≥2π and g(Lk⁡L(F))≥2π for every face F, with g=+∞ when the circle set is empty.

4.1F5F8step 2.1step 3.1∎

Clause (iv): clauses (ii)–(iii) give CAT(1) and the non-strict girth bound; they do not assert Gromov hyperbolicity. The proof uses the confined insertion and direct three-edge contradiction, and does not consume Moussong's disputed star-avoiding lemma.

5 · Examples, counterexamples and false statements

None yet.

Sources