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 Presentations, Exchange, and Reduced Word Theorems
1 · Prerequisites
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- 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
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The Hecke branch begins again with generators, words and length; it does not assume the exchange or reduced-word theorem. A presentation alone gives a group, while its reflection geometry is what supplies the word control needed to define T_w independently of a reduced expression.
The page is authored as six draft items, in dependency order. Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups fixes the conventions: a finite Coxeter matrix, the presented group via the free group on S and the normal closure of the relators, its universal property, reduced words and the length , and the standard parabolic subgroups — with the explicit convention that no finiteness, faithfulness or completeness is asserted there. The geometric representation on the simple-root basis over a common splitting field, and the root set fixes one common characteristic-zero splitting field, one primitive -th root per finite edge and the constants , and defines the involutions on the simple-root basis together with the root set as their orbit; no positivity, integrality or faithfulness is claimed.
The word control is built in The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness: the rank-two block has trace and determinant , its order is exactly (including and ), the assignment descends to a representation with distinct generators and exact dihedral orders, the signed right action on is well defined, prefix reflections delete two letters, the sign-change set of a reduced word is expression-independent with , and alternating dihedral words are reduced in the ambient group. Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action then supplies the sign character and the parity laws , exchange on both sides, Tits two-letter deletion and faithfulness of the signed action. Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups proves braid connectivity of the reduced expressions of an element, the equivalence between reduced and M-reduced words, and the singleton claim . Finally Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification proves the support description , the intrinsic parabolic presentation with and , the unique minimal coset representatives with the descent characterisation and length additivity, and the type-A identification .
Reading and applications
Prerequisite pages: tensor-coherence-and-algebraic-descent, symmetric-groups-and-the-sign-homomorphism, splitting-fields, finite-fields-and-cyclotomic-extensions, group-homomorphisms-and-the-isomorphism-theorems. The companion coxeter-presentations-exchange-and-reduced-word-theorems-examples develops the calculations and failures needed to test these constructions. All six items are draft, and the two definitions record their later-derived features as justifiers rather than as part of their assertions.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
Definition
Let be a finite set and let satisfy for all and for all . Such an is a Coxeter matrix on .
The presented group. Let be the set of relators where is the free group on (Free group on a set of generators, Reduced words form the free group on an alphabet) and is the -fold product (Powers : natural exponents in a monoid and integer exponents in a group, with ), and let be the normal closure of in (The normal closure of a subset of a group, The normal closure of is the set of finite products of conjugates of elements of and their inverses). Define and write (as well as ) for the image of in (The quotient group and coset product , Group and abelian group).
Universal property. For every group and every map with for all and in for all with , there is a unique group homomorphism with for all (Monoid homomorphism and group homomorphism, 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, In , the words and represent the same element if and only if ).
Length and reduced words. For put The minimum exists: every element of the free group is represented by a finite word in (Words in an alphabet with formal inverses, elementary cancellation, and reduced words), and in because , so every element of is the value of a finite word in ; the set of admissible is therefore nonempty and has a least element by the well-ordering principle (The well-ordering principle, The natural numbers (von Neumann)). A word in is a reduced expression of when and , and nonreduced otherwise. The empty word is a word in of length , and ; it is the reduced expression of .
Terminology. The pair is the Coxeter system presented by the Coxeter matrix ; when is understood, we also say that is the Coxeter group presented by .
Standard parabolic subgroups. For put (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Conventions. is declared to be the order of in ; a value imposes no relator on . This definition asserts no finiteness, faithfulness, or completeness property of the presentation: the statements that the elements are pairwise distinct in (so that may be viewed as a labelled subset of ), that , that a word is reduced exactly when it admits no two-letter deletion, and that is the Coxeter system presented by the restricted matrix with intrinsic length equal to the ambient length are recorded with their justifiers below and are not used before those results.
Remarks
The properties announced in the Conventions paragraph are supplied later in this pair: pairwise distinctness of the simple generators, , and the deletion characterisation of reduced words in Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action ↗; the intrinsic presentation and length of the standard parabolic subgroups in Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification ↗. Until those results are available, and are to be read exactly as constructed above.
No form of choice is used in the construction: is the quotient of the free group on the finite set by an explicitly generated normal closure, and the only minimisation in the definition is over a nonempty set of natural numbers.
The geometric representation on the simple-root basis over a common splitting field, and the root set
Definition
Let be a finite Coxeter matrix and let be the group presented by it as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups.
A common splitting field. Put , the product over all unordered pairs with and (an empty product when ). Let be a splitting field of over (The rationals as equivalence classes of pairs of integers, The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Over an integral domain, degrees add under multiplication of nonzero polynomials, For every field , is a unique factorisation domain, Every nonzero polynomial over a field has a splitting field, Every finite family of nonzero polynomials has a splitting field, obtained from their product, Polynomials that split and splitting fields of a polynomial or a family of polynomials). The prime subfield of is (A field's prime subfield is isomorphic to in characteristic zero and to in characteristic , The characteristic of a ring: the least with when one exists, and otherwise, The rationals form a field), so (The characteristic of a field is zero or a prime number) and is separable over for every ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity). For each finite edge, is a factor of (Over an integral domain, degrees add under multiplication of nonzero polynomials), so all its roots lie in and, being separable of degree , it has exactly distinct roots there ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity, Polynomials that split and splitting fields of a polynomial or a family of polynomials); the group of such roots is therefore finite of order and hence cyclic, so it contains a primitive -th root of unity ( is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is , The group of -th roots of unity in a field, and primitive -th roots of unity). Fix one primitive -th root of unity for each unordered finite edge (a finite selection, since is finite) and put
The representation on the simple-root basis. Let be the -vector space with basis (Vector space over a field, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis). For each let be the unique -linear map with Directly from the definition each is an involution: and, for , . Hence every is invertible with , and the group these maps generate acts on (Linear map between vector spaces over the same field, Invertible linear maps, linear isomorphisms, and inverse linear maps, Identity maps and composites of linear maps are linear).
The root set. The root set of the construction is the orbit of the simple roots under the group generated by the (each generator is an involution). Writing for the representation supplied by The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness ↗, one has , the -orbit of the simple roots.
Conventions and limits. (i) ; exactly when ; when ; replacing by leaves unchanged, so the construction depends on the chosen primitive roots only through the numbers . (ii) No positivity of , no integrality of roots over , no identification of roots with reflections, and no faithfulness or definiteness of any form is asserted; those are separate matters, not part of this construction. (iii) is finite throughout, so the basis is finite and every linear map is specified by finitely many values.
Remarks
The single recorded justifier of this definition is The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness ↗, which proves , the exact order of , and the induced homomorphism ; only after that lemma is literally the -orbit of the simple roots.
No choice is used. The splitting field and the maps are constructions, and one primitive -th root is fixed for each of finitely many edges; the convention for introduces no root of unity at all.
The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness
Statement
Let be a finite Coxeter matrix, and let , , , the constants and the linear maps be as in The geometric representation on the simple-root basis over a common splitting field, and the root set; let and be as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. The involution, representation, signed-action and word assertions below hold for every finite , including and . Only the rank-two assertions require distinct generators.
- Involutions. for every ; each is invertible, and .
- The rank-two block. For any distinct , put , , , and . Then , and in the basis , Moreover for every . Consequently with , and for every with , and every ,
- Exact order of the rank-two product. For any distinct and the notation of (2), when put , of order , so ; when use , with no stipulated. Then: (a) if , the characteristic polynomial of is with distinct roots; is diagonalisable, , , and for ; (b) if , then and ; (c) if , then , , , and for every . Hence has order exactly when , and infinite order when ; in particular and for in the finite case.
- The representation and the exact dihedral orders. The assignment respects every defining relator of and induces a unique homomorphism with . Consequently, for any distinct , one has in and has order exactly in (infinite when ).
- The signed reflection action. Let . For define by where if and otherwise. Then for every , and the assignment extends to a well-defined right action of on (so and ). Indeed the only relations to check are and, for distinct with , : because for the two signs cancel while for one has and ; and the alternating word of length acts trivially because its prefix reflections (with ) satisfy for and are pairwise distinct, so each reflection of the dihedral subgroup occurs exactly twice and every accumulated sign is even while the conjugating coordinate returns to because .
- Prefix reflections, deletion and expression independence. Let be a word in with value and prefix reflections , and let . (a) If for some , then : the two letters can be deleted. (b) depends only on and , and the right action satisfies . (c) If the word is reduced (), then for every , the map is injective, and the set is independent of the reduced expression chosen, with .
- Ambient reducedness of dihedral words. Let , , and for let be the value of the alternating word of length beginning with . If and , or if and , then , every word in representing has length at least , and are pairwise distinct. Thus dihedral alternating words are reduced in the ambient group , not merely inside .
Facts & Assumptions
Given: A finite Coxeter matrix , the construction of The geometric representation on the simple-root basis over a common splitting field, and the root set, the group of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, with no assumption on ; distinct are fixed only for the rank-two assertions.
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: is the group presented by the Coxeter matrix, with the normal closure of ; for every group and every map with for all and for all with , there is a unique homomorphism with for all . The length is the least with for some , and .
The geometric representation on the simple-root basis over a common splitting field, and the root set: is a field of characteristic ; is the -vector space with basis ; the map is the unique -linear map with and for ; and for distinct with the constant is with a primitive -th root of unity, while when .
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear map between vector spaces over the same field: the basis vectors are linearly independent and span ; linear maps with the same values on that basis agree, so the primitive formulas in [F2] may be used to check every identity below on the basis.
For the distinct pair and its subspaces in (2), Internal direct sum : the sum is everything and each summand meets the sum of the others only in : if a vector space is the sum of subspaces meeting only in it is their internal direct sum; here and complement each other because the basis splits into the two parts.
The basis-independent characteristic polynomial of an endomorphism of a finite-dimensional space, including in dimension zero, For , the characteristic polynomial is when , with for the unique matrix, is monic of degree ; for its coefficient is and its constant coefficient is , while : for an endomorphism of a two-dimensional space, represented by its matrix, is monic of degree with second coefficient and constant coefficient , i.e. .
Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism, A characteristic polynomial that splits into distinct linear factors forces diagonalisability: if the characteristic polynomial splits into distinct linear factors then the endomorphism is diagonalisable, and a polynomial in vanishes on as soon as it vanishes at every eigenvalue and is diagonalisable.
The order of a finite group and the order of an element, with when no positive power of is the identity: for in a group, is the least with when such exist, then, and has infinite order when for all .
The group of -th roots of unity in a field, and primitive -th roots of unity: a primitive -th root of unity is an element of order exactly ; in particular, for a distinct pair with finite , the fixed element satisfies and for .
Proof
Given: The data of the statement: the finite Coxeter matrix , the field , the space with basis , the maps and constants , the group , with no assumption on ; a distinct pair is fixed only in steps 1.2–2.3 and the rank-two portions of steps 3.1, 4.1 and 7.1.
Proof technique: direct; all identities for and are checked on the basis of and the complementary basis of .
Involutions and nonidentity for every generator. Fix any . The primitive formulas of [F2] give and, for , . By [F3] the square is the identity on , so is invertible with inverse itself. Also , since the basis vector is nonzero and ; hence . These computations require no second generator; when , the assertions indexed by are vacuous.
The rank-two block. Fix any distinct and use the notation of (2). Since and with , linearity of gives and , so and the matrix of in the basis is , whose trace is and whose determinant is . For one has , so ; by linearity for every .
The two-block recursion. The subspace satisfies and because the basis of splits into the basis of and the basis of ; hence , and every has unique coordinates with , . I claim that for every and all such one has , where . For this reads , which holds because . If it holds for , then and by step 1.2, so applying and using gives , and , which completes the induction.
The cases and . If , then has order , so and , whence ; substituting into the matrix of step 1.2 leaves , so and . If , then by the convention in [F2], and the matrix of step 1.2 gives with and . The binomial expansion in the commutative algebra of endomorphisms then gives for every , and because and in the characteristic-zero field ; hence for all , and in particular .
The finite case . By step 1.2 and [F5] the characteristic polynomial of is ; since satisfies and , one has . The two roots are distinct: would give , impossible because has order . Hence the characteristic polynomial splits into distinct linear factors, and [F6] makes diagonalisable, with eigenvalues and . Consequently , because on an eigenvector for the operator scales it by by [F7] and [F8]; the operator is zero, because the polynomial vanishes at both eigenvalues, where and since ; and for , because on the eigenvector for it scales by , again since and is the least positive exponent killing .
Order of , the relators, and the exact dihedral orders. For any distinct pair with finite , step 2.1 gives for all , using and from steps 2.2 and 2.3; hence . If , choose with , which exists because ; then , so and has order exactly . For , for every gives for every , so has infinite order. Since this verifies each arbitrary distinct finite pair and step 1.1 proves for every generator, the map , , satisfies the hypotheses of the universal property in [F1], so there is a unique homomorphism with for all . For there are no distinct-pair relators, so the same universal property applies using only step 1.1; for it gives the unique homomorphism from the trivial group. For every , step 1.1 now gives , hence and by [F1]; the one-letter expression gives , so . If then , because while and by linear independence of and in ; hence in . Finally, has order exactly when : writing for the order of in , one has because in and is least, and because and is the least positive exponent killing ; hence . When , a positive exponent with would give , so no such exponent exists and has infinite order.
The signed action. First, is a bijection of with : for one has and applying again gives , while for one has — if then multiplying on the left by gives and hence using in — so and the two applications of return from . Next, fix a word in with and prefix reflections ; applying successively to returns with , by induction on : the -th step multiplies the sign by , whose exponent is exactly when , and it conjugates the coordinate to . Now fix any distinct with ; consider the alternating word of length and write for for its prefix reflections. The closed form is proved by induction on : the conjugating prefix is for odd and for even , and the identities and rewrite as in both cases. Hence for , while are pairwise distinct: an equality with gives after right multiplication by , contradicting and the fact from step 3.1 that has order exactly . Therefore the sequence of prefix reflections is , so for every and every accumulated sign is ; the conjugating coordinate returns to because . So the permutation effected by each alternating word of length is the identity, which verifies and for this arbitrary finite pair. There are no distinct-pair relators when , so the same verification applies in those cases using only . By [F1]'s universal property applied to , , there is then a homomorphism with for all . Define ; this is a right action, because gives , and .
Deletion. Suppose for some , that is . Multiplying on the left by and on the right by and using gives , hence . Substituting this into the word shows that deleting the two letters and leaves the value unchanged: .
Expression independence and reduced words. For a word of the sign accumulated in step 4.1 is , and the right action is independent of the word; comparing with the displayed formula for two words of shows that depends only on and , and that for every word of . If the word is reduced, then for every : if , two indices would have with , and step 5.1 would produce a word of length for , contradicting . Consequently the map is injective, so the set has exactly elements; by the independence of from the word, this set is independent of the reduced expression chosen.
Ambient reducedness of alternating words. Let , , and let be the value of the alternating word of length beginning with , where if and is arbitrary if . Its prefix reflections are by the closed form of step 4.1. They are pairwise distinct: an equality with gives after right multiplication by , which is impossible when because then and is the least positive exponent killing by step 3.1 and [F7], and equally impossible when because by step 3.1 no positive power of is . Hence exactly elements satisfy , namely the ; on the other hand, for any word of length in representing [F1], step 6.1 gives , where counts the occurrences of among that word's prefix reflections. Therefore for every word for , so ; in particular the values are pairwise distinct, having distinct lengths.
Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
Statement
Let be a finite Coxeter matrix, the presented group, its length function, and let , , and the right action of on be as in The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness.
- Sign character and parity. There is a unique homomorphism with for all , and for all . Consequently, for all and , with and .
- Exchange. Let be a reduced expression and let satisfy . Then for some ; equivalently, has a reduced expression beginning with , and is a prefix reflection of any reduced expression of . Right-handed form: if then for some .
- Deletion. If the word in is not reduced, then there are with Hence repeated deletion of two letters transforms every word into a reduced expression for the same element, and a word is reduced if and only if it cannot be shortened by deleting two letters.
- Faithfulness of the signed action. The right action of on is faithful, so embeds in ; in particular distinct simple generators are distinct in .
Facts & Assumptions
Given: A finite Coxeter matrix , the presented group with its length , the reflection set and the right action of on of The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, and a word in in each claim below.
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: is presented by with relators and ; for every group and every map with and whenever , there is a unique homomorphism with . The length is the least with , and , the empty word being the only word of length .
The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness: the right action of on defined by satisfies with depending only on and ; ; for a reduced expression with prefix reflections one has for every , the map is injective, and is independent of the reduced expression, with ; also for every .
Monoid homomorphism and group homomorphism: a group homomorphism satisfies and , so for one has .
Proof
Given: A finite Coxeter matrix , the group and length , and the right action of on with its function and sets .
The sign character and the parity laws. The map , , satisfies and for every finite edge, so the universal property in [F1] gives a unique homomorphism with . For any word this gives ; taking a word of length shows , so every word for has length congruent to modulo . Next, : a word of length for prefixed by is a word of length for , and is a minimum; symmetrically . Since by [F3] and , the parities of and are opposite, so ; with the two inequalities this forces , and the congruence records the parity. The same argument with in place of , using and , gives and modulo .
Faithfulness. Let . Then because the only word of length is the empty word with value by [F1], so ; choose a reduced expression with . By [F2] the set has , so pick , that is . The action formula of [F2] then gives , so acts nontrivially on ; hence the action is faithful and embeds in . In particular, for in the elements have distinct images under this embedding because while , and the first coordinates and differ.
Exchange. Let be reduced and let . Choose a reduced expression ; then is a word of length , hence a reduced expression of whose first prefix reflection is , so and by [F2]. By the expression-independence of in [F2] applied to the reduced expression , there is with , where ; multiplying this identity on the right by gives , which is the asserted deletion. For the right-handed form, note first that for every : reversing a reduced word for gives a word of the same length for , so , and applying this to gives equality. If now , then is a reduced expression of and , so the left-handed form applied to writes for some ; inverting both sides gives .
Deletion. Let be a word that is not reduced, and let be the least index such that the prefix is not reduced; such exists and , and is reduced with value . By the minimality of the element has , so by step 1.1, and the right-handed exchange of step 1.3 applied to the reduced expression and the letter gives for some . Therefore , so deleting the letters at positions and leaves the value unchanged. Iterating, the length strictly decreases by at each deletion and stops at length , leaving a reduced expression of the same element. Conversely, a reduced word cannot be shortened by deleting two letters, since the deleted word is a strictly shorter word for the same element.
Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups
Statement
Let be a finite Coxeter matrix; let and be the presented group and its length and let be the geometric representation, as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The geometric representation on the simple-root basis over a common splitting field, and the root set and The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, with reflection set and sign-change sets as in that lemma. Parts (1) and (2) hold for every finite , including the empty and singleton cases; a distinct pair is required only for part (3).
- Braid moves. Call two words in braid-equivalent when one is obtained from the other by finitely many replacements of an alternating subword of length by the alternating word of the same length. Then any two reduced expressions of the same element are braid-equivalent.
- M-reducedness. A word is reduced if and only if no sequence of braid moves followed by cancellation of a consecutive equal pair can shorten it (M-reduced in the sense of [Davis, Definition 3.4.1]).
- Singleton detection in dihedral subgroups. Fix distinct and put . The subgroup is dihedral of order when and infinite dihedral when ; every element of acts on the quotient as the identity, while for every one has (no induced quotient map for is assumed). Consequently and every element of has a reduced expression with all letters in (so the alternating words of length , and any when , are reduced in ).
Facts & Assumptions
Given: A finite Coxeter matrix , the group with length , the representation on the space with basis , the reflection set and the right action of on with its function and sets ; distinct and are fixed only for the rank-two assertions.
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: is presented by with relators and ; for every group and every map with and whenever , there is a unique homomorphism with . The length is the least with , and a word of length for is a reduced expression of .
The geometric representation on the simple-root basis over a common splitting field, and the root set: is a field of characteristic ; has basis ; is the unique -linear map with and for , where for and for .
The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness: the assignment induces a homomorphism ; has order exactly in (infinite when ); the right action satisfies with depending only on and ; for a reduced word with prefix reflections one has for all and independent of the reduced expression, of cardinality ; the prefix reflections of the alternating word with are ; and an alternating word of length , or of any length when , is reduced in , its value having length .
Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action: for all and one has and ; if is reduced and then for some , and if then for some ; and a word is reduced if and only if it cannot be shortened by deleting two letters.
Proof
Given: The data of the statement; a distinct pair is fixed only in the rank-two arguments of steps 1.1 and 1.2.
Proof technique: strong induction on for part (1), with the exchange condition; part (3) is a direct computation with the dihedral subgroup, and part (2) is an induction on the word length using part (1).
The dihedral subgroup and the singleton claim. Fix any distinct , put and . By [F3], has order exactly when and infinite order when , and ; hence for every by induction on . It follows that is exactly the set : indeed contains and (as ), and is closed under inverses (the inverse of is and ) and under multiplication, since , , and ; so is a subgroup containing and , while every product of copies of lies in by this closure, whence . The elements and with (all when ) are pairwise distinct: with gives , impossible by minimality of the order , while for the powers with are distinct because has infinite order; and gives , so , which cannot happen because would make commute with , giving , hence and ; then , so the order of divides , an impossibility unless , and in the case one has with and (the latter would give ). Hence has exactly elements and is dihedral when , and is infinite dihedral when . Next, is preserved by and , and and for every : on the basis, , and for , and symmetrically for . So for every product of copies of one has for all by induction on the number of factors, and therefore every element of acts as the identity on . If , then because the basis is linearly independent, while , so . Thus fails the congruence satisfied by every element of , without requiring to preserve or induce a quotient map; since is a homomorphism, . Hence . Finally, every element of has a reduced expression with letters in : for the element equals both and , alternating words of lengths and whose minimum is at most , and the element equals both and (for the first is the single letter ), alternating words of lengths and whose minimum is at most ; an alternating word of length at most is reduced in by [F3], so the shorter of the two is a reduced expression of the element in the letters . When every alternating word is reduced by [F3], and with is written as and with as .
Braid moves preserve the value. Fix distinct with and let and be the two alternating words of length in , beginning with and with . With of order by [F3], one has and when is even, so their values coincide; and while when is odd, using , and . Hence replacing an alternating subword of length by the other alternating word of the same length leaves the value in unchanged, and so does a finite sequence of such replacements.
The reduction step. Let and let and be reduced words for the same element , with ; write , , and assume as induction hypothesis that part (1) holds for all elements of length at most . Since is reduced, has length , so the exchange condition of [F4] applied to the reduced word and the letter gives for some , that is . Multiplying the equality on the right by and then by shows that it is equivalent to ; in particular , since would give , contrary to . Hence , and the word is a reduced expression of . Its tail and the suffix are reduced expressions of the same element of length , so by the induction hypothesis they are braid-equivalent, and prepending the letter to both words gives the braid-equivalence of with . If , multiplying the equality on the right by shows that the words and are reduced expressions of the same element of length , so by the induction hypothesis they are braid-equivalent, and appending the letter to both gives the braid-equivalence of with ; combining the two braid-equivalences, is braid-equivalent to . Thus either and are braid-equivalent, or , in which case and is braid-equivalent to .
The iteration. Keep the setup of step 1.3 and assume now that the two words are not braid-equivalent. For let be the -letter word consisting of the alternating word of length ending in followed by the letters . Thus and ; let denote the braid class of when is reduced. I claim that for every : either and are braid-equivalent, or is reduced, represents , and is the class of when is even and the class of when is odd, for every . For this is step 1.3: either the words are braid-equivalent, or and the word is braid-equivalent to , while , which is the assertion for . For the induction step, suppose the claim known for , so that and are reduced words for ; apply step 1.3 to this pair of words. If they are braid-equivalent, then their classes coincide and, since and have opposite parity, the known class rule forces the classes of and to coincide, and we are done. Otherwise the second alternative of step 1.3 holds for the pair, which says that deleting the last letter of and prepending the first letter of yields a word that is reduced, represents , and is braid-equivalent to . Now is the alternating word of length ending in followed by , so deleting its last letter leaves the alternating word of length ending in followed by ; the first letter of is the first letter of the alternating word of length ending in , which differs from the first letter of the alternating word of length ending in , so prepending it produces the alternating word of length ending in followed by , which is exactly . Hence is reduced, represents , and lies in the class of ; since and have the same parity, this agrees with the claimed class rule and the claim holds for .
The final phase. Assume the claim of step 2.1 with , and assume that and are not braid-equivalent; then every for is a reduced word for whose class is the class of when is even and the class of when is odd. In particular is the alternating word of length ending in , and is the alternating word of length ending in followed by the single letter . Write for the value of the alternating word of length ending in and for the letter with which the alternating word of length ending in begins; then the word has value and has value , and since both represent one has , that is . So is conjugate to by the element , which lies in the dihedral subgroup ; hence , and since , step 1.1 gives . The letter cannot be : the word would then end in two equal letters , and deleting that pair would express by a word shorter than , so would not be reduced. Hence , so is the alternating word of length ending in ; of the two alternating words of length in , ends in and ends in . To see that this forces , compare the values of and in the dihedral group , whose elements are the powers of ; if is even these values are and , equal exactly when , and if is odd they are and , equal exactly when , that is . Since and represent the same element, ; when no positive power of is by [F3], so this alternative cannot occur and , and then by minimality of the order one has . Conversely : by [F3] the prefix reflections of the reduced word are pairwise distinct, while the closed form of [F3] for alternating words gives for these reflections (here because ), so would make the reflections at positions and coincide, a contradiction. Hence . Finally, the two words and are the two alternating words of length , so one is obtained from the other by the single replacement of the alternating block of length by the other alternating word of the same length; they are braid-equivalent, hence in the same class, but by the class rule their classes are the classes of and of respectively, so and are braid-equivalent, against the assumption.
Conclusion. Part (1) follows by strong induction on : for two reduced words for coincide, and for , reduced words with the same first letter are handled by the induction hypothesis applied to their tails, while reduced words with different first letters are handled by steps 1.3, 2.1 and 3.1, which produce braid-equivalence in every case. For part (2), let be a word with value . If is reduced, no sequence of braid moves and deletions of consecutive equal pairs can shorten it: braid moves preserve the value and the length by step 1.2, deleting a consecutive pair preserves the value, and a shorter word for would contradict . Conversely, if is not reduced, we show by induction on that it can be shortened; for the word is reduced, so , and if the suffix can be shortened, the same sequence shortens the whole word. Otherwise the suffix is M-reduced, so by induction on it is reduced, with value and . Since has length at most , the length laws of [F4] give , and the exchange condition of [F4] applied to the reduced word and the letter gives for some , so that is a reduced expression of of length beginning with . By part (1) it is braid-equivalent to , and prepending to both words exhibits a sequence of braid moves taking to , which the deletion of the consecutive pair shortens. Hence a word is reduced if and only if it is M-reduced.
Remarks
The argument for part (1) is the induction of [Lusztig, Theorem 1.9] with its intermediate statements rendered explicitly: step 1.3 is the one-step reduction, step 2.1 is the parameterized family of intermediate words, and step 3.1 is the final dihedral case, in which the two alternating words of length in the letters are reduced, coincide in value exactly when , and differ by one braid move. Part (2) is [Davis, Theorem 3.4.2(i)] and [Davis, Definition 3.4.1]; the singleton claim is the step used at the end of [Lusztig, Theorem 1.9]. Neither root positivity nor geometric faithfulness is used.
Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Statement
Let be a finite Coxeter matrix with presented group , length and geometric representation as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The geometric representation on the simple-root basis over a common splitting field, and the root set and The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, and let .
- Support and reduction. For every the set of letters occurring in a reduced expression of is independent of the reduced expression, and every word in representing can be transformed into a reduced expression by repeatedly deleting two letters (Tits reduction, using only letters already present). Consequently
- Intrinsic parabolic presentation. Let be the group presented by the restricted Coxeter matrix in the sense of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. The canonical homomorphism , , is an isomorphism. Hence is a Coxeter system, its intrinsic length function agrees with the ambient length on , and .
- Minimal coset representatives. Every right coset (, Left and right cosets and of a subgroup) has a unique element of minimal length; it is characterized by for all , and it satisfies Equivalently, every has a unique factorization with and the minimal representative of the right coset , and then . By inversion ( preserves lengths and interchanges the two coset families and ), every left coset has a unique minimal element , characterized by for all and satisfying for all .
- Type A. Let , and if , if (a Coxeter matrix of type ). Then extends to an isomorphism (the letters carry the library's symmetric group by the order-preserving identification with , under which is the adjacent transposition ), and for every , the inversion number of the corresponding permutation (Inversions, inversion number, the sign , and even and odd permutations). In particular a word in the is reduced if and only if its length equals the inversion number of its value.
Facts & Assumptions
Given: A finite Coxeter matrix , the group with its length function , the geometric representation , and a subset for parts (1)-(3); the type-A matrix and data of part (4).
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups: is the group presented by with relators and ; for every group and every map with and whenever there is a unique homomorphism with . The length is the least length of a word in representing , and ; for , .
Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action: for all , one has and ; if is reduced and then for some ; and a word is reduced if and only if it cannot be shortened by deleting two letters, that is, any non-reduced word has for some .
Matsumoto's theorem: braid connectivity of reduced expressions, with singleton detection in dihedral subgroups: any two reduced expressions of the same element are braid-equivalent, where a braid move replaces an alternating subword of length by the alternating word of the same length with the two letters interchanged; and a word is reduced if and only if it is M-reduced, that is, cannot be shortened by a sequence of braid moves and cancellations of consecutive equal pairs.
The finite symmetric group , one-line notation, and cycle notation: with composition , one-line notation , and cycle notation; a -cycle is a transposition.
Cycles with disjoint supports commute: transpositions with disjoint supports commute. Generation by the zero-indexed adjacent transpositions is proved directly in step 1.2.
Left and right cosets and of a subgroup: "For , the left coset and right coset of represented by are ", so the sets and are the two coset families of the subgroup .
The well-ordering principle: every nonempty subset of has a least element.
Proof
Given: The data of the statement.
Support and Tits reduction. Let . If and are reduced expressions of , then by [F3] they are braid-equivalent, and a braid move replaces an alternating block in two letters by the other alternating word of the same length, so it preserves the set of letters occurring; hence the set of letters of a reduced expression is independent of the chosen expression. Next, let be a word in with value and length ; by [F2] there are indices with , so deleting the two letters leaves the value and uses only letters already present. Iterating, the length drops by two at each step until it reaches , and the resulting reduced expression of uses only letters of the original word. The values of finite words in form a subgroup: the empty word gives , concatenation gives products, and reversal gives inverses because for . This subgroup contains and lies in every subgroup containing , so it equals by The subgroup generated by a subset, the cyclic subgroup , and cyclic groups. Consequently if and only if : if , a reduced expression of is a word in the letters of , so ; conversely, if , then is a product of elements of , hence the value of some word in the letters , which reduces as above to a reduced expression whose letters lie in , so .
Type A. Let and let now be the group presented by the type-A matrix on ; we use the library's symmetric group and the transpositions for , which are the elements written in the statement under the order-preserving identification of with . The relators hold in : ; when , because the two transpositions have disjoint supports and disjoint cycles commute by [F6]; and by direct computation on the three symbols . By the universal property in [F1] there is a homomorphism with . It is onto by the following direct argument. If a permutation is not the identity, its one-line entries are not increasing (the unique increasing bijection of fixes every entry), so some has . Right multiplication by swaps these neighbouring entries and lowers by one: the total contributions of pairs involving either position and a third position are unchanged, while the inversion disappears. Repeating reaches inversion number zero and hence the identity, expressing as a product of adjacent transpositions; this uses only [F4] and [F5]. We show . Let (so when ), and for put , and put . Right multiplication by a generator obeys: if then , because commutes with every factor of ; if then ; if then , by (with ); and if then , because moving the final left past and using turns it into a leading , which then commutes left past ; for the same rules read for and . In each case has the form with : either with , or , or with . Hence the union contains and is stable under right multiplication by every generator; since every generator is its own inverse, every word in the generators lies in , so and . The relators of the type-A matrix on generators hold among in , so by [F1] there is a surjection from the corresponding presented group onto ; by induction on , whose base gives , this yields and hence . On the other hand , since a bijection of the -element set is determined by choosing the image of in ways, then the image of in ways, and so on. Therefore the surjection between the finite groups and is a bijection, hence an isomorphism. It remains to identify with the inversion number. Right multiplication by interchanges the entries at positions and in the one-line notation by [F4], so it exchanges the inversion statuses of the pairs for and of the pairs for , while the pair becomes an inversion exactly when it was not one; hence , with exactly when by [F5]. Therefore every word of length in the generators representing has (each letter changes the inversion number by one), so for the length function of with respect to the generating set ; and if then some has (otherwise would be increasing, hence the identity), so by induction on the inversion number, giving . Finally for all : a word of length in the representing maps to a word of the same length in the representing , so ; conversely a word of length for lifts to the word , which maps to , so it represents by injectivity of and . Hence , and by [F2] a word in the is reduced exactly when its length equals the inversion number of its value.
The intrinsic parabolic presentation. Let be the group presented by as in [F1]. The map , , satisfies the relator conditions in , because every relator of the restricted matrix is a relator of ; so [F1] gives a homomorphism , which is onto because the elements of generate . For injectivity define by choosing, for , a reduced expression in and setting (product in ); by step 1.1 all letters lie in . This is well defined: another reduced expression of is braid-equivalent to it by [F3], and every braid move involved replaces an alternating block in two letters of by the other alternating word, which is a defining relation of , so the two products agree. To see that is a homomorphism it suffices to show for and . If , then prepending to a reduced expression of gives a reduced expression of with letters in , and the claim is immediate. If , then [F2] applied to a reduced expression gives for some . The deleted word is reduced of length , and prepending to it gives another reduced expression of of length , with every letter in . By [F3] these two reduced expressions of are braid-equivalent using only letters in , so their products agree in : . Multiplying this equality by in gives . Iterating along a word for any , and using , gives , so is a homomorphism. By construction for all , and fixes each generator of because for ; hence . Thus and are inverse isomorphisms, and is a Coxeter system. If and is a reduced expression of in , then all by step 1.1, so the same word of length is a word in the generators of , giving ; conversely a word in the letters representing is a word in representing , so ; hence on . If , then by step 1.1, so and .
Minimal coset representatives. Fix . The set is a nonempty subset of and so has a least element by [F8]; choose of minimal length. For one has , so ; by [F2] , and therefore . Now let with a reduced expression and let be reduced, so ; by step 1.1 all lie in . Applying the Tits reduction of step 1.1 to the concatenated word produces a reduced expression of that is a subsequence of it, hence splits as with a subsequence of and a subsequence of ; write also for their values. If is not the full word , then , while has fewer than letters, so , contradicting the minimality of . Hence is the full -word, so and ; since is a subsequence of the reduced word of length and represents , it must use all letters, so the concatenation is reduced and . If also has minimal length, write with ; then with , so , and ; this gives uniqueness. Conversely, let satisfy for all and write with the minimal representative of ; additivity gives , and if and is a reduced expression with , then , contradicting the hypothesis; hence and is the minimal representative. The factorization of an arbitrary is now obtained by taking minimal in and , and its uniqueness follows from the uniqueness of . For left cosets, note that for every : reversing a reduced word for gives a word of the same length for , so , and applying this to gives equality. Inversion is an anti-automorphism interchanging right and left cosets and fixing lengths, so applying the right-coset statement to inverses gives unique minimal elements of the left cosets , characterized by for and satisfying .
5 · Examples, counterexamples and false statements
None yet.
Sources
- George Lusztig, Hecke Algebras with Unequal Parameters (revised 2014 book text, arXiv:math/0208154v2)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008; author's complete PDF)
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005) (complete author/class-hosted PDF)