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 be a finite Coxeter matrix, 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 , , , the classes , the elements and be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map.
(1) Universal property of the Artin monoid. Let be a monoid (Semigroup and monoid; every group is a monoid, Group and abelian group) and let be a map such that in for every braid pair , where . Then there is a unique monoid homomorphism with for all .
(2) Universal property of the Artin group. Let be a group and let satisfy for every braid pair. Then there is a unique group homomorphism with for all (Monoid homomorphism and group homomorphism). Consequently is the group presented by the Artin presentation 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 . The map from to sends every braid pair to an equality in , so (2) gives a homomorphism
which is surjective because the images generate . Moreover (1) with gives with , and .
(4) Quotient by the squares. Let be the normal closure in of the squares of the generators. Then the relators of are trivial in and for all , so the assignment induces a homomorphism with ; the induced map is an isomorphism with inverse . Equivalently, imposing the relations on the Artin presentation returns the Coxeter presentation, and .
(5) Type-A application (conditional on the independent presentation theorem). Suppose is the standard Coxeter system of type for some , with generators , adjacent labels and all other off-diagonal labels . Under AC, the Artin group is identified with the published geometric braid group on strands by the generator correspondence the standard geometric half twist. The presentation-defined group agrees with 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 , no solvability of the word problem, no Ore localisation, no monoid-to-group embedding and no general statement is made. The type-A identification is only the conditional application in (5).
Facts & Assumptions
Given: A finite Coxeter matrix , the presented group of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups with its universal property, the constructions of Artin monoid and Artin group presentations, and the canonical monoid-to-group map, and, in (1) and (2), a monoid or a group with a map or whose two values on the words of every braid pair agree.
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)
On there is a smallest congruence containing every braid pair, the classes satisfy , and has the elements . (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)
In the subgroup is the normal closure of the elements for with . (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)
Every map from a set into a group extends uniquely to a group homomorphism on the free group . (Free group on a set of generators)
The normal closure of a subset of a group is the smallest normal subgroup containing . (The normal closure of a subset of a group)
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)
A homomorphism killing a normal subgroup factors uniquely through the quotient. (A homomorphism that kills a normal subgroup factors uniquely through the quotient group)
The subgroup generated by a set is the smallest subgroup containing it. (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups)
An isomorphism is a bijective group homomorphism. (Group isomorphisms, automorphisms and the set )
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)
is the group with generators and the braid relations and the commuting relations for . (The braid group by Artin presentation)
Assume AC: the Artin presentation of The braid group by Artin presentation is a presentation of the geometric braid group , the published surjection being an isomorphism. (The Artin presentation is complete for geometric braids)
AC: every family of nonempty sets has a choice function. (The Axiom of Choice)
The group is presented by the generators and the relators () and (, ); in particular and in for those . (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups)
Proof
For (1), define and on , and let be the relation . Then is an equivalence relation, and it is compatible with concatenation: if then for all . By hypothesis contains every braid pair, so minimality of gives ; hence is well defined, and together with makes a monoid homomorphism with . Conversely every element of is a class of a word, hence a product of the elements , so a monoid homomorphism out of is determined by its values on the and is the unique homomorphism with .
The two words of a braid pair have equal images in . Let , and be the alternating words of length . In one has and by [F14]. If is even, then and ; from one gets , hence because . If is odd, then and , using and again .
For (2), regard as a subset of the free group . By [F4] the map extends uniquely to a homomorphism with ; on words this gives for the two words of any braid pair. For every braid pair, with as in [F3], one has , so kills the set ; its kernel is a normal subgroup by [F6] and hence contains the normal closure by [F5]. Thus [F7] gives a homomorphism with , and in particular ; it is unique with this property because the elements are the images of and generate in the sense of [F8]. Writing the relators as the equations exhibits as the presented group : a homomorphism out of this presentation is exactly a map whose two values on each braid pair agree, and it is unique, which is the universal property just proved.
For (3), step 1.2 says that the map sends every braid pair to an equality in , so (2) of step 1.3 yields with , and (1) with applied to the same map yields with . The homomorphism is surjective: every element of is a product of the images of elements of , and these are the images under of the generators of , so satisfies the surjectivity criterion of [F10]; equivalently the images generate by [F8]. Finally , because both sides are monoid homomorphisms agreeing on the , and these generate by the uniqueness clause of step 1.1.
For (5), let and let be the type- matrix on , so for and for . Its braid pairs are then exactly the pairs of alternating words of length , for , and the commuting pairs for ; these are precisely the two relation families of [F11], so the identity correspondence matches the defining relations of with those of . By (2) of step 1.3 there is a homomorphism with , and by [F10] applied to the presentation of [F11] there is a homomorphism with ; the two are inverse on the generators, hence mutually inverse and so isomorphisms by [F9].
Under AC, [F12] identifies with by the published isomorphism carrying to the standard geometric half twist. Composing with the isomorphism of step 2.2 identifies with 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.
For (4), let , so . Since , each lies in , which is normal by [F6]; hence by [F5], and [F7] gives the induced homomorphism with . For the inverse direction, put ; then , and for with the defining braid relation of and the relations give : writing , the braid relation reads when , so that in by , while for it reads , so that . The universal property of (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) therefore gives a homomorphism with .
The homomorphisms and of step 3.2 are mutually inverse: for all , and for all ; two homomorphisms out of a group generated by a set are equal when they agree on that set, while is generated by the images of and is generated by the by [F8]. Hence is bijective, i.e. an isomorphism by [F9]. Since is the composite of the quotient map with and is injective, an element lies in exactly when , that is, exactly when ; thus , and imposing the relations on the Artin presentation returns the Coxeter presentation in the sense of [F7] and [F10].
Scope: nothing in the proof establishes injectivity of or of , torsion-freeness of , solvability of the word problem, an Ore localisation, an embedding of into , or a general statement, and the only identification with geometric braids is the conditional application of step 3.1.
Depends on
- Artin monoid and Artin group presentations, and the canonical monoid-to-group map
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Monoid homomorphism and group homomorphism
- Group and abelian group
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- A homomorphism that kills a normal subgroup factors uniquely through the quotient group
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
- Group presentation by generators and relations
- Relators and relations; finitely generated, finitely related, and finite presentations
- The normal closure of a subset of a group
- The quotient group $G/N$ and coset product $(gN)(hN)=ghN$
- Third isomorphism theorem for groups: $(G/K)/(N/K)\cong G/N$
- If $K\mathrel{\trianglelefteq}G$, $N\mathrel{\trianglelefteq}G$ and $K\subseteq N$, then $N/K\mathrel{\trianglelefteq}G/K$
- Correspondence theorem: subgroups of $G/N$ correspond to subgroups of $G$ containing $N$, with normality preserved
- First isomorphism theorem for groups: $G/\ker f\cong\operatorname{im}f$
- Group isomorphisms, automorphisms and the set $\operatorname{Aut}(G)$
- Free group on a set of generators
- Reduced words form the free group on an alphabet
- Semigroup and monoid
- The braid group by Artin presentation
- The Artin presentation is complete for geometric braids
- The image of a group homomorphism is a subgroup and its kernel is a normal subgroup
- The Axiom of Choice
Used by
- The positive lift b_w is not a monoid homomorphism Counterexample
- Type-A Artin projections, positive lifts, and the positive braid monoid Example
- Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary Lemma
- The reduced positive section b_w, its length additivity, and the degree homomorphism Theorem
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
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF) (standard reference, not scraped)
- Rachael Boyd, Homology of Coxeter and Artin groups (PhD thesis, University of Aberdeen 2018, corrected version) (standard reference, not scraped)
- Jon McCammond, The mysterious geometry of Artin groups (Winter Braids Lecture Notes Vol. 4 (2017), Course no I, pp. 1-30) (standard reference, not scraped)