Noncommutative algebra requires explicit control of multiplication order, one-sided ideals and module conventions. Representation theory then encodes group or algebra structure through linear actions and characters. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.
Learning pathNoncommutative Algebra and Representations
LevelAdvanced
FormatHandbook guide
Read time11 min
Executive summary
This chapter develops semisimple rings and module decomposition as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.
The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.
Problem-solving workflow
Fix left-versus-right conventions before beginning.
Keep multiplication order unchanged unless commutativity has been proved.
Use one-sided ideals, radicals and chain conditions appropriate to the setting.
Decompose modules into simple pieces only when the semisimplicity hypotheses apply.
For representations, identify the field, dimension, kernel and invariant subspaces.
Use characters as class functions only after verifying the representation-theoretic assumptions.
Core definitions
Definition
A k-representation of a group G is a homomorphism σ : G →GL(V ), where V is a vector space over a field k. Note that if dim(V ) = n, then GL(V ) contains an isomorphic copy of Sn [if v1, . . . , vn is a basis of V and α ∈Sn, then there is a nonsingular linear transformation T : V →V with T (vi) = vα(i) for all i]; therefore, permutation representations are special cases of k-representations. Representations of groups can be translated into the language of kGmodules (compare the next proof with that of Proposition 8.8).
Definition
A left R-module is semisimple if it is a direct sum of simple modules. A ring R is left semisimple if it is a direct sum of minimal left ideals.3 Recall that if a ring R is viewed as a left R-module, then its submodules are its left ideals; moreover, a left ideal is minimal if and only if it is a simple left R-module. The next proposition generalizes Example 8.30.
Definition
A ring R is simple if it is nonzero and it has no proper nonzero two-sided ideals.
Definition
Let R be a left semisimple ring, and let R = L1 ⊕· · · ⊕Ln, where the L j are minimal left ideals. Reindex the summands so that no two of the first m ideals L1, . . . , Lm are isomorphic, while every L j in the given decomposition is isomorphic to some Li for 1 ≤i ≤m. The left ideals Bi = L j∼=Li L j are called the simple components of R relative to the decomposition R = j L j. We shall see, in Corollary 8.62, that the simple components do not depend on the particular decomposition of R as a direct sum of minimal left ideals.
Definition
Let C1, . . . , Cr be the conjugacy classes in a finite group G. For each C j, define the class sum to be the element z j ∈CG given by z j = g∈C j g. 6By Example 8.55, the group algebra kG always has a unique minimal left ideal isomorphic to V0(k), even when k is not algebraically closed. Semisimple Rings Here is a ring-theoretic interpretation of the number c of conjugacy classes.
Definition
A k-representation of a group G is irreducible if the corresponding kGmodule is simple. For example, a one-dimensional (necessarily irreducible) k-representation is a group homomorphism λ: G →k×, where k× is the multiplicative group of nonzero elements of k. The trivial kG-module V0(k) corresponds to the representation λg = 1 for all g ∈G. The next result is basic to the construction of the character table of a finite group.
Principal results and structural facts
Key result
Every k-representation σ : G →GL(V ) equips V with the structure of a left kG-module; denote this module by V σ. Conversely, every left kG-module V determines a k-representation σ : G →GL(V ).
Key result
Let G be a group and let σ, τ : G →Matn(k) be k-representations. Then (kn)σ ∼= (kn)τ as kG-modules if and only if there is a nonsingular n × n matrix P with Pτ(x)P−1 = σ(x) for every x ∈G.
Key result
(i) Every submodule and every quotient module of a semisimple module M is itself left semisimple. (ii) If R is a (left) semisimple ring, then every left R-module M is a semisimple module. (iii) If I is a two-sided ideal in a semisimple ring R, then the quotient ring R/I is also a semisimple ring.
Key result
The next result shows that left semisimple rings can be characterized in terms of the maximal-ideal intersection radical.
Key result
If G is a finite group and k is a field whose characteristic does not divide |G|, then kG is a left semisimple ring. Remark. The hypothesis always holds if k has characteristic 0. ◀
Key result
); that is, I is a direct summand of R. By Proposition 8.42, R is a semisimple left R-module. Therefore, R is a left semisimple ring. Here are more examples of left semisimple rings; the semisimple decomposition theorem will say that there are no others.
Key result
If V is an n-dimensional left vector space over a division ring Δ, then the minimal left ideals Col( j), for 1 ≤j ≤n, in EndΔ(V ) are all isomorphic.
Key result
If R = j L j is a left semisimple ring, where the L j are minimal left ideals, then every simple R-module S is isomorphic to some L j.
Key result
A commutative ring R is semisimple if and only if it is isomorphic to a direct product of finitely many fields.
Key result
Let R be a left semisimple ring, and let R = L1 ⊕· · · ⊕Ln = B1 ⊕· · · ⊕Bm, where the L j are minimal left ideals and the Bi’s are the corresponding simple components of R. (i) Each Bi is a ring that is also a two-sided ideal in R, and Bi B j = {0} if j ̸= i. (ii) If L is any minimal left ideal in R, not necessarily occurring in the given decomposition of R, then L ∼= Li for some i and L ⊆Bi. (iii) Every two-sided ideal D in R is a direct sum of Bi’s. (iv) Each Bi is a simple ring.
Key result
Every semisimple ring R is a direct product, R ∼= Matn1(Δ1) × · · · × Matnm(Δm), where ni ≥1 and Δi is a division ring, and the numbers m and ni, as well as the division rings Δi, are uniquely determined by R.
Key result
If G is a finite group and k is an algebraically closed field whose characteristic does not divide |G|, then |G| = n2 1+n2 2+· · ·+n2 m, where the ith simple component Bi of kG consists of ni × ni matrices. Moreover, we may assume that n1 = 1.6 Remark.
Key result
If G is a finite group, then the number of its irreducible complex representations is equal to the number r of its conjugacy classes.
Key result
Let R be a ring whose group of units U = U(R) is finite and of odd order. Then U is abelian and there are positive integers mi with |U| = t→ i=1 (2mi −1).
Source-grounded examples
Worked source example
If G is a finite group and V is a vector space over a field k, then the trivial homomorphism σ : G →GL(V ) is defined by σ(x) = 1V for all x ∈G. The corresponding kG-module V σ is called the trivial kG-module: If v ∈V , then xv = v for all x ∈G. The trivial module k (also called the principal kG-module) is denoted by V0(k). ◀ We now introduce an important class of rings; it will be seen that most group algebras kG are semisimple rings.
Worked source example
(i) If G = S3, then CG is six-dimensional. There are three simple components, for S3 has three conjugacy classes (by Theorem 2.9, the number of conjugacy classes in Sn is equal to the number of different cycle structures), having dimensions 1, 1, and 4, respectively. (We could have seen this without Theorem 8.69, for this is the only way to write 6 as a sum of squares aside from a sum of six 1’s.) Therefore, CS3 ∼= C × C × Mat2(C). One of the one-dimensional irreducible representations is the trivial one; the other is sgn (signum). (ii) We now analyze kG for G = Q, the quaternion group of order 8. If k = C, then
How to reason with these results
Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.
When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.
For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.
Common failure modes
Failure mode
Control
Silently commuting factors.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Confusing left modules with right modules.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Assuming every module decomposes into simples.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using character identities outside the required field or finiteness conditions.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Treating a matrix representation as faithful without checking its kernel.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Verification checklist
The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.
Quick questions
What should I identify first in a problem about semisimple rings and module decomposition?
Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.
How should definitions be used in proofs?
Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.
When is a structural theorem safer than direct calculation?
Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.
How can a final answer be checked?
Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.
Connections within the handbook
Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.
