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.
Finite Reflection Arrangements and Spherical Coxeter Complexes
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Partitions of Unity and Paracompactness
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Finite Abelian Groups
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Finite root hyperplanes divide Euclidean space into simplicial chambers. Their spherical sections give the Coxeter complex, with faces indexed by cosets and stabilizers proved rather than assumed.
The page is authored as three draft items, in dependency order. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset identifies with by the positive definite form only here, and defines the finite arrangement of root hyperplanes, its chambers and closed chambers, the closed and open faces and of the fundamental chamber, the spherical chamber complex on the unit sphere , and the coset face poset ordered by reverse inclusion; clause (4) records explicitly that the definition asserts neither the tiling nor the face or triangulation identifications, which are the content of its recorded justifier.
The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere proves them: the Tits-cone criterion gives , the complement of the walls is the disjoint union of the open chambers with closures , the -dual basis describes each face as the cone on , the dihedral angle between adjacent walls is , the assignment is a bijection onto the proper faces with the intersection formula , point stabilizers are , and the abstract coset complex is identified with a triangulation of the sphere by the radial normalization of an explicit simplexwise affine map. The empty case is separated first.
The longest element as the opposition of the chamber, and longest elements of finite parabolics proves for a general finite Coxeter system the unique with , equivalently , its length , the length-complement identities, and the permutation of ; and for every finite standard parabolic the analogous longest element with .
Prerequisites and reading
Required earlier pages: finite-coxeter-diagrams-and-complete-classification, finite-lattice-projections-and-coxeter-chain-labels, further-trigonometric-identities-and-inverses. The companion finite-reflection-arrangements-and-spherical-coxeter-complexes-examples tests these constructions and conventions. Exact item dependencies and source reading limits are recorded in research/coxeter-scaffold/inventory.json and research/plan-coxeter-groups-track.md.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
Definition
Let be a Coxeter system of finite type with finite, , and length function ; thus is a finite group (Coxeter diagrams: edges, labels, components and finite type, clause (4), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups). On let be the Coxeter form, let be the reflection with normal (defined when ), and let be the canonical reflection homomorphism with root system and reflection set (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone). Let be the algebraic dual with its dual action, its closed chamber , its interior and its root hyperplanes (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
Since is finite, is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, clause (1), Disconnected diagrams, direct products, and comparison of invariant forms, clause (4)); hence , , is a linear isomorphism with for all and , because is -invariant (Descent of the reflection representation, unit root norms, and conjugation of reflections, Invertible linear maps, linear isomorphisms, and inverse linear maps). Identify with by only now, and transfer , and the along ; with the same letters
Give the metric topology of the inner product (Real and complex inner-product spaces and their induced length, Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement); it is canonical because is determined by , and is an isometry for and its transferred form, so topological notions may be moved across the identification.
(1) The finite reflection arrangement. Put Each satisfies (Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (3)), so is the kernel of the nonzero linear functional and in particular contains ; is finite because is the image of the finite set under ; and is permuted by , since for all , (the form is -invariant). A chamber of is a connected component of , and a closed chamber is the closure of a chamber (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Connected components, quasicomponents, and totally disconnected spaces, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement). For put the closed face and the open face of of type ; for put , and .
(2) The spherical chamber complex. The form is an inner product on ; let and let be the unit sphere, with the subspace topology (The induced length is a norm, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Euclidean spheres and closed balls as subspaces of ); the exponent is notation for the unit sphere of the -dimensional inner-product space , and no dimension theory of spheres is claimed here. The spherical chamber belonging to is , and its spherical faces are the sets .
(3) The coset face poset. For put (The subgroup generated by a subset, the cyclic subgroup , and cyclic groups) and let be a left coset (Left and right cosets and of a subgroup). The coset face poset is the set of cosets of proper standard parabolics, ordered by reverse inclusion as subsets of : if and only if .
(4) Abstentions. This definition asserts neither that the sets are the connected components of nor that they cover it, neither that the cosets index the faces nor that the spherical faces triangulate ; those assertions are proved in The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere ↗, the recorded justifier of this definition. Separately, the -dual family of the basis is provided by The dual family associated to a Hamel basis , defined by , Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis and The dual family of a finite basis is a basis of the dual space, with the same dimension, and no Choice is used: and are finite and all objects here are finite-dimensional or set-theoretic.
The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
Statement
Let be a Coxeter system of finite type with finite, , and let the arrangement , the chamber , its interior , the closed and open faces and , the translated objects , , , the unit sphere and the coset face poset be as in The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset. Let , , , , be as in The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots and Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups; let denote the support of , the set of letters occurring in a reduced expression of (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification, clause (1)); and let be the Tits cone of the dual action with its negative-root sets (The Tits cone, its interior, and the negative-root set of a functional). Then:
(1) The chamber tiling. , and under the identification of the definition ; moreover the connected components of are exactly the sets with closures , so the closed chambers of are exactly the sets ; the map is a bijection from onto the set of chambers, distinct closed chambers have disjoint interiors, and every -orbit in meets in exactly one point.
(2) Simplicial chambers and their vertices. Let be the -dual basis of , i.e. (The dual family associated to a Hamel basis , defined by , The dual family of a finite basis is a basis of the dual space, with the same dimension). Then for every ; the closed chamber is the simplicial cone with extreme rays ; the vertices of the spherical simplex are exactly the points , in the precise sense that for every ; and the dihedral angle between the walls and is in the following exact sense: the tangent sector of along the codimension-two face projects under the orthogonal projection onto a sector in the two-plane bounded by its two lines and , and that sector has angle . More generally each is a simplicial cone with the linearly independent generators . The walls of the chamber are the root hyperplanes .
(3) The face identification and the stabilisers. The assignment is a well-defined bijection from the coset face poset onto the set of proper faces (the remaining sets are all equal to , the common face of all chambers), and for all and so the relative interiors of the faces partition ; moreover , the disjoint union running over the cosets with . For every one has , and the setwise stabiliser of the face is the same subgroup .
(4) The spherical triangulation. Assume . Then , the union running over the cosets with , and is the set of nonempty faces of a finite spherical simplicial complex (adjoin the empty face): each member is the spherical simplex whose vertices are the points in the same sense, the relative interiors are pairwise disjoint and cover , and the intersection of two members is a common face, possibly empty, by (3); its face poset is isomorphic to the coset face poset by . Consequently the abstract simplicial complex with vertices the cosets and simplices the empty set and the sets is a triangulation of : the radial normalization of the simplexwise affine map into that sends the barycentric coordinate at the vertex to the direction of is a continuous bijection, is compact because is finite (A finite simplicial complex has a compact Hausdorff realization) and is Hausdorff, so is a homeomorphism (The geometric realization of an abstract simplicial complex, A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological). In particular has exactly maximal simplices, indexed by the chambers. For the group is trivial, , and is triangulated by the complex with no vertices and sole simplex , whose realization is empty.
Facts & Assumptions
Given: A Coxeter system of finite type with finite, , the space with the Coxeter form , the canonical reflection homomorphism with root system , the dual action with chamber , faces , and Tits cone , and the identification of The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset.
Finite type: is finite, is the image of the finite set and hence finite, is positive definite, is a linear isomorphism , and every preserves (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, clauses (1)-(2), Disconnected diagrams, direct products, and comparison of invariant forms, clause (4), Descent of the reflection representation, unit root norms, and conjugation of reflections, Coxeter diagrams: edges, labels, components and finite type).
Roots and signs: , , for every , every root satisfies and , and for one has for and for (Root sign coherence and the action of simple reflections on positive roots, clauses (2)-(3), Descent of the reflection representation, unit root norms, and conjugation of reflections, clause (3)).
Chamber system and walls: the chambers are the sets and ; with , and , for all , one has , and the walls of the chamber system are exactly the root hyperplanes , (The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset, The Tits cone, its interior, and the negative-root set of a functional, clauses (1)-(2), Chamber collisions, point stabilizers, and the intersection rule, clause (1)).
Collision and strict fundamental domain: if , and , then and ; every -orbit contained in meets in exactly one point; the open chambers are pairwise disjoint (Chamber collisions, point stabilizers, and the intersection rule, clauses (3) and (6)).
Topology: since is finite, is a linear bijection , and is the metric topology of in which all the assertions about open sets, interiors and connected components of are read (The Tits cone, its interior, and the negative-root set of a functional, clause (3), Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
Finite-negativity criterion: for every , if and only if is finite (The finite-negativity criterion, the reduction step, and convexity of the Tits cone, clause (1)).
Supports and standard parabolics: for every the support (the letters occurring in a reduced expression) is well defined, for , and ; moreover is a Coxeter system whose intrinsic length is the restriction of (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification, clauses (1)-(2)).
The -dual family: there are elements with , and they form a basis of ; for one has (The dual family associated to a Hamel basis , defined by , The dual family of a finite basis is a basis of the dual space, with the same dimension, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).
Simplicial machinery: is the set of barycentric coordinate functions on the abstract simplicial complex with the weak topology of the closed simplices (An abstract simplicial complex, The geometric realization of an abstract simplicial complex); a finite complex has compact Hausdorff realization (A finite simplicial complex has a compact Hausdorff realization); a continuous bijection from a compact space to a Hausdorff space is a homeomorphism (A continuous image of a compact space is compact; a continuous real-valued map on a nonempty compact space attains a maximum and a minimum; and a continuous bijection from a compact space to a Hausdorff space is a homeomorphism, clause (3), Homeomorphism, open map, closed map, embedding, and what it means for a property to be topological); and metric spaces are Hausdorff (Distinct points of a metric space have disjoint balls around them).
Convexity and connectedness: a convex subset of is path-connected and connected (Every convex subset of , in particular every ball and itself, is path-connected and hence connected, clause 1, Metric continuity characterisations, with countable choice for the sequential converse, clause (a)).
Cosets: for and the set is a left coset of the subgroup (Left and right cosets and of a subgroup, The subgroup generated by a subset, the cyclic subgroup , and cyclic groups).
Continuity toolkit in finite dimensions: for a norm on a real vector space, and (The finite and reverse triangle inequalities for a norm; and for every norm on satisfies and is Lipschitz, hence continuous, for , clause 1); and sums, scalar multiples and (where the denominator does not vanish) quotients of continuous real-valued functions are continuous (Sums, products, absolute values, finite maxima and minima, and quotients of continuous real-valued maps on a topological space are continuous where defined, Metric continuity characterisations, with countable choice for the sequential converse, clause (a)).
For , , , and (Signs, monotonicity intervals, and ranges of sine and cosine, Quarter-turn values and shifts by pi/2 and pi, The addition formulas for sine and cosine, Parity and the Pythagorean identity for sine and cosine, Principal inverse sine and inverse cosine). The principal angle of two -unit vectors is here defined as the arccosine of their inner product.
Proof
If then , , , and the coset face poset is empty, so (1)-(3) hold in the vacuous form described in the statement and (4) is exactly its stated convention for ; assume from now on, so that .
By [F1] the root system is finite, so is finite for every ; the criterion [F6] therefore gives , and holds by definition, so and every lies in some chamber .
By [F8] the -dual basis exists, with and for ; hence , and for every , so and for ; and the cone has extreme rays , because with , in forces for and with , hence ; any vector with at least two positive coefficients splits into two nonproportional vectors of , so it spans no extreme ray.
For and one has or , and by [F2]; for every the point lies in and because is stable under , so and .
is open, as a finite intersection of preimages of the open half-line under the coordinate functionals , which are continuous for the topology of [F5]; it is convex, because those functionals are linear; and in the coordinates it is a nonempty convex subset, hence path-connected and connected by [F10]. Each is the image of under the linear isomorphism [F1], whose coordinate matrix and inverse give Lipschitz maps for the metric of [F5], so too is open and connected.
From step 1.3: , and if and only if ; hence if and only if . Moreover is the relative interior of in its affine span, which is , because by step 1.3 the relative interior consists exactly of the combinations with all coefficients positive.
For every each fixes pointwise and fixes each with : by [F7] is a product of elements of , so it suffices to check the generators; for and one has , hence by the reflection formula, while for and one has and , hence .
Every -orbit in meets in exactly one point, by the strict-fundamental-domain clause [F4] together with (step 1.2); and the map is injective: if and (nonempty by step 1.3), then for some , where , and the collision rule [F4] applied to and gives and , so .
Let , put , , and . The order convention in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups and finiteness of give , so . In the -orthonormal coordinates , of , one has , using the Gram entries and [F13]. Orthogonal projection onto preserves the two values and , because its kernel is ; every point of the resulting sector in is its own projection. Write a point of as . The sector is , , bounded by the rays through and . These are unit vectors with inner product , and the nonnegative sector between them has principal angle by [F13]. This proves the stated dihedral-angle formula.
, these sets are exactly the connected components of , and : the inclusion holds by step 1.4; for take , so for some by step 1.2, and for every because [F2], whence and ; the sets are pairwise disjoint by [F4], open and connected by step 2.1 and nonempty by step 1.3, so each is a component, since a connected set meeting two of them would be separated by the partition into and its complement, both of which are open in minus the hyperplanes; finally each is closed, being the intersection of the finitely many closed half-spaces , and every is a limit of points with and , because and ; hence and the closed chambers are exactly the sets .
If with , then satisfies , so for some (because ), giving and , so by [F7]; then fixes pointwise by step 2.3, so , and the assignment is well defined.
For all and the intersection formula holds: if lies in the intersection, then and are points of with , so [F4] gives and ; then and by [F3] and by [F7], so and ; conversely if with , then and hence by [F7], so fixes pointwise by step 2.3, whence and .
The faces with are nonempty by step 1.3, cover and have pairwise disjoint relative interiors, so over the cosets with ; moreover forces and hence : if lies in , then and are points of with , so [F4] gives and by step 1.3, and then with and by step 2.3; for the covering, let and choose with by step 1.2, so that and therefore (else by step 1.3), giving by step 1.3 and .
For one has : if , then the collision rule [F4] applied to the two points gives , and conversely every fixes pointwise by step 2.3; hence for , writing with , one has by step 1.3 and .
For every one has : a point of that intersection equals with by step 1.3, and forces , while each does lie in the intersection; moreover with the vectors linearly independent because is invertible [F1], and the walls of are by [F3].
For all and : (a) if and only if , because the forward implication is step 3.2 and if then the intersection formula (step 3.3) gives , so by step 2.2, whence and by [F7], and symmetrically , so and ; (b) is equivalent to and : containment gives and, after multiplying by , , whence by [F7]; conversely these conditions give containment. By step 3.3, is equivalent to , hence to and by step 2.2, which is the same pair of conditions by [F7] and closure of under inverses; (c) implies by step 3.4, and conversely gives and by (a), hence by step 2.3 and this face is nonempty by step 1.3. Consequently is a bijection from the coset face poset onto the set of proper faces, and by (b) it reverses inclusions, so it is an isomorphism from the coset face poset ordered by reverse inclusion onto the face poset ordered by containment.
Define and for , , and put . The direction is well defined: if , then step 3.2 gives and , so and, by step 3.6 applied to these one-dimensional cones, and are positive multiples of one another, whence because is -invariant [F1] and the unit directions agree. The simplex is well defined: for and one has , hence and . For , the intersection of its vertex cosets is , since [F7] identifies the intersection of these subgroups with the support condition . Thus the vertex set determines the original coset. Finally a subset of keeping precisely the indices is , so is closed under subsets, contains the empty set and every singleton, and is finite.
For the setwise stabiliser of the face is : one has if and only if by step 4.1(a), that is, if and only if ; this subgroup contains from step 3.5.
Define for . This is well defined and takes values in : on a simplex containing the sum is , a combination with nonnegative coefficients, not all zero, of the linearly independent vectors of step 3.6, so the numerator does not vanish; and if lies in two simplices, both contain the minimal simplex , on which the formula is the same. On each closed simplex , which is compact and carries the Euclidean simplex topology of [F9], the barycentric coordinates are continuous, so the numerator is continuous as a map into (finite sums of scalar multiples of the fixed vectors, read in the coordinates of [F5]) and the denominator is a continuous positive real function by [F12], so is continuous by [F12]; every simplex of is a face of one of the finitely many maximal simplices, whose traces are therefore continuous, and carries the weak topology of [F9], so is continuous.
The map is surjective: for step 3.4 gives a coset with , so with all by step 1.3; putting and on the vertices of and elsewhere defines a point of whose numerator is , so that . It is injective: if and is the minimal simplex supporting , so that all for , then the defining identity expresses as the positive multiple of ; since is itself the combination with (step 1.3) and is a basis, the coefficients satisfy , and the coset together with the numbers is determined by (steps 3.4 and 1.3), summing the coefficients to gives , so is determined by .
The realization is compact by [F9] and finiteness of (step 4.2), the sphere is Hausdorff, since distinct points are separated by the intersections with of disjoint metric balls in [F9], and is a continuous bijection by steps 5.2 and 5.3; hence is a homeomorphism by [F9] and is a triangulation of , with the members of , the relative interiors and the face poset as described in steps 3.6, 3.4 and 4.1. The maximal simplices of are exactly the , one for each : indeed holds if and only if (both sides are equivalent to the pair of conditions and , by the argument of step 4.1(b) applied to vertex sets), so a simplex is maximal exactly when , and forces . Thus has exactly maximal simplices, indexed by the chambers , and the case was disposed of in step 1.1.
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).
5 · Examples, counterexamples and false statements
None yet.