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 ordinary Coxeter presentation is the empty-J case
PDF p. 19: Remark 4.20
Statement
Let be a Coxeter system with generators and Coxeter matrix , and let . Its Brink–Howlett groupoid has one object, , and its endomorphism group is . Each elementary wall-crossing arrow has label .
For distinct vertices , the two-generator arrow is defined precisely when has finite order . In that case its label is the longest element of , represented by each of the two alternating words of length , one beginning with and the other with . The atomic braid relation equates these two words. The Brink–Howlett presentation therefore specializes to the Coxeter presentation: generators , relations , and the alternating braid relation of length for each distinct pair with finite matrix entry.
Statement references
Proof
Given: A Coxeter system as in the Statement, with and distinct vertices when a pair is considered. The length is the minimum number of simple generators in a word representing an element. A standard expression is a product of elementary arrows whose Coxeter lengths sum to the length of its label. Coxeter-system, roots, length and weak-order conventions Atomic braid relations
[F1] The empty set is its only associate and for every vertex . Empty-subset wall crossings are simple reflections
[F2] A Brink–Howlett arrow is labelled by an element carrying the simple-root set of onto that of ; composition multiplies labels from left to right. Brink–Howlett groupoid
[F3] For , is generated by the with , and . In particular . Standard parabolic subgroups and parabolic roots
[F4] For distinct , the two-generator construction is defined when is finite. In that case its label is , where is the union of components of the diagram on meeting ; is spherical, meaning is finite. It has exactly two standard expressions, one beginning with each elementary arrow. Finite relative longest element without spherical ambient rank Two-generator minimal common left multiple
[F5] The rank-two parabolic is the Coxeter group for the restricted matrix, with intrinsic length equal to ambient length. For finite , it has elements and its unique longest element has length and is the alternating word of length beginning with ; the same assertion holds with exchanged. For infinite the alternating words of increasing length are distinct. The order of is exactly , with infinity interpreted as infinite order. Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank The rank-two half-space alternative and the chamber-length induction (Pₙ), (Qₙ) The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness
[F6] The Brink–Howlett presentation has the elementary arrows as generators and the atomic braid relations and elementary inverse-pair relations as defining relations. An atomic relation is the equality of the two standard expressions supplied for a distinct pair with finite relative root difference. Brink–Howlett presentation by atomic and quadratic relations Atomic braid relations
Proof technique: direct.
Goal: identify the arrows and all defining relations when .
The groupoid and its generators. By [F1], the only object is . The root-set condition in [F2] is vacuous for an arrow from to itself, so every element of is its label, and composition is multiplication in . The elementary labels are by [F1].
When the two-generator construction applies. Put . If is finite, [F5] makes finite, so [F3] makes finite. Conversely, if is finite, [F4] makes finite. Every component of the diagram on meets , so ; the infinite case of [F5] would give infinitely many elements of . Thus the construction applies exactly for finite , equivalently for finite order of .
The atomic words. In the finite case, and , so [F4] identifies the two-generator label with the longest element . By [F5], both alternating words of length are reduced expressions for . By [F1] each letter is an elementary arrow at the sole object; hence both are standard expressions. They start with different letters, so [F4] says they are exactly the two expressions used in the atomic relation.
Specialize the presentation. By [F1] and [F2], the inverse of the elementary arrow labelled is itself, since in the Coxeter system. Thus the inverse-pair relations in [F6] become . By steps 1.2 and 2.1, the atomic relations are exactly the two alternating words of length for each finite distinct pair. By [F6] these are all defining relations, giving the stated Coxeter presentation of the endomorphism group identified in step 1.1.
Depends on
- Coxeter-system, roots, length and weak-order conventions
- Standard parabolic subgroups and parabolic roots
- Brink–Howlett groupoid
- Atomic braid relations
- Empty-subset wall crossings are simple reflections
- Brink–Howlett presentation by atomic and quadratic relations
- Two-generator minimal common left multiple
- Finite relative longest element without spherical ambient rank
- Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank
- The rank-two half-space alternative and the chamber-length induction (Pₙ), (Qₙ)
- The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness
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
- Normalisers of parabolic subgroups of Artin–Tits groups and Tits cone intersections · PDF p. 19, Remark 4.20