How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma]
Statement
Let be an irreducible Coxeter system of finite type with finite of cardinality , with the data , , , , , , , , , and the linear map of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, and assume the conclusions of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (so that and ). Let , , , be reflection length, absolute order and the moved and fixed spaces, and let for , where is the reflection with normal (The inversion formula , the root-reflection dictionary and strong exchange (1), Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator, Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound). Then:
(1) The basic identities. For every : , , and , i.e. ; moreover is one dimensional and is its unique vector satisfying .
(2) Sign and vanishing identities. (a) for all ; (b) whenever ; (c) for and all ; (d) whenever .
(3) Separation from earlier cones. If , then is not a nonnegative linear combination of .
(4) Canonical simple systems of the subintervals. Fix with , put and write in the global -order. Then:
(i) is the set of positive roots of the reflection subgroup , and it contains a simple system : every root of is a nonnegative linear combination of the 's and are linearly independent; moreover and, recursively, is the last root of lying in ; equivalently is the first root of in , with the product empty for , so in particular .
(ii) is a positive root for each , and
(iii) Let be the spherical simplex, where . Its closed spherical wall opposite is and its supporting hyperplane in is .
(iv) If and in the global order, then , so and commute; the reordering of in the global order satisfies and is lexicographically first among all increasing -tuples in for which and .
(v) If then is a simple system of , the only factorizations of as a product of two reflections in are , and while for ; dually, for distinct positive roots with one has: if then , and if then .
(vi) Whenever is an increasing tuple of roots of for which and , one has for every .
No Choice is used.
Facts & Assumptions
Given: The finite-type irreducible datum with and the bipartite data of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, the enumeration of The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id, and an element .
with the pairwise distinct and , for all , where ; is invertible, , and . Hence . The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (1)-(4) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)
for all , and is -equivariant. For , : each preceding reflection fixes by duality. The pairing and fixed-line assertions of (1) are derived in step 1.1 below. The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (4) The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (3)-(4)
is positive definite, every root has -norm , reflections act by , and . For each positive root there is a unique reflection with ; its moved space is . The real Coxeter form, its radical, reflections, and form-preserving maps (3) Descent of the reflection representation, unit root norms, and conjugation of reflections (2),(3) The inversion formula , the root-reflection dictionary and strong exchange (1) Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2)
Positive roots have nonnegative simple-root coefficients, and for every and . Root sign coherence and the action of simple reflections on positive roots (1),(2)
Carter's formula gives ; iff ; implies ; if , then iff ; and is invariant under conjugation and satisfies the triangle inequality. Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1)-(3)
On the positive-definite space , for orthogonal . For there is a unique orthogonal restriction with moved space , and every line is the moved space of the unique orthogonal reflection . For group elements, orthogonal order and reflection order agree by Carter's formula. The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order (1),(3)-(5) Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound (1),(2)
In a reduced reflection factorization , the prefix-conjugated root normals form a basis of . Root normals inside the moved space, factorizations into reflections, and independent normals (3)
Every nonidentity has a reduced reflection factorization of length ; the factorization lemma also supplies a root normal in for its induction step. Root normals inside the moved space, factorizations into reflections, and independent normals (1)-(3)
The root arrangement is finite. The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset
For every nonzero point , its stabilizer is . In a finite Coxeter system the chambers are translates of the simplicial fundamental chamber, whose inward unit normals are its simple roots. The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1)-(3)
For a canonical rank-two system with finite exponent , the simple-root Gram entry is and the product of its two reflections is a rotation of exact order , through an angle of magnitude . Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)
No finite family of proper linear subspaces of a finite-dimensional real vector space covers the whole space. A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
For a reduced simple-generator expression , every prefix-conjugated normal is a positive root. The inversion formula , the root-reflection dictionary and strong exchange (2)
is the Coxeter system of the restricted matrix, with intrinsic length equal to ambient length; every element of has a reduced expression using only letters of . If and , strong exchange expresses as a prefix-conjugate of one letter of any reduced expression of . Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification (1)-(2) The inversion formula , the root-reflection dictionary and strong exchange (3)
Proof
For every , [F2] gives . Since is an isometry and , follows by expanding . The same identity gives , so and . For , the reflection word cancels to , so its reflection length is at most ; the triangle inequality and give the lower bound . Thus its fixed space is one-dimensional. Since , the same dimension holds for all . The vector is nonzero because , and it is the unique vector in that line with this pairing. This proves (1).
For all , . Indeed, by [F2], so , using the isometry of and [F1]-[F2]. This is (2)(a).
Suppose . If , then and -equivariance gives . Repeating reduces to a first index at most while keeping both indices positive and ordered. For , , and is the coefficient of in the positive root ; this is nonnegative by [F4]. Thus (2)(b) holds.
Every reflection lies below . Indeed, by [F1]. For a positive root , the orthogonal reflection with moved line is uniquely by [F3],[F6]; the Wall restriction for this line is below and has moved space . The Wall dimension identity and Carter's formula therefore give .
We use two elementary consequences of absolute order. First, if is a reduced reflection factorization and , then : distinct root-reflections have product moved space the two-plane spanned by their distinct normal lines, so their product has reflection length by Carter's formula. Write ; then , a product of reflections because conjugation preserves reflections. The triangle inequality forces this complement to have length . Second, if , then : write , with additive reflection lengths; then , while has the same length as , so . These facts will be used below.
Put and . Then is the pointwise stabilizer of , because . If , choose outside and every proper subspace ; this is possible by [F9] and [F12]. By [F10], for some . Each conjugate simple generator has a root hyperplane containing , hence, by the choice of , containing all of ; therefore every generator of this stabilizer fixes pointwise. Conversely every element fixing fixes , so . If , take and .
To prove (2)(c), first reduce modulo using -equivariance, which preserves , and assume . If , then and has no coefficient, so the pairing is zero. If , put , so . By (2)(a), , since is supported on . Now if and , (2)(d) is (2)(c) with ; if , (2)(a) and (2)(b) give . This proves (2)(c)-(d).
For every , one has . If , then by [F5]. Conversely, if , then by step 1.4 and , so moved-space rigidity in [F5] gives . Also spans : choose a reduced reflection factorization of ; its prefix-conjugated normals are a basis of by [F7], and the reflections with those normals have moved lines in , hence lie below by the same common-upper-bound argument. Taking the positive sign of each normal puts a spanning set in .
For any increasing tuple of positive roots, one has if and only if for all . If , the left side is by [F1], and the zero-pairing condition is vacuous; hence assume . Put . The length equality is equivalent to the reverse product being a reduced element below : its complement is . In fact, if , then and , so both inequalities are equalities; the converse is the defining absolute-order equality. For the forward implication, the pair-product fact in step 1.5 gives whenever . Since , this gives from ; hence . The vector is a nonzero member of the one-dimensional fixed space , so . Conversely, suppose all these pairings vanish. The matrix is upper triangular with diagonal by (1), so both the and the are linearly independent; in particular . Induct downward on to prove with length . The base is step 1.4. If , then each factor with satisfies : writing a reduced factorization , the product uses one fewer reflections, and the triangle inequality makes that expression reduced. Put . Complement order reversal from step 1.5 gives , so for every . These independent vectors form a basis of , whose dimension is by Carter's formula. The assumed zero pairings give . The Wall restriction for the line gives ; writing then gives , with lengths adding, so and . At this proves the claimed equivalence. The same argument applies to every subtuple because the vanishing conditions are inherited.
If with and , then (2)(d) gives for every , so , a contradiction. This proves (3).
Let be the intrinsic root system from [F14]; its representation is the restriction to , since the reflection formulas agree. An ambient reflection has a reduced -expression by [F14]. Apply strong exchange to : it expresses as a prefix-conjugate of a letter of that expression, so its root normal belongs to by [F3]. Conversely every intrinsic root gives an ambient reflection in . Conjugating by , the root-reflection dictionary therefore identifies the roots of with precisely the ambient roots whose reflections fix pointwise, namely by step 2.2. Their span is both and , since spans .
Choose and project it orthogonally to . Its pairing with every root of is positive by [F4], so it avoids the subsystem arrangement. Apply [F10] to the finite Coxeter system and transfer its chambers to by . The chamber containing the projection has inward unit normals for some . These are a basis of , their reflections are the conjugates of the simple generators of , and their Gram matrix is the restricted Coxeter Gram matrix. In particular distinct normals have nonpositive pairings. By the root-sign theorem [F4] applied to this conjugate Coxeter system, its positive roots are exactly the roots positive on the projection, hence , and every such root is a nonnegative combination of . This supplies the simple system and the Coxeter presentation used below.
In any such positive root subsystem with simple system , its first root in the global order is a member of . For if the first root were not simple, write with ; each is later than , so (2)(d) gives . Linearity of and (1) would give , impossible. Also the last root of belongs to : otherwise it is a nonnegative combination of the earlier simple roots, contrary to step 3.1.
We prove the recursive selection and the factorization by induction on . For , has rank one, has its single positive root , and . For , order the simple roots increasingly; step 4.2 makes the last one . Put . Since , write with ; then has length . Write with . The identity and the bounds and force , so . Also fixes pointwise, hence .
Let be the global index with and put . For every one has and, by (2)(a) and -equivariance, by (2)(b); at this is . Since , conjugating by gives ; and , so and . Moreover : its complement is , of length , while ; the lengths add to . Hence is contained in , and both have dimension because . Thus . The roots span by step 2.2. Each is a nonnegative combination of and is orthogonal to ; since and for every , every root in is a combination only of the for which . Those zero-pairing simple roots must span the -space , so they are exactly . They form a simple system for . Induction gives and proves the reverse selection at each rank. Therefore . For each , its prefix and complementary suffix multiply to and have at most and reflections, so both lengths attain these bounds. Thus , contained in , has dimension and equals that span. Since , the induction shows that is the last root of in this subspace.
The other recursive description follows by considering the suffix . The factorization in step 6.1 gives : its prefix and suffix factors together multiply to of length , and their lengths are bounded by their numbers of reflections, whose sum is . Writing , the same length equality forces , so has length and . If as above, then has length at most ; the triangle inequality forces equality, so . Its moved space is , since its factors fix the orthogonal complement of that span and its moved dimension is . Thus , and is a simple system for this subsystem: a root in the tail span has zero coefficients on in its nonnegative -expansion. By step 4.2 the first root of is a simple root of this tail system; its first simple root is . Finally by cancellation, so is the first root of in the moved space in (4)(i), and . This proves (4)(i).
Put and . The prefix has reflection length by the factorization of and the triangle inequality, so this simple-generator word in the Coxeter system of is reduced. The root-inversion formula [F13], applied to that parabolic system, gives , hence it is a positive root. Conjugation gives ; multiplying these identities and cancelling adjacent inverse prefixes yields . Also . This proves (4)(ii).
Suppose and . By (4)(i), and . Step 4.1 realizes this as a canonical rank-two system. If its exponent is , [F11] gives simple-root angle and a rotation of magnitude . Write its generators as and . The identities and reduce every word to or , ; their distinct actions are the rotations and reflections in lines spaced by . Every reflection is a conjugate of or : the conjugates give respectively and . The root-reflection dictionary thus gives positive roots, equally spaced between the simple-root rays. The global order agrees with angular order: a decrease after would put in the cone on earlier roots , contrary to step 3.1. A product of reflections has rotation angle twice the difference of its normal angles, modulo ; hence the two-reflection factorizations of are exactly . These exhaust factorizations in : if , then , and both spaces have dimension , so the positive representatives of lie in by step 2.2. The endpoint angle gives , while each adjacent angle gives .
Fix . The second factorization in (4)(ii) writes where is the product of the other simple reflections in . Thus , , and . Since with , is reduced, so . It follows that . The moved space is exactly : it is contained there because those are its reflection normals, and both dimensions are . Hence for . Since is a linear combination of , (1) gives . Thus the restrictions to of the functionals form the dual basis to . For with , ; intersecting the cone with this zero hyperplane and with the unit sphere proves the wall equality, and the supporting hyperplane in is . This proves (4)(iii).
If distinct positive roots satisfy , their product has reflection length and belongs to the rank-two case of step 8.1. Both roots lie in the corresponding by moved-space rigidity. If , the only increasing-order two-factorization in step 8.1 is the endpoint factorization, so . If , the factorization is one of the adjacent descending pairs, so . This proves (4)(v).
If and , the factorization is reduced, and the pair-product fact of step 1.5 gives . The rank-two sign result of step 9.1 gives . On the other hand, since distinct simple roots have nonpositive pairings by step 4.1, applying successively to yields a nonnegative combination of , and . Thus the pairing is zero, and the two reflections commute. Sorting the into global order uses only swaps of such inverted commuting pairs, so the product is unchanged and .
The tuple has reverse product of length , so it is among the tuples in (4)(iv). Let be any other such tuple. By step 2.3 every prefix also has reverse product below of length , so its roots are linearly independent. For each , every root with has : its pairing is nonnegative because is a nonnegative combination of and the restricted pairing functionals are dual to by step 8.2, while it is nonpositive by (2)(d). The restrictions to of the functionals are independent, again by the dual-basis property. Their common kernel in therefore has dimension . If , the independent roots all lie in that kernel, a contradiction. Hence for every , which proves componentwise domination (4)(vi) and the lexicographic minimality in (4)(iv). No Choice is used.
Depends on
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- Root sign coherence and the action of simple reflections on positive roots
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- Reflection length, the absolute order on a finite Coxeter group, and the moved and fixed spaces of an orthogonal operator
- The Wall form of an orthogonal operator, subspace restriction, and the interval structure of the orthogonal reflection-length order
- A finite-dimensional vector space over an infinite field is not a finite union of proper subspaces
- 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
- Root normals inside the moved space, factorizations into reflections, and independent normals
- Carter's reflection-length formula, the absolute order on a finite Coxeter group, and moved-space rigidity under a common upper bound
- Support, intrinsic parabolic presentations, minimal coset representatives and length additivity, with the type-A identification
Used by
- The Brady-Watt ordered root complex X(c), its subcomplexes X(sigma) and X(sigma,rho), and their positive-cone realizations Definition
- Ordered roots and the mu-dot-root matrix in A3 Example
- Ordered roots and the mu-dot-root matrix in I2(5) Example
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- Finite noncrossing intervals are lattices, independently of the Coxeter element Theorem
- The separating-root lemma, the exact facet halfspaces of the added cones, and the spherical convexity of |X(sigma)| Theorem
Dependency tree · two levels
126 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Thomas Brady and Colum Watt, Lattices in finite real reflection groups (arXiv:math/0501502, 29-page PDF) (standard reference, not scraped)
- Robert Steinberg, Finite reflection groups, Transactions of the American Mathematical Society 91 (1959) 493-504 (AMS free digital archive, 12-page PDF) (standard reference, not scraped)
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages) (standard reference, not scraped)
- Sergey Fomin and Nathan Reading, Root systems and generalized associahedra, IAS/Park City Mathematics Series lecture notes (arXiv:math/0505518) (standard reference, not scraped)