Alphabeta Math
Pipeline-generated
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.

✓ 7 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 7 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Finite Coxeter Invariants and Coinvariant Gradings

1 · Prerequisites

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

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers

Statement

Let (W,S) be a Coxeter system of finite type with S finite, n:=∣S∣, and let V=RS carry the Coxeter form B, the canonical reflection representation ρ:W→GL(V), the root system Φ=Φ+⊔Φ−, the reflection set T={wsw−1:w∈W, s∈S}, the chamber C 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 B-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 B is positive definite (Finiteness criterion: W is finite exactly when the Coxeter form is positive definite). Form the complexification VC:=C⊗RV (Complexification as C⊗RV with its canonical real-linear embedding), the C-bilinear extension BC of B characterized by BC(z⊗u, w⊗v)=zw B(u,v), the complexified map ρC:=id⊗ρ (Complexification of a real-linear map) and the linear forms ℓα(x):=BC(x,α) for α∈Φ (Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism fixes the eigenspace language).

(1) Complexification. dim⁡CVC=n, the classes 1⊗es (s∈S) form a C-basis, ρC is a homomorphism W→GL(VC) that is faithful in the sense of Intertwiners, the spaces Hom⁡G(V,W) and End⁡G(V), equivalent representations, and faithful representations, and ρC(W) is a finite subgroup of GL(VC) of order ∣W∣.

(2) Complex reflections. For every t∈T, written t=tα with its positive root α∈Φ+ (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)), the operator ρC(t) is not the identity, its fixed space is the complex hyperplane {x∈VC:ℓα(x)=0}, and ρC(t)−idVC has image the line Cα; that is, ρC(t) is a complex reflection. In particular every generator ρC(s) is a complex reflection and ρC(W) is generated by complex reflections.

(3) Essentiality. VCW={x:ρC(w)x=x for all w∈W}={0}, and every W-invariant linear form on VC 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 ρC(W)≤GL(VC) generated by complex reflections: the invariant algebra SW:=C[VC]W is a polynomial C-algebra on n homogeneous algebraically independent basic invariants, and C[VC] is a graded free SW-module of rank ∣W∣; moreover every minimal homogeneous invariant generating family of the ideal S+WC[VC] generates SW 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 n=0 (trivial group, V=0) all assertions are the empty ones. No irreducibility, crystallographic integrality or highest-root data is assumed: the statement covers the noncrystallographic types I2(m), H3, H4 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 W-representation; those are later items. (4) is the only clause using Choice.

Facts & Assumptions

Given: A Coxeter system (W,S) of finite type with S finite, the space V=RS with its Coxeter form B, the canonical reflection representation ρ, the root system Φ=Φ+⊔Φ− and the reflection set T.

[F1]

The Coxeter form satisfies B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), the reflection formula is ra(v)=v−2B(v,a)B(a,a)a, and ra is linear, involutive, fixes ker⁡B(−,a) pointwise, and preserves B; ker⁡B(−,a) is a hyperplane when B(a,a)≠0 (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order).

[F2]

The canonical reflection homomorphism is the unique homomorphism ρ:W→GL(V) with ρ(s)=res, the root system is Φ={ρ(w)es}, and T={wsw−1} (The canonical reflection homomorphism, roots, reflections, and the positive cone, Descent of the reflection representation, unit root norms, and conjugation of reflections).

[F3]

ρ preserves B, every root α∈Φ has B(α,α)=1, and ρ(wsw−1)=rρ(w)es for all w∈W, s∈S; 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)).

[F4]
[F5]

The map Φ+→T, α↦tα, is a bijection, and ρ(tα)=rα (The inversion formula ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange (1)).

[F6]

The complexification VC=C⊗RV carries the scalar action z⋅(w⊗v)=(zw)⊗v and the embedding ιv=1⊗v (Complexification as C⊗RV 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).

[F7]

For a real-linear T:V→V the complexification TC=idC⊗T is C-linear with TC(z⊗v)=z⊗T(v) (Complexification of a real-linear map).

[F9]

For a finite G≤GL(V) the invariant algebra is R=SG, R+=⨁d>0Rd and I=SR+ defines the coinvariant algebra S/I (Finite linear invariant and coinvariant polynomial algebras).

[F10]

The Axiom of Choice is the statement that every family of nonempty sets has a choice function (The Axiom of Choice).

[F11]

Assume AC. For a finite complex reflection group G≤GL(V): SG is a polynomial algebra on n=dim⁡V homogeneous algebraically independent basic invariants and S is free of rank ∣G∣ over SG; every minimal homogeneous invariant generating family of I=SR+ generates R and is algebraically independent; these generators form an S-regular sequence and homogeneous lifts of a homogeneous basis of S/I form a graded free R-basis; and Hilb⁡(S/I,t)=∏i(1+⋯+tdi−1), dim⁡C(S/I)=∏idi=∣G∣ (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

1.1F2F3F6F7F8

Every elementary tensor expands as z⊗v=∑szv(s)(1⊗es), so the classes 1⊗es span. For each t∈S, the balanced map (z,v)↦zv(t) induces by [F6] a map pt:VC→C; it is complex-linear on elementary tensors and satisfies pt(1⊗es)=δts. Applying pt to a linear relation proves independence. Thus these classes form a C-basis and dim⁡CVC=n. For w∈W set ρC(w):=idC⊗ρ(w). By [F7] each ρC(w) is C-linear with ρC(w)(z⊗v)=z⊗ρ(w)v; on elementary tensors ρC(w)ρC(w′)(z⊗v)=z⊗ρ(w)ρ(w′)v=ρC(ww′)(z⊗v), and since elementary tensors span VC this gives ρC(ww′)=ρC(w)ρC(w′), while ρC(1)=id; so ρC:W→GL(VC) is a homomorphism. If ρC(w)=idVC, then for every s the basis element 1⊗es is fixed, so 1⊗ρ(w)es=1⊗es, and linear independence of the 1⊗et gives ρ(w)es=es; as (es) spans V, ρ(w)=idV, and injectivity of ρ [F3] gives w=1. Hence ρC is faithful in the sense of [F8], and its image, the image of the finite group W, is a finite subgroup of GL(VC) of order ∣W∣.

2.1F1F2F7step 1.1

Let s∈S. By [F1], B(es,es)=1 and rs(v)=v−2B(v,es)es for all v∈V; equivalently rs−idV=−2B(−,es)es has image Res and kernel ker⁡B(−,es), a hyperplane of V. Complexifying with [F7], for x=z⊗v we get (ρC(s)−idVC)(x)=z⊗(rs−idV)v=−2B(v,es) (z⊗es)=−2BC(x,es) es, using BC(z⊗v,es)=zB(v,es); the same formula holds on all of VC by linearity. The image is therefore the line Ces (it contains −2es≠0) and the kernel is {x:BC(x,es)=0}, a complex hyperplane because BC(es,es)=1 makes the linear form BC(−,es) nonzero. In particular ρC(s)≠idVC fixes that hyperplane pointwise: each generator is a complex reflection, and ρC(W)=⟨ρC(s):s∈S⟩ is generated by complex reflections.

3.1F2F3F5step 2.1

Let t∈T. By [F5] there is a unique α∈Φ+ with t=tα and ρ(tα)=rα; by [F3] every root has B-norm one, so rα(x)=x−2B(x,α)α for x∈V, and rα fixes ker⁡B(−,α) pointwise and maps α↦−α. Complexifying as in 2.1 gives (ρC(tα)−id)(x)=−2BC(x,α)α for all x∈VC, so the image is the line Cα and, since BC(α,α)=1, the kernel {x:ℓα(x)=0} is a complex hyperplane. Thus every t∈T acts as a complex reflection, and by [F2] and [F3] every element of T is conjugate in W to a simple reflection, in agreement with 2.1.

3.2F1F3F4F6step 2.1

Let x=∑s∈Szs⊗es∈VC be fixed by every ρC(w). Fixing x under ρC(s) and applying the formula of 2.1 gives −2BC(x,es)es=0, hence BC(x,es)=0 for every s∈S. Let G be the Gram matrix of B in the basis (es); by [F4] B is positive definite, so G is a real symmetric positive definite matrix, and BC(x,es)=0 for all s says Gz=0 for the coefficient column z=(zs). Writing z=a+bi with real columns a,b, the real part aTGa+bTGb of z∗Gz vanishes, and both summands are ≥0 with equality only for a=b=0; hence z=0 and x=0. So VCW={0}. If ℓ:VC→C is a W-invariant linear form, then ℓ(es)=ℓ(ρC(s)es)=ℓ(−es) by 2.1, so ℓ(es)=0 for every s, and since the es span VC over C, ℓ=0. These finite-dimensional calculations use no choice principle: the basis (es), the Gram matrix and the coefficient column are explicitly given by the finite set S.

4.1F9F10F11step 1.1step 2.1step 3.1

Assume AC. By step 1.1 the subgroup ρC(W)≤GL(VC) is finite of order ∣W∣, faithful and, by steps 2.1 and 3.1, generated by complex reflections; VC has dimension n. Applying [F11] with S=C[VC] and G=ρC(W) gives that SW is a polynomial C-algebra on n homogeneous algebraically independent basic invariants, that S is graded free of rank ∣W∣ over SW, that every minimal homogeneous invariant generating family of I=SS+W generates SW and is algebraically independent, that such generators form a regular sequence with the freeness conclusion, and the stated Hilbert-series and order conclusions for S/I; by [F9] this I is exactly the positive-degree ideal of the coinvariant algebra of the definition. This is the only place where AC is used.

5.1F4F5F11step 4.1∎

For n=0 the group W is trivial, V=VC=0, the basis family is empty, ρC is the unique map of the trivial groups, S=C 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 W, the positivity of B, the bijection Φ+→T and the reflection formula are used, so reducible systems and the noncrystallographic types I2(m), H3, H4 are covered. No claim is made here about eigenvalues of a Coxeter element, about the values of the degrees, or about S/I as a W-representation; and the only clause depending on AC is (4), consumed through [F11].

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-10-08Open item page →

Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system

Definition

Let (W,S) be a Coxeter system of finite type with n=∣S∣, and let VC, ρC, S:=C[VC], R:=SW, R+=⨁d>0Rd and I:=SR+ 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 x1,…,xn so that S=C[x1,…,xn] 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 f1,…,fr of homogeneous positive-degree invariants generating the ideal I exists, generates R as a C-algebra, and is algebraically independent (Finite reflection invariant generators are algebraically independent); under the stated AC any such minimal family has exactly n elements (Chevalley shephard todd for finite weyl groups, Reflection basic invariants form a regular sequence).

(2) Degrees and exponents. Fix one such family f1,…,fn and call di:=deg⁡fithe basic degrees,ei:=di−1the exponents, arranged in nondecreasing order d1≤⋯≤dn. Each di is a positive integer, and in fact di≥2: a degree-one invariant would be a nonzero W-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 (W,VC) is the graded quotient A:=S/I=⨁k≥0Ak,Ak:=(Sk+I)/I, with A0=C (constants survive because I has positive degree), as in Finite linear invariant and coinvariant polynomial algebras. Its Hilbert series is written Hilb⁡(A,t).

(4) Well-definedness warning. This definition asserts nothing about the multiset {d1,…,dn} being independent of the chosen family, nothing about Hilb⁡(A,t) or ∏idi, and no relation between the di 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 n=0 the group is trivial, S=R=C, I=0, A=C and the families and products are empty. For reducible S the family in (2) is the concatenation of the families of the connected components, and I is generated by all components' positive-degree invariants. No crystallographic or integrality assumption is made.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The Coxeter elements of the classical types A_n, B_n, D_n and I_2(m): characteristic polynomials, orders and spectral exponents from their reflection models

Statement

For each of the types An (n≥1), Bn (n≥2), Dn (n≥4) and I2(m) (m≥3) take the irreducible Coxeter system (W,S) of that type with the standard diagram numbering of Classification of finite Coxeter systems, including the H and dihedral families (1) (for Dn the star with arms of 1,1,n−3 edges; for I2(m) the two vertices joined by an edge of label m), let ρC:W→GL(VC) be the complexified canonical reflection representation of Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers, and let c∈W be the bipartite Coxeter element of The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (equivalently: the product, in the bipartite convention, of the two colour-class products of the tree Γ, each of which has commuting factors; for a path diagram the colour classes are the even- and odd-numbered vertices, and for Dn the classes are determined by the distance from the branch node). Write ζh:=exp⁡(2πi/h) for h≥2 and write ζhr for the complex number exp⁡(2πir/h); call spectral exponents the multiset of residues r∈{1,…,h−1} such that the eigenvalues of the operator are the numbers exp⁡(2πir/h), each with multiplicity. Then ρC(c) is diagonalisable (A diagonalisable endomorphism is one admitting a basis of eigenvectors, equivalently a diagonal matrix representation), has order h equal to the Coxeter number displayed below, and has the displayed characteristic polynomial in X=λ and spectral exponents:

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

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

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

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

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

Facts & Assumptions

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

[F1]

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

[F2]

The Coxeter form satisfies B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for finite m(s,t), the reflection formula is ra(v)=v−2B(v,a)a/B(a,a), the canonical representation ρ:W→GL(V) is a homomorphism, and its complexification ρC is faithful (The real Coxeter form, its radical, reflections, and form-preserving maps, Reflections: involutivity, form invariance, fixed hyperplane, and exact rank-two order (2), The canonical reflection homomorphism, roots, reflections, and the positive cone, Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers (1)).

[F3]

For an irreducible finite type system the diagram Γ is one of the standard trees in the finite classification, and its bipartition J⊔K gives commuting color-class products a=∏s∈Js and b=∏s∈Ks; c=ab and h=ord⁡(c) are well defined, and reversing the classes replaces c by a conjugate since ba=a−1(ab)a (The bipartite Coxeter element, its ordered prefix roots, and the conditional vector map mu(a) = -2(c-1)^{-1}a (1), Coxeter diagrams: edges, labels, components and finite type (2), Classification of finite Coxeter systems, including the H and dihedral families (1)).

[F4]

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

[F5]

For a square matrix A the characteristic polynomial is χA(x)=det⁡(xI−A), and the determinant is the alternating multilinear function of the columns (For A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix). The alternating multilinear property is proved in The Leibniz determinant is column-multilinear, alternating and normalized over every commutative ring. Determinants are invariant under similarity (Similar matrices over a commutative ring have the same determinant), so an eigenbasis computes the determinant factors of a diagonalisable operator. Over a field, a positive-sized square matrix is invertible exactly when its determinant is nonzero (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit); hence det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F8]

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

[F9]

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

Proof

1.1F1F2F3

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

1.2F4F5F7

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

2.1F8F5step 1.1

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

2.2F8F5step 1.1

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

2.3F8F5step 1.1

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

3.1F2F3F4F6F8step 1.2step 2.1step 2.2step 2.3∎

The map ψ=φρφ−1 is conjugate to ρ, and complexification preserves characteristic polynomials and operator orders, so steps 1.2-2.3 compute det⁡(X−ρC(c)) and its order for the four types. Since ρC is faithful by [F2], this operator order equals the order of c in W, which is the Coxeter number h used in the statement. The eigenvalues listed there are the spectral exponents in the sense fixed in the statement, since conjugate linear maps have the same eigenvalues with the same multiplicities. Finally ρC(c) has finite order because W is finite, so it is diagonalisable by [F6] over C; this holds in each type and shows both the diagonalisability and, together with the characteristic polynomials, the displayed spectra. Nothing above uses invariant degrees, Hilbert series or any degree table: only the reflection models, the rank-two computation and roots of unity are used, and the statement makes no assertion about h=max⁡i(di), which is proved only by the final determination theorem of this page.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item 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 (W,S) be a Coxeter system of finite type, n=∣S∣, and let VC, S=C[x1,…,xn], R=SW, I=SR+, A=S/I, and a fixed basic family f1,…,fn with degrees d1≤⋯≤dn and exponents ei=di−1 be as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system (so f1,…,fn is a minimal homogeneous generating family of I, generates R, is algebraically independent, and gives a graded isomorphism C[y1,…,yn]→R, yi↦fi, with deg⁡yi=di).

(1) Multiset independence. If f1′,…,fn′ is any other minimal homogeneous generating family of I with degrees di′, then {d1,…,dn}={d1′,…,dn′} as multisets. Hence the nondecreasing degree sequence d1≤⋯≤dn, the exponents e1≤⋯≤en and the degree count are invariants of the pair (W,VC).

(2) Hilbert series. Hilb⁡(R,t)=∏i=1n(1−tdi)−1 and Hilb⁡(A,t)=∏i=1n(1+t+⋯+tdi−1) as formal power series (The Hilbert function and formal Hilbert series of a graded module with finite-length pieces).

(3) Order formula. dim⁡CA=∏i=1ndi=∣W∣, and ∑i=1nei is the top degree of A.

(4) Molien identity. ∏i=1n(1−tdi)−1=1∣W∣∑w∈Wdet⁡(1−tw∣VC∗)−1 as formal power series, the determinants expanded as finite products over the eigenvalues of ρC(w) on VC∗.

(5) Conventions. For n=0 all products are empty and equal 1, and A=C. For reducible S 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 (W,S) of finite type, and a basic family f1,…,fn as in the statement.

[F1]

f1,…,fn is a minimal finite family of homogeneous positive-degree invariants generating I=SR+, it generates R as a C-algebra and is algebraically independent; under AC any minimal such family has exactly n=∣S∣ elements, and every di≥2 (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, Finite reflection invariant generators are algebraically independent).

[F2]

The complexification ρC(W)≤GL(VC) is a finite subgroup of order ∣W∣, generated by complex reflections, faithful, and dim⁡CVC=n (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers).

