Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
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 An (n≥1), Bn (n≥2), Dn (n≥4) and I2(m) (m≥3) take the irreducible Coxeter system (W,S) of that type with the standard diagram numbering of Classification of finite Coxeter systems, including the H and dihedral families (1) (for Dn the star with arms of 1,1,n−3 edges; for I2(m) the two vertices joined by an edge of label m), let ρC:W→GL(VC) 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 c∈W 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 Dn the classes are determined by the distance from the branch node). Write ζh:=exp⁡(2πi/h) for h≥2 and write ζhr for the complex number exp⁡(2πir/h); call spectral exponents the multiset of residues r∈{1,…,h−1} such that the eigenvalues of the operator are the numbers exp⁡(2πir/h), each with multiplicity. Then ρC(c) is diagonalisable (A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation), has order h equal to the Coxeter number displayed below, and has the displayed characteristic polynomial in X=λ and spectral exponents:

An:det⁡(X−ρC(c))=Xn+Xn−1+⋯+X+1,h=n+1,{ei}={1,2,…,n};

Bn:det⁡(X−ρC(c))=Xn+1,h=2n,{ei}={1,3,5,…,2n−1};

Dn:det⁡(X−ρC(c))=(Xn−1+1)(X+1)=Xn+Xn−1+X+1,h=2n−2,{ei}={1,3,…,2n−3,n−1};

I2(m):det⁡(X−ρC(c))=X2−2cos⁡(2π/m)X+1,h=m,{ei}={1,m−1}.

The exponent lists are multisets; in type Dn, the extra residue n−1 is counted again when n is even. In particular h=max⁡i(di) is not asserted here (the exponents are only named ei); the transfer to invariant degrees is the content of the final determination theorem of this page.

Facts & Assumptions

Given: One of the four types An, Bn, Dn, I2(m) with its Coxeter system (W,S), and the bipartite Coxeter element c of the bipartite definition.

[F1]

In the standard coordinates of RN (and in the sum-zero hyperplane of Rn+1 for type An) the reduced crystallographic root systems AN, BN, CN, DN are the classical sets displayed in Classical root systems in coordinates, with the standard simple roots αi and Dynkin diagram; the reflection in a root α is sα(x)=x−2(x,α)(α,α)α (Reduced crystallographic Euclidean root system).

[F2]

The Coxeter form satisfies B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), the reflection formula is ra(v)=v−2B(v,a)a/B(a,a), the canonical representation ρ:W→GL(V) is a homomorphism, and its complexification ρC 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)).

[F3]

For an irreducible finite type system the diagram Γ is one of the standard trees in the finite classification, and its bipartition J⊔K gives commuting color-class products a=∏s∈Js and b=∏s∈Ks; c=ab and h=ord⁡(c) are well defined, and reversing the classes replaces c by a conjugate since ba=a−1(ab)a (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)).

[F4]

For the rank-two system I2(m) with simple reflections rs,rt: the product A=rsrt has, in the basis (es,et), matrix (4c2−1−2c2c−1) with c=cos⁡(π/m), determinant 1, and for finite m trace 2cos⁡(2π/m), Am=id and Ak≠id for 0<k<m (Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (3)(iii)-(iv)).

[F5]

For a square matrix A the characteristic polynomial is χA(x)=det⁡(xI−A), and the determinant is the alternating multilinear function of the columns (For A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ 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 det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F8]

For h≥1 the h-th roots of unity are exactly the h distinct numbers exp⁡(2πik/h), k=0,…,h−1; consequently the roots of th−1 are these numbers, and the roots of tN+1 are exp⁡(i(π+2πk)/N)=exp⁡(2πi(2k+1)/(2N)), k=0,…,N−1, all distinct (The n-th roots of a complex number and the n distinct roots of unity for every n≥1 with z=−1=exp⁡(iπ) of modulus one, The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[F9]

Cycle notation (a0 a1 ⋯ ak−1) denotes the permutation sending ai to ai+1 and ak−1 to a0, juxtaposition means composition, and the fixed points and orbits of a permutation are read off from its cycle decomposition (The finite symmetric group Sn, one-line notation, and cycle notation).

Proof

1.1F1F2F3

(Model and identification.) Let E be the model space of [F1] with its standard inner product, with simple roots α1,…,αn: for An, E={(y1,…,yn+1):∑yi=0}⊆Rn+1 and αi=εi−εi+1; for Bn, E=Rn, αi=εi−εi+1 (i<n) and αn=εn; for Dn, E=Rn, αi=εi−εi+1 (i≤n−1) and αn=εn−1+εn. These are the standard simple roots and diagram numbering of [F1] and of the classification [F3]: the branch node of the Dn star is αn−2 with arms αn−1,αn of one vertex each and α1,…,αn−3 of n−3 vertices. Define the linear map φ:V→E by φ(ei):=αi/∣αi∣ on the basis (ei) of V. For every pair: (αi,αi)=2 except (αn,αn)=1 in type Bn, so φ preserves norms of basis vectors; adjacent simple roots with all labels 3 satisfy (αi,αj)/(∣αi∣∣αj∣)=−1/2=B(ei,ej), the Bn edge of label 4 satisfies (αn−1,αn)/(∣αn−1∣∣αn∣)=−1/2=B(en−1,en), and non-adjacent pairs are orthogonal, so B(ei,ej)=(φei,φej) for all i,j the normalized simple roots form a basis of E, so φ is invertible and is an isometry of bilinear forms [F2, F1]. Consequently for a∈V with B(a,a)=1 and y=φv one has φraφ−1(y)=φ(v−2B(v,a)a)=y−2(y,φa)φa=sφa(y), so conjugation by φ carries the reflection with normal a to the reflection with normal φa; applied to a=ei this gives φρ(si)φ−1=sαi. Hence ψ:=φρφ−1:W→GL(E) is a homomorphism (a conjugate of the homomorphism ρ) with ψ(si)=sαi, and ψ(c)=ψ(a)ψ(b) is the product of the two colour-class reflection products in the model. Since listing the two classes in the other order replaces c by a conjugate element [F3], characteristic polynomials and orders computed for one listing apply to c in either convention.

1.2F4F5F7

(I2(m).) Here the model is V itself, c=s1s2 is the product A of the two simple reflections, and [F4] gives trace 2cos⁡(2π/m), determinant 1 and exact order m. For a 2×2 matrix the characteristic polynomial is X2−tr⁡(A)X+det⁡(A), as one sees by expanding det⁡(XI−A) [F5], so det⁡(X−ρ(c))=X2−2cos⁡(2π/m)X+1. Since exp⁡(2πi/m)=cos⁡(2π/m)+isin⁡(2π/m) and exp⁡(−2πi/m)=cos⁡(2π/m)−isin⁡(2π/m) by [F7], the two numbers exp⁡(±2πi/m) have sum 2cos⁡(2π/m) and modulus one, so (X−exp⁡(2πi/m))(X−exp⁡(−2πi/m))=X2−2cos⁡(2π/m)X+1 and the eigenvalues are exp⁡(2πi/m) and exp⁡(−2πi/m). Moreover exp⁡(−2πi/m)=exp⁡(2πi(m−1)/m): indeed exp⁡(2πi(m−1)/m)=exp⁡(2πi)exp⁡(−2πi/m) and exp⁡(2πi)=exp⁡(iπ)exp⁡(iπ)=(−1)2=1 by multiplicativity and eiπ+1=0 [F7]. Hence the spectral exponents are 1 and m−1, with h=m.

2.1F8F5step 1.1

(An.) The model reflection sαi acts on E by the transposition (i i+1) of coordinates: for x∈E, sαi(x)=x−(xi−xi+1)(εi−εi+1) swaps the i-th and (i+1)-st coordinates and fixes the others. For n=1, c=s1 acts on the line E=R(ε1−ε2) as −id, so det⁡(X−ψ(c))=X+1=X1+⋯+1, the order is 2, and the spectral exponent is 1 [F1, F2, step 1.1]. For n≥2 write O=∏i odd(i i+1) and E0=∏i even(i i+1) for the two colour-class products on the coordinates 1,…,n+1; they are products of pairwise disjoint transpositions, so each product has commuting factors, and ψ(c)=OE0 (the reverse product is conjugate because O2=1). On basis vectors, using the four cases: E0ε1=ε1 and Oε1=ε2, so 1→2; for even 2≤j≤n−1 one has E0εj=εj+1 and Oεj+1=εj+2, so j→j+2; for even j=n (only when n is even) E0εn=εn+1 and Oεn+1=εn+1, so n→n+1; for even j=n+1 (only when n is odd), E0εn+1=εn+1 and Oεn+1=εn, so n+1→n; for odd j≥3 one has E0εj=εj−1 and Oεj−1=εj−2, so j→j−2. Tracing these rules gives the single cycle 1→2→4→6→⋯→[ largest even≤n+1 ]→[ largest odd≤n+1 ]→⋯→5→3→1 on the coordinates [F9]. In the basis (ε1,ε2,ε4,… ) ordered along this cycle, the matrix of the cycle has X on the diagonal, −1 on the subdiagonal and −1 in the top-right corner; in the Leibniz sum for det⁡(XI−M) the only nonzero terms are the identity permutation, contributing XN, and the N-cycle (1 N N−1 ⋯ 2), of sign (−1)N−1 and entry product (−1)N, contributing −1; hence the characteristic polynomial is XN−1 with N=n+1 [F5]. The full coordinate space decomposes as the invariant direct sum EC⊕C(1,…,1), and the second summand is fixed, so on the n-dimensional space E the operator ψ(c) has characteristic polynomial (Xn+1−1)/(X−1)=Xn+Xn−1+⋯+1; by [F8] its eigenvalues are the n numbers exp⁡(2πik/(n+1)), k=1,…,n, each once. The restricted spectrum includes the primitive (n+1)-st root exp⁡(2πi/(n+1)), so the order of ψ(c)∣E is divisible by n+1; the full cycle has order n+1, so the restricted order is exactly n+1. Thus the spectral exponents are 1,2,…,n with h=n+1.

2.2F8F5step 1.1

(Bn.) Here αn=εn and the model reflections are si=(i i+1) for i<n and sn negating the n-th coordinate. Let O=∏i odd≤nsi and E0=∏i even≤nsi be the two colour-class products of the path 1−2−⋯−n and let ψ(c)=OE0. Direct composition on basis vectors gives, uniformly in the parity of n: c(ε1)=ε2; c(εj)=εj+2 for even j≤n−2; c(εn−1)=−εn and c(εn)=εn−2 when n is odd; c(εn)=−εn−1 when n is even; and c(εj)=εj−2 for odd j≥3. For example, once the chain of even indices reaches the last coordinates the sign from sn appears and the negative coordinates are traversed in reverse: for n=4, ε1↦ε2↦ε4↦−ε3↦−ε1; for n=5, ε1↦ε2↦ε4↦−ε5↦−ε3↦−ε1. Consequently the orbit of ε1 under c consists of the 2n vectors ±ε1,…,±εn, each exactly once: its first n elements f0:=ε1,f1:=cε1,…,fn−1:=cn−1ε1 are ±εj with pairwise distinct j (for n=2: ε1,ε2; n=3: ε1,ε2,−ε3; n=4: ε1,ε2,ε4,−ε3; n=5: ε1,ε2,ε4,−ε5,−ε3), hence a basis, and cnε1=−ε1. In this basis cfi=fi+1 (i<n−1) and cfn−1=−f0, so the matrix of c has X on the diagonal, −1 on the subdiagonal and +1 in the top-right corner of XI−M; as in 2.1 the only nonzero Leibniz terms give det⁡(XI−M)=Xn+1 [F5]. Since cn commutes with c and cnε1=−ε1, it sends each basis vector fj=cjε1 to −fj, so cn=−id on E and c2n=id. The orbit of ε1 already contains the 2n distinct signed coordinate vectors, so the order of c is exactly 2n. By [F8] applied to z=−1 the eigenvalues are the numbers exp⁡(i(π+2πk)/n)=exp⁡(2πi(2k+1)/(2n)), k=0,…,n−1: the spectral exponents are the odd residues 1,3,…,2n−1 with h=2n.

2.3F8F5step 1.1

(Dn.) Here αi=εi−εi+1 for i≤n−1 and αn=εn−1+εn; the simple reflections si for i<n swap coordinates i,i+1, while sn sends εn−1↦−εn and εn↦−εn−1. The branch node is n−2. Choose the color class containing the branch node as J and use c=ab with J first; reversing the classes conjugates the product by [F3]. If n is even, J={2,4,…,n−2} and K={1,3,…,n−3,n−1,n}; applying the commuting reflections in b and then a gives c(ε1)=ε3, c(εj)=εj+2 for odd 3≤j≤n−3, c(εn−1)=−εn−2, c(εj)=εj−2 for even 4≤j≤n−2, c(ε2)=ε1, and c(εn)=−εn. If n is odd, J={1,3,…,n−2} and K={2,4,…,n−3,n−1,n}; the same reflection formula gives c(ε1)=ε2, c(εj)=εj+2 for even 2≤j≤n−3, c(εn−1)=−εn−2, c(εj)=εj−2 for odd 3≤j≤n−2, and c(εn)=−εn. The formulas show that, on E′:=span(ε1,…,εn−1), the first m:=n−1 iterates of ε1 are a signed coordinate basis: for even n they are ε1,ε3,…,εn−1,−εn−2,−εn−4,…,−ε2, and for odd n they are ε1,ε2,ε4,…,εn−1,−εn−2,−εn−4,…,−ε3. In this basis c advances each vector to the next and sends the last to −ε1, so the companion determinant computation of 2.2 gives det⁡(XI−c∣E′)=Xm+1 and cmε1=−ε1. Since cm commutes with c, it is −id on the orbit basis of E′, so the orbit of ε1 and its negatives contains the 2m distinct signed basis vectors and the order on E′ is exactly 2m; the remaining coordinate line has eigenvalue −1, so the full order is lcm⁡(2m,2)=2m=2n−2. Thus det⁡(XI−ψ(c))=(Xn−1+1)(X+1). By [F8], the roots of Xm+1 are exp⁡(2πi(2k+1)/(2m)) for k=0,…,m−1, and the extra root −1 is exp⁡(2πim/(2m)); the spectral exponents are 1,3,…,2n−3 and one additional n−1 (counted again when n is even), with h=2n−2.

3.1F2F3F4F6F8step 1.2step 2.1step 2.2step 2.3∎

The map ψ=φρφ−1 is conjugate to ρ, and complexification preserves characteristic polynomials and operator orders, so steps 1.2-2.3 compute det⁡(X−ρC(c)) and its order for the four types. Since ρC is faithful by [F2], this operator order equals the order of c in W, which is the Coxeter number h 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 ρC(c) has finite order because W is finite, so it is diagonalisable by [F6] over C; 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 h=max⁡i(di), which is proved only by the final determination theorem of this page.

Depends on

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