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 Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
Statement
Let be an irreducible finite-type Coxeter system with , with bipartition and data , , , , and conditional map as in The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a. Put , so and . Let denote the linear action of , let be the primal chamber in and its interior, and let be the root hyperplanes (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, The finite reflection arrangement, its chambers, the spherical chamber complex, and the coset face poset). Write for the longest element (The longest element as the opposition of the chamber, and longest elements of finite parabolics). Then:
(1) The Coxeter-plane eigenvector. The matrix has nonnegative entries, zero diagonal, and connected nonzero off-diagonal pattern. There are and with , and .
(2) The invariant plane and chamber sector. Put , , and . Then , , , the plane is invariant under , and , and
Thus is a rotation through , where . The intersection is a sector of angle whose relative interior lies in ; it contains a point with trivial -stabiliser. The restrictions of and generate a dihedral group of order on . Its translates of are exactly the full-dimensional chamber sections : they are the sectors cut out by the root-hyperplane traces, with pairwise disjoint relative interiors. The set of traces is exactly the set of reflection lines of this dihedral action.
(3) Enumeration of the roots. Every is a root, for all , and
with all listed roots pairwise distinct; hence the sequence has exact period . Moreover . If is even then . If is odd then is even, , and . Accordingly, the word
is a reduced expression of of length , with prefix roots exactly in this order.
(4) Invertibility of the linear action minus the identity. The operator is invertible. Consequently the conditional map from the preceding definition is defined on all of and satisfies for every .
For the conclusions are direct: , and . Reducible systems are handled componentwise using the preceding definition's clause (5), and no uniform count is asserted for unequal component Coxeter numbers. No Choice is used.
Facts & Assumptions
Given: An irreducible finite-type Coxeter system with , 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 operator , the positive definite space with root system and reflection set , and the transferred primal chamber and root hyperplanes .
The defining data have connected, , , pairwise orthogonal simple roots within each class, and , for every . The vectors satisfy . The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1)-(3)
is positive definite, is faithful and preserves , and every root satisfies ; for each , is the reflection . Finiteness criterion: W is finite exactly when the Coxeter form is positive definite, Descent of the reflection representation, unit root norms, and conjugation of reflections (1)-(3), The root-length criterion and faithfulness of the canonical reflection representation (3)
The roots split as with and consists exactly of the roots with nonnegative simple-root coordinates; each sends to and permutes . Root sign coherence and the action of simple reflections on positive roots (1)-(3)
The transferred chamber is with interior defined by strict inequalities; the chambers tile with disjoint interiors, and a point in has stabiliser . In particular a point of has trivial stabiliser, and a point in the relative interior of has stabiliser . The interior of every chamber is disjoint from every root hyperplane, and . 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 (1),(3)
For every and , if and only if . The root-length criterion and faithfulness of the canonical reflection representation (1)
The longest element satisfies , , , and it is the unique element of length . The longest element as the opposition of the chamber, and longest elements of finite parabolics (1)(ii)-(iv)
The map , , is a bijection, , and exactly when . Thus root hyperplanes are in bijection with . The inversion formula , the root-reflection dictionary and strong exchange (1)(i)-(iv)
The coordinate norm and inner product are the standard Euclidean ones on . For the coordinate unit sphere is nonempty (it contains each simple basis vector ) and compact. The identity map is continuous, and a linear map is continuous because for some . The inner product of continuous vector-valued maps is continuous, so is continuous; every continuous real-valued function on a nonempty compact subset of attains a maximum. The real Coxeter form, its radical, reflections, and form-preserving maps, The Euclidean inner product on , Every Euclidean linear map has a unique matrix and satisfies for some , A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions (3), For , every Euclidean closed ball and every Euclidean sphere of positive radius is compact, For a nonempty subset of with , compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent (4)
For a reducible diagram with components , is the direct product of the and is their orthogonal direct sum; the root, reflection and bipartite constructions are componentwise. Disconnected diagrams, direct products, and comparison of invariant forms, Coxeter diagrams: edges, labels, components and finite type
Proof
Write for the standard coordinate norm and set . If for distinct , then , contradicting positive definiteness; hence every off-diagonal Coxeter exponent is finite. Therefore and for , with exactly on the edges of the connected diagram. Also for every nonzero .
For , the first prefix vectors satisfy for and for : the earlier reflections in the same color class fix , while each reflection in the other class adds its and fixes the other roots of that class. Hence the coordinate matrix of relative to the ordered basis is block upper triangular with identity diagonal blocks, so these vectors form a basis. The cyclic definitions give and for every , because each block of reflections has product . Each is a root, being the image of a simple root by an element of .
The unit sphere for is compact, so attains a maximum there; normalizing for an edge gives a positive value of , so , and step 1.1 at a maximizer gives . Let be a unit maximizer. For with , maximality at gives for every real . If , a sufficiently small of the same sign makes the linear term dominate the quadratic term, a contradiction. Thus is orthogonal to every , so it is a multiple of ; pairing with gives .
For , duality gives for every , so for every and in particular . Also . Thus , so .
Since every entry of is nonnegative, , while , so is also a maximizer and satisfies by step 2.1. Put . If and , then ; since and the edge graph of is connected, positivity propagates to every coordinate. Thus we may take , proving the existence claim in (1).
The vectors form a basis by the construction in the preceding definition, and form a basis by 1.2; thus 2.2 shows that maps one basis to the other up to the nonzero scalar , so it is invertible. If with and , then the cyclic recursions in F1 and the identity in 2.2 give . Applying the conditional map of the preceding definition now yields for all , proving (4) and the definition's well-definedness justification.
Put . Since distinct simple roots in either color class are orthogonal, and . Multiplying the eigenvector equations by and summing over gives ; summing the equations indexed by gives the same left side equal to , hence . Finally . The Gram matrix on is with determinant , so are independent and is a plane.
For , fixes for and negates ; the corresponding statement holds in . For , the commuting reflections in give , and for , . Summing with coefficients and and using yields , , , and . Thus is invariant under and .
In the basis , , , and . The vectors and are -orthonormal, and direct substitution gives . With these coefficients are and ; since preserves and has determinant on , it is the rotation through .
For , one has for and for . Thus is given by and ; because , these inequalities imply , and their strict versions place the relative interior in . Its boundary rays are (the simple-root hyperplanes) and (the simple-root hyperplanes). Their squared -norms are both and , so the sector angle has cosine and equals . The restrictions of and are reflections in the lines and : they fix those lines, are involutions, and are nonidentity on by 4.1.
Let be the order of . Since it rotates through , and for an integer with and . The subgroup consists of the distinct rotations and the distinct reflections , so . Distinct elements of have lifts with distinct restrictions to , hence are distinct elements of ; by F4 their chamber interiors are distinct and disjoint. Thus the orbit of consists of distinct sectors of angle , each of the form , with pairwise disjoint relative interiors. Hence , so and ; equality shows the sectors cover . As by F1, the element fixes every point of , in particular a point of ; its stabiliser is trivial, so and . Thus and , completing (1) and the angle claims of (2).
For every root , the trace is a line: if , the nonidentity reflection fixes a point of , contradicting its trivial stabiliser; otherwise the nonzero linear functional restricts to a nonzero functional on the two-plane , whose kernel is a line. Each such line is a root-hyperplane trace and cannot meet the relative interior of any sector , because that relative interior lies in the chamber interior , which is disjoint from the arrangement. Conversely the two boundary lines of are traces of simple-root hyperplanes by 7.1, and their images under are root-hyperplane traces because permutes roots. These images are all the sector boundary lines: the sectors from 8.1 tile and have distinct boundary rays, while every root trace must be one of those lines because it cannot meet a sector interior. Opposite rays define the same line, so the traces are exactly distinct lines. The connected components of the complement of these lines are the sector interiors. Each component is connected and the ambient chamber interiors form a disjoint open cover of it, so it lies in one chamber interior. Conversely, if a full-dimensional chamber section contained points from two components, choose them in its relative interior; their segment lies in that relative interior by convexity and crosses a root trace, contradicting disjointness of chamber interiors from the arrangement. Hence the full-dimensional chamber sections are exactly the sectors.
The ray lies in the relative interior of the face , so its stabiliser is ; similarly the stabiliser of is . Every element of reduces to a product of a subset because its simple generators are commuting involutions; the subset products are distinct because their -images have different signs on the independent simple roots and is faithful by [F2]. The image of the product for acts by on and by on its -orthogonal complement, so its -eigenspace has dimension ; therefore it is a reflection exactly when , and the reflections in are precisely its simple generators. The same reasoning gives exactly reflections in . The distinct boundary rays from 8.1 alternate between the two types, so there are of each; conjugating the stabiliser count around them gives incidences between rays and ambient root hyperplanes. Each hyperplane contributes exactly two incidences because its trace is a line. Hence the arrangement has hyperplanes, so by the root-reflection correspondence of [F7].
If is odd, a semicircle from a point of to its antipode crosses each trace line once; since every root-hyperplane trace is one of these lines, it meets each ambient root hyperplane exactly once. The boundary-ray types alternate, so one type occurs times and the other times. Counting the hyperplanes met using 10.1 gives if the more frequent rays have type , and the same equation with and interchanged if they have type . Either equation gives . Thus is even and .
Choose the direction around the circle so that the first boundary ray of is . The rays then occur in the cyclic order and for : reflects across the boundary, while advances by two sector angles. The hyperplanes through are exactly for , and those through are exactly for , by the stabiliser counts and the description of the reflections in from 10.1. These are precisely the blocks and by the cyclic prefix definition in 1.2. The first rays carry hyperplanes: this is from complete color pairs when is even, and when is odd by 11.1. The opposite semicircle carries the other hyperplanes. Each half-turn list is pairwise distinct because every trace line meets that semicircle only once, and the listed hyperplanes in each boundary block are distinct simple-root images.
Fix . The first half-turn list of hyperplanes in 12.1 is pairwise distinct, so for every . For , put , with and ; for , , since otherwise applying would give . Each preserves the sign of every root other than by [F3], so and have the same sign. Since , descending induction gives for every .
Let . The word for even , or for odd , has exactly letters; in the odd case this uses from 11.1. Its prefix roots are by the cyclic definition, and these are positive by 13.1. At each step the root-length criterion therefore increases the prefix length by one, so the word is reduced and . By uniqueness of the longest element, , proving the formulas for in (3).
The full word represents and splits after its first letters, whose product is by 14.1. Its remaining -letter suffix also represents , so it is reduced. Every prefix of a reduced word is reduced; applying the root-length criterion at each next letter shows that every prefix root of this suffix is positive. Its corresponding global prefix root is obtained by applying and is therefore negative by [F6]. The second half in 12.1 has pairwise distinct hyperplanes, so these negative roots are pairwise distinct as well. Hence the first roots are all of because by [F6] and 10.1, and the second are all of . The first and second lists are disjoint by sign, giving pairwise distinctness of all roots; gives period , and that distinctness makes it exact. This proves (3).
In rank one, , , , , and , so the stated conclusions hold. For a reducible finite-type system, , , , the root systems and split over the components by [F9]; each rank-one or irreducible component satisfies the result just proved, so is a direct sum of invertible operators and the map and root enumeration hold componentwise. The total number of positive roots is , with no common formula asserted when the component orders differ. 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
- Coxeter diagrams: edges, labels, components and finite type
- Disconnected diagrams, direct products, and comparison of invariant forms
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- The real Coxeter form, its radical, reflections, and form-preserving maps
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- 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
- The longest element as the opposition of the chamber, and longest elements of finite parabolics
- Root sign coherence and the action of simple reflections on positive roots
- The root-length criterion and faithfulness of the canonical reflection representation
- The inversion formula $|N(w)|=\ell(w)$, the root-reflection dictionary and strong exchange
- The Euclidean inner product $\langle x,y\rangle = \sum_{k<n} x_k y_k$ on $\mathbb{R}^n$
- Every Euclidean linear map has a unique matrix and satisfies $\|Lh\|_2\le K\|h\|_2$ for some $K\ge0$
- A vector-valued function has a limit, or is continuous, if and only if each of its components does; with the algebra of continuous vector-valued functions
- For $n\ge1$, every Euclidean closed ball and every Euclidean sphere of positive radius is compact
- For a nonempty subset of $\mathbb{R}^n$ with $n\ge1$, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent
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
- Intersection of root subcomplexes and purity under convexity Lemma
- The factorization criterion, linear independence of the faces, and the geometric simplicial structure of X(sigma) Lemma
- The mu-dot-root identities, the cone separation, and the canonical simple systems of the subintervals [1, sigma] Lemma
- The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices Lemma
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types Theorem
- 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
Cited to discharge well-definedness by The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)⁻¹a.
Dependency tree · two levels
143 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)