KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesMaschke’s Theorem and Semisimplicity of Group RingsEngineering · Engineering MathematicsLesson 373/884← PrevNext →
ArticlePublished 8 Aug 202620 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIMaschke’s Theorem and Semisimplicity of Group Rings

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Core Group rings

Maschke’s Theorem

For a finite group G, the group ring kG is semisimple exactly when k is semisimple and |G|⋅1 is a unit in k. One averaging operator proves the sufficiency; the augmentation map and von Neumann regularity prove the necessity.

Page ID
KEVOS-ENG-MATH-NCR-0045
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(6.1)–(6.2), §6 (pp. 82–85)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

Maschke's theorem is the dividing line of group representation theory. For G finite and k a coefficient ring, kG is semisimple if and only if two conditions hold: k is itself semisimple, and |G|⋅1k is a unit in k. Over a field this reads: kG is semisimple exactly when chark does not divide |G|.

The sufficiency is a single construction — average a k-linear projection over the group — and it is the origin of the Reynolds operator throughout invariant theory. The necessity is subtler and is where the augmentation map earns its keep: pushing a von Neumann regular identity through ε forces each prime dividing |G| to be invertible.

1898Maschke
|G|−1The whole hypothesis
⇔Both directions hold
∑ni2=|G|Complex decomposition

02Overview

Emmy Noether's reformulation makes the setting precise: a k-representation of G is the same thing as a left kG-module, and equivalence of representations is isomorphism of modules. Complete reducibility of representations therefore becomes semisimplicity of the ring kG, and the whole Wedderburn–Artin structure theory becomes available.

The theorem below is stated for an arbitrary coefficient ring, not merely a field, because both hypotheses are then visible separately. Over a field the first condition is automatic and only the arithmetic condition survives.

kG semisimpleiffk semisimple and |G|⋅1k∈U(k).
(6.1)

G finite. The finiteness of G is essential: for infinite G no coefficient ring makes kG semisimple.

The one thing to remember

Everything turns on whether you may divide by |G|. If you can, average; if you cannot, the group sum G^ becomes a nonzero element of square zero and semisimplicity is lost.

The complementary result, that kG is never semisimple for infinite G, is proved in Group Rings of Infinite Groups Are Never Semisimple. Together the two statements settle semisimplicity completely, and the residual question — what survives when semisimplicity fails — becomes the J-semisimplicity problem.

03Learning Objectives

  • State (6.1) with both hypotheses on k and on |G|, and explain why neither can be dropped.
  • Build the averaging operator and check k-linearity, G-equivariance and idempotence on the submodule.
  • Prove the annihilator lemma (6.2) for an element of prime order.
  • Run the necessity argument: augmentation applied to a von Neumann regular identity.
  • State the field version and the complex Wedderburn decomposition with the sum-of-squares identity.
  • Compute ℚS3 and 𝔽3S3 and identify the radical in the modular case.

04Definitions

kG
The group ring: free as a left k-module on G, with multiplication extending the group law. Here k is any ring with identity, not necessarily commutative.
|G|⋅1k
The sum of |G| copies of 1k. It is central in k for any ring k, so if it is invertible its inverse is central too.
G^
The group sum ∑g∈Gg∈kG. It is central, gG^=G^ for all g, and G^2=|G|G^.
σ^
For σ of order p, the element 1+σ+⋯+σp−1. It satisfies σ^(1−σ)=(1−σ)σ^=0 and ε(σ^)=p⋅1k.
Semisimple module
A module that is a sum of simple submodules; equivalently, one in which every submodule is a direct summand.

Modules are left modules and unital. A ring is semisimple when it is semisimple as a left module over itself — a condition that is left-right symmetric, unlike most conditions in this collection.

05Core Concepts

Averaging: turning a k-splitting into a kG-splitting

Let W⊆V be kG-modules. Because k is semisimple, W is a direct summand of V as a k-module, so there is a k-linear retraction f:V→W with f|W=id. This f has no reason to respect the G-action. The repair is to symmetrise it:

g(v)=|G|−1∑σ∈Gσf(σ−1v),v∈V.
(6.1a)

The averaging, or Reynolds, operator. It requires exactly one thing: that |G| be invertible in k.

The three verifications are short. The image lies in W because f lands in W and W is G-stable. The restriction to W is the identity because each summand contributes σσ−1w=w. And equivariance is a reindexing: replacing σ by τσ converts g(τv) into τg(v).

Why the converse needs the augmentation

Suppose instead that kG is semisimple. Two consequences are immediate. First, k is a homomorphic image of kG under ε, and quotients of semisimple rings are semisimple. Second, semisimple rings are von Neumann regular, so every element a admits x with axa=a.

Apply regularity to a=1−σ for σ of prime order p, given by Cauchy's theorem whenever p divides |G|. The resulting identity [1−(1−σ)x](1−σ)=0 says that 1−(1−σ)x lies in the right annihilator of 1−σ, and the lemma identifies that annihilator as kGσ^. Augmenting turns this into an equation in k with p on one side.

The two hypotheses are independent

Take k=ℤ and G trivial: |G|=1 is a unit but ℤ is not semisimple, and ℤG=ℤ is not semisimple. Take k=𝔽2 and G=C2: k is semisimple but 2=0, and 𝔽2C2 is local with radical (1+g). Each hypothesis fails on its own.

What replaces the theorem in the modular case

When chark=p divides |G|, the group sum satisfies G^2=|G|G^=0 while G^≠0, so kGG^ is a nonzero ideal of square zero and rad(kG)≠0. Everything then happens inside kG/rad(kG) and in the lifting problem back to kG — the subject of modular representation theory.

06Key Results

Lemma(6.2)Right annihilator of 1−σ

Let k be any ring, G any group, R=kG, and let σ∈G have finite order p. Put σ^=1+σ+⋯+σp−1. Then for r∈R,

r(1−σ)=0iffr∈Rσ^.
(6.2a)
Proof

**(⇐)** σ^(1−σ)=σ^−σ^σ=σ^−σ^=0, because right multiplication by σ permutes the terms of σ^ cyclically. Hence βσ^(1−σ)=0 for every β∈R.

**(⇒)** Write r=∑μ∈Grμμ. The condition r(1−σ)=0 says rσ=r, and the coefficient of μ in rσ is rμσ−1. So rμσ−1=rμ for every μ: the coefficient function is constant on the right cosets μ⟨σ⟩, each of which has exactly p elements.

Choose representatives τ1,…,τs of the cosets meeting the support of r. Grouping the sum by cosets gives

r=∑j=1srτj(τj+τjσ+⋯+τjσp−1)=(∑j=1srτjτj)σ^∈Rσ^.
(6.2b)
Theorem(6.1)Maschke's theorem

Let k be any ring with identity and let G be a finite group. Then the group ring R=kG is semisimple if and only if k is semisimple and |G|⋅1k is a unit in k.

Proof

Sufficiency. Assume k is semisimple and |G|⋅1k∈U(k); write |G|−1 for its inverse, which is central because |G|⋅1k is. Let V be any left R-module and W⊆V an R-submodule. Since k is semisimple, W is a k-direct summand of V, so there is a k-linear f:V→W with f|W=idW.

Define g:V→W by (6.1a). It is k-linear because f is and because k commutes with G inside R. For w∈W we have σ−1w∈W, so f(σ−1w)=σ−1w and g(w)=|G|−1∑σw=w. For τ∈G and v∈V, substituting σ=τρ gives

g(τv)=|G|−1∑σ∈Gσf(σ−1τv)=|G|−1∑ρ∈Gτρf(ρ−1v)=τg(v),
(6.1b)

so g is R-linear. Thus g is an R-module retraction onto W and V=W⊕kerg. Every submodule of every R-module is a direct summand, which is one of the standard characterisations of a semisimple ring.

Necessity. Assume R=kG is semisimple. The augmentation ε:kG→k is a surjective ring homomorphism, and a homomorphic image of a semisimple ring is semisimple; hence k is semisimple.

Now let p be any prime dividing |G|. By Cauchy's theorem there is σ∈G of order p. Semisimple rings are von Neumann regular, so there is x∈R with (1−σ)x(1−σ)=1−σ, that is [1−(1−σ)x](1−σ)=0. By (6.2) there is β∈R with

1−(1−σ)x=βσ^,σ^=1+σ+⋯+σp−1.
(6.1c)

Apply ε. On the left, ε(1−σ)=0 kills the second term and we get 1. On the right, ε(σ^)=p⋅1k, so we get ε(β)(p⋅1k). Hence ε(β)(p⋅1k)=1, and since p⋅1k is central this makes p⋅1k a unit of k.

Every prime divisor of |G| is therefore invertible in k; writing |G|=∏ipiei and multiplying the corresponding units gives |G|⋅1k∈U(k).

Corollary—The field case

Let k be a field and G a finite group. Then kG is semisimple if and only if chark∤|G| — in particular whenever chark=0. Equivalently, every kG-module is a direct sum of simple modules, and every finite-dimensional k-representation of G is completely reducible.

Corollary—Wedderburn form over ℂ

For G finite, ℂG is semisimple, and since ℂ is algebraically closed every division algebra finite-dimensional over ℂ equals ℂ. Wedderburn–Artin therefore gives

ℂG≅∏i=1rMni(ℂ),∑i=1rni2=|G|,
(6.1d)

with r equal to the number of conjugacy classes of G, because the class sums form a ℂ-basis of the centre.

For a general field k of characteristic zero the same argument gives kG≅∏iMni(Di) with each Di a division algebra finite-dimensional over k; the Di need not be commutative, as ℚQ8 shows, where the quaternion algebra appears.

Proposition—Relative version

Let k be a ring, G a group and H≤G a subgroup of finite index i with i⋅1k∈U(k). If a kG-module V is semisimple as a kH-module, then V is semisimple as a kG-module.

Proof

Let W⊆V be a kG-submodule. It is in particular a kH-submodule, so by hypothesis there is a kH-linear retraction f:V→W. Fix a left transversal t1,…,ti of H in G and set g(v)=i−1∑jtjf(tj−1v).

This is independent of the choice of representatives: replacing tj by tjh with h∈H gives tjhf(h−1tj−1v)=tjf(tj−1v) by kH-linearity of f. Equivariance under τ∈G follows because {τtj} is again a transversal, and g|W=id as before. So W is a kG-direct summand, and V is a semisimple kG-module.

Taking H={1} and k semisimple recovers the sufficiency half of (6.1).

07Proof Techniques and Method

The reusable moves behind the two halves of the proof.

Move 1

Symmetrise, then divide

Given any k-linear gadget, sum its G-conjugates and divide by |G|. The result is G-equivariant and agrees with the original on G-fixed data. This is the Reynolds operator and it recurs in invariant theory and in the construction of invariant inner products.

Move 2

Push an identity through ε

Any equation in kG becomes an equation in k under augmentation, and elements like σ^ that look invisible in kG produce the integer p in k. This is the only way arithmetic enters the necessity proof.

Move 3

Use regularity instead of idempotents

Semisimple gives von Neumann regular, and regularity supplies an equation involving a chosen element rather than an abstract decomposition. Choosing a=1−σ targets exactly the torsion of G.

Move 1 is robust: it needs only invertibility of an index, which is why the relative version goes through verbatim for a subgroup of invertible finite index. Move 2 is fragile in a useful way: it is precisely the failure of p to be invertible that manufactures the radical.

08Worked Example

ℚS3: the semisimple side

