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.
Finite Coxeter Invariants and Coinvariant Gradings
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Adjunctions Units and Counits
- Affine Algebraic Sets and Coordinate Rings
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Associated Primes and Primary Decomposition
- Binary Operations, Monoids, Groups and Subgroups
- Bipartite Coxeter Elements and Ordered Root Complexes
- Canonical Roots, Signs, and Faithful Reflections
- Cardinal Arithmetic, Cofinality and the Alephs
- Cartan Subalgebras and Root Space Decompositions
- Categories, Functors and Natural Transformations
- Chain Complexes and Homology
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Chain Homotopy and the Homotopy Category
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complexification, Realification and Real Structures
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Connectedness
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Coxeter Presentations, Exchange, and Reduced Word Theorems
- Cyclic Groups and Direct Products
- Delta Functors and Universality
- Depth and Cohen Macaulay Modules
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Exactness and the Member Calculus
- Ext and Balanced Resolutions
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Coxeter Diagrams and Complete Classification
- Finite Fields and Cyclotomic Extensions
- Finite Reflection Arrangements and Spherical Coxeter Complexes
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fundamental Trigonometric Identities
- Further Trigonometric Identities and Inverse Functions
- Graphs, Walks and Connectivity
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Koszul Complexes and Regular Sequences
- Krull Dimension and Height Theorems
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Recurrences and Rational Generating Functions
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Localisation of Modules and Support
- Long Exact Sequences in Homology
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Prime Spectra and Radicals
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Real Forms and Reflection Geometry
- Rees Modules Artin Rees and Hilbert Samuel Theory
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Simplicial Complexes and Simplicial Homology
- Sine, Cosine, and the Definition of Pi
- Solvable and Nilpotent Lie Algebras
- Splitting Fields
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Field of Fractions and Localisation
- The Fundamental Theorem of Finite Abelian Groups
- The Group Algebra and Representations of Finite Groups
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Tits Cones, Chambers, and Parabolic Stabilizers
- Topological Spaces and Continuity
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Universal Properties, Representables and the Yoneda Lemma
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Zariski Tangent Spaces, Regular Points, Smoothness, and Bertini
2 · Summary
This page applies finite complex reflection invariant theory to finite Coxeter groups, including noncrystallographic types. It proves the representation hypotheses needed by the published invariant-theory results, then develops the Coxeter-specific links among basic degrees, coinvariants, discriminants and Coxeter spectra.
The construction begins with Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers and Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system. The definition’s well-definedness is established by The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity, which proves multiset independence, the invariant and coinvariant Hilbert series, the degree product, and Molien’s identity. Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian proves the invariant Jacobian is nonzero by an explicit characteristic-zero argument.
The discriminant branch continues with The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class, which proves the total exponent sum, the Jacobian-discriminant identity, the anti-invariant description, and the one-dimensional top sign class. The spectral branch is proved from reflection models and exact matrices: 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 handles the classical types, while The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices gives the exceptional certificates. A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types brings the Coxeter-plane eigenvector, the discriminant degree and both spectrum lists together to identify all basic degrees, including reducible and low-rank cases.
Prerequisites and reading
Required earlier pages: bipartite-coxeter-elements-and-ordered-root-complexes, finite-coxeter-diagrams-and-complete-classification, finite-weyl-invariants-bruhat-and-kostant-harmonics, and relations-functions-and-quotients. The published complexification-realification-and-real-structures supplies scalar extension of the reflection representation. The remaining prerequisite pages provide root-system, polynomial-algebra and invariant-theory background. The companion finite-coxeter-invariants-and-coinvariant-gradings-examples applies these results and is a dependency leaf.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers
Statement
Let be a Coxeter system of finite type with finite, , and let carry the Coxeter form , the canonical reflection representation , the root system , the reflection set , the chamber and the conventions of Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Coxeter diagrams: edges, labels, components and finite type, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, The dual action, chambers, faces, and root hyperplanes and Root sign coherence and the action of simple reflections on positive roots; every root has -norm one and is faithful (Descent of the reflection representation, unit root norms, and conjugation of reflections (3), The root-length criterion and faithfulness of the canonical reflection representation (3)), while is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite). Form the complexification (Complexification as with its canonical real-linear embedding), the -bilinear extension of characterized by , the complexified map (Complexification of a real-linear map) and the linear forms for (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism fixes the eigenspace language).
(1) Complexification. , the classes form a -basis, is a homomorphism that is faithful in the sense of Intertwiners, the spaces and , equivalent representations, and faithful representations, and is a finite subgroup of of order .
(2) Complex reflections. For every , written with its positive root (The inversion formula , the root-reflection dictionary and strong exchange (1)), the operator is not the identity, its fixed space is the complex hyperplane , and has image the line ; that is, is a complex reflection. In particular every generator is a complex reflection and is generated by complex reflections.
(3) Essentiality. , and every -invariant linear form on is zero.
(4) Application under AC. Assume the Axiom of Choice. Then the conclusions of Chevalley shephard todd for finite weyl groups apply to the faithful finite subgroup generated by complex reflections: the invariant algebra is a polynomial -algebra on homogeneous algebraically independent basic invariants, and is a graded free -module of rank ; moreover every minimal homogeneous invariant generating family of the ideal generates and is algebraically independent (Finite reflection invariant generators are algebraically independent, Reflection basic invariants form a regular sequence), and the coinvariant quotient satisfies the Hilbert-series and order conclusions of Weyl coinvariant hilbert series has order w dimension and Finite linear invariant and coinvariant polynomial algebras.
(5) Conventions and abstentions. For (trivial group, ) all assertions are the empty ones. No irreducibility, crystallographic integrality or highest-root data is assumed: the statement covers the noncrystallographic types , , and reducible systems equally, since only the real reflection geometry and complexification are used. Nothing is asserted here about eigenvalues of the Coxeter element, about degrees beyond their existence, or about the coinvariant algebra as a -representation; those are later items. (4) is the only clause using Choice.
Facts & Assumptions
Given: A Coxeter system of finite type with finite, the space with its Coxeter form , the canonical reflection representation , the root system and the reflection set .
The Coxeter form satisfies and for finite , the reflection formula is , and is linear, involutive, fixes pointwise, and preserves ; is a hyperplane when (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 is the unique homomorphism with , the root system is , and (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).
preserves , every root has , and for all , ; moreover is injective (Descent of the reflection representation, unit root norms, and conjugation of reflections (2)-(4), The root-length criterion and faithfulness of the canonical reflection representation (3)).
If is finite then is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite (1)).
The map , , is a bijection, and (The inversion formula , the root-reflection dictionary and strong exchange (1)).
The complexification carries the scalar action and the embedding (Complexification as with its canonical real-linear embedding). The tensor universal property induces a linear map from any balanced bilinear map (Universal property of the tensor product for balanced maps into abelian groups).
For a real-linear the complexification is -linear with (Complexification of a real-linear map).
is the eigenspace of , and a representation is faithful when implies (Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism, Intertwiners, the spaces and , equivalent representations, and faithful representations).
For a finite the invariant algebra is , and defines the coinvariant algebra (Finite linear invariant and coinvariant polynomial algebras).
The Axiom of Choice is the statement that every family of nonempty sets has a choice function (The Axiom of Choice).
Assume AC. For a finite complex reflection group : is a polynomial algebra on homogeneous algebraically independent basic invariants and is free of rank over ; every minimal homogeneous invariant generating family of generates and is algebraically independent; these generators form an -regular sequence and homogeneous lifts of a homogeneous basis of form a graded free -basis; and , (Chevalley shephard todd for finite weyl groups, Finite reflection invariant generators are algebraically independent, Reflection basic invariants form a regular sequence, Weyl coinvariant hilbert series has order w dimension).
Proof
Every elementary tensor expands as , so the classes span. For each , the balanced map induces by [F6] a map ; it is complex-linear on elementary tensors and satisfies . Applying to a linear relation proves independence. Thus these classes form a -basis and . For set . By [F7] each is -linear with ; on elementary tensors , and since elementary tensors span this gives , while ; so is a homomorphism. If , then for every the basis element is fixed, so , and linear independence of the gives ; as spans , , and injectivity of [F3] gives . Hence is faithful in the sense of [F8], and its image, the image of the finite group , is a finite subgroup of of order .
Let . By [F1], and for all ; equivalently has image and kernel , a hyperplane of . Complexifying with [F7], for we get , using ; the same formula holds on all of by linearity. The image is therefore the line (it contains ) and the kernel is , a complex hyperplane because makes the linear form nonzero. In particular fixes that hyperplane pointwise: each generator is a complex reflection, and is generated by complex reflections.
Let . By [F5] there is a unique with and ; by [F3] every root has -norm one, so for , and fixes pointwise and maps . Complexifying as in 2.1 gives for all , so the image is the line and, since , the kernel is a complex hyperplane. Thus every acts as a complex reflection, and by [F2] and [F3] every element of is conjugate in to a simple reflection, in agreement with 2.1.
Let be fixed by every . Fixing under and applying the formula of 2.1 gives , hence for every . Let be the Gram matrix of in the basis ; by [F4] is positive definite, so is a real symmetric positive definite matrix, and for all says for the coefficient column . Writing with real columns , the real part of vanishes, and both summands are with equality only for ; hence and . So . If is a -invariant linear form, then by 2.1, so for every , and since the span over , . These finite-dimensional calculations use no choice principle: the basis , the Gram matrix and the coefficient column are explicitly given by the finite set .
Assume AC. By step 1.1 the subgroup is finite of order , faithful and, by steps 2.1 and 3.1, generated by complex reflections; has dimension . Applying [F11] with and gives that is a polynomial -algebra on homogeneous algebraically independent basic invariants, that is graded free of rank over , that every minimal homogeneous invariant generating family of generates and is algebraically independent, that such generators form a regular sequence with the freeness conclusion, and the stated Hilbert-series and order conclusions for ; by [F9] this is exactly the positive-degree ideal of the coinvariant algebra of the definition. This is the only place where AC is used.
For the group is trivial, , the basis family is empty, is the unique map of the trivial groups, and all products and families displayed in (4) are empty; every assertion above holds in this empty form. Nothing in steps 1.1-4.1 uses irreducibility of the diagram, crystallographic integrality, or highest-root data: only the finiteness of , the positivity of , the bijection and the reflection formula are used, so reducible systems and the noncrystallographic types , , are covered. No claim is made here about eigenvalues of a Coxeter element, about the values of the degrees, or about as a -representation; and the only clause depending on AC is (4), consumed through [F11].
Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system
Definition
Let be a Coxeter system of finite type with , and let , , , , and be as in Finite linear invariant and coinvariant polynomial algebras and Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers; fix coordinates so that as the iterated polynomial ring of Polynomial rings in finitely many commuting indeterminates by iteration, with the graded structure of Nonnegatively graded rings and modules, homogeneous elements, and twists.
(1) Existence of a basic family. Assume the Axiom of Choice. A minimal finite family of homogeneous positive-degree invariants generating the ideal exists, generates as a -algebra, and is algebraically independent (Finite reflection invariant generators are algebraically independent); under the stated AC any such minimal family has exactly elements (Chevalley shephard todd for finite weyl groups, Reflection basic invariants form a regular sequence).
(2) Degrees and exponents. Fix one such family and call arranged in nondecreasing order . Each is a positive integer, and in fact : a degree-one invariant would be a nonzero -invariant linear form, excluded by Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (3).
(3) The graded coinvariant algebra. The coinvariant algebra of is the graded quotient with (constants survive because has positive degree), as in Finite linear invariant and coinvariant polynomial algebras. Its Hilbert series is written .
(4) Well-definedness warning. This definition asserts nothing about the multiset being independent of the chosen family, nothing about or , and no relation between the and the reflection geometry; all of that is the content of the justifier The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity ↗.
(5) Conventions. For the group is trivial, , , and the families and products are empty. For reducible the family in (2) is the concatenation of the families of the connected components, and is generated by all components' positive-degree invariants. No crystallographic or integrality assumption is made.
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.
The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity
Statement
Assume the Axiom of Choice. Let be a Coxeter system of finite type, , and let , , , , , and a fixed basic family with degrees and exponents be as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system (so is a minimal homogeneous generating family of , generates , is algebraically independent, and gives a graded isomorphism , , with ).
(1) Multiset independence. If is any other minimal homogeneous generating family of with degrees , then as multisets. Hence the nondecreasing degree sequence , the exponents and the degree count are invariants of the pair .
(2) Hilbert series. and as formal power series (The Hilbert function and formal Hilbert series of a graded module with finite-length pieces).
(3) Order formula. , and is the top degree of .
(4) Molien identity. as formal power series, the determinants expanded as finite products over the eigenvalues of on .
(5) Conventions. For all products are empty and equal , and . For reducible the degree multiset is the concatenation of the components' multisets (this is used, with its own argument, in the final determination theorem). All statements are under the stated AC.
Facts & Assumptions
Given: The Axiom of Choice, a Coxeter system of finite type, and a basic family as in the statement.
is a minimal finite family of homogeneous positive-degree invariants generating , it generates as a -algebra and is algebraically independent; under AC any minimal such family has exactly elements, and every (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, Finite reflection invariant generators are algebraically independent).
The complexification is a finite subgroup of order , generated by complex reflections, faithful, and (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers).
Assume AC. For the finite complex reflection group : is a polynomial algebra and is graded free of rank over it; minimal homogeneous invariant generators of form an -regular sequence with common zero set ; and , (Chevalley shephard todd for finite weyl groups, Reflection basic invariants form a regular sequence, Weyl coinvariant hilbert series has order w dimension).
The Reynolds operator is a graded -linear projection of onto , and it preserves each finite-dimensional graded piece ; and the coinvariant algebra carry their quotient gradings (Finite linear invariant and coinvariant polynomial algebras).
The Hilbert function of a graded module is of its -th piece when the pieces are finite-dimensional, and its formal Hilbert series is ; products and divisions below are manipulations of formal power series with constant term one (The Hilbert function and formal Hilbert series of a graded module with finite-length pieces, Nonnegatively graded rings and modules, homogeneous elements, and twists).
An operator of finite order 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). 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.
If has connected components on , then via multiplication, and is a -orthogonal direct sum on which preserves and fixes every , (Disconnected diagrams, direct products, and comparison of invariant forms (1),(2)); for finite type each component is one of the classified finite diagrams and is finite exactly when every component is (Classification of finite Coxeter systems, including the H and dihedral families (2), Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups).
is the iterated polynomial ring over , so polynomials may be expanded and compared blockwise in finitely many variables, and the monomials of one block are linearly independent over the polynomial ring of the remaining blocks (Polynomial rings in finitely many commuting indeterminates by iteration).
Proof
Put . For any finite minimal homogeneous generating family of , its classes span the graded complex vector space : modulo , coefficients in an expression reduce to their constants. These classes are independent. Indeed, a nonzero homogeneous relation would give with some . Since the generate , its right side can be written with homogeneous of degree . Such vanish when , so solving for expresses it in the ideal generated by the other , contrary to minimality. Every relation splits into homogeneous ones, proving independence. Thus the number of degree- members in any such family is . Applying this to the fixed invariant family and to an arbitrary other minimal homogeneous family gives equality of degree multisets and family sizes. This proves (1) without assuming that the other generators are invariant; for the minimal family and quotient are empty.
For the fixed invariant basic family, [F1] gives the graded isomorphism with and . Counting its monomials gives . Positive weights make every coefficient finite, so the product is a formal-power-series identity. This algebra isomorphism is asserted only for the invariant basic family.
Since is homogeneous, and are graded with finite-dimensional pieces, so the Hilbert series of [F5] apply. By step 1.2, . Under the stated AC the group is a finite complex reflection group of order on the -dimensional space with invariant algebra and positive-degree ideal , so [F3] gives , and evaluating at gives ; since each factor is a polynomial of degree , the product is a polynomial of degree with leading coefficient , so is the top degree of .
Fix . By [F2] and [F6] the operator induced by on the finite-dimensional space is diagonalisable; let be its eigenvalues with multiplicity, and note that . The induced operator on () has, in the monomial basis attached to an eigenbasis of , the eigenvalues over all with ; summing gives the formal identity [F5]. The Reynolds operator is a projection of onto [F4], and for a projection the trace equals the dimension of its image, so ; summing over and using the previous identity gives , and combining with of 2.1 proves the Molien identity (4).
For the group is trivial, , , , and every displayed product is empty and equals , so all four clauses hold in this empty form [F1, F5]. Let now have finitely many connected components and suppose each is of finite type; by [F7] and with preserving and fixing the other summands. Choose coordinates adapted to this decomposition, so that with the coordinates of the -th summand [F8]. For and any , the Reynolds operator of acts only on the block and, because is -invariant, leaves it unchanged; expanding in the monomials of the remaining blocks and applying expresses as a finite sum of products of a -invariant polynomial in the block with a polynomial in the other blocks. Applying successively (each application leaves unchanged and replaces one block factor by its invariant part) gives : the invariant algebra is generated by the component invariant algebras [F4, F8]. If for each we fix a basic family of the component , then the concatenated family is homogeneous of positive degrees, generates , and is algebraically independent: generation follows from the preceding display, and a polynomial relation among the concatenated family, expanded in the block monomials and using the algebraic independence of each component's family, forces every coefficient polynomial to vanish [F1, F8]. The concatenation generates because its members generate and have positive degrees. It is also minimal as an -ideal generating family: any redundancy, after Reynolds averaging its coefficients [F4], would express one member as an -linear combination of the others. Substituting their polynomial expressions in the algebraically independent family and setting all the other variables to zero would give the impossible identity in . Thus the concatenation is a basic family of the reducible system, and its degree multiset is the concatenation of the components' multisets; by the multiset independence of 1.1 this is the degree multiset of every basic family of the reducible system. All statements above are under the stated AC, which enters only through the existence of the -element basic families and the AC-scoped suppliers [F1, F3]; the series comparison, the trace computation and the componentwise argument are finite and choice-free.
Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian
Statement
Assume the Axiom of Choice. Let be a Coxeter system of finite type, , with , and a fixed basic family of degrees , generating the ideal , algebraically independent and generating , as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system; choose -coordinates on (Polynomial rings in finitely many commuting indeterminates by iteration) and let and be the formal partial derivatives and the Jacobian matrix of Equation rows and coordinate columns in an affine Jacobian. Put and (The field of fractions of an integral domain).
(1) Annihilating orbit polynomials. For each , the orbit polynomial is monic of degree , its coefficients lie in , and . Hence every is algebraic over in the sense of Algebraic and transcendental elements and algebraic extensions.
(2) Minimal polynomial and its derivative. For each let be the minimal polynomial of over (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element). Then ; is nonconstant; ; and .
(3) Differential bridge. For each there exist such that, for every , the identity holds in (with the Kronecker symbol; equivalently with over ). Consequently has rank over , and is a nonzero polynomial: the invariant Jacobian.
No étale-quotient, scheme-theoretic or transcendental Jacobian criterion is used.
Facts & Assumptions
Given: The Axiom of Choice, the finite type system with basic family , and coordinates on .
The fixed family is a minimal family of homogeneous positive-degree invariants generating , generates as a -algebra and is algebraically independent, so evaluation gives a graded -algebra isomorphism , , and every element of is a polynomial in the ; also (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, Finite reflection invariant generators are algebraically independent, Chevalley shephard todd for finite weyl groups).
is the complexified canonical representation with , and ; more precisely every -fixed linear form on is zero (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1),(3), The canonical reflection homomorphism, roots, reflections, and the positive cone).
The action makes a graded algebra on which acts by graded algebra automorphisms, with invariant algebra , positive-degree part and ; the degree-one part of is and the restricted action is the dual action, so a degree-one element of is -fixed exactly when it is an invariant linear form (Finite linear invariant and coinvariant polynomial algebras, Reflection basic invariants form a regular sequence).
is the iterated polynomial ring over , monomials form a basis, and is a domain with fraction field ; the subfield generated by is (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution, Polynomial rings in finitely many commuting indeterminates by iteration, The field of fractions of an integral domain). 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.
Algebraic elements and minimal polynomials: if with then is algebraic over ; the minimal polynomial is the unique monic irreducible element generating , and holds exactly when (Algebraic and transcendental elements and algebraic extensions, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
The formal partial derivatives are defined on monomials by the Leibniz monomial rule and extended -linearly, and the univariate formal derivative satisfies , , the product rule, and the degree bound when (Equation rows and coordinate columns in an affine Jacobian, The formal derivative of a polynomial, Linearity, power rule, Leibniz rule and the degree bound for the formal derivative).
The Axiom of Choice is used only to have an -element basic family as in [F1] (The Axiom of Choice).
Proof
Fix and form . For one has (the action is a left action), so permutes the linear factors and hence fixes ; as acts by graded algebra automorphisms [F3], each coefficient of lies in . By [F1] , so all coefficients lie in . The polynomial is monic of degree , being a product of monic linear factors, and because the factor with is . Hence is algebraic over in the sense of [F5].
The operators are -linear on and satisfy the product rule on monomials by the Leibniz monomial rule, hence on all polynomials by bilinearity; by induction the power rule holds for all , while . Consequently, for every polynomial and all , the chain rule holds: expanding , the product rule gives , which is the displayed identity because .
Suppose . Since acts on by algebra automorphisms it acts on the fraction field by , and this action fixes pointwise because the are invariant; hence for every . But is a degree-one element of [F3], so by [F2] the only -fixed linear form is , while is a coordinate function and : contradiction. So ; the minimal polynomial of over [F5] is therefore nonconstant. Its derivative is nonzero: the top coefficient of is nonzero and the degree is , so in characteristic zero the coefficient of is nonzero, and by [F6]. If , then the nonzero polynomial of degree would have as a root, contradicting the minimality of [F5]; hence in .
Fix and write with . Since [F4], choose with for all , and put . Then and , so in by 2.1. Differentiate the polynomial identity with respect to using the product and power rules of 1.2: hence in . Each is for a polynomial [F1], so the chain rule of 1.2 gives . Substituting, for all ; equivalently for the matrix . Hence is invertible over the field , so it has rank over , its determinant is nonzero in , and since is a domain with fraction field [F4] the polynomial is nonzero. For there is no assertion to make; the only choice principle used is the AC entering the existence of the basic family [F7], and no étale-quotient, scheme-theoretic or transcendental Jacobian criterion is invoked.
The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class
Statement
Assume the Axiom of Choice. Let be a finite-type Coxeter system with finite, , and let , its faithful real-matrix reflection representation , the positive roots , and the reflections be as in Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone and The inversion formula , the root-reflection dictionary and strong exchange. Put , , , and as in Finite linear invariant and coinvariant polynomial algebras. Fix a homogeneous basic family of degrees and exponents as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, let , and choose coordinates from a -orthonormal real basis of ; then every matrix is real orthogonal. Define
and let be the invariant Jacobian of Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian. Write . Then:
(1) Total degree. .
(2) The Jacobian is the discriminant. For every , . Each divides , and the are pairwise nonproportional. For some ,
(3) Anti-invariants. If , then . Each has a unique expression with .
(4) Top coinvariant class. The top degree of is , its component is one-dimensional, and is nonzero and spans it. The action on this line is .
(5) Conventions. For , is trivial, , , and the clauses hold with empty products and determinant. The product defining is independent of the order in which the fixed set is listed. Replacing the positive system by its opposite multiplies by . The polynomial is coordinate-free; changing orthonormal coordinates substitutes the corresponding orthogonal change into its coordinate expression, while the proportionality scalar in changes by the determinant of that basis change. These are conventions, not proof inputs. No claim is made that is the regular representation, that it is a Kostant harmonic space, or that it is flag-variety cohomology.
Facts & Assumptions
Given: The Axiom of Choice, a finite-type Coxeter system, a fixed basic family , and -orthonormal coordinates.
The complexified representation is faithful, finite, and generated by reflections; is positive definite and preserved by real matrices; each has fixed hyperplane , determinant , and unit root normal; and is a bijection (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers, The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order, Descent of the reflection representation, unit root norms, and conjugation of reflections, The inversion formula , the root-reflection dictionary and strong exchange, The root-length criterion and faithfulness of the canonical reflection representation, Finiteness criterion: W is finite exactly when the Coxeter form is positive definite).
The finite reflecting arrangement has chambers whose interiors have trivial point stabilizer; every nonzero vector lies in a unique open face , and a point of that face has stabilizer ; for , (The dual action, chambers, faces, and root hyperplanes, Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups, The finite chamber tiling, the face-stabiliser identification, and the spherical Coxeter complex as a triangulation of the sphere (1),(3)).
Under the stated Choice assumption, the invariant Hilbert series is , the coinvariant Hilbert series is , and the full normalized Molien identity is
as a formal series (The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity (2),(4), Weyl coinvariant hilbert series has order w dimension).
The invariant Jacobian is nonzero (Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian (3)); each is homogeneous of degree (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system).
Every finite-order complex linear operator is diagonalisable, and the determinant polynomial factors over its eigenvalues (Over an algebraically closed field of characteristic , every element of finite order acts diagonalisably in a finite-dimensional representation, For , the characteristic polynomial is when , with for the unique matrix).
is the iterated polynomial ring over (Polynomial rings in finitely many commuting indeterminates by iteration). Leading monomials show it is a domain. Taking a nonzero linear form as one coordinate identifies with a polynomial domain in variables, so is prime. Two linear forms are associates exactly when they are proportional: degree comparison forces any multiplier between them to be constant.
The polynomial action is the contragredient substitution action, invariants form the graded subalgebra , and is homogeneous (Finite linear invariant and coinvariant polynomial algebras, Nonnegatively graded rings and modules, homogeneous elements, and twists).
Formal partial derivatives obey the monomial rule and chain rule, and the Jacobian determinant is the determinant of the matrix of those partials (The formal derivative of a polynomial, Equation rows and coordinate columns in an affine Jacobian). Determinants satisfy (For same-sized finite square matrices over a commutative ring, ).
Complex conjugation and the linear-first inner-product convention are those of Real and imaginary parts, complex conjugation, and modulus and Real and complex inner product spaces, with the inner product linear in the first argument. The coefficient-factorial pairing used below is constructed in step 5.1.
Proof
If , then , , and every family and product is empty; all clauses follow. If , the Coxeter group is , and . For its single degree , [F3] gives . With , the left side is and the right side is ; comparing the and constant coefficients gives and . In rank one, write the unit positive-root form as with . Invariance under gives ; the degree-two basic generator is with , so , , and the anti-invariant polynomials are precisely the odd polynomials . The quotient has basis , so its top component is the nonzero sign line spanned by . This proves every clause for . In the rest of the proof assume .
For , let have fixed space of codimension one in . Because its matrix is real, the real and complex fixed spaces have the same codimension, so is a real hyperplane. If were not in the finite reflecting arrangement, a point outside every arrangement hyperplane could be chosen: for each proper subspace cut out on , choose a nonzero linear form vanishing there; their product is a nonzero polynomial on , which cannot vanish everywhere over (by induction on ). It would lie in a chamber interior, whose point stabilizer is trivial by [F2], contrary to . Hence is an arrangement hyperplane. The same finite-union argument chooses outside all other distinct arrangement hyperplanes; is nonzero. By [F2], for some . Since lies on an arrangement hyperplane, is nonempty; the walls indexed by are distinct because their normals are the images of distinct basis vectors under the invertible map . They all pass through , so . For , [F2] gives ; since fixes , it is the reflection . Conversely every element of has a fixed hyperplane by [F1]. Thus the nonidentity elements with fixed-space codimension one are exactly the reflections.
Assume and put . The left side of [F3] expands as . In the normalized sum on its right, the identity contributes . Each of the reflections contributes . For every other element, [F5] and step 1.2 give at most eigenvalues equal to on : indeed , so the fixed dimensions on a representation and its dual agree. Its Molien term is therefore . Comparing the coefficients of and first gives and then . The identity is a finite sum of rational functions, so these Laurent expansions compare coefficients without an infinite-limit interchange.
Write in the chosen orthonormal coordinates. The tuple satisfies ; differentiating gives and hence , since is real orthogonal. If lies on the fixed hyperplane of , then , so vanishes there. After taking as one coordinate, restriction to is the zero polynomial; thus divides . If and are proportional, nondegeneracy of gives ; since both roots are real with -norm one, , and positivity of both roots gives , so . Thus the forms are pairwise nonproportional primes by [F6], and divides . Every determinant term of the Jacobian matrix has degree ; [F4] makes this the degree of its nonzero determinant. Since , step 2.1 gives , so for a nonzero scalar . This proves (2), including anti-invariance of . If an orthonormal basis changes by , its coordinate expressions satisfy and . Listing the fixed roots in a different order leaves the product unchanged; replacing by multiplies it by .
If , every reflection acts by determinant , so vanishes on its fixed hyperplane and each divides . The same pairwise-prime argument as in step 3.1 gives for some . By step 3.1, is anti-invariant; applying any to and cancelling in the domain then gives . Conversely, if , the product is anti-invariant. The quotient is unique because is a domain and .
By [F3] the Hilbert series of is , whose top degree is by step 2.1 and whose top coefficient is , so is one-dimensional. For and in , set with ; this is positive definite. If is homogeneous with and , direct monomial expansion gives , where conjugates the coefficients of and substitutes the formal partial derivatives for its variables. For a real orthogonal matrix , the chain rule, first on linear symbols and then by products and linearity, gives . Since and real matrices preserve coefficientwise conjugation, is invariant and ; thus this differential operator commutes with substitution by . Since by step 3.1, is anti-invariant. If it has degree , so step 4.1 forces it to be zero; if the derivative is already zero. Every homogeneous element of is a sum of such products , hence is orthogonal to . But is a nonzero real-coefficient polynomial, so ; consequently and in . It spans this one-dimensional component and has the determinant action by step 3.1.
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 .
A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types
Statement
Assume the Axiom of Choice. Let be an irreducible Coxeter system of finite type, , with , , , , , chamber and longest-element conventions (The real Coxeter form, its radical, reflections, and form-preserving maps, The canonical reflection homomorphism, roots, reflections, and the positive cone, Root sign coherence and the action of simple reflections on positive roots, The dual action, chambers, faces, and root hyperplanes), let be the bipartite Coxeter element with order and Coxeter plane , prefix roots and the conclusion (The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a, The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id), and let and be the basic degrees and exponents of Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system. Put . Then:
(1) Exponent-residue identification. The multiset of exponents equals the multiset of spectral exponents of : after relabelling, , where are the residues with -eigenvalues (each eigenvalue counted with multiplicity). Consequently , the eigenvalues of are exactly , and , .
(2) Complete degree tables. Combining (1) with the classical and exceptional spectra:
These degree lists are multisets; when is even, the degree in type is counted twice. With the conventions : degree ; the coincidences , , , and of Classification of finite Coxeter systems, including the H and dihedral families (4) (for the extended convention the multiset is , covered by (3)); and products of these degree multisets for reducible types as in (3). In each case .
(3) Reducible systems. If with connected components and the -orthogonal decomposition (Disconnected diagrams, direct products, and comparison of invariant forms), then as graded algebras, the degree multiset of is the union of the component degree multisets, and the coinvariant algebra is the tensor product of the component coinvariant algebras. There is no single global Coxeter number in general.
(4) Conventions and abstentions. For () the assertions are direct; for they are empty. Nothing is imported about a common length function, about Poincaré polynomial growth, or about the regular-representation structure of the coinvariant algebra; the tables are derived from the spectral data, not assumed.
Facts & Assumptions
Given: The Axiom of Choice; for the irreducible clause, a finite irreducible Coxeter system of rank , its complex reflection representation, bipartite Coxeter element of order , Coxeter plane, positive roots, reflecting hyperplanes and fixed homogeneous basic invariants with degrees ; rank zero and rank one are treated separately below.
Under AC, the fixed basic family exists, its degrees satisfy , and its exponents are ; each is homogeneous, -invariant, and the invariant ring is generated by these algebraically independent polynomials (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system (1)-(3), Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (4), Finite linear invariant and coinvariant polynomial algebras, The Axiom of Choice).
The canonical representation is a real group homomorphism and its complexification is faithful; since , its complexified operator satisfies . The root-sign and chamber conventions specify the positive roots and reflecting hyperplanes, and the bipartite element has the ordered root data of its definition (The real Coxeter form, its radical, reflections, and form-preserving maps, 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), Coxeter diagrams: edges, labels, components and finite type, The dual action, chambers, faces, and root hyperplanes, Root sign coherence and the action of simple reflections on positive roots, The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a).
For irreducible finite type, acts on its Coxeter plane as rotation by ; the traces are exactly the reflection lines, is invertible (so its complexification is invertible), and , so (The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (2)-(4)).
The invariant Jacobian is nonzero; it is a nonzero scalar multiple of the discriminant , whose zero set is the union of the complexified reflecting hyperplanes; and (Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian (3), The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class (1)-(2)).
For a finite type Coxeter system under AC, , and for a reducible diagram the basic-degree multiset is the union of the component multisets (The basic degrees are independent of the chosen family; Hilbert series of the invariants and of the coinvariant algebra; the order formula and the Molien identity (3),(5)).
The real matrix has characteristic polynomial with real coefficients; its nonreal eigenvalues therefore occur with their complex conjugates and with equal algebraic multiplicities. A finite-order complex operator is diagonalisable. For any matrix , , by , so the eigenvalues of and agree with multiplicity (Over an algebraically closed field of characteristic , every element of finite order acts diagonalisably in a finite-dimensional representation, 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, Eigenvalues, eigenvectors, eigenspaces , and the spectrum of an endomorphism, The group of -th roots of unity in a field, and primitive -th roots of unity, The -th roots of a complex number and the distinct roots of unity for every ). 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.
The exact irreducible finite diagrams, standard coincidences, direct-product decomposition, and orthogonal decomposition of the representation are as stated in the finite classification and product theorem (Classification of finite Coxeter systems, including the H and dihedral families (1)-(4), Disconnected diagrams, direct products, and comparison of invariant forms (1)-(2)). Polynomial functions on a direct sum decompose into the tensor product of the coordinate polynomial algebras; expansion in the block monomial basis is finite (Polynomial rings in finitely many commuting indeterminates by iteration, Finite linear invariant and coinvariant polynomial algebras).
The exact classical and exceptional Coxeter characteristic polynomials and spectral-exponent multisets are those proved in the two preceding spectrum items (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, The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices).
Proof
Assume first that is irreducible and . Let be the Coxeter plane. Choose real vectors forming a basis of so that is an eigenvector of with eigenvalue ; this is possible because is rotation by [F2, F3]. If lay in a complexified reflecting hyperplane , then its real and imaginary parts would both lie in , so . But is a line by [F3], so no reflecting hyperplane contains . Therefore every factor of is nonzero and by [F4]. The matrix is thus invertible, and form a basis of [F4].
Let the connected components of a reducible diagram be , with corresponding spaces and groups . By [F7], acts on factorwise, and the coordinate polynomial algebra is . To compute invariants, expand any polynomial as a finite sum of block monomials with coefficients in the other blocks. Invariance under forces every coefficient in the -th block to be -invariant; doing this for each factor proves , and the reverse inclusion follows because each factor acts trivially on the other blocks [F7]. Each component invariant ring is polynomial on its homogeneous basic family, so the tensor product is polynomial on the union of these families. Its degrees are therefore the union of the component degree multisets, also as in [F5]. If is the ideal generated by positive-degree invariants in the -th block, then the positive-degree ideal of generates precisely : every positive-degree pure tensor has at least one positive-degree factor, and each is generated by invariants of the full product. The tensor-product quotient is consequently , which is the asserted tensor decomposition of coinvariant algebras. By [F5] the product of all degrees is . There is no common Coxeter number for unequal component orders, and this clause uses no global .
For each and all , because is invariant [F1]. Differentiate this identity at in an arbitrary direction to get , or . Since and is homogeneous of degree , ; hence . These covectors form a basis by 1.1, so the eigenvalue multiset of the transpose action is . A matrix and its transpose have the same characteristic polynomial, so this is also the eigenvalue multiset of , with multiplicity [F1, F2, F6, step 1.1, algebra]. By [F3], is invertible, so is not an eigenvalue. Thus each is congruent modulo to a unique residue in , and these residues, counted with multiplicity, are exactly the spectral exponents of the statement [F2, F3, F6].
The matrix is real by [F2], so its nonreal eigenvalues pair as with equal multiplicity; each such pair contributes to the sum of residues. The only real -th roots of unity are and, when is even, ; is excluded by 2.1, while each occurrence of contributes . Partitioning the full eigenvalue multiset into these pairs and occurrences of therefore gives [F2, F3, F6, algebra]. By [F4], as well. Since each positive integer is congruent to a residue in , it has the form with an integer ; the residue multiset and exponent multiset have the same cardinality, and the equal sums force every . Thus the exponent multiset is exactly the spectral-residue multiset, proving (1)'s identification and sum claim.
The rotation on has eigenvalues and , so the spectral residues and both occur, counted with multiplicity (when these are the same residue and the eigenvalue occurs with multiplicity two on ). By 3.1 the same residues occur among the . Therefore and , which gives and .
Add to each spectral exponent from the two computed spectrum suppliers. The classical lists give , , together with , and . The exceptional lists give , , , , , and [F8, step 3.1]. The classification's coincidence conventions identify , , , , and, with the extended notation, ; for the last case the degrees are the union [F7]. The product-degree formula is [F5], so it holds for every listed irreducible type and for the reducible unions.
If , then is trivial, the invariant and coinvariant algebras are , and all degree, exponent and product assertions are empty, with empty products equal to [F1, F5]. If , the irreducible system is : its generator acts by , so the invariant ring is , the basic degree is , has order and eigenvalue , the sole exponent/residue is , , and the coinvariant algebra is . Thus all claims hold directly; for reducible rank one factors the componentwise argument of 1.2 applies [F1, F5, F7, algebra]. The Axiom of Choice is used only for the basic-family and invariant-theory supplier conclusions in [F1] and [F5]; the plane, derivative, residue and tensor calculations above use no further choice [F1, F5, def-axiom-of-choice].
5 · Examples, counterexamples and false statements
None yet.
Sources
- Pavel Etingof, Representations of Lie Groups (MIT 18.757 course notes, 162-page PDF)
- Josh Swanson, On eigenvalues of representations of reflection groups and wreath products (University of Washington CAT seminar notes, 7-page PDF)
- Bill Casselman, Essays on Coxeter groups: Coxeter elements in finite Coxeter groups (author-hosted PDF, 12 pages)
- Vivien Ripoll (Strobl seminar notes, joint with Reiner and Stump), Coxeter elements in well-generated reflection groups (57-page PDF)