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.
Davis CAT(0) Geometry and Finite Subgroup Fixed Points
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Banach Alaoglu Goldstine and Krein Milman
- 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
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Covering Spaces and Lifting
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cw Complexes and Cellular Homology
- 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
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- 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
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Large Spherical Metric Flags and the Moussong Girth Theorem
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Locally Convex Spaces and Continuous Separation
- 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
- Parabolic Subgroups and Double Coset Geometry
- 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 Parabolic Cosets and the Davis Complex
- 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 Analytic Hahn Banach Theorem
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Group
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- 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
For a finite-rank Coxeter system, the Davis complex is built from its spherical-coset cells with their piecewise Euclidean metrics. The authored arguments on this page connect the metric geometry of those cells to finite-subgroup fixed points: first compute the spherical links, then assemble the local CAT(0) and global CAT(0) results, and finally place each finite subgroup inside the parabolic stabilizer of a fixed point's carrier cell.
The bounded-set center lemma is independent of the Coxeter construction: completeness and CAT(0) give a unique center, isometries preserving the set fix it, and common fixed sets are closed and convex, and are contractible when nonempty. Its proper-space branch proves the same conclusions without Choice. The Davis link lemma computes the spherical metric from the Coxeter form and identifies the finite links as large metric flag complexes. The CAT(0) theorem combines that link geometry with the local product charts, complete polyhedral metric and simple connectivity. The finite-subgroup theorem then uses orbit centers and the point-stabilizer formula in the carrier cell.
Items
Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces proves existence and uniqueness of centers for nonempty bounded sets in complete CAT(0) spaces, invariance under set-preserving isometries, and the structure of common fixed sets. Proper spaces use a choice-free compactness argument.
The angular link of a vertex of the Davis complex is the large metric flag nerve computes the vertex-link edge lengths and cosine Gram matrices, identifies higher links with face links, and proves the large metric-flag description. Its general CAT(1) clause depends on the finite metric-flag theorem.
The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem) assembles the local link and cone criteria, the intrinsic polyhedral metric, and simple connectivity to obtain the CAT(0) geometry and geodesic contraction of the finite-rank Davis complex.
Finite subgroups of a Coxeter group lie in spherical parabolics gives every finite subgroup a fixed point by its orbit center and identifies the point stabilizer in a minimum-representative cell chart. The subgroup is therefore contained in the spherical parabolic that setwise stabilizes the carrier cell.
The CAT(1) link route, globalization inputs, and Davis cell-incidence prerequisites are still being reconciled in the current frontier run. The corresponding item proofs state their exact conditional supplier uses; source reading alone is not treated as a substitute for those proofs.
Prerequisites and reading
Required earlier pages: spherical-parabolic-cosets-and-the-davis-complex, large-spherical-metric-flags-and-the-moussong-girth-theorem, relations-functions-and-quotients. The companion davis-cat-zero-geometry-and-finite-subgroup-fixed-points-examples tests these constructions and conventions. Exact item dependencies and source reading limits are recorded in research/coxeter-scaffold/inventory.json and research/plan-coxeter-groups-track.md.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces
Statement
Let be a CAT(0) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)) and let be a nonempty subset that is bounded, meaning that for some and (Open ball, closed ball and sphere in a metric space); thus is nonempty throughout. The radius function is finite-valued (Upper bound, least upper bound, and strict upper bound, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The Cauchy-sequence reals have the least-upper-bound property, Epsilon characterisation of the supremum). The infimum exists by Every nonempty set bounded below has an infimum and has the approximation property of Epsilon characterisation of the infimum. Assume the Axiom of Choice (The Axiom of Choice); it is used in clause (1) exactly to extract a minimizing sequence for , and clause (5) records that in the proper case no Choice is needed.
(1) The center of a bounded set (complete case). If is complete (Complete metric space: every Cauchy sequence converges in the space) then is continuous and its infimum is attained at a unique point , the center of ; moreover equals the radius of , the infimum of the numbers with for some , and for every . For finite the supremum defining is a maximum (Every nonempty finite set of reals has a maximum and a minimum).
(2) Isometric invariance. If an isometry of satisfies (Isometry, isometric embedding, and the subspace metric on a subset) then , hence permutes the set of minimizers of and, whenever the center of (1) exists, fixes it: . In particular, if is a group of isometries of a complete CAT(0) space with a bounded orbit , then every fixes the center of , so has a nonempty fixed set; every finite group of isometries has a bounded orbit (because ) and hence a fixed point.
(3) Fixed sets are closed and convex. For every isometry of the fixed set is closed (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement) and convex -- convex meaning that it contains, with any two of its points, every geodesic segment of joining them (Geodesics and geodesic metric spaces) -- and for every family of isometries the common fixed set is closed and convex. If , then with the induced metric is a CAT(0) space: it is convex, so the unique geodesic segment of between two of its points lies in and the comparison inequality is inherited; if in addition is complete then is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice), being a closed subset of the complete space . For every the geodesic contraction is well defined and continuous, satisfies , and for all ; in particular is contractible (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(a),(b), A nonempty space is contractible if and only if its identity map is nullhomotopic, Nullhomotopic maps and contractible spaces).
(4) Finite subgroups of isometries. If is a finite group acting on a complete CAT(0) space by isometries, or more generally a group of isometries of a complete CAT(0) space with a bounded orbit, then is nonempty by (1),(2), and by (3) it is closed, convex, complete and CAT(0) in the induced metric and contractible. In particular is a geodesic space and every two of its points are joined by a unique geodesic of lying in .
(5) Choice-free proper case. If is proper -- every closed bounded subset is compact (Open cover, subcover, compact metric space, and compact subset of a metric space) -- then for every nonempty bounded the center of (1) exists and is unique without the Axiom of Choice: for the set is closed and bounded, hence compact, , and the sets () form a family of closed subsets of the compact space with the finite intersection property, so by the compactness criterion for such families (Finite intersection property); any point of the intersection is a minimizer, and (6) gives uniqueness. Consequently, if is proper, then the conclusions of (1)-(4) hold with no use of Choice.
(6) The midpoint inequality and uniqueness. Let , let be the midpoint of a geodesic segment and let . Then (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(d)). Consequently two minimizers of , both of value , satisfy for the midpoint of and every the right-hand side is at least for every , so is at most its infimum over , which is by the supremum approximation property (Epsilon characterisation of the supremum); since , this gives . Hence the center is unique; and in (5) the point of has , so by the same computation it is the unique minimizer.
(7) Scope. The completeness hypothesis must remain: `CAT(0)' alone does not give the center, and the statement is not asserted for unbounded or for non-isometric group actions. No statement about beyond (2)-(4) is made.
Facts & Assumptions
Given: The Axiom of Choice, a CAT(0) space , a nonempty bounded subset with ; in (5) the space is also proper.
is geodesic, and the CAT(0) comparison inequality holds for every geodesic triangle of : a metric space is CAT(0) if it is geodesic and for every geodesic triangle in and all points of that triangle, (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).
In a CAT(0) space geodesic segments between two points are unique and vary continuously with their endpoints, so the point of depends continuously on the pair; if are geodesics with a common initial point and proportional parametrizations, then for (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).
For every pair in a CAT(0) space, every midpoint of a geodesic segment and every satisfy the midpoint inequality (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).
In ZF, without a choice axiom: if is complete and is closed in , then the subspace is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice).
A metric space is compact if and only if every family of its closed subsets with the finite intersection property has nonempty intersection (A metric space is compact if and only if every family of closed subsets with the finite intersection property has nonempty intersection).
A subset of a metric space is a compact subset of when the metric subspace is a compact metric space, being the restriction of to (Open cover, subcover, compact metric space, and compact subset of a metric space). Accordingly proper means, as in clause (5), that every closed bounded subset of is a compact subset in this sense.
The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).
The real numbers used as metric values are the Cauchy-sequence reals and have the least-upper-bound property (The real numbers, The Cauchy-sequence reals have the least-upper-bound property). Every nonempty bounded-below subset of has an infimum (Every nonempty set bounded below has an infimum); the epsilon characterisations of supremum and infimum supply values arbitrarily close to those bounds (Epsilon characterisation of the supremum, Epsilon characterisation of the infimum).
Every nonempty finite subset of has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum).
For every real some natural satisfies (For every in a complete ordered field there is a natural with ); in particular and .
Every nonempty subset of has a least element (The well-ordering principle).
Proof
Given: The Axiom of Choice, a CAT(0) space , and a nonempty bounded subset with ; in clause (5), is also proper.
Proof technique: direct.
For every and , the triangle inequality gives . The nonempty set of distances defining is therefore bounded above, so [F8] gives its finite supremum and . If is finite, the nonempty finite image has a maximum by [F9], so its supremum is attained for every . Also for every , so taking suprema in both directions gives (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, Upper bound, least upper bound, and strict upper bound); hence is continuous (Continuity of a map between metric spaces, at a point and globally, in the - form). The range is nonempty because implies , and it is bounded below by , so [F8] gives and . For fixed and , iff (Open ball, closed ball and sphere in a metric space); thus is the infimum of the admissible positive radii at , since every such radius is at least and every () is admissible. Let . For every , for its witnessing , so is a lower bound of . Conversely, for , [F8] gives with ; then is admissible and . Hence , the radius of .
Assume the Axiom of Choice. For each , the set is nonempty by the infimum approximation property [F8]; a choice function for yields a sequence with for every .
Midpoint inequality and uniqueness (clause (6)). Let , let be a midpoint of a geodesic segment and let ; [F3] gives the stated inequality. For any put . The nonnegative distances , , have supremum , and their squares have supremum : if they all vanish; if , for any use [F8] to find with , where , and then . Now let be minimizers with value , and let be the midpoint of their unique geodesic segment, which exists by [F1] and [F2]. For every , [F3] gives . The infimum over of the last right-hand side is by the square-supremum fact just proved; since , this gives . Thus , so any minimizer is unique.
Fixed sets (clause (3), first part). Let be an isometry of (Isometry, isometric embedding, and the subspace metric on a subset). If , put . For every with , the reverse triangle inequality and isometry property give . Thus a ball about each point outside lies in its complement, which is open by The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement; hence the fixed set is closed. The same argument applies to : if , some has , and the ball just constructed avoids ; if the family is empty then . Now if and is a geodesic segment from to (Geodesics and geodesic metric spaces), then is another geodesic from to , so it equals by uniqueness [F2]; hence is convex. Every common fixed set is an intersection of convex sets and is therefore convex.
Isometric invariance (clause (2), first part). Let be an isometry of with (Isometry, isometric embedding, and the subspace metric on a subset). Then , so for every the substitution gives ; hence maps the set of minimizers of onto itself.
Proper spaces are complete. Let be a Cauchy sequence in a proper space (Cauchy sequence in a metric space). For each , the Cauchy condition makes the set of indices satisfying for all nonempty; let be its least member, which exists by [F11] and requires no choice. Then for . Every closed ball is closed: if , the radius gives whenever , so the complement is open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Open ball, closed ball and sphere in a metric space). Hence the closed balls and are closed and bounded, thus compact by properness [F6]. Each lies in : , so for . The sets are closed in by the same ball argument and have the finite intersection property: the empty finite intersection is , which contains , and for any nonempty finite subfamily, if is its largest index then for every index . By [F5] applied in there is . For , ; given any rational , [F10] supplies with , so (Convergence of a sequence in a metric space: iff in ) and is complete (Complete metric space: every Cauchy sequence converges in the space).
Proper case, compactness (clause (5), first part). Assume now that is proper, and fix . For any real , the sublevel set is closed: if , continuity from step 1.1 gives such that implies , and then ; its complement is therefore open (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). In particular is closed. It is bounded: for a fixed , every satisfies , so (Open ball, closed ball and sphere in a metric space). Hence is compact by properness [F6]. If , then and . If , then for every put ; by the infimum approximation property [F8] there is with and , so . Thus for every , while since ; hence .
The minimizing sequence is Cauchy (clause (1), first part). For , let be the midpoint of the unique geodesic from to ([F1], [F2]). Applying [F3] to each and using the square-supremum fact from step 1.3 gives . Hence , since and step 1.2 bounds the selected radii. The final expression tends to as by [F10], so is Cauchy (Cauchy sequence in a metric space).
The fixed set is CAT(0) and carries a contraction (clause (3), second part). Let be the common fixed set of a family of isometries. By convexity from step 1.4, the unique geodesic of between two points of lies in (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Geodesics and geodesic metric spaces), so with the induced metric is geodesic and inherits the CAT(0) comparison inequality; if is complete, then is closed by step 1.4 and complete by [F4]. For , define to be the point at fraction of the unique geodesic from to . Convexity makes , and is constant at while . For and , [F2] gives and the geodesic parametrization gives ; therefore , which proves joint continuity at every . Thus is a homotopy from the constant map at to the identity, and is contractible by A nonempty space is contractible if and only if its identity map is nullhomotopic and Nullhomotopic maps and contractible spaces.
Proper case, the center without Choice (clause (5), second part). In the notation of step 2.1, the sets , , are closed subsets of compact by the sublevel-set argument of step 2.1, and are nested. Each is nonempty because ; the empty finite intersection is , which contains , and any nonempty finite intersection is the set with the largest index in it. Thus has the finite intersection property (Finite intersection property). By [F5] there is . If , choose with using [F10]; then , a contradiction. Since , we get , and step 1.3 gives uniqueness. The family is defined by a formula, so this proper-space argument uses no choice principle.
Attainment in the complete case (clause (1), second part). If is complete, the Cauchy sequence from step 2.2 converges to some (Complete metric space: every Cauchy sequence converges in the space, Convergence of a sequence in a metric space: iff in ); continuity of from step 1.1 gives , because and [F10] makes the error tend to . Thus the infimum is attained.
Clause (1) concluded. Assume complete; let be the point of step 3.2 and the infimum. Then for every ; step 1.1 identifies with the radius of . If is finite, its nonempty finite image under has a maximum by [F9], so the supremum defining is that maximum; uniqueness follows from step 1.3. This proves (1).
Clauses (2) and (4) concluded. Let be complete and let be the center of as in step 4.1, and let be an isometry with ; by step 1.5 the isometry permutes the minimizers of , and since is the unique minimizer by step 4.1, . Hence a group of isometries with bounded orbit has , because every satisfies and fixes . A finite group has a finite nonempty orbit, and its finite set of distances from any point has a maximum by [F9], so that orbit is bounded and it too has a fixed point. By step 2.3 the set is closed, convex, complete and CAT(0) in the induced metric, and contractible; it is a geodesic space whose points are joined by the geodesic segments of lying in , unique by [F2]. This proves (2) and (4).
Clause (5) concluded, and the proof. Let be proper. By steps 2.1 and 3.1 the center of every nonempty bounded exists and is unique, produced by the finite intersection property and not by the sequence of step 1.2, so no Choice is used; by step 1.6 a proper space is complete. Hence the assertions of (1) hold for with no use of Choice, by the argument of step 4.1 with the center of step 3.1 in place of the attained minimizer of step 3.2, and the assertions of (2), (3) and (4) follow by the same steps 1.4, 1.5 and 2.3, none of which uses Choice: the only use of the Axiom of Choice in this proof is the extraction of the minimizing sequence in step 1.2, which is needed only when is complete but not proper. Thus the conclusions of (1)-(4) hold for proper without Choice.
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).
The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem)
Statement
Let be a Coxeter matrix with finite, the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let , and its cellulation by the cells be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization and The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K), with the chain metric of that cellulation for a fixed tuple of positive real numbers (Finite Coxeter orbit polytopes, face isometries and their cocycle). Assume the Axiom of Choice (The Axiom of Choice); it is used in (1) through the A-page link lemma, including its finite spherical-link construction and CAT(1) theorem, and in (3) through Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics. Then:
(1) Every link of is CAT(1). By The angular link of a vertex of the Davis complex is the large metric flag nerve (5),(6), for every spherical the angular link -- in particular every vertex link, for -- is a finite large metric flag complex and is CAT(1) for its truncated angular metric.
(2) is locally CAT(0). For every point in the relative interior of a cell there is such that 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, Berestovskii's cone criterion and the polyhedral link criterion (ii)); since is CAT(1) by (1), the polyhedral link criterion makes locally CAT(0) at , hence locally CAT(0) everywhere (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)).
(3) Complete geodesic metric and length space. is a connected isometric polyhedral gluing of the shape of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1) with finitely many shapes and local finiteness; its chain metric (Abstract isometric polyhedral gluings and the chain metric) is a proper and complete metric inducing the weak topology (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete (1)-(3), Complete metric space: every Cauchy sequence converges in the space, Open cover, subcover, compact metric space, and compact subset of a metric space). Since the cells are convex Euclidean cells, every chain from to is realized by a piecewise Euclidean path whose length is at most the length of that chain, while every path has length at least by the triangle inequality; hence is the intrinsic path metric and is a length space. With the Axiom of Choice, every two points of are joined by a minimizing geodesic (Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics), so is even a geodesic space (Geodesics and geodesic metric spaces).
(4) Global CAT(0). is simply connected (The Davis complex is simply connected, Simply connected topological spaces). Being connected, complete, a length space and locally CAT(0), it satisfies the CAT(0) inequality for every geodesic triangle; every two points are joined by exactly one geodesic, which is minimizing; and for every base point the geodesic contraction , the point at distance from on the unique geodesic from to , is continuous and satisfies for all and (Complete, simply connected, locally CAT(0) length spaces are CAT(0) (i)-(iii), Continuity of a map between metric spaces, at a point and globally, in the - form). In particular is contractible.
(5) Scope. The conclusions hold for every finite-rank Coxeter system, in particular for infinite, noncrystallographic and non-right-angled systems, and for every choice of the positive numbers ; the metric does depend on that choice while the CAT(0) property does not. No word hyperbolicity, automaticity, flat-subspace or finite-subgroup statement is asserted here.
Facts & Assumptions
Given: The Axiom of Choice, a finite Coxeter matrix , its presented group , the cellular Davis realization with its chain metric for a fixed tuple of positive real numbers.
For every spherical and every , the angular link of the cell is canonically isometric to the face link , and every such higher link is a finite large metric flag complex (The angular link of a vertex of the Davis complex is the large metric flag nerve (3)-(5)).
Product chart: for an isometric polyhedral gluing satisfying local finiteness and finitely many shapes, and a point in the relative interior of a -dimensional cell , the connected component of carries its chain metric, and there is such that 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)).
Berestovskii and the polyhedral link criterion: the cone is CAT(0) if and only if the link is CAT(1); and a connected isometric polyhedral gluing with its chain metric is locally CAT(0) at a point in the relative interior of a face if and only if , with its truncated metric, is CAT(1) (Berestovskii's cone criterion and the polyhedral link criterion (i),(ii), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3),(4)).
The cellulation: the cells of Finite Coxeter orbit polytopes, face isometries and their cocycle with the face isometries form an isometric polyhedral gluing of shape satisfying (H1) connectedness, (H2) local finiteness and (H3) finitely many shapes; the cells are compact convex polyhedral cells of dimension ; every point of lies in the relative interior of exactly one cell; and the chain metric is a metric on with the weak topology for which is complete and proper (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)).
For an isometric polyhedral gluing satisfying (H1)-(H3) the chain metric is a metric inducing the weak topology, every closed bounded subset is compact and the space is complete (The chain metric is a metric, its topology is the weak topology, and the space is proper and complete (1)-(3)).
The chain metric is , the infimum of the lengths of chains, where a chain is a finite sequence of points with consecutive points in a common cell and is the sum of the cell distances; if lie in a common cell then the one-step chain gives , but equality can fail because a chain may leave the cell and return with smaller total length (Abstract isometric polyhedral gluings and the chain metric).
Assume the Axiom of Choice (The Axiom of Choice): for an isometric polyhedral gluing satisfying (H1)-(H3), every pair is joined by a minimizing geodesic with (Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics).
The Davis complex is simply connected (The Davis complex is simply connected).
Globalization: if a metric space is connected, complete, locally CAT(0), a length space and simply connected, then every two points of are joined by exactly one local geodesic, which is minimizing; every geodesic triangle of satisfies the CAT(0) inequality; and for every base point the geodesic contraction is continuous with for all and , so that is CAT(0) and contractible (Complete, simply connected, locally CAT(0) length spaces are CAT(0) (i)-(iii), Continuity of a map between metric spaces, at a point and globally, in the - form).
Conventions: a metric space is CAT(0) if it is geodesic and every geodesic triangle satisfies the Euclidean comparison inequality, and locally CAT(0) if every point has a closed ball that is CAT(0); it is a length space if for all and every there is a path from to of length ; a local geodesic is a map that is distance-preserving in a neighbourhood of each parameter, and a geodesic segment is a map with , so that every geodesic segment is a minimizing local geodesic (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3),(5),(6), Geodesics and geodesic metric spaces).
The triangle inequality holds in a metric space (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
The Coxeter system is the group presented by the involution relations and the finite-label relations , with finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
A subset is spherical exactly when is finite, and the nerve has the nonempty spherical subsets as simplices together with the empty simplex (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).
The Davis realization is the order complex of the poset of spherical cosets; if , this poset has the sole element , so is a point (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (2),(3)).
Under AC, the A-page link lemma clause (6) asserts that all vertex and cell links are CAT(1); this clause depends on the general CAT(1) theorem for finite large metric flag complexes, whose AC-qualified proof uses untruncated intrinsic component metrics and transfers the short tests to the angular truncation (The angular link of a vertex of the Davis complex is the large metric flag nerve (6), Finite large metric flag complexes are CAT(1)).
The angular link computation is independent of the positive tuple , although the Euclidean cell metrics may depend on it (The angular link of a vertex of the Davis complex is the large metric flag nerve (7)).
Proof
Given: The Axiom of Choice, a finite Coxeter matrix , its presented group , the Davis realization with its chain metric for a fixed tuple of positive real numbers.
Proof technique: direct.
Clause (1). Under the finite presentation and nerve conventions [F12,F13], if then , and the Davis realization is a point [F14]; its link is empty and is CAT(1) by [F10]. If , the vertex links are singletons and the link of the open one-cell is empty, so these links are CAT(1) by [F10]. For general finite , let be spherical and . Under the stated AC assumption, the A-page link computation [F1] identifies with and gives finite large metric flag links; the CAT(1) assertion is [F15].
Clause (2), the chart. Let . By [F4] the point lies in the relative interior of exactly one cell , of dimension , and the cellulation is an isometric polyhedral gluing satisfying (H2) and (H3); hence [F2] applied to and gives and an isometry, preserving intrinsic lengths, from onto the ball of radius about in .
Clause (3), the metric. By [F4] the cellulation is connected, locally finite and has finitely many shapes, and its chain metric is a metric inducing the weak topology for which is complete and proper; the same three assertions for an isometric polyhedral gluing with (H1)-(H3) are clause (1)-(3) of [F5].
Clause (3), the intrinsic metric. Let and let be a chain, with cells containing both and and length [F6]. Each is a convex polyhedral cell of its Euclidean affine space [F4], so the straight segment from to lies in . Parametrize each segment linearly on its allotted subinterval. For two parameter values on one segment, the one-step bound [F6] shows that this segment map is Lipschitz in ; the finite concatenation is therefore a continuous path from to . Refine any partition by the segment breakpoints; refinement cannot decrease the polygonal sum, and each refined summand lies in one common cell, so its -distance is at most the Euclidean distance there [F6]. The sum on each straight piece is at most its Euclidean length, giving for path length [F10]. Conversely, for every path and every partition, the triangle inequality [F11] gives , hence . Taking infima over chains and paths and using [F6], the path-length infimum equals ; thus is the intrinsic path metric and is a length space [F10].
Clause (3), geodesics. Assume the Axiom of Choice, as recorded in [F7]. Since the cellulation satisfies (H1)-(H3) [F4], every two points are joined by a minimizing geodesic with [F7], so is a geodesic metric space [F10]. The case is the degenerate geodesic on included in [F7].
Clause (2), local CAT(0). By step 1.2 the point lies in the relative interior of the cell , and by step 1.1 the link is CAT(1) for its truncated angular metric, so the polyhedral link criterion [F3] shows that is locally CAT(0) at ; since was arbitrary and local CAT(0) means that every point has a CAT(0) ball [F10], the space is locally CAT(0).
Clause (4). The space is simply connected [F8]; it is connected and complete by step 1.3, locally CAT(0) by step 2.1, and a length space by step 1.4, so the globalization theorem [F9] applies. It gives that every two points of are joined by exactly one local geodesic, which is minimizing, that every geodesic triangle satisfies the CAT(0) inequality, so that is CAT(0) [F10], and that for every base point the geodesic contraction is continuous with ; in particular is contractible. Since a geodesic segment is a local geodesic by [F10], every geodesic segment joining two points of is the unique local geodesic provided by [F9], so every two points are joined by exactly one geodesic, which is minimizing.
Clause (5) and the Choice bookkeeping. The conclusions hold for every finite-rank Coxeter system and every tuple of positive numbers: the link computations of step 1.1 are independent of the tuple by [F16] while the chain metric depends on it, and no word hyperbolicity, automaticity, flat-subspace or finite-subgroup statement is asserted. The Axiom of Choice is used exactly in step 1.5 through [F7] for minimizing geodesics, and in step 1.1 through the A-page link lemma [F1,F15], whose construction of spherical links and general CAT(1) conclusion both use Choice. The chart step 1.2, the local CAT(0) step 2.1, the metric and intrinsic-metric steps 1.3-1.4, the globalization step 3.1 and the uniqueness statements used there are choice-free consequences of the cited items.
Remarks
Supplier uses reconciled. The AC-qualified angular-link lemma supplies CAT(1) in step 1.1; its finite large metric flag theorem works on untruncated intrinsic geodesic components before transferring the short tests. The product-ball chart is used in step 1.2, and the completed Berestovskii/polyhedral-link criterion gives local CAT(0) in step 2.1. The corrected Davis cellulation supplies the finite-shape, local-finiteness and metric hypotheses, and the simply-connectedness theorem supplies step 3.1. That step uses the completed local-to-global theorem with all of its connectedness, completeness, length-space and local CAT(0) hypotheses verified above. These mathematical reconciliations do not record or refresh engine decisions.
Finite subgroups of a Coxeter group lie in spherical parabolics
Statement
Let be a Coxeter matrix with finite and the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). For put (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1), The subgroup generated by a subset, the cyclic subgroup , and cyclic groups) and call spherical when is finite; write for the set of spherical subsets. Let be the Davis realization with cells for , the point-stabilizer formula and the chain metric of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) and The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem). A spherical parabolic is a conjugate with . Assume the Axiom of Choice (The Axiom of Choice); this is required through The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem) for its CAT(0) conclusion. The proper-space branch of Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces used for finite orbits in (1) requires no additional Choice; no Choice is used in (2) or (3).
(1) Fixed points of finite subgroups. Every finite subgroup has a fixed point on : for any the orbit is finite, hence bounded, and its center (Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (1),(2)) is fixed by every . Moreover the fixed set is nonempty, closed, convex, complete and CAT(0) in the induced metric, and contractible with a continuous geodesic contraction to each of its points (Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (3),(4), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)).
(2) Point stabilizers are spherical parabolics. Every point of lies in the relative interior of exactly one cell (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)); let be the unique minimum-length representative of (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)). Since is spherical, is a finite-type Coxeter system, and the chamber tiling of its reflection space partitions into relative interiors of chamber faces (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), The canonical reflection homomorphism, roots, reflections, and the positive cone, The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset, The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(3),(4)). Thus if is in the relative interior of and has coordinate in the -chart, where and , then (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)). Because and is finite, is finite; hence this point stabilizer is a spherical parabolic and is contained in the setwise stabilizer of .
(3) Containment in a spherical parabolic. Every finite subgroup is contained in a spherical parabolic. Choose an -fixed point by (1), let be its unique carrier cell, and let , , , be as in (2). Then the last equality holds because and is a subgroup. Since is finite, is a spherical parabolic. One may take this parabolic to be the setwise stabilizer of the unique carrier cell of .
(4) Scope and abstentions. The statements hold for every finite-rank Coxeter system, including infinite and noncrystallographic ones; the finite subgroup , the conjugating element and the spherical type all exist without any finiteness or crystallographic hypothesis on . No assertion is made here about the conjugacy classes or the number of finite subgroups, about virtual torsion-freeness or residual finiteness, about automaticity, flat subspaces, Moussong hyperbolicity or about the visual boundary, and no alternative proof route is used as a supplier in this item.
Facts & Assumptions
Given: The Axiom of Choice, a finite Coxeter matrix , its presented group , the spherical subsets , the Davis realization with its cellulation and its CAT(0) chain metric, and a finite subgroup .
For a complete CAT(0) space and a nonempty bounded , under AC there is a unique center minimizing ; every isometry with fixes ; every group of isometries with a bounded orbit has a nonempty fixed set; and common fixed sets are closed and convex; when nonempty, they are complete and CAT(0) in the induced metric, and contractible with a continuous geodesic contraction to each of their points. If is proper, clauses (1)-(4) hold without Choice by the proper-space branch (Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (1)-(5), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)).
The Davis complex has an isometric cellular -action; its cells are indexed by spherical cosets , and every point lies in the relative interior of exactly one cell. If is the minimum-length representative, the coordinate chart determined by gives the point-stabilizer formula whenever the cell coordinate lies in the relative interior of (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)-(3), Left and right cosets and of a subgroup).
If , then because both are generated by their indicated subsets; if is finite then is finite, and conjugation preserves this inclusion. Also , so the empty type is spherical. Thus for spherical , is a spherical standard parabolic and any conjugate of it lies in the corresponding conjugate of (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1), The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
The space with its chain metric is connected, proper, complete and CAT(0), and every two of its points are joined by exactly one minimizing geodesic (The Davis complex of a finite-rank Coxeter system is CAT(0) (Moussong's theorem) (3),(4), Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)).
The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).
Every nonempty finite subset of the real numbers has a maximum (Every nonempty finite set of reals has a maximum and a minimum); distances in a metric space are real numbers (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric).
For every spherical , the restricted parabolic is a finite-type Coxeter system, and in its reflection space the relative interiors of the finite-type chamber faces partition , including the rank-zero case (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset, The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(3),(4)).
Every subgroup contains the identity element (Subgroup).
The Coxeter group is generated by with relations ; for this gives , and for every word reduces to or (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Proof
Given: The Axiom of Choice, a finite Coxeter matrix , its presented group , the spherical subsets , the Davis realization with its cellulation and CAT(0) chain metric, and a finite subgroup .
Proof technique: direct.
Clause (1). By [F3,F9], is spherical, so its coset is a vertex of by [F2]. If , then and this is the only cell; , its orbit is of radius , and its fixed set is . If , [F9] shows that is finite, so the full standard parabolic already contains every . In all ranks, the orbit is nonempty because contains the identity [F8], and finite because it is the image of the finite set . Its distances from form a finite set of real numbers, so [F6] gives a maximum and . When , this gives and , with center . The -action is isometric by [F2], and is proper, complete and CAT(0) by [F4]; hence the choice-free proper branch of the circumcenter lemma [F1] gives the unique center of . Each preserves , so it fixes by [F1]; thus fixes and is nonempty. The fixed-set clause of [F1] gives that is closed, convex, complete and CAT(0) in the induced metric, and contractible with a continuous geodesic contraction to each of its points.
Clause (2), the carrier cell. By [F2], every point of lies in the relative interior of exactly one cell ; hence each point has a unique carrier cell.
Clause (2), the stabilizer formula. Let be a cell and a point in its relative interior, with coordinate in the chart determined by . By [F7], there is a unique chamber face whose relative interior contains , including the full chamber face and its lower-dimensional faces. The stabilizer formula of [F2] gives ; since and is finite, [F3] shows this is a finite spherical parabolic contained in .
Clause (3). Let be finite and choose an -fixed point by step 1.1; let be its unique carrier cell by step 1.2. With , , , as in step 1.3, the stabilizer formula of [F2] gives . Every fixes , so by [F3]. Since is finite, this cell stabilizer is a spherical parabolic; the carrier cell is unique by step 1.2.
Clause (4) and the Choice bookkeeping. The finite subgroup , its containing spherical parabolic and the cell were obtained in step 2.1 with no finiteness or crystallographic hypothesis on beyond finite, so the statements hold for every finite-rank Coxeter system; the listed abstentions delimit the result. In this proof, AC is required only through [F4], the CAT(0) theorem; although [F1] has a general AC branch, step 1.1 uses its proper-space branch because [F4] gives properness, and that branch is choice-free. The chamber-face and stabilizer calculations in steps 1.2-2.1 use no Choice.
Remarks
- The point-stabilizer formula is the chamber-face formula. The naive reading with is false: in with let , so that and , whence ; but because , so fixes and . The formula recorded in clause (2) is the chamber-face formula of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2), which computes the correct conjugate through the chamber containing .
5 · Examples, counterexamples and false statements
None yet.
Sources
- M. W. Davis, The Geometry and Topology of Coxeter Groups, first-edition author manuscript, 2007-2008
- M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, Grundlehren der mathematischen Wissenschaften 319, Springer 1999
- M. W. Davis and G. Moussong, Notes on nonpositively curved polyhedra, Turan Workshop notes (1998/1999)
- M. W. Davis, The geometry and topology of Coxeter groups, MSC lecture slides (Tsinghua University, 2013)
- G. Moussong, Hyperbolic Coxeter groups, PhD thesis (Ohio State University, 1988), J. McCammond transcription
- P. Moller, A note on almost negative matrices and Gromov-hyperbolic Coxeter groups, arXiv:2205.07791v2 (2023)