[F3]

Assume AC. For the finite complex reflection group ρC(W): C[VC]W is a polynomial algebra and C[VC] is graded free of rank ∣W∣ over it; minimal homogeneous invariant generators of I form an S-regular sequence with common zero set {0}; and Hilb⁡(S/I,t)=∏i(1+⋯+tdi−1), dim⁡C(S/I)=∏idi=∣W∣ (Chevalley shephard todd for finite weyl groups, Reflection basic invariants form a regular sequence, Weyl coinvariant hilbert series has order w dimension).

[F4]

The Reynolds operator R(f)=∣G∣−1∑g∈Gg⋅f is a graded R-linear projection of S onto R=SG, and it preserves each finite-dimensional graded piece SN; I=SR+ and the coinvariant algebra A=S/I carry their quotient gradings (Finite linear invariant and coinvariant polynomial algebras).

[F5]

The Hilbert function of a graded module is HM(N)=dim⁡ of its N-th piece when the pieces are finite-dimensional, and its formal Hilbert series is ∑NHM(N)tN; 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).

[F6]

An operator of finite order on a finite-dimensional complex vector space is diagonalisable (Over an algebraically closed field of characteristic 0, 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.

[F7]

If Γ has connected components on S1,…,Sk, then W≅WS1×⋯×WSk via multiplication, and V=V1⊕⋯⊕Vk is a B-orthogonal direct sum on which ρ(Wi) preserves Vi and fixes every Vj, j≠i (Disconnected diagrams, direct products, and comparison of invariant forms (1),(2)); for finite type each component is one of the classified finite diagrams and W 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).

[F8]

S=C[x1,…,xn] is the iterated polynomial ring over C, 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

1.1F1F5F8

Put m=S+=(x1,…,xn). For any finite minimal homogeneous generating family g1,…,gr of I, its classes span the graded complex vector space I/mI: modulo mI, coefficients in an expression ∑jajgj reduce to their constants. These classes are independent. Indeed, a nonzero homogeneous relation would give ∑deg⁡gj=Dcjgj∈mI with some ck≠0. Since the gj generate I, its right side can be written ∑jbjgj with bj∈m homogeneous of degree D−deg⁡gj. Such bj vanish when deg⁡gj≥D, so solving for gk expresses it in the ideal generated by the other gj, contrary to minimality. Every relation splits into homogeneous ones, proving independence. Thus the number of degree-D members in any such family is dim⁡C(I/mI)D. 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 I=0 the minimal family and quotient are empty.

1.2F1F5F8

For the fixed invariant basic family, [F1] gives the graded isomorphism C[y1,…,yn]→R with yi↦fi and deg⁡yi=di. Counting its monomials gives Hilb⁡(R,t)=∑N≥0#{a∈Nn:∑iaidi=N}tN=∏i=1n(1−tdi)−1. 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.

2.1F2F3F5step 1.2

Since I is homogeneous, R=⨁RN and A=⨁AN are graded with finite-dimensional pieces, so the Hilbert series of [F5] apply. By step 1.2, Hilb⁡(R,t)=∏i=1n(1−tdi)−1. Under the stated AC the group ρC(W) is a finite complex reflection group of order ∣W∣ on the n-dimensional space VC with invariant algebra R and positive-degree ideal I, so [F3] gives Hilb⁡(A,t)=∏i=1n(1+t+⋯+tdi−1), and evaluating at t=1 gives dim⁡CA=∏idi=∣W∣; since each factor 1+t+⋯+tdi−1 is a polynomial of degree di−1, the product is a polynomial of degree ∑iei with leading coefficient 1, so ∑iei is the top degree of A.

3.1F2F4F5F6step 2.1

Fix w∈W. By [F2] and [F6] the operator induced by w on the finite-dimensional space VC∗ is diagonalisable; let λ1,…,λn be its eigenvalues with multiplicity, and note that det⁡(1−tw∣VC∗)=∏j=1n(1−λjt). The induced operator on SN=Sym⁡N(VC∗) (N≥0) has, in the monomial basis attached to an eigenbasis of VC∗, the eigenvalues λa=λ1a1⋯λnan over all a with ∣a∣=N; summing gives the formal identity ∑N≥0tr⁡(w∣SN)tN=∏j=1n(1−λjt)−1=det⁡(1−tw∣VC∗)−1 [F5]. The Reynolds operator is a projection of SN onto RN [F4], and for a projection the trace equals the dimension of its image, so dim⁡CRN=∣W∣−1∑w∈Wtr⁡(w∣SN); summing over N and using the previous identity gives Hilb⁡(R,t)=∣W∣−1∑w∈Wdet⁡(1−tw∣VC∗)−1, and combining with Hilb⁡(R,t)=∏i(1−tdi)−1 of 2.1 proves the Molien identity (4).

4.1F1F3F4F7F8step 1.1∎

For n=0 the group is trivial, S=R=C, I=0, A=C, and every displayed product is empty and equals 1, 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] W≅W1×⋯×Wk and VC=V1,C⊕⋯⊕Vk,C with ρ(Wi) preserving Vi and fixing the other summands. Choose coordinates adapted to this decomposition, so that S=C[x(1),…,x(k)] with x(i) the coordinates of the i-th summand [F8]. For f∈R=SW and any i, the Reynolds operator Ri of Wi acts only on the block x(i) and, because f is Wi-invariant, leaves it unchanged; expanding f in the monomials of the remaining blocks and applying Ri expresses f as a finite sum of products of a Wi-invariant polynomial in the block x(i) with a polynomial in the other blocks. Applying Rk,Rk−1,…,R1 successively (each application leaves f unchanged and replaces one block factor by its invariant part) gives f∈C[x(1)]W1⋯C[x(k)]Wk: the invariant algebra is generated by the component invariant algebras [F4, F8]. If for each i we fix a basic family of the component Wi, then the concatenated family is homogeneous of positive degrees, generates R, 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 I=SR+ because its members generate R and have positive degrees. It is also minimal as an S-ideal generating family: any redundancy, after Reynolds averaging its coefficients [F4], would express one member as an R-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 yj=0 in C[yj]. 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 n-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.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian

Statement

Assume the Axiom of Choice. Let (W,S) be a Coxeter system of finite type, n=∣S∣≥1, with VC, A=S/I and a fixed basic family f1,…,fn∈R=SW of degrees di, generating the ideal I=SR+, algebraically independent and generating R, as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system; choose C-coordinates x1,…,xn on VC (Polynomial rings in finitely many commuting indeterminates by iteration) and let ∂/∂xj and J=(∂fi/∂xj)1≤i,j≤n be the formal partial derivatives and the Jacobian matrix of Equation rows and coordinate columns in an affine Jacobian. Put L:=C(x1,…,xn) and K:=C(f1,…,fn)⊆L (The field of fractions Frac⁡(D)=(D∖{0})−1D of an integral domain).

(1) Annihilating orbit polynomials. For each j, the orbit polynomial Pj(T):=∏w∈W(T−w⋅xj)∈S[T] is monic of degree ∣W∣, its coefficients lie in R=C[f1,…,fn]⊆K, and Pj(xj)=0. Hence every xj is algebraic over K in the sense of Algebraic and transcendental elements and algebraic extensions.

(2) Minimal polynomial and its derivative. For each j let mj∈K[T] be the minimal polynomial of xj over K (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element). Then xj∉K; mj is nonconstant; mj′≠0; and mj′(xj)≠0.

(3) Differential bridge. For each j there exist b1j,…,bnj∈L such that, for every k∈{1,…,n}, the identity δjk=∑i=1nbij ∂fi∂xk holds in L (with δjk the Kronecker symbol; equivalently id=B⋅J with B=(bji) over L). Consequently J has rank n over L, and J:=det⁡(∂fi∂xj)∈S 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 (W,S) with basic family f1,…,fn, and coordinates x1,…,xn on VC.

[F1]

The fixed family f1,…,fn is a minimal family of homogeneous positive-degree invariants generating I=SR+, generates R as a C-algebra and is algebraically independent, so evaluation gives a graded C-algebra isomorphism C[y1,…,yn]→R, yi↦fi, and every element of R is a polynomial in the fi; also di≥2 (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).

[F2]

ρC:W→GL(VC) is the complexified canonical representation with dim⁡CVC=n, and VCW={0}; more precisely every W-fixed linear form on VC 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).

[F3]

The action (g⋅f)(v)=f(ρC(g)−1v) makes S=C[VC] a graded algebra on which W acts by graded algebra automorphisms, with invariant algebra R=SW, positive-degree part R+ and I=SR+; the degree-one part of S is VC∗ and the restricted action is the dual action, so a degree-one element of S is W-fixed exactly when it is an invariant linear form (Finite linear invariant and coinvariant polynomial algebras, Reflection basic invariants form a regular sequence).

[F4]

