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.
A transported simple root lies in the positive span of the simple root and the inversion roots
Statement
Let be a finite set, a Coxeter matrix, the presented group with length , with Coxeter form and canonical reflection representation , root system with the reflection dictionary , and inversion sets (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots, The geometric inversion set of an element of a Coxeter group). For write . Let and with , so that (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)). Fix a reduced expression and let be its prefix reflections, with corresponding positive roots ; then (The inversion formula , the root-reflection dictionary and strong exchange (2)). Then:
(1) with for every ; in particular , which also gives (The root-length criterion and faithfulness of the canonical reflection representation (1)).
(2) Every coefficient of in the simple basis is nonnegative, the coefficient of is , and .
(3) The conclusions of (1) and (2) hold for every with and every reduced expression of ; in particular maps into .
Facts & Assumptions
Given: A finite set , a Coxeter matrix on , the presented group with length function , the space with Coxeter form , the canonical reflection representation , the root system , an element and an element with , and a reduced expression with prefix reflections and prefix roots .
The real Coxeter form, its radical, reflections, and form-preserving maps: is the unique symmetric bilinear form with , for finite and when ; for with the reflection with normal is , so .
The canonical reflection homomorphism, roots, reflections, and the positive cone: is the group homomorphism with for every , and .
Root sign coherence and the action of simple reflections on positive roots: (2) with and ; (3) for every .
The inversion formula , the root-reflection dictionary and strong exchange (2): if is a reduced expression, then , these elements being pairwise distinct positive roots.
Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1): is the support of , independent of the reduced expression, and for a reduced expression .
The root-length criterion and faithfulness of the canonical reflection representation (1): for all , , and .
Proof
We prove the following statement for every : for every with , every and every reduced expression with prefix roots , one has with for all . For the given pair we have by the reducedness of , so clause (1) is the instance , of , clause (3) is the same statement quantified over all pairs with , and clause (2) is obtained from it in the last steps.
Base case : here , the expression is empty, and the homomorphism property in [F2] gives , which is the claimed identity with the empty sum.
Induction hypothesis: assume for all and let be a reduced expression with , so and inherits from , using the support clause in F6.
Applying the hypothesis of step 1.3 to the pair and the reduced expression gives with and the pairwise distinct prefix roots of ; by the prefix-root formula [F5], .
By [F2], ; applying the reflection formula and Coxeter-form entries from [F1] gives with : indeed because and , and every off-diagonal value of is since for gives . Moreover is the first prefix root of .
No prefix root of equals : if , then by step 2.1; the inversion-set definition [F4] gives . The root-length criterion [F7] then gives , which by [F9] is , contradicting the reducedness of .
For we have by steps 2.1 and 3.1, so the simple-reflection action in F3 gives ; and is the -th prefix root of .
The homomorphism property in [F2] gives , so steps 2.1, 2.2 and 4.1 give with all coefficients ; this is .
The base case of step 1.2 and the induction step, using step 1.3 to set up and step 5.1 to prove the inductive case, establish for every . In particular gives, for the given pair and the reduced expression , the expansion with for all .
By the support clause F6, each prefix root has and ; hence the parabolic root identity F8 gives . By the sign split F3, each is a nonnegative combination of the simple roots with and has no -coordinate, since . Therefore every simple coordinate of is by step 6.1, its -coordinate equals , and its support satisfies ; this proves clause (2).
By the parabolic-support clause F6, the elements with are exactly . For any such , supplies the expansion of (1), step 7.1 gives the support statement of (2) with replaced by , and step 8.1 gives ; hence maps into .
Depends on
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Root sign coherence and the action of simple reflections on positive roots
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives
- The root-length criterion and faithfulness of the canonical reflection representation
Used by
Dependency tree · two levels
49 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
- N. Reading and D. E. Speyer, Sortable elements in infinite Coxeter groups, arXiv:0803.2722v3 (2010); Trans. Amer. Math. Soc. 363 (2011) 699-761 (standard reference, not scraped)
- N. Reading, Sortable elements and Cambrian lattices, arXiv:math/0512339v1 (2005); Algebra Universalis 56 (2007) 35-56 (standard reference, not scraped)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005 (standard reference, not scraped)