Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-08
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.

Artin monoid and Artin group presentations, and the canonical monoid-to-group map

Definition

Let S be a finite set and let m be a Coxeter matrix on S (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so that m(s,s)=1 and m(s,t)=m(t,s)∈{2,3,… }∪{∞} for s≠t.

(1) Words. Let S∗ be the set of finite words u=s1s2⋯sk in the alphabet S (k≥0, letters read from left to right, concatenation written by juxtaposition, empty word ε; Words in an alphabet with formal inverses, elementary cancellation, and reduced words). Concatenation makes S∗ a monoid with identity ε (Semigroup and monoid).

(2) Braid pairs. Let s≠t in S with m:=m(s,t)<∞. The braid words of length m between s and t are the strictly alternating words u=u1u2⋯um and v=v1v2⋯vm defined by ui=s for odd i and ui=t for even i, while vi=t for odd i and vi=s for even i. A braid pair is an unordered pair {u,v} arising this way; m=2 contributes the commuting pair {st,ts} and m=∞ contributes nothing.

(3) The Artin monoid. A congruence on S∗ is an equivalence relation ∼ on S∗ (Equivalence relation, equivalence class, and the quotient set A/∼) with u∼v⇒xuy∼xvy for all x,y∈S∗. The total relation is a congruence and the intersection of a nonempty family of congruences is a congruence, so there is a smallest congruence ≡+ containing every braid pair: take the intersection of all congruences containing the braid pairs. Reflexivity, symmetry, transitivity and compatibility with concatenation hold in the intersection because they hold in each of its members. Put

A+:=A+(S,m):=S∗/ ⁣ ⁣≡+,

write [u] for the class of a word u, and define [u]⋅[v]:=[uv]. This multiplication is well defined: if u≡+u′ and v≡+v′, then uv≡+u′v≡+u′v′ by compatibility and transitivity. Associativity and the identity law descend from concatenation, so A+ is a monoid with identity [ε] (Semigroup and monoid); A+ is the Artin monoid of (S,m), and σs:=[s] for s∈S.

(4) The Artin group. Let F(S) be the free group on S (Free group on a set of generators) and, for s≠t with m(s,t)<∞, let ρs,t:=u v−1∈F(S) with u,v the braid words of (2). Let N:=⟨ ⁣⟨{ρs,t:s≠t, m(s,t)<∞}⟩ ⁣⟩F(S) be their normal closure (The normal closure of a subset of a group, Relators and relations; finitely generated, finitely related, and finite presentations), and put

A:=A(S,m):=F(S)/N.

Equivalently, A is the group presented by ⟨S∣u=v for every braid pair {u,v}⟩ in the sense of Group presentation by generators and relations; its elements are the left cosets gN, and the images σs of s∈S generate A (The quotient group G/N and coset product (gN)(hN)=ghN, The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups, Group and abelian group). No relation σs2=1 is imposed: the element σs2 need not be trivial in A.

(5) The canonical comparison A+→A. The two braid words of a braid pair have equal images in A, because their difference lies in N. Hence the assignment s↦σs is constant on braid pairs, and by minimality of ≡+ it induces a monoid homomorphism

γ:A+⟶A,γ(σs)=σs,

regarding the group A as a monoid under its multiplication. It is the unique monoid homomorphism with γ(σs)=σs for all s. This is the construction whose universal property is proved in Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares ↗ (1); that lemma is the recorded justifier of this definition.

(6) Conventions and abstentions. (i) A value m(s,t)=∞ imposes no braid pair and hence no relation in either A+ or A. (ii) The constructions depend only on the pair (S,m). (iii) Nothing is asserted here about injectivity of γ or of A+→W, about Ore localisation or a group of fractions, about torsion-freeness of A, about the word problem, about A+ embedding in A, or about the K(π,1) property; in particular no multiplicativity of any lift of a reduced expression is claimed by this definition. (iv) No topological model (configuration space, hyperplane complement, Salvetti complex) is constructed or used. Part (3) establishes the congruence and quotient multiplication; Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares ↗ establishes their universal property.

Depends on

Used by

Dependency tree · two levels

39 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources