Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 (S,m) be a Coxeter matrix with S finite, W the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let S, Σ and its cellulation by the cells wWT 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 d of that cellulation for a fixed tuple (ds)s∈S 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 U the angular link Lk⁡Σ(wWU) -- in particular every vertex link, for U=∅ -- is a finite large metric flag complex and is CAT(1) for its truncated angular metric.

(2) Σ is locally CAT(0). For every point x in the relative interior of a cell wWT there is ε>0 such that the metric ball B(x,ε) is isometric, preserving intrinsic lengths, to the ball of radius ε about (0,o) in R∣T∣×C(Lk⁡Σ(wWT)) (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 Lk⁡Σ(wWT) is CAT(1) by (1), the polyhedral link criterion makes Σ locally CAT(0) at x, 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 d (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 x to y is realized by a piecewise Euclidean path whose length is at most the length of that chain, while every path has length at least d(x,y) by the triangle inequality; hence d is the intrinsic path metric and (Σ,d) 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 (Σ,d) 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 x0 the geodesic contraction H ⁣:Σ×[0,1]→Σ, Ht(x) the point at distance t d(x0,x) from x0 on the unique geodesic from x0 to x, is continuous and satisfies d(Ht(x),Ht(y))≤t d(x,y) for all x,y and t∈[0,1] (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 ds; 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 (S,m), its presented group W, the cellular Davis realization Σ with its chain metric d for a fixed tuple (ds)s∈S of positive real numbers.

[F1]

For every spherical U and every w∈W, the angular link of the cell wWU is canonically isometric to the face link Lk⁡X(U), 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)).

[F2]

Product chart: for an isometric polyhedral gluing satisfying local finiteness and finitely many shapes, and a point p in the relative interior of a k-dimensional cell F, the connected component Xp of p carries its chain metric, and there is ε>0 such that BXp(p,ε) is isometric, preserving intrinsic lengths, to the ball of radius ε about (0,o) in Rk×C(Lk⁡X(F)) (The cone and join metrics and the local product chart of a polyhedral gluing (4)).

[F3]

Berestovskii and the polyhedral link criterion: the cone C(L) is CAT(0) if and only if the link (L,dπ) is CAT(1); and a connected isometric polyhedral gluing with its chain metric is locally CAT(0) at a point p in the relative interior of a face F if and only if Lk⁡X(F), 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)).

[F4]

The cellulation: the cells CwWT=CT of Finite Coxeter orbit polytopes, face isometries and their cocycle with the face isometries form an isometric polyhedral gluing of shape P satisfying (H1) connectedness, (H2) local finiteness and (H3) finitely many shapes; the cells are compact convex polyhedral cells of dimension ∣T∣; every point of Σ lies in the relative interior of exactly one cell; and the chain metric d 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)).

[F5]

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)).

[F6]

The chain metric is d(x,y)=inf⁡{ℓ(x0,…,xm)}, 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 x,y lie in a common cell then the one-step chain gives d(x,y)≤dp(x,y), 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).

[F7]

Assume the Axiom of Choice (The Axiom of Choice): for an isometric polyhedral gluing satisfying (H1)-(H3), every pair x,y is joined by a minimizing geodesic γ ⁣:[0,d(x,y)]→X with d(γ(s),γ(t))=∣s−t∣ (Under the Axiom of Choice, proper polyhedral spaces admit minimizing geodesics).

[F8]

The Davis complex Σ is simply connected (The Davis complex is simply connected).

[F9]

Globalization: if a metric space X is connected, complete, locally CAT(0), a length space and simply connected, then every two points of X are joined by exactly one local geodesic, which is minimizing; every geodesic triangle of X satisfies the CAT(0) inequality; and for every base point the geodesic contraction H is continuous with d(Ht(x),Ht(y))≤t d(x,y) for all x,y and t∈[0,1], so that X 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).

[F10]

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 x,y and every ε>0 there is a path from x to y of length <d(x,y)+ε; a local geodesic is a map that is distance-preserving in a neighbourhood of each parameter, and a geodesic segment is a map γ with d(γ(s),γ(t))=∣s−t∣, 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).

[F11]

The triangle inequality d(x,z)≤d(x,y)+d(y,z) holds in a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F12]

The Coxeter system (W,S) is the group presented by the involution relations s2=1 and the finite-label relations (st)m(s,t)=1, with S finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F13]

A subset T⊆S is spherical exactly when WT is finite, and the nerve L 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)).

[F14]

