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

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

109 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