Let G=S3, of order 6, and k=ℚ. Since charℚ=0, Maschke applies and ℚS3 is semisimple. The group has three conjugacy classes — identity, transpositions, three-cycles — and three irreducible representations over ℚ: trivial, sign, and the two-dimensional standard representation on {(a,b,c)∈ℚ3:a+b+c=0}.

All three are realised over ℚ and each has endomorphism ring ℚ, so

ℚS3≅ℚ×ℚ×M2(ℚ),1+1+4=6=|S3|.
(E.1)

The dimension count is the identity ∑ni2=|G| in the smallest interesting case.

𝔽3S3: the modular side

Now take k=𝔽3. Since 3 divides 6, Maschke fails and rad(𝔽3S3)≠0. The Sylow 3-subgroup P=A3=⟨c⟩ is normal, and the relative augmentation ideal Δ(G,P)=kGΔk(P) is nilpotent because Δ𝔽3(P)3=0 and P is normal. Moreover kG/Δ(G,P)≅𝔽3[G/P]=𝔽3C2, which is semisimple by Maschke since 2 is invertible in 𝔽3. A nilpotent ideal with semisimple quotient is the radical, so

rad(𝔽3S3)=Δ(S3,A3),𝔽3S3/rad≅𝔽3C2≅𝔽3×𝔽3.
(E.2)

Dimensions: dimrad=6−2=4. Since Δ(G,P)n=kGΔk(P)n and Δ𝔽3(P) has powers of dimension 2,1,0, we get dimrad2=dimkG(1+c+c2)=2 and rad3=0.

Radical filtration of 𝔽3S3
Layer𝔽3-dimensionDescription
𝔽3S36the whole algebra
rad4Δ(S3,A3), nilpotent of index 3
rad22spanned by A3^ and τA3^ for a transposition τ
rad30vanishes

Sanity check against the theorem

Two simple modules remain in characteristic 3, both one-dimensional — trivial and sign — matching the two 3-regular classes. Over ℚ there were three simples with a two-dimensional one among them. The two-dimensional representation has not disappeared; it has become uniserial with the trivial and sign modules as composition factors.

09Process and Workflow

Check finiteness of GIf G is infinite, stop: kG is not semisimple for any nonzero k.
Check kIs k semisimple? A field, a finite product of matrix rings over division rings — yes. ℤ, ℤ/4, k[[x]] — no.
Check the arithmeticIs |G|⋅1k a unit? Over a field this is: does chark divide |G|?
Semisimple: decomposeApply Wedderburn–Artin. Over an algebraically closed field of characteristic 0 the factors are matrix rings and the dimensions satisfy ∑ni2=|G|.
Not semisimple: localise the failureCompute rad(kG), pass to the quotient, and study lifting. For a normal Sylow p-subgroup P the radical is Δ(G,P).

k is a field, G is finite — what does chark do?

Characteristic 0kG is semisimple. Ordinary representation theory: characters determine modules, and ℂG splits as a product of matrix algebras.
Characteristic p, p∤|G|Still semisimple. The theory is essentially the ordinary one, though the field may not be a splitting field.
Characteristic p, G a p-groupMaximally non-semisimple: kG is local, rad(kG)=Δk(G) is nilpotent and there is one simple module.
Characteristic p, p divides |G|, G not a p-groupGenuinely modular. The radical is nonzero and strictly inside Δk(G); Brauer theory, blocks and defect groups govern the structure.

10Comparison and Classification

Maschke's theorem across coefficient rings, G finite and nontrivial
kk semisimple?|G|⋅1k a unit?kG semisimple?
ℂ, ℝ, ℚyesyesyes
𝔽p with p∤|G|yesyesyes
𝔽p with p dividing |G|yesnono
ℤnoonly if |G|=1no
ℤ[1/|G|]noyesno
Mn(D), D a division ring of characteristic 0yesyesyes
Which hypothesis each half of the proof consumes
G finitek semisimple|G| invertiblevon Neumann regularity
Averaging operator is defined●yes○no●yes○no
A k-linear retraction exists○no●yes○no○no
k is semisimple (necessity)○no○no○no○no
p⋅1k is a unit (necessity)●yes○no○no●yes

