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.
An element with full left descent makes the Coxeter group finite and is the longest element
Statement
Let be a finite Coxeter matrix, the presented group with length , with Coxeter form , the canonical reflection homomorphism , the signed root system , the positive cone and the reflection set (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), with inversion sets (The geometric inversion set of an element of a Coxeter group) and descent sets (Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups (2)).
(1) Full left descent forces finiteness. Suppose satisfies , i.e. for every . Then:
(i) and ;
(ii) is finite, , and is finite;
(iii) is the longest element of ; equivalently is the unique element of with ; and as well as for all .
(2) Parabolic form. Let , let be the standard parabolic subgroup, , the parabolic root subsystem of Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2), and put for . If satisfies for every , then is finite, , and is the longest element of the Coxeter system . No Choice is used.
Facts & Assumptions
Given: A finite Coxeter matrix with presented group , length , canonical reflection homomorphism on with basis , signed root system , positive cone , reflection set , inversion sets and descent sets as in the cited items; , and as specified in each clause.
The real Coxeter form, its radical, reflections, and form-preserving maps: has the basis , and each is the finite sum .
The canonical reflection homomorphism, roots, reflections, and the positive cone: is a homomorphism with ; is the root system, so for every ; ; and .
Root sign coherence and the action of simple reflections on positive roots (2): with , and ; every positive root is a nonnegative combination of the , and for every .
The inversion formula , the root-reflection dictionary and strong exchange (1)(iv): the map , , is a bijection; (2): for every .
The root-length criterion and faithfulness of the canonical reflection representation (3): is injective, so embeds in , and for every there is with .
Standard parabolic subgroups, descent-free one- and two-sided representatives, parabolic and reflection subgroups: is the standard parabolic subgroup of type .
Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2): is a Coxeter system whose intrinsic length function agrees with on .
The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(i)-(iv): if is finite, there is a unique with ; , , for every , and .
Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups (Universal property): any assignment of the generators of a Coxeter presentation to elements of a group satisfying the Coxeter relators extends uniquely to a group homomorphism.
Consequences of [F1] and [F2] used throughout: is a linear bijection with , and is a cone, so a nonnegative combination of elements of lies in , because every coordinate of such a combination is nonpositive; a nonzero element of stays nonzero under the linear bijection .
Proof
Assume . Then : for every the hypothesis and [F4] give . Every has the form with all by [F3], so by linearity of the image is a nonnegative combination of elements of , hence lies in , and it is nonzero because is injective and ; thus , giving . Replacing by shows , using and linearity; since permutes by [F2], these two inclusions force .
Under the hypothesis of step 1.1, : by definition , and step 1.1 maps all of into .
Under the hypothesis of step 1.1, is finite and , and is finite. By [F15], , and [F6] gives , so step 2.1 gives ; as with , the root system is finite, the map is a bijection, and embeds into the finite symmetric group , so is finite.
Under the hypothesis of step 1.1, is the longest element of , and and for all . Since is finite by step 3.1, [F11] gives a unique with ; step 2.1 says , so ; the remaining properties are the listed clauses of [F11] (1).
Now let and let satisfy for every ; then is finite, and . For each , [F4] turns the hypothesis into ; since preserves by [F9] and , this image lies in , so for every . Every is a nonnegative combination of the by [F3]; because and the form a basis by [F1], its coordinates outside are zero, so it is a nonnegative combination . Thus the computation of step 1.1, carried out inside the invariant subspace and using that permutes (it sends to with ), yields , that is . The pair is a Coxeter system whose intrinsic length is the restriction of by [F10]. For and , [F2], [F12] and [F13] give ; this lies in and is the simple reflection for the restricted Coxeter form. Since [F9] makes invariant under every with , the restriction is a homomorphism to . It agrees on generators with the canonical reflection representation of ; uniqueness from the presented-group universal property [F14] makes the two representations equal, and their root system is exactly by the definition in the statement. Applying [F6] inside this subsystem gives , using [F10] for intrinsic length and [F15] for inversion invariance. Since , the subsystem root set is finite. Its canonical representation is faithful by [F7] applied to the restricted matrix, so embeds in and is finite. Since is finite, clause (1) of this lemma, whose proof consists of steps 1.1, 2.1, 3.1 and 4.1 and applies to any finite Coxeter system, gives on the subsystem a unique element with ; since has this property, , the longest element of . No Choice was used anywhere in this proof.
Depends on
- Weak order is a partial order with finite graded intervals; covers and the inversion-set criterion
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Root sign coherence and the action of simple reflections on positive roots
- The root-length criterion and faithfulness of the canonical reflection representation
- 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
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- 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
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Used by
Dependency tree · two levels
71 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)
- Nathan Reading and David E. Speyer, Cambrian fans (J. Eur. Math. Soc. 11 (2009) 407-447; arXiv:math/0606201v2) (standard reference, not scraped)