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.
Parabolic Subgroups and Double Coset Geometry
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- 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ₙ
- 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
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- 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
- 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
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Coset factorization is the algebraic form of moving to a face of a chamber. Unique minimum representatives, intersections and double cosets need separate arguments; an arbitrary subgroup is not automatically parabolic.
This page fixes the parabolic calculus of a Coxeter system: standard parabolic subgroups and their one- and two-sided transversals, the parabolic root subsystem, and the unique minimum of a parabolic double coset with its additive normal form. It is the algebraic counterpart of moving between faces of a chamber on the geometric pages, and it supplies the quotients , and used by the later Bruhat, Davis-complex and growth pages.
Definition and conventions
Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups introduces , the descent sets , the quotients and , their two-sided intersection , and the notions of a parabolic subgroup (a conjugate of a standard one) and of a reflection subgroup. The left/right conventions are fixed once and used consistently; no converse from reflection subgroups to parabolics is asserted, and the companion page computes the two test cases that separate the three classes.
Main results
Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives proves , identifies the parabolic root subsystem as the roots lying in the span of the simple roots indexed by , so , and shows that the transversal elements of the one-sided quotients are global minima of their cosets, not merely locally descent-free words. The converse containment is proved by induction on the length of the reflection with a given root, using the root sign criterion and the root-length criterion twice.
Descent reduction, minimum-length elements, and the additive factorization in a double coset supplies the minimality input the rest of the page needs: descent reduction shows that every double coset contains a descent-free element, and the middle-block argument on a reducing word shows that for the element is the unique minimum of , with an additive factorization of every element of the coset. The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J then proves for by strong exchange at the first letter of a reduced expression, and records the warning that a conjugated reflection lying in , with and , is necessarily a simple root reflection, not an arbitrary positive combination of simple roots.
Unique minimal double coset representatives and the additive normal form u-d-v assembles these pieces: each double coset has a unique descent-free element, its minimum, and every element of the coset has a unique representation with , and length additivity . The transversal restriction on the first factor is recorded explicitly, together with the computation showing that an arbitrary destroys uniqueness.
Prerequisites and reading
Required earlier pages: coxeter-presentations-exchange-and-reduced-word-theorems for the presented group, its length function and the exchange, deletion and parabolic-minimal-representative theorems, and canonical-roots-signs-and-faithful-reflections for the root sign criterion, the root-length criterion and the root-reflection dictionary. The companion parabolic-subgroups-and-double-coset-geometry-examples tests the constructions in and in the infinite dihedral group.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
Definition
Let be a finite Coxeter matrix, let be the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), and let be the set of reflections of (The canonical reflection homomorphism, roots, reflections, and the positive cone). Throughout, and denote subsets of .
(1) Standard parabolic subgroups. For put
the subgroup generated by (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups); is the standard parabolic subgroup of of type . Thus and . By Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1),(2): for every one has if and only if , where is the (well-defined) set of letters of any reduced expression of ; is a Coxeter system; its intrinsic length function agrees with ; and .
(2) Descents and the one-sided quotients. For put
each of and lies in (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action (1)). Define
Conventions are fixed here: in the subset is tested on the left, in it is tested on the right; means left multiplication by and right multiplication. The interpretation of these sets as sets of coset representatives is not part of the definition; it is quoted from Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3) and re-examined in Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives ↗ (3): every has a unique factorization
where is the unique element of minimal length in the right coset , and it satisfies for all ; symmetrically every has a unique factorization
where is the unique element of minimal length in the left coset , and it satisfies for all . Thus consists exactly of the elements of minimal length in the right cosets and consists exactly of the elements of minimal length in the sets . Inversion gives , because and .
(3) The two-sided quotients. Define
thus , and , and the members of are exactly the elements of with no left descent in and no right descent in . Whether is a set of representatives of the double cosets is again a theorem, not a definition; it is proved in Unique minimal double coset representatives and the additive normal form u-d-v ↗.
(4) Parabolic subgroups and reflection subgroups. A subgroup is a parabolic subgroup of if
a parabolic subgroup with is standard. A subgroup is a reflection subgroup if , i.e. if is generated by the reflections it contains. Every parabolic subgroup is a reflection subgroup, since and for all , . No converse is asserted: it is not claimed here that a subgroup generated by reflections is parabolic, and the companion examples page computes test cases for the two distinctions created by this definition --- standard parabolic versus parabolic, and reflection subgroup versus parabolic subgroup.
Remarks
- Well-definedness. is the subgroup generated by a subset of the group and exists by The subgroup generated by a subset, the cyclic subgroup , and cyclic groups; is the trivial subgroup and . The sets , and are subsets of specified by a predicate and are therefore well-defined sets. The two displayed factorizations of (2) and the description of , as sets of minimal representatives are quoted from Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)-(3), which proves them from the deletion and exchange properties before they are used here; the inversion identity uses , (Group and abelian group) and the equivalence . The only genuinely two-sided assertion is deferred: this item introduces as a set of descent-free elements and asserts nothing about double cosets; the property that every double coset contains exactly one element of , and that this element is its minimum, is established in Unique minimal double coset representatives and the additive normal form u-d-v ↗, the later proof that justifies the definition for its applications.
- Left and right conventions are not symmetric by accident. In the descent is tested by left multiplication, in by right multiplication; the right coset is represented by and the left coset by . Reversing either convention produces false statements already in with (for example has no factorization with ), which is why they are recorded here once and used consistently.
- No converse and no Choice. The inclusion "parabolic subgroups are reflection subgroups" in (4) is immediate from the definitions, since a conjugate of a simple reflection is a reflection; nothing is asserted in the other direction. No use of the Axiom of Choice is made: all constructions are subgroups and subsets of the fixed group , and the minima in (2) are minima of nonempty subsets of the natural numbers.
Descent reduction, minimum-length elements, and the additive factorization in a double coset
Statement
Let , , be as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, let , and let , , , be as defined there; for write
for the double coset of .
(1) Descent reduction. Fix a total order on the finite set . Every set contains an element of . More precisely, starting from and repeatedly replacing the current element by , where is the least element of with , if such an exists, and otherwise by , where is the least element of with , if such an exists, the process stops after at most replacements at an element of .
(2) Elements of have minimum length. Let . Then
Consequently every double coset contains exactly one element of , and it is the unique element of minimum length of that double coset; conversely, every element of minimum length in its double coset lies in .
(3) Additive factorization. Let and . Then there exist and with
Facts & Assumptions
Given: a finite Coxeter matrix with presented group and length , subsets , an element , and a fixed total order on .
For all and one has and (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).
; hence a word of length representing gives , and concatenating words gives (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
, , and ; for , is the set of all products with , (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups).
Every nonempty subset of has a least element (The well-ordering principle, The natural numbers (von Neumann)).
, where is the set of letters of any reduced expression of ; in particular every element of has a reduced expression all of whose letters lie in (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
If is any word in and are positions whose deletion does not change the value, in the sense that , then the deletion is an equality in the group ; conversely a word is reduced if and only if no two-letter deletion preserves its value (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action).
Multiplication in is associative, and equalities may be multiplied on the left or on the right by group elements and cancelled (Group and abelian group).
Proof
Descent reduction. A total order on exists because is finite (transport the order from any finite enumeration). Use the fixed order in every least-generator selection. Suppose and for some ; then and , because by [F3] and [F7]. Likewise, if for some , then by [F3] and [F7]. By [F1] each replacement lowers by exactly , so a process that starts at , replaces by with the least of if one exists and otherwise by with the least of if one exists, and stops when neither exists, performs at most replacements and terminates, because the values of lie in by [F2]. At termination and there is no with and no with ; since the differences lie in by [F1], this says for all and for all , that is, by [F3].
The middle block of a reducing word is never deleted. Let be an element of minimum length in and let , say with , by [F3]. Choose reduced words for , for and for ; by [F5] the letters of lie in and those of in . While the current word, which begins as followed by followed by , is not reduced, choose the lexicographically least pair of positions whose deletion preserves the value, which exists by [F6], and delete the two positions; write the current word as , where and are the surviving subwords of and and, by induction over the rounds, the full block survives. Such a deletion pair never removes a letter of : if both deleted letters lay in , then the surviving word has the value of , so by [F6] and [F7] the word has the same value as , while has length , contradicting by [F2]; if exactly one deleted letter lay in and the other in , then the surviving word is with equal to with one letter deleted and equal to with one letter deleted, so by [F6] and [F7] the value of equals , and this lies in because and by [F3]; but has length , so by [F2] the value of has length , contradicting the minimality of in ; the case of one deleted letter in and one in is the same with the roles of and exchanged. A deletion pair with both letters outside is not excluded; it simply shortens or . Each deletion lowers the number of letters by , so the process terminates at a reduced word of of the form , where and arise from and by deletions and is untouched; the words and are themselves reduced, since a two-letter deletion inside preserving the value of would, by [F6] and [F7], preserve the value of the reduced word . Writing and , the reducedness of gives and .
A minimum has no descents. Let and let ; this set is nonempty, so the set has a least element by [F4], and we choose with that least element. If and , then by [F3] and [F7], contradicting minimality; hence for all , because by [F1]. Symmetrically for all . Therefore by [F3]: by step 1.1 every double coset contains an element of , and taking of minimum length shows each double coset also has a minimum, which lies in .
Every element of is a minimum of its double coset. Let and let be a minimum-length element of , which exists by step 2.1. Applying step 1.2 with , gives with , and . If , then has a reduced expression whose first letter lies in by [F5], so , and by [F2] and [F7] , contradicting for , which holds because by [F3]. Hence , and symmetrically , so : the element of is a minimum-length element of .
Minimality, the equality case, and the additive factorization. Let and . By step 3.1 the element is a minimum-length element of , so step 1.2 applied with exhibits with , and , which is the additive factorization (3); in particular , with equality if and only if , that is, and . If is a second element, then applying the factorization with gives and, since is also a minimum of by step 3.1, , so and : each double coset contains at most one element of , and by step 1.1 it contains one, namely its unique element of minimum length. Finally, if has minimum length in , then by step 2.1. This proves (2) and completes the proof.
Remarks
- The deletion step is Tits deletion, not a cancellation of equal letters: the theorem of Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action provides positions whose deletion preserves the value of a non-reduced word, and the two deleted letters can be distinct simple reflections. The argument uses only the positions.
- The argument is choice-free: each deletion is the lexicographically least admissible pair of a finite nonempty set of positions, and the minima of double cosets are minima of nonempty subsets of .
Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives
Statement
Let , , and be as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, so that , , and the descents have the meaning fixed there. Let with its Coxeter form and positive cone (The real Coxeter form, its radical, reflections, and form-preserving maps), let be the canonical reflection homomorphism with root system (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots (2)), and for put
(Linear combination of a finite list, and the span as the smallest linear subspace containing ); here and .
(1) Intersections. For all ,
(2) Parabolic root subsystems. For every one has for all ; consequently
Moreover with , and the reflections lying in are exactly the elements with in the root-reflection dictionary of The inversion formula , the root-reflection dictionary and strong exchange (1).
(3) Coset minima are global minima. Let , , and let be the unique element of , i.e. the unique with (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)). Then
equivalently
Thus each set contains exactly one element of , namely its unique element of minimum length, and symmetrically each right coset contains exactly one element of , namely its unique element of minimum length.
Facts & Assumptions
Given: a finite Coxeter matrix with presented group and length , subsets , the space with its Coxeter form , and the canonical reflection homomorphism with root system and reflection set .
For : , is a Coxeter system with intrinsic length , and ; every right coset has a unique element of minimal length, characterized by for all , satisfying for all ; by inversion every left coset has a unique minimal element , characterized by for all and satisfying for all (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
and for with , when ; for with the reflection with normal is (The real Coxeter form, its radical, reflections, and form-preserving maps).
for every , so and for (The canonical reflection homomorphism, roots, reflections, and the positive cone, The real Coxeter form, its radical, reflections, and form-preserving maps); preserves , every root satisfies , and for all , (Descent of the reflection representation, unit root norms, and conjugation of reflections).
Every root lies in or in , but not in both; hence with and one has , and every has all its coefficients while every has all its coefficients (Root sign coherence and the action of simple reflections on positive roots).
For all and : , and (The root-length criterion and faithfulness of the canonical reflection representation).
The root-reflection dictionary: for any , with is well defined, satisfies and , and restricts to a bijection , , with if and only if . Strong exchange: if is reduced and for a reflection , then there is a unique with and , and the positive root with is (The inversion formula , the root-reflection dictionary and strong exchange).
For one has , because every generator satisfies ; hence and for all (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Group and abelian group).
is the smallest subgroup containing (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups). The set of finite products of elements of and their inverses is a subgroup containing (concatenate words and reverse and invert a word), and is contained in ; thus it equals .
is the set of all real linear combinations ; in particular and the coefficients of a vector of in the basis vanish outside ( is exactly the set of linear combinations of finite lists of elements of , and ); the coordinate assertion follows by evaluating the finite combinations at each .
Proof
Intersections of standard parabolics. By [F1], if and only if , and if and only if ; hence if and only if , if and only if . This proves (1) for all subsets , including , where by [F1] and [F2].
Invariance of and one containment. Let . By [F4], and for , ; every vector of is a linear combination of the , , so , and since is invertible with , also . Every is a product of elements of and their inverses by [F10], and the latter are again elements of because ; multiplying the identities along such a product gives . Consequently, for and the root lies in , so ; for this says , since by [F5] and by [F11].
Setup of the converse containment. Let . By [F5] the root lies in or in ; replacing by , which is again a root in because and are stable under negation, we may assume , so by [F5] and [F11] we have with for every , and . Let be the reflection of the dictionary [F7], so that and by [F4]. We prove by strong induction on . If , then is a word of length one, hence for some ; the dictionary gives , so and the clause " if and only if " of [F7] yields ; since and both lie in while and are disjoint by [F5], , and then by [F11], so .
Additivity on the left coset. Let . By [F2] one has for all , so is the minimal representative of the left coset characterized in [F1], and therefore for all .
The induction step. Assume in the situation of step 1.3 and that the claim holds for all roots in whose reflection has length . Since by [F3] and [F4], and for , there is with ; fix such an . If , then with , and gives , that is and ; then , against , so necessarily . Put ; its coefficient at each equals , and this set is nonempty, so by [F5]. Put ; its coefficient at each is , so and hence by [F5], while because . By the dictionary [F7], . Since , the root-length criterion [F6] gives and then by [F8]; by [F9], . Moreover has at each the coefficient of , because alters only the coefficient of ; hence by [F5], and the criterion [F6] with gives , that is by [F8]. Since and , the induction hypothesis applies and yields ; then because .
The two descriptions of the quotients. Let . If , then by step 1.4 for every , with equality if and only if , that is . Conversely, if for all , take : then , and by [F8], so for all , that is by [F2]; hence . Applying this to and using from [F2] and the identities and from [F9], we get if and only if for all ; as runs over so does , so this is the second displayed description.
The converse containment. We prove by strong induction on that every satisfies , the cases and being steps 1.3 and 2.1; the induction is well founded because the length values are natural numbers. First let . Then , and its positive root is . Strong exchange furnishes a representation with letters in : choosing a reduced expression of inside with all by [F1] and applying strong exchange [F7] to and the reflection , whose square is and has length , produces an index with and with and . Hence for positive . If instead , apply this argument to with , ; then , since and by [F4]. Therefore .
Every coset has a unique minimum. Let and let be the unique element of , so that with by [F1] and . Every has the form with , and by step 1.4, , with equality if and only if , that is and . If is a second such element, write and with (possible since ); step 1.4 gives and , so , and . Thus contains exactly one element of , namely its unique element of minimum length, which proves the right-handed assertions of (3). The left-handed assertions follow by the same argument applied to the inverses, using the description of in step 2.2 and the identities of [F9].
Conclusion of (2). Combining steps 1.2 and 3.1 gives , which by [F11] is the displayed set of roots that are real linear combinations of the , . Since by [F5], intersecting with gives for . For the reflection identification: if , say with , , then by [F7]; conversely, if , then for the unique by [F7], and choosing a reduced expression inside with letters in by [F1] and applying strong exchange [F7] to and the reflection exhibits and , a root in because and . Hence the reflections of are exactly the with . Together with steps 1.1 and 3.2 this proves (1), (2) and (3); no Axiom of Choice is used: each proof fixes finitely many witnesses, and no simultaneous selection from an arbitrary family is required.
Remarks
- The induction of steps 1.3-2.1 is Qi's proof of in The real Coxeter form, its radical, reflections, and form-preserving maps's notation: the descended root stays positive and shortens the reflection by two, which is why the criterion of The root-length criterion and faithfulness of the canonical reflection representation is invoked twice with opposite roles of the two factors.
- The argument nowhere inverts : only the unit-norm property of roots is used, so degenerate and indefinite Coxeter forms are covered. The selection of with is from the fixed finite set ; no ordering on is assumed. Strong exchange then supplies its unique exchange index.
The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J
Statement
Let , , be as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups, let , and let . Put
where . Let , be as in Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2) and let be the root-reflection dictionary of The inversion formula , the root-reflection dictionary and strong exchange (1).
(1) The intersection. . Conjugating by gives
and equivalently .
(2) The descent form. If and is a reduced expression of with letters , then
(3) The conjugated positive root is simple. Let . Then is a reflection of (that is, ), its root is , and if and only if this root is one of the simple roots , . Moreover, if then already : a reflection of the form with that lies in is necessarily a simple reflection of the parabolic root system of Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2), never a non-simple positive combination such as .
Facts & Assumptions
Given: a finite Coxeter matrix with presented group and length , subsets , an element and the subset .
, , and ; in particular satisfies for and for (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups).
, , is a Coxeter system with intrinsic length , every left coset has a unique minimal element , characterized by for and satisfying for all , and dually for the minimal representative of a right coset and all (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
For , every admits some factorization with , and ; moreover for all (Descent reduction, minimum-length elements, and the additive factorization in a double coset).
Strong exchange: if is a reduced expression and satisfies , then there is a unique index with and (The inversion formula , the root-reflection dictionary and strong exchange).
The root-reflection dictionary: for and , with the element is well defined, , the map , , is a bijection and if and only if (The inversion formula , the root-reflection dictionary and strong exchange).
, so every conjugate of a simple reflection is a reflection (The canonical reflection homomorphism, roots, reflections, and the positive cone).
, and the reflections lying in are exactly the with ; in particular the simple roots , , correspond to the simple reflections of , and a reflection of whose positive root is not any () cannot have length one: by [F2] a length-one element lies in , and [F5] then identifies its positive root with (Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives).
For one has , so , and with (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Group and abelian group).
Proof
The easy inclusion and the conjugation identities. If , then and , so ; hence . Conjugation by is an isomorphism of groups carrying the generating set to , so , and holds by the definition of . Conjugating the coming equality by will give .
The key step: the first letter conjugated lies in . Let and let be a reduced expression with and all by [F2]; put and write for a reduced expression of . Then : indeed , while because , , and because , , both by [F2]. Consequently the word followed by a reduced word of , and the word followed by , are two reduced expressions of the same element of length , where . The element is a left descent of : , so , using the additivity of [F2] and [F9] for . Applying strong exchange [F4] to the reduced expression of and the reflection gives a unique index with equal to that word with its -th letter deleted, and if , while with if . The first case is impossible: then the deleted word exhibits with , hence , while by [F9], contradicting the minimality of in given by [F3]. Hence for some , and substituting gives , a conjugate in of the letter .
The conjugated root is positive. Let and . Then by [F7], and by the dictionary [F5], since . The root lies in : because we have by [F1], and and by [F9], so the root-length criterion [F6] applied to , gives .
Length one forces simplicity. Let and suppose . Repeating the length computation of step 1.2 with replaced by is legitimate because , and : it gives . An element of of length one is a product of one generator, hence lies in by [F2]. Applying this to the first letter of step 1.2, ; indeed there, so and .
The root of a conjugate that lies in . Let and let be the root of from step 1.3, so that . If , then for an element , so ; by [F5] , and since both and lie in while and are disjoint, . Conversely, if with , then .
The intersection. Let with reduced expression , letters in , and write with . If , then and there is nothing to prove, so assume . By step 2.1 the first letter lies in , i.e. ; then satisfies and , and it has length , because by [F9] and . Iterating this argument through the suffixes shows , hence , for every . Thus , which proves (2) and, together with the inclusion of step 1.1, gives , that is (1) and its conjugation identities.
Conclusion of (3). Let . By step 1.3 the element lies in with root ; by step 2.2 one has if and only if for some . If instead , then by step 2.1 (applied to this ) and by [F2], so here too for some : the conjugated positive root is then a simple root of and never a non-simple positive combination such as , because [F8] shows that every reflection with a non-simple positive root has length , whereas . The illustrative sum need not itself be a root; when it is a root for distinct , it is non-simple. This proves (3) for every .
Remarks
- The key step is Lusztig's argument for the intersection of parabolic subgroups: strong exchange at the first letter of a reduced expression of either deletes a letter of the middle representative (impossible by minimality) or exhibits as a conjugate inside of a letter of .
- The warning in (3) is not vacuous: in a parabolic subsystem of type the sum is a positive root whose reflection lies in with length , so "lying in " alone would not make the conjugated root simple; it is the length-one conclusion that forces and hence .
Unique minimal double coset representatives and the additive normal form u-d-v
Statement
Let , let , and put
so that by The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J. Write
for the set of elements of with no right descent in --- the same construction as in Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2), applied inside the Coxeter system with its standard parabolic subgroup .
(1) Unique minimum. Two elements of lie in a common double coset only if they are equal. Hence, by Descent reduction, minimum-length elements, and the additive factorization in a double coset (1),(2), every double coset contains exactly one element of , namely its unique element of minimum length; in particular is uniquely determined by the double coset .
(2) The additive normal form. Every has a unique representation
and every product with , lies in . Thus
is a bijection, and for all and
(3) The size of a double coset. ; and if is finite then , with the quotient a finite integer and the product interpreted as cardinal multiplication.
(4) The restriction to is necessary. For arbitrary the representation is not unique in general: if is the factorization of with and , and , then
and whenever ; so the same has two representations of the form with different first factors unless already. This is why the transversal restriction in (2) is recorded explicitly and may not be dropped.
Facts & Assumptions
Given: a finite Coxeter matrix with presented group and length , subsets , an element , the subset and the transversal of the statement.
Inside the Coxeter system with standard parabolic subgroup : is the set of minimal-length representatives of the left cosets in ; every has a unique factorization with , , and then , while for all ; more generally for , every left coset has a unique minimal element, and for a minimal representative of and , with the mirrored statement for right cosets: for the minimal representative of a right coset one has for all (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
The element of the statement lies in : indeed and (The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J).
Every double coset contains an element of ; for one has for all with equality if and only if ; and every has the form with , and (Descent reduction, minimum-length elements, and the additive factorization in a double coset).
For one has , so for all (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Multiplication in is associative and equalities in may be multiplied and cancelled; in particular conjugation is injective (Group and abelian group).
Proof
Existence of the normal form. Let . By [F3] write with , and ; by [F1] factor with , and . Put by [F2], which satisfies because , and put . Then with , , so every element of the double coset has a representation of the required form.
Uniqueness of the first factor I: the intersection. Suppose with and . Left-multiplying by and right-multiplying by and cancelling gives , which equals by [F2]; hence for some . Since and consists of the minimal representatives of the left cosets in by [F1], ; substituting back gives and hence by cancellation, so the representation has at most one pair of factors and the map of (2) is injective.
Additivity along the representation. Let and write with , as in [F3], and factor , , as in step 1.1. First : indeed , while because and , and because and , both by [F1]. Estimating with subadditivity [F4], , where the last equality is [F3]; hence every inequality is an equality, so for the representation of step 1.1, and also . For any prescribed , , apply this construction to ; uniqueness in step 1.2 identifies the constructed pair with , proving additivity for every such pair.
The size formulas. The map , , is surjective by step 1.1 and injective by step 1.2, hence a bijection, so . If is finite, the factorization of [F1] is a bijection , so and therefore , also when is infinite.
Uniqueness of the minimum. Suppose lie in a common double coset . By [F3] each of is a minimum-length element of , so ; applying the representation of steps 1.1 and 2.1 with and base point gives with , and . Hence , so and . Consequently each double coset contains at most one element of ; by [F3] (or its part (1)) it contains at least one, namely its unique minimum.
The normal form and the necessity of the restriction. By steps 1.1, 1.2 and 2.1 every has a unique representation with , , and then ; conversely every product with and lies in by the definition of the double coset, so the displayed map is a bijection and (2) holds. For (4) let and be arbitrary and factor with , by [F1]; put by [F2]. Then with and , so has two representations with first factors and ; and whenever , because and conjugation by is injective by [F5], so whenever , that is, whenever . This is (4) and completes the proof of (1)-(4); no Axiom of Choice is used.
Remarks
- The theorem is the algebraic heart of the double coset calculus: (1) and (3) say that the double cosets are parameterized by , and (2) upgrades the transversal to a normal form with exact length additivity. The counterexample in (4) is the classical failure of uniqueness once the transversal condition on the first factor is dropped.
- The finite formula of (3) is the parabolic analogue of ; the intersection is written by The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted complete PDF)
- George Lusztig, Hecke Algebras with Unequal Parameters (revised arXiv edition of the CRM monograph, arXiv:math/0208154v2)
- Jean Michel, Lectures on Coxeter groups (lecture notes, Institut de Mathematiques de Jussieu)
- John R. Stembridge, On the fully commutative elements of Coxeter groups (Journal of Algebraic Combinatorics 5 (1996) 353-385; author-hosted PDF)
- Sara Billey, Matjaz Konvalinka, T. Kyle Petersen, William Slofstra and Bridget Tenner, Parabolic double cosets in Coxeter groups (arXiv:1612.00736v2)
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (first-edition author manuscript, 2007-2008)
- Dongwen Qi, A Note on Parabolic Subgroups of a Coxeter Group (arXiv:math/0512408)