The Davis realization Σ=∣WS∣ is the order complex of the poset of spherical cosets; if S=∅, this poset has the sole element W∅={1}, so Σ is a point (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (2),(3)).

[F15]

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)).

[F16]

The angular link computation is independent of the positive tuple (ds), 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 (S,m), its presented group W, the Davis realization Σ with its chain metric d for a fixed tuple (ds)s∈S of positive real numbers.

Proof technique: direct.

1.1F1F10F12F13F14F15

Clause (1). Under the finite presentation and nerve conventions [F12,F13], if S=∅ then W={1}, S={∅} and the Davis realization is a point [F14]; its link is empty and is CAT(1) by [F10]. If ∣S∣=1, 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 S, let U be spherical and w∈W. Under the stated AC assumption, the A-page link computation [F1] identifies Lk⁡Σ(wWU) with Lk⁡X(U) and gives finite large metric flag links; the CAT(1) assertion is [F15].

1.2F2F4

Clause (2), the chart. Let x∈Σ. By [F4] the point x lies in the relative interior of exactly one cell wWT, of dimension ∣T∣, and the cellulation is an isometric polyhedral gluing satisfying (H2) and (H3); hence [F2] applied to F=wWT and k=∣T∣ gives ε>0 and an isometry, preserving intrinsic lengths, from B(x,ε) onto the ball of radius ε about (0,o) in R∣T∣×C(Lk⁡Σ(wWT)).

1.3F4F5

Clause (3), the metric. By [F4] the cellulation is connected, locally finite and has finitely many shapes, and its chain metric d 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].

1.4F4F6F10F11

Clause (3), the intrinsic metric. Let x,y∈Σ and let x=x0,x1,…,xm=y be a chain, with cells pi containing both xi−1 and xi and length ℓ(x0,…,xm)=∑i=1mdpi(xi−1,xi) [F6]. Each Cpi is a convex polyhedral cell of its Euclidean affine space [F4], so the straight segment from xi−1 to xi lies in Cpi. Parametrize each segment linearly on its allotted subinterval. For two parameter values on one segment, the one-step bound d(u,v)≤dpi(u,v) [F6] shows that this segment map is Lipschitz in d; the finite concatenation is therefore a continuous path γ from x to y. Refine any partition by the segment breakpoints; refinement cannot decrease the polygonal sum, and each refined summand lies in one common cell, so its d-distance is at most the Euclidean distance there [F6]. The sum on each straight piece is at most its Euclidean length, giving Ld(γ)≤ℓ(x0,…,xm) for path length Ld(γ)=sup⁡∑jd(γ(tj−1),γ(tj)) [F10]. Conversely, for every path δ and every partition, the triangle inequality [F11] gives ∑jd(δ(tj−1),δ(tj))≥d(x,y), hence Ld(δ)≥d(x,y). Taking infima over chains and paths and using d(x,y)=inf⁡chainsℓ [F6], the path-length infimum equals d(x,y); thus d is the intrinsic path metric and (Σ,d) is a length space [F10].

1.5F4F7F10

Clause (3), geodesics. Assume the Axiom of Choice, as recorded in [F7]. Since the cellulation satisfies (H1)-(H3) [F4], every two points x,y∈Σ are joined by a minimizing geodesic γ ⁣:[0,d(x,y)]→Σ with d(γ(s),γ(t))=∣s−t∣ [F7], so (Σ,d) is a geodesic metric space [F10]. The case x=y is the degenerate geodesic on [0,0] included in [F7].

2.1F3F10step 1.1

Clause (2), local CAT(0). By step 1.2 the point x lies in the relative interior of the cell wWT, and by step 1.1 the link Lk⁡Σ(wWT) is CAT(1) for its truncated angular metric, so the polyhedral link criterion [F3] shows that Σ is locally CAT(0) at x; since x∈Σ was arbitrary and local CAT(0) means that every point has a CAT(0) ball [F10], the space Σ is locally CAT(0).

3.1F8F9F10step 2.1step 1.3step 1.4

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 x0 the geodesic contraction H ⁣:Σ×[0,1]→Σ is continuous with d(Ht(x),Ht(y))≤t d(x,y); 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.

4.1F1F7F15F16step 1.1step 1.5∎

Clause (5) and the Choice bookkeeping. The conclusions hold for every finite-rank Coxeter system and every tuple (ds) of positive numbers: the link computations of step 1.1 are independent of the tuple by [F16] while the chain metric d 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

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