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.

✓ 3 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 3 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 — Examples

1 · Prerequisites

2 · Summary

This companion is a dependency leaf. Its examples use the theory of davis-cat-zero-geometry-and-finite-subgroup-fixed-points and that page's prerequisite closure; no other theory page depends on a supplier homed here.

Circumcenters of finite sets in the infinite dihedral Davis line identifies the infinite-dihedral Davis complex with the unit-edge real line, computes the unique center of every nonempty finite set from its extreme coordinates, and shows directly that finite-subgroup orbit centers are fixed.

Link angles in A2, affine A2 and the universal Coxeter nerve checks the link metrics in type A2, affine type A~2, and the universal Coxeter case. It computes the 2π/3 interval, the 2π circle, and the discrete link whose two-ray cone is a line, without asserting the general metric-flag CAT(1) theorem.

Fixed points of finite subgroups in the infinite dihedral tree and their cell stabilizers classifies the finite subgroups of C2∗C2, locates each nontrivial fixed point at an edge midpoint, and computes its rank-one parabolic cell stabilizer. It contrasts this with the interior stabilizer of the finite rank-two Coxeter cell.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Circumcenters of finite sets in the infinite dihedral Davis line

Example

Let (W,S) be the universal Coxeter system with S={s,t} and m(s,t)=∞, so W=⟨s,t∣s2=t2=1⟩≅C2∗C2=D∞ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Normal form theorem for free products). Let Σ be its Davis complex with the cellulation and chain metric of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K), with ds=dt=1/2; each Coxeter 1-cell then has length 1 (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4), The real Coxeter form, its radical, reflections, and form-preserving maps (2)).

(i) The metric line. The spherical subsets are ∅,{s},{t}, so Σ has only vertices and the edges {w,ws} and {w,wt}. Its metric realization is isometric to R with the usual metric.

(ii) Circumcenters of finite sets. If Y⊆Σ is nonempty and finite, its radius function rY(x)=max⁡y∈Yd(x,y) has minimum D/2, where D=max⁡a,b∈Yd(a,b), and its unique minimizer is the midpoint of any diameter segment [a,b].

(iii) Finite orbits. Every finite subgroup H≤W is trivial or has order two. For each x0∈Σ, the circumcenter of Hx0 is fixed by H: it is x0 when H is trivial or fixes x0, and otherwise it is the midpoint of [x0,rx0] for the nonidentity reflection r∈H. This explicit orbit-to-center map agrees, under the Axiom of Choice, with the center map in the companion result Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (2),(4); the local computation and fixed-point conclusion above do not use Choice.

Facts & Assumptions

Given: The universal Coxeter system (W,S) with S={s,t} and m(s,t)=∞, its Davis complex Σ with the stated cellulation and chain metric, and ds=dt=1/2. The Axiom of Choice is assumed only for the comparison with the companion center theorem in step 4.1.

[F1]

The Coxeter system is the group presented by its Coxeter matrix; a label m(s,t)=∞ imposes no relator on s,t (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F2]

The presentation of W with only the relations s2=t2=1 has the universal property of the free product of two cyclic groups of order two: the free-product property gives a map C2∗C2→W and the Coxeter-presentation property gives a map W→C2∗C2, and uniqueness makes their composites identities (The free product of an arbitrary family of groups, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). Hence W≅C2∗C2; by [F3], every alternating word (st)n with n≥1 is nonempty reduced, so st has infinite order (Normal form theorem for free products).

[F3]

Every element of a free product has a unique reduced syllable expression; the identity is the empty word and no nonempty reduced word is the identity (Normal form theorem for free products).

[F4]

A subset T is spherical when WT is finite; spherical cosets index the Davis cells (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(2)).

[F5]

Under the cellulation identification, the cell indexed by wWT has dimension ∣T∣ (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).

[F6]

The 1-skeleton is the undirected, S-labelled Cayley graph (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3)).

[F7]

