Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Spherical Parabolic Cosets and the Davis Complex — Examples

1 · Prerequisites

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

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck pendingaudited 2026-10-08Open item page →

The A2 Davis complex is a hexagon whose boundary is the Coxeter complex circle

Statement

Let S={s,t} with m(s,t)=3, and let W be the Coxeter group of type A2, so W≅S3 and ∣W∣=6 (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)). Let S, WS, and Σ=∣WS∣ be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization, and let CT be the Coxeter cells of Finite Coxeter orbit polytopes, face isometries and their cocycle.

(i) The spherical subsets are S={∅,{s},{t},S}. The spherical-coset cellulation has six 0-cells, three edges of type {s}, three edges of type {t}, and one 2-cell, hence 13 cells.

(ii) If ds=dt, then CS=conv⁡(WxS) is a regular hexagon. The order-complex realization Σ is homeomorphic to the barycentric subdivision of CS, so the Davis complex is a closed disk. Its coarse Coxeter-cell structure has Euler characteristic 6−6+1=1.

(iii) The proper spherical-coset cells form the boundary cycle: six vertices and six edges. This circle is the Coxeter complex of type A2, 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 K=∣S∣ consists of the two triangles ∅<{s}<S and ∅<{t}<S glued along their common edge ∅<S, so it is a square with a diagonal. The quotient W\Σ is homeomorphic to K 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 L consisting of the single 1-simplex with vertices s,t.

(v) Thus the finite Coxeter complex is the boundary circle ∂Σ≅S1, while the Davis complex itself is the disk CS and is contractible. These are different spaces.

Facts & Assumptions

Given: The Coxeter matrix on S={s,t} with m(s,t)=3, its group W, the spherical subsets S, the spherical-coset poset WS, and Σ=∣WS∣.

[F1]

The spherical subsets are those T for which WT is finite; the nerve L has vertex set S and its nonempty simplices are the nonempty spherical subsets; Σ=∣WS∣ and K=∣S∣ (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(3)).

[F2]

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

[F3]

For spherical T, xT=∑u∈Tduvu(T) satisfies B(xT,eu)=du, and CT=conv⁡(WTxT) is a compact convex polyhedral cell of dimension ∣T∣ with 0 in its interior; its nonempty faces are exactly the faces indexed by spherical cosets inside WT (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).

[F4]

The canonical map from ∣WS∣ 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)).

[F5]

Under the cellulation, a coset wWT indexes a cell of dimension ∣T∣, 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)).

[F6]

The quotient W\Σ is homeomorphic to the chamber K and is compact (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).

[F7]

On the rank-two plane, B(es,es)=B(et,et)=1 and B(es,et)=−cos⁡(π/m); the simple reflections preserve B, and rsrt has determinant 1 and trace 2cos⁡(2π/m) when m<∞ (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)).

[F8]

The canonical reflection representation satisfies ρ(s)=rs and ρ(t)=rt (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)).

[F9]

The Coxeter presentation has relators s2 for each generator and (st)m(s,t) for each distinct pair with finite m(s,t) (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F10]

In type A2, the assignment of the two generators to adjacent transpositions extends to an isomorphism W≅S3 (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (4)).

[F11]

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

[F12]

A finite dihedral orbit polytope of order 2m is a 2m-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).

[F13]

In type I2(3), the coarser cell structure has six 0-cells, six 1-cells, and one 2-cell (Boyd, Homology of Coxeter and Artin groups, Example 1.3.11, pp. 23-24).

Proof

technique · direct
1.1F1F2F3F5F9F10F13algebra

By [F9], the relations are s2=t2=1 and (st)3=1. Put r=st; then srs=r−1, so every word reduces to rk or srk with 0≤k<3. The map s↦(12), t↦(23) is onto S3, so the six normal forms are distinct and ∣W∣=6, in agreement with [F10]. Thus W{s}={1,s} and W{t}={1,t} each have index 3, while WS=W. The cosets are W{s}, tW{s}, stW{s};W{t}, sW{t}, tsW{t};W, and the six singleton cosets wW∅. The equality criterion [F2] shows that these are distinct within each type, and different types give different cells. Since every subset of S is spherical, these are all cells; their dimensions are 0,1,2 by [F3],[F5]. This gives 6+3+3+1=13 cells, agreeing with the coarser counts of [F13].

1.2F3F7F8F12algebra

