Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares

Statement

Let (S,m) be a finite Coxeter matrix, W the presented Coxeter group with its universal property and length function ℓ (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let S∗, A+, A, the classes [u], the elements σs and γ:A+→A be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map.

(1) Universal property of the Artin monoid. Let M be a monoid (Semigroup and monoid; every group is a monoid, Group and abelian group) and let f:S→M be a map such that f(u)=f(v) in M for every braid pair {u,v}, where f(s1⋯sk):=f(s1)⋯f(sk). Then there is a unique monoid homomorphism fˉ:A+→M with fˉ(σs)=f(s) for all s∈S.

(2) Universal property of the Artin group. Let G be a group and let f:S→G satisfy f(u)=f(v) for every braid pair. Then there is a unique group homomorphism fˉ:A→G with fˉ(σs)=f(s) for all s∈S (Monoid homomorphism and group homomorphism). Consequently (A,(σs)s∈S) is the group presented by the Artin presentation ⟨S∣u=v (braid pairs)⟩ in the sense of Group presentation by generators and relations and Relators and relations; finitely generated, finitely related, and finite presentations.

(3) The projection onto W. The map s↦s from S to W sends every braid pair to an equality in W, so (2) gives a homomorphism

π:A⟶W,π(σs)=s,

which is surjective because the images π(σs)=s generate W. Moreover (1) with M=W gives π+:A+→W with π+(σs)=s, and π∘γ=π+.

(4) Quotient by the squares. Let D:=⟨ ⁣⟨{σs2:s∈S}⟩ ⁣⟩A be the normal closure in A of the squares of the generators. Then the relators uv−1 of A are trivial in A/D and σs2D=D for all s, so the assignment s↦σsD induces a homomorphism φ:W→A/D with φ(s)=σsD; the induced map πˉ:A/D→W is an isomorphism with inverse φ. Equivalently, imposing the relations σs2=1 on the Artin presentation returns the Coxeter presentation, and ker⁡π=D.

(5) Type-A application (conditional on the independent presentation theorem). Suppose (S,m) is the standard Coxeter system of type An−1 for some n≥2, with generators s1,…,sn−1, adjacent labels 3 and all other off-diagonal labels 2. Under AC, the Artin group A(S,m) is identified with the published geometric braid group on n strands by the generator correspondence σsi↦ the standard geometric half twist. The presentation-defined group agrees with BnArtin by The braid group by Artin presentation, and its isomorphism with the geometric braid group is supplied by the independently proved The Artin presentation is complete for geometric braids (whose AC hypothesis is part of this application). This is an application of that published theorem, not a topological proof here; the universal properties in (1)--(4) alone do not establish injectivity of the type-A comparison.

(6) Scope. No injectivity of γ or π+, no torsion-freeness of A, no solvability of the word problem, no Ore localisation, no monoid-to-group embedding and no general K(π,1) statement is made. The type-A identification is only the conditional application in (5).

Facts & Assumptions

Given: A finite Coxeter matrix (S,m), the presented group W of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups with its universal property, the constructions S∗,A+,A,[u],σs,γ of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, and, in (1) and (2), a monoid M or a group G with a map f:S→M or f:S→G whose two values on the words of every braid pair agree.

[F1]

A monoid is a set with an associative product and a two-sided identity, and a group is such a monoid in which every element is invertible. (Semigroup and monoid)

[F2]

On S∗ there is a smallest congruence ≡+ containing every braid pair, the classes satisfy [u][v]=[uv], and A+=S∗/ ⁣≡+ has the elements σs=[s]. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F3]

In A=F(S)/N the subgroup N is the normal closure of the elements ρs,t=uv−1 for s≠t with m(s,t)<∞. (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)

[F4]

Every map from a set X into a group extends uniquely to a group homomorphism on the free group F(X). (Free group on a set of generators)

[F5]

The normal closure of a subset R of a group is the smallest normal subgroup containing R. (The normal closure of a subset of a group)

[F6]

The kernel of every group homomorphism is a normal subgroup. (The image of a group homomorphism is a subgroup and its kernel is a normal subgroup)

[F7]

A homomorphism killing a normal subgroup factors uniquely through the quotient. (A homomorphism that kills a normal subgroup factors uniquely through the quotient group)

[F8]