Which hypothesis each half of the proof consumes

The necessity of k being semisimple uses only that ε is a surjective ring map, so it holds for infinite G as well — vacuously, since kG is then never semisimple.

11Applications and Industry Use

Applications here means where this structure is used — inside mathematics and in the engineering and computing disciplines that consume it.

Signal processing

Fast transforms from group algebra splittings

The isomorphism ℂCn≅ℂn is the discrete Fourier transform; the general ℂG≅∏Mni(ℂ) is the non-abelian Fourier transform underlying fast convolution algorithms on finite groups.

Coding theory

Group codes and idempotent generators

When |G| is invertible in 𝔽q the group algebra splits into a product, and every group code is generated by an idempotent computable from the splitting. When char𝔽q divides |G| the code is not generated by an idempotent, which is exactly the modular case.

Physics and chemistry

Symmetry-adapted bases

Projection operators onto irreducible components are averaging operators of the Maschke type. Molecular vibration analysis and crystal-field splitting both compute with them; characteristic zero guarantees they exist.

Invariant theory

The Reynolds operator

Averaging over a finite group produces a projection onto invariants, giving finite generation of invariant rings for finite groups in characteristic zero. Modular invariant theory is hard precisely because this projection disappears.

The theorem is also the reason character theory works. Over ℂ semisimplicity makes a module determined up to isomorphism by its character; in characteristic p dividing |G|, Brauer characters recover only the composition factors.

12Computational Notes

Computational notes cover algorithms, cost and library behaviour rather than manufacturing process.

  • Deciding semisimplicity is trivial once |G| and chark are known — it is a divisibility test, not an algebraic computation.
  • Producing the Wedderburn decomposition is the real work. Over ℚ or a number field the components are matrix rings over division algebras, and the standard tool is GAP's Wedderga package, which computes the decomposition from strong Shoda pairs rather than from characters.
  • Over an algebraically closed field of characteristic 0 the decomposition is read off from the character table: the block sizes are the irreducible degrees, and ∑ni2=|G| is the check.
  • In the modular case the analogous task is computing rad(kG) and the simple modules; the Meataxe algorithm, which splits a module by finding a singular element of the acting algebra, is the workhorse and is implemented in GAP, Magma and the standalone C Meataxe.
  • Dimension is the practical constraint: dimkkG=|G|, so a direct matrix approach costs O(|G|3) field operations and becomes infeasible well before groups of interest to representation theorists.

Splitting fields

Semisimplicity does not imply the components are matrix rings over k. Brauer's theorem guarantees that k becomes a splitting field after adjoining a primitive e-th root of unity, where e is the exponent of G; before that, division algebras can and do appear, as in ℚQ8.

13Failure Modes and Common Mistakes

The hypothesis is invertibility, not nonvanishing

Over ℤ with |G|=5, the integer 5 is nonzero but not a unit, and ℤG is not semisimple. The condition in (6.1) is |G|⋅1k∈U(k). Reading it as |G|⋅1k≠0 is a genuine error that only coincides with the truth over fields.

Finiteness of G is not decorative

Nothing in the averaging construction survives for infinite G: there is no |G|−1 and no finite sum. The failure is not a defect of the proof — kG really is never semisimple for infinite G, for any nonzero k.

Semisimple does not mean split

kG semisimple gives ∏iMni(Di) with Di division algebras over k, not necessarily Di=k. Over ℚ the quaternion group produces a genuine quaternion division algebra. Treating the ni as the degrees of k-representations requires k to be a splitting field.

  • Do not conclude from failure of Maschke that kG has large radical. For G finite with p∣|G| the radical is nonzero, but it may be small — its dimension is |G| minus the dimension of the semisimple quotient.
  • The converse direction needs G finite in an essential way: Cauchy's theorem is applied to produce an element of order p.
  • Do not assume the number of simple modules is the number of conjugacy classes in characteristic p; it is the number of p-regular classes, and for 𝔽3S3 that is 2 rather than 3.
  • The relative version needs the index to be invertible, not the order of G; this is what makes it useful for infinite groups with a finite-index subgroup.

14Historical Notes and Lessons Learned

  • 1896–97Frobenius invents charactersFrobenius factorises the group determinant and creates the character theory of finite groups, working entirely with complex representations.
  • 1898Maschke's theoremMaschke proves complete reducibility for complex representations of a finite group, the statement that now bears his name.
  • Early 1900sDickson's extensionDickson observes that the argument needs only that the characteristic of the base field does not divide the group order, and that the conclusion genuinely fails otherwise.
  • 1920sNoether's reformulationNoether recasts representations as modules over the group ring, so that complete reducibility becomes semisimplicity and Wedderburn's structure theory applies directly. Many results of Frobenius and Schur are re-derived ring-theoretically.
  • 1935 onwardsBrauer and the modular theoryBrauer develops the representation theory of finite groups over fields of characteristic dividing the group order — blocks, defect groups, decomposition matrices — the systematic study of what Maschke's theorem excludes.
  • 1945Jacobson's radicalWith semisimplicity settled for finite groups, the Jacobson radical supplies a usable weaker notion for infinite groups, and the J-semisimplicity problem for group algebras opens.

The methodological lesson is that the theorem's content is an averaging construction, and averaging is available whenever an index is invertible. Every later generalisation — relative projectivity, Higman's criterion, cohomological vanishing for finite groups with invertible order — is a refinement of the same division by |G|.

15Quick Reference

Statement (6.1)G finite: kG semisimple iff k semisimple and |G|⋅1k∈U(k)
Field versionkG semisimple iffchark∤|G|
Averagingg(v)=|G|−1∑σσf(σ−1v)
Lemma (6.2)r(1−σ)=0iffr∈kGσ^, σ of order p
Necessity enginevon Neumann regularity at 1−σ, then apply ε
Complex formℂG≅∏Mni(ℂ), ∑ni2=|G|, r= number of classes
Relative form[G:H]=i invertible and V semisimple over kH ⇒ V semisimple over kG
Failure witnessG^2=|G|G^=0 when chark divides |G|
What each hypothesis buys
HypothesisUsed forWhat fails without it
G finitethe sum in the averaging operator; Cauchy's theoremno averaging, and semisimplicity fails outright
k semisimpleexistence of a k-linear retraction fno starting projection to average
|G|⋅1k∈U(k)the division by |G|G^ becomes a square-zero element and rad(kG)≠0
σ of prime orderthe annihilator lemma (6.2)the annihilator is no longer a single principal left ideal of this shape

16Frequently Asked Questions

Why does Lam state Maschke's theorem for an arbitrary ring k rather than a field?

Because the two hypotheses then separate cleanly. Over a field, semisimplicity of k is automatic and the theorem looks like a single arithmetic condition; over a general ring one sees that the averaging argument needs a k-linear retraction to exist — which is what semisimplicity of k provides — and separately needs |G| to be invertible. The general statement also covers matrix rings over division rings as coefficients.

Where exactly does the proof break when chark divides |G|?

At the division. The sum ∑σσf(σ−1v) is still defined and still G-equivariant, but its restriction to W is multiplication by |G|, which is 0 rather than invertible. The construction produces the zero map instead of a retraction.

Is the invertibility of |G| really necessary, or just convenient?

Necessary. The group sum G^ satisfies G^2=|G|G^, so if |G|⋅1k=0 then kGG^ is a nonzero ideal of square zero and rad(kG)≠0. Over a general ring the full necessity argument goes through von Neumann regularity and the lemma on the annihilator of 1−σ.

