How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The angular link of a vertex of the Davis complex is the large metric flag nerve
Statement
Let be a Coxeter matrix with finite, the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), carrying the Coxeter form with , for and for , and the canonical reflection representation (The real Coxeter form, its radical, reflections, and form-preserving maps (1), The canonical reflection homomorphism, roots, reflections, and the positive cone). Let be the set of spherical subsets with nerve (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)), let be the Davis realization with its cellulation by the cells () and its chain metric (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)), and let , , with its faces and face isometries be the Coxeter cell of Finite Coxeter orbit polytopes, face isometries and their cocycle for a fixed tuple of positive numbers . Assume the Axiom of Choice (The Axiom of Choice); it is used in the proof only through Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii) and Finite large metric flag complexes are CAT(1).
(1) Edge directions at a vertex. Let and let be a cell, identified with so that the -cell corresponds to . For every the only -face of through with type is the segment , and because and is the -dual basis of (Finite Coxeter orbit polytopes, face isometries and their cocycle (1),(2), The finite-type Coxeter cell: exposed faces and normal cones (5)). The tangent cone (the cone of inward directions at the vertex, in the sense of Spherical Gram simplices and angular links of Euclidean faces) is the simplicial cone generated by the vectors , : it equals , cut out by the facets through the vertex, and each is an extreme ray, since a nonnegative combination has -pairing and cannot equal (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (v); carries the inner product , Real and complex inner-product spaces and their induced length, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
(2) Edge lengths. For distinct the subgroup is finite because it is contained in the finite group , so . In the spherical simplex of (3), the edge joining the directions and has its prescribed spherical length (The real Coxeter form, its radical, reflections, and form-preserving maps, Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine). This is the local edge-cell length measured in that spherical simplex; no global shortest-path distance between these vertices in the whole link is asserted (Abstract isometric polyhedral gluings and the chain metric).
(3) The vertex link is the nerve. For every spherical the link of the vertex is isometric to the spherical simplex with vertex set and cosine matrix , realized by the Gram construction of Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i),(ii) and Spherical Gram simplices and angular links of Euclidean faces, and for the face of belonging to the face is , the vertex map being . Gluing over along these faces, the angular link of any -cell , with its truncated angular metric, is canonically isometric to the finite spherical complex built on the nerve with the Gram matrices (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii),(v),(vi), Abstract isometric polyhedral gluings and the chain metric); the direction of the -cell corresponds to the vertex of , and the identification preserves the weak topologies and the truncated angular metrics.
(4) Large metric flag. is a finite large metric flag complex in the sense of Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links: by (2) every edge has length . If is a pairwise adjacent set of vertices of , its cosine matrix is , since each edge entry is the local length from (2). The parabolic presentation theorem identifies with the Coxeter system for the restricted matrix , which is the induced labelled subdiagram (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), Coxeter diagrams: edges, labels, components and finite type). Hence the finite-type criterion gives positive definite exactly when is finite (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). By the definition of , this is exactly when spans a simplex. The associated almost-negative matrix has entry on non-edges and cosine of the prescribed edge length on edges, so it is exactly : a pair is an edge precisely when , and then ; for a non-edge and .
(5) Higher links. For every spherical and every the angular link of the cell is canonically isometric to the link of the face in : its vertices are exactly the for which is spherical, its cells are the sets with spherical, and its Gram matrices are the iterated Schur complements of along (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iv)). The direct Schur-complement argument in step 4.1 shows that every such link is again a finite large metric flag complex. For every point of the relative interior of , some metric ball is isometric to the ball of radius about in (The cone and join metrics and the local product chart of a polyhedral gluing).
(6) CAT(1) links. Every vertex link and, by (5), every link is CAT(1) for its truncated angular metric (Finite large metric flag complexes are CAT(1), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3),(4)); truncation means , including distance across distinct components or when no path exists (The angular path metric, the Euclidean cone and spherical joins (2),(4)).
(7) Abstentions. Nothing is asserted here about CAT(0)-ness, contractibility, properness of the action or fixed points of finite subgroups; those are proved in the later items of this page. The link computation is independent of the choice of the distances ; the cell metrics of are not, and no claim is made here about them beyond The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K). No Choice is used in (1)-(5) beyond the referenced construction of the spherical complex.
Facts & Assumptions
Given: The Axiom of Choice, a finite Coxeter matrix , the presented group with length , the Coxeter form on , the canonical reflection representation , a fixed tuple of positive real numbers, and the associated cells , .
The Coxeter form satisfies , for finite and for , and each generator acts by the reflection , ; the map is a homomorphism (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Its -invariance is the local reflection-form calculation in step 1.3, followed by composition along a word for .
is the group presented by ; for the standard parabolic is , and is spherical exactly when is finite, so that the simplices of the nerve are the nonempty spherical subsets and is finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).
Restricting the Coxeter matrix to gives the induced labelled subdiagram; finite type means that the Coxeter group of the indicated system is finite (Coxeter diagrams: edges, labels, components and finite type).
For spherical the restriction is an inner product on , the vectors () form the -dual basis, is a compact convex polyhedral cell of dimension with in its interior, and its nonempty faces are exactly the sets , , , each occurring for exactly one coset , with (Finite Coxeter orbit polytopes, face isometries and their cocycle).
Applied to the finite-type system and the point with (where denotes the mirror distance): every point of is a vertex of ; holds exactly when ; and with in the interior (The finite-type Coxeter cell: exposed faces and normal cones (4),(5)).
For a compact convex polyhedral cell with direction space and a face , the tangent cone is , equivalently the closure of , and, with , its normal face link carries the angular distance ; for a vertex , and this link is ; the spherical simplex of a positive-definite Gram matrix with diagonal is built from the cone on the unit vertices realizing (Spherical Gram simplices and angular links of Euclidean faces).
For each , Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2) identifies with the Coxeter system for the restricted matrix , whose Coxeter form is ; Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1) therefore gives positive definite if and only if is finite. The Davis complex has one cell for each and , its -cells are the elements , and the cell is identified with so that the -cell corresponds to (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)).
The spherical simplex is realized by the Gram construction, uniquely up to a linear isometry (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (i),(ii)).
An isometric polyhedral gluing is the quotient of the disjoint union of its cells along face isometries satisfying the cocycle condition, and it carries the chain metric and its angular links (Abstract isometric polyhedral gluings and the chain metric).
A finite spherical complex is large when all edge lengths are at least ; for a large complex the associated almost-negative matrix has off-diagonal entries the cosines of the edge lengths for adjacent vertices and for non-adjacent ones; the complex is metric flag when a pairwise adjacent set of vertices spans a simplex exactly when its cosine matrix is positive definite; and the link of a face carries the iterated Schur-complement Gram matrices (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links (1)-(4), Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
Under AC, every finite large metric flag complex is CAT(1) for its truncated angular metric. The proof uses compact geodesic components with their untruncated intrinsic spherical length metrics, then transfers the short comparison tests to the truncation (Finite large metric flag complexes are CAT(1)).
At a point in the relative interior of a face , for some the metric ball is isometric, preserving intrinsic lengths, to the ball of radius about in (The cone and join metrics and the local product chart of a polyhedral gluing (4)).
The face link has angular metric , with across components (The angular path metric, the Euclidean cone and spherical joins (2),(4)). CAT(1) requires geodesics only for pairs at distance and spherical comparison only for geodesic triangles of perimeter (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)); all sides of such a triangle are , by the triangle inequality.
The principal inverse cosine satisfies for every integer , and is strictly decreasing on (Principal inverse sine and inverse cosine, Signs, monotonicity intervals, and ranges of sine and cosine).
The inner product determines the distances on (Real and complex inner-product spaces and their induced length); a metric space and its isometries are as in the metric conventions, so a distance-preserving identification of two angular links is an isometry (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Isometry, isometric embedding, and the subspace metric on a subset).
The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).
Each connected component of a finite spherical complex, with its chain metric, is a compact proper complete length space whose metric topology is the weak topology; under AC, every two points in a component are joined by a minimizing geodesic. Between distinct components the path distance is , an auxiliary value replaced by in the truncated angular metric (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iii),(vi)).
Face links of spherical simplices are given by iterated normalized Schur complements; their angular metrics are the intrinsic round metrics, their face identifications are canonical, and distinct components use the auxiliary infinite path-distance convention before truncation (Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas (iv)-(vi)).
Proof
Given: The Axiom of Choice, a finite Coxeter matrix , the presented group with length , the Coxeter form and the representation on , a tuple of positive real numbers, and the spherical subsets with their cells .
Proof technique: direct.
Fix and . The vectors () are the -dual basis of and is an inner product, so ; the reflection formula of [F1] gives , that is . By [F4] the point is a vertex of the compact convex polyhedral cell of dimension , and the nonempty faces of are exactly the sets , one for each coset (, ).
By the inclusion criterion of [F5] a face contains exactly when , that is exactly when , i.e. , which forces . Hence the faces of through are precisely the sets , , so the faces of type through are precisely the segments , the straight segment from to because . In particular is the only -face of through of type , as asserted in (1).
The reflection formula in [F1] gives, for and , , , since . Every is a finite word in the generators and is a homomorphism, so composition proves . The facets of through are the faces for , by 1.1, 1.2 and the dimension statement in [F4]. Fix . Each generator fixes the quotient of by : the reflection formula gives and . Thus for every , and for . Pairing with the dual basis gives for every , so nondegeneracy of implies . Consequently for every such , and lies in the supporting hyperplane ; [F5] puts in the half-space . Since has dimension , it is exactly the equality face, and its inward normal is proportional to . By [F6], . Writing gives , so this is ; these generators are extreme because each nonnegative combination has -pairing , whereas .
If distinct , then is finite, so the order of is finite. The unit vectors in the positive-definite plane have inner product . Their local spherical edge length is therefore , by [F1], [F2], [F6], [F14].
For spherical , is an inner product by [F7], and the cell of the Davis complex is identified with so that corresponds to and the -cell , , corresponds to the unique -face of type through the vertex; the direction of this -cell at is therefore the ray by 1.1.
By [F6] the angular link of the vertex is , the unit sphere in (Real and complex inner-product spaces and their induced length); by 1.3 and 1.4 its vertices are the unit vectors with pairwise products , that is with Gram matrix . By the Gram construction [F8] the spherical simplex built on the unit vertices realizing is unique up to a linear isometry of its ambient inner product space; a linear isometry carrying its vertices to the maps it onto , and it preserves the angular distances , so it is an isometry of angular links [F15]. Moreover, for the face has vertex , and by the same computation applied to the finite-type system its link at is , the face of spanned by the vertices , , with the vertex map .
For distinct , every word in reduces using to an alternating word; if , each such word represents one of at most elements of the form or , so is finite. If , the element has infinite order by the Coxeter-matrix convention, so is infinite. Hence is an edge of exactly when . In that case its local edge-cell length is the value in 1.4; the direction of the -cell at is by 1.5. These rays and their local edge lengths are independent of the positive tuple . No global shortest-path equality in the whole link is used.
Fix . The cells of containing are the cells , , and the link of in is , identified with in 1.6; for the face corresponds to the face and its direction face at is . The cellulation glues these spherical simplices along those faces by the identity vertex maps , compatible for all inclusions; [F17] gives a chain metric on each connected component, with the weak topology, and auxiliary path distance between components. Truncating at gives a metric on the whole link with the same weak topology: balls of radius less than are exactly the componentwise intrinsic balls. The angular-link gluing of [F9] identifies this glued link with . By the cell statement in [F7], its cells are exactly the spherical subsets , with Gram matrices , glued along their common faces, so it is the finite spherical complex . The direction of corresponds to vertex of , and the cellwise link isometries induce the isometry of the glued polyhedral complexes and their truncated angular metrics by [F18].
By 2.1 every edge of has local length , so is large. For a pairwise adjacent set of vertices of , the cosine test matrix in [F10] is , including the empty matrix when . By [F7], is positive definite exactly when is finite, and by [F2] that is exactly when spans a simplex of . Thus is metric flag. The almost-negative matrix of [F10] equals : on edges its entry is by 2.1 and [F1], while on non-edges by 2.1 and the entry is . Therefore is a finite large metric flag complex with associated matrix .
Let and . For a spherical , use the -chart of its cell , so corresponds to . Its direction space is : orbit differences lie in by the reflection formula, and the differences span it. The facets containing are exactly the of step 1.3 with , by the face-inclusion criterion [F5]. Thus at a relative interior point of , [F6] gives . Let be the -orthogonal projection onto . Intersecting this cone with gives exactly the cone generated by : projection gives one inclusion, and subtracting the component of any such nonnegative combination gives the other. Their normalized Gram matrix is the Schur complement along from [F18], exactly the normal link of the face in . In these -charts the face maps of Finite Coxeter orbit polytopes, face isometries and their cocycle (3),(4) are for ; their derivatives are inclusions, and the projection onto agrees on . Thus they preserve the projected rays, and their cocycle makes the identifications agree on common cofaces. Consequently the link of is obtained by gluing these spherical face links for ; its vertices are exactly the for which is spherical, its cells are the with spherical, and its simplex Gram matrices are the iterated normalized Schur complements of along , by [F10] and [F18]. This is the face link . For it is , already finite large metric flag by step 3.1. For nonempty , each link simplex Gram matrix is positive definite by the Schur-complement identity. Its off-diagonal entries are nonpositive: eliminating one vertex from a current positive-definite Gram matrix with nonpositive off-diagonal entries replaces an off-diagonal entry by ; its new diagonal entries are positive by positive definiteness, and normalization by their positive square roots preserves signs. Repeating over the vertices of proves largeness of every link. To check metric flagness, let be any pairwise adjacent set in . Then is pairwise adjacent in . The link cosine matrix on is the positive-diagonal normalization of the Schur complement of in the matrix ; this follows entrywise from orthogonal projection off and the link formula [F18]. Since is positive definite, the block Schur-complement identity makes this link matrix positive definite exactly when is. By step 3.1 the latter is positive definite exactly when spans a simplex of , which is exactly when spans a simplex of the link. The empty set passes the empty-matrix convention in [F10]. Thus every cell link is again finite large metric flag. Finally, [F12] identifies a sufficiently small ball at a point in the relative interior of with the corresponding ball about in ; the link computation is independent of because its directions are the rays in step 2.1.
By step 3.1 and step 4.1, and every face link are finite large metric flag complexes. Under the stated AC assumption, [F11] therefore makes all these links CAT(1). Its compact short-loop argument uses the untruncated intrinsic geodesic metrics of the components supplied by [F17]. A pair at angular distance and every triangle of perimeter lie in one such component; all triangle sides are by [F13]. Distances between side points are at most half that perimeter, hence also , so the spherical comparison tests agree before and after truncation. This reconciles clause (6) with the completed supplier. AC is used only through [F17] and [F11]; the direct calculations make no further choice selections. Together with the preceding calculations this proves clauses (1)–(6), with the scope of (7).
Depends on
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization
- The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K)
- The finite-type Coxeter cell: exposed faces and normal cones
- Finite Coxeter orbit polytopes, face isometries and their cocycle
- Abstract isometric polyhedral gluings and the chain metric
- Spherical Gram simplices and angular links of Euclidean faces
- Gram realisations, radial normalisation, finite spherical complexes and link Gram formulas
- The angular path metric, the Euclidean cone and spherical joins
- Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles
- The cone and join metrics and the local product chart of a polyhedral gluing
- Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links
- Finite large metric flag complexes are CAT(1)
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- Coxeter diagrams: edges, labels, components and finite type
- Positive and negative definiteness, the inertia $(p,q,r)$, rank $p+q$, and signature $p-q$ of a real symmetric bilinear or quadratic form
- Real and complex inner-product spaces and their induced length
- Principal inverse sine and inverse cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Isometry, isometric embedding, and the subspace metric on a subset
- The Axiom of Choice
Used by
Dependency tree · two levels
185 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- M. W. Davis, The Geometry and Topology of Coxeter Groups, first-edition author manuscript, 2007-2008 (standard reference, not scraped)
- M. W. Davis and G. Moussong, Notes on nonpositively curved polyhedra, Turan Workshop notes (1998/1999) (standard reference, not scraped)
- M. W. Davis, The geometry and topology of Coxeter groups, MSC lecture slides (Tsinghua University, 2013) (standard reference, not scraped)
- G. Moussong, Hyperbolic Coxeter groups, PhD thesis (Ohio State University, 1988), J. McCammond transcription (standard reference, not scraped)
- P. Moller, A note on almost negative matrices and Gromov-hyperbolic Coxeter groups, arXiv:2205.07791v2 (2023) (standard reference, not scraped)
- M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, Grundlehren der mathematischen Wissenschaften 319, Springer 1999 (standard reference, not scraped)