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.
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.
Depends on
- Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups
- 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 real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Root sign coherence and the action of simple reflections on positive roots
- 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
- Linear combination of a finite list, and the span $\operatorname{span}(S)$ as the smallest linear subspace containing $S$
- $\operatorname{span}(S)$ is exactly the set of linear combinations of finite lists of elements of $S$, and $\operatorname{span}(\varnothing) = \{0_V\}$
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Group and abelian group
Used by
- Left and right coset minima and a double coset decomposition in S4 Example
- Parabolic double cosets of the infinite dihedral group Example
- A transported simple root lies in the positive span of the simple root and the inversion roots Lemma
- An element with full left descent makes the Coxeter group finite and is the longest element Lemma
- Coxeter words are commutation-connected; the Euler and skew forms depend only on the Coxeter element Lemma
- Equality, inclusion and intersection of spherical cosets, and the quotient poset Lemma
- Finite Coxeter orbit polytopes, face isometries and their cocycle Lemma
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- Plane subsystems, their canonical generators, and the angular order of their roots Lemma
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment Lemma
- The parabolic intersection W_I cap dW_Jd inverse for d in ^IW^J Lemma
- The recursive projection is well defined, sortable-valued, below w, idempotent, descent-detecting and parabolic Lemma
- The weak parabolic projection, its adjoints, and the cover-join lemmas Lemma
- The minimal-coset projection onto W^I is order-preserving, and Bruhat order on the parabolic quotient W^I Theorem
Cited to discharge well-definedness by Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups.
Dependency tree · two levels
77 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
- Anders Bjorner and Francesco Brenti, Combinatorics of Coxeter Groups (Graduate Texts in Mathematics 231, Springer 2005; author-hosted complete PDF) (standard reference, not scraped)
- Dongwen Qi, A Note on Parabolic Subgroups of a Coxeter Group (arXiv:math/0512408) (standard reference, not scraped)