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.
Coxeter, Artin, and Hecke Interfaces
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Approximation and Compactness in C(K)
- Artin Presentation Completeness and Braid Combing
- Asymptotic Cones and the Sublinear Triangle Criterion
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- Braids as Fundamental Groups of Configuration Spaces
- Canonical Roots, Signs, and Faithful Reflections
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Classification of Covering Spaces
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cw Complexes and Cellular Homology
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Fibrations Fiber Bundles and Homotopy Exact Sequences
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Free Products and Amalgamation
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Generic Coxeter Hecke Algebras and the Standard Basis
- Geometric Braids and Artin Generators
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Hereditary and Productive Behaviour of the Separation Axioms
- Higher Homotopy Groups and Cofiber Sequences
- Homotopy and Homotopy Equivalence
- Hurewicz Whitehead Freudenthal and Cw Approximation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Manifolds with Boundary Collars and Orientations
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered and Unordered Configuration Spaces
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Punctured Disks, Mapping Classes, and Point Pushing
- Pure Braids, Fadell–Neuwirth, and Asphericity
- Rank Theorems and Embedded Submanifolds
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Semidirect Products, Automorphism Groups and Split Extensions
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simply Connected Plane Domains: the Grand Equivalence
- Sine, Cosine, and the Definition of Pi
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tangent Cotangent and the Differential
- Tensor Coherence and Algebraic Descent
- Tensor Products of Modules
- The Ascoli–Arzelà Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Group
- The Fundamental Group of the Circle
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Seifert–van Kampen Theorem
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Uniform Spaces: the Three Definitions
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
From one finite Coxeter matrix the page builds three presentation-level interfaces: the Artin monoid and group carried by the braid pairs alone, the positive section lifted from a reduced-word indexing of , and the generic Hecke algebra with its standard basis and quadratic normalizations.
The Artin monoid is the quotient of the word monoid by the smallest congruence containing every braid pair , and the Artin group is the quotient of the free group by the normal closure of the relators , so that no relation is imposed. The two words of a braid pair agree in , and minimality of the congruence descends to the canonical comparison . The same universal property applied to produces the projection with , and is surjective because the images of the generate . Quotienting by the normal closure of the squares of the generators returns the Coxeter presentation, the induced map is an isomorphism, and .
Reduced-word control of then produces the positive section. For each the product of the along any reduced expression is independent of that expression by Matsumoto's theorem, giving with and ; the map is injective and a set-theoretic section, and holds exactly when . The additive class length on and the group degree on make the failure of multiplicativity explicit when : for every , because , and the composite is therefore not a group homomorphism either. Nothing here asserts injectivity of or of , an Ore or Garside condition, or an embedding of into .
The Hecke side of the interface reuses the same indexing. Since the generators of the generic Hecke algebra satisfy the braid relations, the universal property of the Artin monoid gives a monoid homomorphism with and , so the positive section and the standard basis share one reduced-word indexing, with base-change compatibility of the specialized bases. The four normalizations , , and are interconverted by unit changes of generators, and the root-length matching clause records exactly what a supplied root system must satisfy to match the canonical form: the diagram fixes the normalized products but neither the root lengths nor the individual values of the form. For Soergel and Kazhdan–Lusztig applications the page separates a faithful canonical representation from the reflection-faithful realization required by arguments that assume reflection faithfulness; the companion page computes a degenerate rank-two instance in which the canonical representation is faithful but not reflection faithful.
For the standard type- system the page records one conditional application: under AC, and only by consuming the independently published presentation-completeness theorem, the presentation-defined Artin group is identified with the geometric braid group. The companion coxeter-artin-and-hecke-interfaces-examples exercises the projection to , the positive lifts, the positive braid monoid and the quadratic Hecke conventions.
Throughout the type- discussion on this page and its companion, use the order-preserving relabelling from the library's underlying set to . Thus denotes the transported adjacent transposition, and one-line notation and inversion positions use the transported labels; inversion numbers are unchanged.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Artin monoid and Artin group presentations, and the canonical monoid-to-group map
Definition
Let be a finite set and let be a Coxeter matrix on (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so that and for .
(1) Words. Let be the set of finite words in the alphabet (, 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 a monoid with identity (Semigroup and monoid).
(2) Braid pairs. Let in with . The braid words of length between and are the strictly alternating words and defined by for odd and for even , while for odd and for even . A braid pair is an unordered pair arising this way; contributes the commuting pair and contributes nothing.
(3) The Artin monoid. A congruence on is an equivalence relation on (Equivalence relation, equivalence class, and the quotient set ) with for all . 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
write for the class of a word , and define . This multiplication is well defined: if and , then by compatibility and transitivity. Associativity and the identity law descend from concatenation, so is a monoid with identity (Semigroup and monoid); is the Artin monoid of , and for .
(4) The Artin group. Let be the free group on (Free group on a set of generators) and, for with , let with the braid words of (2). Let 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
Equivalently, is the group presented by in the sense of Group presentation by generators and relations; its elements are the left cosets , and the images of generate (The quotient group and coset product , The subgroup generated by a subset, the cyclic subgroup , and cyclic groups, Group and abelian group). No relation is imposed: the element need not be trivial in .
(5) The canonical comparison . The two braid words of a braid pair have equal images in , because their difference lies in . Hence the assignment is constant on braid pairs, and by minimality of it induces a monoid homomorphism
regarding the group as a monoid under its multiplication. It is the unique monoid homomorphism with for all . 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 imposes no braid pair and hence no relation in either or . (ii) The constructions depend only on the pair . (iii) Nothing is asserted here about injectivity of or of , about Ore localisation or a group of fractions, about torsion-freeness of , about the word problem, about embedding in , or about the 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.
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.
The reduced positive section b_w, its length additivity, and the degree homomorphism
Statement
Let be a finite Coxeter matrix, the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let , , , , and be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map and Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares.
(1) The positive lift. For choose a reduced expression (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups) and put
Then depends only on , not on the chosen reduced expression; ; and .
(2) The set-section. The map , , satisfies and , hence is injective and is a set-theoretic section of both and the composite .
(3) The positive length. There is a unique monoid homomorphism
explicitly , so is well defined, and . Consequently for every . Moreover the same assignment defines a group homomorphism
and for all .
(4) Multiplicativity. For all :
If , then , and indeed .
(5) Failure of multiplicativity. If then is not a monoid homomorphism: for one has and , and these differ because . Likewise is not a group homomorphism.
(6) Scope. No injectivity of or of , no Ore or Garside condition, no embedding of into , and no topological statement is made or needed.
Facts & Assumptions
Given: A finite Coxeter matrix , the group with its length function and reduced expressions, and the constructions , , , , and of the two items named in the statement.
On there is a smallest congruence containing every braid pair, the classes satisfy and has identity and elements . (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)
Every map into a group whose values on the two words of every braid pair agree extends uniquely to a group homomorphism with . (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)
Every map into a monoid whose values on the two words of every braid pair agree extends uniquely to a monoid homomorphism with . (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)
The homomorphism satisfies and . (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares)
is a set containing on which addition is defined. (The natural numbers (von Neumann), Addition of natural numbers)
Addition on satisfies and is associative. (Addition of natural numbers, Addition is associative)
is a two-sided identity for addition on . (Left identity for addition)
with the operations of Arithmetic on the integers is a commutative ring in which every element has an additive inverse; in particular is an abelian group, and its element is the multiplicative identity. The natural numbers embed in by an injective map preserving addition and multiplication, and in (The natural numbers (von Neumann)); hence the images of the distinct naturals and differ, and since is the image of while is the image of , the element is nonzero in . (The integers form a commutative ring, Arithmetic on the integers, The naturals embed in the integers)
is the unique monoid homomorphism with for all . (Artin monoid and Artin group presentations, and the canonical monoid-to-group map)
Proof
The product is independent of the reduced expression: by Matsumoto's theorem (Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups (1)), any two reduced expressions of an element are connected by finitely many replacements of an alternating subword of length by the other alternating subword , inside some context . Such a subword pair is exactly a braid pair of Artin monoid and Artin group presentations, and the canonical monoid-to-group map (2), so by the congruence property of the two full words are equivalent and their classes in coincide; hence the product in depends only on . A reduced expression of exists because is a minimum over a nonempty set of word lengths (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
The empty word is a reduced expression of because , so by [F1]. For the projection, [F4] gives and while [F9] makes a monoid homomorphism, so for a reduced expression one has , and composing with gives .
The length map exists and is unique: apply the monoid universal property [F3] to and the constant map , which is legitimate because the two words of a braid pair both have length , so their images under the word-length map agree; this gives a unique monoid homomorphism with . For a word one has by additivity [F6] and [F7], so is the word length on classes and in particular for every .
The degree map exists: apply the group universal property [F2] to of [F8] and the constant map , whose two values on a braid pair both equal ; this gives a group homomorphism with . Then and are monoid homomorphisms agreeing on every generator: , so by the uniqueness in [F3] they agree on all of , that is, for every .
The map is injective and a section: if then , and and were proved in step 2.1; a map with a left inverse is injective, so is a set-theoretic section of both maps.
For the forward direction of (4), suppose and let , be reduced expressions. The concatenated word represents and has length , so it is a reduced expression of ; hence by step 1.1, . Conversely, if , then applying the additive map of step 2.2 gives . In particular, if then , so .
If , fix . By part 1 of Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action the sign character of satisfies , so in ; since is a word of length we have , while because the empty word is the only word of length and its value is (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so . Hence the one-letter word is a reduced expression and by step 1.1, while in with makes the empty word a reduced expression of , so by step 2.1. Hence by [F1], whereas by step 2.2, so and is not a monoid homomorphism. For the composite, while , and these differ because by step 3.1, where in is the nontriviality recorded in [F8], and a group homomorphism preserves the identity (Monoid homomorphism and group homomorphism); so is not a group homomorphism.
Scope and choice: injectivity of and of , an Ore or Garside condition, an embedding of into and every topological statement are outside this result, and nothing here asserts them. No choice is used: is defined by the uniqueness proved in step 1.1, so it is a definite description rather than a selection among expressions, is an intersection of a definable family of congruences, and all computations are finite.
Hecke and Lie seam contract compatibility: the Artin-to-Hecke map, normalization conversions, root-length matching, and the reflection-faithfulness boundary
Statement
Let be a finite Coxeter matrix, the presented Coxeter group with length (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let , , and its generators be the generic Coxeter Hecke algebra of Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy (so and ), with the standard basis elements of Reduced-word independence of T_w and the length-multiplication rules and The standard basis of the generic Hecke algebra and base change. Let , , be as in Artin monoid and Artin group presentations, and the canonical monoid-to-group map and as in The reduced positive section b_w, its length additivity, and the degree homomorphism. Finally let , and be the Coxeter form and canonical reflection representation of The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, with root system (Descent of the reflection representation, unit root norms, and conjugation of reflections).
(1) Indexing and coefficient compatibility of the Artin and Hecke interfaces. Because the generators satisfy the braid relations of , the universal property of the Artin monoid (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares (1)) gives a unique monoid homomorphism
It satisfies for every . Moreover the indexing is coefficient-compatible: is an -basis of , and for every commutative ring and ring homomorphism the specialised elements form an -basis of (The standard basis of the generic Hecke algebra and base change (2),(4)). Thus the positive section and the Hecke standard basis use the same reduced-word indexing, and carries the monoid multiplication of to the multiplication of in that basis: for all .
(2) Normalization conversions. In : (i) (the normalized or -normalization); (ii) the multiplicative generators satisfy , i.e. , where ; for a single parameter and this is the ", " convention with ; (iii) the opposite-sign generators satisfy ; (iv) the Soergel-calculus generators satisfy , i.e. .
The assignments , and , together with the identity on , extend to -algebra isomorphisms between the four corresponding presentations, with inverse displayed: . In every case the braid relations are preserved: when is even the two alternating words contain each of exactly times, and when is odd the generators are joined by an odd-labelled edge, so their parameters satisfy (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy); in both cases the product of the scaling constants attached to the letters is the same on the two sides (with a single parameter simply , or ). For the single-parameter specialization, put and , where each basis element is the product along a reduced expression. Thus as in (iii), as in (iv), and . Here denotes the original Kazhdan–Lusztig normalization with parameter ; it is distinct from the normalized -basis in (i). For any finite family of polynomials and an element written in that normalization as
its coefficients in are exactly . This proves the coefficient conversion used in Remark 3.2 of the Hodge-theory source whenever such an expansion is supplied, without constructing a canonical basis or asserting that the supplied polynomials are Kazhdan–Lusztig polynomials.
(3) Root-length matching for a supplied root system. Let be a symmetric bilinear form on a real vector space and let () be vectors with such that
where for finite and when (the convention of the Coxeter form The real Coxeter form, its radical, reflections, and form-preserving maps, so that the right-hand side is the number ), that is linearly independent, and that the assignment defines a representation of on . Then the linear map
is an isomorphism of onto , it satisfies for all , and it intertwines the canonical representation with the reflection representation generated by the : for all , . Consequently the labelled Coxeter diagram fixes and the normalized products , but neither the root lengths nor the individual numbers ; a supplied root-system treatment with its own root-length normalization, coroot system and lattice data matches this canonical form exactly under the displayed normalization, and such a match is a hypothesis on the supplier, not a consequence of the Coxeter matrix. No root system, coroot system, Cartan matrix or lattice is constructed or identified here.
(4) The reflection-faithfulness boundary for Soergel applications. (a) For a field , a realization of in the sense of Elias–Williamson is a free finite-rank -module with subsets , satisfying , the reflection assignment defining a representation of , and the following condition on each distinct pair with finite . Put and , and define , , and for . Require (the two-colored quantum-number condition (3.3), with the recursion of Definition 3.5 of the source). An infinite label imposes no such condition. Such a realization is faithful when the action of on is faithful, and reflection faithful when it is faithful and the assignment sending each reflection of (each conjugate of a simple reflection) to its full fixed space is a bijection onto (the source's Definition 3.8). In the canonical case , and , with the source's convention under which the value for is . (b) Every element of fixes the radical pointwise: preserves (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)) and whenever (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)), so each generator and hence fixes pointwise. (c) Suppose . Then is a hyperplane, and for every root the reflection has fixed hyperplane (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2), Descent of the reflection representation, unit root norms, and conjugation of reflections (4)), which contains and therefore equals it; moreover the simple reflections () are distinct reflections with the same fixed hyperplane. Hence the correspondence "reflection its fixed hyperplane" fails to be injective, and the canonical realization is not reflection faithful in the sense of Elias–Williamson even though is faithful (The root-length criterion and faithfulness of the canonical reflection representation (3)). (d) Therefore a faithful canonical representation may not be substituted for a reflection-faithful realization in an argument that assumes reflection faithfulness. The source records Soergel's construction of a reflection-faithful representation for every Coxeter group over (Example 3.2(2) and the discussion after Definition 3.8). Reflection faithfulness is a sufficient hypothesis for the classical Soergel theory over an infinite field of characteristic different from , but is not necessary for every Soergel application: the same discussion records Libedinsky's extension to the geometric realization and defines a Soergel realization as a faithful realization to which Soergel's techniques apply. That property is not asserted to be equivalent to reflection faithfulness. A concrete rank-two instance is computed on the companion page. (e) No Kazhdan–Lusztig canonical basis, bar-invariant basis, cell theory, Soergel bimodule or positivity statement is constructed here; those use the standard basis and bar involution of The standard basis of the generic Hecke algebra and base change and The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization together with the conversions of (2), and remain in their designated proof homes.
Facts & Assumptions
Given: A finite Coxeter matrix , the group with length , the generic Hecke algebra with its generators , basis and parameters , and the canonical data , , , of the items named in the statement; in (3), a symmetric bilinear form on a real vector space with vectors satisfying the stated hypotheses.
A bilinear form on over is a function that is linear in each variable separately. (Bilinear forms, and symmetric, skew-symmetric, and alternating bilinear forms)
The left and right radicals of a bilinear form are and , and in the symmetric case they coincide. (The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space)
A function between vector spaces over one field is linear when for all , ; a linear map vanishing on a spanning set vanishes identically, and a linear map sending a basis to linearly independent vectors is injective. (Linear map between vector spaces over the same field, Linear subspace of a vector space, Kernel and image of a linear map)
A linear map has trivial kernel exactly when it is injective. (Kernel and image of a linear map)
An -algebra homomorphism is a unital ring homomorphism satisfying , and such a map is automatically -linear; two such homomorphisms agreeing on a set of generators agree everywhere. (Algebras over a commutative ring, central structure maps, and algebra homomorphisms)
Proof
(1) The Hecke generators satisfy the braid relations of the presentation of (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy), and these are exactly the braid-pair identities of the Artin monoid, so the monoid universal property (Universal properties of the Artin monoid and group, the projection onto the Coxeter group, and the quotient by the squares (1)) applied to , with target the multiplicative monoid of , gives a unique monoid homomorphism with . For a reduced expression one has , the last equality and the independence of of the reduced expression being the defining properties of the standard basis (Reduced-word independence of T_w and the length-multiplication rules (1)-(2), whose proof consumes Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups). The -basis property of and the base-change compatibility of the specialised elements are clauses (2) and (4) of The standard basis of the generic Hecke algebra and base change, quoted here as the interface they describe.
(2) All four quadratic relations are substitutions in the normalized relation (i), which is part of the presentation of (Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy). (ii) With and : , which is equivalent to . (iii) With : . (iv) With : , which is . The relation (ii) is also recorded as part 4 of The reversal anti-involution, generator invertibility, the bar operator and the multiplicative normalization.
(3) The map is linear by construction on the basis of (The real Coxeter form, its radical, reflections, and form-preserving maps), and it is injective with image because the vectors are linearly independent by hypothesis [F3]. Fix and , put (so for finite and when ), and recall and (The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3)); then the canonical representation satisfies for finite and infinite alike, so , while the reflection of the hypothesis gives by the normalized-product hypothesis; for both sides equal because and . Since the form a basis and both sides are linear, the intertwining identity holds for all [F3]; the hypothesis that the assignment defines a representation of is what makes the reflection representation well defined on . Finally for all — the case is the hypothesis and the case gives — so by bilinearity for all [F1].
(4)(b) Let , so for every . The canonical generators are the reflections , and whenever (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)); hence for every generator , so every element of , being a composite of generators and their inverses, fixes ; thus is fixed pointwise by .
The canonical data form a realization as defined in (4)(a): take , and . The pairing on the diagonal is , and the reflection formula is , so it defines the supplied representation of . For a finite label put ; then . The recursions defining give for : the cases and the induction follow from (The addition formulas for sine and cosine). The denominator is nonzero because (The zero sets of sine and cosine and the least positive common period 2 pi), and (Quarter-turn values and shifts by pi/2 and pi), proving . Infinite labels require no check.
(2) The four presentations. For each of the three displayed substitutions let denote the -algebra presented by generators subject to the braid relations and the -quadratic relation of step 1.2. The assignment the corresponding element of respects the -relation by step 1.2 and the braid relations: for even the two alternating words contain each of the two letters exactly times, and for odd the two letters are joined by an odd-labelled edge, so by the parameter convention of the Hecke presentation; hence the products of the scaling constants , or attached to their letters coincide, and the assignment extends to an -algebra homomorphism by the presentation's universal property and [F5]. The inverse assignment the corresponding element of is well defined by the same computation with the roles reversed, since the displayed inverse formulas have the same shape; for instance satisfies , which is the -relation. The two assignments are inverse on generators, so they are mutually inverse -algebra isomorphisms by the uniqueness clause of [F5].
(4)(c) Assume . Then is a hyperplane. For a root the reflection is defined with (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)) and its fixed space is the kernel of the nonzero linear functional , a hyperplane (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) [F3]; as is fixed pointwise by step 1.4 and contained in that kernel, the fixed hyperplane of is exactly . If then : otherwise for all , and evaluating at gives , contradicting the linear independence of . So two distinct reflections share the same fixed hyperplane and the correspondence "reflection its fixed hyperplane" is not injective, although is faithful with trivial kernel (The root-length criterion and faithfulness of the canonical reflection representation (3)) [F4].
For the single-parameter coefficient conversion, a reduced word gives and by the substitutions in step 1.2; their independence of the reduced word follows from that of , since . Their scaling factors are units, so both families are bases by the standard-basis property in step 1.1. Substituting in the given finite expansion gives ; uniqueness of coefficients in the -basis proves the stated formula. The original-normalization parameter is because the generator satisfies by step 1.2. This is a change-of-basis computation for any supplied finite expansion, not an existence proof for the canonical basis or its polynomials.
Scope and choice: clauses (4)(d) and (4)(e) record the interface and its boundary — the fact that a reflection-faithful realization is additional data not supplied by the Coxeter matrix, and the abstention from every Kazhdan–Lusztig, cell-theoretic, Soergel-bimodule and positivity construction, which belong to their designated proof homes. No such object is constructed here, and no choice is used: all four normalizations are explicit substitutions with constants in or , and the radical computation uses only the displayed defining formulas.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF)
- Rachael Boyd, Homology of Coxeter and Artin groups (PhD thesis, University of Aberdeen 2018, corrected version)
- Jon McCammond, The mysterious geometry of Artin groups (Winter Braids Lecture Notes Vol. 4 (2017), Course no I, pp. 1-30)
- George Lusztig, Hecke Algebras with Unequal Parameters (revised book text, arXiv:math/0208154v2)
- Ben Elias and Geordie Williamson, Soergel calculus (arXiv:1309.0865v1)
- Ben Elias and Geordie Williamson, The Hodge theory of Soergel bimodules (arXiv:1212.0791v2)