Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Davis CAT(0) Geometry and Finite Subgroup Fixed Points

1 · Prerequisites

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

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces

Statement

Let X be a CAT(0) space (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (3)) and let Y⊆X be a nonempty subset that is bounded, meaning that Y⊆B‾(x0,R) for some x0∈X and R>0 (Open ball, closed ball and sphere in a metric space); thus X is nonempty throughout. The radius function rY ⁣:X→[0,∞),rY(x):=sup⁡{ d(x,y):y∈Y } is finite-valued (Upper bound, least upper bound, and strict upper bound, Metric space: d(x,y)=0 iff x=y, 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 a:=inf⁡XrY 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 rY, and clause (5) records that in the proper case no Choice is needed.

(1) The center of a bounded set (complete case). If X is complete (Complete metric space: every Cauchy sequence converges in the space) then rY is continuous and its infimum a:=inf⁡XrY is attained at a unique point c∈X, the center of Y; moreover a equals the radius of Y, the infimum of the numbers r>0 with Y⊆B‾(x,r) for some x∈X, and d(c,y)≤a for every y∈Y. For finite Y the supremum defining rY is a maximum (Every nonempty finite set of reals has a maximum and a minimum).

(2) Isometric invariance. If an isometry φ of X satisfies φ(Y)=Y (Isometry, isometric embedding, and the subspace metric on a subset) then rY∘φ=rY, hence φ permutes the set of minimizers of rY and, whenever the center of (1) exists, fixes it: φ(c)=c. In particular, if G is a group of isometries of a complete CAT(0) space with a bounded orbit Y=Gx0, then every g∈G fixes the center c of Y, so G has a nonempty fixed set; every finite group of isometries has a bounded orbit (because X≠∅) and hence a fixed point.

(3) Fixed sets are closed and convex. For every isometry φ of X the fixed set Fix⁡(φ) 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 X joining them (Geodesics and geodesic metric spaces) -- and for every family (φi)i∈I of isometries the common fixed set C=⋂i∈IFix⁡(φi) is closed and convex. If C≠∅, then C with the induced metric is a CAT(0) space: it is convex, so the unique geodesic segment of X between two of its points lies in C and the comparison inequality is inherited; if in addition X is complete then C is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice), being a closed subset of the complete space X. For every p∈C the geodesic contraction H ⁣:C×[0,1]→C,Ht(x):=the point of [p,x] at distance t d(p,x) from p, is well defined and continuous, satisfies H0≡p, H1=id⁡C and d(Ht(x),Ht(y))≤t d(x,y) for all x,y∈C; in particular C 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 G is a finite group acting on a complete CAT(0) space X by isometries, or more generally a group of isometries of a complete CAT(0) space with a bounded orbit, then Fix⁡(G)=C is nonempty by (1),(2), and by (3) it is closed, convex, complete and CAT(0) in the induced metric and contractible. In particular C is a geodesic space and every two of its points are joined by a unique geodesic of X lying in C.

(5) Choice-free proper case. If X 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 Y the center of (1) exists and is unique without the Axiom of Choice: for x0∈X the set K:={x∈X:rY(x)≤rY(x0)} is closed and bounded, hence compact, a=inf⁡KrY, and the sets Kn:={x∈K:rY(x)≤a+1/n} (n≥1) form a family of closed subsets of the compact space K with the finite intersection property, so ⋂nKn≠∅ by the compactness criterion for such families (Finite intersection property); any point of the intersection is a minimizer, and (6) gives uniqueness. Consequently, if X is proper, then the conclusions of (1)-(4) hold with no use of Choice.

(6) The midpoint inequality and uniqueness. Let y,y′∈X, let m be the midpoint of a geodesic segment [y,y′] and let z∈X. Then d(z,m)2≤12(d(z,y)2+d(z,y′)2)−14d(y,y′)2 (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (iv)(d)). Consequently two minimizers c,c′ of rY, both of value a, satisfy for m the midpoint of [c,c′] and every z∈Y d(c,c′)2≤2(d(z,c)2+d(z,c′)2)−4d(z,m)2≤4a2−4d(z,m)2; the right-hand side is at least d(c,c′)2 for every z∈Y, so d(c,c′)2 is at most its infimum over z∈Y, which is 4a2−4rY(m)2 by the supremum approximation property (Epsilon characterisation of the supremum); since rY(m)≥a, this gives d(c,c′)2≤0. Hence the center is unique; and in (5) the point of ⋂nKn has rY=a, 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 Y or for non-isometric group actions. No statement about G beyond (2)-(4) is made.

