In mathematics, the Burnside ring of a finite group is an algebraic construction that encodes the different ways the group can act on finite sets. The ideas were introduced by William Burnside at the end of the nineteenth century, but the algebraic ring structure is a more recent development, due to Solomon (1967).
Given a finite group G, the elements of its Burnside ring Ω(G) are the formal differences of isomorphism classes of finite G-sets. For the ring structure, addition is given by disjoint union of G-sets, and multiplication by their Cartesian product.
If G acts on a finite set X, then one can write (disjoint union), where each Xi is a single G-orbit. Choosing any element xi in Xi creates an isomorphism G/Gi → Xi, where Gi is the stabilizer (isotropy) subgroup of G at xi. A different choice of representative yi in Xi gives a conjugate subgroup to Gi as stabilizer. This shows that the generators of Ω(G) as a Z-module are the orbits G/H as H ranges over conjugacy classes of subgroups of G.
In other words, a typical element of Ω(G) is
where ai in Z and G1, G2, ..., GN are representatives of the conjugacy classes of subgroups of G.
If G acts on X, and H ≤ G (H is a subgroup of G), then the mark of H on X is the number of elements of X that are fixed by every element of H: , where
If H and K are conjugate subgroups, then mX(H) = mX(K) for any finite G-set X; indeed, if K = gHg−1 then XK = g · XH.
It is also easy to see that for each H ≤ G, the map Ω(G) → Z : X ↦ mX(H) is a homomorphism. This means that to know the marks of G, it is sufficient to evaluate them on the generators of Ω(G), viz. the orbits G/H.
For each pair of subgroups H,K ≤ G define
This is mX(H) for X = G/K. The condition HgK = gK is equivalent to g−1Hg ≤ K, so if H is not conjugate to a subgroup of K then m(K, H) = 0.
To record all possible marks, one forms a table, Burnside's Table of Marks, as follows: Let G1 (= trivial subgroup), G2, ..., GN = G be representatives of the N conjugacy classes of subgroups of G, ordered in such a way that whenever Gi is conjugate to a subgroup of Gj, then i ≤ j. Now define the N × N table (square matrix) whose (i, j)th entry is m(Gi, Gj). This matrix is lower triangular, and the elements on the diagonal are non-zero so it is invertible.
It follows that if X is a G-set, and u its row vector of marks, so ui = mX(Gi), then X decomposes as a disjoint union of ai copies of the orbit of type Gi, where the vector a satisfies,
- aM = u,
where M is the matrix of the table of marks. This theorem is due to (Burnside 1897).
The table of marks for the cyclic group of order 6:
|Z6 / 1||6||.||.||.|
|Z6 / Z2||3||3||.||.|
|Z6 / Z3||2||0||2||.|
|Z6 / Z6||1||1||1||1|
The table of marks for the symmetric group S3 on 3 letters:
|S3 / 1||6||.||.||.|
|S3 / Z2||3||1||.||.|
|S3 / Z3||2||0||2||.|
|S3 / S3||1||1||1||1|
The dots in the two tables are all zeros, merely emphasizing the fact that the tables are lower-triangular.
(Some authors use the transpose of the table, but this is how Burnside defined it originally.)
The fact that the last row is all 1s is because [G/G] is a single point. The diagonal terms are m(H, H) = | NG(H)/H |.
The ring structure of Ω(G) can be deduced from these tables: the generators of the ring (as a Z-module) are the rows of the table, and the product of two generators has mark given by the product of the marks (so component-wise multiplication of row vectors), which can then be decomposed as a linear combination of all the rows. For example, with S3,
as (3, 1, 0, 0).(2, 0, 2, 0) = (6, 0, 0, 0).
Associated to any finite set X is a vector space V = VX, which is the vector space with the elements of X as the basis (using any specified field). An action of a finite group G on X induces a linear action on V, called a permutation representation. The set of all finite dimensional representations of G has the structure of a ring, the representation ring, denoted R(G).
For a given G-set X, the character of the associated representation is
where <g> is the cyclic group generated by g.
The resulting map
taking a G-set to the corresponding representation is in general neither injective nor surjective.
The simplest example showing that β is not in general injective is for G = S3 (see table above), and is given by
- Burnside, William (1897), Theory of groups of finite order, Cambridge University Press
- tom Dieck, Tammo (1987), Transformation groups, de Gruyter Studies in Mathematics 8, Walter de Gruyter, ISBN 978-3-11-009745-0, MR 889050, OCLC 217014538 Unknown parameter
- Dress, Andreas (1969), "A characterization of solvable groups", Math. Zeitschrift 110 (3): 213–217, doi:10.1007/BF01110213
- Kerber, Adalbert (1999), Applied finite group actions, Algorithms and Combinatorics 19 (2nd ed.), Berlin, New York: Springer-Verlag, ISBN 978-3-540-65941-9, MR 1716962, OCLC 247593131 Unknown parameter
- Solomon, L. (1967), "The Burnside algebra of a finite group", J. Combin. Theory 1: 603–615