S=C[x1,…,xn] is the iterated polynomial ring over C, monomials form a basis, and S is a domain with fraction field L=C(x1,…,xn); the subfield generated by f1,…,fn is K=C(f1,…,fn)=Frac⁡(R) (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 Frac⁡(D)=(D∖{0})−1D 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 det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F5]

Algebraic elements and minimal polynomials: if 0≠P∈K[T] with P(xj)=0 then xj is algebraic over K; the minimal polynomial mj is the unique monic irreducible element generating ker⁡(ev⁡xj)=(mj), and f(xj)=0 holds exactly when mj∣f (Algebraic and transcendental elements and algebraic extensions, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F6]

The formal partial derivatives ∂xk are defined on monomials by the Leibniz monomial rule and extended C-linearly, and the univariate formal derivative satisfies (f+g)′=f′+g′, (cf)′=cf′, the product rule, (Ta)′=aTa−1 and the degree bound deg⁡f′≤deg⁡f−1 when f′≠0 (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).

[F7]

The Axiom of Choice is used only to have an n-element basic family as in [F1] (The Axiom of Choice).

Proof

1.1F1F3F4F5

Fix j and form Pj(T)=∏w∈W(T−w⋅xj)∈S[T]. For g∈W one has g⋅(w⋅xj)=(gw)⋅xj (the action is a left action), so g permutes the linear factors and hence fixes Pj; as W acts by graded algebra automorphisms [F3], each coefficient of Pj lies in R=SW. By [F1] R=C[f1,…,fn], so all coefficients lie in K. The polynomial is monic of degree ∣W∣, being a product of ∣W∣ monic linear factors, and Pj(xj)=0 because the factor with w=1 is T−xj. Hence xj is algebraic over K in the sense of [F5].

1.2F6

The operators ∂xk are C-linear on S and satisfy the product rule on monomials by the Leibniz monomial rule, hence on all polynomials by bilinearity; by induction the power rule ∂xk(xja)=axja−1δjk holds for all a≥1, while ∂xk1=0. Consequently, for every polynomial γ∈C[y1,…,yn] and all g1,…,gn∈S, the chain rule ∂xk(γ(g1,…,gn))=∑i=1n(∂yiγ)(g1,…,gn) ∂xkgi holds: expanding γ=∑αcαyα, the product rule gives ∂xk(gα)=∑iαigα−ei∂xkgi, which is the displayed identity because ∂yiγ=∑αcααiyα−ei.

2.1F2F3F5F6step 1.1

Suppose xj∈K. Since W acts on S by algebra automorphisms it acts on the fraction field L by g⋅(a/b)=(g⋅a)/(g⋅b), and this action fixes K pointwise because the fi are invariant; hence g⋅xj=xj for every g. But xj∈VC∗ is a degree-one element of S [F3], so by [F2] the only W-fixed linear form is 0, while xj is a coordinate function and xj≠0: contradiction. So xj∉K; the minimal polynomial mj of xj over K [F5] is therefore nonconstant. Its derivative is nonzero: the top coefficient of mj is nonzero and the degree is ≥1, so in characteristic zero the coefficient deg⁡(mj)⋅cdeg⁡ of mj′ is nonzero, and deg⁡mj′<deg⁡mj by [F6]. If mj′(xj)=0, then the nonzero polynomial mj′∈K[T] of degree <deg⁡mj would have xj as a root, contradicting the minimality of mj [F5]; hence mj′(xj)≠0 in L.

3.1F1F4F6F7step 1.1step 1.2step 2.1∎

Fix j and write mj(T)=∑a=0rcaTa with ca∈K. Since K=Frac⁡(R) [F4], choose 0≠B∈R with βa:=Bca∈R for all a, and put Mj(T):=∑aβaTa∈R[T]. Then Mj(xj)=B mj(xj)=0 and Mj′(T)=B mj′(T), so Mj′(xj)=B mj′(xj)≠0 in L by 2.1. Differentiate the polynomial identity Mj(xj)=∑aβaxja=0 with respect to xk using the product and power rules of 1.2: 0=∑a(∂xkβa) xja+Mj′(xj) ∂xkxj=∑a(∂xkβa)xja+Mj′(xj)δjk, hence δjk=−(∑a(∂xkβa)xja)/Mj′(xj) in L. Each βa∈R=C[f1,…,fn] is βa=γa(f1,…,fn) for a polynomial γa∈C[y1,…,yn] [F1], so the chain rule of 1.2 gives ∂xkβa=∑i(∂yiγa)(f1,…,fn)∂xkfi. Substituting, δjk=∑i=1nbij ∂xkfi,bij:=−∑a(∂yiγa)(f1,…,fn) xjaMj′(xj)∈L, for all j,k; equivalently BJ=id for the matrix B=(bji). Hence J is invertible over the field L, so it has rank n over L, its determinant is nonzero in L, and since S is a domain with fraction field L [F4] the polynomial J=det⁡J∈S is nonzero. For n=0 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class

Statement

Assume the Axiom of Choice. Let (W,S) be a finite-type Coxeter system with S finite, n:=∣S∣, and let VC, its faithful real-matrix reflection representation ρC, the positive roots Φ+, and the reflections T 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 ∣N(w)∣=ℓ(w), the root-reflection dictionary and strong exchange. Put S0:=C[VC]=C[x1,…,xn], R:=S0W, R+:=⨁d>0Rd, I:=S0R+ and A:=S0/I as in Finite linear invariant and coinvariant polynomial algebras. Fix a homogeneous basic family f1,…,fn of degrees di and exponents ei=di−1 as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, let N:=∣Φ+∣=∣T∣, and choose coordinates x1,…,xn from a B-orthonormal real basis of V; then every matrix ρC(w) is real orthogonal. Define

Δ:=∏α∈Φ+ℓα∈S0,ℓα(x):=BC(x,α),

and let J:=det⁡(∂fi/∂xj)≠0 be the invariant Jacobian of Algebraicity of the coordinates over the invariant field and non-vanishing of the invariant Jacobian. Write det⁡(w):=det⁡(ρC(w)). Then:

(1) Total degree. ∑i=1n(di−1)=N=∣Φ+∣=∣T∣.

(2) The Jacobian is the discriminant. For every w∈W, w⋅J=det⁡(w)J. Each ℓα divides J, and the ℓα are pairwise nonproportional. For some c∈C×,

J=c Δ,deg⁡J=∑i(di−1)=N=deg⁡Δ.

(3) Anti-invariants. If S0det⁡:={p∈S0:w⋅p=det⁡(w)p for every w∈W}, then S0det⁡=ΔR. Each p∈S0det⁡ has a unique expression p=Δq with q∈R.

(4) Top coinvariant class. The top degree of A is N=∑iei, its component AN is one-dimensional, and [Δ]∈AN is nonzero and spans it. The action on this line is w⋅[Δ]=det⁡(w)[Δ].

(5) Conventions. For n=0, W is trivial, Δ=J=1, N=0, 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 (−1)N. The polynomial Δ is coordinate-free; changing orthonormal coordinates substitutes the corresponding orthogonal change into its coordinate expression, while the proportionality scalar in J=cΔ changes by the determinant of that basis change. These are conventions, not proof inputs. No claim is made that A 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 f1,…,fn, and B-orthonormal coordinates.

[F2]

The finite reflecting arrangement has chambers whose interiors have trivial point stabilizer; every nonzero vector lies in a unique open face wCI, and a point of that face has stabilizer wWIw−1; for I={s}, WI={1,s} (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)).

[F3]

Under the stated Choice assumption, the invariant Hilbert series is ∏i(1−tdi)−1, the coinvariant Hilbert series is ∏i(1+t+⋯+tdi−1), and the full normalized Molien identity is

∏i(1−tdi)−1=1∣W∣∑w∈Wdet⁡(1−tw∣VC∗)−1

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).

[F6]