The subgroup generated by a set is the smallest subgroup containing it. (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups)

[F9]

An isomorphism is a bijective group homomorphism. (Group isomorphisms, automorphisms and the set Aut⁡(G))

[F10]

A map on the generators of a presentation that sends every relator to the identity induces a unique homomorphism on the presented group, and that homomorphism is surjective exactly when the images of the generators generate the target. (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group)

[F11]

BnArtin is the group with generators σ1,…,σn−1 and the braid relations σiσi+1σi=σi+1σiσi+1 and the commuting relations σiσj=σjσi for ∣i−j∣>1. (The braid group by Artin presentation)

[F12]

Assume AC: the Artin presentation of The braid group by Artin presentation is a presentation of the geometric braid group Bngeom, the published surjection φn:BnArtin→Bngeom being an isomorphism. (The Artin presentation is complete for geometric braids)

[F13]

AC: every family of nonempty sets has a choice function. (The Axiom of Choice)

[F14]

The group W is presented by the generators S and the relators s2 (s∈S) and (st)m(s,t) (s≠t, m(s,t)<∞); in particular s2=1 and (st)m(s,t)=1 in W for those s,t. (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)

Proof

1.1F1F2

For (1), define f(s1⋯sk):=f(s1)⋯f(sk) and f(ε):=eM on S∗, and let ∼ be the relation u∼v:⇔f(u)=f(v). Then ∼ is an equivalence relation, and it is compatible with concatenation: if f(u)=f(v) then f(xuy)=f(x)f(u)f(y)=f(x)f(v)f(y)=f(xvy) for all x,y∈S∗. By hypothesis ∼ contains every braid pair, so minimality of ≡+ gives ≡+⊆∼; hence fˉ([u]):=f(u) is well defined, and fˉ([u][v])=fˉ([uv])=f(u)f(v)=fˉ([u])fˉ([v]) together with fˉ([ε])=eM makes fˉ a monoid homomorphism with fˉ(σs)=f(s). Conversely every element of A+ is a class of a word, hence a product of the elements σs=[s], so a monoid homomorphism out of A+ is determined by its values on the σs and fˉ is the unique homomorphism with fˉ(σs)=f(s).

1.2F14algebra

The two words of a braid pair have equal images in W. Let m=m(s,t)<∞, u=s t s⋯ and v=t s t⋯ be the alternating words of length m. In W one has s2=t2=1 and (st)m=1 by [F14]. If m=2k is even, then u=(st)k and v=(ts)k; from (st)(ts)=st2s=s2=1 one gets ts=(st)−1, hence (ts)k=(st)−k=(st)2k−k=(st)k=u because (st)2k=(st)m=1. If m=2k+1 is odd, then u=(st)ks and v=(ts)kt=(st)−kt=(st)m−kt=(st)k+1t=(st)ks=u, using (st)t=s and again ts=(st)−1.

1.3F3F4F5F6F7F8F10

For (2), regard S as a subset of the free group F(S). By [F4] the map f:S→G extends uniquely to a homomorphism f^:F(S)→G with f^(s)=f(s); on words this gives f^(u)=f(u) for the two words of any braid pair. For every braid pair, with ρs,t=uv−1 as in [F3], one has f^(ρs,t)=f^(u)f^(v)−1=f(u)f(v)−1=1, so f^ kills the set {ρs,t}; its kernel is a normal subgroup by [F6] and hence contains the normal closure N=⟨ ⁣⟨{ρs,t}⟩ ⁣⟩F(S) by [F5]. Thus [F7] gives a homomorphism fˉ:A→G with fˉ(gN)=f^(g), and in particular fˉ(σs)=f(s); it is unique with this property because the elements σs are the images of S and generate A in the sense of [F8]. Writing the relators as the equations u=v exhibits (A,(σs)) as the presented group ⟨S∣u=v (braid pairs)⟩: a homomorphism out of this presentation is exactly a map S→G whose two values on each braid pair agree, and it is unique, which is the universal property just proved.

2.1F8F10step 1.1step 1.2step 1.3

For (3), step 1.2 says that the map s↦s sends every braid pair to an equality in W, so (2) of step 1.3 yields π:A→W with π(σs)=s, and (1) with M=W applied to the same map yields π+:A+→W with π+(σs)=s. The homomorphism π is surjective: every element of W is a product of the images of elements of S, and these are the images under π of the generators σs of A, so π satisfies the surjectivity criterion of [F10]; equivalently the images π(σs)=s generate W by [F8]. Finally π∘γ=π+, because both sides are monoid homomorphisms A+→W agreeing on the σs, and these generate A+ by the uniqueness clause of step 1.1.

2.2F9F10F11step 1.3

For (5), let n≥2 and let m be the type-An−1 matrix on S={s1,…,sn−1}, so m(si,sj)=3 for ∣i−j∣=1 and m(si,sj)=2 for ∣i−j∣>1. Its braid pairs are then exactly the pairs of alternating words of length 3, {sisjsi, sjsisj} for ∣i−j∣=1, and the commuting pairs {sisj, sjsi} for ∣i−j∣>1; these are precisely the two relation families of [F11], so the identity correspondence si↔σi matches the defining relations of A(S,m) with those of BnArtin. By (2) of step 1.3 there is a homomorphism A(S,m)→BnArtin with σsi↦σi, and by [F10] applied to the presentation of [F11] there is a homomorphism BnArtin→A(S,m) with σi↦σsi; the two are inverse on the generators, hence mutually inverse and so isomorphisms by [F9].

3.1F12F13step 2.2

Under AC, [F12] identifies BnArtin with Bngeom by the published isomorphism φn carrying σi to the standard geometric half twist. Composing with the isomorphism of step 2.2 identifies A(S,m) with Bngeom under the stated generator correspondence. This is the only place where choice is used: the applied completeness theorem is an AC-conditional statement [F13], while the constructions and arguments of (1)--(4) and step 2.2 are explicit on finite relator sets and use no choice.

3.2F5F6F7constructalgebrastep 2.1

For (4), let D0:={σs2:s∈S}, so D=⟨ ⁣⟨D0⟩ ⁣⟩A. Since π(σs2)=π(σs)2=s2=1, each σs2 lies in ker⁡π, which is normal by [F6]; hence D⊆ker⁡π by [F5], and [F7] gives the induced homomorphism πˉ:A/D→W with πˉ(σsD)=s. For the inverse direction, put f(s):=σsD; then f(s)2=σs2D=D, and for s≠t with m=m(s,t)<∞ the defining braid relation of A and the relations σs2D=σt2D=D give (f(s)f(t))m=D: writing k:=⌊m/2⌋, the braid relation reads (σsσt)k=(σtσs)k when m=2k, so that (σsσt)2k=(σsσt)k(σsσt)k=(σsσt)k(σtσs)k=(σsσt)k−1σsσtσtσs(σtσs)k−1=⋯=1 in A/D by σs2=σt2=1, while for m=2k+1 it reads (σsσt)kσs=(σtσs)kσt, so that (σsσt)2k+1=(σsσt)kσsσt(σsσt)k=(σtσs)kσt2(σsσt)k=(σtσs)k(σsσt)k=D. The universal property of W (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) therefore gives a homomorphism φ:W→A/D with φ(s)=σsD.

4.1F8F9F10step 3.2

The homomorphisms πˉ and φ of step 3.2 are mutually inverse: πˉ(φ(s))=πˉ(σsD)=s for all s, and φ(πˉ(σsD))=φ(s)=σsD for all s; two homomorphisms out of a group generated by a set are equal when they agree on that set, while W is generated by the images of S and A/D is generated by the σsD by [F8]. Hence πˉ is bijective, i.e. an isomorphism by [F9]. Since π is the composite of the quotient map A→A/D with πˉ and πˉ is injective, an element g∈A lies in ker⁡π exactly when gD=D, that is, exactly when g∈D; thus ker⁡π=D, and imposing the relations σs2=1 on the Artin presentation returns the Coxeter presentation in the sense of [F7] and [F10].

5.1given∎

Scope: nothing in the proof establishes injectivity of γ or of π+, torsion-freeness of A, solvability of the word problem, an Ore localisation, an embedding of A+ into A, or a general K(π,1) statement, and the only identification with geometric braids is the conditional application of step 3.1.

Depends on

Used by

Cited to discharge well-definedness by Artin monoid and Artin group presentations, and the canonical monoid-to-group map.

Dependency tree · two levels

62 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