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.
Plane subsystems, their canonical generators, and the angular order of their roots
Statement
Let be a Coxeter system of finite type with finite and , canonical reflection representation on , Coxeter form (positive definite, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)), root system , reflection set , the finite reflection arrangement with chamber and the chamber tiling, and the parabolic subsystems (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, Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2)). For , write . For each , let be its associated reflection, so , and for each let be its unique positive root with (The inversion formula , the root-reflection dictionary and strong exchange (1)). Let be a -dimensional subspace spanned by roots, and let satisfy for every root ; if take . (Existence: the sets for are finitely many proper subspaces of , since would force , and a finite union of proper subspaces does not cover a vector space over the infinite field .) (1) Stabilizer and roots. is a parabolic subgroup of , a conjugate of a standard parabolic, of rank two, and its roots are exactly the roots in the plane: Moreover spans . (2) Canonical generators and angular order. is the positive system of the rank-two subsystem and has exactly two extreme rays. Let be the roots on those rays, and put and for their corresponding group reflections. Let . For , let be the alternating word of length in starting with ; these are reflections, since for one has and whenever the indicated index is in range. Thus and . Then , the positive roots ordered by angle from the ray of to the ray of are , and all positive roots of lie in the closed angular sector spanned by . (3) The dihedral subsystem. is dihedral of order (for it is ); its reflection set is , and every reflection of is conjugate in to or . The root pair is the canonical system: its positive span contains every positive subsystem root, and neither root is in the positive span of the other positive subsystem roots. (4) Subplanes and reversal. If is a -dimensional subspace spanned by roots of , then , so ; the same construction in gives the same extreme rays, rank-two subsystem and reflection subgroup, with the same angular order. Exchanging the two extreme rays (using the opposite orientation from to ) reverses the index order to . (5) No Choice. The point is chosen in the complement of a finite union of proper subspaces of , which is nonempty without the Axiom of Choice.
Facts & Assumptions
Given: A Coxeter system of finite type with , Coxeter form , canonical reflection representation , root system , reflection set , positive cone , the chamber and its interior of the dual action, and a -dimensional subspace spanned by roots, with satisfying for every root (and when ).
The real Coxeter form, its radical, reflections, and form-preserving maps: is a basis of ; is symmetric bilinear with , for finite and for ; and for with the reflection with normal is .
The canonical reflection homomorphism, roots, reflections, and the positive cone: defines the homomorphism , , , and .
Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2): for , is linear, involutive and preserves , and is a hyperplane fixed pointwise by .
Root sign coherence and the action of simple reflections on positive roots (2): every root lies in or in , and , .
The inversion formula , the root-reflection dictionary and strong exchange: every root has -norm one; for , is independent of the representation, , , , and the map , , is a bijection.
Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1): is finite if and only if is positive definite.
The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset: because is finite, is positive definite, and identifying with by one has , and , with a finite set of hyperplanes permuted by .
The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1): , under the identification , the connected components of are exactly the chambers , and every -orbit in meets in exactly one point.
Chamber collisions, point stabilizers, and the intersection rule: (1) ; (4) for and with one has , where .
Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives (2): for , for , and ; the reflections lying in are exactly the with .
The dual action, the faces, and the rank-two chamber tiling (2): (equivalently ).
The root-length criterion and faithfulness of the canonical reflection representation (3): the homomorphism is injective.
Proof
Finite-union base cases: if , the empty union misses in every vector space; if , a proper subspace misses a point of by definition.
Induction hypothesis of the finite-union lemma: for , assume that for every real vector space and every family of proper subspaces the union is not all of .
Step of the finite-union lemma, : let be proper subspaces of . If , then by step 1.3. Otherwise choose (nonempty by step 1.3) and (nonempty since is proper), and form the line ; each meets in at most one point, because two distinct points of in give and then . Hence at most values of are excluded, and since is infinite some has ; this proves the lemma for , and every selection made is a single existential instantiation from a set already known to be nonempty, so no choice principle is used.
Existence of and clause (5): if , then and the family indexed by is empty, so take . If , some simple root is outside because the simple roots span , hence the finite family , , is nonempty. Each member is a proper subspace of : would mean for all , i.e. , contrary to , since is positive definite. If there is one such subspace, step 1.2 supplies a point outside it; if there are at least two, step 2.1 supplies a point outside their union. This gives with for every root . This proves the existence asserted in the statement and shows that no Choice is used (clause (5)).
Roots of : for one has if and only if . If , then because , so by [F1], and by F5, hence . Conversely, if , then the same two formulas give , hence (as ), and the defining property of from step 3.1 forces . In particular , and this proves the second display of clause (1).
Rank and span: put and . By F5 and F10, ; the third equivalence also uses when is negative. Thus the roots of the conjugate parabolic are . Comparing with step 4.1 gives ; since for , the set spans , and invertibility of shows . Hence because is a basis of , and spans because it equals the image of . Thus is a conjugate of a standard parabolic of rank two.
The finite dihedral model: , and conjugating the generating set by gives by [F2, F5]; each lies in , so is contained in . Conversely every for belongs to by step 4.1, proving equality. Moreover with by [F4], and is finite by [F6].
Faithful plane action: preserves , because preserves by F10. Since is positive definite, . Every generator fixes pointwise by the reflection formula [F1] and [F2]; hence every fixes pointwise. If acts trivially on , then acts trivially on and on , so it is the identity on and by [F12]. Thus is faithful.
Orthogonal plane action: is finite by [F6] and is contained in because preserves and is generated by the B-isometric reflections from step 6.1 and [F3]. Each with acts as a nontrivial orthogonal reflection on : [F5] gives , so its normal line lies in and its restriction fixes the one-dimensional orthogonal line and negates .
Identify plane reflections with group reflections: take with determinant and let be its unique preimage under the faithful action of step 7.1. Every determinant- map in is a reflection, since its eigenvalues are and . By step 6.1, is generated by with ; each fixes pointwise by [F1]. By positive definiteness [F7], , so is the reflection on and the identity on , hence has fixed hyperplane . If is not a root hyperplane, each is a proper subspace of ; the arrangement is finite by [F7]. Applying the finite-union lemma from step 2.1 inside gives outside every root hyperplane. Choose with using F8. The arrangement is -invariant, so also avoids every root hyperplane; because , this makes , and F9 gives . Since , its stabilizer is conjugate to the trivial stabilizer of , contradicting and . Therefore for some root . The unique -orthogonal reflection with fixed hyperplane is , so [F5] gives and faithfulness [F12] yields ; step 4.1 forces . Conversely every with lies in by step 4.1 and acts as a reflection on . Hence the determinant- elements of correspond exactly to .
Finite orthogonal plane groups: spans , so choose two nonproportional roots in . Their reflections restrict to distinct reflections of by steps 6.1 and 8.1, and their product is a nonidentity rotation and the rotation subgroup is nontrivial. The determinant maps onto , with kernel , so . Let be the least positive rotation angle in the finite group . For any angle of an element of , division by gives with ; the rotation of angle is in , so minimality forces . Dividing by likewise gives with ; the inverse of the rotation through has angle , so again . Thus , the rotation through , has exact order and every element of is a power of , so and . The coset for any reflection consists of all orientation-reversing orthogonal maps, each a reflection in a line of . If is the angle of a unit normal to the reflection line of , then the unit normal to has angle ; including both orientations gives equally spaced normal directions.
Angular order and count: let by steps 9.1 and 8.2 and the positive-root/reflection bijection [F5]. Put ; since spans by steps 5.1 and 6.1, it is a pointed, finitely generated full-dimensional cone in the plane and has exactly two extreme rays, each containing a generator . Its positive roots lie in the closed angular sector between those rays, and a root in that sector is positive, so this sector contains exactly the positive roots counted above. The normal lines are spaced by by step 9.1; therefore these roots occupy consecutive directions, and the sector has angle . The unit normals therefore have angle , so the product of their linear reflections is a rotation through , of exact order . Since and is injective by [F12], .
The alternating list: put , and . Step 10.1 gives and the angle between the unit roots as , whence . The conjugate formulas in the Statement show each is a reflection in . Their positive roots satisfy and , which has angle from . For , the alternating-word identity and the root-conjugation identity [F5] give the root for ; its angle is , so it is the positive root . By step 10.1, rotates through . Starting from , induction now gives at angle from for all . These are the consecutive positive roots; at the vector is the unit root on the ray of , hence equals and [F5] gives . The conjugate formulas show odd-indexed are conjugate to and even-indexed to .
Clauses (2) and (3): by steps 8.2 and 11.1, the roots of are with and distinct positive roots, so this is all of and its positive roots are ordered from the ray to between its two extreme rays. By step 6.1, is generated by its reflections ; steps 8.2 and 11.1 together with [F5] identify that set with the alternating elements , each a word in , so . The involutions with product of order give a surjection from the dihedral group of order onto , and by steps 7.1, 9.1 and 10.1; hence this surjection is an isomorphism. Every reflection is conjugate to or by step 11.1. For the canonical-system characterization stated in (3), it remains to check positive spanning and extremality. The roots in lie in the cone generated by the extreme roots , so condition (i) holds. Extremality gives condition (ii): if were a nonnegative combination of other positive subsystem roots, every nonzero summand would have to lie on its extreme ray; since every root has norm one, the only positive root on that ray is itself, a contradiction. Thus is the canonical system of .
Clause (4) and the reversal: a -dimensional subspace equals , so ; therefore the extreme rays, rank-two subsystem, reflection subgroup, and angular order constructed in are the same as those already established in steps 10.1--12.1 and 6.1. If the extreme rays are exchanged, let and . Repeating the calculation of step 11.1 with the rays exchanged (so the product is ) gives the new alternating roots at angle from , hence at angle from ; this is the angle of . The root-reflection bijection [F5] then gives , so the index order reverses.
The finite-union induction is discharged by steps 1.2, 1.3 and 2.1, and the alternating-root induction by step 11.1; together with steps 3.1--10.1, 12.1, and 13.1 these establish clauses (1)--(5). The proof uses no Choice.
Depends on
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- 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
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- 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
- Chamber collisions, point stabilizers, and the intersection rule
- Intersections of standard parabolics, the parabolic root subsystem, and global minimality of coset representatives
- The root-length criterion and faithfulness of the canonical reflection representation
- The dual action, the faces, and the rank-two chamber tiling
Used by
- A set of two reflections of A2 that fails both closure and the segment criterion Counterexample
- The Euler and skew forms of c = s1s2s3 in A3, and the orientation of its rank-two subsystems Example
- Finite inversion sets are recognized by their rank-two initial or final segments Lemma
- Omega-positive words are commutation-equivalent to sortable sorting words; sortable equals aligned; parabolic restriction Lemma
- Skip roots form a basis, negative skips are cover roots, and the cover decomposition of sortable elements Lemma
- The cone criterion, monotonicity of the projection, and the greatest sortable element below w Lemma
- The greedy scan computes the c-sorting word; commutation, conjugation and rank-two alignment Lemma
Dependency tree · two levels
106 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
- N. Reading and D. E. Speyer, Sortable elements in infinite Coxeter groups, arXiv:0803.2722v3 (2010); Trans. Amer. Math. Soc. 363 (2011) 699-761 (standard reference, not scraped)
- N. Reading, Sortable elements and Cambrian lattices, arXiv:math/0512339v1 (2005); Algebra Universalis 56 (2007) 35-56 (standard reference, not scraped)
- A. Bjorner and F. Brenti, Combinatorics of Coxeter Groups, Graduate Texts in Mathematics 231, Springer 2005 (standard reference, not scraped)