The Cayley graph has vertex set W and edges {w,ws} for generators s (The Cayley graph of a group with respect to a subset).

[F8]

For ∣T∣=1, the Coxeter cell is the interval from −dses to dses (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4)).

[F9]

The Coxeter form satisfies B(es,es)=1 for every generator (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).

[F10]

The chain metric candidate is the infimum of lengths of finite chains, each consecutive pair of which lies in a common cell (Abstract isometric polyhedral gluings and the chain metric).

[F11]

Every nonempty finite subset of the real line has a minimum and maximum (Every nonempty finite set of reals has a maximum and a minimum).

[F12]

Every Cauchy sequence of real numbers converges in R (The reals are complete).

[F13]

CAT(0) means geodesicity together with Euclidean triangle comparison (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (2),(3)); the real line satisfies the comparison because its geodesic triangles are collinear.

[F14]

An isometry is a bijective map preserving all distances (Isometry, isometric embedding, and the subspace metric on a subset).

[F15]

The Axiom of Choice is assumed only for step 4.1 (The Axiom of Choice).

[F16]

Under AC, the companion theorem gives the unique center of a nonempty bounded set in a complete CAT(0) space, and isometries preserving that set fix its center (Circumcenters of bounded sets and fixed sets of isometries in complete CAT(0) spaces (1),(2),(4)).

Verification

Given: The universal system and Davis complex above; all claims through step 3.1 are proved without Choice, while step 4.1 assumes AC solely to compare with the general center theorem.

Proof technique: direct.

1.1F1F2F3F4F5F6F7

By [F2,F3], st has infinite order, so W{s,t}=W is infinite, whereas W∅, W{s} and W{t} are finite. Thus the spherical subsets are exactly ∅,{s},{t}, and the Davis cells are vertices and edges only. By [F6,F7] the 1-skeleton is G=Cay⁡(W,{s,t}).

1.2F3F6F7algebra

Put p:=st and, for n∈Z, set v2n:=pn and v2n+1:=pns. The reduced-word normal form shows these are all distinct and exhaust W: the empty word and the even-length reduced words are pn for unique n∈Z, while every odd-length reduced word is pns for a unique n∈Z. Consecutive vertices v2n,v2n+1 and v2n+1,v2n+2 differ by right multiplication by s and t, respectively. Since s and t are distinct reduced one-syllable words, each vertex has exactly these two distinct neighbors, and this enumeration identifies G with the bi-infinite line.

1.3F5F6F7F8F9F10F12F13F14constructalgebra

Each edge has length 2ds=2dt=1 by [F8, F9]. Send vk to k and extend linearly over each edge. Every cell is a point or one of these intervals by [F5], so this map is isometric on each cell. For any chain from x to y, the sum of its cellwise lengths is at least the absolute difference of the endpoint coordinates; conversely, the finite line segment between them is a chain with exactly that length. Thus by [F10] the chain metric candidate is the usual real-line metric under this map, so it is a metric and gives an isometry Σ→R. It follows from [F12, F13] that Σ is complete and CAT(0). Left multiplication by any g∈W sends each vertex w to gw and each edge {w,ws} or {w,wt} to the corresponding edge at gw; its length-preserving extension is a bijective isometry for this metric by [F14].

1.4F11givenalgebra

Let Y⊆Σ≅R be nonempty and finite. By [F11], the set of line coordinates of Y has a minimum a and maximum b. Put D:=b−a; since all coordinates lie between a and b and both endpoints belong to Y, this is the diameter of Y. Let m be the point with coordinate (a+b)/2. Every y∈Y has coordinate between a and b, so d(y,m)≤D/2; the endpoints a,b each lie at distance D/2, hence rY(m)=D/2.

2.1F11step 1.4algebra

For any x∈Σ≅R, rY(x)≥max⁡{∣x−a∣,∣x−b∣}, so the inequalities ∣x−a∣≤rY(x) and ∣x−b∣≤rY(x) imply 2rY(x)≥∣x−a∣+∣x−b∣≥b−a=D. If rY(x)=D/2, then both ∣x−a∣ and ∣x−b∣ are at most D/2, whose two closed intervals intersect only at m=(a+b)/2 (also when D=0). Hence m is the unique minimizer and the unique center of Y.

3.1F3step 1.2step 1.3step 2.1algebra

Write H≤W for a finite subgroup. The normal-form indexing in step 1.2 says every element is either pn or pns. If n≠0, pn has infinite order; each pns is an involution because spns=p−n. Two distinct involutions pms and pns have product pm−n with m≠n, which has infinite order. Consequently a finite subgroup is either {1} or {1,r} for one reflection r=pns. If H={1}, the orbit Hx0={x0} has center x0. If H={1,r} and rx0=x0, its orbit again has center x0; otherwise the orbit is {x0,rx0} and step 2.1 gives its unique center as their midpoint. Since r is an isometry interchanging these endpoints, it fixes that midpoint. Let f be an isometry of R, put c=f(0) and write f(1)=c+ϵ with ϵ∈{1,−1}. For y=f(x)−c, the two distance equalities give ∣y∣=∣x∣ and ∣y−ϵ∣=∣x−1∣; subtracting their squares gives y=x if ϵ=1 and y=−x if ϵ=−1. Thus every isometry is a translation x↦x+c or a reflection x↦−x+c. An involutive translation is the identity, while a reflection has the unique fixed point c/2; the left action is faithful on vertices, so nonidentity r is not the identity isometry and hence has a unique fixed point. Thus in every case the orbit center is fixed by H.

4.1F12F13F14F15F16step 1.3step 1.4step 2.1step 3.1∎

Under AC [F15], [F16] applies to X=Σ and Y=Hx0: step 1.3 gives completeness, CAT(0), and an isometric action; the orbit is nonempty and finite, hence bounded. The general theorem's center is the unique minimizer of the same radius function used in steps 1.4 and 2.1, so it equals the explicitly computed orbit center. This is precisely the companion A-page center map restricted to this line. The local orbit classification and fixed-point calculation in step 3.1 do not use AC; AC enters here only through the general theorem's minimizing-sequence argument.

Remarks

  • Davis's examples independently identify the universal Coxeter Davis complex as a regular tree and, in rank two, the real line. The proof above establishes the line metric and the finite-set center formula directly.
  • The normalization ds=dt=1/2 makes all edges unit length. Other positive choices give alternating edge lengths 2ds and 2dt. Using their cumulative lengths as vertex coordinates in step 1.3 still identifies the metric realization with the real line; the center is still the metric midpoint of a diameter segment, though its position in the original cell coordinates can change.
ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Fixed points of finite subgroups in the infinite dihedral tree and their cell stabilizers

Example

Let (W,S) be the universal Coxeter system with S={s,t}, m(s,t)=∞, and presentation W=⟨s,t∣s2=t2=1⟩ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); Fact F1 identifies it with C2∗C2=D∞. Let Σ be its Davis complex with ds=dt=1/2 and the chain metric of Abstract isometric polyhedral gluings and the chain metric. By Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1) and The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4), its cells are the vertices wW∅={w} and the edges wW{s}={w,ws}, wW{t}={w,wt}, its 1-skeleton is the Cayley graph, and each edge has length 1 because B(er,er)=1 and 2dr=1 (The real Coxeter form, its radical, reflections, and form-preserving maps (2)). The example identifies this cellulation with the unit-edge metric line and computes its finite-subgroup fixed points. Assume the Axiom of Choice only for contextual comparison with the general finite-subgroup theorem (The Axiom of Choice, Finite subgroups of a Coxeter group lie in spherical parabolics); the explicit group, line, midpoint and cell calculations do not use Choice.

