Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicable
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.

Positive arrangement category and its groupoid completion

PDF p. 14: §3.5, construction of D+ and D

Definition

Fix a finite-rank Coxeter system and a subset J of its vertices. Let (Cone(J)∘,HJ) be its relative arrangement, and let Cham(J) be its set of chambers, the connected components of the arrangement complement. Two distinct chambers are adjacent when they share a wall, a codimension-one intersection of a chamber closure with an arrangement hyperplane.

Form the directed graph QJ with vertex set Cham(J) and exactly one arrow C→C′ for each ordered pair of adjacent chambers. Thus each adjacent pair gives two oppositely directed arrows. A path is a finite sequence of composable arrows; the empty path at C has source and target C. Its length is the number of arrows. A path is geodesic if its length is minimal among paths with the same source and target.

Let RJ consist of all pairs of geodesic paths with the same source and target. The positive arrangement category D+(J) is the category presented by QJ and RJ: its objects are the chambers and its morphisms are paths modulo the smallest endpoint-preserving equivalence relation containing RJ and stable under concatenation on either side. Composition is induced by concatenation, read from left to right; empty paths give identities.

The arrangement groupoid D(J) is the groupoid completion of D+(J), obtained by formally adjoining inverses to its morphisms. Its canonical functor from D+(J) is universal for functors into groupoids. In spherical type, meaning that the Coxeter group is finite, the article calls D(J) the Deligne groupoid.

Justification

The initial Coxeter system is the pair (W,S) defined in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, with its finite generating set S indexed by the vertices. The subset J is a subset of that vertex set. By Tits cone intersections, relative roots and arrangements, put E=ΘJ, T=Cone(J)=Cone∩E, and D=⋃H∈HJH, so that T∘=Cone(J)∘ is the interior in E and every member of HJ is a linear hyperplane of E.

The Tits cone is convex and contains 0 by Tits cone geometry with its exact interior boundary. The linear subspace E contains 0 and is closed under convex combinations, so T is convex and contains 0. Every H∈HJ contains 0 and therefore meets T. Consequently Chambers, walls and adjacency applies to (T,HJ) in the finite-dimensional space E.

By Deleting relative root hyperplanes removes all cone-boundary points, T∖D=T∘∖D. Both complements carry the topology induced from the same space E, so they are the same topological space and have exactly the same connected components. The chambers in the Definition are therefore exactly the chambers of (T,HJ). Each chamber has the same closure in E and the same affine dimension in both descriptions. For every H∈HJ, the intersection of that closure with H is unchanged, so its wall condition and the shared-wall adjacency relation are unchanged. Thus the chambers-and-walls supplier gives precisely the stated conventions for the interior pair, even if some hyperplanes miss T∘. The entire hyperplane set is retained. If the complement is empty there are no chambers, and the same conclusion holds.

The chambers form a set of subsets of E, and their symmetric adjacency relation is a subset of the set of ordered chamber pairs, so QJ is a small directed graph. Because there is exactly one arrow for each ordered adjacent pair, its paths correspond to the chamber sequences of Chamber paths, concatenation and wall words, including the one-chamber sequence for an empty path. Their lengths and endpoints agree; hence the geodesic condition agrees with Geodesic chamber paths.

By Path presentations, congruences and formal inverses, the set RJ of endpoint-matched path pairs generates a smallest endpoint-preserving path congruence, and the quotient has well-defined identities and associative composition. It is therefore the stated small category. By Groupoid completion and its universal property, its groupoid completion exists with the stated universal property. The arrow in the opposite direction across a wall is an original generator; it is not assumed to be the formal inverse of the first arrow.

Source notes

The article reference attributes the construction and spherical-type terminology. The justification uses the declared mathematical suppliers.

Depends on

Used by · 14

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources