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 elements of the classical types A_n, B_n, D_n and I_2(m): characteristic polynomials, orders and spectral exponents from their reflection models
Statement
For each of the types , , and take the irreducible Coxeter system of that type with the standard diagram numbering of Classification of finite Coxeter systems, including the H and dihedral families (1) (for the star with arms of edges; for the two vertices joined by an edge of label ), let be the complexified canonical reflection representation of Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers, and let be the bipartite Coxeter element of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (equivalently: the product, in the bipartite convention, of the two colour-class products of the tree , each of which has commuting factors; for a path diagram the colour classes are the even- and odd-numbered vertices, and for the classes are determined by the distance from the branch node). Write for and write for the complex number ; call spectral exponents the multiset of residues such that the eigenvalues of the operator are the numbers , each with multiplicity. Then is diagonalisable (A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation), has order equal to the Coxeter number displayed below, and has the displayed characteristic polynomial in and spectral exponents:
The exponent lists are multisets; in type , the extra residue is counted again when is even. In particular is not asserted here (the exponents are only named ); the transfer to invariant degrees is the content of the final determination theorem of this page.
Facts & Assumptions
Given: One of the four types , , , with its Coxeter system , and the bipartite Coxeter element of the bipartite definition.
In the standard coordinates of (and in the sum-zero hyperplane of for type ) the reduced crystallographic root systems , , , are the classical sets displayed in Classical root systems in coordinates, with the standard simple roots and Dynkin diagram; the reflection in a root is (Reduced crystallographic Euclidean root system).
The Coxeter form satisfies and for finite , the reflection formula is , the canonical representation is a homomorphism, and its complexification is faithful (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2), The canonical reflection homomorphism, roots, reflections, and the positive cone, Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1)).
For an irreducible finite type system the diagram is one of the standard trees in the finite classification, and its bipartition gives commuting color-class products and ; and are well defined, and reversing the classes replaces by a conjugate since (The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1), Coxeter diagrams: edges, labels, components and finite type (2), Classification of finite Coxeter systems, including the H and dihedral families (1)).
For the rank-two system with simple reflections : the product has, in the basis , matrix with , determinant , and for finite trace , and for (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(iii)-(iv)).
For a square matrix the characteristic polynomial is , and the determinant is the alternating multilinear function of the columns (For , the characteristic polynomial is when , with for the unique matrix, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix). The alternating multilinear property is proved in The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring. Determinants are invariant under similarity (Similar matrices over a commutative ring have the same determinant), so an eigenbasis computes the determinant factors of a diagonalisable operator. Over a field, a positive-sized square matrix is invertible exactly when its determinant is nonzero (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit); hence exactly when is an eigenvalue.
An operator of finite order on a finite-dimensional vector space over an algebraically closed field of characteristic is diagonalisable (Over an algebraically closed field of characteristic , every element of finite order acts diagonalisably in a finite-dimensional representation, A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation, Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism).
For real one has , , and (Euler's formula: for every real , , , and , The complex numbers as , with the real embedding and imaginary unit , Sine and cosine defined by their real power series); the complex exponential is multiplicative, (, and the complex exponential extends the real exponential).
For the -th roots of unity are exactly the distinct numbers , ; consequently the roots of are these numbers, and the roots of are , , all distinct (The -th roots of a complex number and the distinct roots of unity for every with of modulus one, The group of -th roots of unity in a field, and primitive -th roots of unity).
Cycle notation denotes the permutation sending to and to , juxtaposition means composition, and the fixed points and orbits of a permutation are read off from its cycle decomposition (The finite symmetric group , one-line notation, and cycle notation).
Proof
(Model and identification.) Let be the model space of [F1] with its standard inner product, with simple roots : for , and ; for , , and ; for , , and . These are the standard simple roots and diagram numbering of [F1] and of the classification [F3]: the branch node of the star is with arms of one vertex each and of vertices. Define the linear map by on the basis of . For every pair: except in type , so preserves norms of basis vectors; adjacent simple roots with all labels satisfy , the edge of label satisfies , and non-adjacent pairs are orthogonal, so for all the normalized simple roots form a basis of , so is invertible and is an isometry of bilinear forms [F2, F1]. Consequently for with and one has , so conjugation by carries the reflection with normal to the reflection with normal ; applied to this gives . Hence is a homomorphism (a conjugate of the homomorphism ) with , and is the product of the two colour-class reflection products in the model. Since listing the two classes in the other order replaces by a conjugate element [F3], characteristic polynomials and orders computed for one listing apply to in either convention.
(.) Here the model is itself, is the product of the two simple reflections, and [F4] gives trace , determinant and exact order . For a matrix the characteristic polynomial is , as one sees by expanding [F5], so . Since and by [F7], the two numbers have sum and modulus one, so and the eigenvalues are and . Moreover : indeed and by multiplicativity and [F7]. Hence the spectral exponents are and , with .
(.) The model reflection acts on by the transposition of coordinates: for , swaps the -th and -st coordinates and fixes the others. For , acts on the line as , so , the order is , and the spectral exponent is [F1, F2, step 1.1]. For write and for the two colour-class products on the coordinates ; they are products of pairwise disjoint transpositions, so each product has commuting factors, and (the reverse product is conjugate because ). On basis vectors, using the four cases: and , so ; for even one has and , so ; for even (only when is even) and , so ; for even (only when is odd), and , so ; for odd one has and , so . Tracing these rules gives the single cycle on the coordinates [F9]. In the basis ordered along this cycle, the matrix of the cycle has on the diagonal, on the subdiagonal and in the top-right corner; in the Leibniz sum for the only nonzero terms are the identity permutation, contributing , and the -cycle , of sign and entry product , contributing ; hence the characteristic polynomial is with [F5]. The full coordinate space decomposes as the invariant direct sum , and the second summand is fixed, so on the -dimensional space the operator has characteristic polynomial ; by [F8] its eigenvalues are the numbers , , each once. The restricted spectrum includes the primitive -st root , so the order of is divisible by ; the full cycle has order , so the restricted order is exactly . Thus the spectral exponents are with .
(.) Here and the model reflections are for and negating the -th coordinate. Let and be the two colour-class products of the path and let . Direct composition on basis vectors gives, uniformly in the parity of : ; for even ; and when is odd; when is even; and for odd . For example, once the chain of even indices reaches the last coordinates the sign from appears and the negative coordinates are traversed in reverse: for , ; for , . Consequently the orbit of under consists of the vectors , each exactly once: its first elements are with pairwise distinct (for : ; : ; : ; : ), hence a basis, and . In this basis and , so the matrix of has on the diagonal, on the subdiagonal and in the top-right corner of ; as in 2.1 the only nonzero Leibniz terms give [F5]. Since commutes with and , it sends each basis vector to , so on and . The orbit of already contains the distinct signed coordinate vectors, so the order of is exactly . By [F8] applied to the eigenvalues are the numbers , : the spectral exponents are the odd residues with .
(.) Here for and ; the simple reflections for swap coordinates , while sends and . The branch node is . Choose the color class containing the branch node as and use with first; reversing the classes conjugates the product by [F3]. If is even, and ; applying the commuting reflections in and then gives , for odd , , for even , , and . If is odd, and ; the same reflection formula gives , for even , , for odd , and . The formulas show that, on , the first iterates of are a signed coordinate basis: for even they are , and for odd they are . In this basis advances each vector to the next and sends the last to , so the companion determinant computation of 2.2 gives and . Since commutes with , it is on the orbit basis of , so the orbit of and its negatives contains the distinct signed basis vectors and the order on is exactly ; the remaining coordinate line has eigenvalue , so the full order is . Thus . By [F8], the roots of are for , and the extra root is ; the spectral exponents are and one additional (counted again when is even), with .
The map is conjugate to , and complexification preserves characteristic polynomials and operator orders, so steps 1.2-2.3 compute and its order for the four types. Since is faithful by [F2], this operator order equals the order of in , which is the Coxeter number used in the statement. The eigenvalues listed there are the spectral exponents in the sense fixed in the statement, since conjugate linear maps have the same eigenvalues with the same multiplicities. Finally has finite order because is finite, so it is diagonalisable by [F6] over ; this holds in each type and shows both the diagonalisability and, together with the characteristic polynomials, the displayed spectra. Nothing above uses invariant degrees, Hilbert series or any degree table: only the reflection models, the rank-two computation and roots of unity are used, and the statement makes no assertion about , which is proved only by the final determination theorem of this page.
Depends on
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
- The real Coxeter form, its radical, reflections, and form-preserving maps
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers
- Coxeter diagrams: edges, labels, components and finite type
- Classification of finite Coxeter systems, including the H and dihedral families
- Classical root systems in coordinates
- Reduced crystallographic Euclidean root system
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- For $A\in M_n(F)$, the characteristic polynomial is $\chi_A(x)=\det(xI_n-A)$ when $n\geq1$, with $\chi_A(x)=1$ for the unique $0\times0$ matrix
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation
- Eigenvalues, eigenvectors, eigenspaces $E_\lambda(T)=\ker(T-\lambda I)$, and the spectrum $\sigma_F(T)$ of an endomorphism
- Sine and cosine defined by their real power series
- The complex numbers as $\mathbb R[x]/(x^2+1)$, with the real embedding and imaginary unit $i$
- The $n$-th roots of a complex number and the $n$ distinct roots of unity for every $n\ge1$
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- Euler's formula: $\exp(i\theta)=\cos\theta+i\sin\theta$ for every real $\theta$
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- Over an algebraically closed field of characteristic $0$, every element of finite order acts diagonalisably in a finite-dimensional representation
- The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring
- A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit
- Similar matrices over a commutative ring have the same determinant
Used by
Dependency tree · two levels
159 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
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages) (standard reference, not scraped)
- Vivien Ripoll (Strobl seminar notes, joint with Reiner and Stump), Coxeter elements in well-generated reflection groups (57-page PDF) (standard reference, not scraped)