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.
Canonical Roots, Signs, and Faithful Reflections
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- 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ₙ
- 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
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- 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
- Order, Zorn's Lemma, and the Axiom of Choice
- 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
- Roots, Rational Powers, and Classical Inequalities
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- 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 ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
The canonical reflection representation of a Coxeter group presented by an abstract Coxeter matrix is not an extra hypothesis: this page proves, with no definiteness condition on the form, that extends to a homomorphism whose kernel is trivial and whose chamber geometry mirrors the length function. The rank-two half-space alternative and the chamber-length induction , first reduces to a rank-two plane, where the two standard dihedral pictures (finite and infinite) are read off from the explicit dual action, and then runs the simultaneous induction , of Davis 4.8.3 with both implication steps: every chamber lies wholly on one side of every simple wall, the negative side forcing the corresponding left descent, and every admits a rank-two prefix with and . Only the open chamber and open half-spaces are used; equality on closed walls is never asserted.
From that induction, Root sign coherence and the action of simple reflections on positive roots completes the sign theory: every root lies in or in and not in both, with no crystallographic integrality or assumed root-system axiom substituted for the real proof, and permutes while sending to . The root-length criterion and faithfulness of the canonical reflection representation then converts signs into lengths, , deduces that the chambers are pairwise disjoint, and concludes that — and the dual action — is injective for every Coxeter matrix in finite rank, indefinite or degenerate included.
The geometric inversion set of an element of a Coxeter group defines the geometric inversion set with an explicit left/right convention (suffix roots for , prefix roots for ) and records its step recursion, asserting no finiteness in the definition itself; finiteness and independence are supplied by The inversion formula , the root-reflection dictionary and strong exchange, which proves and the two root lists, identifies with the conjugate reflection through faithfulness, and proves strong exchange: for with , one letter of any reduced expression of is deleted, and is the corresponding prefix reflection.
Earlier pages: real-forms-and-reflection-geometry supplies the Coxeter form, the reflections , the canonical homomorphism, the dual chambers and the rank-two chamber tiling, and coxeter-presentations-exchange-and-reduced-word-theorems supplies the presented group with its length function, the dihedral root recurrences, exchange and deletion, the signed action and the parabolic minimal-representative theorem. The companion canonical-roots-signs-and-faithful-reflections-examples computes the roots, inversion sets and chamber images in , and infinite dihedral type. Every argument on this page is choice-free.
3 · Logical flowchart
4 · Definitions, theorems and proofs
The rank-two half-space alternative and the chamber-length induction ,
Statement
Let be a finite set, a Coxeter matrix on , the group presented by with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), , the Coxeter form, the canonical reflection homomorphism with root system (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let be the algebraic dual with its dual action, its chamber , its interior and its root hyperplanes (The dual action, chambers, faces, and root hyperplanes). For put then and the translate is the opposite open half-space. For distinct let be the standard parabolic subgroup, with intrinsic length , which agrees with on (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (2)). For and let be the alternating word of letters beginning with , so .
(1) Rank-two half-space alternative. Let and . For each exactly one of holds, and if the second holds then . Moreover, if then the elements exhaust , with , and the unique element of having both and as left descents is ; if then for every , the elements are pairwise distinct, and no element of has both and as left descents.
(2) The simultaneous induction. For let Then and hold for every . Explicitly: and are immediate; (1) together with yields ; and (1) together with and for all yields .
(3) Canonical factorisation. Let and . Write with and the minimal representative of the right coset . Then and for (Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (3)), and
(4) Chamber-descent equivalence. For every and one has or ; moreover
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with length function , the space with its canonical basis , the Coxeter form , the canonical reflection homomorphism with root system , the dual action on with chamber , interior and root hyperplanes , and for the standard parabolic subgroup with intrinsic length and alternating words of letters beginning with .
For put , equal to when and to when ; then , , and with , the reflections preserve , fix pointwise, and satisfy , (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
The assignment induces the group homomorphism , the root system is , every root satisfies , and for all , (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).
The formula defines a left action of on by linear maps, is nonempty, and . For , in the coordinates of with dual basis , the dual generators act by for and for , each fixing the line respectively pointwise; when the functional is -invariant (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
Let and . If , then has order and the chambers are exactly the closed sectors cut out in by the root lines ; they have pairwise disjoint interiors, their union is , acts simply transitively on them, and distinct chambers are separated by a root line. If , the chambers have pairwise disjoint interiors with union (so every chamber meets the boundary line only in ), distinct chambers are separated by a root line, and the traces of the root lines on the affine line are exactly the integers in the coordinate (The dual action, the faces, and the rank-two chamber tiling).
There is a homomorphism with and for all ; hence for all and . Also for every , so in . Distinct generators are distinct in , the product has order exactly in , the standard parabolic subgroup is the Coxeter system presented by the restricted matrix on with intrinsic length equal to on , and every right coset has a unique minimal-length representative , characterized by for and satisfying for all (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness, Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
For and , if and , or if , then the alternating word of length beginning with has length in (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness); the same holds for the alternating word beginning with .
Induction principle on the natural numbers: if a property holds for and its validity at all implies it at , then it holds for every (The principle of mathematical induction).
Proof
Set-up. For the rank-two calculation fix in and adopt the notation of [F1] and [F3]. For the sets and are disjoint and ; the dual action satisfies , and the action of on is linear. By [F5] the intrinsic length satisfies for .
Reduction to the rank-two plane. Put and let , . Then is linear and surjective, because a functional prescribed on extends to a functional on by on the remaining basis vectors. Every preserves and fixes pointwise by [F1], so for and one has with ; hence and , , for . Consequently if and only if , and if and only if .
Sectors avoid the walls. By [F4] the interiors of the chambers are convex open cones that are connected components of the complement of the union of the root lines in (respectively in when ), so each is disjoint from every root line , and , are root lines because . An open convex set disjoint from a line lies in exactly one of the two open half-planes bounded by it. Hence for every and exactly one of and holds.
The finite dihedral group. Assume and write . Since by [F5], the set is closed under right multiplication by and : indeed and for ; for ; because ; and for , . Since is generated by and contains , it equals . The are pairwise distinct: if with , then ; for of equal parity this equals with , contradicting the exact order of from [F5], while for parities differing it equals or with , so it would give , impossible because while . Hence , the are distinct, , and the pairs and are edges of the Cayley graph of for the generating set . That graph is connected, and every vertex has degree exactly because and for all (as and by [F5]); it therefore is the displayed -cycle, so is the graph distance from . Moreover and with and for : these are , applied to and , together with the case .
The infinite dihedral group. Assume , write , and let be the alternating word of length beginning with . By [F5], has infinite order, and by [F6] for all . The union is closed under right multiplication by and (, , for , , , symmetrically for ), so ; by [F6] the elements are pairwise distinct with for every , and likewise the . The Cayley graph of for is connected, and every vertex has degree exactly (as in 1.4), so it is the two-way infinite path , and the graph distance from to , or to , equals of that element, namely . On the affine line , parametrized by , the generators act by and by [F3] (here ); consequently the affine map of is for and for , and that of is for and for , by induction on (each step composes with or alternately). Hence the trace of is the interval and that of is . Since these intervals are pairwise distinct, an element of is determined by the trace of its chamber. Writing for the element with trace , namely for and for , one therefore has together with and , because the affine maps send the interval to , respectively .
Signs in the infinite case. In the situation of 1.5 the sign of on is the sign of on the interval , hence negative exactly when , and the sign of is negative exactly when .
(P_0) and (Q_0). For one has , for every by 1.1, and choosing gives and for all .
Signs of the finite sectors. In the finite case let ; by [F4] these are the interiors of all sectors. Consecutive differ by right multiplication by a generator , so and share the image under of the wall of fixed by and lie on its opposite sides, by [F3]. They are adjacent sectors. The distinct vertices of the Cayley cycle in 1.4 therefore list the sectors in cyclic order. The sign of is constant on each (no meets the line by 1.3), is on , and is on because negates by [F3]. It changes exactly at those transitions whose common boundary ray lies on the line : that line contains exactly two boundary rays of the arrangement, hence exactly two transitions; and the involution maps each sector to the sector on the opposite side of and fixes no sector, because swaps the two half-planes and no sector meets the wall. Hence exactly sectors lie on each side, and the negative side is the contiguous block of sectors containing but not , that is . Applying the same argument to , which is and negates , gives .
Descents in the infinite case. In the situation of 1.5, let be the element with trace ; by 1.5, and , so exactly when , which by 1.6 is exactly the side ; and , so exactly when , exactly the side . In particular no element has both left descents, and for all with the pairwise distinct.
The dichotomy in the original space. Combining 1.2 with 1.3: for every and exactly one of and holds, according to the side of carrying .
Descents in the finite case. Let and . By 1.4, equals the distance from to , namely when and when , and equals when ; comparing with gives exactly for . Likewise exactly for , and for . Hence, by 2.1, the left descent for occurs exactly on the side and the left descent for exactly on the side , and is the unique element with both descents.
Part (1). Let and . The dichotomy is 2.3, and its two alternatives correspond to the signs of on . If then for a unique by 1.4 and ; the negative side alternative holds exactly for when and for when by 2.1, and exactly there shortens by 3.1; the elements exhaust , and the unique double-descent element is . If then every has a trace and with the pairwise distinct by 2.2; the negative side alternative for holds exactly for (respectively ), and exactly there shortens by 2.2, and no element has both descents. This proves all clauses of (1) in both cases.
The conditional step for . Fix and suppose only . If is empty there is no to check. If then by and [F5], and the only positive-length chamber is , with , proving directly. Now suppose . First and (1) imply : for any of length and generator , choose and use to write , with and . The rank-two dichotomy gives the positive alternative or the negative alternative with ; in the latter case , hence equality by [F5]. This is . Let with and let ; choose with and . If , then applied to gives : the second alternative would give , whereas here. Hence and , the second alternative of . If , apply to : there is with and . Put . If , then . Otherwise and by (1) from 4.1, so with one has and , where follows by prepending to a shortest word for . The reverse bound follows from [F5], so , the second alternative of .
The conditional step for . Suppose and for all , as in the second conditional implication of (2), and let with and . By [F5] factor with and the minimal representative of ; then and for . Since , is available: it is part of the stated supposition. Applying it to and , the second alternative would give , contradicting ; hence . Therefore and , which is .
The induction. and hold by 1.7, and 5.1 and 6.1 show that the validity of and for all implies and , for every . By the induction principle [F7], and hold for every .
Part (3). Let and , and factor with and the minimal representative of . By [F5], and for ; since , from 7.1 applies to , and the second alternative would give , a contradiction; hence and , with because and .
Forward direction of (4). Let and . By from 7.1, , or and ; in particular implies .
Converse direction of (4) and conclusion. Suppose and put , so that and . By from 7.1 applied to , either , or and ; the second alternative would give , which is impossible, so . Applying the linear bijection of [F3] gives . Together with 8.2 this is the equivalence (4); and (1) is 4.1, (2) is 7.1 and (3) is 8.1, so all four clauses of the statement hold.
Root sign coherence and the action of simple reflections on positive roots
Statement
Let be a finite set, a Coxeter matrix, the presented group (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form , the reflections (The real Coxeter form, its radical, reflections, and form-preserving maps), the canonical reflection homomorphism , the root system , the reflections , and the positive cone (The canonical reflection homomorphism, roots, reflections, and the positive cone); every root satisfies (Descent of the reflection representation, unit root norms, and conjugation of reflections (3)). Let be the chamber and its interior of the dual action and put (The dual action, chambers, faces, and root hyperplanes).
(1) Sign criterion for the cone. For : if and only if for every .
(2) Roots have a sign. Every root lies in or in , and not in both. Hence, with one has , , for every , and for every and In particular for all when , and for all when .
(3) Simple reflections act on positive roots. For every , equivalently .
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with its universal property, the space with its canonical basis , the Coxeter form , the canonical reflection homomorphism with root system and reflection set , the positive cone and the negative cone , and the dual action on with chamber , interior and root hyperplanes .
For every and , exactly one of and holds, and in the second case ; equivalently, if and only if (The rank-two half-space alternative and the chamber-length induction , ).
The reflections are defined for by ; one has and , and the assignment induces the homomorphism (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
The root system is , every root satisfies , the set is invariant under every , and for all , (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).
The dual action is given by ; the closed chamber is , its interior is and is nonempty, and are disjoint open half-spaces, and the dual basis functionals satisfy and for every (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
On the finite-dimensional real vector space with basis : every has unique coordinates with , evaluation is linear in for fixed , and sums and nonnegative multiples of elements of lie in (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis, Linear combination of a finite list, and the span as the smallest linear subspace containing , Linear functionals and the algebraic dual ).
Proof
Set-up. Every satisfies for all , so that and for all ; moreover . Every root is of the form with , hence nonzero, and is again a root, so .
The sign criterion, forward direction. Let , so all and some . For linearity gives , since all summands are nonnegative and the summand at is positive.
The sign criterion, converse direction. Let . If then for every , so assume ; then some coordinate is negative. Let with so small that . Then for every , so , and . Hence some element of evaluates negatively, and the criterion of (1) holds in both directions.
The equivalence of the two criteria. By 1.2 and 1.3, for every : if and only if for every .
Roots have a sign. Fix and . For one has ; by [F1] applied to the element either or . In the first case for every , so by 2.1 and hence in ; in the second case for every , so for every , whence by 2.1 and , so it lies in . The two alternatives are exclusive because while by 1.1. Since every root is some and is a root, this gives and ; taking gives and hence . Reading the two cases displayed above as equivalences with 2.1 gives and , and with 2.1 the last sentence of (2) follows.
Simple reflections act on positive roots. Fix . That is [F2]. Let . Since and is -invariant by [F3], , so by 3.1 either or . Suppose , that is , and write by [F2] with . In coordinates: for and . Since all coordinates are nonnegative and not all vanish, and since all its coordinates are nonpositive; for both statements apply to , so for all , that is with . Then , so and , contradicting the choice of . Hence ; moreover , because and is an involution, so would give . Thus , and applying the involution once more gives equality. Finally : indeed maps into by [F3], and by [F2], so this map is a bijection of ; consequently . This is (3), while (1) is 2.1 and (2) is 3.1.
The root-length criterion and faithfulness of the canonical reflection representation
Statement
Let be a finite set, a Coxeter matrix, the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form and canonical reflection homomorphism with root system (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let be the positive and negative roots and the open chamber of the dual action (Root sign coherence and the action of simple reflections on positive roots).
(1) Root-length criterion. For all and ,
(2) Disjoint chambers. If for some , then . Equivalently, the chambers () are pairwise disjoint, that is, is prefundamental for the -action on in the sense that forces for every .
(3) Faithfulness. The homomorphism is injective, the dual action is injective, and for every there is with .
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with length function , the space with Coxeter form , the canonical reflection homomorphism with root system , and the dual action on with open chamber and half-spaces , .
For every and : the chamber satisfies or , and if and only if ; for the rank-two half-space alternative and the induction , hold (The rank-two half-space alternative and the chamber-length induction , ).
For every and : and ; moreover and for every , and (Root sign coherence and the action of simple reflections on positive roots, The dual action, chambers, faces, and root hyperplanes).
For all and one has , and is invariant under inversion: ; every element has a reduced expression with , and then has (Length parity, exchange, two-letter deletion, and faithfulness of the signed reflection action, Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification).
The dual action is a left action of on by linear bijections, with for every (The dual action, chambers, faces, and root hyperplanes, The dual action, the faces, and the rank-two chamber tiling).
Proof
Set-up. Recall from [F2] that and for every , and that the two sign equivalences of the root system hold; from [F4] that every acts on as a bijection with inverse the action of ; and from [F1] that for every and every generator exactly one of , holds.
The two-sided root-length criterion. Fix and . By [F2], if and only if ; by [F1] applied to the element this holds if and only if . Since and is inversion invariant, [F3] gives and , so . Finally by [F3] and by [F2], so this is equivalent to the statement that if and only if ; both claims of (1) follow.
Disjoint chambers. Suppose and . Choose a reduced expression of and let be its first letter, so that with by [F3]. The intersection point lies in , so meets , whence because ; applying the bijection from [F4] and using that its square is the identity gives . By [F1] applied to , therefore and ; but , so , a contradiction. Hence ; and the stated equivalence holds because if and only if by [F4].
Faithfulness. If , then as well, so for all and by [F4]; hence for every and meets , so 1.3 gives . If the dual action of is the identity, then for any one has , which is nonempty, and 1.3 again gives . Finally let and let be the last letter of a reduced expression of , so that by [F3]; by the criterion of 1.2, .
The geometric inversion set of an element of a Coxeter group
Definition
Let be a finite set, a Coxeter matrix, the presented group with length function (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form and canonical reflection homomorphism (The canonical reflection homomorphism, roots, reflections, and the positive cone), and let be the signed root system (Root sign coherence and the action of simple reflections on positive roots).
(1) Definition. For the inversion set of is Its elements are the roots inverted by . This is a subset of , defined before any finiteness or independence assertion; by construction , and is determined by the linear map .
(2) Elementary identities. ; for every and consequently whenever one of the two sets is finite. For every and , with , in the first case and , so the union is disjoint.
The identities are elementary: because would force for , and are disjoint. For the second identity let : then means , and with one has and , so and ; conversely for some gives because , and , so . Since is a bijection, the cardinality statement follows. For the recursion, let ; then , and maps bijectively onto itself while (Root sign coherence and the action of simple reflections on positive roots (3)), so is a bijection of that carries onto . By the root-length criterion (The root-length criterion and faithfulness of the canonical reflection representation (1)) one has and . If this gives , and hence with ; if it gives , and hence .
(3) Convention on reduced words. We keep the left action of on . If is a reduced expression, then the suffix roots are elements of , and the prefix roots are elements of . That these lists are exactly and , that their elements are pairwise distinct positive roots, and that in particular , is proved in The inversion formula , the root-reflection dictionary and strong exchange ↗; no finiteness or independence beyond the identities of (2) is asserted here.
For the two membership statements put and . Since by reducedness of the expression, the root-length criterion gives and also, applied to the reversed reduced expression of , gives . Moreover , so , which shows ; and , so , which shows .
The inversion formula , the root-reflection dictionary and strong exchange
Statement
Let be a finite set, a Coxeter matrix, the presented group with length (Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups), with Coxeter form , canonical reflection homomorphism , root system and reflection set (The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots); every root has -norm one.
(1) The root-reflection dictionary. For choose , with and put . Then: (i) is independent of the chosen representation of ; (ii) , the reflection with normal ; and for all , ; (iii) , and for one has if and only if ; (iv) the induced map is a bijection; so is the map , .
(2) Inversion formula. For every one has (with as in The geometric inversion set of an element of a Coxeter group); and for every reduced expression , the displayed elements being pairwise distinct positive roots.
(3) Strong exchange. Let and satisfy , and let be a reduced expression. Then there is a unique with moreover, if is the positive root with , then and .
Facts & Assumptions
Given: a finite set , a Coxeter matrix , the presented group with length , the space with Coxeter form , the canonical reflection homomorphism with root system , the reflections , and the reflection set .
For all and one has , and every root satisfies (Descent of the reflection representation, unit root norms, and conjugation of reflections).
The canonical reflection homomorphism is injective (The root-length criterion and faithfulness of the canonical reflection representation).
For with the reflection satisfies , fixes every with pointwise, preserves , and has dimension ; since one has , so and the -eigenspace of is exactly (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).
The reflection set carries the right action of on , and for a well-defined sign depending only on and ; for a reduced word with prefix reflections one has , the map is injective, and is independent of the reduced expression and has cardinality (The rank-two block computation, exact dihedral orders, the signed reflection action, and ambient reducedness).
The inversion set is ; it satisfies , , and the step recursion: for , with one has with and , while for one has (The geometric inversion set of an element of a Coxeter group).
is a group homomorphism with and ; ; and with and (Monoid homomorphism and group homomorphism, Root sign coherence and the action of simple reflections on positive roots).
Root-length criterion: for all and one has if and only if (The root-length criterion and faithfulness of the canonical reflection representation).
Induction principle on the natural numbers (The principle of mathematical induction).
Proof
Set-up. Fix a reduced expression of an element , write and for the prefix reflections, and note by [F6] and .
The inversion formula (2). We prove by induction on the assertion: for every with and every reduced expression one has with pairwise distinct elements, and . For this is by [F5]. For the step let with , so and ; the first case of the step recursion of [F5] gives , the union being disjoint with . By induction with pairwise distinct elements; since for by [F6], one has , and the term with the empty product contributes . Hence with pairwise distinct elements, and . Applying the same formula to the reversed reduced expression and using gives , again with pairwise distinct elements. The induction principle [F8] gives (2) for every element.
The dictionary (i) and (ii). Let , written as . Then by [F1], and injectivity of from [F2] gives ; so is independent of the representation, which is (i). For (ii), ; and writing one has , so .
The shorteners are exactly the prefix reflections. Keep the reduced expression of 1.1 and let . If is a prefix reflection of the word, then , so ; and by [F4] the set equals and its members are pairwise distinct. Conversely let with and suppose . The formula of [F4] implies the cocycle identity for all , : indeed , and comparing first coordinates of the displayed formula gives the identity. With , , this gives ; also , since the action of is the identity. We claim . Write with , , so that ; applying the action formula of [F4] successively along the word to gives , then by the definition of in [F4], and then . Comparing with from [F4] yields . Applying the cocycle identity with , , gives , that is ; hence under the supposition . Therefore , so ; by [F4] applied to the shorter element , the element is one of the prefix reflections of a reduced expression of , and the first paragraph of this step applied to that element gives , that is , contradicting . Hence and . Thus .
The dictionary (iii) and (iv). Let . Since by [F6], the root has the representation , so . If , then by 1.3 (ii); by [F3] and of [F1] the -eigenspace of is , and that of is , so and with ; then , so . Conversely by the first part. Hence if and only if , which is (iii). For (iv), the map on classes is well defined by (i) and (iii) and injective by (iii); it is surjective because every element of is of the form by 1.1. Hence it is a bijection. Since with by [F6], every class contains exactly one positive root; composing with the class bijection gives a bijection , .
Strong exchange (3). Let be a reduced expression and with . By 1.4 the shorteners of are exactly the prefix reflections , which are pairwise distinct; hence for a unique , and by the computation in 1.4. For the root clause let satisfy . By 1.1, ; since , the criterion [F7] gives . Both and are positive roots with the same -image , so (iii) from 2.1 gives . Finally, the prefix formula of (2) from 1.2 shows that this root lies in . This proves (3), while (1) is 1.3 with 2.1 and (2) is 1.2.
5 · Examples, counterexamples and false statements
None yet.