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.
Spherical Parabolic Cosets and the Davis Complex — 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
- 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
- Coxeter Polyhedral Gluings and Intrinsic Metrics
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- 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
- Further Trigonometric Identities and Inverse Functions
- Graphs of Groups and Bass Serre Theory
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Hnn Extensions and Brittons Lemma
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Simplicial Subdivision and Simplicial Approximation
- Simplicial Trees and Group Actions
- Sine, Cosine, and the Definition of Pi
- Spherical Parabolic Cosets and the Davis Complex
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach 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 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 draft companion is a dependency leaf. Its exercises and examples use the theory of spherical-parabolic-cosets-and-the-davis-complex, free-products-and-amalgamation for free-product normal forms, and graphs-of-groups-and-bass-serre-theory for the universal-Coxeter tree; no other theory page may depend on a supplier homed here.
The five examples compute the A2 hexagon, the right-angled box, the B2 octagon, the universal-Coxeter tree and the spherical residues with their chamber quotients. They keep the chosen mirror distances explicit and distinguish the finite Coxeter sphere from the contractible Davis cell.
The finite examples count coset cells and subdivision simplices, identify the boundary cellulations and compute their metrics. The universal example proves the reduced-word tree, its low-rank cases and its Bass–Serre coset subdivision. The residue example separates the simplicial link from the coarser cell link and explains the duality between the finite boundary cellulation and the Coxeter complex.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The A2 Davis complex is a hexagon whose boundary is the Coxeter complex circle
Statement
Let with , and let be the Coxeter group of type , so and (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)). Let , , and be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization, and let be the Coxeter cells of Finite Coxeter orbit polytopes, face isometries and their cocycle.
(i) The spherical subsets are . The spherical-coset cellulation has six -cells, three edges of type , three edges of type , and one -cell, hence cells.
(ii) If , then is a regular hexagon. The order-complex realization is homeomorphic to the barycentric subdivision of , so the Davis complex is a closed disk. Its coarse Coxeter-cell structure has Euler characteristic .
(iii) The proper spherical-coset cells form the boundary cycle: six vertices and six edges. This circle is the Coxeter complex of type , namely the Coxeter complex of the proper parabolic subgroups, as in The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4).
(iv) The chamber consists of the two triangles and glued along their common edge , so it is a square with a diagonal. The quotient is homeomorphic to and is compact (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)). The link of each vertex in the hexagonal cell structure is a closed interval, the nerve consisting of the single -simplex with vertices .
(v) Thus the finite Coxeter complex is the boundary circle , while the Davis complex itself is the disk and is contractible. These are different spaces.
Facts & Assumptions
Given: The Coxeter matrix on with , its group , the spherical subsets , the spherical-coset poset , and .
The spherical subsets are those for which is finite; the nerve has vertex set and its nonempty simplices are the nonempty spherical subsets; and (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(3)).
Typed spherical cosets are equal exactly when their types agree and their representatives differ by an element of the corresponding parabolic; their nonempty intersections and quotient-poset structure are given by the coset criteria (Equality, inclusion and intersection of spherical cosets, and the quotient poset (1),(3),(4)).
For spherical , satisfies , and is a compact convex polyhedral cell of dimension with in its interior; its nonempty faces are exactly the faces indexed by spherical cosets inside (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).
The canonical map from to the cell gluing is a homeomorphism and carries the subposet below each spherical coset onto the barycentric subdivision of its Coxeter cell (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).
Under the cellulation, a coset indexes a cell of dimension , and the cells are exactly the images of the corresponding Coxeter cells (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).
The quotient is homeomorphic to the chamber and is compact (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).
On the rank-two plane, and ; the simple reflections preserve , and has determinant and trace when (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)).
The canonical reflection representation satisfies and (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)).
The Coxeter presentation has relators for each generator and for each distinct pair with finite (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
In type , the assignment of the two generators to adjacent transpositions extends to an isomorphism (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)).
For a finite Coxeter system of rank at least one, the cosets of proper parabolics give the spherical Coxeter complex, a triangulation of the unit sphere, with face poset the coset face poset (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4)).
A finite dihedral orbit polytope of order is a -gon and is regular when its generating point is equidistant from the two rays bounding the fundamental sector (Davis, The Geometry and Topology of Coxeter Groups, Example 7.3.2(ii), p. 129).
In type , the coarser cell structure has six -cells, six -cells, and one -cell (Boyd, Homology of Coxeter and Artin groups, Example 1.3.11, pp. 23-24).
Proof
By [F9], the relations are and . Put ; then , so every word reduces to or with . The map , is onto , so the six normal forms are distinct and , in agreement with [F10]. Thus and each have index , while . The cosets are and the six singleton cosets . The equality criterion [F2] shows that these are distinct within each type, and different types give different cells. Since every subset of is spherical, these are all cells; their dimensions are by [F3],[F5]. This gives cells, agreeing with the coarser counts of [F13].
In the rank-two reflection plane, the reflecting lines bound a sector of angle : by [F7] their unit normals have inner product , so the normals meet at angle and their perpendicular lines meet at angle . By [F8], the action defining sends to these two reflections. The distances of from the two walls are and by [F3]. If , then lies on the sector's internal angle bisector. Choose angular coordinates with the walls at and ; then has angle . The reflections preserve , and their product has determinant and trace by [F7], so in this Euclidean plane it is a rotation by or . The orbit angles are therefore and for . These are the six equally spaced angles , . Their convex hull is a regular hexagon, as also recorded in [F12].
The proper nonempty faces of are its six vertices and six edge cosets by [F3] and the lists in step 1.1. The boundary walk alternates the two labels and has vertices : they are distinct up to the repeated endpoint by the six normal forms in step 1.1. Hence the proper cells form a -cycle, which is the rank-two Coxeter complex described by [F11]. Since itself is spherical, [F1] makes the single -simplex on . At each hexagon vertex there are exactly two incident edges, one of each label, and the unique -cell joins their directions; its local link is therefore one closed interval, the same -simplex .
The order complex of the four-element poset has the two triangles and , glued along , so its realization is the stated square chamber . By [F4], the subposet below the maximal coset (which is all of ) realizes the barycentric subdivision of ; consequently is homeomorphic to the closed disk . Its coarse cellulation has the six vertices, six edges, and one face from step 1.1, giving Euler characteristic , in agreement with [F13]. Since is convex and contains by [F3], the homotopy contracts it to . The quotient statement follows from [F6]. All group and coset lists are finite and explicit, so no Choice is used.
Remarks
The presentation and type-A suppliers are used in step 1.1; the rank-two reflection formula and canonical action in step 1.2; the finite chamber theorem in step 2.1; and the cellulation and chamber-quotient theorem in step 3.1. Source comparisons [F12] and [F13] corroborate the local computations; they do not replace those arguments.
The right-angled cube Davis complex and its boundary 2-sphere
Example
Let with for all distinct , let be the presented group with length , let carry the Coxeter form , and let , , , be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization. The diagram of then has no edges (Coxeter diagrams: edges, labels, components and finite type (1)); by the disconnected-diagram product theorem and the one-generator presentation, (Disconnected diagrams, direct products, and comparison of invariant forms (1), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so every subset of generates a finite subgroup:
(i) For every one has and , so every subset of is spherical; and in the -orthogonal decomposition (Disconnected diagrams, direct products, and comparison of invariant forms (1),(2)) the Coxeter cell of Finite Coxeter orbit polytopes, face isometries and their cocycle (1) is the rectangular box a compact convex polyhedral cell of dimension whose nonempty face poset is the coset poset of : each nonempty face is indexed uniquely by a coset , and face containment matches coset containment; it is a Euclidean cube when the numbers , , are equal. For the cell is a (possibly rectangular) -cube.
(ii) The cellulation of has vertices, edges, rectangular -cells (combinatorial squares) and one -cell, hence cells in all (Equality, inclusion and intersection of spherical cosets, and the quotient poset (1),(3)); is homeomorphic to the barycentrically subdivided box (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)), which is convex and hence contractible, and the alternating cell count gives Euler characteristic .
(iii) The proper cells of the cellulation form the boundary , the cubical -sphere with vertices, edges and rectangular -faces (combinatorial squares). The Coxeter complex of The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4) is the dual cellulation of the same sphere: it has vertices, the codimension-one cosets , and triangles, one for each vertex of the box; it is an octahedron.
(iv) The chamber is the Boolean-lattice order complex; under it is the six-tetrahedron staircase triangulation of , since its maximal chains are the chains . The quotient is compact (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)); the barycentric subdivision of has tetrahedra, matching the chambers, each with six tetrahedra.
(v) Thus the right-angled cells are boxes, cubes when the agree, in contrast to the dihedral hexagon and octagon of the companion examples.
Facts & Assumptions
Given: with for all distinct ; the presented group with length ; the space with the Coxeter form , the canonical representation and the reflections ; the diagram ; positive numbers ; and the objects , , , of Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization.
The diagram has vertex set and an edge between distinct exactly when , so here has no edges and its components are the singletons ; moreover is a Coxeter system for the restricted matrix. (Coxeter diagrams: edges, labels, components and finite type (1),(2), Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1),(2), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
For every , has the Coxeter presentation restricted to ; in particular has the single generator and the single relator . (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
If the diagram is disconnected with components , the multiplication map is a group isomorphism. (Disconnected diagrams, direct products, and comparison of invariant forms (1)).
The Coxeter cell: for spherical the point lies at distance from the simple mirror of , and is a compact convex polyhedral cell of dimension whose nonempty faces are exactly the sets , , , each occurring for exactly one coset , with face inclusion agreeing with coset inclusion. (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).
Reflection formula and invariance: for with the map is linear and involutive, preserves , fixes pointwise and satisfies ; moreover . (The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2), The canonical reflection homomorphism, roots, reflections, and the positive cone (1)).
The projection , , is well-defined; the members of are the left cosets of the subgroups , and each fixed-type coset family partitions . (Equality, inclusion and intersection of spherical cosets, and the quotient poset (1), Left and right cosets and of a subgroup).
The canonical barycentric-subdivision map is a homeomorphism carrying the subposet below each cell address onto the barycentric subdivision of . (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).
Under this identification, cells indexed by have dimension , and there is one -orbit of cells for each spherical type. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).
The quotient is compact and is a strict fundamental domain. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).
The chamber is , the order complex of the poset of spherical subsets; since is finite, is finite and compact. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (3)).
The chambers of are the images and the map is injective. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (4)).
Coxeter complex: in finite type the assignment is a bijection from the proper spherical cosets onto the proper faces of the chamber decomposition with , and the abstract simplicial complex with vertices the cosets and simplices the sets , , is a triangulation of . (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (3),(4)).
The Euler characteristic of a finite CW complex is the alternating sum of its numbers of cells by dimension. (Euler characteristic of a finite CW complex).
When , the Coxeter polytope is a product of intervals and is a regular -cube when the generating point is equidistant from the bounding hyperplanes (Davis, The Geometry and Topology of Coxeter Groups, Example 7.3.2(iii), p. 129).
For disconnected diagram components, the spaces form a -orthogonal direct sum, and each factor action preserves its own component space and fixes the other component spaces pointwise. (Disconnected diagrams, direct products, and comparison of invariant forms (2)).
For a finite group and a subgroup , . (Lagrange's theorem: for every subgroup of a finite group ).
Coset inclusion satisfies if and only if and . (Equality, inclusion and intersection of spherical cosets, and the quotient poset (2)).
The Coxeter form has for every . (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).
Verification
The diagram has no edges by [F1], so its components are the singletons . For each singleton , [F2] gives the restricted presentation with only the relator : every word reduces to or , while the map sending to the nonidentity element of respects the relator and separates them. Thus has order . By [F3], multiplication is an isomorphism , so and . For , ; for the order-two calculation applies; and for the restricted diagram has singleton components, so [F3] gives and . Hence every subset of is spherical and is the full power set.
For , step 1.1 and the convention give , while , , and , the product over the empty set. For every nonempty , step 1.1 gives sphericality; fix such a and let be as in [F4]. By [F15] applied to , the sum is -orthogonal, and by [F18] , so forces and . For the reflection fixes pointwise for , because and the reflection formula of [F5] reduces to when , while since ; hence is exactly the set of points with , the vertex set of the box of (i).
By step 1.1 every is spherical. The cells of the cellulation are the cosets , one for each element of , and have dimension by [F7,F8]. The cosets of each partition by [F6], and Lagrange's formula [F16] gives their number as : there are cosets of (the vertices), of the rank-one parabolics (the edges), of the rank-two parabolics (the rectangular -cells, combinatorial squares) and one coset (the top -cell), so there are cells in all. Since is the maximum coset, every cell is a face of the top cell, and is the barycentric subdivision of by [F7]; the contraction of the convex box to transfers through this homeomorphism to a contraction of , while the alternating count of [F13] gives .
Write and . The convex hull of a product of finite sets is the product of the convex hulls: a convex combination of product points has coordinates , and conversely a tuple of convex combinations with coefficient vectors is the convex combination of product points with weights ; therefore by [step 2.1], a box of dimension , agreeing with the product-of-intervals description [F14]. Its nonempty faces are products with a set of free coordinates and signs fixed on ; the face indexed by has the signs of on . For these faces satisfy exactly when and have the same signs outside , which, by [F17], is equivalent to . Thus every nonempty box face is indexed by exactly one parabolic coset, and face-containment and coset-containment agree (so the reverse-inclusion nonempty face and coset posets agree as well); the additional empty face has no coset index.
By step 1.1 all proper subsets are spherical, and they index exactly the proper nonempty faces of the top cell by [F4]; by [F7] those faces are the boundary cells of , so they are the vertices, edges and rectangular -faces of [step 2.2]. By step 3.1, in the orthonormal coordinates ; radial projection sends to and has continuous inverse , so this boundary is a -sphere; the alternating count gives by [F13].
The chamber is the order complex of the full power set of by [F10] and [step 1.1]. Every chain extends to a maximal chain. Map each vertex to its characteristic vector . For a permutation , the chain gives a tetrahedron with vertices . Every point lies in one of these tetrahedra: choose an ordering and write it as the convex combination with coefficients , , , and on those four vertices. The coefficients are nonnegative and sum to one; strict coordinate orders give disjoint tetrahedron interiors, while ties make the corresponding coefficient differences zero and put the point in a shared face. Hence these six characteristic-vector tetrahedra triangulate the cube and give a homeomorphism ; has six top simplices. By [F9] the quotient is homeomorphic to , and by [F11] the chambers are the eight distinct translates [step 1.1]. By step 3.1, is a box; its barycentric subdivision has top simplices, by choosing a box vertex, an incident edge and an incident -face; this agrees with the tetrahedra in the chamber translates.
Write an element of as its sign vector under the direct-product isomorphism of step 1.1. A Coxeter-complex vertex of type is the coset ; it is determined exactly by the -coordinate , since that parabolic changes the other two coordinates freely. Thus the six Coxeter-complex vertices are the three opposite pairs for . The chamber indexed by is the triangle with vertices , so the eight chambers are precisely all choices of one vertex from each opposite pair. This is the octahedral triangulation: its vertices are the six signed coordinate directions and its triangles choose one from each opposite pair. By step 3.1 these labels are the coordinate faces of the box; a rectangular -face with fixed -coordinate corresponds to the Coxeter vertex ; a box vertex corresponds to the Coxeter triangle with those three vertices; a box edge with two fixed coordinates corresponds to the Coxeter edge joining the two matching signed vertices; and their incidences are reversed. This proves that the cubical boundary and the Coxeter complex are dual cellulations of the same -sphere, not the same cellulation.
The clauses are proved: (i) is [step 2.1] with [step 3.1], (ii) is [step 2.2], (iii) is [step 4.1] with [step 5.1], (iv) is [step 4.2], and (v) restates (i). No Choice is used: all groups, hulls and cell families here are finite, and the only identifications are the explicit ones of the cited clauses.
Remarks
The item remains escalated while these in-run suppliers require current decisions or audits. Consumer ex-cg-right-angled-cube-davis-complex uses def-cg-spherical-nerve-coset-poset-and-davis-realization in step 4.2; lem-cg-spherical-coset-inclusion-and-intersection in steps 2.2 and 3.1; lem-cg-finite-coxeter-orbit-polytopes-and-face-metrics in steps 2.1, 3.1, and 4.1; and thm-cg-davis-complex-cell-incidence-and-stabilizers in steps 2.2, 4.1, and 4.2. Its cross-batch suppliers are def-cg-coxeter-diagram-components-and-finite-type (step 1.1); lem-cg-diagram-products-and-invariant-form-comparison (steps 1.1 and 2.1); def-cg-real-coxeter-form-and-reflection, lem-cg-reflection-form-invariance-and-rank-two-orders, and def-cg-canonical-reflection-homomorphism (step 2.1); thm-hh-parabolic-minimal-representatives-and-length-additivity and def-hh-coxeter-matrix-word-group-and-length (step 1.1); and thm-cg-finite-chamber-tiling-and-coset-face-identification (step 5.1). These supplier statements were inspected provisionally; keep each obligation open until its current Step-3 decision and this exact use are reconciled.
The B2 Davis complex is an octagon whose boundary is the Coxeter complex circle
Example
Let with , and use the Coxeter cells with positive distances .
(i) is dihedral of order , all four subsets of are spherical, and there are eight vertices, four edges of each label, and one -cell: cells in all.
(ii) For , is a regular octagon and is its barycentric subdivision, a closed disk. Its proper cells form an eight-edge boundary circle, identified with the rank-two Coxeter complex.
(iii) consists of the two triangles and along their common diagonal, hence is a square. The compact quotient is homeomorphic to . The octagon subdivision has triangles, eight translates of the two chamber triangles.
(iv) If , the cell is an octagon with alternating edge lengths , so it is not regular. Its cell counts and disk topology are unchanged.
Facts & Assumptions
Given: with , its presented group , positive distances , and the Davis cellulation.
Spherical types are precisely those with finite parabolic groups; cells are indexed by spherical cosets (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization, Equality, inclusion and intersection of spherical cosets, and the quotient poset (1)).
The cells have dimension , and the face map is an isometry from onto the face indexed by (Finite Coxeter orbit polytopes, face isometries and their cocycle (1),(3)).
The Davis realization has one cell for each spherical coset, subdivides each such cell by its coset subposet, and has compact chamber quotient (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2),(4)).
The cells are closed balls; for rank two with equal distances, the orbit cell is regular with sides, and each rank-one cell is the interval from to (The Davis complex as a CW complex: disk cells and the Cayley skeleta (1),(4)).
In finite type the proper parabolic cosets index the spherical Coxeter complex with incidence reversed (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (3),(4)).
For with , the Coxeter presentation has relators , and every map of into a group satisfying these relators extends uniquely to a homomorphism from (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
If is finite and , then (Lagrange's theorem: for every subgroup of a finite group ).
Verification
By [F6], . Put ; then , , and , so . Moving every to the right and reducing powers of shows that every element is one of or for , hence . To separate these eight forms, let and on ; both are reflections, is a quarter-turn, and the eight maps and are distinct. By [F6] these assignments define a homomorphism from onto the eight-element symmetry group of the square, so and the forms are distinct. The images also show , hence and ; all four subsets are spherical by [F1]. By [F7], each singleton parabolic has four left cosets in . There are eight singleton cosets and one top coset , so [F1]–[F3] give cells.
By [F2] and [step 1.1], the top cell is a two-dimensional convex polytope with eight vertices and eight edges, so it is an octagon; [F4] makes it regular when . At each vertex , the incident rank-one cosets are exactly and : both contain , and any coset of either type containing equals the corresponding one by [F1]. Thus the edge labels alternate. All cosets lie below , so [F3] identifies with its barycentric subdivision, and [F4] gives a closed disk. The boundary consists of its eight vertices and eight edges. These proper cosets label the rank-two Coxeter complex by [F5]; both graphs are cycles with alternating singleton types, and exchanging their vertex and edge labels gives the dual circle identification.
The spherical-subset poset has exactly two maximal chains and ; their triangles meet in the diagonal , producing . By [F3] it is the compact quotient. Every maximal coset chain chooses one of eight vertices and one of its two incident edges before the top cell, giving triangles. Each vertex gives the two chains and , precisely the translate .
Each edge of label or is isometric to its rank-one cell by [F2], and has length or by [F4]. Labels alternate around the octagon, so unequal distances give unequal side lengths and exclude regularity. For every positive distance family [F2] gives the same coset faces and [F4] gives the disk topology. All calculations and constructions are finite, so no Choice is used.
The universal Coxeter Davis complex is a tree
Example
Let be finite and for distinct generators. Then is the free product of the groups .
(i) The spherical types are exactly and the singletons. The nerve is the discrete set , and the only cells are vertices and edges .
(ii) The coarse Davis cellulation is the Cayley tree, of valence when : a bi-infinite line for , and the -regular tree for . Its edge of label has length , giving unit edges when all . For it is a point, and for a single interval.
(iii) is the cone on the discrete set , a fan of intervals; is compact. The coarse link at each vertex is the discrete nerve .
(iv) The tree is contractible. Its barycentric subdivision is the Bass–Serre coset tree of the graph of groups over the fan, with trivial central and edge groups and order-two leaf group at leaf . Its vertices are and the cosets ; edges join to . The stabilizer of a central vertex or open half-edge is trivial, and that of the leaf vertex is . This is a graph-of-groups description; it is not an ordinary topological covering of a wedge of real projective lines.
Facts & Assumptions
Given: A finite set with for distinct , its presented group , positive distances , and the Davis cellulation.
Spherical types and the nerve are defined by finite parabolics; is the inclusion-poset realization and is the cone on the subdivided nerve (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(3)).
The Coxeter presentation here has only the relations (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The coarse one-skeleton is the undirected Cayley graph, a rank-one cell joins to and has length (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4)).
The metric induces the cell topology, the compact quotient is , and spherical coset has setwise stabilizer (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2),(4)).
A free product is characterized by the unique extension of homomorphisms from its factors (The free product of an arbitrary family of groups).
A graph of groups has vertex groups, edge groups and injective boundary homomorphisms. Its path group is generated by these vertex groups and oriented edges with edge reversal and conjugation relations; the fundamental group relative to a maximal tree additionally sets the tree-edge symbols equal to . Its Bass–Serre graph has vertices and edges the corresponding left cosets, with the stated coset incidence (A graph of groups, The path group of a graph of groups, The fundamental group of a graph of groups relative to a maximal tree, The Bass-Serre tree of a graph of groups).
Verification
Let be the finite words in with no equal adjacent letters, including the empty word. Define on by deleting the initial if present and otherwise prefixing . This is an involution, so [F2] gives an action of on . Cancellation of adjacent equal letters reduces every word to a member of . With composition right-to-left, a reduced word sends the empty word to exactly that word; distinct reduced words therefore represent distinct elements of . In particular each has order two, and alternating words in distinct give infinitely many elements of . Any type of size at least two is consequently infinite, while the empty and singleton types are finite, proving (i) by [F1]. For factor homomorphisms into an arbitrary group, the images of the generators satisfy precisely , so [F2] extends them uniquely to . This is the universal property [F5], proving the free-product assertion.
By (i) and [F3], only the Cayley graph occurs. It is connected because generates . A closed nonbacktracking edge walk would give a nonempty reduced word representing , contradicting step 1.1. Thus it is a tree. The neighbors are distinct for distinct by the same normal form, so its valence is . For two generators the unique reduced words alternate and give the bi-infinite line; three give valence three. The zero-generator group is trivial and gives a point; one generator gives two vertices and one interval. Lengths follow from [F3]. Each vertex has one incident edge of each label and no higher cells, giving the discrete link .
The poset of spherical types has a least element and the incomparable singleton types. Its realization is therefore the asserted fan, and [F4] supplies its compact quotient. The barycentric subdivision of the Cayley tree has vertices and midpoint vertices , and one half-edge joining each such pair. Left multiplication acts on all labels. A central vertex has trivial stabilizer. A half-edge has one central and one midpoint endpoint, so an element preserving it must fix its central endpoint and is therefore trivial; a midpoint vertex has stabilizer by coset equality. For the graph of groups on this fan, put the trivial group at the center and every edge, and at leaf , with the unique injections from the trivial edge groups. The fan itself is a maximal tree; [F6] kills all edge symbols, and trivial edge groups add no conjugation relations, leaving exactly the presentation in [F2]. The Bass–Serre coset incidence of [F6] now joins to , exactly the subdivision just described. This proves the full graph-of-groups claim without an ordinary covering assertion.
Root the metric tree at . Each point has a unique finite arc : connectivity supplies a finite edge route to a cell containing , and the absence of cycles makes its reduced route unique. Define to be the point at distance along that arc. To check continuity, for let their root arcs share the initial segment of length , and write , . If both contracted points lie beyond that common segment, their distance is ; if both are on the common segment it is ; if just one is beyond it, it is . Thus , and . The triangle inequality gives joint continuity, including at the root. By [F4] this is continuity in the Davis topology. Since , , and , the tree is contractible. All normal forms and routes are explicit finite constructions, so no Choice is used.
Residues, the compact chamber quotient, and the finite Coxeter sphere versus the contractible Davis cell
Example
Let be a Coxeter matrix with finite, let be its presented group, and let , , , the nerve , and the chamber be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization. For each spherical , let be the Coxeter cell defined from positive distances as in Finite Coxeter orbit polytopes, face isometries and their cocycle. Put . Distinguish the simplicial order-complex structure on from its coarser Coxeter-cell structure. Then:
(i) In the simplicial order-complex structure, the link of the vertex is . In the coarser polyhedral cell structure, its vertex link is . For a cell , define its coface residue to be the order subcomplex induced by the cosets ; its simplices are the chains of cells having as a face.
(ii) The orbit quotient is homeomorphic to , a finite cone on ; the action is proper and is a strict fundamental domain.
(iii) If is finite, then is the maximum spherical subset and indexes the unique top cell. For , is a point and its boundary is . For , is the barycentric subdivision of the convex cell , hence a contractible -ball, and its proper-coset cells form the boundary sphere . The Coxeter complex is the dual triangulation of this boundary cellulation: a proper spherical coset indexes a boundary cell of dimension and a Coxeter simplex of dimension , with incidence reversed. Their barycentric subdivisions agree. The finite Coxeter complex has an -simplex as a fundamental chamber; is instead the -dimensional cone on .
(iv) With equal distances, the finite rank-two cases and have regular hexagon and octagon top cells. The all-right-angled rank-three case has a rectangular box top cell, a Euclidean cube when its three distances agree. In the infinite-dihedral case is a line, and for a universal Coxeter matrix with at least three generators it is a regular tree. Contractibility of a general infinite Davis complex is not asserted here; it is the later CAT(0) theorem.
Facts & Assumptions
Given: A finite Coxeter matrix , its presented group , the spherical-subset poset , the spherical-coset poset , its order-complex realization , the nerve , the chamber , the positive distances , the Coxeter cells and generating points , and .
A subset is spherical exactly when is finite; and every singleton is spherical; the nonempty simplices of the nerve are the nonempty spherical subsets. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).
is the geometric realization of the inclusion poset of spherical cosets, and its simplices are finite chains. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (3)).
is the cone with apex on ; since is finite, is finite and compact. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (3)).
Coset inclusion is characterized by if and only if and . (Equality, inclusion and intersection of spherical cosets, and the quotient poset (2)).
has vertices the nonempty faces of and simplices the strict chains of nonempty faces. (Barycentric subdivision of an abstract simplicial complex).
For spherical , and is a compact convex polyhedral cell of dimension with in its interior; its nonempty faces are exactly , indexed uniquely by . (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).
The canonical map is a homeomorphism onto the glued complex and carries the subposet below each cell address onto the barycentric subdivision of . (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).
Under this identification, the cells indexed by have dimension , and there is one -orbit of cells for each spherical type. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).
The cellular -action on is proper. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (3)).
is compact and homeomorphic to , which is a strict fundamental domain. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).
For finite type with , the Coxeter complex triangulates ; the simplex labelled by has the standard chamber section as its spherical realization, and maximal simplices are indexed by chambers. (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4)).
The one-skeleton of is the undirected -labelled Cayley graph; its finite rank-two cells are the cosets . (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3)).
For , is the regular -gon when . (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4)).
The Coxeter presentation has relators for and for distinct with finite ; an infinite label imposes no relator. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Definition).
The Coxeter form has and for finite . (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).
Each simple reflection is linear and involutive, fixes pointwise, preserves , and sends to . (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)).
The canonical reflection homomorphism satisfies for every . (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)).
In the coarser cell structure on the Davis complex, the link of each vertex is isomorphic to the nerve . (Davis, The Geometry and Topology of Coxeter Groups, Proposition 7.3.4, printed p. 130).
The simplicial link of a simplex consists of simplices disjoint from for which is a simplex. (Subcomplexes, closures, stars, and links in a simplicial complex).
Every nonempty Coxeter cell is homeomorphic to a closed -ball, and its boundary maps to the unit sphere; the empty type is a point. (The Davis complex as a CW complex: disk cells and the Cayley skeleta (1)).
The Coxeter simplex labelled by has vertices for , hence dimension . (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4)).
In finite type, every -orbit in meets the standard chamber in exactly one point; intersecting with the invariant sphere gives a strict fundamental chamber section. (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1)).
Coset-face incidence in the finite Coxeter complex reverses coset inclusion: if and only if . (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (3)).
If two spherical cosets meet, their intersection is a coset of type . (Equality, inclusion and intersection of spherical cosets, and the quotient poset (3)).
For the finite subsystem and in its open chamber, the inversion expansion gives for every (The finite-type Coxeter cell: exposed faces and normal cones (1)).
Verification
A simplex in the simplicial link of is a chain in ; this is the link convention of [F19]. Write . By [F4], forces , and the same criterion shows that exactly when ; conversely every such chain of nonempty spherical types gives a simplex in the link. By [F5], these are precisely the simplices of . The coface residue of any cell is the order subcomplex induced by , since an order-complex simplex is a chain; this gives the asserted residue.
By [F9] the -action on is proper. By [F10] its orbit quotient is homeomorphic to and is a strict fundamental domain. Since is finite, is finite by [F3], hence the quotient is compact.
Suppose is finite. Then and is the maximum coset, so [F7] identifies with the barycentric subdivision of the unique top cell . If , and are points and their boundary is . If , [F20] makes a closed -ball with boundary , and [F7] gives the same topology for ; in particular is contractible. Its boundary cells are indexed by the proper spherical cosets with ; [F6,F8] give their dimensions . By [F21,F23], the same coset labels a Coxeter simplex of dimension , and its face incidence reverses coset inclusion. Thus the boundary cellulation and Coxeter triangulation are dual. Their face-poset flags correspond by reversing each finite coset chain, so the barycentric subdivisions are isomorphic. By [F11,F22], the standard chamber section is a fundamental -simplex of the Coxeter complex; is instead the -dimensional cone on by [F3].
For a finite rank-two system with or , choose . [F13] gives a regular -gon, so the and top cells are a hexagon and an octagon; [F7] identifies their Davis complexes with the barycentric subdivisions of these cells. For the all-right-angled three-generator case, [F14] gives and , so for each pair. The homomorphism sending each generator to its basis vector is therefore well-defined, and the homomorphism back sending the basis vectors to is well-defined by commutativity and involutivity; their composites fix generators, so . By [F15] the Coxeter form is diagonal with ; [F16,F17] make each simple reflection flip just its own coordinate. Then , , and the orbit consists of all sign vectors . Its convex hull is the product , a box and a cube when the distances agree, by [F6]. The finite Davis complex is its barycentric subdivision by [F7].
If is infinite then , so there is no top cell; its -cells are indexed by all , so is not a single finite polytope. For the universal Coxeter matrix, each distinct pair has label . Let be the set of finite words with no equal adjacent letters, including the empty word. For each , define a permutation of by deleting an initial when present and otherwise prefixing . Each is an involution; because [F14] leaves only the relators , the assignment extends to a homomorphism . With composition acting right-to-left, any word maps the empty word to , so no nonempty word in represents the identity. For distinct , the alternating words lie in and map the empty word to distinct words of lengths ; hence every subgroup generated by at least two generators is infinite and is not spherical. By [F1], the only spherical types are and the singletons, so the only cells are vertices and edges; by [F8,F12], is the Cayley graph. A closed path with no immediate backtracking has adjacent distinct edge labels, so its label is a nonempty word in representing , impossible by the action just constructed. The Cayley graph is connected because generates , hence it is a tree. For it is the bi-infinite line; for , distinct generators give distinct neighbors at each vertex, so it is a regular tree of valence .
Fix the vertex . Every incident cell is by [F4]; in its -chart this vertex is with . At , [F25] puts every orbit difference in , while for every by [F6, F15, F16, F17]. Thus the nonnegative hull of , its tangent cone, is exactly . Because the are independent and , its nonzero rays have the cross-section , a simplex with vertices labelled by ; radial normalization identifies this cross-section with the spherical link. The face indexed by , , has tangent cone by the same argument for its orbit hull [F6, F25], so it contributes precisely the simplex face on . Applying the isometry gives the same labelled link at . The empty type contributes the empty simplex. By [F24] two incident cells meet in , and the face isometries in [F7] identify their links along precisely the face on . These simplices are exactly the nerve by [F1]. The simplicial link from step 1.1 is its barycentric subdivision, in agreement with [F18].
Clauses (i)–(iv) follow from steps 1.1, 2.1, 1.2, 1.3, 1.4 and 1.5. All constructions are explicit and use only finite-dimensional coordinate calculations and finite case distinctions; no selection from an arbitrary family is used, so the Axiom of Choice is not needed.
Remarks
This item remains escalated while its in-run suppliers require current decisions and the Step 3a owner hold on the corrected manifest Statement remains open. Consumer ex-cg-spherical-residues-chamber-quotient-and-finite-versus-infinite uses def-cg-spherical-nerve-coset-poset-and-davis-realization in steps 1.1, 1.2, 1.3, 1.5, and 2.1; lem-cg-spherical-coset-inclusion-and-intersection in steps 1.1 and 2.1; lem-cg-finite-coxeter-orbit-polytopes-and-face-metrics in steps 1.3, 1.4, and 2.1; thm-cg-davis-complex-cell-incidence-and-stabilizers in steps 1.2, 1.3, 1.5, 2.1, and 3.1; and lem-cg-davis-cellulation-cw-structure-and-cayley-skeleta in steps 1.3, 1.4, and 1.5. Its cross-batch suppliers are thm-cg-finite-chamber-tiling-and-coset-face-identification (step 1.3); def-hh-coxeter-matrix-word-group-and-length (steps 1.4 and 1.5); and def-cg-real-coxeter-form-and-reflection, lem-cg-reflection-form-invariance-and-rank-two-orders, and def-cg-canonical-reflection-homomorphism (step 1.4). The published barycentric-subdivision and simplicial-link definitions are used in step 1.1. The current supplier statements were inspected provisionally; keep each edge open until the supplier decision and this exact proof use are reconciled. The successor corrected A4 to preserve face/coset inclusion and simultaneously reversed orders; the explicit face formulas used here in steps 1.3, 1.4 and 2.1 remain valid. The example derives the finite and universal cases locally and does not consume later companion examples as suppliers.
Sources
- M. W. Davis, The Geometry and Topology of Coxeter Groups, author manuscript of the first edition (Princeton Univ. Press, 2008)
- R. Boyd, Homology of Coxeter and Artin groups, PhD thesis, University of Aberdeen, 2018 (with corrections)
- M. W. Davis, The Geometry and Topology of Coxeter Groups (MSC lecture slides, Tsinghua, 2013)