S0 is the iterated polynomial ring over C (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 S0/(ℓ) with a polynomial domain in n−1 variables, so (ℓ) is prime. Two linear forms are associates exactly when they are proportional: degree comparison forces any multiplier between them to be constant.

[F7]

The polynomial action is the contragredient substitution action, invariants form the graded subalgebra R, and I=S0R+ is homogeneous (Finite linear invariant and coinvariant polynomial algebras, Nonnegatively graded rings and modules, homogeneous elements, and twists).

[F8]

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 det⁡(AB)=det⁡(A)det⁡(B) (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F9]

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

technique · Compare the first two Laurent coefficients of the normalized Molien identity, then use reflection divisibility and a coefficient-factorial pairing. All calculations are in polynomial rings or finite-dimensional spaces
1.1givenF1F3

If n=0, then W={1}, S0=R=A=C, and every family and product is empty; all clauses follow. If n=1, the Coxeter group is W={1,s}, T={s} and N=1. For its single degree d1, [F3] gives 11−td1=12(11−t+11+t). With δ=1−t, the left side is d1−1δ−1+(d1−1)/(2d1)+O(δ) and the right side is 12δ−1+14+O(δ); comparing the δ−1 and constant coefficients gives d1=2 and d1−1=1=N. In rank one, write the unit positive-root form as Δ=εx1 with ε=±1. Invariance under x1↦−x1 gives R=C[x12]; the degree-two basic generator is f1=ax12 with a≠0, so I=(x12), J=2ax1=(2a/ε)Δ, and the anti-invariant polynomials are precisely the odd polynomials ΔR. The quotient has basis 1,[x1], so its top component is the nonzero sign line spanned by [Δ]. This proves every clause for n=1. In the rest of the proof assume n≥2.

1.2F1F2algebra

For n≥2, let g≠1 have fixed space of codimension one in VC. Because its matrix is real, the real and complex fixed spaces have the same codimension, so H:=Fix⁡V(g) is a real hyperplane. If H were not in the finite reflecting arrangement, a point x∈H outside every arrangement hyperplane could be chosen: for each proper subspace cut out on H, choose a nonzero linear form vanishing there; their product is a nonzero polynomial on H, which cannot vanish everywhere over R (by induction on dim⁡H). It would lie in a chamber interior, whose point stabilizer is trivial by [F2], contrary to gx=x. Hence H is an arrangement hyperplane. The same finite-union argument chooses x∈H outside all other distinct arrangement hyperplanes; x is nonzero. By [F2], x∈w0CI for some I⊊S. Since x lies on an arrangement hyperplane, I is nonempty; the walls indexed by I are distinct because their normals are the images of distinct basis vectors under the invertible map ρ(w0). They all pass through x, so ∣I∣=1. For I={s}, [F2] gives Stab⁡W(x)=w0{1,s}w0−1; since g≠1 fixes x, it is the reflection w0sw0−1∈T. Conversely every element of T has a fixed hyperplane by [F1]. Thus the nonidentity elements with fixed-space codimension one are exactly the reflections.

2.1F3F5step 1.2algebra

Assume n≥2 and put δ=1−t. The left side of [F3] expands as ∏i(1−tdi)−1=δ−n∏idi(1+δ2∑i(di−1)+O(δ2)). In the normalized sum on its right, the identity contributes ∣W∣−1δ−n. Each of the N reflections contributes ∣W∣−1δ−(n−1)/(1+t)=12∣W∣δ−(n−1)+O(δ−(n−2)). For every other element, [F5] and step 1.2 give at most n−2 eigenvalues equal to 1 on VC∗: indeed rank⁡(M−T−I)=rank⁡(M−I), so the fixed dimensions on a representation and its dual agree. Its Molien term is therefore O(δ−(n−2)). Comparing the coefficients of δ−n and δ−(n−1) first gives ∏idi=∣W∣ and then ∑i(di−1)=N. The identity is a finite sum of rational functions, so these Laurent expansions compare coefficients without an infinite-limit interchange.

3.1F1F4F6F8step 2.1algebra

Write M=ρC(w) in the chosen orthonormal coordinates. The tuple F=(f1,…,fn) satisfies F(Mx)=F(x); differentiating gives DF(Mx)M=DF(x) and hence J(Mx)=det⁡(M)−1J(x)=det⁡(M)J(x), since M is real orthogonal. If x lies on the fixed hyperplane of tα, then J(x)=J(ρC(tα)x)=−J(x), so J vanishes there. After taking ℓα as one coordinate, restriction to ℓα=0 is the zero polynomial; thus ℓα divides J. If ℓα and ℓβ are proportional, nondegeneracy of BC gives α=cβ; since both roots are real with B-norm one, c=±1, and positivity of both roots gives c=1, so α=β. Thus the forms are pairwise nonproportional primes by [F6], and Δ divides J. Every determinant term of the Jacobian matrix has degree ∑i(di−1); [F4] makes this the degree of its nonzero determinant. Since deg⁡Δ=N, step 2.1 gives deg⁡J=deg⁡Δ, so J=cΔ for a nonzero scalar c. This proves (2), including anti-invariance of Δ. If an orthonormal basis changes by P, its coordinate expressions satisfy Δnew(y)=Δold(Py) and Jnew(y)=det⁡(P)Jold(Py). Listing the fixed roots in a different order leaves the product unchanged; replacing Φ+ by −Φ+ multiplies it by (−1)N.

4.1F1F6F7step 3.1algebra

If p∈S0det⁡, every reflection tα acts by determinant −1, so p vanishes on its fixed hyperplane and each ℓα divides p. The same pairwise-prime argument as in step 3.1 gives p=Δq for some q∈S0. By step 3.1, Δ is anti-invariant; applying any w to p=Δq and cancelling Δ in the domain S0 then gives w⋅q=q. Conversely, if q∈R, the product Δq is anti-invariant. The quotient q is unique because S0 is a domain and Δ≠0.

5.1F3F6F7F8F9step 2.1step 3.1step 4.1algebra∎

By [F3] the Hilbert series of A is ∏i(1+t+⋯+tdi−1), whose top degree is ∑i(di−1)=N by step 2.1 and whose top coefficient is 1, so AN is one-dimensional. For f=∑∣a∣=Nfaxa and g=∑∣a∣=Ngaxa in (S0)N, set ⟨f,g⟩:=∑∣a∣=Na! faga‾ with a!:=∏jaj!; this is positive definite. If p∈Rd is homogeneous with d>0 and f∈(S0)N−d, direct monomial expansion gives ⟨pf,Δ⟩=⟨f,p‾(∂)Δ⟩, where p‾(∂) conjugates the coefficients of p and substitutes the formal partial derivatives for its variables. For a real orthogonal matrix M, the chain rule, first on linear symbols and then by products and linearity, gives p‾(∂x)(q∘M)=(p‾(MT∂)q)∘M. Since MT=M−1∈W and real matrices preserve coefficientwise conjugation, p‾ is invariant and p‾(MT∂)=p‾(∂); thus this differential operator commutes with substitution by M. Since Δ∘M=det⁡(M)Δ by step 3.1, p‾(∂)Δ is anti-invariant. If d≤N it has degree N−d<N, so step 4.1 forces it to be zero; if d>N the derivative is already zero. Every homogeneous element of IN is a sum of such products pf, hence Δ is orthogonal to IN. But Δ is a nonzero real-coefficient polynomial, so ⟨Δ,Δ⟩>0; consequently Δ∉IN and [Δ]≠0 in AN. It spans this one-dimensional component and has the determinant action by step 3.1.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

The six exceptional Coxeter spectra: characteristic polynomials, orders and spectral exponents from exact matrices

Statement

Let Γ be one of the six labelled diagrams E6: (0,1),(1,2),(2,3),(3,4),(2,5),E7: (0,1),(1,2),(2,3),(3,4),(4,5),(2,6), E8: (0,1),(1,2),(2,3),(3,4),(4,5),(5,6),(2,7),F4: (0,1),(1,2),(2,3), H3: (0,1),(1,2),H4: (0,1),(1,2),(2,3), all edges labelled 3 except the single edges (1,2) of F4 labelled 4 and (0,1) of H3,H4 labelled 5; let (W,S) 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 V=RS with B(es,et)=−cos⁡(π/mst), ρ the canonical reflection representation, and c 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 E6:[0,2,4,1,3,5],E7:[0,2,4,1,3,5,6],E8:[0,2,4,6,1,3,5,7], F4:[0,2,1,3],H3:[0,2,1],H4:[0,2,1,3]. Then ρ(c) has exact order h and characteristic polynomial as follows, with spectral exponents r1,…,rn∈{1,…,h−1} defined by the eigenvalues ζhri:

E6: h=12,det⁡(X−ρ(c))=X6+X5−X3+X+1=Φ3Φ12,{ri}={1,4,5,7,8,11};

E7: h=18,det⁡(X−ρ(c))=X7+X6−X4−X3+X+1=Φ2Φ18,{ri}={1,5,7,9,11,13,17};

E8: h=30,det⁡(X−ρ(c))=X8+X7−X5−X4−X3+X+1=Φ30,{ri}={1,7,11,13,17,19,23,29};

F4: h=12,det⁡(X−ρ(c))=X4−X2+1=Φ12,{ri}={1,5,7,11};

H3: h=10,det⁡(X−ρ(c))=X3+(1−φ)X2+(1−φ)X+1=(X+1)(X2−φX+1),{ri}={1,5,9};

H4: h=30,det⁡(X−ρ(c))=X4+(1−φ)X3+(1−φ)X2+(1−φ)X+1,{ri}={1,11,19,29},

where φ=2cos⁡(π/5), φ2=φ+1, embedded in Q(ζh) for H3,H4 by φ=1+ζhh/5+ζh−h/5. In each case ∑iri=nh/2=∣Φ+∣ and each polynomial divides Xh−1; the matrices themselves (in the simple-root basis, with entries in Z, Z[2] or Z[φ]) are recorded case by case in the proof, and the F4 characteristic polynomial is rational so no embedding of 2 into Q(ζ12) is used.

Facts & Assumptions

Given: One of the six labelled diagrams of the statement with its Coxeter system (W,S), the space V=RS with Coxeter form B, the canonical reflection representation ρ, the bipartite Coxeter element c 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.

[F1]

B(es,es)=1 and B(es,et)=−cos⁡(π/m(s,t)) for s≠t; for a with B(a,a)≠0 the reflection ra(v)=v−2B(v,a)B(a,a)a is linear, involutive, fixes ker⁡B(−,a) pointwise and preserves B; the canonical homomorphism ρ satisfies ρ(s)=res and is faithful, every root has B-norm one, and ρ(wsw−1)=rρ(w)es (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)).

