Skip to content

Group Algebras ​

The group algebra k[G]k[G] has a basis of the group's elements and the group's own multiplication as its product, extended bilinearly. It is the most elementary construction in this section — which is why it comes last rather than first. The interesting part is not the product. It is the centre.

k[G]k[G] is commutative exactly when GG is, which is usually false. But its centre is always commutative, and it always has a basis of class sums: one element per conjugacy class, obtained by adding that class up. So a non-commutative algebra carries a canonical commutative subalgebra, whose dimension is the number of conjugacy classes — which is also the number of irreducible characters, and the doorway to representation theory.

Commutative or not

Cyclic groups are abelian; dihedral ones past n = 2 are not.

InGroupIsAbelian(CyclicGroup(6))\mathrm{GroupIsAbelian}(\mathrm{CyclicGroup}(6))OutTrue\mathrm{True}InGroupIsAbelian(DihedralGroup(4))\mathrm{GroupIsAbelian}(\mathrm{DihedralGroup}(4))OutFalse\mathrm{False}InGroupOrder(DihedralGroup(4))\mathrm{GroupOrder}(\mathrm{DihedralGroup}(4))Out88
source · editable

The class sums span the centre ​

A commutative subalgebra of a non-commutative algebra

A single reflection is not central; the class sum containing it is. The first class is always the identity alone.

InClassSum(DihedralGroup(3),2)\mathrm{ClassSum}(\mathrm{DihedralGroup}(3), 2)OutGroupBasis(2)+GroupBasis(1)\mathrm{GroupBasis}(\text{2})+\mathrm{GroupBasis}(\text{1})InIsCentral(DihedralGroup(3),ClassSum(DihedralGroup(3),2))\mathrm{IsCentral}(\mathrm{DihedralGroup}(3), \mathrm{ClassSum}(\mathrm{DihedralGroup}(3), 2))OutTrue\mathrm{True}InIsCentral(DihedralGroup(3),GroupBasis(s0))\mathrm{IsCentral}(\mathrm{DihedralGroup}(3), \mathrm{GroupBasis}(\text{s0}))OutFalse\mathrm{False}
source · editable

The class sums have disjoint supports, so they are linearly independent, so counting them counts the centre's dimension. The tests check that against the closed forms: nn classes for Zn\mathbb{Z}_n, (n+3)/2(n+3)/2 for DnD_n with nn odd, (n+6)/2(n+6)/2 for nn even.

Counting classes

Z₆ is abelian so every element is its own class. D₃ ≅ S₃ has three; D₄ has five.

InGroupCentreDimension(CyclicGroup(6))\mathrm{GroupCentreDimension}(\mathrm{CyclicGroup}(6))Out66InGroupCentreDimension(DihedralGroup(3))\mathrm{GroupCentreDimension}(\mathrm{DihedralGroup}(3))Out33InGroupCentreDimension(DihedralGroup(4))\mathrm{GroupCentreDimension}(\mathrm{DihedralGroup}(4))Out55InConjugacyClasses(DihedralGroup(3))\mathrm{ConjugacyClasses}(\mathrm{DihedralGroup}(3))Out[[GroupBasis(0)],[GroupBasis(1),GroupBasis(2)],[GroupBasis(s0),GroupBasis(s1),GroupBasis(s2)]]\bigl\lbrack\bigl\lbrack\mathrm{GroupBasis}(\text{0})\bigr\rbrack, \bigl\lbrack\mathrm{GroupBasis}(\text{1}), \mathrm{GroupBasis}(\text{2})\bigr\rbrack, \bigl\lbrack\mathrm{GroupBasis}(\text{s0}), \mathrm{GroupBasis}(\text{s1}), \mathrm{GroupBasis}(\text{s2})\bigr\rbrack\bigr\rbrack
source · editable

k[Zₙ] is k[x]/(xⁿ−1) ​

For a cyclic group the product just adds indices mod nn — so k[Zn]k[\mathbb{Z}_n] is a polynomial ring modulo a single relation. When the base field has nn-th roots of unity it splits into nn copies of the field, which is the same CRT-flavoured splitting the finite hypercomplex page and the residue numerals keep running into.

Adding indices

2 + 5 = 7 ≡ 1. And (1 + x)(1 + x⁵) = 2 + x + x⁵.

InGroupProduct(CyclicGroup(6),GroupBasis(2),GroupBasis(5))\mathrm{GroupProduct}(\mathrm{CyclicGroup}(6), \mathrm{GroupBasis}(\text{2}), \mathrm{GroupBasis}(\text{5}))OutGroupBasis(1)\mathrm{GroupBasis}(\text{1})InGroupOrder(GroupDirectProduct(CyclicGroup(2),CyclicGroup(3)))\mathrm{GroupOrder}(\mathrm{GroupDirectProduct}(\mathrm{CyclicGroup}(2), \mathrm{CyclicGroup}(3)))Out66
source · editable

The dihedral relations ​

Elements are written k for rkr^k and s k for srks r^k, with rn=1r^n = 1, s2=1s^2 = 1 and srs=r−1s r s = r^{-1}.

s² = 1 and s r s = r⁻¹

s² is the identity, and conjugating r by s inverts it — r³ in D₄.

InGroupProduct(DihedralGroup(4),GroupBasis(s0),GroupBasis(s0))\mathrm{GroupProduct}(\mathrm{DihedralGroup}(4), \mathrm{GroupBasis}(\text{s0}), \mathrm{GroupBasis}(\text{s0}))OutGroupBasis(0)\mathrm{GroupBasis}(\text{0})InGroupProduct(DihedralGroup(4),GroupProduct(DihedralGroup(4),GroupBasis(s0),GroupBasis(1)),GroupBasis(s0))\mathrm{GroupProduct}(\mathrm{DihedralGroup}(4), \mathrm{GroupProduct}(\mathrm{DihedralGroup}(4), \mathrm{GroupBasis}(\text{s0}), \mathrm{GroupBasis}(\text{1})), \mathrm{GroupBasis}(\text{s0}))OutGroupBasis(3)\mathrm{GroupBasis}(\text{3})
source · editable

Things worth knowing ​

The group axioms are verified, not assumed. The multiplication tables are checked for associativity, an identity, inverses, and the Latin-square property on every group here — because everything downstream rests on them being groups at all.

Several routes to the same algebra. k[Sn]k[S_n] is also the symmetric-group diagram algebra, and also Hn(q)H_n(q) at q=1q = 1. Three libraries, one object.

GroupProduct takes its group, since a basis element carries no reference to the group it came from — the same shape as QuiverCompose.

Not built yet. Character theory: the character table, orthogonality relations, and the decomposition of k[G]k[G] into matrix blocks. That is what the centre is the doorway to, and it is the obvious next step. Also only cyclic, dihedral and direct products — permutation groups come in through the diagram and Hecke libraries instead.