(i) Elements and finite subgroups. Every element of W is a reduced syllable word in the two order-two factors. A word of odd length is a conjugate of s or t (a reflection) and has order 2; a word of even length 2j>0 is conjugate to (st)j (a translation) and has infinite order (Normal form theorem for free products, The free product of an arbitrary family of groups). Any two distinct reflections have a nonidentity even-length reduced product, hence a translation of infinite order. Therefore every finite subgroup of W is either {1} or a two-element subgroup generated by a reflection.

(ii) Vertices have trivial stabilizers. For every w∈W the point stabilizer of the vertex w is the stabilizer of the 0-cell wW∅, namely wW∅w−1={1} (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2) with T=∅). No nontrivial finite subgroup can therefore fix a vertex: a finite subgroup fixing a vertex would be contained in the stabilizer of that cell, which is trivial.

(iii) Reflections fix edge midpoints, with parabolic stabilizer. Every conjugate reflection can be written w=(st)kr(st)−k for some k∈Z and r∈{s,t}; this is proved from the normal forms in the verification. Then w swaps the endpoints of the edge q:=(st)kWr and fixes its midpoint m. Let q˙ be the minimum-length representative of q; the carrier cell of m is this 1-cell, and its cell coordinate is y′=0∈C{r}, in the relative interior of the chamber face with w0=1 and I={r}. The point-stabilizer formula of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2) gives Stab⁡W(m)=(q˙)Wr(q˙)−1=(st)kWr(st)−k=⟨w⟩, since q˙∈(st)kWr and conjugation by an element of the subgroup Wr preserves Wr (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). Under AC, this is the equality case of the general point-stabilizer formula in Finite subgroups of a Coxeter group lie in spherical parabolics (2), with T={r}, w0=1 and I={r} for y′=0; the finite subgroup ⟨w⟩ is the rank-one spherical parabolic (st)kWr(st)−k and the setwise stabilizer of its carrier cell.

(iv) Finite-type contrast. If instead (W,S) is finite, for example S={s,t} with m(s,t)=3, then Σ is the single Coxeter cell CS (Finite Coxeter orbit polytopes, face isometries and their cocycle (1) with S∈S, The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)), and the point 0∈CS, which lies in the interior of the top cell, is fixed by the whole finite group W: with T=S, w0=1 and I=S, the point-stabilizer formula gives Stab⁡W(0)=WS=W, the spherical parabolic of full rank; here S is spherical because W is finite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)), and the rank-two finite group is dihedral of order 2m (The Davis complex as a CW complex: disk cells and the Cayley skeleta, proof step 6.1). Thus the rank-one case (iii) and the top-rank finite case are the two extremes of the same containment statement.

(v) Scope. Only the universal rank-two line and the finite rank-two hexagon are computed. No general claim is made here about fixed sets of infinite subgroups or the number of conjugacy classes of finite subgroups in other Coxeter groups.

Facts & Assumptions

Given: The Axiom of Choice, the universal Coxeter system (W,S) with S={s,t} and m(s,t)=∞, and its Davis complex Σ with the distances ds=dt=1/2.

[F1]

The presentation of W with relations s2=t2=1 is isomorphic to the free product C2∗C2: the presentation property gives a map to the free product, the free-product property gives a map back, and their composites fix the generators, so are identities (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The free product of an arbitrary family of groups). The free-product normal form then gives unique reduced syllable words g1⋯gk with gi∈{s,t} and gi≠gi+1; the empty word is 1, no nonempty reduced word is 1, and st has infinite order (Normal form theorem for free products).

[F2]

By [F1], the spherical subsets of (W,S) are exactly ∅,{s},{t}; the Davis cells are vertices wW∅={w} and intervals wW{s}, wW{t}; every point lies in the relative interior of exactly one cell (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1), The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2), The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4)).

[F3]

The 1-skeleton of Σ is the Cayley graph Cay⁡(W,{s,t}); a rank-one Coxeter cell is the interval [−drer,drer], and B(er,er)=1, so its length is 2dr=1 (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4), The real Coxeter form, its radical, reflections, and form-preserving maps (2)).

[F4]

Point stabilizers: if q=wWT has minimum-length representative q˙ and a point y in the relative interior of its cell has coordinate y′ in the relative interior of w0CIT, then Stab⁡W(y)=(q˙w0)WI(q˙w0)−1; the setwise stabilizer of the cell is wWTw−1. In particular the vertex w has stabilizer {1} and the left action on vertices is free (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).

[F5]

For T⊆S, WT=⟨r:r∈T⟩ is finite exactly when T is spherical, Wr={1,r} for r∈{s,t}, and conjugates of finite standard parabolics are spherical parabolics (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, Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1), [F1]).

[F6]

W is finite exactly when B is positive definite; for a rank-two system with finite m, W{s,t} is dihedral of order 2m (proved in The Davis complex as a CW complex: disk cells and the Cayley skeleta, step 6.1); and in finite type the cell CS=conv⁡(WSxS) is compact and convex with 0 in its interior (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Finite Coxeter orbit polytopes, face isometries and their cocycle (1), The finite-type Coxeter cell: exposed faces and normal cones (5)).

[F7]

Under AC, every finite subgroup of a finite-rank Coxeter group has a fixed point on its Davis complex, point stabilizers are spherical parabolics, and the subgroup is contained in the spherical parabolic carried by the fixed point's carrier cell (Finite subgroups of a Coxeter group lie in spherical parabolics (1)-(3), The Axiom of Choice). This is used only to compare the explicit rank-one calculation with the general theorem, not as a premise of the proof.

[F8]

The chain metric is the infimum of lengths of finite chains whose consecutive points lie in one common cell (Abstract isometric polyhedral gluings and the chain metric).

[F9]

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

Verification

Given: The Axiom of Choice, the universal Coxeter system (W,S) with S={s,t}, m(s,t)=∞, the Davis complex Σ with ds=dt=1/2, and a conjugate reflection w∈W.

Proof technique: direct.

1.1F1algebra

Clause (i). By [F1] every element has a unique reduced syllable word. A word of length 1 is a generator and is an involution. If an odd reduced word w=g1⋯gk has k≥3, then gk=g1 and g1wg1=g2⋯gk−1 is a shorter odd reduced word. Induction shows that w is conjugate to s or t, so has order 2. If k=0, w=1. If k=2j>0, the word is (st)j or (ts)j=t(st)jt; [F1] says st has infinite order, so every such word has infinite order. Thus every element is the identity, a reflection, or an infinite-order translation. If ρ1≠ρ2 are reflections, then ρ1ρ2≠1 and its reduced syllable word is obtained from a concatenation of two odd-length words by cancelling equal adjacent pairs. The resulting word is nonempty and has positive even length, so it is a translation of infinite order by the preceding classification. A finite subgroup therefore contains no translation and at most one reflection, so it is trivial or has order two generated by a reflection.

1.2F1F2F3F4F8algebra

The line structure. By [F2] the only spherical subsets are ∅,{s},{t}, so there are only vertices and edges, and by [F3] the 1-skeleton is G=Cay⁡(W,{s,t}). Let p:=st and, for n∈Z, set v2n:=pn and v2n+1:=pns. The normal forms of [F1] show these vertices are distinct and exhaust W: even reduced words are pn; odd words starting with s are pns for n≥0, and odd words starting with t are pns=(ts)−n−1t for n<0. Consecutive vertices differ by right multiplication by s and t, respectively, so this indexes the Cayley graph as a bi-infinite line. Send vk to k and extend linearly over each edge. Each edge has length 1 by [F3]. For any cell chain, the sum of its cellwise lengths is at least the absolute difference of the endpoint coordinates by the triangle inequality on R; conversely, the finite line segment between two points is a finite chain of edge subsegments with length equal to that coordinate difference. Thus [F8] gives the chain metric as the usual metric on R, and Σ is a metric line. Every isometry of this line is either a translation or a reflection: after writing f(0)=c, one has f(1)=c+1 or c−1, and the distances to these two points determine f(x) uniquely as c+x or c−x. Therefore a nonidentity involution is a reflection with exactly one fixed point. The action on vertices is free by [F4].

