Crystallography & Symmetry
patterns derived from their groups
Concept

Invariant polynomial — where it appears

A polynomial taking the same value at every point of an orbit, so that applying any operation of the group leaves it unchanged. The invariants of each degree form a space, and the sequence of their dimensions is the group's Molien series.

Named by 6 essays across 2 fields — each of them below, with the objects they name alongside it.

Dropping one invariant of 3m makes two orbits agree. Every lattice point within four cells of the origin, coloured by the values a proper subset of 3m's invariants takes on it — the 2 generators with the first one removed, over a window of 4 cells. With the full set, the 25 orbits of the group take 25 distinct sets of values, one each, so the invariants are a complete set of coordinates on the quotient. With one removed, the two circled points — in different orbits, so no operation of the group carries one to the other — take the same values and become indistinguishable. That is the whole content of the statement that a complete set of invariants separates orbits: the completeness is what is doing the work.

An orbit is what the invariants cannot tell apart

Two points of the plane lie in the same orbit of a group exactly when every invariant polynomial takes the same value on both. One direction of that is a definition; the other is a theorem, and it is checked here by comparing every pair of points in a window both ways.

operations · Counting 4mm: how many independent invariants there are at each degree. The number of independent polynomial invariants of the plane point group 4mm, one bar per degree from 0 to 8. The heights are the coefficients of the Molien series, computed from an integer recursion on the trace and determinant of each operation. A dot above a bar marks a degree where the same number has been computed a second way, by averaging every monomial of that degree over the group and taking the rank of the result — a computation sharing no code with the first. The two agree at every degree checked. Degrees where the bar is absent hold no invariant at all: for 4mm that is every odd degree below the first invariant, and it is a statement about which functions the group refuses to leave alone.

How many invariants of each degree

A group moves the plane about, and some polynomials do not notice. How many independent ones there are at each degree is a sequence of integers, computed here by a recursion on traces and again by averaging every monomial — two routes that share no code and agree everywhere.

point-groups · Invariants 4: three generators in two variables, and the one relation between them. The invariant ring of 4 needs 3 generators, of degrees 2, 4, 4, and three functions of two variables cannot be algebraically independent. The relation between them is found rather than quoted: every monomial in the generators of the degree at which they can first be dependent is written out, the map back to polynomials in x and y is formed, and its kernel is the relation. It is then evaluated at points of the lattice, where all three generators take integer values and the combination comes to exactly zero. A group with a reflection has no such relation, which is the same statement as its ring being free.

Three invariants and one relation

Four of the ten plane classes need three invariants where two variables can only support two, so exactly one polynomial identity ties them together. The identity is not recognised or recalled: it is the kernel of a linear map, computed and then checked at lattice points where every term is an integer.

point-groups · Invariants Which order parameters carry a cubic invariant, and therefore cannot grow from zero. Every order parameter of every plane class, with the number of independent cubic invariants it admits. The count is the degree-three coefficient of the Molien series of the representation's image — the same computation the invariant-ring figures make for a different reason — and Landau's condition is that it be zero. Where it is not, a free energy in that order parameter has a term of odd degree, which puts its minimum away from zero the moment the quadratic coefficient does anything at all, so the parameter jumps rather than growing. In the plane exactly two order parameters carry one, and both are the two-dimensional representation of a class with a threefold axis and no sixfold.

The cubic term that forbids a continuous change

A crystal may lose a symmetry gradually only if the quantity measuring the loss admits no cubic invariant. Whether it does is the third coefficient of a Molien series — so a question about how a material changes is answered by counting polynomials.

point-groups · Invariants How many components a property may have, at each rank and in each class. One row per plane point group, one column per rank of a fully symmetric property tensor, with the number of independent components in each cell — counted by averaging the tensor over the group index by index, and equal at every entry to the Molien coefficient of that degree. A symmetric property of rank r is a form of degree r, so Neumann's principle and the invariant ring are the same arithmetic in two notations. The last column is the elastic tensor, which is not fully symmetric — symmetric within each pair of indices and under exchanging the pairs — and its counts are not in the table to its left. A property with its own symmetries needs its own average, and that is why the elastic constants are not read off a degree.

The parts a property splits into

A symmetric property of rank r is a polynomial of degree r wearing indices, so the number of components a class permits it is a coefficient of an invariant ring's series. The elastic tensor is not a polynomial in disguise, and its counts are not in that table — which is the most useful thing about it.

point-groups · Neumann's principle 4mm: 17 of 25 transitions forbidden. Every pair of irreducible representations of 4mm, with the number of times the identity occurs in the product of the two with the vector operator. A zero is a prohibition: the integral that would give the transition rate vanishes for every choice of functions carrying those representations, whatever the material is made of. A positive number is a permission and nothing more. Rows are final states and columns initial ones; the labels are the dimensions of the representations, so the twos are the degenerate levels. Every one of the 17 prohibitions here was checked again against explicit polynomials.

What a group forbids to happen

Two levels and a thing that might carry a crystal from one to the other. Whether it can is one sum over the group — and a zero there is a prohibition that no material, no temperature and no intensity of light gets round.

point-groups · Representations

Named alongside it

The objects these essays reach for when they reach for this one.

Molien seriesInvariant ringAveraging projectorCharacterCubic invariantAlgebraic independenceChevalley theoremDegeneracyDipole operatorElastic constantsFirst order transitionGenerating function

All concepts