In the rank-two reflection plane, the reflecting lines bound a sector of angle π/3: by [F7] their unit normals have inner product −cos⁡(π/3)=−1/2, so the normals meet at angle 2π/3 and their perpendicular lines meet at angle π/3. By [F8], the action defining CS sends s,t to these two reflections. The distances of xS from the two walls are B(xS,es)=ds and B(xS,et)=dt by [F3]. If ds=dt, then xS lies on the sector's internal angle bisector. Choose angular coordinates with the walls at 0 and π/3; then xS has angle θ=π/6. The reflections preserve B, and their product has determinant 1 and trace 2cos⁡(2π/3)=−1 by [F7], so in this Euclidean plane it is a rotation by 2π/3 or −2π/3. The orbit angles are therefore θ+2kπ/3 and −θ+2kπ/3 for k=0,1,2. These are the six equally spaced angles θ+jπ/3, 0≤j<6. Their convex hull is a regular hexagon, as also recorded in [F12].

2.1step 1.1F1F3F5F11algebra

The proper nonempty faces of CS 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 1,s,st,sts,ts,t,1: they are distinct up to the repeated endpoint by the six normal forms in step 1.1. Hence the proper cells form a 6-cycle, which is the rank-two Coxeter complex described by [F11]. Since S itself is spherical, [F1] makes L the single 1-simplex on s,t. At each hexagon vertex there are exactly two incident edges, one of each label, and the unique 2-cell joins their directions; its local link is therefore one closed interval, the same 1-simplex L.

3.1step 1.1F1F3F4F6F13algebra∎

The order complex of the four-element poset S has the two triangles ∅<{s}<S and ∅<{t}<S, glued along ∅<S, so its realization is the stated square chamber K. By [F4], the subposet below the maximal coset W (which is all of WS) realizes the barycentric subdivision of CS; consequently Σ is homeomorphic to the closed disk CS. Its coarse cellulation has the six vertices, six edges, and one face from step 1.1, giving Euler characteristic 1, in agreement with [F13]. Since CS is convex and contains 0 by [F3], the homotopy H(u,z)=(1−u)z contracts it to 0. 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.

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

The right-angled cube Davis complex and its boundary 2-sphere

Example

Let S={a,b,c} with m(s,t)=2 for all distinct s,t, let W be the presented group with length ℓ, let V=RS carry the Coxeter form B, and let S, WS, Σ=∣WS∣, K=∣S∣ be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization. The diagram of (S,m) then has no edges (Coxeter diagrams: edges, labels, components and finite type (1)); by the disconnected-diagram product theorem and the one-generator presentation, W≅(Z/2)3 (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 S generates a finite subgroup:

(i) For every T⊆S one has WT≅(Z/2)T and ∣WT∣=2∣T∣, so every subset of S is spherical; and in the B-orthogonal decomposition VT=⨁s∈TRes (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 CT=∏s∈T [−dses, dses], a compact convex polyhedral cell of dimension ∣T∣ whose nonempty face poset is the coset poset of WT: each nonempty face is indexed uniquely by a coset uWU, and face containment matches coset containment; it is a Euclidean cube when the numbers ds, s∈T, are equal. For T=S the cell is a (possibly rectangular) 3-cube.

(ii) The cellulation of Σ has 8 vertices, 12 edges, 6 rectangular 2-cells (combinatorial squares) and one 3-cell, hence 27 cells in all (Equality, inclusion and intersection of spherical cosets, and the quotient poset (1),(3)); Σ is homeomorphic to the barycentrically subdivided box CS (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 8−12+6−1=1.

(iii) The proper cells of the cellulation form the boundary ∂Σ≅S2, the cubical 2-sphere with 8 vertices, 12 edges and 6 rectangular 2-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 6 vertices, the codimension-one cosets wWS∖{s}, and 8 triangles, one for each vertex of the box; it is an octahedron.

(iv) The chamber K=∣S∣ is the Boolean-lattice order complex; under T↦1T it is the six-tetrahedron staircase triangulation of [0,1]S, since its maximal chains are the 3!=6 chains ∅⊂{s1}⊂{s1,s2}⊂S. The quotient W\Σ≅K is compact (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)); the barycentric subdivision of CS has 8⋅3⋅2=48 tetrahedra, matching the ∣W∣=8 chambers, each with six tetrahedra.

(v) Thus the right-angled cells are boxes, cubes when the ds agree, in contrast to the dihedral hexagon and octagon of the companion examples.

Facts & Assumptions

Given: S={a,b,c} with m(s,t)=2 for all distinct s,t; the presented group W with length ℓ; the space V=RS with the Coxeter form B, the canonical representation ρ and the reflections ra; the diagram Γ; positive numbers (ds)s∈S; and the objects S, WS, Σ, K of Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization.

[F1]

The diagram has vertex set S and an edge between distinct s,t exactly when m(s,t)≥3, so here Γ has no edges and its components are the singletons {a},{b},{c}; moreover WT=⟨s:s∈T⟩ 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).

[F3]

If the diagram is disconnected with components S1,…,Sk, the multiplication map WS1×⋯×WSk→W is a group isomorphism. (Disconnected diagrams, direct products, and comparison of invariant forms (1)).

[F4]

The Coxeter cell: for spherical T the point xT=∑s∈Tdsvs(T)∈VT lies at distance ds from the simple mirror of s, and CT=conv⁡(WTxT) is a compact convex polyhedral cell of dimension ∣T∣ whose nonempty faces are exactly the sets conv⁡(uWUxT), u∈WT, U⊆T, each occurring for exactly one coset uWU, with face inclusion agreeing with coset inclusion. (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).

[F5]

Reflection formula and invariance: for a∈V with B(a,a)≠0 the map ra(v)=v−2B(v,a)B(a,a)a is linear and involutive, preserves B, fixes {v:B(v,a)=0} pointwise and satisfies ra(a)=−a; moreover ρ(s)=res. (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)).