1.3F2F4

Clause (ii). Let w∈W. By [F2] the vertex w is the 0-cell wW∅, whose relative interior is {w}; by [F4] applied with q=wW∅ and T=∅, Stab⁡W(w)={1}. A finite subgroup fixing a vertex v lies in Stab⁡W(v)={1}, so it is trivial.

1.4F4F6

Clause (iv). Assume now that (W,S) is finite with S={s,t} and m(s,t)=3. Then B is positive definite by [F6], S is spherical and W=WS, so every spherical coset is contained in WS=W and indexes a face of the single top cell CS by The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2). Hence Σ=CS; the universal-system description in [F2] is not used in this finite case. The point 0 lies in the interior of CS by [F6], so in the top-cell chart it has w0=1 and I=S; the point-stabilizer formula of [F4] gives Stab⁡W(0)=WS=W. Here W is dihedral of order 2m=6 by [F6], and W=WS is a spherical parabolic of full rank.

2.1F1F4F5F7step 1.1step 1.2step 1.3

Clause (iii). Let w be a nonidentity reflection. By step 1.1 it is an involution; by step 1.2 its action on the line is a reflection with a unique fixed point m. By step 1.3 no nontrivial element fixes a vertex, so m lies in the interior of an edge. The edge enumeration in step 1.2 writes its carrier as q=pkWr for some k∈Z, r∈{s,t}, with endpoints a=pk and b=pkr. The reflection swaps these endpoints, so wa=b and w=ba−1=pkrp−k. In the q˙-chart the midpoint has coordinate 0∈C{r}, in the chamber face w0=1, I={r}. The formula of [F4] gives Stab⁡W(m)=(q˙)Wr(q˙)−1. Since q˙∈pkWr, this is pkWrp−k={1,w}=⟨w⟩; it is the setwise stabilizer of the carrier edge and a conjugate of the rank-one spherical parabolic Wr by [F5]. Under AC, this is the equality case of the general point-stabilizer formula [F7]; the explicit computation here does not rely on that theorem.

3.1F7F9step 1.1step 1.2step 1.3step 1.4step 2.1∎

Clause (v) and the Choice bookkeeping. Steps 1.1-1.4 and 2.1 compute the two examples: the finite subgroups of the universal rank-two group are trivial or generated by one reflection, each nontrivial finite subgroup fixing the midpoint of a 1-cell with stabilizer the conjugate spherical parabolic pkWrp−k; in the finite rank-two case the whole group fixes the interior point 0 of the top cell, with stabilizer WS=W. These are the rank-one and top-rank extremes of the containment statement in [F7]. The normal-form, line, midpoint and cell calculations are choice-free. AC is assumed only for the comparison with [F7], and no conclusion of that general theorem is used in the explicit proof. No assertion is made about infinite subgroups, higher-rank trees or the number of conjugacy classes of finite subgroups in general.

Remarks

  • The equality case of the stabilizer formula. For the midpoint m of a 1-cell (st)kWr the point y′=0 of C{r} lies in the relative interior of the chamber face with w0=1 and I={r}, and the formula of Finite subgroups of a Coxeter group lie in spherical parabolics (2) returns the full rank-one parabolic (st)kWr(st)−k, which here is the two-element group ⟨w⟩. This is the extreme opposite to the vertex case of clause (ii), where I=∅ and the stabilizer is trivial.
  • Consistency with the general theorem. The containment ⟨w⟩=(st)kWr(st)−k of step 2.1 and the containment W≤WS of step 1.4 are instances of clause (3) of Finite subgroups of a Coxeter group lie in spherical parabolics, computed here cell by cell; the example's fixed-point calculations are proved directly.

Sources