Facts & Assumptions

Given: The Axiom of Choice, a CAT(0) space X, a nonempty bounded subset Y⊆X with Y⊆B‾(x0,R); in (5) the space X is also proper.

[F1]

X is geodesic, and the CAT(0) comparison inequality holds for every geodesic triangle of X: a metric space X is CAT(0) if it is geodesic and for every geodesic triangle in X and all points x,y of that triangle, d(x,y)≤d2(xˉ,yˉ) (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles).

[F2]

In a CAT(0) space geodesic segments between two points are unique and vary continuously with their endpoints, so the point of [p,x] depends continuously on the pair; if γ,δ are geodesics with a common initial point and proportional parametrizations, then d(γ(t),δ(t))≤(1−t)d(γ(0),δ(0))+t d(γ(1),δ(1)) for t∈[0,1] (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

[F3]

For every pair y,y′ in a CAT(0) space, every midpoint m of a geodesic segment [y,y′] and every z satisfy the midpoint inequality d(z,m)2≤12(d(z,y)2+d(z,y′)2)−14d(y,y′)2 (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences).

[F4]

In ZF, without a choice axiom: if (X,d) is complete and A is closed in (X,d), then the subspace (A,dA) is complete (Closed subspaces of complete metric spaces are complete; the converse under countable choice).

[F5]

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

[F6]

A subset A of a metric space X is a compact subset of X when the metric subspace (A,dA) is a compact metric space, dA being the restriction of d to A×A (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 X is a compact subset in this sense.

[F7]

The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F8]

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

[F9]

Every nonempty finite subset of R has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum).

[F10]

For every real ε>0 some natural n≥1 satisfies 1/n<ε (For every ε>0 in a complete ordered field there is a natural n≥1 with 1/n<ε); in particular 1/(n+1)→0 and 2/n→0.

[F11]

Every nonempty subset of N has a least element (The well-ordering principle).

Proof

Given: The Axiom of Choice, a CAT(0) space X, and a nonempty bounded subset Y⊆X with Y⊆B‾(x0,R); in clause (5), X is also proper.

Proof technique: direct.

1.1F8F9givenalgebra

For every x∈X and y∈Y, the triangle inequality gives d(x,y)≤d(x,x0)+d(x0,y)≤d(x,x0)+R. The nonempty set of distances defining rY(x) is therefore bounded above, so [F8] gives its finite supremum and rY(x)≤d(x,x0)+R. If Y is finite, the nonempty finite image {d(x,y):y∈Y} has a maximum by [F9], so its supremum is attained for every x. Also ∣d(x,y)−d(x′,y)∣≤d(x,x′) for every y∈Y, so taking suprema in both directions gives ∣rY(x)−rY(x′)∣≤d(x,x′) (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric, Upper bound, least upper bound, and strict upper bound); hence rY is continuous (Continuity of a map between metric spaces, at a point and globally, in the ε-δ form). The range {rY(x):x∈X} is nonempty because Y≠∅ implies X≠∅, and it is bounded below by 0, so [F8] gives a:=inf⁡XrY and 0≤a≤rY(x0). For fixed x and r>0, Y⊆B‾(x,r) iff rY(x)≤r (Open ball, closed ball and sphere in a metric space); thus rY(x) is the infimum of the admissible positive radii at x, since every such radius is at least rY(x) and every rY(x)+ε (ε>0) is admissible. Let R:={r>0:∃x∈X, Y⊆B‾(x,r)}. For every r∈R, a≤rY(x)≤r for its witnessing x, so a is a lower bound of R. Conversely, for ε>0, [F8] gives x with rY(x)<a+ε/2; then r:=rY(x)+ε/2>0 is admissible and r<a+ε. Hence inf⁡R=a, the radius of Y.

1.2F7F8choose

Assume the Axiom of Choice. For each n∈N, the set An:={x∈X:rY(x)<a+1/(n+1)} is nonempty by the infimum approximation property [F8]; a choice function for (An)n∈N yields a sequence (xn)n∈N with rY(xn)<a+1/(n+1) for every n.

