Alphabeta Math
RemarkRemark: Literature-sourcedProof: AI-generated
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 (W,S) be a Coxeter system with generators S={si:i∈Γ0} and Coxeter matrix m, and let J=∅. Its Brink–Howlett groupoid has one object, ∅, and its endomorphism group is W. Each elementary wall-crossing arrow va,∅ has label sa.

For distinct vertices a,b, the two-generator arrow va,b,∅ is defined precisely when sasb has finite order m=m(sa,sb). In that case its label is the longest element of W{a,b}=⟨sa,sb⟩, represented by each of the two alternating words of length m, one beginning with sa and the other with sb. The atomic braid relation equates these two words. The Brink–Howlett presentation therefore specializes to the Coxeter presentation: generators sa, relations sa2=1, and the alternating braid relation of length m(sa,sb) for each distinct pair with finite matrix entry.

Proof

Given: A Coxeter system as in the Statement, with J=∅ and distinct vertices a,b 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 va,∅=sa for every vertex a. Empty-subset wall crossings are simple reflections

[F2] A Brink–Howlett arrow I→K is labelled by an element carrying the simple-root set of K onto that of I; composition multiplies labels from left to right. Brink–Howlett groupoid

[F3] For T⊆Γ0, WT is generated by the st with t∈T, and ΦT={wαt:w∈WT, t∈T}. In particular Φ∅=∅. Standard parabolic subgroups and parabolic roots

[F4] For distinct a,b, the two-generator construction is defined when Φ{a,b} is finite. In that case its label is q=wDwD∩∅, where D is the union of components of the diagram on {a,b} meeting {a,b}; D is spherical, meaning WD 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 m(sa,sb)=m, it has 2m elements and its unique longest element has length m and is the alternating word of length m beginning with sa; the same assertion holds with a,b exchanged. For infinite m(sa,sb) the alternating words of increasing length are distinct. The order of sasb is exactly m(sa,sb), 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 J=∅.

1.1F1F2

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 W is its label, and composition is multiplication in W. The elementary labels are sa by [F1].

1.2F3F4F5given

When the two-generator construction applies. Put T={a,b}. If m(sa,sb) is finite, [F5] makes WT finite, so [F3] makes ΦT finite. Conversely, if ΦT is finite, [F4] makes WD finite. Every component of the diagram on T meets T, so D=T; the infinite case of [F5] would give infinitely many elements of WT. Thus the construction applies exactly for finite m(sa,sb), equivalently for finite order of sasb.

2.1F1F4F5step 1.2

The atomic words. In the finite case, D=T and wD∩∅=1, so [F4] identifies the two-generator label with the longest element wT. By [F5], both alternating words of length m are reduced expressions for wT. 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.

3.1F1F2F6step 1.1step 1.2step 2.1∎

Specialize the presentation. By [F1] and [F2], the inverse of the elementary arrow labelled sa is itself, since sa2=1 in the Coxeter system. Thus the inverse-pair relations in [F6] become sa2=1. By steps 1.2 and 2.1, the atomic relations are exactly the two alternating words of length m(sa,sb) 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

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