Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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.

The Davis complex as a CW complex: disk cells and the Cayley skeleta

Statement

Let (S,m) be a Coxeter matrix with S finite, W its presented group, and let Σ carry the cellulation of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) with cells the spherical cosets wWT, T∈S (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization); write S for the spherical subsets and CT for the Coxeter cells of Finite Coxeter orbit polytopes, face isometries and their cocycle. Then:

(1) The cells are disks. For T=∅, CT={0} is the closed zero-ball. For nonempty T, the cell CT is homeomorphic to the closed disk B‾(0,1)⊆VT by the radial map ψ ⁣:CT→B‾(0,1),ψ(0)=0,ψ(x)=xtmax⁡(x/∥x∥B) (x≠0), where tmax⁡(u)=min⁡{ℓi(0)/(ℓi(0)−ℓi(u)):ℓi(u)<ℓi(0)} is the exit parameter of the unit ray through u for a finite list of affine functions ℓi≥0 defining CT={v:ℓi(v)≥0} with ℓi(0)>0; ψ carries the boundary ∂CT onto the unit sphere. Consequently the cells wWT admit characteristic maps from closed ∣T∣-disks (Cell attachment by a characteristic map).

(2) CW structure. With these characteristic maps and the face-identification attaching maps, the cellulation is a CW complex in the sense of CW complex with closure finiteness and weak topology: the weak topology is the topology of the gluing of The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K), and the cells meeting the closed cell wWT are the cells vWV with vWV∩wWT≠∅, equivalently v∈wWTWV; by Equality, inclusion and intersection of spherical cosets, and the quotient poset (3) and the finiteness of the spherical subsets V and of both WT and WV these are finitely many, so the closure finiteness condition (C) holds.

(3) Skeleta. The skeleta (Skeleta, CW subcomplexes, and relative CW complexes) are: Σ0=W, the cosets wW∅={w}; Σ1 is the (undirected, S-labelled) Cayley graph of (W,S) (The Cayley graph of a group with respect to a subset, The directed labelled Cayley graph of a group with respect to a subset), each 1-cell wW{s}={w,ws} being an edge labelled s; and Σ2 is Davis's reduced Cayley 2-complex of the Coxeter presentation W=⟨S∣s2 (s∈S), (st)m(s,t) (s≠t, m(s,t)<∞)⟩: the involution relators s2 contribute only edge backtracks, with no 2-cells, and the finite pair-relator circuits are identified up to cyclic shift and reversal; its 2-cells are the cosets wW{s,t} with m(s,t)<∞, each a 2m(s,t)-gon whose boundary closed edge path is w,ws,wst,…,w(st)m(s,t)=w.

(4) Two-dimensional case. For ∣T∣=2, CT is the regular 2m(s,t)-gon when ds=dt, and for ∣T∣=1, CT is the interval from −dses to dses; the cellulation has no cells of dimension ≥3 exactly when no three-element spherical subset exists.

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), its presented group W, the spherical subsets S, the Davis realization Σ=∣WS∣, the cells CT=conv⁡(WTxT), and the cell charts indexed by spherical cosets wWT.

[F1]

For nonempty spherical T, in the finite-dimensional Euclidean space (VT,BT) the cell CT is bounded, contains 0 in its interior, and is defined by finitely many affine inequalities ℓi(v)≥0 with ℓi(0)>0 (The finite-type Coxeter cell: exposed faces and normal cones (5), applied to (WT,T)).

[F2]

For every spherical T, CT has dimension ∣T∣, its generating point is xT=∑s∈Tdsvs(T) with B(xT,es)=ds, and its nonempty faces are exactly conv⁡(uWUxT) for u∈WT, U⊆T, each indexed by exactly one coset; face inclusion agrees with coset inclusion (Finite Coxeter orbit polytopes, face isometries and their cocycle (1)).

[F3]

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

[F16]

Under the cellulation identification, the cells indexed by wWT have dimension ∣T∣, and every point lies in the relative interior of exactly one cell (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (2)).

[F4]

A characteristic map is a continuous map from a closed disk whose interior maps homeomorphically onto the open cell and whose boundary maps into the preceding skeleton (Cell attachment by a characteristic map).

[F5]

A homeomorphism is a continuous bijection with continuous inverse (Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological).

[F6]

A CW complex is Hausdorff and has a filtration by skeleta with closure finiteness and the weak-topology condition (CW complex with closure finiteness and weak topology).

[F7]

The skeleta are the subcomplexes formed by cells of dimension at most the given degree (Skeleta, CW subcomplexes, and relative CW complexes).

[F8]

The choice-free attachment lemma constructs a CW complex from supplied cells with finite boundary support and their weak attachment topology (Cellular attachments with finite boundary support form a CW complex).

[F9]

A subset T is spherical exactly when WT is finite, and W∅={1} (Spherical subsets, the nerve, the poset of spherical cosets, and the Davis realization).

[F10]

For every T⊆S, WT is the Coxeter group with restricted Coxeter matrix on T; when T={s} the presentation has only s2=1, so every word reduces to 1 or s, and the map to the two-element group sending s to its nonidentity element separates them. Hence W{s}={1,s} (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).

[F11]

The undirected Cayley graph has vertices W and edges {g,gs}, while its directed labelled version has an arc (g,s,gs) for each g∈W, s∈S (The Cayley graph of a group with respect to a subset, The directed labelled Cayley graph of a group with respect to a subset).

[F12]

For a presentation, Davis's Cayley 2-complex attaches 2-cells along circuits of relators other than words s or s2; circuits are identified up to cyclic shift and reversal, and cells are attached equivariantly by the group (Davis, The Geometry and Topology of Coxeter Groups, §2.2, pp. 19–20). Thus the Coxeter relators (st)m(s,t) with distinct s,t and finite m(s,t) supply the 2-cells, while the involution relations s2 do not add 2-cells.

[F13]

In a finite rank-two Coxeter system the simple mirrors bound the fundamental sector of angle π/m (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (2)). Their reflections preserve the positive-definite plane form, and their product has determinant 1 and trace 2cos⁡(2π/m), hence is a rotation by ±2π/m (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2),(3)).

[F19]

The simple reflection formula is res(v)=v−2B(v,es)B(es,es)es (The real Coxeter form, its radical, reflections, and form-preserving maps (3)).

[F20]

The notation rs means res for every s∈S (The canonical reflection homomorphism, roots, reflections, and the positive cone).

[F21]

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

[F15]

For spherical T,V, the coset subsets meet exactly when w−1v∈WTWV (Equality, inclusion and intersection of spherical cosets, and the quotient poset (3)).

[F17]

In the isometric gluing, U⊆X is open exactly when U∩ιp(Cp) is relatively open in every cell image ιp(Cp) (Abstract isometric polyhedral gluings and the chain metric, Definition (iii)).

[F18]

The cell intersection condition says that images of cells indexed by spherical cosets meet exactly in the image of the face indexed by their intersection coset, and are disjoint when the cosets are disjoint (The cellulation of the Davis complex: incidence, stabilizers and the model U(W,K) (1)).

Proof

technique · direct
1.1givenF1algebra

Fix a spherical T. If T=∅, then VT={0}, xT=0, and CT={0}, so the unique map from this point to the closed zero-ball is a homeomorphism and both boundaries are empty. Suppose T≠∅. Write CT={v:ℓi(v)≥0 (i∈I)} as in [F1], with I finite and ℓi(0)>0. For a unit vector u∈VT, at least one index satisfies ℓi(u)<ℓi(0): otherwise ℓi(su)=ℓi(0)+s(ℓi(u)−ℓi(0))≥0 for every s≥0 and every i, so the whole ray would lie in the bounded set CT. Along that ray, each index with ℓi(u)<ℓi(0) imposes s≤ℓi(0)/(ℓi(0)−ℓi(u)), while the other indices impose no upper bound. Thus CT∩{su:s≥0}={su:0≤s≤tmax⁡(u)}, with tmax⁡(u) the finite positive minimum in clause (1).