1.3F1F2F3F8algebra

Midpoint inequality and uniqueness (clause (6)). Let y,y′∈X, let m be a midpoint of a geodesic segment [y,y′] and let z∈X; [F3] gives the stated inequality. For any q∈X put r:=rY(q). The nonnegative distances d(z,q), z∈Y, have supremum r, and their squares have supremum r2: if r=0 they all vanish; if r>0, for any ε>0 use [F8] to find z with r−δ<d(z,q)≤r, where δ:=ε/(2r+1), and then 0≤r2−d(z,q)2<2rδ<ε. Now let c,c′ be minimizers with value a, and let m be the midpoint of their unique geodesic segment, which exists by [F1] and [F2]. For every z∈Y, [F3] gives d(c,c′)2≤2(d(z,c)2+d(z,c′)2)−4d(z,m)2≤4a2−4d(z,m)2. The infimum over z∈Y of the last right-hand side is 4a2−4rY(m)2 by the square-supremum fact just proved; since rY(m)≥a, this gives d(c,c′)2≤0. Thus c=c′, so any minimizer is unique.

1.4F2given

Fixed sets (clause (3), first part). Let φ be an isometry of X (Isometry, isometric embedding, and the subspace metric on a subset). If φ(x)≠x, put δ:=d(φ(x),x)/3>0. For every x′ with d(x,x′)<δ, the reverse triangle inequality and isometry property give d(φ(x′),x′)≥d(φ(x),x)−d(φ(x),φ(x′))−d(x,x′)=d(φ(x),x)−2d(x,x′)>0. Thus a ball about each point outside Fix⁡(φ) 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 C=⋂iFix⁡(φi): if x∉C, some i has φi(x)≠x, and the ball just constructed avoids C; if the family is empty then C=X. Now if x,y∈Fix⁡(φ) and γ is a geodesic segment from x to y (Geodesics and geodesic metric spaces), then φ∘γ is another geodesic from x to y, so it equals γ by uniqueness [F2]; hence Fix⁡(φ) is convex. Every common fixed set is an intersection of convex sets and is therefore convex.

1.5givenalgebra

Isometric invariance (clause (2), first part). Let φ be an isometry of X with φ(Y)=Y (Isometry, isometric embedding, and the subspace metric on a subset). Then φ−1(Y)=Y, so for every x∈X the substitution z:=φ−1(y) gives rY(φ(x))=sup⁡{d(φ(x),y):y∈Y}=sup⁡{d(x,φ−1(y)):y∈Y}=sup⁡{d(x,z):z∈Y}=rY(x); hence φ maps the set of minimizers of rY onto itself.

1.6F5F6F10F11algebra

Proper spaces are complete. Let (zn)n∈N be a Cauchy sequence in a proper space X (Cauchy sequence in a metric space). For each k≥1, the Cauchy condition makes the set of indices N satisfying d(zm,zn)≤1/k for all m,n≥N nonempty; let Nk be its least member, which exists by [F11] and requires no choice. Then Nk≤Nj for k≤j. Every closed ball Bˉ(q,r) is closed: if d(q,x)>r, the radius δ:=(d(q,x)−r)/2>0 gives d(q,x′)≥d(q,x)−d(x,x′)>r whenever d(x,x′)<δ, 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 Gk:=Bˉ(zNk,1/k) and E:=Bˉ(zN1,2) are closed and bounded, thus compact by properness [F6]. Each Gk lies in E: d(zNk,zN1)≤1, so d(x,zN1)≤d(x,zNk)+d(zNk,zN1)≤2 for x∈Gk. The sets Gk∩E={x∈E:d(zNk,x)≤1/k} are closed in (E,d) by the same ball argument and have the finite intersection property: the empty finite intersection is E, which contains zN1, and for any nonempty finite subfamily, if K is its largest index then zNK∈Gk∩E for every index k≤K. By [F5] applied in (E,d) there is p∈⋂k≥1Gk. For n≥Nk, d(p,zn)≤d(p,zNk)+d(zNk,zn)≤2/k; given any rational ε>0, [F10] supplies k with 2/k<ε, so zn→p (Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R) and X is complete (Complete metric space: every Cauchy sequence converges in the space).

2.1F6F8F9given

Proper case, compactness (clause (5), first part). Assume now that X is proper, and fix x0∈X. For any real b, the sublevel set {x:rY(x)≤b} is closed: if rY(x)>b, continuity from step 1.1 gives δ>0 such that d(x,x′)<δ implies ∣rY(x′)−rY(x)∣<(rY(x)−b)/2, and then rY(x′)>b; 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 K:={x∈X:rY(x)≤rY(x0)} is closed. It is bounded: for a fixed y0∈Y, every x∈K satisfies d(x,y0)≤rY(x)≤rY(x0), so K⊆B‾(y0,rY(x0)+1) (Open ball, closed ball and sphere in a metric space). Hence K is compact by properness [F6]. If rY(x0)=a, then x0∈K and inf⁡KrY=a. If rY(x0)>a, then for every ε>0 put η:=min⁡{ε,rY(x0)−a}>0; by the infimum approximation property [F8] there is x∈X with rY(x)<a+η≤rY(x0) and rY(x)<a+ε, so x∈K. Thus inf⁡KrY≤a+ε for every ε>0, while a≤inf⁡KrY since K⊆X; hence a=inf⁡KrY.

2.2F1F2F3F10step 1.2step 1.3algebra

The minimizing sequence is Cauchy (clause (1), first part). For m,n∈N, let mmn be the midpoint of the unique geodesic from xm to xn ([F1], [F2]). Applying [F3] to each z∈Y and using the square-supremum fact from step 1.3 gives rY(mmn)2≤12(rY(xm)2+rY(xn)2)−14d(xm,xn)2. Hence d(xm,xn)2≤2(rY(xm)2+rY(xn)2)−4rY(mmn)2≤2((a+1/(m+1))2+(a+1/(n+1))2)−4a2, since rY(mmn)≥a and step 1.2 bounds the selected radii. The final expression tends to 0 as m,n→∞ by [F10], so (xn) is Cauchy (Cauchy sequence in a metric space).

2.3F2F4step 1.4

The fixed set is CAT(0) and carries a contraction (clause (3), second part). Let C≠∅ be the common fixed set of a family of isometries. By convexity from step 1.4, the unique geodesic of X between two points of C lies in C (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles, Geodesics and geodesic metric spaces), so C with the induced metric is geodesic and inherits the CAT(0) comparison inequality; if X is complete, then C is closed by step 1.4 and complete by [F4]. For p∈C, define Ht(x) to be the point at fraction t of the unique geodesic from p to x. Convexity makes Ht(x)∈C, and H0 is constant at p while H1=id⁡C. For x,y∈C and s,t∈[0,1], [F2] gives d(Ht(x),Ht(y))≤t d(x,y) and the geodesic parametrization gives d(Ht(y),Hs(y))=∣t−s∣d(p,y); therefore d(Ht(x),Hs(y))≤t d(x,y)+∣t−s∣d(p,y), which proves joint continuity at every (x,t). Thus H is a homotopy from the constant map at p to the identity, and C is contractible by A nonempty space is contractible if and only if its identity map is nullhomotopic and Nullhomotopic maps and contractible spaces.

3.1F5F10step 1.3step 2.1

Proper case, the center without Choice (clause (5), second part). In the notation of step 2.1, the sets Kn:={x∈K:rY(x)≤a+1/n}, n≥1, are closed subsets of compact K by the sublevel-set argument of step 2.1, and are nested. Each is nonempty because a=inf⁡KrY; the empty finite intersection is K, which contains x0, and any nonempty finite intersection is the set with the largest index in it. Thus (Kn) has the finite intersection property (Finite intersection property). By [F5] there is c∈⋂n≥1Kn. If rY(c)>a, choose n with 1/n<rY(c)−a using [F10]; then rY(c)≤a+1/n<rY(c), a contradiction. Since rY(c)≥a, we get rY(c)=a, and step 1.3 gives uniqueness. The family (Kn) is defined by a formula, so this proper-space argument uses no choice principle.

3.2F10step 1.1step 2.2given

Attainment in the complete case (clause (1), second part). If X is complete, the Cauchy sequence (xn) from step 2.2 converges to some c∈X (Complete metric space: every Cauchy sequence converges in the space, Convergence of a sequence in a metric space: xk→x iff d(xk,x)→0 in R); continuity of rY from step 1.1 gives rY(c)=lim⁡nrY(xn)=a, because a≤rY(xn)<a+1/(n+1) and [F10] makes the error tend to 0. Thus the infimum is attained.