[F2]

The Coxeter diagram of an irreducible finite type is a tree with bipartition J⊔K; the colour-class products a,b, their product c=ab and h=ord⁡(c) are well defined and listing the classes in the other order replaces c by a conjugate element, so order and characteristic polynomial are unaffected; the Coxeter plane P=span⁡(u,v) is ρ(c)-invariant with ρ(c)∣P a rotation by 2π/h; the prefix roots ρi enumerate Φ+ with ∣Φ+∣=nh/2, and c−id 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)).

[F3]

The six diagrams of the statement are the standard diagrams E6,E7,E8,F4,H3,H4 of the classification, and for each of them B is positive definite, so W 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)).

[F4]

Trigonometric and square-root facts: cos⁡(π/4)=2/2 (The finite Viete cosine product and its positive nested-radical factors); for all real x, cos⁡(2x)=2cos⁡2x−1, sin⁡(2x)=2sin⁡xcos⁡x, cos⁡(x+y)=cos⁡xcos⁡y−sin⁡xsin⁡y, cos⁡(π−x)=−cos⁡x, cos⁡(π/2−x)=sin⁡x, sin⁡2x+cos⁡2x=1 (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); cos⁡(π/2)=0 and cosine is strictly decreasing on [0,π] (Quarter-turn values and shifts by pi/2 and pi, Signs, monotonicity intervals, and ranges of sine and cosine); 2cos⁡ucos⁡v=cos⁡(u+v)+cos⁡(u−v) and cos⁡u−cos⁡v=−2sin⁡u+v2sin⁡u−v2 (Product-to-sum and sum-to-product identities); every a≥0 has a unique a≥0 with a2=a (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}) and 0≤a<b implies a2<b2 (Squaring is monotone on the nonnegatives); sine and cosine are the power-series functions of Sine and cosine defined by their real power series.

[F5]

For M∈Mn(C): χM(X)=det⁡(XI−M) is the characteristic polynomial, whose coefficients are the determinants of the expansion of XI−M (For A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix); tr⁡(M) is the sum of the diagonal entries (The trace of a square matrix over a commutative ring); linearity follows termwise, and tr⁡(AB)=∑i,jaijbji=∑j,ibjiaij=tr⁡(BA), which also gives cyclicity for longer products; Aadj⁡(A)=adj⁡(A)A=det⁡(A)In (For every positive-sized square matrix over a commutative ring, Aadj⁡(A)=adj⁡(A)A=det⁡(A)I, Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring); ddtdet⁡(I−tM)=−tr⁡(adj⁡(I−tM)M) for the formal derivative (ddxdet⁡(I−xA)=−tr⁡(adj⁡(I−xA)A)); the formal derivative of polynomials is linear, satisfies the product rule and has ddttk=ktk−1 (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 det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F7]

Complexifying the real representation ρ gives ρC on VC=C⊗RV with the same operator matrices and characteristic polynomials in the basis 1⊗es; the eigenvalues of a real matrix acting on VC 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 A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix).

Proof

1.1F4algebra

(The trigonometric constants behind the edge labels.) Put c:=cos⁡(π/3). Since 0<π/3<π/2 and cosine is strictly decreasing on [0,π] with cos⁡(π/2)=0, we have c>0; the supplementary and double-angle identities give −c=cos⁡(π−π/3)=cos⁡(2π/3)=2c2−1, so 2c2+c−1=0, that is (2c−1)(c+1)=0, and c+1>0 forces c=1/2. Next put d:=cos⁡(π/5). Since 0<π/5<π/2 we have d>0, and cos⁡(π−2π/5)=−cos⁡(2π/5) with π−2π/5=3π/5 gives via the addition, double-angle and Pythagorean identities cos⁡(3π/5)=cos⁡(2π/5)cos⁡(π/5)−sin⁡(2π/5)sin⁡(π/5)=(2d2−1)d−2(1−d2)d=4d3−3d, while cos⁡(3π/5)=−cos⁡(2π/5)=−(2d2−1); hence 4d3+2d2−3d−1=0, that is (d+1)(4d2−2d−1)=0, and d+1>0 leaves 4d2−2d−1=0. Completing the square, (d−14)2=d2−d2+116=14+116=516, and (54)2=516 with 54≥0 (here 5 is the unique nonnegative square root of 5 and 5>0 because 5>0 is a nonzero square), so by uniqueness of nonnegative square roots d−14=±54 and d=1±54; since 5>1 by monotonicity of squaring on [0,∞) and 1<5, the root 1−54 is negative while d>0, so d=1+54. Define φ:=1+52=2d=2cos⁡(π/5) and p:=2cos⁡(π/4); then cos⁡(π/4)=2/2 gives p=2 and p2=2, while φ2=6+254=3+52=φ+1; finally the double-angle identity gives cos⁡(2π/5)=2d2−1=φ+12−1=φ−12, so 1+2cos⁡(2π/5)=φ.

2.1F1F2F3F7step 1.1

(The six matrices.) For t∈S let Rt be the matrix of ρ(st)=ret in the basis (es): ret(ej)=ej−2B(ej,et)et, so the j-th column of Rt is ej−2B(ej,et)et, and in particular the only nonzero off-diagonal entries of Rt lie in row t. Order the reflections as in the recorded application order i1,…,in and let M:=Rin⋯Ri1 be the matrix obtained by applying ri1 first and then successively ri2,…,rin to a vector; equivalently M is the matrix of ρ(c) for c:=sin⋯si1, the product of the two colour-class products in the order K then J (the classes commute internally), which is one of the two admissible orders of the bipartite definition and is conjugate to the element ab of [F2] since ba=a−1(ab)a. With cos⁡(π/3)=1/2, cos⁡(π/4)=2/2, cos⁡(π/5)=φ/2 from 1.1, so that B(ej,et) takes the values −12, −p2=−22 (which we write with the symbol p=2), −φ2, the resulting matrices are E6: (−110000−11−110101−110101−11−110001−1001−1100),E7: (−1100000−11−1100101−1100101−11−1110001−1100001−10001−11000), E8: (−11000000−11−11000101−11000101−11−11010001−11000001−11−10000001−1001−110000),F4: (−1100−12−pp0p−110p−10), H3: (−1p0−p1+p−101−1),H4: (−1p00−p1+p−1101−1101−10), with p=2 in the F4 matrix and p=φ in the H3 and H4 matrices; the entries lie in Z, Z[2] or Z[φ], and M is obtained from these entries over C through the embeddings 2↦2, φ↦φ. Since each Rt preserves B and is an involution [F1], each Rt satisfies RtTGRt=G for the Gram matrix G=(B(es,et)), and so does the product M; in particular M has finite order because W is finite [F3] and ρ is a homomorphism, and M is the matrix of a Coxeter element of the type.

3.1F5step 2.1

