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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

147 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