[F6]

The projection π ⁣:WS→S, wWT↦T, is well-defined; the members of WS are the left cosets of the subgroups WT, and each fixed-type coset family partitions W. (Equality, inclusion and intersection of spherical cosets, and the quotient poset (1), Left and right cosets gH and Hg of a subgroup).

[F7]

The canonical barycentric-subdivision map ∣WS∣→X is a homeomorphism Σ≅X carrying the subposet below each cell address q onto the barycentric subdivision of Cq. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).

[F8]

Under this identification, cells indexed by wWT have dimension ∣T∣, and there is one W-orbit of cells for each spherical type. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).

[F9]

The quotient W\Σ is compact and K is a strict fundamental domain. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).

[F10]

The chamber is K=∣S∣, the order complex of the poset of spherical subsets; since S is finite, K is finite and compact. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (3)).

[F11]

The chambers of Σ are the images wK and the map w↦wK is injective. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (4)).

[F12]

Coxeter complex: in finite type the assignment wWI↦wCI‾ is a bijection from the proper spherical cosets onto the proper faces of the chamber decomposition with wWI⊆vWJ  ⟺  wCJ‾⊆vCI‾, and the abstract simplicial complex with vertices the cosets wWS∖{s} and simplices the sets {wWS∖{s}:s∉I}, I⊊S, is a triangulation of S∣S∣−1. (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (3),(4)).

[F13]

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

[F14]

When WT≅(Z/2)n, the Coxeter polytope is a product of intervals and is a regular n-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).

[F15]

For disconnected diagram components, the spaces Vi form a B-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)).

[F16]

For a finite group G and a subgroup H, ∣G∣=[G:H]∣H∣. (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

[F17]

Coset inclusion satisfies wWU⊆w′WT if and only if U⊆T and w−1w′∈WT. (Equality, inclusion and intersection of spherical cosets, and the quotient poset (2)).

[F18]

The Coxeter form has B(es,es)=1 for every s∈S. (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).

Verification

technique · direct construction in the orthogonal decomposition
1.1F1F2F3algebra

The diagram Γ has no edges by [F1], so its components are the singletons {a},{b},{c}. For each singleton s, [F2] gives the restricted presentation with only the relator s2=1: every word reduces to 1 or s, while the map sending s to the nonidentity element of Z/2 respects the relator and separates them. Thus W{s}={1,s} has order 2. By [F3], multiplication is an isomorphism W{a}×W{b}×W{c}→W, so W≅(Z/2)3 and ∣W∣=8. For T=∅, WT={1}; for ∣T∣=1 the order-two calculation applies; and for ∣T∣≥2 the restricted diagram has singleton components, so [F3] gives WT≅(Z/2)T and ∣WT∣=2∣T∣. Hence every subset of S is spherical and S is the full power set.

2.1step 1.1F4F5F15F18algebra

For T=∅, step 1.1 and the convention ⟨∅⟩={1} give WT={1}, while VT={0}, xT=0, and CT={0}, the product over the empty set. For every nonempty T, step 1.1 gives sphericality; fix such a T and let xT=∑s∈Tdsvs(T) be as in [F4]. By [F15] applied to T, the sum VT=⨁s∈TRes is B-orthogonal, and by [F18] B(es,es)=1, so B(vs(T),et)=δst forces vs(T)=es and xT=∑s∈Tdses. For s∈T the reflection ρ(s)=res fixes et pointwise for t∈T∖{s}, because B(et,es)=0 and the reflection formula of [F5] reduces to res(v)=v when B(v,es)=0, while res(es)=−es since B(es,es)=1; hence ρ(WT)xT is exactly the set of points ∑s∈Tεsdses with εs∈{+1,−1}, the vertex set of the box of (i).

2.2step 1.1F6F7F8F13F16algebra

By step 1.1 every T⊆S is spherical. The cells of the cellulation are the cosets wWT, one for each element of WS, and have dimension ∣T∣ by [F7,F8]. The cosets of each WT partition W by [F6], and Lagrange's formula [F16] gives their number as ∣W∣/∣WT∣=8/2∣T∣: there are 8 cosets of W∅ (the vertices), 3⋅4=12 of the rank-one parabolics (the edges), 3⋅2=6 of the rank-two parabolics (the rectangular 2-cells, combinatorial squares) and one coset WS (the top 3-cell), so there are 27 cells in all. Since WS=W is the maximum coset, every cell is a face of the top cell, and Σ=∣WS∣=∣WS≤WS∣ is the barycentric subdivision of CS by [F7]; the contraction H(t,x)=(1−t)x of the convex box CS to 0 transfers through this homeomorphism to a contraction of Σ, while the alternating count of [F13] gives χ=8−12+6−1=1.

3.1F4F17F14step 2.1algebra

Write Is:=[−dses,dses] and As:={−dses,dses}. The convex hull of a product of finite sets is the product of the convex hulls: a convex combination ∑iλi(ai1,…,aik) of product points has coordinates ∑iλiais∈conv⁡(As), and conversely a tuple of convex combinations with coefficient vectors λ1,…,λk is the convex combination of product points with weights λi11⋯λikk; therefore CT=conv⁡(ρ(WT)xT)=∏s∈TIs by [step 2.1], a box of dimension ∣T∣, agreeing with the product-of-intervals description [F14]. Its nonempty faces are products with a set U⊆T of free coordinates and signs fixed on T∖U; the face indexed by uWU has the signs of u on T∖U. For u,v∈WT these faces satisfy F(u,U)⊆F(v,V) exactly when U⊆V and u,v have the same signs outside V, which, by [F17], is equivalent to uWU⊆vWV. 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.

4.1step 1.1step 2.2step 3.1F4F7F13algebra

By step 1.1 all proper subsets are spherical, and they index exactly the proper nonempty faces of the top cell CS by [F4]; by [F7] those faces are the boundary cells of Σ, so they are the 8 vertices, 12 edges and 6 rectangular 2-faces of [step 2.2]. By step 3.1, CS=∏s∈S[−dses,dses] in the orthonormal coordinates ea,eb,ec; radial projection x↦x/∥x∥ sends ∂CS to S2 and has continuous inverse u↦u/max⁡s∈S(∣us∣/ds), so this boundary is a 2-sphere; the alternating count gives 8−12+6=2 by [F13].

4.2F9F10F11step 1.1step 2.2step 3.1algebra

The chamber K=∣S∣ is the order complex of the full power set of S by [F10] and [step 1.1]. Every chain extends to a maximal chain. Map each vertex T to its characteristic vector 1T∈[0,1]S. For a permutation (s1,s2,s3), the chain ∅⊂{s1}⊂{s1,s2}⊂S gives a tetrahedron with vertices 0,es1,es1+es2,1S. Every point y∈[0,1]S lies in one of these tetrahedra: choose an ordering ys1≥ys2≥ys3 and write it as the convex combination with coefficients 1−ys1, ys1−ys2, ys2−ys3, and ys3 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 K≅[0,1]S; K has six top simplices. By [F9] the quotient W\Σ is homeomorphic to K, and by [F11] the chambers are the eight distinct translates wK [step 1.1]. By step 3.1, CS is a box; its barycentric subdivision has 8⋅3⋅2=48 top simplices, by choosing a box vertex, an incident edge and an incident 2-face; this agrees with the 8⋅6=48 tetrahedra in the chamber translates.

5.1step 1.1step 3.1step 4.1F12algebra

Write an element of W as its sign vector (εa,εb,εc)∈{±1}3 under the direct-product isomorphism of step 1.1. A Coxeter-complex vertex of type S∖{s} is the coset wWS∖{s}; it is determined exactly by the s-coordinate εs, since that parabolic changes the other two coordinates freely. Thus the six Coxeter-complex vertices are the three opposite pairs (s,+1),(s,−1) for s∈S. The chamber indexed by w is the triangle with vertices (a,εa),(b,εb),(c,εc), 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 2-face with fixed s-coordinate εs corresponds to the Coxeter vertex (s,εs); a box vertex (εa,εb,εc) 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 2-sphere, not the same cellulation.

6.1step 2.1step 2.2step 3.1step 4.1step 4.2step 5.1given∎

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.

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

The B2 Davis complex is an octagon whose boundary is the Coxeter complex circle

Example

Let S={s,t} with m(s,t)=4, and use the Coxeter cells CT with positive distances ds,dt.

(i) W is dihedral of order 8, all four subsets of S are spherical, and there are eight vertices, four edges of each label, and one 2-cell: 17 cells in all.

(ii) For ds=dt, CS 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) K consists of the two triangles ∅<{s}<S and ∅<{t}<S along their common diagonal, hence is a square. The compact quotient W\Σ is homeomorphic to K. The octagon subdivision has 16 triangles, eight translates of the two chamber triangles.

