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 be a Coxeter system of finite type, , and let , , , , , and a fixed basic family with degrees and exponents be as in Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system (so is a minimal homogeneous generating family of , generates , is algebraically independent, and gives a graded isomorphism , , with ).
(1) Multiset independence. If is any other minimal homogeneous generating family of with degrees , then as multisets. Hence the nondecreasing degree sequence , the exponents and the degree count are invariants of the pair .
(2) Hilbert series. and as formal power series (The Hilbert function and formal Hilbert series of a graded module with finite-length pieces).
(3) Order formula. , and is the top degree of .
(4) Molien identity. as formal power series, the determinants expanded as finite products over the eigenvalues of on .
(5) Conventions. For all products are empty and equal , and . For reducible 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 of finite type, and a basic family as in the statement.
is a minimal finite family of homogeneous positive-degree invariants generating , it generates as a -algebra and is algebraically independent; under AC any minimal such family has exactly elements, and every (Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system, Finite reflection invariant generators are algebraically independent).
The complexification is a finite subgroup of order , generated by complex reflections, faithful, and (Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers).
Assume AC. For the finite complex reflection group : is a polynomial algebra and is graded free of rank over it; minimal homogeneous invariant generators of form an -regular sequence with common zero set ; and , (Chevalley shephard todd for finite weyl groups, Reflection basic invariants form a regular sequence, Weyl coinvariant hilbert series has order w dimension).
The Reynolds operator is a graded -linear projection of onto , and it preserves each finite-dimensional graded piece ; and the coinvariant algebra carry their quotient gradings (Finite linear invariant and coinvariant polynomial algebras).
The Hilbert function of a graded module is of its -th piece when the pieces are finite-dimensional, and its formal Hilbert series is ; 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).
An operator of finite order on a finite-dimensional complex vector space is diagonalisable (Over an algebraically closed field of characteristic , 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.
If has connected components on , then via multiplication, and is a -orthogonal direct sum on which preserves and fixes every , (Disconnected diagrams, direct products, and comparison of invariant forms (1),(2)); for finite type each component is one of the classified finite diagrams and 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).
is the iterated polynomial ring over , 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
Put . For any finite minimal homogeneous generating family of , its classes span the graded complex vector space : modulo , coefficients in an expression reduce to their constants. These classes are independent. Indeed, a nonzero homogeneous relation would give with some . Since the generate , its right side can be written with homogeneous of degree . Such vanish when , so solving for expresses it in the ideal generated by the other , contrary to minimality. Every relation splits into homogeneous ones, proving independence. Thus the number of degree- members in any such family is . 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 the minimal family and quotient are empty.
For the fixed invariant basic family, [F1] gives the graded isomorphism with and . Counting its monomials gives . 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.
Since is homogeneous, and are graded with finite-dimensional pieces, so the Hilbert series of [F5] apply. By step 1.2, . Under the stated AC the group is a finite complex reflection group of order on the -dimensional space with invariant algebra and positive-degree ideal , so [F3] gives , and evaluating at gives ; since each factor is a polynomial of degree , the product is a polynomial of degree with leading coefficient , so is the top degree of .
Fix . By [F2] and [F6] the operator induced by on the finite-dimensional space is diagonalisable; let be its eigenvalues with multiplicity, and note that . The induced operator on () has, in the monomial basis attached to an eigenbasis of , the eigenvalues over all with ; summing gives the formal identity [F5]. The Reynolds operator is a projection of onto [F4], and for a projection the trace equals the dimension of its image, so ; summing over and using the previous identity gives , and combining with of 2.1 proves the Molien identity (4).
For the group is trivial, , , , and every displayed product is empty and equals , 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] and with preserving and fixing the other summands. Choose coordinates adapted to this decomposition, so that with the coordinates of the -th summand [F8]. For and any , the Reynolds operator of acts only on the block and, because is -invariant, leaves it unchanged; expanding in the monomials of the remaining blocks and applying expresses as a finite sum of products of a -invariant polynomial in the block with a polynomial in the other blocks. Applying successively (each application leaves unchanged and replaces one block factor by its invariant part) gives : the invariant algebra is generated by the component invariant algebras [F4, F8]. If for each we fix a basic family of the component , then the concatenated family is homogeneous of positive degrees, generates , 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 because its members generate and have positive degrees. It is also minimal as an -ideal generating family: any redundancy, after Reynolds averaging its coefficients [F4], would express one member as an -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 in . 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 -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
- Basic degrees, exponents, and the graded coinvariant algebra of a finite Coxeter system
- Complexifying a finite Coxeter reflection representation: faithfulness, complex reflections, and the hypotheses of the invariant-theory suppliers
- Coxeter matrices, the presented Coxeter group, reduced words, length, and standard parabolic subgroups
- Classification of finite Coxeter systems, including the H and dihedral families
- Disconnected diagrams, direct products, and comparison of invariant forms
- Finite linear invariant and coinvariant polynomial algebras
- Finite reflection invariant generators are algebraically independent
- Reflection basic invariants form a regular sequence
- Weyl coinvariant hilbert series has order w dimension
- Chevalley shephard todd for finite weyl groups
- Polynomial rings in finitely many commuting indeterminates by iteration
- The Hilbert function and formal Hilbert series of a graded module with finite-length pieces
- Nonnegatively graded rings and modules, homogeneous elements, and twists
- Over an algebraically closed field of characteristic $0$, every element of finite order acts diagonalisably in a finite-dimensional representation
- The Axiom of Choice
- Similar matrices over a commutative ring have the same determinant
Used by
- A regular Coxeter eigenvector determines the basic degrees: the exponent-residue identification and the complete degree tables for all finite Coxeter types Theorem
- The total degree sum, the invariant Jacobian as the discriminant, anti-invariants, and the top coinvariant class Theorem
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
- Pavel Etingof, Representations of Lie Groups (MIT 18.757 course notes, 162-page PDF) (standard reference, not scraped)
- Josh Swanson, On eigenvalues of representations of reflection groups and wreath products (University of Washington CAT seminar notes, 7-page PDF) (standard reference, not scraped)