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 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.
Depends on
- 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
- The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K)
- Finite Coxeter orbit polytopes, face isometries and their cocycle
- The Davis complex is simply connected
- The angular link of a vertex of the Davis complex is the large metric flag nerve
- Abstract isometric polyhedral gluings and the chain metric
- The chain metric is a metric, its topology is the weak topology, and the space is proper and complete
- Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics
- Finite large metric flag complexes are CAT(1)
- 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
- Berestovskii's cone criterion and the polyhedral link criterion
- Complete, simply connected, locally CAT(0) length spaces are CAT(0)
- Geodesics and geodesic metric spaces
- Complete metric space: every Cauchy sequence converges in the space
- Open cover, subcover, compact metric space, and compact subset of a metric space
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Simply connected topological spaces
- The Axiom of Choice
Used by
Dependency tree · two levels
148 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)
- 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. W. Davis, The geometry and topology of Coxeter groups, MSC lecture slides (Tsinghua University, 2013) (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)