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 six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices
Statement
Let be one of the six labelled diagrams all edges labelled except the single edges of labelled and of labelled ; let be the corresponding irreducible Coxeter system (Coxeter diagrams: edges, labels, components and finite type, Classification of finite Coxeter systems, including the H and dihedral families (1), Finiteness criterion: W is finite exactly when the Coxeter form is positive definite); let with , the canonical reflection representation, and 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 with the colour classes of the tree and the recorded application orders Then has exact order and characteristic polynomial as follows, with spectral exponents defined by the eigenvalues :
where , , embedded in for by . In each case and each polynomial divides ; the matrices themselves (in the simple-root basis, with entries in , or ) are recorded case by case in the proof, and the F4 characteristic polynomial is rational so no embedding of into is used.
Facts & Assumptions
Given: One of the six labelled diagrams of the statement with its Coxeter system , the space with Coxeter form , the canonical reflection representation , the bipartite Coxeter element and the recorded application orders, and the exact certificate file research/coxeter-scaffold/math-checks/finite-degree-poincare-certificates.json (generator finite-degree-poincare.py), whose records for the six types contain the matrices of the dual action and the same characteristic polynomials.
and for ; for with the reflection is linear, involutive, fixes pointwise and preserves ; the canonical homomorphism satisfies and is faithful, every root has -norm one, and (The real Coxeter form, its radical, reflections, and form-preserving maps (2),(3), Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (1)-(2), The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections (2)-(4), Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1)).
The Coxeter diagram of an irreducible finite type is a tree with bipartition ; the colour-class products , their product and are well defined and listing the classes in the other order replaces by a conjugate element, so order and characteristic polynomial are unaffected; the Coxeter plane is -invariant with a rotation by ; the prefix roots enumerate with , and is invertible (The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1)-(4), The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (2)-(4)).
The six diagrams of the statement are the standard diagrams of the classification, and for each of them is positive definite, so is finite (Classification of finite Coxeter systems, including the H and dihedral families (1),(3), Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)-(2), Coxeter diagrams: edges, labels, components and finite type (1)-(2)).
Trigonometric and square-root facts: (The finite Viete cosine product and its positive nested-radical factors); for all real , , , , , , (Double-angle and quadratic power-reduction identities, The addition formulas for sine and cosine, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions, Parity and the Pythagorean identity for sine and cosine); and cosine is strictly decreasing on (Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine); and (Product-to-sum and sum-to-product identities); every has a unique with (Square roots exist: a unique with ; the positives are ) and implies (Squaring is monotone on the nonnegatives); sine and cosine are the power-series functions of Sine and cosine defined by their real power series.
For : is the characteristic polynomial, whose coefficients are the determinants of the expansion of (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); is the sum of the diagonal entries (The trace of a square matrix over a commutative ring); linearity follows termwise, and , which also gives cyclicity for longer products; (For every positive-sized square matrix over a commutative ring, , Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring); for the formal derivative (); the formal derivative of polynomials is linear, satisfies the product rule and has (The formal derivative of a polynomial, Linearity, power rule, Leibniz rule and the degree bound for the formal derivative). 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.
Cyclotomic and root-of-unity facts: the satisfy and (The cyclotomic polynomials , defined by ); over the roots of are exactly the primitive -th roots of unity and the -th roots of unity are the distinct numbers , (Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity, The -th roots of a complex number and the distinct roots of unity for every , The group of -th roots of unity in a field, and primitive -th roots of unity, The complex numbers as , with the real embedding and imaginary unit ); (Euler's formula: for every real ); a finite-order operator on a finite-dimensional complex vector space is diagonalisable (Over an algebraically closed field of characteristic , every element of finite order acts diagonalisably in a finite-dimensional representation), and the finite induction principle is The principle of mathematical induction with The natural numbers (von Neumann).
Complexifying the real representation gives on with the same operator matrices and characteristic polynomials in the basis ; the eigenvalues of a real matrix acting on are the roots of its characteristic polynomial (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1), For , the characteristic polynomial is when , with for the unique matrix).
Proof
(The trigonometric constants behind the edge labels.) Put . Since and cosine is strictly decreasing on with , we have ; the supplementary and double-angle identities give , so , that is , and forces . Next put . Since we have , and with gives via the addition, double-angle and Pythagorean identities while ; hence , that is , and leaves . Completing the square, , and with (here is the unique nonnegative square root of and because is a nonzero square), so by uniqueness of nonnegative square roots and ; since by monotonicity of squaring on and , the root is negative while , so . Define and ; then gives and , while ; finally the double-angle identity gives , so .
(The six matrices.) For let be the matrix of in the basis : , so the -th column of is , and in particular the only nonzero off-diagonal entries of lie in row . Order the reflections as in the recorded application order and let be the matrix obtained by applying first and then successively to a vector; equivalently is the matrix of for , the product of the two colour-class products in the order then (the classes commute internally), which is one of the two admissible orders of the bipartite definition and is conjugate to the element of [F2] since . With , , from 1.1, so that takes the values , (which we write with the symbol ), , the resulting matrices are with in the F4 matrix and in the H3 and H4 matrices; the entries lie in , or , and is obtained from these entries over through the embeddings , . Since each preserves and is an involution [F1], each satisfies for the Gram matrix , and so does the product ; in particular has finite order because is finite [F3] and is a homomorphism, and is the matrix of a Coxeter element of the type.
(Newton's identities from the cofactor identity.) Let be any of the six matrices of step 2.1 and write the expansion with , so that . Put and for . Then for every , Indeed the entries of are cofactors of , hence determinants of matrices whose entries are affine in , so with ; the adjugate identity gives, on comparing coefficients of for , the recursion and for (the coefficient of only records and is not used); induction on gives for . Differentiating the adjugate identity gives by [F5]; the left side is and the right side , so comparing coefficients of for gives . Taking traces in the displayed expansion of and using linearity, cyclicity and gives ; substituting and multiplying by yields , which is the displayed identity with replaced by .
(Traces and characteristic polynomials of the six matrices.) Computing the powers by exact matrix multiplication of the matrices of step 2.1 gives the following power sums, with in the F4 case and in the H3, H4 cases: (For instance the E6 matrix has diagonal entries , whose sum is ; the higher power sums are the same finite computation.) Applying the Newton identities of step 3.1 successively for determines the coefficients in the order alone, and gives: where each coefficient is obtained from the displayed Newton identity by the finite exact arithmetic in , or , using for the H3 and H4 cases.
(Cyclotomic factorisations, E6, E7, E8, F4.) The computable cyclotomic polynomials are , , , and ; expanding the products coefficientwise gives , and , so by step 4.1 the E6, E7, E8 and F4 characteristic polynomials equal respectively , , and . Since is the matrix of the finite-order operator [F7], is diagonalisable and its eigenvalue multiset is the root multiset of its characteristic polynomial; by [F6] the roots of are the primitive -th roots of unity, namely with for , for , for , with for , and with for . Hence the eigenvalue multisets are for E6, for E7, for E8 and for F4; in particular each characteristic polynomial divides the corresponding (because when ), and in each case is a root, so the order of is a multiple of ; since every eigenvalue is an -th root of unity and is diagonalisable, , so the order of is exactly the displayed integer . Faithfulness from [F7] implies if and only if , hence this is also the group order of used in [F2].
(H3 and H4.) For H3 the right side of step 4.1 expands as ; by [F6] the roots of are the two complex numbers with sum and product , and and have sum and product , so they are the roots; with and the eigenvalue multiset of is . For H4 the four numbers lie in inverse pairs, so the monic quartic with these roots is with and ; then and , using the product-to-sum and sum-to-product identities, , , and ; hence the monic quartic with roots equals , because and ; this is exactly the H4 polynomial computed in step 4.1, so the eigenvalue multiset of is , and the relation is the embedding recorded in the statement (for H3 the corresponding relation is ). In both cases all eigenvalues are -th roots of unity, is diagonalisable and occurs among them, so the order of is exactly the displayed integer (the same argument as in 5.1); faithfulness from [F7] again identifies it with . Finally the displayed residue lists have sums for , which are exactly and hence equal by [F2].
(Summary and conventions.) Steps 1.1-5.2 prove all assertions of the statement: for each of the six types the displayed matrix is the matrix of a Coxeter element of that type in the simple-root basis over , or , its characteristic polynomial is computed from the exact power sums by Newton's identities and equals the displayed polynomial, the cyclotomic and quadratic factorisations identify the eigenvalue multisets with the displayed residue lists, each polynomial divides and has as a root, the orders are exactly , and the residue sums equal . The computation uses no floating-point approximation, no enumeration of a Coxeter group and no invariant-degree table; the F4 characteristic polynomial is rational, so no embedding of into is used; the element whose matrix is displayed is the product of the colour-class products in the recorded order, conjugate to the element of the bipartite definition [F2], so the conclusions hold for as well; and the dual-action matrices in the local certificate research/coxeter-scaffold/math-checks/finite-degree-poincare-certificates.json are , not . Indeed the dual of each involutive reflection has matrix , and the same application order gives . From we obtain ; hence its characteristic polynomial agrees with that of .
Depends on
- Over an algebraically closed field of characteristic $0$, every element of finite order acts diagonalisably in a finite-dimensional representation
- Parity and the Pythagorean identity for sine and cosine
- The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a
- The canonical reflection homomorphism, roots, reflections, and the positive cone
- Coxeter diagrams: edges, labels, components and finite type
- The real Coxeter form, its radical, reflections, and form-preserving maps
- 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
- The complex numbers as $\mathbb R[x]/(x^2+1)$, with the real embedding and imaginary unit $i$
- The cyclotomic polynomials $\Phi_n\in\mathbb Z[t]$, defined by $\prod_{d\mid n}\Phi_d=t^{n}-1$
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- The formal derivative of a polynomial
- Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring
- The natural numbers $\mathbb{N}$ (von Neumann)
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- Sine and cosine defined by their real power series
- The trace of a square matrix over a commutative ring
- Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers
- Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order
- Descent of the reflection representation, unit root norms, and conjugation of reflections
- The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id
- $\frac{d}{dx}\det(I-xA)=-\operatorname{tr}(\operatorname{adj}(I-xA)A)$
- Squaring is monotone on the nonnegatives
- The finite Viete cosine product and its positive nested-radical factors
- Linearity, power rule, Leibniz rule and the degree bound for the formal derivative
- For every positive-sized square matrix over a commutative ring, $A\operatorname{adj}(A)=\operatorname{adj}(A)A=\det(A)I$
- Classification of finite Coxeter systems, including the H and dihedral families
- Finiteness criterion: W is finite exactly when the Coxeter form is positive definite
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- The $n$-th roots of a complex number and the $n$ distinct roots of unity for every $n\ge1$
- Double-angle and quadratic power-reduction identities
- Euler's formula: $\exp(i\theta)=\cos\theta+i\sin\theta$ for every real $\theta$
- The principle of mathematical induction
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- Product-to-sum and sum-to-product identities
- Quarter-turn values and shifts by pi/2 and pi
- The addition formulas for sine and cosine
- Signs, monotonicity intervals, and ranges of sine and cosine
- Over a field whose characteristic does not divide $n$, the roots of $\Phi_n$ are exactly the primitive roots of unity
- 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
- The exceptional spectra for E₆ and H₃ computed exactly: characteristic polynomials, cyclotomic factorisations and the resulting degree tables Example
- Exceptional parabolic-orbit length certificates for E6, E7, E8, F4, H3 and H4 Lemma
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types Theorem
Dependency tree · two levels
227 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)