(Newton's identities from the cofactor identity.) Let M∈Mn(C) be any of the six matrices of step 2.1 and write the expansion χ(t):=det⁡(I−tM)=∑k=0n(−1)kektk with e0:=1, so that det⁡(XI−M)=∑k(−1)kekXn−k. Put A(t):=adj⁡(I−tM) and pi:=tr⁡(Mi) for i≥1. Then for every 1≤k≤n, k ek=∑i=1k(−1)i−1ek−i pi. Indeed the entries of A(t) are cofactors of I−tM, hence determinants of (n−1)×(n−1) matrices whose entries are affine in t, so A(t)=∑k=0n−1Cktk with Ck∈Mn(C); the adjugate identity (I−tM)A(t)=χ(t)In gives, on comparing coefficients of tk for 0≤k≤n, the recursion C0=In and Ck=MCk−1+(−1)kekIn for 1≤k≤n−1 (the coefficient of tn only records 0=Cn=MCn−1+(−1)nenIn and is not used); induction on k gives Ck=∑j=0k(−1)jejMk−j for 0≤k≤n−1. Differentiating the adjugate identity gives χ′(t)=−tr⁡(A(t)M) by [F5]; the left side is ∑k=1nk(−1)kektk−1 and the right side −∑k=0n−1tr⁡(CkM)tk, so comparing coefficients of tk for 0≤k≤n−1 gives (k+1)(−1)k+1ek+1=−tr⁡(CkM). Taking traces in the displayed expansion of Ck and using linearity, cyclicity and pi=tr⁡(Mi) gives tr⁡(CkM)=∑j=0k(−1)jejpk+1−j; substituting and multiplying by (−1)k+1 yields (k+1)ek+1=∑i=1k+1(−1)i−1ek+1−ipi, which is the displayed identity with k replaced by k+1.

4.1step 2.1step 3.1algebra

(Traces and characteristic polynomials of the six matrices.) Computing the powers Mi by exact matrix multiplication of the matrices of step 2.1 gives the following power sums, with p=2 in the F4 case and p=φ in the H3, H4 cases: E6: (p1,…,p6)=(−1,1,2,−3,−1,−2);E7: (p1,…,p7)=(−1,1,2,1,−1,−2,−1); E8: (p1,…,p8)=(−1,1,2,1,4,−2,−1,1);F4: (p1,…,p4)=(0,2,0,−2); H3: (p1,p2,p3)=(φ−1,φ,−φ);H4: (p1,…,p4)=(φ−1,φ,2φ,1−φ). (For instance the E6 matrix has diagonal entries −1,1,−1,1,−1,0, whose sum is −1=p1; the higher power sums are the same finite computation.) Applying the Newton identities of step 3.1 successively for k=1,2,…,n determines the coefficients ek in the order k=1,2,… alone, and gives: E6: (e1,…,e6)=(−1,0,1,0,−1,1),det⁡(XI−M)=X6+X5−X3+X+1; E7: (e1,…,e7)=(−1,0,1,−1,0,1,−1),det⁡(XI−M)=X7+X6−X4−X3+X+1; E8: (e1,…,e8)=(−1,0,1,−1,1,0,−1,1),det⁡(XI−M)=X8+X7−X5−X4−X3+X+1; F4: (e1,…,e4)=(0,−1,0,1),det⁡(XI−M)=X4−X2+1; H3: (e1,e2,e3)=(φ−1,1−φ,−1),det⁡(XI−M)=X3+(1−φ)X2+(1−φ)X+1; H4: (e1,…,e4)=(φ−1,1−φ,φ−1,1),det⁡(XI−M)=X4+(1−φ)X3+(1−φ)X2+(1−φ)X+1, where each coefficient is obtained from the displayed Newton identity by the finite exact arithmetic in Z, Z[2] or Z[φ], using φ2=φ+1 for the H3 and H4 cases.

5.1F2F6F7step 2.1step 4.1algebra

(Cyclotomic factorisations, E6, E7, E8, F4.) The computable cyclotomic polynomials are Φ2=X+1, Φ3=X2+X+1, Φ12=X4−X2+1, Φ18=X6−X3+1 and Φ30=X8+X7−X5−X4−X3+X+1; expanding the products coefficientwise gives Φ3Φ12=X6+X5−X3+X+1, Φ2Φ18=X7+X6−X4−X3+X+1 and Φ12=X4−X2+1, so by step 4.1 the E6, E7, E8 and F4 characteristic polynomials equal respectively Φ3Φ12, Φ2Φ18, Φ30 and Φ12. Since M is the matrix of the finite-order operator ρC(c) [F7], M is diagonalisable and its eigenvalue multiset is the root multiset of its characteristic polynomial; by [F6] the roots of Φm are the primitive m-th roots of unity, namely ζ12r with r∈{1,5,7,11} for Φ12, ζ124,ζ128 for Φ3, ζ189=−1 for Φ2, ζ18r with r∈{1,5,7,11,13,17} for Φ18, and ζ30r with r∈{1,7,11,13,17,19,23,29} for Φ30. Hence the eigenvalue multisets are {ζ12r:r∈{1,4,5,7,8,11}} for E6, {ζ18r:r∈{1,5,7,9,11,13,17}} for E7, {ζ30r:r∈{1,7,11,13,17,19,23,29}} for E8 and {ζ12r:r∈{1,5,7,11}} for F4; in particular each characteristic polynomial divides the corresponding Xh−1 (because Φm∣Xm−1∣Xh−1 when m∣h), and in each case ζh is a root, so the order of M is a multiple of h; since every eigenvalue is an h-th root of unity and M is diagonalisable, Mh=I, so the order of M is exactly the displayed integer h. Faithfulness from [F7] implies ρC(c)k=I if and only if ck=1, hence this is also the group order of c used in [F2].

5.2F2F4F6F7step 4.1algebra

(H3 and H4.) For H3 the right side of step 4.1 expands as (X+1)(X2−φX+1)=X3+(1−φ)X2+(1−φ)X+1; by [F6] the roots of X2−φX+1 are the two complex numbers with sum φ and product 1, and eiπ/5 and e−iπ/5 have sum 2cos⁡(π/5)=φ and product 1, so they are the roots; with ζ10=e2πi/10=eiπ/5 and −1=ζ105 the eigenvalue multiset of M is {ζ101,ζ105,ζ109}. For H4 the four numbers ζ301,ζ3011,ζ3019,ζ3029 lie in inverse pairs, so the monic quartic with these roots is (X2−aX+1)(X2−bX+1)=X4−(a+b)X3+(ab+2)X2−(a+b)X+1 with a=ζ30+ζ30−1=2cos⁡(π/15) and b=ζ3011+ζ30−11=2cos⁡(11π/15)=−2cos⁡(4π/15); then ab=−4cos⁡(π/15)cos⁡(4π/15)=−2(cos⁡(π/3)+cos⁡(−π/5))=−(1+φ)=−φ2 and a+b=2(cos⁡(π/15)−cos⁡(4π/15))=2⋅2sin⁡(π/6)sin⁡(π/10)=2sin⁡(π/10)=2cos⁡(2π/5)=φ−1, using the product-to-sum and sum-to-product identities, cos⁡(−π/5)=cos⁡(π/5)=φ/2, cos⁡(π/3)=1/2, sin⁡(π/6)=cos⁡(π/3)=1/2 and sin⁡(π/10)=cos⁡(2π/5); hence the monic quartic with roots ζ30±1,ζ30±11 equals X4−(φ−1)X3+(−φ2+2)X2−(φ−1)X+1=X4+(1−φ)X3+(1−φ)X2+(1−φ)X+1, because −φ2+2=1−φ and −(φ−1)=1−φ; this is exactly the H4 polynomial computed in step 4.1, so the eigenvalue multiset of M is {ζ301,ζ3011,ζ3019,ζ3029}, and the relation φ=1+ζ306+ζ30−6=1+2cos⁡(2π/5) is the embedding recorded in the statement (for H3 the corresponding relation is φ=1+ζ102+ζ10−2). In both cases all eigenvalues are h-th roots of unity, M is diagonalisable and ζh occurs among them, so the order of M is exactly the displayed integer h (the same argument as in 5.1); faithfulness from [F7] again identifies it with ord⁡(c). Finally the displayed residue lists have sums 36,63,120,24,15,60 for E6,E7,E8,F4,H3,H4, which are exactly nh/2 and hence equal ∣Φ+∣ by [F2].

6.1F5step 1.1step 2.1step 3.1step 4.1step 5.1step 5.2∎

(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 Z, Z[2] or Z[φ], 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 Xh−1 and has ζh as a root, the orders are exactly h, and the residue sums equal nh/2=∣Φ+∣. 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 2 into Q(ζ12) is used; the element whose matrix is displayed is the product of the colour-class products in the recorded order, conjugate to the element ab of the bipartite definition [F2], so the conclusions hold for c as well; and the dual-action matrices in the local certificate research/coxeter-scaffold/math-checks/finite-degree-poincare-certificates.json are M−T, not MT. Indeed the dual of each involutive reflection has matrix RtT, and the same application order gives M−T. From MTGM=G we obtain M−T=GMG−1; hence its characteristic polynomial agrees with that of M.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-08Open item page →

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 (W,S) be an irreducible Coxeter system of finite type, n=∣S∣, with V, B, ρC, Φ+, T, 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 c be the bipartite Coxeter element with order h and Coxeter plane P=span(u,v), prefix roots ρi and the conclusion ∣Φ+∣=nh/2 (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 d1≤⋯≤dn and ei=di−1 be the basic degrees and exponents of Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system. Put N:=∣Φ+∣. Then:

(1) Exponent-residue identification. The multiset of exponents equals the multiset of spectral exponents of ρC(c): after relabelling, ei=ri, where r1,…,rn∈{1,…,h−1} are the residues with ρC(c)-eigenvalues ζhr1,…,ζhrn (each eigenvalue counted with multiplicity). Consequently ∑iei=N=∣Φ+∣=nh/2, the eigenvalues of ρC(c) are exactly ζhe1,…,ζhen, and h=max⁡idi, min⁡idi=2.

(2) Complete degree tables. Combining (1) with the classical and exceptional spectra: An: 2,3,…,n+1;Bn: 2,4,…,2n;Dn: 2,4,…,2n−2 and n; I2(m): 2,m;E6: 2,5,6,8,9,12;E7: 2,6,8,10,12,14,18;E8: 2,8,12,14,18,20,24,30; F4: 2,6,8,12;H3: 2,6,10;H4: 2,12,20,30.

These degree lists are multisets; when n is even, the degree n in type Dn is counted twice. With the conventions A1: degree 2; the coincidences A2=I2(3), B2=I2(4), G2=I2(6), A3=D3 and A1×A1=I2(2) of Classification of finite Coxeter systems, including the H and dihedral families (4) (for the extended convention I2(2)=A1×A1 the multiset is {2,2}, covered by (3)); and products of these degree multisets for reducible types as in (3). In each case ∏idi=∣W∣.

(3) Reducible systems. If (W,S)=(WS1×⋯×WSk) with connected components S1,…,Sk and VC=⨁jVC,j the BC-orthogonal decomposition (Disconnected diagrams, direct products, and comparison of invariant forms), then C[VC]W=⨂jC[VC,j]WSj as graded algebras, the degree multiset of W 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 n=1 (A1) the assertions are direct; for n=0 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 (W,S) of rank n≥2, its complex reflection representation, bipartite Coxeter element c of order h, Coxeter plane, positive roots, reflecting hyperplanes and fixed homogeneous basic invariants p1,…,pn with degrees d1≤⋯≤dn; rank zero and rank one are treated separately below.

[F1]

Under AC, the fixed basic family exists, its degrees satisfy di≥2, and its exponents are ei=di−1>0; each pi is homogeneous, W-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).

[F3]

For irreducible finite type, c acts on its Coxeter plane P as rotation by 2π/h; the traces Hα∩P are exactly the h reflection lines, c−id is invertible (so its complexification C−I is invertible), and Φ+={ρ1,…,ρnh/2}, so ∣Φ+∣=nh/2 (The Coxeter plane, ordered-root enumeration, and invertibility of rho(c) - id (2)-(4)).

[F4]

The invariant Jacobian J=det⁡(dpi/dxj) is nonzero; it is a nonzero scalar multiple of the discriminant Δ=∏α∈Φ+ℓα, whose zero set is the union of the complexified reflecting hyperplanes; and ∑iei=∣Φ+∣=∣T∣ (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)).

[F5]

For a finite type Coxeter system under AC, dim⁡CA=∏idi=∣W∣, 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)).

