Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-08
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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

Depends on

Used by

Dependency tree · two levels

165 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources