How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Davis CAT(0) Geometry and Finite Subgroup Fixed Points — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Banach Alaoglu Goldstine and Krein Milman
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- CAT Comparison, Link Criteria, and Local Globalization
- Cayley Graphs, Word Metrics and Quasi-Isometry
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convex and Semicontinuous Functions on Rⁿ
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Covering Spaces and Lifting
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Davis CAT(0) Geometry and Finite Subgroup Fixed Points
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Products and Amalgamation
- Function Space Topologies and the Exponential Law
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Large Spherical Metric Flags and the Moussong Girth Theorem
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Locally Convex Spaces and Continuous Separation
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Parabolic Subgroups and Double Coset Geometry
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Short Loop Polygons and Quantitative Energy Decrease
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Sine, Cosine, and the Definition of Pi
- Spherical Parabolic Cosets and the Davis Complex
- Spherical Simplex Metrics, Angular Links, and Cones
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Group
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
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 , affine type , and the universal Coxeter case. It computes the interval, the 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 , 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
Circumcenters of finite sets in the infinite dihedral Davis line
Example
Let be the universal Coxeter system with and , so (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 ; each Coxeter -cell then has length (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 , so has only vertices and the edges and . Its metric realization is isometric to with the usual metric.
(ii) Circumcenters of finite sets. If is nonempty and finite, its radius function has minimum , where , and its unique minimizer is the midpoint of any diameter segment .
(iii) Finite orbits. Every finite subgroup is trivial or has order two. For each , the circumcenter of is fixed by : it is when is trivial or fixes , and otherwise it is the midpoint of for the nonidentity reflection . 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 with and , its Davis complex with the stated cellulation and chain metric, and . The Axiom of Choice is assumed only for the comparison with the companion center theorem in step 4.1.
The Coxeter system is the group presented by its Coxeter matrix; a label imposes no relator on (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The presentation of with only the relations has the universal property of the free product of two cyclic groups of order two: the free-product property gives a map and the Coxeter-presentation property gives a map , 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 ; by [F3], every alternating word with is nonempty reduced, so has infinite order (Normal form theorem for free products).
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).
A subset is spherical when is finite; spherical cosets index the Davis cells (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(2)).
Under the cellulation identification, the cell indexed by has dimension (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).
The -skeleton is the undirected, -labelled Cayley graph (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3)).
The Cayley graph has vertex set and edges for generators (The Cayley graph of a group with respect to a subset).
For , the Coxeter cell is the interval from to (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4)).
The Coxeter form satisfies for every generator (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).
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).
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).
Every Cauchy sequence of real numbers converges in (The reals are complete).
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.
An isometry is a bijective map preserving all distances (Isometry, isometric embedding, and the subspace metric on a subset).
The Axiom of Choice is assumed only for step 4.1 (The Axiom of Choice).
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.
By [F2,F3], has infinite order, so is infinite, whereas , and are finite. Thus the spherical subsets are exactly , and the Davis cells are vertices and edges only. By [F6,F7] the -skeleton is .
Put and, for , set and . The reduced-word normal form shows these are all distinct and exhaust : the empty word and the even-length reduced words are for unique , while every odd-length reduced word is for a unique . Consecutive vertices and differ by right multiplication by and , respectively. Since and are distinct reduced one-syllable words, each vertex has exactly these two distinct neighbors, and this enumeration identifies with the bi-infinite line.
Each edge has length by [F8, F9]. Send to 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 to , 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 . It follows from [F12, F13] that is complete and CAT(0). Left multiplication by any sends each vertex to and each edge or to the corresponding edge at ; its length-preserving extension is a bijective isometry for this metric by [F14].
Let be nonempty and finite. By [F11], the set of line coordinates of has a minimum and maximum . Put ; since all coordinates lie between and and both endpoints belong to , this is the diameter of . Let be the point with coordinate . Every has coordinate between and , so ; the endpoints each lie at distance , hence .
For any , , so the inequalities and imply . If , then both and are at most , whose two closed intervals intersect only at (also when ). Hence is the unique minimizer and the unique center of .
Write for a finite subgroup. The normal-form indexing in step 1.2 says every element is either or . If , has infinite order; each is an involution because . Two distinct involutions and have product with , which has infinite order. Consequently a finite subgroup is either or for one reflection . If , the orbit has center . If and , its orbit again has center ; otherwise the orbit is and step 2.1 gives its unique center as their midpoint. Since is an isometry interchanging these endpoints, it fixes that midpoint. Let be an isometry of , put and write with . For , the two distance equalities give and ; subtracting their squares gives if and if . Thus every isometry is a translation or a reflection . An involutive translation is the identity, while a reflection has the unique fixed point ; the left action is faithful on vertices, so nonidentity is not the identity isometry and hence has a unique fixed point. Thus in every case the orbit center is fixed by .
Under AC [F15], [F16] applies to and : 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 makes all edges unit length. Other positive choices give alternating edge lengths and . 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.
Link angles in A2, affine A2 and the universal Coxeter nerve
Example
Let be a Coxeter matrix with finite, its presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), its nerve, the finite large metric flag complex of The angular link of a vertex of the Davis complex is the large metric flag nerve (3),(4), and the angular link of a vertex of the Davis complex, which by that lemma is isometric to . Assume AC only to invoke the A-page link lemma as currently stated; the explicit group, matrix and metric computations below use no Choice. In the following three systems the link, its edge lengths and its metric flag data are computed.
(i) . Let and , so is the dihedral group of order , hence finite. Every subset of is spherical, so is the single edge , , and is the spherical segment with vertices and length which is positive definite. The Coxeter cell is a regular hexagon when (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4)). Hence is an arc of length , equal to the interior angle of that hexagon at the vertex; the arc is a CAT(1) geodesic interval by the direct comparison argument in step 2.2.
(ii) Affine . Let and and for distinct generators. The three pairs are spherical, but is not: with the all-ones matrix, is positive semidefinite with kernel and is not positive definite, so is infinite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form). Thus is the triangle boundary with the three edges , and is the circle built from three edges of length , of total length ; the triple is pairwise adjacent, its cosine matrix is not positive definite, and the metric flag condition (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links (3)) correctly leaves the triangle unfilled. The vertex link is therefore the round circle , which is CAT(1), being exactly the equality case of the criterion "a circle of length is CAT(1) if and only if " (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (vi)); geometrically the three incident rank-two cells contribute the local link angles given by the link lemma, for total angle ; when these are regular hexagons.
(iii) Universal Coxeter system. Let for all distinct . Then no pair is spherical, so consists of and the singletons, is the discrete complex on , and every cell of has dimension . Hence is -dimensional, is the finite set with distinct points at truncated angular distance , and its cone is the metric star of Euclidean rays joined at one apex (a point if , a ray if , and if ). The associated almost-negative matrix is , with for ; for it is , positive semidefinite with kernel . There are no pairwise adjacent sets of two or more vertices, so the metric flag test holds; the CAT(1) tests hold vacuously for this discrete -separated link. For its cone is the line.
(iv) Comparison. In all three cases the identity holds, with for the non-edges ; the edge length is ; it agrees with only when , and the metric flag test uses positive definiteness of the cosine matrix of a pairwise adjacent set, not merely its pairwise edge data.
Facts & Assumptions
Given: AC, a finite Coxeter matrix and its presented group , the spherical subsets with nerve , the finite large metric flag complex with its truncated angular metric, and the three systems of clauses (i)-(iii). AC is included only because the cited A-page link lemma has a global AC premise.
The Coxeter presentation has involution and finite-label relators, and its universal property extends any generator assignment satisfying them to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
A subset is spherical exactly when is finite; the nerve has the nonempty spherical subsets as simplices and is finite (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).
Under AC, clause (3) of the A-page link lemma identifies each angular vertex link with the finite spherical complex and identifies its spherical simplices by their cosine matrices (The angular link of a vertex of the Davis complex is the large metric flag nerve (3)). Its CAT(1) clause (6) is not used here.
The Coxeter form has , for finite labels, and for (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).
On a pair plane , the Gram matrix is ; it is positive definite for finite and positive semidefinite with radical for (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(i)).
For finite , is finite if and only if its Coxeter form on is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1), Positive and negative definiteness, the inertia , rank , and signature of a real symmetric bilinear or quadratic form).
The Davis cells are indexed by the spherical cosets and have dimension (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2)).
The Davis 2-cell for a finite-label pair is a -gon, and when and , is the regular -gon (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4)).
The Euclidean cone formula is and , with ; distinct components have truncated distance (The angular path metric, the Euclidean cone and spherical joins (2)-(4)).
In a large spherical complex, the metric flag condition says that a pairwise adjacent vertex set spans a simplex if and only if its cosine matrix is positive definite (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links (3)).
CAT(1) requires geodesics for pairs at distance and spherical comparison only for geodesic triangles of perimeter (Comparison triangles, the CAT(0) and CAT(1) inequalities, local CAT, local geodesics and round circles (2),(3)).
The round circle is CAT(1) if and only if (Comparison triangles in the Euclidean plane and the round sphere, model spaces, and CAT(0) and CAT(1) consequences (vi)).
For a subset , is the Coxeter system for the restricted Coxeter matrix (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)).
AC is assumed only to invoke the globally AC-qualified A-page link lemma; the finite group, matrix, cone and CAT(1) calculations in this example make no choice selections (The Axiom of Choice).
Under AC, clauses (2)-(3) of the A-page link lemma give the local edge-cell length for finite labels, without asserting a global shortest-path equality (The angular link of a vertex of the Davis complex is the large metric flag nerve (2)).
Under AC, clause (4) of the A-page link lemma records as a finite large metric flag complex with associated matrix (The angular link of a vertex of the Davis complex is the large metric flag nerve (4)).
The empty cosine matrix is positive definite by convention (Finite large spherical complexes, their almost-negative matrices, the metric flag condition, and links (3)).
Verification
Given: AC, a finite Coxeter matrix , its presented group , the nerve , the finite large metric flag complex with truncated angular metric, and the three systems (i)-(iii). AC is used only through the stated A-page link lemma; all local calculations are choice-free.
Proof technique: direct.
Clause (i). Under AC [F14], invoke clauses (2)-(4) of the A-page link lemma [F3,F15,F16] for the vertex links and their local metrics. For with , [F4] gives , whose eigenvalues are and , so it is positive definite. The assignments and satisfy the presentation relators, so [F1] gives a homomorphism ; it is onto. Put . The presentation gives , , and , so every word reduces to or for . Hence ; the surjection gives , so , the dihedral group of order six. Every subset is spherical [F2]; is one edge and [F3,F15] give edge length with cosine matrix . The empty cosine matrix is positive definite by [F17], and every nonempty subset has a positive-definite cosine matrix as a principal submatrix of ; since every subset is spherical, the metric-flag equivalence holds [F10]. When , [F8] gives the regular hexagonal cell.
Clause (ii). Let and and for distinct generators. By [F4], . For , so is positive semidefinite with kernel and is not positive definite. Hence is infinite by [F6]. Each pair has matrix with eigenvalues and , so it is positive definite by [F5] and its parabolic is finite by [F6,F13]. The nerve therefore has all three edges but no 2-simplex [F2]. By [F3,F15], is the cycle of three edges of length , hence the round circle of circumference . Its pairwise adjacent triple has cosine matrix , which is not positive definite, so the metric flag test leaves it unfilled [F10]. The empty matrix is positive definite by [F17], each singleton has matrix , and every pair is an edge with positive-definite matrix by the preceding calculation. Thus the only pairwise adjacent set failing to span a simplex is the triple, whose matrix is not positive definite, so both directions of the metric-flag condition hold. The three incident rank-two cells contribute local link angles each by [F15], for total angle ; when , they are regular hexagons by [F8].
Clause (iii). Let every distinct pair in the finite set have label . For each distinct , [F4,F5] give the pair matrix , which is positive semidefinite with radical and is not positive definite; hence is infinite by [F6,F13]. No pair is spherical, so [F2] makes discrete; [F7] gives Davis cells of dimension at most one and [F3] identifies the link with the points of at pairwise truncated distance . By [F9], points of radii on the same ray have distance , and points on distinct rays have distance ; if either radius is zero, the cone-apex formula gives the same result. Thus the cone is the metric star of rays: a point for , a ray for , and for an isometric copy of by sending the two rays to opposite half-lines. The almost-negative matrix has off-diagonal entries ; for its quadratic form is and its kernel is . The metric flag test holds: a pairwise adjacent set has at most one vertex, the empty matrix is positive definite by [F17], and a singleton has matrix [F10].
Clause (i), CAT(1). Step 1.1 identifies the link with an interval of length . For any three points ordered along it, the side lengths are with , so the perimeter is . The spherical comparison triangle is the same degenerate great-circle segment, since the longest side is the sum of the other two and is less than ; corresponding side-point distances therefore agree. Thus the interval satisfies the CAT(1) comparison. Its closed midpoint ball of radius is the whole interval and is convex.
Clause (ii), CAT(1). Step 1.2 identifies the link with the round circle of circumference . By [F12], this is the equality case of the criterion that is CAT(1) exactly when . The three incident rank-two cells contribute the local angles each by [F15], for total angle ; when , they are regular hexagons by [F8].
Clause (iii), CAT(1). Step 2.1 gives a discrete link with distinct points at distance . Every pair at distance is identical and has the constant geodesic; a triangle with any two distinct vertices has perimeter at least , so the only tested triangles are constant and satisfy comparison with equality.
Clause (iv) and conclusion. By [F15], each edge has length and cosine , while each non-edge has . Thus the edge length is ; the two formulas coincide for and differ for . In the affine case the pairwise adjacent triple is unfilled precisely because its cosine matrix is semidefinite, not positive definite [F10, step 1.2]. The A-page link description records as finite large metric flag with associated matrix [F16]; the three metric-flag tests here are checked directly in steps 1.1-2.1. The local group, matrix, cone and CAT(1) calculations use no choice; AC is used only for the A-page link-lemma invocation in step 1.1 [F14]. No general 3-circuit classification or CAT(1) theorem for all large metric flag complexes is asserted.
Fixed points of finite subgroups in the infinite dihedral tree and their cell stabilizers
Example
Let be the universal Coxeter system with , , and presentation (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); Fact F1 identifies it with . Let be its Davis complex with 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 and the edges , , its -skeleton is the Cayley graph, and each edge has length because and (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 is a reduced syllable word in the two order-two factors. A word of odd length is a conjugate of or (a reflection) and has order ; a word of even length is conjugate to (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 is either or a two-element subgroup generated by a reflection.
(ii) Vertices have trivial stabilizers. For every the point stabilizer of the vertex is the stabilizer of the -cell , namely (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2) with ). 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 for some and ; this is proved from the normal forms in the verification. Then swaps the endpoints of the edge and fixes its midpoint . Let be the minimum-length representative of ; the carrier cell of is this -cell, and its cell coordinate is , in the relative interior of the chamber face with and . The point-stabilizer formula of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2) gives since and conjugation by an element of the subgroup preserves (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (1), The subgroup generated by a subset, the cyclic subgroup , and cyclic groups). 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 , and for ; the finite subgroup is the rank-one spherical parabolic and the setwise stabilizer of its carrier cell.
(iv) Finite-type contrast. If instead is finite, for example with , then is the single Coxeter cell (Finite Coxeter orbit polytopes, face isometries and their cocycle (1) with , The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)), and the point , which lies in the interior of the top cell, is fixed by the whole finite group : with , and , the point-stabilizer formula gives , the spherical parabolic of full rank; here is spherical because 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 (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 with and , and its Davis complex with the distances .
The presentation of with relations is isomorphic to the free product : 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 with and ; the empty word is , no nonempty reduced word is , and has infinite order (Normal form theorem for free products).
By [F1], the spherical subsets of are exactly ; the Davis cells are vertices and intervals , ; 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)).
The -skeleton of is the Cayley graph ; a rank-one Coxeter cell is the interval , and , so its length is (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)).
Point stabilizers: if has minimum-length representative and a point in the relative interior of its cell has coordinate in the relative interior of , then ; the setwise stabilizer of the cell is . In particular the vertex has stabilizer and the left action on vertices is free (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).
For , is finite exactly when is spherical, for , 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 generated by a subset, the cyclic subgroup , and cyclic groups, Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1), [F1]).
is finite exactly when is positive definite; for a rank-two system with finite , is dihedral of order (proved in The Davis complex as a CW complex: disk cells and the Cayley skeleta, step 6.1); and in finite type the cell is compact and convex with 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)).
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.
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).
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 with , , the Davis complex with , and a conjugate reflection .
Proof technique: direct.
Clause (i). By [F1] every element has a unique reduced syllable word. A word of length is a generator and is an involution. If an odd reduced word has , then and is a shorter odd reduced word. Induction shows that is conjugate to or , so has order . If , . If , the word is or ; [F1] says has infinite order, so every such word has infinite order. Thus every element is the identity, a reflection, or an infinite-order translation. If are reflections, then 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.
The line structure. By [F2] the only spherical subsets are , so there are only vertices and edges, and by [F3] the -skeleton is . Let and, for , set and . The normal forms of [F1] show these vertices are distinct and exhaust : even reduced words are ; odd words starting with are for , and odd words starting with are for . Consecutive vertices differ by right multiplication by and , respectively, so this indexes the Cayley graph as a bi-infinite line. Send to and extend linearly over each edge. Each edge has length 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 ; 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 , and is a metric line. Every isometry of this line is either a translation or a reflection: after writing , one has or , and the distances to these two points determine uniquely as or . Therefore a nonidentity involution is a reflection with exactly one fixed point. The action on vertices is free by [F4].
Clause (ii). Let . By [F2] the vertex is the -cell , whose relative interior is ; by [F4] applied with and , . A finite subgroup fixing a vertex lies in , so it is trivial.
Clause (iv). Assume now that is finite with and . Then is positive definite by [F6], is spherical and , so every spherical coset is contained in and indexes a face of the single top cell by The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2). Hence ; the universal-system description in [F2] is not used in this finite case. The point lies in the interior of by [F6], so in the top-cell chart it has and ; the point-stabilizer formula of [F4] gives . Here is dihedral of order by [F6], and is a spherical parabolic of full rank.
Clause (iii). Let 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 . By step 1.3 no nontrivial element fixes a vertex, so lies in the interior of an edge. The edge enumeration in step 1.2 writes its carrier as for some , , with endpoints and . The reflection swaps these endpoints, so and . In the -chart the midpoint has coordinate , in the chamber face , . The formula of [F4] gives . Since , this is ; it is the setwise stabilizer of the carrier edge and a conjugate of the rank-one spherical parabolic 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.
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 -cell with stabilizer the conjugate spherical parabolic ; in the finite rank-two case the whole group fixes the interior point of the top cell, with stabilizer . 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 of a -cell the point of lies in the relative interior of the chamber face with and , and the formula of Finite subgroups of a Coxeter group lie in spherical parabolics (2) returns the full rank-one parabolic , which here is the two-element group . This is the extreme opposite to the vertex case of clause (ii), where and the stabilizer is trivial.
- Consistency with the general theorem. The containment of step 2.1 and the containment 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
- M. W. Davis, The Geometry and Topology of Coxeter Groups, first-edition author manuscript, 2007-2008
- M. R. Bridson and A. Haefliger, Metric Spaces of Non-Positive Curvature, Grundlehren der mathematischen Wissenschaften 319, Springer 1999
- M. W. Davis and G. Moussong, Notes on nonpositively curved polyhedra, Turan Workshop notes (1998/1999)
- M. W. Davis, The geometry and topology of Coxeter groups, MSC lecture slides (Tsinghua University, 2013)