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.

Reduced ribbon groupoid

PDF p. 22: Definition 5.5

Definition

Let Γ be a finite-rank spherical Coxeter diagram, meaning that its Coxeter group W is finite, with vertex set Γ0. Let A be its Artin–Tits group and fix J⊆Γ0. For I⊆Γ0, write WI for the subgroup generated by the simple reflections indexed by I. An associate of J is a subset I for which WI is conjugate to WJ in W.

Let R′(J) be the ribbon groupoid: its objects are the associates of J, and an arrow I→K is an element β∈A with AI+β=βAK+, tagged with its source and target. Here AI+ is the submonoid generated by the standard Artin generators indexed by I. Composition is multiplication from left to right.

For an associate I and a∈Γ0∖I, put T=I∪{a}. Let wT be the longest element of WT, let ιT:T→T be the opposition permutation defined by wTαi=−αιT(i) on the simple roots, and put K=T∖{ιT(a)}. If ΔL denotes the positive reduced-word lift in A of the longest element of WL, the elementary ribbon is μa,I=ΔI−1ΔT, regarded as an arrow I→K of R′(J).

The reduced ribbon groupoid R(J) is the subgroupoid of R′(J) with all the same objects whose arrows are finite composable products of the arrows μa,I and their inverses, including empty products as identities. Equivalently, it is the smallest subgroupoid of R′(J) containing every object and every such elementary ribbon arrow.

Justification

The associate condition and the ambient groupoid are supplied by Associates of a parabolic subset and Ribbon groupoid in spherical type. The longest elements, opposition permutations and elementary ribbon elements are well defined by Longest parabolic elements and opposition permutation and Positive elementary ribbon elements.

To apply Ribbon generators lift wall-crossing morphisms for an arbitrary associate I, choose y∈W with WJy=yWI. Choose an element x of minimum Coxeter length in the right coset yWI. Since x=yu for some u∈WI, one still has WJx=xWI; thus (x,I) satisfies the chamber-label hypotheses of the lemma. The lemma shows that K is an associate of J and that μa,I is an arrow I→K of R′(J).

The objects and arrows of R′(J) form sets. Finite composable products of the specified arrows and their inverses form a set of its arrows. Concatenation of such products is again such a product, reversing a product and inverting its factors gives its inverse, and the empty products give all identities. The inherited composition and inverses therefore make these arrows a subgroupoid. Any subgroupoid containing all objects and the specified arrows must also contain their inverses and every such product, proving the stated minimality.

Source notes

Definition 5.5 of the cited article attributes this construction to its reference [17]. The article citation records attribution; the justification above uses the listed suppliers.

Depends on

Used by · 10

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