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.

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

Depends on

Used by

Dependency tree · two levels

127 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