(iv) If ds≠dt, the cell is an octagon with alternating edge lengths 2ds,2dt, so it is not regular. Its cell counts and disk topology are unchanged.

Facts & Assumptions

Given: S={s,t} with m(s,t)=4, its presented group W, positive distances ds, and the Davis cellulation.

[F1]

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

[F2]

The cells CT have dimension ∣T∣, and the face map v↦ρ(w)(v+zT,U) is an isometry from CU onto the face indexed by wWU (Finite Coxeter orbit polytopes, face isometries and their cocycle (1),(3)).

[F3]

The Davis realization has one cell for each spherical coset, subdivides each such cell by its coset subposet, and has compact chamber quotient K (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2),(4)).

[F4]

The cells are closed balls; for rank two with equal distances, the orbit cell is regular with 2m(s,t) sides, and each rank-one cell is the interval from −dses to dses (The Davis complex as a CW complex: disk cells and the Cayley skeleta (1),(4)).

[F5]

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

[F6]

For S={s,t} with m(s,t)=4, the Coxeter presentation has relators s2=t2=(st)4=1, and every map of s,t into a group satisfying these relators extends uniquely to a homomorphism from W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).

[F7]

If G is finite and H≤G, then ∣G∣=[G:H]∣H∣ (Lagrange's theorem: ∣G∣=[G:H]∣H∣ for every subgroup H of a finite group G).

Verification

technique · explicit normal forms and cell incidence
1.1F1F2F3F6F7algebra

By [F6], W=⟨s,t∣s2=t2=(st)4=1⟩. Put r=st; then r4=1, srs=r−1, and t=sr, so sr=r−1s. Moving every s to the right and reducing powers of r shows that every element is one of rk or rks for k=0,1,2,3, hence ∣W∣≤8. To separate these eight forms, let s(x,y)=(x,−y) and t(x,y)=(y,x) on R2; both are reflections, st is a quarter-turn, and the eight maps (st)k and (st)ks are distinct. By [F6] these assignments define a homomorphism from W onto the eight-element symmetry group of the square, so ∣W∣=8 and the forms are distinct. The images also show s,t≠1, hence W{s}={1,s} and W{t}={1,t}; all four subsets are spherical by [F1]. By [F7], each singleton parabolic has four left cosets in W. There are eight singleton cosets and one top coset WS=W, so [F1]–[F3] give 8+4+4+1=17 cells.

2.1step 1.1F1F2F3F4F5

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 ds=dt. At each vertex {w}, the incident rank-one cosets are exactly wW{s} and wW{t}: both contain w, and any coset of either type containing w equals the corresponding one by [F1]. Thus the edge labels alternate. All cosets lie below WS=W, 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.

2.2step 1.1F1F3algebra

The spherical-subset poset has exactly two maximal chains ∅<{s}<S and ∅<{t}<S; their triangles meet in the diagonal ∅<S, producing K. 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 16 triangles. Each vertex w gives the two chains {w}<wW{s}<W and {w}<wW{t}<W, precisely the translate wK.

3.1step 2.1F2F4algebra∎

Each edge of label s or t is isometric to its rank-one cell by [F2], and has length 2ds or 2dt 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.

ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08Open item page →

The universal Coxeter Davis complex is a tree

Example

Let S be finite and m(s,t)=∞ for distinct generators. Then W is the free product of the groups ⟨s⟩≅Z/2.

(i) The spherical types are exactly ∅ and the singletons. The nerve is the discrete set S, and the only cells are vertices {w} and edges wW{s}={w,ws}.

(ii) The coarse Davis cellulation is the Cayley tree, of valence ∣S∣ when ∣S∣≥2: a bi-infinite line for ∣S∣=2, and the 3-regular tree for ∣S∣=3. Its edge of label s has length 2ds, giving unit edges when all ds=1/2. For S=∅ it is a point, and for ∣S∣=1 a single interval.

(iii) K is the cone on the discrete set S, a fan of ∣S∣ intervals; W\Σ≅K is compact. The coarse link at each vertex is the discrete nerve S.

(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 ⟨s⟩ at leaf s. Its vertices are W and the cosets W/⟨s⟩; edges join w to w⟨s⟩. The stabilizer of a central vertex or open half-edge is trivial, and that of the leaf vertex w⟨s⟩ is w⟨s⟩w−1. 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 S with m(s,t)=∞ for distinct s,t, its presented group W, positive distances ds, and the Davis cellulation.

[F1]

Spherical types and the nerve are defined by finite parabolics; Σ is the inclusion-poset realization and K is the cone on the subdivided nerve (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1),(3)).

[F2]
[F3]

The coarse one-skeleton is the undirected Cayley graph, a rank-one cell joins w to ws and has length 2ds (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3),(4)).

