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.
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 .
Depends on
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives
- Descent reduction, minimum-length elements, and the additive factorization in a double coset
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The root-length criterion and faithfulness of the canonical reflection representation
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- Group and abelian group
Used by
Dependency tree · two levels
59 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- George Lusztig, Hecke Algebras with Unequal Parameters (revised arXiv edition of the CRM monograph, arXiv:math/0208154v2) (standard reference, not scraped)
- Sara Billey, Matjaz Konvalinka, T. Kyle Petersen, William Slofstra and Bridget Tenner, Parabolic double cosets in Coxeter groups (arXiv:1612.00736v2) (standard reference, not scraped)
- Dongwen Qi, A Note on Parabolic Subgroups of a Coxeter Group (arXiv:math/0512408) (standard reference, not scraped)