Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

138 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