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.

Brink–Howlett groupoid

PDF p. 15: §4.1, definition before Remark 4.1

Definition

Let Γ be a Coxeter diagram with vertex set Γ0, Coxeter group W with simple generators si, and geometric representation on the real vector space with basis (αi)i∈Γ0. Fix J⊆Γ0. For I⊆Γ0 write WI=⟨si:i∈I⟩; an associate of J is a subset I for which WI is conjugate to WJ in W.

The Brink–Howlett groupoid BH(J) has the associates of J as objects. For associates I,K, its morphisms I→K are tagged by their source and target and have labels

Hom⁡BH(J)(I,K)={x∈W:{αi:i∈I}={xαk:k∈K}}.

For x:I→K and y:K→L, their left-to-right composite is xy:I→L. The identity at I has label 1∈W.

Justification

The associates form a set of subsets of Γ0, and the tagged arrows form a set of triples (I,x,K). The geometric representation is a group action. Thus if x:I→K and y:K→L, then xy sends the simple-root set of L to that of I. The identity sends each simple-root set to itself, and the inverse of x sends the simple-root set of I to that of K. Associativity and the identity and inverse laws follow from those of W. Therefore these data form a small groupoid with the indicated left-to-right convention, as in Set-sized groupoids, functors and composition conversion and Connected small groupoids and vertex groups.

It is also connected. Let I,K be associates of J, and choose x with WI=xWKx−1. Here ℓ is the nonnegative integer word length defined in Coxeter-system, roots, length and weak-order conventions. Repeatedly multiply the current representative on the left by a generator in I or on the right by one in K whenever this decreases its nonnegative integer length. This terminates at d∈WIxWK having no such descent. By Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, part (3), multiplication by a simple generator changes length by exactly one. Thus ℓ(sid)>ℓ(d) for every i∈I and ℓ(dsk)>ℓ(d) for every k∈K, giving the strict inequalities needed for the two-sided minimum hypothesis below. Since the multiplying factors lie in the respective parabolics, WI=dWKd−1.

For each i∈I, the element d−1sid has a finite expression in generators indexed by K. Choose a finite set of indices containing i, the support of a word for d, and the indices in that expression. By Finite-generator standard parabolics and the Bruhat subword property at arbitrary rank, the Coxeter group on the chosen finite set of generators embeds in W with lengths preserved. Applying The parabolic intersection W_I∩ dW_Jd⁻¹ for d∈^IW^J, part (3), to the intersections of I and K with that finite set shows that d−1αi=αk for some k∈K. The same argument with d−1 and the roles of I,K reversed shows that every αk arises this way. Hence d−1{αi:i∈I}={αk:k∈K}, so d:I→K is a morphism. The object J exists, since WJ is conjugate to itself; consequently the groupoid is nonempty and connected.

Depends on

Used by · 19

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