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 longest element as the opposition of the chamber, and longest elements of finite parabolics
Statement
Let be a Coxeter system with finite, length function , canonical reflection representation on , form , root system and reflections (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, 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 let and be the chamber and its interior in (The dual action, chambers, faces, and root hyperplanes).
(1) The opposition and the longest element of a finite Coxeter system. Suppose is finite. Then:
(i) there is a unique with ; equivalently is the unique element of with (equivalently with );
(ii) , and ;
(iii) and for every ; consequently and is the unique element of that length (the element of longest length);
(iv) ;
(v) , and there is a permutation of with , equivalently , for every .
(2) Longest elements of finite parabolics. Let with finite (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups); this holds automatically for every when is finite. Then has a unique longest element : it is the unique with for every , and it satisfies , , and for every , and . With the parabolic subsystem , and , one has .
Facts & Assumptions
Given: A Coxeter system with finite, the space with Coxeter form , the canonical reflection homomorphism , root system , reflections , length , inversion sets , chamber and its interior in . For part (1), is finite, so the identification of The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset is available; for part (2) only the subsystem is identified with its dual after its finiteness is assumed.
Structure and elementary length facts: is symmetric bilinear with and (or for ), every preserves , the reflection formula is for (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, clauses (1)-(2), Descent of the reflection representation, unit root norms, and conjugation of reflections); the length is the least word length, so if and only if , reversing a word gives , and means (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups); and every root satisfies (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (3)).
Tiling of the finite chamber system: has the sets as its connected components, the map is a bijection from onto the set of chambers and (The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere, clause (1)).
Root signs: , and for every ; moreover for one has if and only if for every , and if and only if for every (Root sign coherence and the action of simple reflections on positive roots, clauses (2)-(3)).
Inversions and the root-reflection dictionary: for every , the map , , is a bijection, and for one has if and only if (The inversion formula , the root-reflection dictionary and strong exchange, clauses (1)-(2)).
Conjugation: for , and one has and (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (4), The inversion formula , the root-reflection dictionary and strong exchange, clause (1)(ii)).
Standard parabolics: for the pair is a Coxeter system, its intrinsic length function agrees on with the restriction of , and (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification, clauses (1)-(2)).
Universal property of the presented group: any assignment of generators satisfying the Coxeter relations extends uniquely to a homomorphism (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
Proof
Since [F3], the arrangement is invariant under the antipodal map (as ), and that map is a homeomorphism permuting the connected components of the complement; hence is a connected component of , and by the tiling [F2] there is a unique with ; taking closures with [F2] gives .
By [F1] the length is the least word length, so if and only if ; reversing a word gives for every ; and means that is represented by a one-letter word, that is, .
For one has exactly when for every , and exactly when for every [F3]; as runs over the points run over , and , so is equivalent to for every , that is, to ; hence , equivalently , which is the equality , and is .
If satisfies , then , so by the injectivity of in [F2]; together with step 1.1 this proves uniqueness of the opposite chamber. If satisfies or , then : in the first case is equality because is finite and the two sign sets have equal cardinality, and negation gives ; in the second case this is the inversion-set definition. For and , [F3] now gives , so . Both sets are connected components by [F2] and step 1.1, so they are equal and by [F2]. Conversely step 2.1 gives both full inversion sets for , proving all equivalences in (i).
By [F4] one has , using step 2.1 and the bijection ; and for every the set equals , because if and only if by step 2.1; hence by [F4]. This proves (ii) and the first identity of (iii).
Taking in step 3.2 gives , so by step 1.2; this is (iv).
By step 3.2, for every , so and has maximal length; if then by steps 3.2 and 1.2, so by step 1.2 and ; hence and is the unique element of that length.
For every the identity of step 3.2 applied to gives , and inversion invariance together with from step 4.1 gives by step 1.2; this is the second identity of (iii).
For , step 5.1 with gives , that is, by step 4.1, so ; then step 3.2 with gives , so by step 1.2. Conjugation by therefore maps into , and since and is finite it maps bijectively onto , that is, .
For let , so that by step 6.1; applying the homomorphism and the conjugation formula [F5] gives , that is, in the dictionary [F4]; since for only when , one has , and the sign is negative because by step 2.1 while [F3]; hence for every , and is a permutation of . This completes (v).
Let with finite. By [F6] the pair is a Coxeter system, its intrinsic length function is the restriction of , and ; moreover is finite. The canonical reflection representation of (on with the restricted Coxeter form ) is the restriction of to : each has for and for , so preserves and acts there by the reflection of with normal , and both maps are homomorphisms on the presented group agreeing on generators, hence equal by the universal property [F7]. Therefore the argument of steps 1.1-7.1, which used only the tiling [F2], the root signs [F3], the inversion dictionary [F4], the conjugation formula [F5] and the length facts [F1] - all available verbatim for the Coxeter system with its intrinsic length - applies to : there is a unique with , it satisfies , it has maximal length in and is the unique element with and for all , and . To verify the asserted uniqueness for the length-complement characterization, if satisfies for every , put and . Then , while maximality gives , so and uniqueness of the maximal-length element gives .
By the instance (ii) of the argument in step 8.1 one has , where is the positive root system of the subsystem; by the intrinsic form of [F3] applied to (whose dual chamber is ) a root is positive exactly when it lies in the subsystem's positive cone , which is ; hence and , as asserted in (2).
Depends on
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- The dual action, chambers, faces, and root hyperplanes
- The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
- The geometric inversion set $N(w)$ of an element of a Coxeter group
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The subgroup $\langle S \rangle$ generated by a subset, the cyclic subgroup $\langle g \rangle$, and cyclic groups
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- The root-length criterion and faithfulness of the canonical reflection representation
- Root sign coherence and the action of simple reflections on positive roots
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Used by
- Ordered roots and the mu-dot-root matrix in I2(5) Example
- The A2 = S3 case: Steinberg inclusion-exclusion, degree product, and reciprocity Example
- The Coxeter complex of A₃: a triangulation of the sphere and the residue of a proper parabolic Example
- The Coxeter complex of I₂(5): the circle triangulated by the ten chambers Example
- An element with full left descent makes the Coxeter group finite and is the longest element Lemma
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id 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
- Finite descent parabolics, parabolic factorization, the Steinberg inclusion-exclusion identity, and rational growth Theorem
- Skip bases, cover roots, greatest-sortable projections, and the chamber union of each cone Theorem
- The Poincare polynomial as a product of q-integers of the basic degrees, with longest-element reciprocity Theorem
- The upper endpoint of a c-Cambrian fiber, interval fibers and the explicit formula u_c(w) = pi_c⁻¹(ww0)w0 Theorem
- Weak order is a meet-semilattice, finite Coxeter groups are lattices, and joins of simple reflections exist exactly for finite parabolics Theorem
Dependency tree · two levels
125 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
- Michael W. Davis, The Geometry and Topology of Coxeter Groups (Princeton University Press 2008, first-edition author manuscript PDF) (standard reference, not scraped)
- Jean Michel, Lectures on Coxeter groups (Beijing lecture notes, April-May 2014, author-hosted PDF) (standard reference, not scraped)