Invariant Theory — Mathematics Knowledge System

Overview

Invariant theory studies the ring of polynomials (or more general algebraic objects) that are fixed under the action of a group. The fundamental questions are: is the invariant ring finitely generated? Is it Cohen--Macaulay? What are its generators and relations? Classical invariant theory (19th century) focused on binary forms; Hilbert's finite generation theorem (1890) and the 14th problem (about finite generation of more general invariant rings) transformed the field. Modern invariant theory connects to geometric invariant theory (GIT), representation theory, commutative algebra, and algebraic geometry.

Intuition

If a group G acts on a vector space V, it also acts on the polynomial ring k[V]. The invariant ring k[V]^G consists of all polynomials unchanged by every g ∈ G. For example, if G = S_n acts on ℝ^n by permuting coordinates, then k[x₁,…,xₙ]^{S_n} = k[e₁,…,eₙ] is freely generated by the elementary symmetric polynomials eₖ.

Formal Definition

Definition

Let G be a group acting on a vector space V over a field k. G acts on the polynomial ring k[V] = k[x₁,…,xₙ] by (g·f)(v) = f(g⁻¹·v). The invariant ring is the subring of G-fixed polynomials.

k[V]^G = \{f \in k[V] : g \cdot f = f \;\forall g \in G\}

Invariant ring

(g \cdot f)(x_1,\ldots,x_n) = f(g^{-1} \cdot (x_1,\ldots,x_n))

G-action on polynomials by substitution

R^G \text{ is Noetherian} \iff R^G \text{ is finitely generated over } k \quad (G \text{ linearly reductive})

Hilbert--Nagata theorem: finite generation for linearly reductive G

\beta(G) = \max\{d : \exists f \in k[V]^G_d \text{ not in subalgebra generated by lower degree invariants}\}

Noether number: degree bound for generators

Notation

Notation	Meaning
$k[V]^G$	Invariant ring of G acting on k[V]
$\beta(G)$	Noether number -- degree bound for generators of k[V]^G
$V /\!\!/ G$	GIT quotient = Spec(k[V]^G)

Properties

Reynolds operator

R : k[V] \to k[V]^G, \quad R(f) = \frac{1}{|G|}\sum_{g \in G} g \cdot f

Cohen--Macaulay property

For G a finite group in characteristic 0, k[V]^G is always Cohen--Macaulay.

Symmetric polynomials

k[x_1,\ldots,x_n]^{S_n} = k[e_1,\ldots,e_n] \text{ -- freely generated by elementary symmetric polynomials}

Theorems

Theorem 1: Hilbert's finite generation theorem

If G is a linearly reductive algebraic group acting on a finitely generated k-algebra R, then R^G is finitely generated over k.

Theorem 2: Noether's degree bound

For a finite group G of order n acting on k[V] with \mathrm{char}(k) = 0, the invariant ring k[V]^G is generated by elements of degree \leq n = |G|.

Theorem 3: Chevalley--Shephard--Todd theorem

If G is a finite subgroup of GL(V) generated by pseudo-reflections (elements fixing a hyperplane), then k[V]^G is a polynomial ring k[f_1,\ldots,f_n] with deg(f_i) = d_i.

Theorem 4: Molien's formula

\sum_{d \geq 0} (\dim k[V]^G_d) t^d = \frac{1}{|G|}\sum_{g \in G} \frac{1}{\det(I - tg)}

Worked Examples

1
G = {id, σ} where σ(x) = -x, σ(y) = -y. Invariant polynomials are those unchanged by this sign change.
$k[x,y]^{\mathbb{Z}/2} = \{f : f(-x,-y) = f(x,y)\}$
2
These are polynomials with only even-degree terms: span of monomials x^a y^b with a+b even.
$k[x,y]^G = k[x^2, xy, y^2]$
3
The ring k[x², xy, y²] is generated by three elements satisfying one relation: (xy)² = x²·y².
$(xy)^2 = x^2 \cdot y^2$

✓ Answer

k[x,y]^{ℤ/2} = k[x², xy, y²] ≅ k[a,b,c]/(b²-ac).

Practice Problems

Hardfree response

Use Molien's formula to compute the Hilbert series of k[x,y]^{S₂} where S₂ acts by swapping x and y.

Hardproof writing

Prove that the Reynolds operator R: k[V] → k[V]^G is a projection onto invariants and satisfies R(fg) = fR(g) for f ∈ k[V]^G.

Common Mistakes

Common Mistake

Thinking invariant rings are always polynomial rings

The invariant ring k[V]^G is a polynomial ring only when G is generated by pseudoreflections (Chevalley--Shephard--Todd). In general, it has generators and relations (it is a Cohen--Macaulay ring but not necessarily regular).

Common Mistake

Assuming Hilbert's 14th problem has a positive answer for all groups

Nagata (1958) gave a counterexample to Hilbert's 14th problem: a non-reductive unipotent group G acting on a polynomial ring where the invariant ring is not finitely generated.

Quiz

Hilbert's finite generation theorem applies to groups G that are:

All groupsLinearly reductiveAbelianFinite

The Reynolds operator R: k[V] → k[V]^G satisfies:

R is injectiveR is the average (1/|G|)Σ_{g∈G} g and is a projection onto invariantsR sends every polynomial to zeroR is an algebra homomorphism

Historical Background

Cayley, Sylvester, and Clebsch developed the classical theory of covariants and invariants of binary forms (homogeneous polynomials in two variables) in the mid-19th century. Hilbert's 1890 proof that the invariant ring of a linearly reductive group acting on a polynomial ring is finitely generated (using Hilbert's basis theorem) was revolutionary -- and initially controversial, as it gave no explicit generators. Noether (1916) proved that for finite groups in characteristic 0, the invariant ring is generated by elements of degree at most |G|. Mumford's geometric invariant theory (1965) gave a modern algebro-geometric framework for forming quotients by group actions.

1845
Cayley introduces the theory of binary forms and invariants
Arthur Cayley
1890
Hilbert proves finite generation of invariant rings for linearly reductive groups
David Hilbert
1916
Noether proves invariant ring of a finite group is generated in degree ≤ |G|
Emmy Noether
1965
Mumford's geometric invariant theory (GIT)
David Mumford

Summary

The invariant ring k[V]^G is the subring of polynomials fixed by all g ∈ G.
Hilbert's theorem: k[V]^G is finitely generated when G is linearly reductive.
Noether's bound: for |G| < ∞ in char 0, generators exist in degree ≤ |G|.
The Reynolds operator R(f) = (1/|G|)Σg·f is the projection onto k[V]^G.
CST theorem: G generated by pseudoreflections implies k[V]^G is a free polynomial ring.
Molien's formula computes the Hilbert series of k[V]^G for finite G.

References

BookSturmfels, B. -- Algorithms in Invariant Theory, 2nd ed. (2008), Chapters 1--3
BookDerksen, H. & Kemper, G. -- Computational Invariant Theory (2002), Chapters 1--2
BookBenson, D.J. -- Polynomial Invariants of Finite Groups (1993)
WebsiteWikipedia -- Invariant theory
WebsiteMathWorld -- Invariant Theory