1.2F6F9F15F17F18algebra

By [F18], the closed cells vWV and wWT meet exactly when the spherical coset subsets vWV and wWT meet. By [F15], this is equivalent to w−1v∈WTWV, hence to v∈wWTWV; conversely, v=wab with a∈WT, b∈WV gives the common element wa=vb−1. There are finitely many spherical V⊆S, and each product wWTWV is finite because spherical WT,WV are finite. Thus only finitely many cells meet a fixed closed cell, proving closure finiteness (C). The gluing definition [F17] tests openness cellwise; by taking complements this is exactly condition (W) in [F6].

2.1step 1.1F1algebra

Assume T≠∅. For each unit u0, let I0={i:ℓi(u0)<ℓi(0)}, which is nonempty by [step 1.1]. Every fi(u)=ℓi(0)/(ℓi(0)−ℓi(u)) for i∈I0 is continuous near u0. If i∉I0 and ℓi(u0)>ℓi(0), that index remains inactive near u0; if ℓi(u0)=ℓi(0), its value tends to +∞ whenever it becomes active as u→u0. Choose j∈I0; fj stays bounded on a sufficiently small neighborhood, so after shrinking that neighborhood no newly active equality index can attain the minimum. There tmax⁡=min⁡i∈I0fi, proving continuity at u0. By [F1], choose ϵ>0 with {v:∥v∥B<ϵ}⊂CT and R<∞ with CT⊆{v:∥v∥B≤R}. The ray description gives ϵ≤tmax⁡(u)≤R for every unit u.

3.1step 1.1step 2.1F1F5algebra

For T≠∅, define θ:B‾(0,1)→CT by θ(0)=0 and, for y≠0, t=∥y∥B, u=y/t, and θ(y)=t tmax⁡(u)u. The ray description shows θ(y)∈CT. If x=su∈CT with u unit, then ψ(x)=(s/tmax⁡(u))u and θ(ψ(x))=x; conversely, for y=tu≠0, ψ(θ(y))=tu=y, and both composites fix 0. Away from 0 both maps are continuous by continuity of tmax⁡; at 0, ∥θ(y)∥B≤R∥y∥B and ∥ψ(x)∥B≤∥x∥B/ϵ, so both are continuous there. Thus θ and the stated ψ are mutually inverse homeomorphisms by [F5]. For s<tmax⁡(u) all inequalities defining CT are strict at su, so continuity of the finite affine list makes su an interior point; at s=tmax⁡(u) at least one inequality is equality, and for every larger s that inequality fails. Thus the boundary consists exactly of tmax⁡(u)u for unit u, and ψ maps it onto the unit sphere.

4.1step 3.1F1F2F3F4F5F16

For nonempty T, the map θ of [step 3.1], followed by the cell chart CT→CwWT⊆Σ of [F3], is a characteristic map for the cell indexed by wWT. Its interior maps homeomorphically onto the open cell by [F16]. If x is a boundary point, some defining inequality ℓi(x) is 0, since otherwise the finite affine list stays positive in a neighborhood of x; then CT∩{ℓi=0} is a face: if a strict convex combination has ℓi-value 0, both endpoint values are 0. It is proper because ℓi(0)>0; by [F2] it is a lower-dimensional cell. Thus the boundary maps into the preceding skeleton. For T=∅, the one-point chart is the characteristic map of a zero-cell, with empty boundary.

5.1step 4.1step 1.2F2F3F4F5F6F7F8F17

