KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesJ-Semisimplicity of Complex and Real Group AlgebrasEngineering · Engineering MathematicsLesson 375/884← PrevNext →
ArticlePublished 8 Aug 202622 min readBy KEVOS®
On this page

Ask about this page

KEVOS AIJ-Semisimplicity of Complex and Real Group Algebras

KEVOS knowledge first · trusted web sources when needed

Skip to content

Engineering Mathematics Advanced Group rings

J-Semisimplicity of Group Algebras

Semisimplicity is impossible for infinite groups, so the question becomes whether rad(kG)=0. Rickart answered it for ℂ and ℝ by combining a positivity estimate on the trace with Liouville-style complex analysis applied to the resolvent.

Page ID
KEVOS-ENG-MATH-NCR-0047
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(6.4)–(6.11), §6 (pp. 86–92)
Reviewed
2026-08-08
Version
1.0.0

01Executive Summary

For an infinite group no coefficient ring makes kG semisimple, so the substitute question is J-semisimplicity: is rad(kG)=0? Rickart settled the first serious case in 1950: for every group G, the complex group algebra ℂG has zero Jacobson radical, and the real one follows.

The proof splits into two independent halves that contradict each other. The algebraic half manufactures, from any nonzero radical element, a self-adjoint element a whose traces along the powers a2m are real and at least 1. The analytic half shows every radical element has tr(an)→0. Neither half is hard; the pairing is what does the work.

1950Rickart
∑g|ag|2tr(a∗a)
≥1 vs →0The contradiction
OpenℚG for general G

02Overview

Maschke's theorem and its infinite-group complement leave a clean gap. Semisimplicity of kG is settled — it happens exactly for finite G with |G| invertible — and for all other groups the natural weakening is rad(kG)=0. Since the radical is defined without chain conditions, this question makes sense for every group.

The historical order is worth respecting even though later results are stronger. Rickart's theorem is the first, is proved by analysis rather than algebra, and is what convinced the field that the general problem was worth attacking.

rad(ℂG)=0andrad(ℝG)=0for every group G.
(6.4)

No hypothesis on G whatsoever: not finiteness, not countability, not torsion-freeness.

The one thing to remember

tr(α∗α)=∑g|ag|2. Positivity of this expression is the entire algebraic content, and the analytic input is only that radical elements are topologically nil.

The same positivity, stated abstractly as a condition on an involution, yields a purely algebraic theorem: over a formally real commutative ring, or over an algebraically closed field of characteristic zero, kG has no nonzero nil one-sided ideals. That result is what Amitsur's later extension to almost all fields of characteristic zero is built on.

03Learning Objectives

  • State (6.4) and explain why the real case follows from the complex one.
  • Prove the identity tr(α∗α)=∑g|ag|2 and the doubling inequality it gives.
  • Construct the element a of (6.5) from an arbitrary nonzero radical element.
  • Verify that |⋅| is a submultiplicative norm and that the resolvent is entire.
  • Prove (6.6): trg(an)→0 for every a∈rad(ℂG) and every g∈G.
  • State (6.11) with its involution hypothesis and identify the two standard cases where it applies.

04Definitions

Definition—Trace, involution and norm on ℂG

For α=∑g∈Gagg∈ℂG define

trg(α)=ag,tr(α)=tr1(α)=a1,α∗=∑gag¯g−1,|α|=∑g|ag|.
(6.4a)

The map α↦α∗ is an involution: it is additive, satisfies α∗∗=α, and reverses products. The function |⋅| is a norm with |αβ|≤|α||β| and |trg(α)|≤|α|, so ℂG is a normed algebra and each trg is continuous and ℂ-linear.

Self-adjoint
α∗=α. Powers of a self-adjoint element are self-adjoint, since (αn)∗=(α∗)n.
Formally real
A commutative ring k with ∑iai2=0⇒ all ai=0. Examples: ℚ, ℝ, any real-closed field, and ℝ[t].
Real-closed field
A formally real field admitting no formally real proper algebraic extension. By Artin–Schreier, an algebraically closed field of characteristic zero is k0(i) for a real-closed k0.
Resolvent
ϕ(z)=(1−za)−1, defined for all z∈ℂ when a∈rad(ℂG), since za then lies in the radical and 1−za is a unit.
ℓ1(G)
The completion of ℂG in the norm |⋅|, a Banach algebra under convolution; the analyst's version of the group algebra.

Nothing here requires G to be countable or finitely generated. Every element of ℂG has finite support, so all sums written above are finite.

05Core Concepts

The trace form is positive definite

Expanding α∗α=∑g,hag¯ahg−1h and reading off the coefficient of the identity — which requires h=g — gives

tr(α∗α)=∑g∈Gag¯ag=∑g∈G|ag|2≥|a1|2=|trα|2.
(6.5a)

Positive definiteness plus the crude bound that discarding all terms but one can only decrease the sum.

Two consequences follow at once. First, tr(α∗α)=0 forces α=0: the trace form makes ℂG a pre-Hilbert space, and its completion is ℓ2(G) with G as orthonormal basis. Second, for self-adjoint α we get tr(α2)≥|trα|2, and iterating along squares gives a sequence that cannot decay.

Why the radical is analytically small

If a∈rad(ℂG) then za is in the radical for every scalar z, so 1−za is a unit and the resolvent ϕ(z)=(1−za)−1 is defined on all of ℂ. The resolvent identity

ϕ(y)−ϕ(z)=ϕ(y)[(1−za)−(1−ya)]ϕ(z)=(y−z)aϕ(y)ϕ(z)
(6.7)

Valid because ϕ(y) and ϕ(z) commute — both are power series in a in the formal sense.

shows ϕ is locally bounded, continuous, and differentiable with ϕ′(z)=aϕ(z)2. Composing with the continuous linear functional trg produces an entire scalar function whose Taylor coefficients at 0 are the numbers trg(an).

Where the analysis is genuinely needed

One would like to evaluate the geometric series ∑nan at z=1. That is illegitimate: there is no reason for |a|<1, and the series need not converge in ℂG. What is legitimate is that an entire function's Taylor series at the origin has infinite radius of convergence, so the scalar series ∑ntrg(an) converges at z=1 — and a convergent series has terms tending to zero.

The Banach algebra picture behind it

Rickart's original argument treats G as a discrete locally compact group and works in the convolution Banach algebra ℓ1(G). Two general facts are being specialised: the radical of a complex Banach algebra consists of topologically nil elements, and in a C∗-algebra the only topologically nil one-sided ideal is zero. The second is where the ∗-structure and positivity enter, and it also shows every C∗-algebra is J-semisimple.

06Key Results

Theorem(6.4)Rickart's theorem

For every group G — finite or infinite, of arbitrary cardinality — the complex group algebra ℂG is J-semisimple, that is rad(ℂG)=0. Consequently rad(ℝG)=0 as well.

Lemma(6.5)The algebraic part

Let G be any group. If rad(ℂG)≠0, then there exists a∈rad(ℂG) with a∗=a and tr(a)=1 such that, for every m≥1, the number tr(a2m) is real and tr(a2m)≥1.

Proof

Pick 0≠β∈rad(ℂG) and set γ=β∗β. Since the radical is a two-sided ideal, γ∈rad(ℂG), and γ∗=β∗β∗∗=γ. By (6.5a), tr(γ)=∑g|bg|2 is a positive real number, so we may define

a=γtr(γ)∈rad(ℂG),a∗=a,tr(a)=1.
(6.5b)

Self-adjointness is preserved because the scalar divisor is real. Now induct on m. Each a2m−1 is self-adjoint, so writing b=a2m−1 we get tr(a2m)=tr(b2)=tr(b∗b)=∑g|bg|2, which is real and non-negative, and by (6.5a) it is at least |tr(b)|2.

The base case is tr(a)=1. If tr(a2m−1)≥1 then tr(a2m)≥|tr(a2m−1)|2≥1. This closes the induction.

Lemma(6.6)The analytic part

Let G be any group and a∈rad(ℂG). Then for every g∈G,

limn→∞trg(an)=0in ℂ.
(6.6a)

In particular tr(an)→0, taking g=1.

Proof

The resolvent is defined everywhere. For z∈ℂ the element za lies in the radical, so 1−za∈U(ℂG) and ϕ(z)=(1−za)−1 makes sense for all z.

Local boundedness and differentiability. From (6.7) and submultiplicativity, |ϕ(y)|≤|ϕ(z)|+|y−z||a||ϕ(y)||ϕ(z)|, hence |ϕ(y)|(1−|y−z||a||ϕ(z)|)≤|ϕ(z)|. For y close enough to z the bracket exceeds 12, giving |ϕ(y)|≤2|ϕ(z)|. Substituting back into (6.7) yields |ϕ(y)−ϕ(z)|≤2|a||y−z||ϕ(z)|2, so ϕ is continuous, and dividing by y−z and letting y→z gives ϕ′(z)=aϕ(z)2 for every z∈ℂ.

A geometric series near the origin. Suppose |z||a|<1. For any N,

ϕ(z)−∑n=0Nznan=ϕ(z)[1−(1−za)∑n=0Nznan]=ϕ(z)(za)N+1,
(6.8)

whose norm is at most |ϕ(z)|(|z||a|)N+1→0. Hence ϕ(z)=∑n≥0znan in the norm of ℂG for |z|<|a|−1.

Conclusion. Fix g and put f=trg∘ϕ:ℂ→ℂ. Since trg is ℂ-linear and continuous and ϕ is differentiable everywhere, f is entire, and by the previous step

f(z)=∑n=0∞trg(an)znfor |z|<|a|−1.
(6.9)

That is the Taylor expansion of f at the origin. An entire function's Taylor series at 0 has infinite radius of convergence and represents the function everywhere, so the series converges at z=1. The terms of a convergent series tend to zero, giving trg(an)→0.

Proofof Rickart's theorem (6.4)

Suppose rad(ℂG)≠0. Lemma (6.5) produces a in the radical with tr(a2m)≥1 for all m≥1. Lemma (6.6) applied to the same a gives tr(an)→0, hence tr(a2m)→0 along the subsequence n=2m. These are incompatible, so rad(ℂG)=0.

For the real case, ℂG=ℝG⋅1+ℝG⋅i is generated as a left ℝG-module by the two elements 1 and i, both of which centralise ℝG. The ascent result for ring extensions then gives rad(ℝG)⊆rad(ℂG)=0.

Remark(6.10)Why the shortcut is illegal

The value f(1)=trg((1−a)−1) would follow immediately from (1−a)−1=∑nan if that series converged in ℂG — which needs |a|<1, a condition no one has established and which is false in general. The entire-function theorem is exactly the device that transfers a statement true near the origin to the point z=1 without any control on |a|.

Proposition(6.11)Involutions kill nil one-sided ideals

Let k be a ring with an involution ∗ satisfying the positivity condition

∑iai∗ai=0⟹ai=0 for all i(ai∈k).
(6.11a)

Then for every group G, the group ring R=kG has no nonzero nil left ideals. This applies in particular when (a) k is a commutative formally real ring with ∗ the identity, and (b) k is an algebraically closed field of characteristic zero.

Proof

Extend ∗ to R by (∑agg)∗=∑ag∗g−1; this is an involution on R. Computing the identity coefficient of α∗α as in (6.5a) gives tr(α∗α)=∑gag∗ag, so hypothesis (6.11a) says precisely

tr(α∗α)=0⟹α=0(α∈R).
(6.11b)

Suppose 𝔅≠0 is a nil left ideal of R and pick 0≠β∈𝔅. Then γ=β∗β∈𝔅 because 𝔅 is a left ideal, γ∗=γ, and γ≠0 by (6.11b). Since γ is nil, there is n≥1 with γn≠0 and γn+1=0.

Set α=γn. Then α∗α=γnγn=γ2n=0, because 2n≥n+1 for n≥1. Applying (6.11b) gives α=γn=0, a contradiction. Hence no nonzero nil left ideal exists.

Case (a). With ∗ the identity on a commutative formally real k, condition (6.11a) is the definition of formal reality.

Case (b). Let k be algebraically closed of characteristic zero. By Artin–Schreier, k=k0(i) with k0 real-closed and i2=−1. Define (a+bi)∗=a−bi for a,b∈k0. Then ∑j(aj+bji)∗(aj+bji)=∑j(aj2+bj2), and formal reality of k0 forces every aj and bj to vanish.

Corollary—Characteristic-zero Maschke, again

Let k be a field of characteristic 0 and G a finite group. Then kG is semisimple. Indeed kG is artinian, so rad(kG) is nilpotent; extending scalars to the algebraic closure k¯ makes (radkG)⋅k¯ a nilpotent, hence nil, left ideal of k¯G. By (6.11)(b) it is zero, so rad(kG)=0 and kG is semisimple.

07Proof Techniques and Method

The reusable moves, and which of them survive outside characteristic zero.

Move 1

Normalise a radical element

From any β≠0 in a two-sided ideal, build β∗β: it stays in the ideal, is self-adjoint, and has strictly positive trace. Dividing by that trace gives a canonical representative. The move needs only that the ideal be two-sided and the trace be positive definite.

Move 2

Square along 2m, not n

The inequality tr(b2)≥|trb|2 chains only through squares, so the subsequence of powers a2m is the one that can be controlled. Contradicting a limit along a subsequence is enough.

Move 3

Make a Banach-valued function scalar

Compose a vector-valued analytic function with a continuous linear functional and apply ordinary complex analysis. This is how the resolvent argument avoids developing vector-valued function theory from scratch.

Move 1 is what generalises: it is entirely algebraic and is the content of (6.11). Moves 2 and 3 are tied to ℂ. The characteristic-p theory replaces them by a combinatorial count on p-tuples with product 1, which shows tr(βp)=tr(β)p for p′-groups — a Frobenius substitute for the doubling inequality.

08Worked Example

Watching (6.5) run on a two-element group

Take G=C2={1,g} and β=1+g∈ℂG. Then β∗=1+g−1=1+g, and

γ=β∗β=(1+g)2=2+2g,tr(γ)=2=|1|2+|1|2,
(E.1)

confirming tr(β∗β)=∑g|bg|2 in the smallest possible case.

The normalisation gives a=γ/2=1+g, which is self-adjoint with tr(a)=1. Since a2=2+2g=2a, induction gives an=2n−1a for n≥1, so

tr(a2m)=22m−1≥1for every m≥1,
(E.2)

exactly the lower bound (6.5) predicts — and here it diverges rather than merely staying above 1.

Consistency check

ℂC2≅ℂ×ℂ is semisimple, so rad=0 and a=1+g is not a radical element. Good: (6.6) demands tr(an)→0 for radical elements, and here tr(an)=2n−1→∞. No contradiction — the two lemmas only collide when a nonzero radical element exists.

Exactly where characteristic 2 breaks the argument

Repeat the computation over k=𝔽2 with the identity involution. Now α=1+g satisfies α∗=α and

α∗α=(1+g)2=1+g2=0,yet α≠0.
(E.3)

So the positivity hypothesis (6.11a) fails for (𝔽2,id), and indeed the conclusion fails: 𝔽2C2 has the nonzero nil ideal (1+g), which is its whole Jacobson radical. This one line explains why the entire characteristic-zero theory has to be rebuilt in characteristic p, and why the rebuilt version excludes elements of order p.

The same element in three coefficient rings
ktr(α∗α) for α=1+grad(kC2)
ℂ20
ℚ20
𝔽20(1+g), of dimension 1

09Comparison and Classification

State of the J-semisimplicity problem by coefficient field
Field kGroups coveredAnswerDue to
ℂ and ℝall GJ-semisimpleRickart (6.4)
Uncountable, characteristic 0all GJ-semisimpleAmitsur and Herstein, independently
Characteristic 0, not algebraic over ℚall GJ-semisimpleAmitsur (6.12)
Algebraic over ℚ, including ℚ itselfall Gopen in general—
Characteristic p, not algebraic over 𝔽pp′-groupsJ-semisimplePassman (6.15)
Characteristic pG with a finite normal subgroup of order divisible by pnot J-semisimplesquare-zero ideal argument
Which ingredient each step of the proof uses
Involution on kPositivity of the traceComplex analysisrad is two-sided
(6.5) algebraic lemma●yes●yes○no●yes
(6.6) analytic lemma○no○no●yes●yes
(6.4) Rickart●yes●yes●yes●yes
(6.11) no nil left ideals●yes●yes○no○no

Which ingredient each step of the proof uses

(6.11) needs no analysis and no two-sidedness — it applies to any nonzero nil left ideal — which is why it, rather than Rickart's theorem, is the result that generalises to arbitrary characteristic-zero coefficient fields.

10Relationship Map

The logical shape of the proof is a collision between two independent estimates on the same element.

rad(ℂG)≠0⟹∃a=a∗, tr(a)=1⟹tr(a2m)≥1⟹contradicts tr(an)→0
Rickart, 1950ℂG and ℝG are J-semisimple, by Banach algebra methods.
Amitsur and HersteinAny uncountable field of characteristic zero works, by a cardinality argument on the inverses of a−r rather than by analysis.
Amitsur, 1959Any field of characteristic zero that is not algebraic over ℚ: take a transcendence basis, use (6.11)(a) over ℚ to kill the nil contraction, then ascend along a separable algebraic extension.
Passman, 1962The characteristic-p analogue for p′-groups, with a combinatorial substitute for the positivity lemma.
Still openThe case where k is algebraic over its prime field — above all ℚG itself. Lam records that it is precisely the prime fields that resist.

The step from (6.11) to Amitsur's theorem is worth isolating. Writing F=ℚ({xi}) for a transcendence basis of K/ℚ, the contraction rad(FG)∩ℚG is a nil ideal of ℚG by the transcendental scalar-extension results; (6.11)(a) with k=ℚ forces it to vanish, hence rad(FG)=0; and K/F is separable algebraic in characteristic zero, so J-semisimplicity ascends to KG.

11Applications and Industry Use

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

Operator algebras

Semiprimitivity of C∗-algebras

The argument of (6.5), read in ℓ1(G) and its C∗-completion, shows that a C∗-algebra has no nonzero topologically nil one-sided ideal, hence is J-semisimple. The group algebra result is the discrete special case of a general principle about ∗-algebras with positive-definite trace.

Representation theory

Faithful families of representations

rad(ℂG)=0 says the simple ℂG-modules separate elements: no nonzero element of ℂG acts as zero on every irreducible representation. For infinite G this is the closest available substitute for the Wedderburn decomposition.

Harmonic analysis

Convolution algebras on discrete groups

The norm |α|=∑|ag| is the ℓ1-norm and the multiplication is convolution. Facts proved here about ℂG are the algebraic core of results about ℓ1(G), and the resolvent function is the standard tool of spectral theory in that setting.

Ring theory

A benchmark for radical computations

Rickart's theorem supplies an infinite family of J-semisimple, non-artinian, generally noncommutative rings, against which conjectures about radicals and nil ideals can be tested.

The honest summary is that this result is internal to algebra and analysis. Its practical significance is that it makes character-theoretic and operator-theoretic methods for infinite discrete groups viable at all, since a nonzero radical would mean irreducible representations lose information.

12Computational Notes

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

  • There is no algorithm that decides J-semisimplicity of kG from a presentation of G: for finitely presented groups even the word problem is undecidable, so membership in rad(kG) cannot be decided in general.
  • Radical questions do localise. For any α∈kG there is a finitely generated subgroup G0 with α∈kG0, and kG0∩rad(kG)⊆rad(kG0); so if kH is J-semisimple for every finitely generated H≤G then kG is J-semisimple. This reduction is how the locally finite cases are handled.
  • For G finite the computation is entirely effective: dimkkG=|G|, and the radical of a finite-dimensional algebra is computed in O(|G|3) field operations in characteristic zero, or by the Friedl–Rónyai method in characteristic p.
  • The traces tr(an) appearing in (6.6) are computable numerically for any explicit a of finite support, but observing decay is not a proof of membership in the radical — the implication runs the other way.

No finite verification

Rickart's theorem is a statement about all groups simultaneously, proved by a uniform argument. It is not the accumulation of finite checks, and no amount of computation with finite quotients of G would establish it — quotients can have nonzero radical in characteristic p while ℂG does not.

13Failure Modes and Common Mistakes

J-semisimple is not semisimple

ℂG is J-semisimple for every G, and semisimple only when G is finite. The two words differ by the descending chain condition. Reading (6.4) as a Maschke theorem for infinite groups reverses the content of the section.

Do not evaluate the Neumann series at z=1

The identity (1−a)−1=∑nan requires |a|<1, which is not available. Remark (6.10) exists precisely to flag this, and the entire-function argument is the legitimate replacement. Skipping it produces a proof that looks shorter and is wrong.

The doubling inequality needs self-adjointness

tr(α2)≥|trα|2 follows from tr(α∗α)≥|trα|2 only when α∗=α. This is why (6.5) spends its first move replacing β by β∗β, and why it then normalises to keep self-adjointness through the induction.

  • (6.11) concerns nil left ideals, not the radical. Absence of nil ideals does not by itself give rad(kG)=0 — the radical need not be nil. The bridge to J-semisimplicity is supplied by scalar-extension results that force the relevant contraction to be nil.
  • The footnote in Lam is important: the conclusion of (6.11) holds for every field of characteristic zero, not only for algebraically closed ones, but the stronger statement is not proved there. Do not cite the general form as though it were established by this argument.
  • In case (b) of (6.11), the involution is not the identity — it is complex conjugation relative to a real-closed subfield. Applying the identity involution to an algebraically closed field fails immediately, since i2+12=0.
  • Passman's characteristic-p theorem needs G to be a p′-group, but that hypothesis is sufficient rather than necessary: the infinite dihedral group has elements of order 2 and yet kG is J-semisimple in characteristic 2, as Wallace showed.

14Historical Notes and Lessons Learned

  • 1945The radical is defined for arbitrary ringsJacobson's radical makes a semisimplicity-like notion available without chain conditions, so the question of rad(kG)=0 for infinite G becomes meaningful.
  • 1950RickartUsing Banach algebra methods on ℓ1(G), Rickart proves ℂG and ℝG are J-semisimple for every group G. The proof is analytic and gives the problem its momentum.
  • 1950sAmitsur and HersteinIndependently, they extend the conclusion to arbitrary uncountable fields of characteristic zero, replacing analysis by a cardinality argument on the family of inverses.
  • 1959AmitsurFor any field of characteristic zero that is not an algebraic extension of ℚ, every group ring is J-semisimple. The proof runs through the absence of nil left ideals over ℚ and scalar extension along a transcendence basis.
  • 1962Passman, and ConnellThe characteristic-p analogue: over a nonalgebraic extension of 𝔽p, group rings of p′-groups are J-semisimple. The positivity lemma is replaced by an orbit count on p-tuples.
  • SinceThe prime-field obstructionEvery known class of groups gives an affirmative answer, but the cases ℚG and 𝔽pG remain unresolved in general — an inversion of the usual situation, where the smallest fields are the easiest.

The lesson is about the division of labour between analysis and algebra. Rickart's analytic half was later replaced entirely — by cardinality arguments, then by transcendence arguments — while the algebraic half, positivity of tr(α∗α), survives untouched in (6.11) and is still the engine of the characteristic-zero theory.

15Quick Reference

Rickart (6.4)rad(ℂG)=rad(ℝG)=0 for every G
Trace identitytr(α∗α)=∑g|ag|2
Doublingα∗=α⇒tr(α2)≥|trα|2
Algebraic lemma (6.5)radical ≠0 gives a=a∗, tr(a2m)≥1
Analytic lemma (6.6)a∈rad⇒trg(an)→0
Resolventϕ(z)=(1−za)−1, entire, ϕ′(z)=aϕ(z)2
Norm|α|=∑g|ag|, submultiplicative
Involution test (6.11)∑ai∗ai=0⇒ all ai=0, then no nil left ideals in kG
Statement map for §6, pages 86–92
ReferenceStatementMethod
(6.4)ℂG and ℝG are J-semisimplecombination of (6.5) and (6.6)
(6.5)a normalised self-adjoint radical element with traces at least 1positivity of the trace form
(6.6)trg(an)→0 for radical aentire resolvent, Taylor expansion at 0, evaluate at 1
(6.7)–(6.9)resolvent identity, local bound, geometric serieselementary estimates in the norm |⋅|
(6.10)why the Neumann series shortcut is invalidcommentary
(6.11)no nonzero nil left ideals under a positive involutionpurely algebraic; covers formally real and characteristic-zero algebraically closed k

16Frequently Asked Questions

Why does the proof need complex analysis at all?

To justify one evaluation. The series ∑ntrg(an)zn is only known to represent the resolvent near the origin, but the conclusion is needed at z=1. Since the resolvent is defined and differentiable on the whole plane, the composed scalar function is entire, and an entire function is represented by its Taylor series at the origin everywhere. Without this the argument stalls at |z|<|a|−1.

Does Rickart's theorem say ℂG is semisimple?

No, and for infinite G it cannot: no group ring of an infinite group is semisimple. It says the Jacobson radical vanishes, which is the same as semisimplicity only in the presence of the descending chain condition. For G infinite, ℂG is a J-semisimple non-artinian ring.

What is the role of the involution, exactly?

It converts an arbitrary nonzero element into one whose trace is a sum of squared moduli, hence strictly positive. Positivity is what allows a normalisation with tr(a)=1 and what makes the doubling inequality run. Any coefficient ring with an involution satisfying the same positivity condition supports the algebraic half of the argument, which is the content of (6.11).

Why is ℚG harder than ℂG?

The later proofs replace analysis by transcendence: one picks a transcendence basis of k over ℚ and uses the fact that a transcendental scalar extension forces the contracted radical to be nil. A field algebraic over ℚ offers no transcendence basis to work with, so the mechanism disappears. That the smallest fields are the hardest is an inversion of the usual pattern.

Is the characteristic-p statement simply the same proof with p in place of 2?

No. Positivity of a trace form is unavailable in characteristic p — the example (1+g)2=0 in 𝔽2C2 kills it immediately. The substitute is an orbit count: for a p′-group, the p-tuples of group elements multiplying to 1 contribute in orbits of size p except for one singleton, giving tr(βp)=tr(β)p. The hypothesis that G has no element of order p is what makes the singleton unique.

How does the real case follow from the complex case?

ℂG is generated as a left ℝG-module by the two centralising elements 1 and i. The ascent result for such extensions gives rad(ℝG)⊆rad(ℂG), and the right-hand side is zero. The finiteness of the generating set is essential — the corresponding ascent fails for infinite extensions.

17Related KEVOS Topics

The Group Ring ProblemsFor k a domain and G torsion-free, four questions — are all units trivial, is kG reduced, is it a domain, is it J-semisiAmitsur’s Radical TheoremIf a k-algebra R satisfies _k R < |k| as cardinal numbers, then rad R is the largest nil ideal of R. A counting argumentThe 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 Maschke’s TheoremFor a finite group G, the group ring kG is semisimple exactly when k is semisimple and |G| 1 is a unit in k. One averagiGroup Rings of Infinite GroupsIf G is infinite and k ≠ 0, then kG is never semisimple — and the reason is elementary: a complement to the augmentation

18References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §6, (6.4)–(6.11) (pp. 86–92).
  2. C. E. Rickart, “The uniqueness of norm problem in Banach algebras”, Annals of Mathematics 51 (1950).
  3. S. A. Amitsur, “On the semi-simplicity of group algebras”, Michigan Mathematical Journal 6 (1959).
  4. D. S. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, 1977, Chapter 7 and pp. 269–271.
  5. I. N. Herstein, Noncommutative Rings, Carus Mathematical Monographs 15, Mathematical Association of America, 1968, Chapter 1.
  6. C. E. Rickart, General Theory of Banach Algebras, Van Nostrand, 1960, Chapter II.

19AI Suggested Questions

  • Write out the proof that the radical of a complex Banach algebra consists of topologically nil elements.
  • Prove that every C∗-algebra is J-semisimple using the argument of the algebraic lemma.
  • State Amitsur's theorem on group rings over nonalgebraic extensions of ℚ and identify the scalar-extension results it consumes.
  • Give Passman's orbit-counting proof that kG has no nonzero nil left ideals for k reduced of characteristic p and G a p′-group.
  • Which classes of groups are known to give J-semisimple ℚG, and what obstructs the general case?
  • Explain Wallace's proof that the infinite dihedral group has J-semisimple group algebra in characteristic 2 despite having elements of order 2.
  • Compare the trace form on ℂG with the canonical trace on the group von Neumann algebra and its role in ℓ2-Betti numbers.
Page
KEVOS-ENG-MATH-NCR-0047
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. Comparison and Classification
  10. Relationship Map
  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

Group Rings of Infinite Groups Are Never SemisimpleArticle · Engineering MathematicsNEXT LESSON →Group Rings in Prime CharacteristicArticle · Engineering MathematicsMaschke’s Theorem and Semisimplicity of Group RingsArticle · Engineering MathematicsThe Group Ring Problems: Units, Zero Divisors, Idempotents and J-SemisimplicityArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®