[F6]

The real matrix ρC(c) 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 M, χMT(X)=det⁡((XI−M)T)=det⁡(XI−M)=χM(X), by det⁡(AT)=det⁡(A), so the eigenvalues of M and MT agree with multiplicity (Over an algebraically closed field of characteristic 0, every element of finite order acts diagonalisably in a finite-dimensional representation, For A∈Mn(F), the characteristic polynomial is χA(x)=det⁡(xIn−A) when n≥1, with χA(x)=1 for the unique 0×0 matrix, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix, Eigenvalues, eigenvectors, eigenspaces Eλ(T)=ker⁡(T−λI), and the spectrum σF(T) of an endomorphism, The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity, The n-th roots of a complex number and the n distinct roots of unity for every n≥1). Over a field, a positive-sized square matrix is invertible exactly when its determinant is nonzero (A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit); hence det⁡(λI−M)=0 exactly when λ is an eigenvalue.

[F7]

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).

Proof

technique · At a regular Coxeter eigenvector the gradients of the basic invariants form a basis. Their covariance gives the degrees modulo $h$; a real-spectrum sum and the discriminant degree remove all possible multiples of $h$
1.1F2F3F4F6algebra

Assume first that W is irreducible and n≥2. Let P=span⁡R(u,v) be the Coxeter plane. Choose real vectors ξ,η forming a basis of P so that x=ξ+iη is an eigenvector of C:=ρC(c) with eigenvalue ζh−1; this is possible because C∣P is rotation by 2π/h [F2, F3]. If x lay in a complexified reflecting hyperplane Hα⊗RC, then its real and imaginary parts ξ,η would both lie in Hα, so P⊆Hα. But Hα∩P is a line by [F3], so no reflecting hyperplane contains P. Therefore every factor of Δ(x) is nonzero and J(x)≠0 by [F4]. The matrix (dpi(x))i=1n is thus invertible, and dp1(x),…,dpn(x) form a basis of VC∗ [F4].

1.2F5F7algebra

Let the connected components of a reducible diagram be S1,…,Sk, with corresponding spaces VC,j and groups Wj. By [F7], W=∏jWj acts on VC=⨁jVC,j factorwise, and the coordinate polynomial algebra is C[VC]=⨂jC[VC,j]. To compute invariants, expand any polynomial as a finite sum of block monomials with coefficients in the other blocks. Invariance under Wj forces every coefficient in the j-th block to be Wj-invariant; doing this for each factor proves C[VC]W=⨂jC[VC,j]Wj, 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 Ij is the ideal generated by positive-degree invariants in the j-th block, then the positive-degree ideal of ⨂jC[VC,j]Wj generates precisely I=∑jIj C[VC]: every positive-degree pure tensor has at least one positive-degree factor, and each Ij is generated by invariants of the full product. The tensor-product quotient is consequently C[VC]/I≅⨂j(C[VC,j]/Ij), which is the asserted tensor decomposition of coinvariant algebras. By [F5] the product of all degrees is ∣W∣=∏j∣Wj∣. There is no common Coxeter number for unequal component orders, and this clause uses no global h.

2.1F1F2F3F6step 1.1

For each i and all y∈VC, pi(Cy)=pi(y) because pi is invariant [F1]. Differentiate this identity at y=x in an arbitrary direction v to get dpi(Cx)(Cv)=dpi(x)(v), or dpi(Cx)∘C=dpi(x). Since Cx=ζh−1x and pi is homogeneous of degree di, dpi(ζh−1x)=ζh−(di−1)dpi(x); hence dpi(x)∘C=ζhdi−1dpi(x)=ζheidpi(x). These covectors form a basis by 1.1, so the eigenvalue multiset of the transpose action is {ζhei}i=1n. A matrix and its transpose have the same characteristic polynomial, so this is also the eigenvalue multiset of C, with multiplicity [F1, F2, F6, step 1.1, algebra]. By [F3], C−I is invertible, so 1 is not an eigenvalue. Thus each ei is congruent modulo h to a unique residue in {1,…,h−1}, and these residues, counted with multiplicity, are exactly the spectral exponents r1,…,rn of the statement [F2, F3, F6].

3.1F1F3F4step 2.1

The matrix C is real by [F2], so its nonreal eigenvalues pair as ζhr,ζh−r=ζhh−r with equal multiplicity; each such pair contributes h to the sum of residues. The only real h-th roots of unity are 1 and, when h is even, −1; 1 is excluded by 2.1, while each occurrence of −1=ζhh/2 contributes h/2. Partitioning the full eigenvalue multiset into these pairs and occurrences of −1 therefore gives ∑iri=nh/2 [F2, F3, F6, algebra]. By [F4], ∑iei=∣Φ+∣=nh/2 as well. Since each positive integer ei is congruent to a residue r in {1,…,h−1}, it has the form ei=r+hqi with an integer qi≥0; the residue multiset and exponent multiset have the same cardinality, and the equal sums force every qi=0. Thus the exponent multiset is exactly the spectral-residue multiset, proving (1)'s identification and sum claim.

4.1F3step 3.1

The rotation on P has eigenvalues ζh and ζh−1=ζhh−1, so the spectral residues 1 and h−1 both occur, counted with multiplicity (when h=2 these are the same residue and the eigenvalue occurs with multiplicity two on P). By 3.1 the same residues occur among the ei. Therefore min⁡iei=1 and max⁡iei=h−1, which gives min⁡idi=2 and max⁡idi=h.

4.2F5F7

Add 1 to each spectral exponent from the two computed spectrum suppliers. The classical lists give An:2,3,…,n+1, Bn:2,4,…,2n, Dn:2,4,…,2n−2 together with n, and I2(m):2,m. The exceptional lists give E6:2,5,6,8,9,12, E7:2,6,8,10,12,14,18, E8:2,8,12,14,18,20,24,30, F4:2,6,8,12, H3:2,6,10, and H4:2,12,20,30 [F8, step 3.1]. The classification's coincidence conventions identify A2=I2(3), B2=I2(4), G2=I2(6), A3=D3, and, with the extended notation, A1×A1=I2(2); for the last case the degrees are the union {2,2} [F7]. The product-degree formula ∏idi=∣W∣ is [F5], so it holds for every listed irreducible type and for the reducible unions.

5.1F1F5F7algebra∎

If n=0, then W is trivial, the invariant and coinvariant algebras are C, and all degree, exponent and product assertions are empty, with empty products equal to 1 [F1, F5]. If n=1, the irreducible system is A1: its generator acts by x↦−x, so the invariant ring is C[x2], the basic degree is 2, c=s has order h=2 and eigenvalue −1=ζ2, the sole exponent/residue is 1, ∣Φ+∣=1=nh/2, and the coinvariant algebra is C[x]/(x2). 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