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 Length and Orthogonal Moved Spaces
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Canonical Roots, Signs, and Faithful Reflections
- Chains, Antichains, Sperner and Dilworth
- 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
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Fundamental Trigonometric Identities
- 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
- pi: the Equivalent Characterizations
- 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
Reflection length counts arbitrary conjugate reflections rather than simple generators, and in a finite Coxeter group every element is a product of exactly of them, where is the moved space in the positive definite reflection representation. This page develops that equality, the absolute order it grades, and the geometry of moved spaces of orthogonal operators.
Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator fixes the conventions for a Coxeter system of finite type: the reflection length as the least number of elements of the conjugate reflection set whose product is (the minimum exists because and generates ), the absolute order defined by the length identity , the moved and fixed spaces , of an arbitrary linear map on the inner product space , and the orthogonal relation defined by rank additivity. Clause (4) records explicitly that the definition asserts no order property, no rank-length equality and no prefix description; those are proved by the items below.
The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order is the finite-dimensional linear algebra. It proves with , that the Wall form satisfies and is nondegenerate with symmetric part , and it constructs for every subspace the operator on and on , where is the operator with and . Its main theorem is that is an order isomorphism from the subspaces of onto the set , with inverse ; it also proves the rank-length equality and the prefix description of for products of reflections. The restriction is an element of and need not lie in ; the companion plane-rotation example exhibits this inside .
Root normals inside the moved space, factorizations into reflections, and independent normals passes back inside . For it produces a root with and : a generic point of avoids the finitely many intersections , and its chamber stabiliser is a parabolic containing a conjugate simple reflection whose normal is a root. There follows and the rank drop , and induction factors every into exactly elements of , giving . The telescoping identity supplies the reverse inequality and shows that the transported normals are linearly independent whenever . The argument uses the finite chamber tiling of the prerequisite page, and it is choice-free.
Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound assembles the order theory. It proves Carter's formula , that is a partial order of finite rank with the prefix description of and with as rank function, the triangle inequality and the invariance of under inversion and conjugation, the inclusions and for , and the moved-space rigidity: for one has if and only if , so that is an order isomorphism from onto its image. The common upper bound is used through the restriction of to and is indispensable; the companion rotation example shows that the converse implication fails without it.
Earlier pages: finite-reflection-arrangements-and-spherical-coxeter-complexes supplies the finite reflection arrangement, the chamber system , the open faces and the point stabilisers used by the shortening argument, together with the root-reflection dictionary and the positive definite Coxeter form. The companion finite-reflection-length-and-orthogonal-moved-spaces-examples tests the constructions in , and . All four items and the companion computations are choice-free.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
Definition
Let be a Coxeter system of finite type with finite and length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type), with canonical reflection representation on , Coxeter form , 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). Since is finite, is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), so is a real inner product space (Real and complex inner-product spaces and their induced length), and preserves for every (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)). Write for the group of -preserving invertible linear maps (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces).
(1) Reflection length. For put
where the empty product () is the identity. The minimum exists because and generates (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), so the admitted form a nonempty subset of , which has a least element (The well-ordering principle).
(2) Absolute order. For define if and only if
(3) Moved and fixed spaces. For a linear map (Linear map between vector spaces over the same field) define the moved space and the fixed space
(Kernel and image of a linear map). For define the relation if and only if
(4) Conventions and abstentions. For write and . This definition asserts no property of and beyond the displayed formulas: it asserts neither that either relation is a partial order, nor that , nor that means that a shortest reflection factorization of is a prefix of one of . Those properties are proved in Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound ↗, the recorded justifier of this definition, and by the restriction and factorization lemmas of this page. No Choice is used: , , and are finite and every object is finite-dimensional or set-theoretic.
The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
Statement
Let be a finite-dimensional real inner product space (Real and complex inner-product spaces and their induced length); on this page with the positive definite Coxeter form of a Coxeter system of finite type (The real Coxeter form, its radical, reflections, and form-preserving maps, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), and is the group of -preserving invertible linear maps (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces). Let , and be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator. Then:
(1) Basic identities. For every one has , , , , , , and is a bijection (In finite dimension, and , Rank-nullity: ). For all , and hence .
(2) The Wall form. For put
Then is a bilinear form on satisfying
in particular is nondegenerate and its symmetric part is (The adjoint is characterised by , Adjoints satisfy , , , and ).
(3) Subspace restriction. Let , let be a subspace and let be the orthogonal projection (The orthogonal projection is the -component in , For a subspace of a finite-dimensional inner product space, ). There is a unique with for all , and it satisfies , so that is invertible. Define by for and on . Then and
An element is a reflection (that is, ) if and only if for the line ; in particular every line is the moved space of exactly one reflection of (For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent).
(4) The restriction theorem. For every subspace one has , that is ; and for one has , hence . Conversely every with satisfies , and . Consequently the assignment is a bijection from the set of subspaces of onto , with inverse , and it is an order isomorphism for inclusion of subspaces and .
(5) Rank-length equality and prefixes. Let and let be reflections with . Then , and is a product of exactly reflections. Moreover if and only if there are a shortest factorization (so ) and an index with .
Facts & Assumptions
Given: A finite-dimensional real inner product space with the positive definite Coxeter form of a finite-type Coxeter system, an element , and the moved space , the fixed space and the relation of Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.
For a linear map with finite-dimensional, ; in particular an injective endomorphism of a finite-dimensional vector space is bijective. Rank-nullity:
For a subspace of a finite-dimensional inner product space, , and . For a subspace of a finite-dimensional inner product space, In finite dimension, and
The orthogonal projection sends with , to ; equivalently is the unique vector of with , and for every . The projection is linear: combining the unique decompositions of and gives . The orthogonal projection is the -component in
means that is invertible and for all ; equivalently for all . Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces For an endomorphism in finite dimension, preserving lengths, preserving inner products, carrying orthonormal bases to orthonormal bases, and are equivalent
is symmetric and bilinear, and positive definite: with only for ; consequently is nondegenerate, so for all implies , and the same holds for the restriction of to any subspace. Real and complex inner-product spaces and their induced length Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
, and holds if and only if ; no order property of is asserted by the definition. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
Proof
For one has for all by [F4], so holds exactly when and hence exactly when , that is, when ; thus . Since holds exactly when , one has , and shows . Consequently , and [F2] gives , and . Moreover , so ; and with equality because is injective.
For the identity gives ; the invertible restricts to an injective map , whose image therefore has dimension by [F1]; consequently .
By step 1.1 the direct sum gives , so the restriction , whose image lies in the -stable space , has trivial kernel and is therefore injective; by [F1] it is bijective, and is defined.
Let with , put and let be the orthogonal projection onto [F3]. By step 1.1 the line and the space are -stable, so fixes pointwise; for one has with , and since preserves by [F4] and by [F5], forces , while would put ; hence and . Conversely if is a line then acts as on and as the identity on , so it preserves and is invertible, and has dimension one; if is a reflection with , the first part applied to gives . Hence every line is the moved space of exactly one reflection of , namely .
Applying step 2.1 to the orthogonal element , whose moved space is by step 1.1, gives the bijection . For put and , so that and ; then , using [F4] and symmetry of . Moreover on the -stable space , so the inverse there is and .
The Wall form is bilinear on , and for the transpose identity of step 3.1 gives , so . If for all , then vanishes on and, since , also on , hence on ; by [F5] , and is injective, so : the form is nondegenerate, and its symmetric part is on .
Let and define . For , [F3] gives ; if another operator has these pairings, its difference from pairs to zero with every , so it equals by [F5]. Define , with from step 3.1. That step and [F3] give , so is the adjoint of The adjoint is characterised by . Since , compression to gives . If , then by step 4.1, hence ; thus is injective and invertible by [F1], including when .
Define by for and on ; this is well defined and linear because [F2]. Then has image , so and . Put and ; inverting the transpose relation of step 5.1 shows that is the transpose of , that is, for all . Multiplying on the left by and on the right by , and also on the left by and on the right by , gives , hence . Therefore for all , the transpose of being ; on the operator is the identity, and , so preserves on . If , then for every , so by [F5] and is injective, hence invertible by [F1]: thus .
Fix and let be as in step 6.1. In the direct sum of step 1.1 write ; then , so exactly when . With this equation reads , and it is consistent because is step 5.1: the solutions are exactly the with and arbitrary. Hence has dimension , so . Since , the space is the image of under and has the same dimension ; therefore , that is, by [F6].
Let and put , so that by [F6]. Since , one has , and comparing dimensions gives ; in particular . Fix and write with and ; then with and , so comparing the two direct summands gives and . Hence , where the first equality uses step 1.1 applied to ; therefore for all one has , because . Thus the operator defined by on in step 5.1 is , and the construction of step 6.1 for and gives on and on , while on and on by step 1.1, so .
Let and apply step 6.1 to , whose moved space is . Since , the Wall form of on is ; for this equals by step 5.1, because and . Hence the operator attached to and by step 5.1 is again , and the construction of step 6.1 gives ; applying step 7.1 with in place of and the subspace then gives .
Let be reflections and ; since by step 2.2, the subadditivity of step 1.2 gives . Conversely every is a product of exactly reflections: if then is the empty product, and otherwise one picks a line and applies step 7.1 to , obtaining , so by induction on the element is a product of reflections and is a product of of them.
The assignment from subspaces of to is injective, because forces by step 6.1, and surjective by step 7.2; with inverse it is a bijection. It is an order isomorphism: if then by step 8.1, and conversely gives by the inclusion clause of step 7.2.
Suppose with and ; the are involutions by step 2.2, so , whence and by step 8.2, while by step 1.2; both inequalities are therefore equalities and by [F6].
Conversely, if , write with and with , both by the factorization clause of step 8.2; then is a product of reflections by [F6], that is, a shortest factorization of by step 8.2, of which is the prefix of length .
Root normals inside the moved space, factorizations into reflections, and independent normals
Statement
Let be a Coxeter system of finite type with finite, with , positive definite Coxeter form , canonical reflection representation , 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, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), with the chamber system , the open faces and the root hyperplanes of the transferred dual action (The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset), and let , , and be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator; for write and . Then:
(1) Root normals in the moved space. Let with . Then and there is a root with . For every such root one has , and the reflection with (The inversion formula , the root-reflection dictionary and strong exchange (1), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)) satisfies
(2) Factorizations and Carter's formula. Every is a product of reflections , and no product of fewer elements of represents ; equivalently
(3) Independent normals. Let and choose roots with . Then ; and if — in particular if is a shortest reflection factorization of its product — then the vectors
are linearly independent (Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent) and span .
Facts & Assumptions
Given: The finite-type Coxeter datum , , , , , and the elements above; , and are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.
For the open face is , the root hyperplane is , and for ; moreover is the disjoint union of the sets over the left cosets with , and for every . The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere
No finite family of proper subspaces of a finite-dimensional vector space over an infinite field covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
Every root satisfies , and there is a unique with . The inversion formula , the root-reflection dictionary and strong exchange
The representation is injective. The root-length criterion and faithfulness of the canonical reflection representation
For with the map is linear, preserves , fixes every with , and satisfies ; consequently for every , so . Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order Descent of the reflection representation, unit root norms, and conjugation of reflections
On the positive definite space the Wall form lemma holds: (1) for and for ; (3) for every subspace the operator of the lemma satisfies , and every line is the moved space of exactly one reflection of , namely ; (4) and for every . The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
is a group homomorphism, so and (The canonical reflection homomorphism, roots, reflections, and the positive cone). is the least over products of elements of ; , ; and with presented as in Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups. Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
For a subspace of a finite-dimensional space , , with equality exactly when . A finite-dimensional space has a basis, obtained as the extension of any linearly independent subset; a basis is an independent spanning set and its cardinality is the dimension of the space. If and is a linear subspace of , then is finite-dimensional, , and if and only if Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis
If a vector space has a spanning subset of cardinality , then every linearly independent subset has at most elements. If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with
A list of vectors is linearly dependent exactly when some nontrivial linear relation holds, and dependence of lets one of the vectors be solved for as a combination of the others; the span of a set is the set of its finite linear combinations. Linear independence: a finite list is independent when forces every , and a subset is independent when every injective finite list into is independent Linear combination of a finite list, and the span as the smallest linear subspace containing
Proof
Let . First : otherwise , so and , whence by [F4], a contradiction. Next, a root with exists. If then F6 gives , so and for any is a root with . Suppose now that ; let be the finite set of roots with , so that each with is a proper subspace of the finite-dimensional real space ; the finite family consisting of those subspaces and consists of proper subspaces of , since ; by [F2] its union does not cover , so there is with for every , including when ; for every root the implication holds, and is fixed by , so . By [F1] there are and with and ; since lies in this stabiliser, , so for one has by [F1], the equality following from the -invariance of [F5]; the implication above with gives for the root , so in this case a root with the required property exists as well. Finally, if , then for all , so by F6.
Let and let satisfy , as supplied by [F3]. Then for every by [F5], so and ; also because .
For one has by F6.
For , the telescoping identity is : each summand is , by the homomorphism property of . Thus .
Linear-algebra tool. Let be a finite-dimensional vector space spanned by vectors . Then : by [F8] has a basis with , and is linearly independent while is spanned by , so [F9] gives . If moreover , then are linearly independent: otherwise a nontrivial relation expresses some as a combination of the remaining vectors by [F10], those remaining vectors still span by [F10], and [F9] would give , a contradiction.
A product of elements of has moved dimension at most : by step 1.2 each factor has moved dimension , and step 1.3 applied times bounds the moved dimension of the product by the sum .
Let and put and . Steps 1.2 and 1.4 give . Since is spanned by these vectors, step 1.5 gives ; [F8] applied to the subspace of yields .
Carter's formula and factorization: every satisfies , and is a product of exactly elements of . If , then and the empty product represents , giving both assertions. If with , step 2.2 supplies with ; by induction on (applied to , whose moved dimension is ) there are with , so is a product of elements of . For the reverse inequality let with ; then by step 2.1, so no shorter product of elements of represents and by [F7].
Suppose and put as in step 2.3. Step 2.3 gives with , so and by [F8]. Thus the span , and by step 1.5 the vectors are linearly independent and hence form a basis of : this is the independence and spanning assertion of (3). Finally, if is a shortest reflection factorization of its product , then by step 3.1, so the hypothesis holds and the same conclusion applies. This proves (1), (2) and (3).
Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
Statement
Let be a Coxeter system of finite type with finite, with , positive definite Coxeter form , canonical reflection representation , root system , reflection set and length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite), and let , , and be as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator. Then:
(1) Carter's formula. For every ,
(2) The absolute order. is a partial order on (Partial order and partially ordered set), and:
(i) holds if and only if there are reflections and an index such that and are shortest reflection factorizations, that is, and (a shortest reflection factorization of is a prefix of one of );
(ii) , implies , and whenever covers ; hence is a rank function and every interval is finite (Graded poset, rank function, and rank levels);
(iii) , and for all ;
(iv) implies and .
(3) Moved-space rigidity under a common upper bound. Let with and . Then
in particular implies , and is an order isomorphism from onto its image ordered by inclusion. The proof of the converse uses the common upper bound , through the restriction of to the subspace ; the converse is claimed only under this hypothesis (see the companion example of the rotation, where the hypothesis fails).
Facts & Assumptions
Given: The finite-type Coxeter datum and the elements above; , , and are as in Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator.
Every is a product of elements of , no product of fewer elements of represents , and . Root normals inside the moved space, factorizations into reflections, and independent normals
The Wall form lemma holds on the positive definite space : (1) and for ; (4) for one has and , the assignment is a bijection from subspaces of onto , and it is an order isomorphism for inclusion and , with and for ; (5) an element of is a product of exactly reflections, and holds exactly when is a prefix of a shortest factorization of . The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
means , means , and is closed under inversion; for one has and . Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
is a relation on the finite set ; is a partial order exactly when it is reflexive, antisymmetric and transitive, and a rank function on a finite poset is a map with and across covers. Partial order and partially ordered set Graded poset, rank function, and rank levels
The canonical reflection homomorphism, roots, reflections, and the positive cone (1): is a group homomorphism into the group of invertible linear maps, so and .
Proof
For every the factorization lemma gives [F1], and the Wall form lemma gives F2, so ; this is Carter's formula (1).
For one has : shortest factorizations and with , exist by [F1] and concatenate to , a product of elements of . Also , because if then , giving , and applying this to gives equality.
if and only if : by [F1] an element of reflection length is a product of elements of , which is the identity, and conversely the empty product represents ; in particular is the only element of reflection length .
For one has if and only if : by [F3] the two relations read and , and is step 1.1.
Conjugation invariance: for , [F5] gives . Since , taking images and using [F3] yields . The invertible map preserves the dimension of this subspace, so and hence by step 1.1.
The relation is reflexive, antisymmetric and transitive, and the triangle inequality holds. Reflexive: by step 1.3. Antisymmetric: if and , then and , while by step 1.2, so and , that is , by step 1.3. Transitive: if , then , while and by step 1.2; all inequalities are therefore equalities and , that is . Triangle inequality: and by step 1.2, so .
Prefix form: holds if and only if there are reflections and an index such that and are shortest factorizations, that is and . If , then [F1] supplies shortest factorizations and with , and has length , so it is shortest and exhibits the required prefix. Conversely, given such factorizations, , so and hence , while by step 1.2; thus equality holds and .
Part (ii). First by step 1.3. If , then with , so by step 1.3 and . Suppose now that covers , so , and put ; by step 2.4 there are with and shortest, so . If , put ; then is a product of elements of , so and, by the triangle inequality of step 2.3, , while ; hence and step 2.4 applied to the shortest factorizations and gives , and applied to and gives — contradicting that covers . Hence . Every minimal element is : if is minimal and , then because by steps 1.3, a contradiction; and . Consequently is a rank function on the finite poset [F4], and every interval is contained in the finite set .
Let and . If , then by step 3.2. Conversely assume ; by step 2.1 one has and , so F2 gives , , and ; since the restriction assignment of F2 is an order isomorphism and , one has , and step 2.1 gives . Hence if and only if ; in particular yields both and , so by antisymmetry in step 2.3, and the map is an order isomorphism from onto its image ordered by inclusion, being order-preserving and order-reflecting by the equivalence just proved and injective by the equality statement. This proves (1), (2) and (3).
5 · Examples, counterexamples and false statements
None yet.
Sources
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Springer GTM 231 (2005), author/class-hosted complete PDF
- R. W. Carter, Conjugacy classes in the Weyl group, Compositio Mathematica 25 (1972) 1-59 (Numdam full text)
- T. Brady and C. Watt, Lattices in finite real reflection groups (arXiv:math/0501502)