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.

Standard expressions and their lengths

PDF p. 17: Definition 4.9

Definition

Let (W,S) be a Coxeter system with diagram vertex set Γ0, and fix J⊆Γ0. For L⊆Γ0, write WL=⟨si:i∈L⟩; an associate of J is a subset whose standard parabolic subgroup is conjugate to WJ. The Brink–Howlett groupoid BH(J) has these associates as objects. A morphism x:I→K is labelled by an element x∈W satisfying {xαk:k∈K}={αi:i∈I}, and composable labels multiply from left to right. Write ℓ(x) for the least number of simple generators in a word representing x.

For an associate I and a∈Γ0∖I, let D=[I,a] be the component containing a in the diagram induced on I∪{a}. If WD is finite, write wL for the longest element of a finite WL and ιD for the permutation defined by wDαi=−αιD(i). Put va,I=wD∖{a}wD and I′=(I∪{a})∖{ιD(a)}. This label is a morphism I→I′.

For objects I,K and a morphism w:I→K, a standard expression is a finite sequence of such morphisms va1,I1,…,vam,Im, composable in that order from I to K, whose product is w and for which ℓ(w)=∑i=1mℓ(vai,Ii). For m>0 the source condition says I1=I. The empty sequence is allowed when I=K and w is the identity; its product is the identity and its length sum is zero. The standard-expression length of the expression is its number m of factors. When a morphism has a standard expression and every standard expression for it has the same number of factors, this common number is denoted ℓBH(w) and called the standard-expression length of w.

Justification

The Coxeter length is defined as a minimum over finite representing words. The groupoid supplies the source, target, identity and composition of each finite composable sequence; the wall-crossing construction and its morphism lemma supply the displayed factors under the stated finiteness condition. Thus the product and the equality of lengths are well-defined conditions on a finite sequence. Its number of entries is a uniquely determined nonnegative integer. The notation for a morphism is introduced only under the explicitly stated existence and independence conditions, so no expression-independent value is assumed here.

Source notes

Definition 4.9 attributes the terminology to section 2 of its reference [5]. Existence and independence are separate subsequent results in the article; they are not established by this definition.

Depends on

Used by · 27

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