4.1F9step 1.1step 1.3step 3.2algebra

Clause (1) concluded. Assume X complete; let c be the point of step 3.2 and a the infimum. Then d(c,y)≤rY(c)=a for every y∈Y; step 1.1 identifies a with the radius of Y. If Y is finite, its nonempty finite image under y↦d(c,y) has a maximum by [F9], so the supremum defining rY(c) is that maximum; uniqueness follows from step 1.3. This proves (1).

5.1F2F9step 1.5step 2.3step 4.1

Clauses (2) and (4) concluded. Let X be complete and let c be the center of Y as in step 4.1, and let φ be an isometry with φ(Y)=Y; by step 1.5 the isometry φ permutes the minimizers of rY, and since c is the unique minimizer by step 4.1, φ(c)=c. Hence a group G of isometries with bounded orbit Y=Gx0 has Fix⁡(G)≠∅, because every g∈G satisfies g(Y)=Y and fixes c. 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 C=Fix⁡(G) 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 X lying in C, unique by [F2]. This proves (2) and (4).

6.1F7step 1.3step 1.6step 3.1step 2.3step 5.1∎

Clause (5) concluded, and the proof. Let X be proper. By steps 2.1 and 3.1 the center of every nonempty bounded Y⊆X 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 X 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 X is complete but not proper. Thus the conclusions of (1)-(4) hold for proper X without Choice.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Finite subgroups of a Coxeter group lie in spherical parabolics

Statement

Let (S,m) be a Coxeter matrix with S finite and W the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). For T⊆S put WT:=⟨s:s∈T⟩ (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1), The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups) and call T spherical when WT is finite; write S for the set of spherical subsets. Let Σ be the Davis realization with cells q=wWT for T∈S, 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 wWTw−1 with T∈S. 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 H≤W has a fixed point on Σ: for any x0∈Σ the orbit Hx0 is finite, hence bounded, and its center c (Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (1),(2)) is fixed by every h∈H. Moreover the fixed set ΣH=⋂h∈HFix⁡(h) 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 q=wWT (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)); let q˙ be the unique minimum-length representative of q (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)). Since T is spherical, (WT,T) is a finite-type Coxeter system, and the chamber tiling of its reflection space partitions VT into relative interiors of chamber faces w0CIT (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 y is in the relative interior of q and has coordinate y′∈relint⁡(w0CIT) in the q˙-chart, where w0∈WT and I⊆T, then Stab⁡W(y)=(q˙w0)WI(q˙w0)−1 (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)). Because I⊆T and WT is finite, WI≤WT is finite; hence this point stabilizer is a spherical parabolic and is contained in the setwise stabilizer wWTw−1 of q.

(3) Containment in a spherical parabolic. Every finite subgroup H≤W is contained in a spherical parabolic. Choose an H-fixed point c by (1), let q=wWT be its unique carrier cell, and let q˙, y′, w0, I be as in (2). Then H≤Stab⁡W(c)=(q˙w0)WI(q˙w0)−1≤q˙WTq˙−1=wWTw−1; the last equality holds because q˙∈wWT and WT is a subgroup. Since WT is finite, wWTw−1 is a spherical parabolic. One may take this parabolic to be the setwise stabilizer of the unique carrier cell of c.

(4) Scope and abstentions. The statements hold for every finite-rank Coxeter system, including infinite and noncrystallographic ones; the finite subgroup H, the conjugating element w and the spherical type T all exist without any finiteness or crystallographic hypothesis on (W,S). 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 (S,m), its presented group W, the spherical subsets S, the Davis realization Σ with its cellulation and its CAT(0) chain metric, and a finite subgroup H≤W.

[F1]

For a complete CAT(0) space X and a nonempty bounded Y⊆X, under AC there is a unique center c minimizing rY(x)=sup⁡y∈Yd(x,y); every isometry φ with φ(Y)=Y fixes c; 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 X 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)).

[F2]

The Davis complex has an isometric cellular W-action; its cells are indexed by spherical cosets q=wWT, and every point lies in the relative interior of exactly one cell. If q˙ is the minimum-length representative, the coordinate chart determined by q˙ gives the point-stabilizer formula Stab⁡W(y)=(q˙w0)WI(q˙w0)−1 whenever the cell coordinate lies in the relative interior of w0CIT (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)-(3), Left and right cosets gH and Hg of a subgroup).

[F3]

If I⊆T⊆S, then WI≤WT because both are generated by their indicated subsets; if WT is finite then WI is finite, and conjugation preserves this inclusion. Also W∅={1}, so the empty type is spherical. Thus for spherical T, WI is a spherical standard parabolic and any conjugate of it lies in the corresponding conjugate of WT (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1), The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F4]

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

[F5]

The Axiom of Choice: every family of nonempty sets has a choice function (The Axiom of Choice).

[F6]

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: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric).

[F8]

Every subgroup contains the identity element (Subgroup).

[F9]

The Coxeter group is generated by S with relations s2=1; for S=∅ this gives W={1}, and for S={s} every word reduces to 1 or s (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

Proof

Given: The Axiom of Choice, a finite Coxeter matrix (S,m), its presented group W, the spherical subsets S, the Davis realization Σ with its cellulation and CAT(0) chain metric, and a finite subgroup H≤W.

Proof technique: direct.

1.1F1F2F3F4F6F8F9

Clause (1). By [F3,F9], W∅={1} is spherical, so its coset is a vertex x0 of Σ by [F2]. If S=∅, then W={1} and this is the only cell; H={1}, its orbit is {x0} of radius 0, and its fixed set is Σ. If ∣S∣=1, [F9] shows that WS is finite, so the full standard parabolic already contains every H. In all ranks, the orbit Y:=Hx0 is nonempty because H contains the identity [F8], and finite because it is the image of the finite set H. Its distances from x0 form a finite set of real numbers, so [F6] gives a maximum R and Y⊆B‾(x0,R+1). When H={1}, this gives Y={x0} and R=0, with center x0. The W-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 c of Y. Each h∈H preserves Y, so it fixes c by [F1]; thus H fixes c and ΣH=⋂h∈HFix⁡(h) is nonempty. The fixed-set clause of [F1] gives that ΣH is closed, convex, complete and CAT(0) in the induced metric, and contractible with a continuous geodesic contraction to each of its points.

1.2F2

Clause (2), the carrier cell. By [F2], every point of Σ lies in the relative interior of exactly one cell q=wWT; hence each point has a unique carrier cell.

1.3F2F3F7

Clause (2), the stabilizer formula. Let q=wWT be a cell and y a point in its relative interior, with coordinate y′∈CT in the chart determined by q˙. By [F7], there is a unique chamber face w0CIT whose relative interior contains y′, including the full chamber face and its lower-dimensional faces. The stabilizer formula of [F2] gives Stab⁡W(y)=(q˙w0)WI(q˙w0)−1; since I⊆T and WT is finite, [F3] shows this is a finite spherical parabolic contained in q˙WTq˙−1=wWTw−1.

2.1F2F3F7step 1.1step 1.2step 1.3

Clause (3). Let H≤W be finite and choose an H-fixed point c∈Σ by step 1.1; let q=wWT be its unique carrier cell by step 1.2. With q˙, y′, w0, I as in step 1.3, the stabilizer formula of [F2] gives Stab⁡W(c)=(q˙w0)WI(q˙w0)−1. Every h∈H fixes c, so H≤Stab⁡W(c)≤q˙WTq˙−1=wWTw−1 by [F3]. Since WT is finite, this cell stabilizer is a spherical parabolic; the carrier cell q is unique by step 1.2.

3.1F1F4F5F7step 1.1step 1.2step 1.3step 2.1∎

Clause (4) and the Choice bookkeeping. The finite subgroup H, its containing spherical parabolic wWTw−1 and the cell q were obtained in step 2.1 with no finiteness or crystallographic hypothesis on (W,S) beyond S 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 Stab⁡W(y)=wWT∩S(y′)w−1 with S(y′)={s∈T:B(y′,es)=0} is false: in A2 with S={s,t} let y′=svs=23(et−es), so that B(y′,es)=−1 and B(y′,et)=1, whence S(y′)=∅; but ρ(t)vs=vs because B(vs,et)=0, so sts fixes y′ and Stab⁡WS(y′)=⟨sts⟩≠{1}. 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 WI through the chamber containing y′.

5 · Examples, counterexamples and false statements

None yet.

Sources