Each cell boundary is a union of finitely many proper nonempty faces by [F2], and each such face is indexed by w′WU with U⊊T, so it lies in the preceding skeleton since its dimension is ∣U∣<∣T∣. For a zero-cell this is the empty union. The zero-skeleton is the discrete set W. Attach the characteristic disks of [step 4.1] in increasing dimension; every attaching map has finite boundary support, and the weak attachment topology agrees with the gluing topology from [F17] because it tests openness on closed cell images, and each characteristic map is a homeomorphism onto its closed cell by [F3],[F5]. Since S is finite, there are finitely many dimensions. The choice-free attachment lemma [F8] therefore gives the asserted CW structure with the given cells and topology, including its Hausdorff condition.

6.1step 5.1F2F3F7F9F10F11F12F16algebra

The zero-cells are wW∅={w} by [F3] and [F9], so Σ0=W. Each one-cell is wW{s}={w,ws} and its boundary vertices are w and ws; its label is s, giving exactly the undirected Cayley graph by [F11]. Now fix distinct s,t and put m=m(s,t). By [F10], W{s,t} has presentation ⟨s,t∣s2=t2=1,(st)m=1⟩ if m<∞, and omits the last relation if m=∞. When m<∞, writing r=st and using srs=r−1 reduces every word to rk or srk, 0≤k<m, so the group has at most 2m elements. The map to the group of pairs Dm=Z/m×{±1} with multiplication (a,ϵ)(b,δ)=(a+ϵb,ϵδ), s↦(0,−1) and t↦(1,−1), is onto: these images are involutions and their product (−1,1) generates the rotation subgroup; hence ∣Dm∣=2m gives ∣W{s,t}∣=2m. When m=∞, the maps s(x)=−x, t(x)=2−x on R satisfy the involution relations and make st a nonzero translation, so W{s,t} is infinite. Hence {s,t} is spherical exactly when m<∞. For finite m, the boundary walk of wW{s,t} alternates the s- and t-edges and has vertices w(st)k and w(st)ks (0≤k<m), all distinct by the dihedral normal forms; it closes at w(st)m=w. By [F2] these alternating rank-one cosets are edges of the cell, so the closed walk through all 2m vertices is its polygon boundary. Translates of this circuit are indexed by the left cosets wW{s,t}, since its vertices are exactly that coset and its cyclic order is the unique alternating circuit in the rank-two Cayley graph. By [F12], the 2-cells are precisely these circuits: the relators (st)m attach polygonal cells and the relators s2 add none.

7.1step 6.1F2F3F9F13F14F16F19F20F21algebra

For T={s}, vs(T)=es because B(es,es)=1, so xT=dses by [F2]; since rs=res by [F20] and ρ(s)=rs by [F21], [F19] gives sxT=−dses and CT=[−dses,dses]. For T={s,t} with finite m, [step 6.1] gives the 2m-gon. By [F13], its generating mirrors bound a sector of angle π/m; equality ds=dt means xT is equidistant from those walls, hence lies on their angle bisector. The product of the two wall reflections rotates by 2π/m, so the dihedral orbit has arguments θ+2kπ/m and −θ+2kπ/m with θ=π/(2m), which are the 2m equally spaced arguments θ+jπ/m; their convex hull is regular. Finally, cells of dimension at least 3 correspond exactly to spherical subsets of size at least 3 by [F2], [F3], and [F16]; any such subset contains a spherical three-element subset because its parabolic subgroup is finite by [F9], and every spherical three-element subset gives a three-dimensional cell. Thus there are no cells of dimension ≥3 exactly when no three-element spherical subset exists.

8.1step 3.1step 4.1step 1.2step 5.1step 6.1step 7.1F8given∎

Clauses (1)–(4) follow from [step 3.1] with [step 4.1], [step 1.2] with [step 5.1], [step 6.1], and [step 7.1], respectively. No Choice is used: each exit parameter is a minimum over a specified nonempty finite set, and all cell maps and attachments are explicitly supplied; the finite-dimensional disk identifications require only finite-dimensional Euclidean bases.

Depends on

Used by

Dependency tree · two levels

155 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources