Simple and Semisimple Rings, Matrix Rings and Endomorphisms
Simple and Semisimple Rings, Matrix Rings and Endomorphisms: core definitions, structural results and verification methods in abstract algebra.
How the topic fits together
Simple and Semisimple Rings
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Further Properties of Simple Rings, Matrix Rings, and Endomorphisms
This source section supplies the definitions, constructions and formal results used in this article. The sequence of results is preserved so later claims are not detached from their prerequisites.
Core definitions and structural results
The following cards retain the mathematical content of the source while condensing long proofs into verification strategies. Numerical examples are treated as examples, not universal requirements.
Corollary
Let M be a faithful, simple R-module, and let D = EndR(M), a division ring by (9.2.1(b)). If M is a finite-dimensional vector space over D, then EndD(M) ∼= R, a ring isomorphism.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
Definitions and Comments Since a ring is a module over itself, it is natural to
Since a ring is a module over itself, it is natural to call a ring R semisimple if it is semisimple as an R-module. Our aim is to determine, if possible, how semisimple rings are assembled from simpler components. A plausible idea is that the components are rings that are simple as modules over themselves. But this turns out to be too restrictive, since the components would have to be division rings (Section 9.1, Problem 1).
Proof / verification strategy: Use this as a definition checklist: identify the ambient object, test each stated condition separately, then compare examples and non-examples without assuming later theorems.
Proposition
If R is a semisimple ring, then every nonzero R-module M is semisimple.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Proposition
Let I be a simple left ideal in the semisimple ring R, and let M be a simple R-module. Denote by IM the R-submodule of M consisting of all finite linear combinations i rixi, ri ∈I, xi ∈M. Then either IM = M and I is isomorphic to M, or IM = 0.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
Beginning the Decomposition
Beginning the Decomposition Let R be a semisimple ring. We regard two simple left ideals of R as equivalent if they are isomorphic (as R-modules), and we choose a representative Ii, i ∈T from each equivalence class. Define the basic building blocks of R as Bi = the sum of all left ideals of R that are isomorphic to Ii.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
R =
R = i∈T Bi If r ∈R, then (r) is a left ideal, which by (9.1.2) and (9.1.3) (or (9.3.2)) is a sum of simple left ideats.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Each Bi is a two-sided ideal.
Each Bi is a two-sided ideal. Using (9.3.5) and (9.3.6) one has Bi ⊆BiR = Bi j Bj = BiBi ⊆RBi ⊆Bi. Thus RBi = BiR = Bi.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
R has only finitely many isomorphism classes of simple left ideals I1, . . . , It.
R has only finitely many isomorphism classes of simple left ideals I1, . . . , It. By (9.3.6), one can write the identity 1 of R as a finite sum of elements ei ∈Bi, i ∈T. Adjusting the notation if necessary, let 1 = t i=1 ei. If r ∈Bj where j /∈{1, . . . , t}, then by (9.3.5), rei = 0 for all i = 1, . . . , t, so r = r1 = 0.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
R = ⊕t
R = ⊕t i=1Bi. Thus 1 has a unique representation as t i=1 ei, with ei ∈Bi. By (9.3.6) and (9.3.8), R is the sum of the Bi. If b1 + · · · + bt = 0, with bi ∈Bi, then 0 = ei(b1 + · · · + bt) = eib1 + · · · eibt = eibi = (e1 + · · · + et)bi = 1bi = bi.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
If bi ∈Bi, then eibi = bi = biei. Thus ei is the identity on Bi and Bi = Rei = eiR.
If bi ∈Bi, then eibi = bi = biei. Thus ei is the identity on Bi and Bi = Rei = eiR. The first assertion follows from the computation in (9.3.9), along with a similar computation with ei multiplying on the right instead of the left. Now Bi ⊆Rei because bi = biei, and Rei ⊆Bi by (9.3.7) and the fact that ei ∈Bi.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Each Bi is a simple ring.
Each Bi is a simple ring. By the computation in (9.3.7), along with (9.3.10), Bi is a ring (with identity ei). Let J be a simple left ideal of Bi. By (9.3.5) and (9.3.6), RJ = BiJ = J, so J is a left ideal of R, necessarily simple.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
If M is a simple R-module, then M is isomorphic to some Ii. Thus there are only
If M is a simple R-module, then M is isomorphic to some Ii. Thus there are only finitely many isomorphism classes of simple R-modules. In particular, if R is a simple ring, then all simple R-modules are isomorphic. By (9.3.9), R = t i=1 Bi = t i=1 {J : J ∼= Ii} where the J are simple left ideals.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
A semisimple ring R is ring-isomorphic to a direct product of simple rings.
A semisimple ring R is ring-isomorphic to a direct product of simple rings. This follows from (9.3.9) and (9.3.5). For if ai, bi ∈Bi, then (a1 + · · · + at)(b1 + · · · + bt) = a1b1 + · · · + atbt.
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
Lemma
Let R be any ring, regarded as a left module over itself. If h : R →M is an Rmodule homomorpbism, then for some x ∈M one has h(r) = rx for every r ∈R. Moreover, one may choose x = h(1), and the map h →h(1) is an isomorphism of HomR(R, M) and M. This applies in particular when M = R, in which case h ∈EndR(R).
Proof / verification strategy: Construct the natural homomorphism, identify its kernel and image, then apply the relevant quotient/isomorphism result. Check well-definedness before claiming injectivity or surjectivity.
Corollary
Let I and J be simple left ideals of the simple ring R. Then for some x ∈R one has J = Ix.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Lemma
A simple ring R is a finite direct sum of simple left ideals.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Corollary
If I is a simple left ideal of the simple ring R, then IR = R.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Proposition
If R is a simple ring, then the only two-sided ideals of R are 0 and R.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Corollary
Let I be a simple left ideal of the simple ring R, and let M be a simple R-module. Then IM = M and M is faithful.
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Theorem
Let R be a simple ring, V a simple R-module, and D the endomorphism ring EndR(V ). Then V is a finite-dimensional vector space over D. If the dimension of this vector space is n, then (by the above discussion), R ∼= EndD(V ) ∼= Mn(Do).
Proof / verification strategy: Translate the element statement into ideals or quotient rings, establish both inclusions or implications, and use the strongest ring hypothesis actually available.
Quick-reference relationships
Problem-solving workflow
Fix the ring hypotheses
Record commutativity, identity, zero-divisor assumptions and whether the ring is a domain, field, PID, UFD or Euclidean domain.
Translate element questions into ideal questions
Divisibility, kernels, quotients and maximality often become clearer when expressed through generated ideals.
Choose a universal construction
For quotients, fractions or polynomial evaluation, define the candidate map and prove it is well-defined.
Separate existence from uniqueness
Division, factorisation and decomposition results often require different arguments for the two directions.
Use the strongest justified structure
Do not use field division in a general ring or unique factorisation before its hypotheses have been established.
Check the result in a concrete ring
Integers, residue rings and polynomial rings provide useful sanity checks for the abstract statement.
Worked-solution emphasis from the supplied source
The supplied worked solutions for this section repeatedly test kernel, ideal, polynomial, module, exact, prime, maximal, Tor. These checks are used here as verification themes rather than copied as answer text.
Common mistakes and boundary conditions
- Using cancellation in a ring that may contain zero divisors.
- Treating every irreducible element as prime without the needed domain hypothesis.
- Assuming every ideal is principal.
- Applying polynomial root counting without an integral-domain hypothesis.
Verification checklist
- State the ambient algebraic structure and operation before applying a theorem.
- Record every hypothesis that controls the result: finiteness, commutativity, normality, primality, separability, exactness or other section-specific conditions.
- Distinguish a definition from a theorem that follows from it.
- Check whether a map is well-defined before using its kernel, image, inverse or induced map.
- Use a concrete example only as a check; do not promote an illustrative value or pattern to a universal rule.
- When a quotient, localisation or extension is constructed, identify the canonical map and what becomes equal, invertible or fixed.
Source coverage map
| Source section | Subject | PDF pages analysed |
|---|---|---|
| 9.3 | Simple and Semisimple Rings | 181–183 |
| 9.4 | Further Properties of Simple Rings, Matrix Rings, and Endomorphisms | 184–186 |
Related Mathematics pages
Source note: synthesised from the supplied abstract-algebra PDF. The complete 298-page file, including diagrams and worked solutions, was reviewed. Source-identifying author and bibliographic personal details are intentionally omitted. Formal proofs are condensed; the page does not claim requirements or values not supported by the supplied mathematics.