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.
Large Spherical Metric Flags and the Moussong Girth Theorem
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- CAT Comparison, Link Criteria, and Local Globalization
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Function Space Topologies and the Exponential Law
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Short Loop Polygons and Quantitative Energy Decrease
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Spherical Simplex Metrics, Angular Links, and Cones
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 . 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 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 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 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 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
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 be a finite abstract simplicial complex (An abstract simplicial complex) whose simplices carry positive-definite Gram matrices of diagonal on their vertices, compatible on common faces, and let be the associated finite spherical complex with its chain metric and its truncated angular metric (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)). is large when for every simplex and all distinct the edge length is at least , equivalently every off-diagonal entry of every is at most . 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 be large. Since is simplicial, a pair of vertices spans at most one edge. For an edge , let be the corresponding entry of its prescribed Gram matrix, and let be its one-cell spherical length. Define the symmetric matrix on the vertex set by , by the prescribed edge entry when is an edge of , and by when is not an edge. Its off-diagonal entries are non-positive: this is the almost-negative matrix associated with . 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 be large. A set of vertices of is pairwise adjacent when every two distinct members of span an edge; in that case is the cosine matrix of . We regard the empty matrix as positive definite, so the empty set passes this test. Say that is metric flag when for every pairwise adjacent : is the vertex set of a simplex of if and only if is positive definite (Positive and negative definiteness, the inertia , rank , and signature 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 of (that is, a simplex of ) the link is the finite spherical complex whose simplices are the links of the simplices (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 for which is a simplex of , and its cells are the sets disjoint from with a simplex of . Adjacency to every vertex of 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 ; the metric flag test is used only in the large case.
Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres
Statement
Let and be metric spaces (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(i) The -product. Give the -product metric ( as the set of functions , and , , are metrics on it, Cauchy–Schwarz: , with equality exactly for dependent pairs). If and are geodesic spaces, then is geodesic: for endpoints with factor distances and , a geodesic is exactly a pair of factor geodesics traversed at constant proportional speeds and (with the constant path when ). If and are CAT(0) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)), then is CAT(0). The same conclusions hold with either factor replaced by a Euclidean space with its Euclidean metric.
(ii) Joins. Let be nonempty metric spaces of diameter at most , carrying their truncated metrics (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 by the identifications at and , with the unique number in satisfying — is a metric of diameter at most on the spherical join , still with the conventions . The natural radial map , sending to the apex if and otherwise to radius in the join direction with and , is an isometry for the square-sum product metric of (i) (The angular path metric, the Euclidean cone and spherical joins(3)). Consequently, if and are CAT(1), then is CAT(1). In particular, for a one-point space the spherical cone is CAT(1) if and only if is CAT(1).
(iii) Round spheres, balls and convex subspaces. For every the round sphere with the metric (Euclidean spheres and closed balls as subspaces of , Principal inverse sine and inverse cosine, Pi is the first positive zero of sine) is CAT(1); every closed ball with (Open ball, closed ball and sphere in a metric space) is convex and CAT(1) for the induced metric; and every nonempty convex subset of a CAT(1) space, with the induced metric, is CAT(1), where convex means that every pair of points of at distance is joined by a geodesic segment of the ambient space lying in (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(ii), (v)). Consequently, if is CAT(1) of diameter at most and is a nonempty closed ball of positive radius in some , then the join is CAT(1).
Facts & Assumptions
Given: Metric spaces , and, in (ii) and (iii), nonempty metric spaces of diameter at most carrying their truncations .
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 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)
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)
The Euclidean plane is CAT(0); for the round sphere with 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 is convex. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)
A geodesic space is CAT(0) if and only if for every geodesic triangle with vertices and every point of a side at fraction one has . (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)
In a CAT(1) space every closed ball of positive radius is convex, and the round circle is CAT(1) if and only if . (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences)
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)
The Euclidean cone on a metric space with truncated metric is with and , and the spherical join is the quotient of with , with the conventions and . (The angular path metric, the Euclidean cone and spherical joins)
The cone formula defines a metric, the join formula defines a metric of diameter at most , and the radial map is an isometry for the square-sum product metric; for round spheres . (The cone and join metrics and the local product chart of a polyhedral gluing)
A metric is a symmetric function vanishing exactly on the diagonal and satisfying the triangle inequality, and the Euclidean norm on satisfies the triangle inequality. (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, as the set of functions , and , , are metrics on it)
In an inner product space, , and is a norm. (Cauchy–Schwarz: , with equality exactly for dependent pairs, The induced length is a norm)
For a sphere the round distance is with the principal inverse cosine, and . (Euclidean spheres and closed balls as subspaces of , Principal inverse sine and inverse cosine, Pi is the first positive zero of sine)
Proof
The function is a metric on : symmetry and vanishing exactly on the diagonal are immediate from [F9], and the triangle inequality is the triangle inequality of the Euclidean norm on applied to the vectors and [F9, F10].
Let be a rectifiable path and put , . For any , choose partitions whose coordinate polygonal sums exceed and , and take a common refinement. If are the two coordinate distances on its successive subintervals, then the product polygonal sum is by the Euclidean triangle inequality [F9, F10]. Letting gives . For endpoints with factor distances , this is at least . If both factors are geodesic, pair constant-speed factor segments, parametrized on at speeds when , give a product geodesic because their product distance between parameters is ; if use the constant path. Conversely, if is a product geodesic, then and this bound forces and . For any , apply the same bound to the two restrictions and . Their product distances are and , 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 and ; each coordinate distance equals its path length, so both coordinate paths are geodesics with constant proportional speeds. This proves the stated characterization when ; when both factors are constant.
For a metric space of diameter at most , the formula of [F7] defines a metric on : the case analysis of [F8] uses only that 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 on , and the case uses the projection estimates , and ), so it applies verbatim to the spaces and .
The product is CAT(0) if and are: by 1.2 its geodesic triangles have componentwise geodesic sides, and for a triangle with vertices and the point of at fraction the hinged criterion [F4] applied in each factor and added gives , because squared product distances add; by [F4] the product is CAT(0).
Let be the cosine expression in the join formula [F7]. Its two coefficients are nonnegative and sum to , so ; the function descends to the endpoint quotient and separates its classes by the equality case . The unit-radius map into satisfies , where is the product metric: this is the chord distance, not . For arbitrary radii, the same expansion transports along the radial bijection to the cone function built from , so that cone function is a metric. The triangle inequality for follows from the radius- argument in [F8], in its proof paragraph "The join is a metric space": if , and , choose when . The intermediate planar point lies on the chord from to , so the cone triangle inequality gives and hence . The case follows from separation, and follows from . Thus the join formula defines the required angular metric.
The radial map in (ii) is an isometry : for general radii the expansion of 2.2 gives with the join distance, which equals the sum of the two squared cone distances, namely the square-sum product distance; the conventions and of [F7] cover the empty cases.
A Euclidean space is CAT(0) [F3], so replacing either factor in 2.1 by 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.
If and are CAT(1) then is CAT(1): by [F6] the cones are CAT(0), by 2.1 their -product is CAT(0), by 3.1 it is isometric to , 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].
For a one-point space the spherical cone is CAT(1) exactly when is: if is CAT(1) then is CAT(1) by 4.1; conversely if is CAT(1) then is CAT(0) [F6] and is isometric to by the radial map of (ii), and is CAT(0) because a geodesic of this product joining two points of a slice 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 ; hence is CAT(1) [F6].
The round sphere is CAT(1): 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 , so all admissible tests are degenerate; of circumference is CAT(1) [F5, F8]; and for [F8], so induction on with 4.1 gives the claim. Every closed ball with is convex (by [F3] for , and because it is a singleton for ) and hence CAT(1) for the induced metric: a triangle of perimeter 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.
If is CAT(1) of diameter at most and is a nonempty closed ball of positive radius in some , then is CAT(1): 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 .
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.
Face links of large metric flag complexes, and the inductive local CAT(1) criterion
Statement
Let be a finite large metric flag complex (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links).
All CAT(1) assertions for a possibly disconnected complex use the truncated angular metric ; local balls of radius less than use the componentwise chain metric, which agrees with there.
(i) Links stay large and metric flag. For every face of , is a finite large metric flag complex; for this is . For nonempty , the face-link entries are obtained by deleting the vertices of one at a time using Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iv). At each deletion of a vertex , the normalized off-diagonal entry becomes , because the current entries are nonpositive and the denominator is positive. Thus every simplex link matrix is positive definite with diagonal and nonpositive off-diagonal entries. If is pairwise adjacent in the link, then is pairwise adjacent in , and the link cosine matrix on is the diagonally normalized Schur complement of in the principal cosine matrix . Since is positive definite, the block Schur-complement identity gives that this link matrix is positive definite exactly when is; metric flagness of makes the latter equivalent to being a simplex, which is equivalent to being a simplex of the link (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
(ii) Local models. Let be a nonempty face, put , and let . The unit directions in the tangent cone at form the spherical join , where is the round sphere of unit directions tangent to , consists of the normal directions, and when is a vertex (The angular path metric, the Euclidean cone and spherical joins(5), The cone and join metrics and the local product chart of a polyhedral gluing(3)). There is such that the cellwise radial map identifies the open ball isometrically with the open ball of radius about the pole in the spherical cone . For in this ball the radial coordinate is the chain distance and the direction is unique; at all directions represent the pole. In a cell containing , the map is the spherical polar chart and its distance formula is . For a vertex , cellwise radial coordinates are defined throughout , and is exactly the open radial cone with on . If is CAT(1) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)), then and its spherical cone are CAT(1) (Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii)). For every , the closed ball is isometric to the closed radius- ball in that cone, hence is convex and CAT(1) with its induced metric (Open ball, closed ball and sphere in a metric space, Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(v)).
(iii) The inductive local-curvature implication. Assume that every finite large metric flag complex of dimension is CAT(1). Then every -dimensional finite large metric flag complex is locally CAT(1): for each nonempty face , is a finite large metric flag complex of dimension at most by (i), with the empty link assigned dimension ; it is CAT(1) by hypothesis or by (iv). Clause (ii) then applies at every point because the relative interiors of the nonempty faces partition . This is the induction step only; it is not an unconditional lemma about .
(iv) Dimension zero and truncation. A -dimensional finite large metric flag complex is a finite set of isolated vertices; with the truncated metric distinct vertices are at distance , there are no distinct pairs at distance and every triangle of perimeter is constant, so the CAT(1) tests hold vacuously, and the empty link is CAT(1) vacuously with one-point cone (The angular path metric, the Euclidean cone and spherical joins(3)). More generally, every -triangle of perimeter in a finite spherical complex has all three sides and lies in one component, where the sides equal the componentwise intrinsic path distances; its comparison test is therefore unchanged by truncation (The cone and join metrics and the local product chart of a polyhedral gluing(1), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(4)).
Facts & Assumptions
Given: A finite large metric flag complex with its vertex complex (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links), a face of , and, in clause (iii), a dimension bound .
Every simplex Gram matrix is positive definite with diagonal ; largeness means its off-diagonal entries are nonpositive; metric flagness says a pairwise adjacent vertex set spans a simplex exactly when its cosine matrix is positive definite; and the cells of are the sets for which is a simplex. The empty matrix is positive definite by convention. (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)
The link Gram matrix of a spherical simplex is obtained by the normalized Schur complement, is positive definite, and iteration over a face gives the face link and agrees with orthogonal projection off the linear span of that face; spherical simplices are convex and have unique barycentric ray coordinates. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(ii),(iv))
A symmetric matrix is positive definite when its quadratic form is positive on every nonzero vector. (Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form)
A spherical simplex is a convex subset of a unit sphere; its cell distance is the round distance, its short radial geodesics satisfy the spherical cosine formula, and its face-link cells are the normal direction sections given by the Schur-complement projection in [F2]. The finite complex is glued along isometric faces and its componentwise chain distance is the infimum of finite cell-chain lengths. (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(ii),(iv), Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(1), Subcomplexes, closures, stars, and links in a simplicial complex)
CAT(1) uses geodesics for pairs at distance and spherical comparison for geodesic triangles of perimeter ; local CAT(1) means every point has a CAT(1) closed ball. The truncated angular metric is , with infinite componentwise distances replaced by . (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3),(4), Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links(1))
Every round sphere is CAT(1) with diameter at most ; the join of CAT(1) spaces of diameter at most is CAT(1), and the one-point spherical cone is CAT(1) when is CAT(1). These are the claims of Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii); the consumer uses are verified in steps 3.2 and 4.1.
The truncated angular metric is , and the spherical join distance is given by , with ; the product-cone isometry identifies the join metric on joined cells with the intrinsic face metric. (The angular path metric, the Euclidean cone and spherical joins(2),(5), The cone and join metrics and the local product chart of a polyhedral gluing(3))
In a CAT(1) space every closed ball of radius is convex, and a convex subset with its induced metric is CAT(1). (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(v), Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(iii))
Every closed ball in a round sphere of radius less than is geodesically convex. (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences(ii))
denotes the open metric ball of radius and the closed ball. (Open ball, closed ball and sphere in a metric space)
Proof
If is positive definite with diagonal and off-diagonal entries at most , deleting its vertex gives the Schur complement . For any nonzero vector on the remaining indices, the vector is nonzero and satisfies ; hence is positive definite. In particular, testing a coordinate vector gives on each diagonal. The off-diagonal entries are nonpositive because ; normalizing by preserves positive definiteness and gives diagonal with off-diagonal entries .
For a symmetric block matrix with positive definite, is invertible: for nonzero would contradict . Put . For , . Thus is positive definite if is, and if is positive definite then testing for each nonzero shows that is positive definite.
Fix a spherical simplex and in the relative interior of its face . In the barycentric ray coordinates of [F2], the local inequalities for at are for vertices and no sign restriction on the face-coordinate variations, subject to . The radial normalization chart and its inverse are smooth, so their differentials identify these coordinate tangent cones with the tangent cone in the sphere; its lineality is exactly the subspace with all outside , namely . Since and lie in the convex cone , subtracting the orthogonal projection onto shows .
Work in the component of , with its componentwise chain metric. Let be the finite union of cells containing . For each such spherical simplex , every face not containing is compact and disjoint from , so the minimum of over is positive. Choose below all these finitely many positive minima and with ; if there are no such faces, choose any . On the cellwise radial function is well defined and is -Lipschitz on every incident cell. A chain from that leaves first reaches a face of an incident cell not containing ; at that point its prefix has length at least the cellwise radius, which is at least . Thus if , every cell containing contains .
Iterating step 1.1 over the vertices of any nonempty face shows that every simplex of its face link has a positive-definite Gram matrix with diagonal and nonpositive off-diagonal entries. The link is finite, so it is a finite large spherical complex.
In a simplex , the unit directions in form , while the directions in are the normal directions of ; their face-link Gram matrix is the Schur complement from [F2]. The orthogonal splitting of step 1.3 expresses each cell of the point link as the join of with the corresponding face-link cell. On each such cell, the inner-product formula is the spherical-join formula [F7], and the product-cone isometry identifies the induced face metrics with the intrinsic join metric [F7]. The identifications agree on common faces, so with the join metric. For a vertex , the first factor is empty and the point link is the face link.
Choose . Map a cone point to the point at distance on the cellwise spherical geodesic from in direction ; common-face identifications make this map well defined. The radial path has length , while every chain staying in has length at least the variation of , and every chain leaving it has length at least . Hence the radial coordinate equals for , and is a bijection from the cone ball onto , with all directions collapsed at the pole. If and , then for every small enough there is a finite chain of link directions with consecutive directions in one link cell and total angle . Unfold its spherical sectors about their common radial boundaries into a unit-sphere sector of angle . Each sector map is an isometry by the spherical cosine formula, and the great-circle segment between radii stays in the radius- cap by [F9]; subdividing at its finitely many sector crossings and mapping the pieces back gives a path in of length . Letting gives the upper distance bound by the cone formula. If either radius is , the radial segment gives equality; if , the path through has length , the cone distance. Conversely, let a chain from to have length . If , then the cone distance is at most . If , every point of the chain has distance from less than , so each common cell contains ; in that cell the two directions lie in one link cell. Their global truncated link distance is at most their spherical distance in this cell, since the cell segment is an admissible link chain. The cone cosine formula is nondecreasing in that angle, so does not increase this chain step. No global isometry of a link cell is assumed. The cone distance is therefore at most . Taking infima proves the isometry of the open balls.
If , the link claim is the hypothesis on ; take nonempty. Let be pairwise adjacent in . Then is pairwise adjacent in . The diagonal link entries are , and each off-diagonal link entry for is the Schur-complement entry from the simplex ; therefore the full link cosine matrix on is the diagonally normalized Schur complement of in the principal cosine matrix . Positive diagonal normalization preserves positive definiteness. Since is positive definite, step 1.2 says this link matrix is positive definite exactly when is. Metric flagness of makes that equivalent to being a simplex, which is equivalent to being a simplex in the link. The empty set is covered by the empty-matrix convention in [F1], and simplex link matrices are positive definite by step 2.1; hence the link is metric flag and clause (i) follows.
If is CAT(1), step 2.2 and [F6] show that is CAT(1), and the one-point join is CAT(1) as well. For , step 2.3 identifies with the closed radius- ball about the pole in that cone; [F8] makes this ball convex and CAT(1) with its induced metric. This proves the local CAT(1) conclusion at .
Let be a vertex. For a point in a simplex containing , its cellwise radial distance and direction are defined throughout that simplex. If lies in the opposite face not containing , its barycentric ray coordinates involve only vertices , so has the sign of ; hence . The radial function is -Lipschitz on every cell containing , so every chain leaving has length at least . For with cellwise radius , chains staying in the star have length at least , chains leaving have length at least , and the radial segment has length ; thus . If has cellwise radius , chains staying in the star have length at least and chains leaving have length at least , so ; points outside the star also have distance at least . Conversely, every unit link direction has a representation with in an incident simplex. Its radial ray is ; all coefficients are nonnegative for . Hence every direction extends through that radius within the star, and is exactly the open radial cone on .
Suppose every finite large metric flag complex of dimension less than is CAT(1), and let have dimension . For each nonempty face , clause (i) gives a finite large metric flag link with ; a nonempty link is CAT(1) by the hypothesis, and an empty link satisfies the CAT(1) tests vacuously by [F5]. Clause (ii), proved in step 3.2, then gives a CAT(1) neighborhood at every point of . These relative interiors partition , so is locally CAT(1), proving clause (iii).
A zero-dimensional finite large metric flag complex is a finite set of vertices with distinct vertices at truncated distance . There are no distinct pairs at distance less than , and every triangle with at least two distinct vertices has perimeter at least , so the CAT(1) tests hold; the empty link is CAT(1) vacuously. More generally, if a triangle in a finite spherical complex has -perimeter less than , none of its sides can equal because the triangle inequality would force the other two sides to sum to at least . Each side is therefore the componentwise intrinsic distance, and all vertices lie in one component, so its comparison is unchanged when using the truncated metric. This proves clause (iv).
Remarks
- Supplier review: Steps 3.2 and 4.1 use Products of CAT(0) spaces, joins of CAT(1) spaces, and round spheres(ii),(iii) for CAT(1) joins and the one-point spherical cone. The join lemma's steps 4.1 and 5.1 use clause (i) of Berestovskii's cone criterion and the polyhedral link criterion. The current cone-theorem text contains explicit large-perimeter and antipodal comparison arguments; those cases and the exact uses were checked against Bridson–Haefliger II.3.14, printed pp. 189–190. Its available item receipt has an older hash and remains escalated, so the owner must refresh that sibling decision for the current bytes. This item's claim and use are verified against the current supplier text; the stale receipt is recorded as a run-level owner obligation in the pair report.
- Choice: No Axiom of Choice is used here. The finite chain arguments use the definition of an infimum one tolerance at a time, finite cell sets, and finite minima; they do not use the minimizing-geodesic conclusion of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas(iii), whose separate Ascoli argument explicitly assumes Choice.
- Source check: Bridson–Haefliger I.7.14 defines the link of a point in a geodesic simplex, I.7.15 assembles point links with their intrinsic string metric, and I.7.16 proves the small-ball cone chart by finite-chain development. The local argument above follows that route in curvature and proves the required chain-metric comparison explicitly.
The Coxeter nerve and its Moussong metric
Definition
Let be a Coxeter system of finite rank, so is finite, with Coxeter matrix (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). Let carry the canonical bilinear form with and for finite , and when (The real Coxeter form, its radical, reflections, and form-preserving maps). For , set ; whenever , is a principal submatrix of .
(1) Spherical subsets. A subset is spherical when its standard parabolic subgroup 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 is a Coxeter system with restricted Coxeter matrix . Applying the finite-type criterion to this Coxeter system gives (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1), Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form). The empty subset is spherical: and the empty matrix is positive definite vacuously. Spherical subsets are downward closed, since whenever .
(2) The Coxeter nerve and its metric. Let be the simplicial complex on vertex set whose nonempty simplices are the spherical subsets. The Coxeter nerve is obtained by assigning to each nonempty spherical the spherical simplex (Spherical Gram simplices and angular links of Euclidean faces) and gluing its faces by the vertex-preserving isometries associated to the principal submatrices for (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 , spans an edge exactly when ; its prescribed one-cell length is 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 , let be the chain distance: the infimum of the sums of the round angular distances of successive points that lie in common cells. Set for points in different components as auxiliary extended-distance notation. Define Then 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 are exactly the nonempty subsets for which 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 is spherical, then every off-diagonal entry of lies in , so every edge cell has length at least ; therefore 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 .
Facts & Assumptions
Given: The finite-rank Coxeter system , the Coxeter form , and the matrices above.
For every , the canonical map from the group presented by the restricted matrix to is an isomorphism; thus is a Coxeter system (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification(2)).
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)).
The Coxeter form has diagonal entries , off-diagonal entries for finite , and entry for (The real Coxeter form, its radical, reflections, and form-preserving maps).
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)).
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)).
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).
The cosine is strictly decreasing on , with range , and (Principal inverse sine and inverse cosine, The addition formulas for sine and cosine, Quarter-turn values and shifts by pi/2 and pi).
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 , rank , and signature of a real symmetric bilinear or quadratic form).
A metric is a real-valued function satisfying separation, symmetry and the triangle inequality (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
Proof
Spherical subsets and cells. Fix . By [F1], the restricted matrix presents the Coxeter system , and its canonical Coxeter form has matrix exactly by [F3]. Applying [F2] to this restricted system proves finite if and only if is positive definite. For , and positive definiteness of the empty matrix is vacuous by [F8]. If and is spherical, then is finite; the principal submatrix is also positive definite because it is the restriction of the positive quadratic form of . Thus the nonempty spherical subsets form a finite simplicial complex, and they are exactly the nonempty positive-definite principal submatrices.
Edges and their prescribed lengths. For distinct , [F1] and [F2] show that is spherical exactly when its two-by-two Coxeter Gram matrix is positive definite. If , put and . Since , , so by [F7]; for , , so the matrix is positive definite by [F8]. If , then and its quadratic form vanishes at , so it is not positive definite by [F8] and there is no edge. In the finite case the two unit vertices have inner product by [F7]; since , their angular separation within that edge cell is . This computes the local edge length; it makes no claim that the global chain distance cannot be shorter.
Face gluing. For every nonempty spherical , [F4] realizes as a spherical simplex. If , its principal submatrix is the Gram matrix of the face spanned by the vertices indexed by , so the vertex-preserving face isometry agrees with the one obtained from any larger spherical simplex containing . Hence these finitely many cells glue consistently along precisely their common faces. Singletons give point cells; the empty subset contributes only the empty face.
The componentwise and truncated metrics. There are finitely many cells because 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 , the maximum of the finitely many cell bounds. For any chain in the spherical cells, the length of its Euclidean image is at most 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 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 lie in a spherical , then is finite; applying [F1] and [F2] to the pair shows is positive definite, which by step 1.2 forces . Hence by [F3] and [F7]. Thus each spherical cell has nonpositive off-diagonal Gram entries, every edge length is at least , 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. 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 with .
Minimum nonshrinkable loops, radial vertex cones, and the excursion of length
Statement
Assume AC (The Axiom of Choice). Let be a finite large metric flag complex, locally CAT(1) and not CAT(1). Its angular metric is on a connected component , where is the untruncated intrinsic spherical length metric; distinct components have distance . The compact-geodesic short-loop results are applied to , 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 .
Let be the infimum of the lengths of isometrically embedded circles in . Then is attained by a shortest nonshrinkable loop , an isometrically embedded circle, and every short loop of length 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- minimum nonshrinkable loop is a local geodesic and an isometrically embedded circle.
(ii) Radius- vertex cones. For a vertex , 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 from cannot leave its star. In a simplex, use normalized ray coordinates , where , and . On an opposite face, . Thus distinct vertices have distance at least , and no other vertex lies in . The identity shows that the open vertex balls cover . The radial cap is locally isometric to at its interior points; an inherited-distance isometry of the entire radius- 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 . In a component attaining , the untruncated injectivity radius is ; every local geodesic arc of length at most minimizes, and geodesics at distance are unique. The minimum of these component injectivity radii is .
(iv) Confined insertion and the -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 which inserts that vertex and preserves all old vertex visits. Every resulting length- 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 -skeleton with at most three distinct vertices.
Facts & Assumptions
Given: AC; a finite large metric flag complex , locally CAT(1) for its angular truncation and not CAT(1); let be the infimum of its isometrically embedded-circle lengths. Write for the untruncated intrinsic length metric of a connected component , and .
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
Simplex vertex vectors are linearly independent, ray coordinates are with , , and . 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
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 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
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 gives all-pair comparison for triangles of perimeter below . Compact geodesic locally CAT(1) spaces are CAT(1) exactly when they contain no short circle
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 . 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
Point links have the decomposition at relative-interior points of a -face. Small spherical neighborhoods have the corresponding polar chart. At a large vertex, the open radius- 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
The join metric satisfies , 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
Finite products and closed subsets of compact spaces are compact; compact metric spaces are sequentially compact; continuous images of compact sets are compact; continuous functions on compact metric sets attain extrema and are uniformly continuous. A product of finitely many compact spaces is compact in the product topology, A closed subset of a compact metric space is compact, In any metric space compactness implies countable compactness and limit point compactness, and each of countable compactness and limit point compactness implies sequential compactness; every implication here is proved without a choice principle, The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Heine-Cantor: a continuous map from a compact metric space to any metric space is uniformly continuous
Absolute convergence of the sine and cosine power series gives and 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
Distances obey the triangle inequality; curve lengths are suprema of partition sums, additive under subdivision and invariant under arclength normalization. Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Length in a metric target: lower semicontinuity and arc-length reparametrization
Proof
Vertex geometry with correct ray coordinates. In a simplex containing , an opposite-face point has , so . Its cellwise radius from is at least . This radial function agrees on common faces and is -Lipschitz on each incident cell, so a path leaving the star first spends at least . 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 . Distinct vertices have distance at least . Conversely gives a positive pairing with some support vertex, so the open vertex balls cover .
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 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 . Short-loop homotopies stay in a component, so is also the minimum nonshrinkable length for , and it is attained by an isometrically embedded circle. In a component attaining it, the circle gives failure of short uniqueness above , whereas [F4] supplies a circle of length twice the injectivity radius. Thus this radius is . Any component containing a nonshrinkable loop of length also has this same minimum and radius.
The actual cap and its small metric chart. Let with its truncated intrinsic metric and let . Its cellwise radial map is defined through radius , 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 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 . For endpoints of radius at most , a path leaving the star or reaching radius costs at least , whereas the path through the pole costs at most . Consequently sufficiently small cap distances agree with the ambient metric. At an interior cap point the minimal support contains , so all incident cells contain ; the same finite-cell exit argument gives local isometry there. No metric isometry of the entire radius- cap into is asserted.
All length- 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 , a contradiction. Now a unit local geodesic arc of length in its component minimizes. Indeed take the maximal minimizing prefix of length . If , append a sufficiently small locally minimizing piece of length , with . The endpoint triangle has perimeter at most , so [F4] gives CAT(1) comparison. Equal tiny sidepieces of length about their common point have actual cross-distance ; comparison and the model triangle inequality give , forcing model angle by the cosine rule. The opposite side consequently has length , contradicting maximality. Continuity extends minimization to length . Applying this to each shorter arc of a length- minimum local loop gives the circle distance formula, so it is isometrically embedded.
A local spherical-to-tangent argument. The empty link is immediate. Otherwise consider the Euclidean cone , which is geodesic because its finite link has minimizing short paths by [F2]. Its radius- closed ball is compact: it is the continuous image of with radius zero collapsed. Fix cone points and , and send a bounded cone point to cap radius with direction . For sufficiently small these points lie in the CAT(1) neighborhood of and the small isometry of step 2.1. The exact distance formula and [F9] give , hence uniformly on bounded radii; the bound justifies expanding its left side as well. Let be the unique small spherical midpoint of the two images. Its radius is at most , so the corresponding cone points lie in one bounded compact ball. Along choose one convergent subsequence, depending only on , with cone limit . The midpoint distances show . For any fixed cone test point , the small triangle is admissible for all sufficiently large , and its CAT(1) midpoint inequality is . Expanding on this same subsequence gives . The subsequence was fixed before was introduced, so one midpoint satisfies this inequality for every .
Global CAT(1) of the link, without the girth conclusion. Plug any other midpoint of 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 from to gives, first for dyadic and then all , . By [F5] this is CAT(0), and [F7] gives CAT(1) of the truncated link . Thus is CAT(1). This inference used local CAT(1) of , not a lower-dimensional girth assertion.
Controlled radial contraction. On a compact radius- subset of , radial contraction sends to . From [F7], for . It is therefore distance- and length-nonincreasing. The identity also proves the required length continuity. For a fixed , the ratios extend at by and tend uniformly to one on the bounded radius ranges; the same holds for the distance ratios, using the continuous function 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 . 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.
The excursion is genuinely a cap geodesic of length . Let be a length- 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 by the local isometry of step 2.1, with continuous equatorial endpoints. If its length exceeded , an interior subarc of length would minimize in 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 . Every vertex has at most one excursion, since two would spend .
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 forces the excursion to be this actual sector path. Its angular projection is therefore locally geodesic in 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 and wrap the local sectors using the real coordinates 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 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 . This argument develops the cone on that trace, rather than all cells of the singular star in one ambient sphere.
A confined constant-length insertion. The subcone is isometric, by the join formula, to a spherical quarter-hemisphere. Let be its orthonormal model vectors for the first equatorial endpoint, angular midpoint, and pole. The nonpole excursion is , , for some . Increase to . Every intermediate semicircle remains in this same subcone, has endpoints 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 , ending at a loop through . No other vertex lies in the open cap, so every old vertex visit is preserved and is added. Every loop remains nonshrinkable by this explicit short homotopy; step 2.2 makes each length- result an isometrically embedded minimum circle. Thus insertion does not assume preservation of an embedding or lift an arbitrary ambient rotation.
Maximal visits. Choose a length- minimum circle with the largest number of distinct visited vertices. There are at most three: four distinct cyclic visits would spend at least 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.
A genuine departure from a visited vertex. Start the circle at an actual visited vertex 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 , write its unit direction as with all . The ray is . All non-v coefficients stay positive until the v coefficient first vanishes at a time . 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 , the loop reaches its opposite-face exit. At that exit, the positivity identity from step 1.1 supplies another support vertex with positive pairing. Hence choose a point just before the exit, in . Its centre is visited by step 9.1. The unique w-excursion passes through and consists of two radial legs, since cap geodesics from the pole are radial; thus the loop's subarc from to has length below . 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 , its tangent is both the actual ray from and the radial ray to , forcing 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.
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 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.
Nonshrinkable edge loops of length 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 be a finite large metric flag complex which is locally CAT(1).
(i) A nonshrinkable locally geodesic edge loop of of length has exactly three edges. A closed edge walk with one or two edges is an immediate backtrack — the -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 , so a closed edge walk with four or more edges has length .
(ii) Let be the vertices of such a three-edge loop, and let be the assigned spherical lengths of its edges . Thus and . Its cosine matrix is positive definite: with , the identity makes its determinant positive, and the leading principal minors are positive (Sylvester's criterion: a real symmetric matrix with 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 , a spherical triangle with sides (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 ; at a corner take the two points at distance 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 , where 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 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 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 , 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 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 that is locally CAT(1), with vertex complex , and a nonshrinkable locally geodesic edge loop of length .
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; is large, so every edge of every simplex has length in . (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)
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)
A loop is normalized and short when its length is ; 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)
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 , and if is not CAT(1), it contains an isometrically embedded circle of length ; every loop of length below the infimum of the lengths of isometrically embedded circles is shrinkable, and if then 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)
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 -skeleton visiting at most three distinct vertices. (Minimum nonshrinkable loops, radial vertex cones, and the excursion of length )
A real symmetric matrix is positive definite exactly when all its leading principal minors are positive, and a principal submatrix of a positive-definite matrix is positive definite. (Sylvester's criterion: a real symmetric matrix with is positive definite if and only if all leading principal minors are positive, Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form)
The elementary product and sum formulas for sine and cosine expand into for . (The addition formulas for sine and cosine)
Proof
Clause (i): a closed edge walk of with one edge is a loop edge, which does not exist, and with two edges it is an immediate backtrack ; the backtrack loop is short-loop homotopic to the constant loop at 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 by [F1], contrary to the hypothesis. Therefore it has exactly three edges.
Clause (ii): let be the three edge lengths, with , and put , , . By [F7] the determinant of equals with : here , and because , together with , and , , ; hence all four sines are positive and . The two leading principal minors are and , and the principal minors are handled the same way as leading minors of submatrices, so by [F6] the matrix is positive definite.
Clause (iii): by the metric flag condition and step 1.2 the three vertices of the loop span a simplex of . Its spherical model is ; for points in this simplex at distance , the shorter spherical segment has points for . The coefficients are nonnegative, so the whole segment remains in the positive cone and hence in . Thus the loop is the boundary of a geodesically convex spherical triangle [F1, F2]. At a corner with interior angle , take the points at distance along the two incident edges, with ; their inner product is , so the spherical segment in joins them at distance , because is equivalent to . Replacing the two boundary subarcs of total length 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.
Clause (iv): assume for contradiction that [assume-contra] is not CAT(1). Short triangle tests and circles of length 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 . 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 .
Finite large metric flag complexes are CAT(1)
Statement
Assume the Axiom of Choice (The Axiom of Choice). Every finite large metric flag complex (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links) is CAT(1) for its truncated angular metric (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(3)): every connected component of with the induced metric is CAT(1), and distinct components of are at truncated distance from one another, so the CAT(1) tests, which involve only triangles of perimeter , hold in 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 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 .
Facts & Assumptions
Given: AC and a finite large metric flag complex of dimension , with its vertex complex and truncated angular metric .
is a finite spherical complex that is large (all simplex off-diagonals at most ) and metric flag. (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links)
Face links of finite large metric flag complexes are again finite large metric flag complexes; if every finite large metric flag complex of dimension is CAT(1), then every -dimensional one is locally CAT(1); a -dimensional one is a finite set of isolated vertices at truncated distance with vacuous CAT(1) tests; and every -triangle of perimeter 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)
The truncated angular metric is with , and the componentwise path distance is between distinct components. (The angular path metric, the Euclidean cone and spherical joins)
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)
Under AC, a finite large metric flag complex that is locally CAT(1) is CAT(1). (Nonshrinkable edge loops of length have three edges, and the finite locally CAT(1) large metric flag complex is CAT(1)(iv))
A metric space is CAT(1) when pairs at distance are joined by geodesic segments and geodesic triangles of perimeter satisfy the spherical comparison inequality. (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles)
Proof
The empty complex has no CAT(1) tests and is CAT(1) vacuously. Otherwise, at the induction base , 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 , 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).
Components: if 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 . Distinct components are at truncated distance by [F3], so a triangle of perimeter 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 are exactly the componentwise tests.
Induction hypothesis [IH]: assume that every finite large metric flag complex of dimension is CAT(1), and let be a finite large metric flag complex of dimension . For every nonempty face , [F2] gives a finite large metric flag link of dimension at most ; 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 , so the local models of [F2] make locally CAT(1). The empty face, whose link is itself, is not used in this inference.
By step 1.3, 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.
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 .
The Coxeter nerve is CAT(1), and its girth and the girths of all its links are at least
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a finite-rank Coxeter system and let be its Coxeter nerve with the Moussong metric (The Coxeter nerve and its Moussong metric).
(i) is a finite large metric flag complex. Every off-diagonal entry of every lies in , so is large (The Coxeter nerve and its Moussong metric(3)). For a pairwise adjacent nonempty set , the matrix is its cosine matrix and the nerve definition gives 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 spans a simplex exactly when 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) is CAT(1), and every short loop in is shrinkable. By (i) and Finite large metric flag complexes are CAT(1), 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 (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 has no nonshrinkable loop of length .
(iii) The same for every link. For every face of , the link 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 (Short local geodesics in a CAT(1) space are geodesics, and closed local geodesics have length at least (iii)); an isometrically embedded circle is such a closed local geodesic. Therefore, with and when no such circle exists, the girth of and of every face link is at least .
(iv) Caveat. Nothing here asserts that 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 with finite , Coxeter matrix , canonical form , cosine matrices and its Coxeter nerve with the Moussong metric.
The nerve is the finite spherical complex whose simplices are the spherical subsets with positive definite; a two-element subset spans an edge exactly when , of length ; every off-diagonal entry of every lies in and links of faces are computed by the iterated Schur complement. (The Coxeter nerve and its Moussong metric)
A finite spherical complex is large when all simplex off-diagonals are at most 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)
The nerve definition supplies the restricted Coxeter system for every (The Coxeter nerve and its Moussong metric(1)); for nonempty , the finite-type criterion says is finite if and only if its canonical Coxeter form, with matrix , is positive definite. The empty case is handled directly. (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite(1))
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)
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))
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.
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)
In a CAT(1) space every nonconstant closed local geodesic has length at least ; 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 (iii), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles(5),(7))
A CAT(1) space is locally CAT(1) with a uniform radius : the closed ball is convex, since a geodesic triangle with vertex and endpoints in the ball has perimeter at most and CAT(1) comparison keeps each side point within 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.
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
Clause (i): every off-diagonal entry of every lies in [F1], so is large by [F2]. If , it is spherical and its empty matrix is positive definite by convention. If , [F1] makes the restricted Coxeter system with matrix , so [F3] applies (including the singleton case) and gives finite exactly when 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 is metric flag and finite large metric flag.
Clause (ii): by 1.1 and [F5] the nerve 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 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 in a CAT(1) component, the closed ball is convex: its center-and-endpoints triangles have perimeter at most , and comparison with the convex round ball of radius 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 . Applying [F6] componentwise makes every short loop shrinkable, so no nonshrinkable loop of length exists in .
Clause (iii): by [F4] the link of every face of is again a finite large metric flag complex, so by [F5] every such link is CAT(1); For nonempty , let be the vertices for which is a simplex, and form the Schur complement of in . Its diagonal entries are positive because each is positive definite. Put and . Eliminating the vertices of successively subtracts products of nonpositive entries divided by positive pivots, so and have nonpositive off-diagonal entries. For every , the block-completion identity proved in Face links of large metric flag complexes, and the inductive local CAT(1) criterion, gives positive definite exactly when is positive definite. A nonedge pair in the latter has block , which excludes positive definiteness; for pairwise adjacent sets the nerve's cell test [F1] applies. Hence is positive definite exactly when is a simplex. On these cells, is their link Gram matrix by [F7], so the spherical complex with cells for the positive-definite principal submatrices (the nerve of ) is isometric cell by cell, and therefore for the chain and truncated metrics, to . The empty face gives itself, and an empty gives an empty link. By [F8], every nonconstant closed local geodesic in or a face link has length at least . An isometrically embedded circle is a closed local geodesic, so no such circle has length below . Therefore the embedded-circle girth defined in the Statement satisfies and for every face , with when the circle set is empty.
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
- Ruth Charney and Michael W. Davis, The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold, Pacific J. Math. 171 (1995)
- Philip Moeller, A note on almost negative matrices and Gromov-hyperbolic Coxeter groups, arXiv:2205.07791
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008)
- G. Moussong, Hyperbolic Coxeter groups, PhD thesis (Ohio State University 1988), McCammond transcription
- Martin R. Bridson and Andre Haefliger, Metric Spaces of Non-Positive Curvature (Springer Grundlehren 319, 1999; author-hosted PDF)
- B. H. Bowditch, Notes on locally CAT(1) spaces (Aberdeen preprint, 27 scanned sheets)
- Gabor Moussong, Hyperbolic Coxeter Groups, PhD thesis (Ohio State University, 1988; McCammond transcription)