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

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

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

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

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

Depends on

Used by

Dependency tree · two levels

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

Sources