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

Depends on

Used by

Cited to discharge well-definedness by Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system.

Dependency tree · two levels

106 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