[F4]

The metric induces the cell topology, the compact quotient is K, and spherical coset wWT has setwise stabilizer wWTw−1 (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1),(2),(4)).

[F5]

A free product is characterized by the unique extension of homomorphisms from its factors (The free product of an arbitrary family of groups).

[F6]

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

technique · explicit normal forms and cell incidence
1.1F1F2F5construct

Let R be the finite words in S with no equal adjacent letters, including the empty word. Define λs on R by deleting the initial s if present and otherwise prefixing s. This is an involution, so [F2] gives an action of W on R. Cancellation of adjacent equal letters reduces every word to a member of R. With composition right-to-left, a reduced word s1⋯sk sends the empty word to exactly that word; distinct reduced words therefore represent distinct elements of W. In particular each s has order two, and alternating words in distinct s,t give infinitely many elements of ⟨s,t⟩. 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 s2=1, so [F2] extends them uniquely to W. This is the universal property [F5], proving the free-product assertion.

2.1step 1.1F1F2F3algebra

By (i) and [F3], only the Cayley graph occurs. It is connected because S generates W. A closed nonbacktracking edge walk would give a nonempty reduced word representing 1, contradicting step 1.1. Thus it is a tree. The neighbors ws are distinct for distinct s by the same normal form, so its valence is ∣S∣. 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 S.

3.1step 1.1step 2.1F1F2F4F6construct

The poset of spherical types has a least element ∅ and the incomparable singleton types. Its realization K is therefore the asserted fan, and [F4] supplies its compact quotient. The barycentric subdivision of the Cayley tree has vertices w and midpoint vertices w⟨s⟩, and one half-edge (w,s) 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 w⟨s⟩w−1 by coset equality. For the graph of groups on this fan, put the trivial group at the center and every edge, and ⟨s⟩ at leaf s, 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 w to w⟨s⟩, exactly the subdivision just described. This proves the full graph-of-groups claim without an ordinary covering assertion.

4.1step 2.1F4constructalgebra∎

Root the metric tree at 1. Each point x has a unique finite arc [1,x]: connectivity supplies a finite edge route to a cell containing x, and the absence of cycles makes its reduced route unique. Define H(t,x) to be the point at distance (1−t)d(1,x) along that arc. To check continuity, for x,y let their root arcs share the initial segment of length c, and write a=d(1,x), b=d(1,y). If both contracted points lie beyond that common segment, their distance is (1−t)(a+b)−2c≤d(x,y); if both are on the common segment it is (1−t)∣a−b∣≤d(x,y); if just one is beyond it, it is (1−t)∣a−b∣≤d(x,y). Thus d(H(t,x),H(t,y))≤d(x,y), and d(H(t,y),H(u,y))=∣t−u∣d(1,y). The triangle inequality gives joint continuity, including at the root. By [F4] this is continuity in the Davis topology. Since H(0,x)=x, H(1,x)=1, and H(t,1)=1, the tree is contractible. All normal forms and routes are explicit finite constructions, so no Choice is used.

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

Residues, the compact chamber quotient, and the finite Coxeter sphere versus the contractible Davis cell

Example

Let (S,m) be a Coxeter matrix with S finite, let W be its presented group, and let S, WS, Σ=∣WS∣, the nerve L, and the chamber K=∣S∣ be as in Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization. For each spherical T, let CT=conv⁡(WTxT) be the Coxeter cell defined from positive distances ds as in Finite Coxeter orbit polytopes, face isometries and their cocycle. Put n=∣S∣. 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 wW∅={w} is sd⁡L. In the coarser polyhedral cell structure, its vertex link is L. For a cell q=wWT, define its coface residue to be the order subcomplex induced by the cosets uWU⊇q; its simplices are the chains of cells having q as a face.

(ii) The orbit quotient W\Σ is homeomorphic to K=∣S∣, a finite cone on sd⁡L; the action is proper and K is a strict fundamental domain.

(iii) If W is finite, then S is the maximum spherical subset and WS=W indexes the unique top cell. For n=0, Σ is a point and its boundary is ∅=S−1. For n≥1, Σ is the barycentric subdivision of the convex cell CS, hence a contractible n-ball, and its proper-coset cells form the boundary sphere Sn−1. The Coxeter complex is the dual triangulation of this boundary cellulation: a proper spherical coset wWI indexes a boundary cell of dimension ∣I∣ and a Coxeter simplex of dimension n−∣I∣−1, with incidence reversed. Their barycentric subdivisions agree. The finite Coxeter complex has an (n−1)-simplex as a fundamental chamber; K is instead the n-dimensional cone on sd⁡L.

(iv) With equal distances, the finite rank-two cases m(s,t)=3 and m(s,t)=4 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 (S,m), its presented group W, the spherical-subset poset S, the spherical-coset poset WS, its order-complex realization Σ, the nerve L, the chamber K, the positive distances ds, the Coxeter cells CT and generating points xT, and n=∣S∣.

[F1]

A subset T⊆S is spherical exactly when WT is finite; W∅={1} and every singleton is spherical; the nonempty simplices of the nerve L are the nonempty spherical subsets. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (1)).

[F2]

Σ=∣WS∣ 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)).

[F3]

K=∣S∣ is the cone with apex ∅ on sd⁡L; since S is finite, K is finite and compact. (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization (3)).

[F4]

Coset inclusion is characterized by wWT⊆w′WT′ if and only if T⊆T′ and w−1w′∈WT′. (Equality, inclusion and intersection of spherical cosets, and the quotient poset (2)).

[F5]

sd⁡L has vertices the nonempty faces of L and simplices the strict chains of nonempty faces. (Barycentric subdivision of an abstract simplicial complex).

[F6]

For spherical T, xT=∑s∈Tdsvs(T) and CT=conv⁡(WTxT) is a compact convex polyhedral cell of dimension ∣T∣ with 0 in its interior; its nonempty faces are exactly conv⁡(uWUxT), indexed uniquely by uWU. (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).

[F7]

The canonical map ∣WS∣→X is a homeomorphism onto the glued complex and carries the subposet below each cell address q onto the barycentric subdivision of Cq. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).

[F8]

Under this identification, the cells indexed by wWT have dimension ∣T∣, and there is one W-orbit of cells for each spherical type. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).

[F10]

W\Σ is compact and homeomorphic to K, which is a strict fundamental domain. (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (4)).

[F11]

For finite type with n≥1, the Coxeter complex triangulates Sn−1; the simplex labelled by W∅ has the standard chamber section C∩Sn−1 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)).

[F12]

The one-skeleton of Σ is the undirected S-labelled Cayley graph; its finite rank-two cells are the cosets wW{s,t}. (The Davis complex as a CW complex: disk cells and the Cayley skeleta (3)).

[F13]

For ∣T∣=2, CT is the regular 2m(s,t)-gon when ds=dt. (The Davis complex as a CW complex: disk cells and the Cayley skeleta (4)).

[F14]

The Coxeter presentation has relators s2 for s∈S and (st)m(s,t) for distinct s,t with finite m(s,t); an infinite label imposes no relator. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Definition).

[F15]

The Coxeter form has B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t). (The real Coxeter form, its radical, reflections, and form-preserving maps (2)).

[F16]

Each simple reflection is linear and involutive, fixes es⊥ pointwise, preserves B, and sends es to −es. (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)).

[F17]

The canonical reflection homomorphism satisfies ρ(s)=res for every s∈S. (The canonical reflection homomorphism, roots, reflections, and the positive cone (1)).

[F18]

In the coarser cell structure on the Davis complex, the link of each vertex is isomorphic to the nerve L(W,S). (Davis, The Geometry and Topology of Coxeter Groups, Proposition 7.3.4, printed p. 130).

[F19]

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

[F20]

Every nonempty Coxeter cell CT is homeomorphic to a closed ∣T∣-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)).

[F21]

The Coxeter simplex labelled by wWI has vertices wWS∖{s} for s∉I, hence dimension n−∣I∣−1. (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (4)).

[F22]

In finite type, every W-orbit in V meets the standard chamber C 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)).

[F23]

Coset-face incidence in the finite Coxeter complex reverses coset inclusion: wWI⊆vWJ if and only if wCJ‾⊆vCI‾. (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (3)).

[F24]

If two spherical cosets meet, their intersection is a coset of type T∩T′. (Equality, inclusion and intersection of spherical cosets, and the quotient poset (3)).

[F25]

For the finite subsystem (WT,T) and xT in its open chamber, the inversion expansion gives xT−ρ(u)xT∈VT,+ for every u∈WT (The finite-type Coxeter cell: exposed faces and normal cones (1)).

Verification

technique · incidence calculations in the coset poset and local orbit computations
1.1F1F2F4F5F19algebra