What is the analogue of Maschke's theorem for compact groups?

Averaging with respect to normalised Haar measure replaces the finite sum, and every finite-dimensional continuous representation of a compact group over ℂ is completely reducible. The structural analogue of the Rickart argument for infinite discrete groups uses the same measure-theoretic idea in the Banach algebra setting.

Does semisimplicity of kG tell you the number of simple modules?

It tells you there are finitely many and that kG is their matrix-ring product. The count is the number of conjugacy classes only when k is a splitting field of characteristic zero. Over ℚ the count can be smaller because Galois-conjugate complex representations fuse into a single rational component.

How does the relative version help with infinite groups?

It replaces |G| by an index [G:H]. If G is infinite but has a subgroup H of finite invertible index, semisimplicity of a module over kH still transfers to kG. This does not make kG semisimple — that is impossible for infinite G — but it does transfer semisimplicity of individual modules.

17Related KEVOS Topics

Group Rings of Infinite GroupsIf G is infinite and k ≠ 0, then kG is never semisimple — and the reason is elementary: a complement to the augmentationkG Modulo Its RadicalWedderburn–Artin applied to the group algebra: kG/rad kG is a finite product of matrix rings over division algebras, andNamed Theorems IndexEvery named result in Lam's text, indexed by chapter with its numbering, its hypotheses in brief, and the page in this cThe Augmentation IdealThe kernel of the augmentation map : kG → k is a free k-module on g - 1, the annihilator of the trivial module, and the J-Semisimplicity of Group AlgebrasSemisimplicity is impossible for infinite groups, so the question becomes whether rad(kG) = 0. Rickart answered it for C

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §6, (6.1)–(6.2) (pp. 82–85).
  2. C. W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebras, Wiley-Interscience, 1962, Chapter IV.
  3. D. S. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, 1977, Chapter 2.
  4. J.-P. Serre, Linear Representations of Finite Groups, Graduate Texts in Mathematics 42, Springer-Verlag, 1977, Part I.
  5. W. Feit, The Representation Theory of Finite Groups, North-Holland, 1982, Chapter I.
  6. H. Maschke, “Beweis des Satzes, dass diejenigen endlichen linearen Substitutionsgruppen, in welchen einige durchgehends verschwindende Coefficienten auftreten, intransitiv sind”, Mathematische Annalen 52 (1899).

19AI Suggested Questions

  • Decompose ℚQ8 explicitly and identify the quaternion division algebra component.
  • State Higman's criterion for relative projectivity and explain how it generalises the averaging argument.
  • Compute the Cartan matrix and decomposition matrix of 𝔽3S3.
  • How does Brauer's splitting field theorem bound the field extension needed to split kG?
  • Give the Haar measure version of Maschke's theorem for compact topological groups and identify where compactness is used.
  • For which finite groups G and primes p is 𝔽pG a local ring?
  • Explain why modular invariant theory loses finite generation results that hold in characteristic zero.
Page
KEVOS-ENG-MATH-NCR-0045
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

On this page

  1. Executive Summary
  2. Overview
  3. Learning Objectives
  4. Definitions
  5. Core Concepts
  6. Key Results
  7. Proof Techniques and Method
  8. Worked Example
  9. Process and Workflow
  10. Comparison and Classification
  11. Applications and Industry Use
  12. Computational Notes
  13. Failure Modes and Common Mistakes
  14. Historical Notes and Lessons Learned
  15. Quick Reference
  16. Frequently Asked Questions
  17. Related KEVOS Topics
  18. References
  19. AI Suggested Questions

Continue learning

The Augmentation Ideal of a Group RingArticle · Engineering MathematicsNEXT LESSON →Group Rings of Infinite Groups Are Never SemisimpleArticle · Engineering MathematicsThe Radical of Matrix Rings and Power Series RingsArticle · Engineering MathematicsJ-Semisimplicity of Complex and Real Group AlgebrasArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®