A simplex in the simplicial link of q=wW∅={w} is a chain q<q1<⋯<qk in WS; this is the link convention of [F19]. Write qi=viWTi. By [F4], q⊆qi forces qi=wWTi, and the same criterion shows that q1<⋯<qk exactly when ∅⊊T1⊊⋯⊊Tk; conversely every such chain of nonempty spherical types gives a simplex in the link. By [F5], these are precisely the simplices of sd⁡L. The coface residue of any cell q is the order subcomplex induced by WS≥q, since an order-complex simplex is a chain; this gives the asserted residue.

1.2F3F9F10algebra

By [F9] the W-action on Σ is proper. By [F10] its orbit quotient is homeomorphic to K and K is a strict fundamental domain. Since S is finite, K is finite by [F3], hence the quotient is compact.

1.3F3F6F7F8F11F20F21F22F23algebra

Suppose W is finite. Then S∈S and WS=W is the maximum coset, so [F7] identifies Σ with the barycentric subdivision of the unique top cell CS. If n=0, CS and Σ are points and their boundary is ∅=S−1. If n≥1, [F20] makes CS a closed n-ball with boundary Sn−1, and [F7] gives the same topology for Σ; in particular Σ is contractible. Its boundary cells are indexed by the proper spherical cosets wWI with I⊊S; [F6,F8] give their dimensions ∣I∣. By [F21,F23], the same coset labels a Coxeter simplex of dimension n−∣I∣−1, 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 C∩Sn−1 is a fundamental (n−1)-simplex of the Coxeter complex; K is instead the n-dimensional cone on sd⁡L by [F3].

1.4F6F7F13F14F15F16F17algebra

For a finite rank-two system with m(s,t)=3 or 4, choose ds=dt. [F13] gives a regular 2m(s,t)-gon, so the A2 and B2 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 s2=t2=1 and (st)2=1, so st=(st)−1=ts for each pair. The homomorphism W→(Z/2)3 sending each generator to its basis vector is therefore well-defined, and the homomorphism back sending the basis vectors to a,b,c is well-defined by commutativity and involutivity; their composites fix generators, so W≅(Z/2)3. By [F15] the Coxeter form is diagonal with B(es,es)=1; [F16,F17] make each simple reflection flip just its own coordinate. Then vs(S)=es, xS=∑sdses, and the orbit consists of all sign vectors ∑sεsdses. Its convex hull is the product ∏s[−dses,dses], a box and a cube when the distances agree, by [F6]. The finite Davis complex is its barycentric subdivision by [F7].

1.5F1F8F12F14algebra

If W is infinite then S∉S, so there is no top cell; its 0-cells are indexed by all w∈W, so Σ is not a single finite polytope. For the universal Coxeter matrix, each distinct pair has label ∞. Let R be the set of finite words with no equal adjacent letters, including the empty word. For each s∈S, define a permutation λs of R by deleting an initial s when present and otherwise prefixing s. Each λs is an involution; because [F14] leaves only the relators s2, the assignment extends to a homomorphism W→Sym⁡(R). With composition acting right-to-left, any word s1⋯sk∈R maps the empty word to s1⋯sk, so no nonempty word in R represents the identity. For distinct s,t, the alternating words (st)k lie in R and map the empty word to distinct words of lengths 2k; 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 R representing 1, impossible by the action just constructed. The Cayley graph is connected because S generates W, hence it is a tree. For ∣S∣=2 it is the bi-infinite line; for ∣S∣≥3, distinct generators give distinct neighbors at each vertex, so it is a regular tree of valence ∣S∣.

2.1step 1.1F1F4F6F7F15F16F17F18F24F25algebra

Fix the vertex wW∅={w}. Every incident cell is q=wWT by [F4]; in its q˙-chart this vertex is ρ(a)xT with a=q˙−1w∈WT. At xT, [F25] puts every orbit difference ρ(u)xT−xT in −VT,+:={−∑s∈Tcses:cs≥0}, while ρ(s)xT−xT=−2dses for every s∈T by [F6, F15, F16, F17]. Thus the nonnegative hull of CT−xT, its tangent cone, is exactly −VT,+. Because the es are independent and ds>0, its nonzero rays have the cross-section {−∑scses:cs≥0, ∑scs=1}, a simplex with vertices labelled by T; radial normalization identifies this cross-section with the spherical link. The face indexed by WU, U⊆T, has tangent cone −VU,+ by the same argument for its orbit hull [F6, F25], so it contributes precisely the simplex face on U. Applying the isometry ρ(a) gives the same labelled link at ρ(a)xT. The empty type contributes the empty simplex. By [F24] two incident cells wWT,wWT′ meet in wWT∩T′, and the face isometries in [F7] identify their links along precisely the face on T∩T′. These simplices are exactly the nerve L by [F1]. The simplicial link from step 1.1 is its barycentric subdivision, in agreement with [F18].

3.1step 1.1step 2.1step 1.2step 1.3step 1.4step 1.5given∎

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