← LibrarySchur’s Theorem on Torsion Linear Groups | KEVOS®Project Delivery · Project ManagementLesson 173/249← PrevNext →
ArticlePublished 9 Aug 202618 min readBy Kevin Jogin
Skip to content

Engineering Mathematics Advanced Linear groups

Schur’s Theorem on Torsion Groups

A finitely generated torsion subgroup of GLn(k) is finite — in every characteristic. Equivalently, for linear groups the words torsion and locally finite mean the same thing, so no counterexample to the General Burnside Problem can be a matrix group.

Page ID
KEVOS-ENG-MATH-NCR-0070
Taxonomy
ENG / ENG-MATH
Collection
noncommutative-rings-core
Source
(9.9), §9 (pp. 153–154)
Reviewed
2026-08-08
Version
1.0.0

Executive Summary

**Schur's Theorem (9.9).** Let k be a field and GGLn(k) a finitely generated torsion subgroup. Then G is finite.

Schur proved this in 1911 for k=; Kaplansky supplied the modifications for characteristic p. It settles the General Burnside Problem affirmatively for linear groups, and therefore tells us that every negative answer to that problem — Golod's infinite finitely generated p-groups, the large-exponent free Burnside groups — must be a group with no faithful finite-dimensional representation over any field at all.

1911Schur, characteristic 0
(9.8)torsion → bounded exponent
(9.7)abelian-by-finite repair
anyCharacteristic allowed

Overview

Burnside's First Theorem already settles bounded exponent linear groups when charkN, with an explicit bound Nn3 and no finite generation needed. Two things are missing from that result: torsion groups need not have bounded exponent, and the characteristic may divide the exponent. Schur's theorem removes both gaps at the price of assuming finite generation.

The repairs are exactly two lemmas from Linear Groups and Burnside's Problem. Lemma (9.8) says a finitely generated torsion linear group automatically has bounded exponent — this is where finite generation is spent. Lemma (9.7) says a finitely generated torsion group with an abelian subgroup of finite index is finite — this covers the case where the characteristic divides the exponent and the block kernel refuses to vanish.

The theorem is best read as a linearity obstruction. If you can exhibit an infinite finitely generated torsion group, you have exhibited a group that embeds in no GLn(k) — a conclusion that is otherwise hard to reach.

Learning Objectives

  • State (9.9) and (9.9) precisely, including the finite generation hypothesis.
  • Reconstruct the proof: bounded exponent by (9.8), then the irreducible/reducible dichotomy, then (9.7).
  • Explain why the irreducible case needs no hypothesis on chark.
  • Exhibit infinite torsion linear groups and verify they are not finitely generated.
  • Deduce that Golod's groups and the large-exponent free Burnside groups are not linear.
  • Compare Schur's theorem with Selberg's lemma and the Tits alternative as routes to the same conclusion.

Definitions

Torsion
Every element has finite order. Orders may be unbounded.
Locally finite
Every finitely generated subgroup is finite. Always implies torsion, since g is finitely generated.
Exponent
The least N1 with gN=1 for all g, when such N exists.
Virtually P
Has a subgroup of finite index with property P. Schur's proof produces a virtually abelian group at its last step.
Linear over k
Admits an injective homomorphism into GLn(k) for some n<.
Residually finite
For every g1 there is a homomorphism to a finite group not killing g. By Mal'cev, every finitely generated linear group is residually finite.

Finite generation is a hypothesis on the group, not on the field. The field k is arbitrary and may be of any characteristic and any cardinality.

Core Concepts

Where finite generation is actually used

Exactly once, in Lemma (9.8), and once more in Lemma (9.7). In (9.8) it lets us shrink k to a field finitely generated over its prime field, so that the minimal polynomials of the elements of G range over a finite set; that finite set bounds the orders and hence the exponent.

Everything after that point uses only bounded exponent — until the very last step, where (9.7) needs finite generation again to conclude that a finitely generated torsion group with abelian subgroup of finite index is finite.

Why the irreducible case is characteristic-free

Suppose G has exponent N and acts irreducibly on k¯n. Whether or not pN, the polynomial tN1 has at most N roots in k¯, so eigenvalues of elements of G range over a finite set and |tr(G)|Nn. Burnside's theorem makes the action absolutely irreducible, the Trace Lemma applies, and G is finite.

Torsion versus locally finite

For abstract groups these are genuinely different: Golod's p-groups are torsion and not locally finite. For linear groups the difference vanishes, because local finiteness is tested on finitely generated subgroups and each such subgroup is again linear of the same degree n — the degree does not grow as one passes to subgroups. That stability of n is the reason the induction closes.

Key Results

Lemma(9.8)Bounded exponent

Let k be a field and GGLn(k) a finitely generated torsion subgroup. Then G has finite exponent.

Sketch: reduce to k finitely generated over its prime field P, then to GGLrn(k0) with k0 purely transcendental over P and r=[k:k0]<. Minimal polynomials of torsion elements have roots of unity as their roots, so their coefficients are algebraic over P and therefore lie in (when P=, with bounded absolute value) or in 𝔽p. Only finitely many such polynomials of degree rn exist, and the minimal polynomial determines the order. Full proof in Linear Groups and Burnside's Problem.

Lemma(9.7)Abelian-by-finite torsion groups are finite

Let G be a finitely generated torsion group with an abelian subgroup H of finite index. Then G is finite. Note that no linearity is assumed; this is a statement about abstract groups.

Theorem(9.9)Schur

Let k be a field of arbitrary characteristic and let GGLn(k) be a finitely generated torsion subgroup. Then G is finite.

Proof

By (9.8), G has finite exponent N. Replace k by its algebraic closure — this changes neither G nor N nor finite generation — and induct on n.

**Base n=1.** Gk× consists of roots of tN1, so |G|N.

**G acts irreducibly.** Every gG satisfies gN=1, so its eigenvalues lie in the finite set of roots of tN1 in k and tr(G) is finite, of cardinality rNn. Since k is algebraically closed, irreducible means absolutely irreducible (7.3), so the Trace Lemma (9.3) gives |G|rn2<. No hypothesis on chark enters.

**G acts reducibly.** Choose a basis adapted to a proper nonzero kG-submodule, so that every gG takes the block form

g=(g1h0g2),n1+n2=n,ni1,

and let GiGLni(k) be the group of blocks gi occurring. Each Gi is a homomorphic image of G, hence finitely generated and torsion, so by the inductive hypothesis G1 and G2 are finite.

Therefore H:=ker(GG1×G2) has index at most |G1||G2|< in G. By (9.6), H — consisting of the matrices (Ih0I) lying in G — is abelian.

So G is a finitely generated torsion group with an abelian subgroup of finite index, and (9.7) gives |G|<.

Theorem(9.9')Torsion equals locally finite

A linear group GGLn(k) over a field k is torsion iff it is locally finite.

Proof

If G is locally finite then every cyclic subgroup g is finite, so G is torsion — this direction holds for all groups. Conversely, let G be torsion and let HG be finitely generated. Then H is a finitely generated torsion subgroup of the same GLn(k), so H is finite by (9.9).

Corollary(9.9a)A linearity obstruction

An infinite finitely generated torsion group admits no injective homomorphism into GLn(k), for any n and any field k. In particular Golod's infinite finitely generated p-groups and the free Burnside groups B(d,N) for the exponents N where they are known to be infinite are not linear over any field.

RemarkJordan–Schur

Schur proved more in characteristic zero. Jordan's theorem provides a function j(n) such that every finite subgroup of GLn() has a normal abelian subgroup of index at most j(n); Schur extended this to all torsion subgroups of GLn(). The bound is uniform in the group, which is what makes the statement useful in the classification of crystallographic groups.

RemarkTwo later proofs

In characteristic zero, Selberg's lemma — every finitely generated linear group over a field of characteristic 0 has a torsion-free subgroup of finite index — gives (9.9) in one line: a torsion group whose finite-index subgroup is torsion-free has that subgroup trivial, hence is finite. The Tits alternative gives another route: a finitely generated linear group is either virtually solvable or contains a nonabelian free subgroup, and a torsion group contains no free subgroup.

Proof Techniques and Method

How these proofs work, and which move to reuse.

Upgrade torsion to bounded exponentLemma (9.8). Spend finite generation here: it makes the field, and hence the set of minimal polynomials, finite in the relevant sense.
Extend the fieldPass to k¯ so that irreducible becomes absolutely irreducible. Nothing about G changes.
Split on irreducibilityIrreducible: finitely many traces, Trace Lemma, done. Reducible: block triangularise and induct on the degree.
Control the kernelThe kernel of GG1×G2 is abelian; the quotient is finite by induction.
Close with (9.7)A finitely generated torsion group that is abelian-by-finite is finite. This replaces Burnside's injectivity step and needs no characteristic hypothesis.

The reusable idea is the reduction of a field-theoretic finiteness question to a bounded-degree polynomial count. Lemma (9.8) is a template: whenever elements of a linear group satisfy a fixed algebraic condition, their minimal polynomials live in a finite set once the coefficient field is finitely generated over its prime field and the coefficients are constrained to be algebraic integers or to lie in 𝔽p.

Worked Example

A finitely generated torsion group in GL2()

Let

A=(0110),B=(0110),G=A,BGL2().
(E.1)

Then A4=I, B2=I, and BAB1=(0110)=A1. So G is a quotient of the dihedral group of order 8, and since A has order 4 and BA, |G|=8.

Schur's theorem predicts finiteness; (9.8) predicts bounded exponent, and indeed expG=4; Burnside's bound (9.4) predicts |G|423=65536. The true answer is 8. Every element is a root of t41, whose roots ±1,±1 generate (1) — consistent with (9.8), where the minimal polynomials t1, t+1, t2+1, t21 are the only ones occurring.

Two infinite torsion linear groups — neither finitely generated

Characteristic zero. The group μGL1() of all roots of unity is torsion and infinite. It is not finitely generated: any finite subset lies in μm for m the lcm of the orders, and μmμ.

**Characteristic p.** Let 𝔽p¯ be an algebraic closure and

U={(1h01):h𝔽p¯}(𝔽p¯,+).
(E.2)

Infinite, abelian, of exponent p: a torsion linear group that is not finite.

U is locally finite — a finitely generated subgroup corresponds to a finite-dimensional 𝔽p-subspace of 𝔽p¯, hence a finite group — exactly as (9.9) demands. Note that U has bounded exponent p, so Burnside's First Theorem does not apply: its hypothesis charkN fails.

A near miss: two reflections

Let Rθ and R0 be the reflections of 2 in the lines at angles θ and 0. Their product is the rotation by 2θ, which has finite order iff θ is a rational multiple of π. So Rθ,R0 is finitely generated and generated by torsion elements, but is torsion only in the rational case — where it is the finite dihedral group. Being generated by torsion elements is not the same as being torsion, and Schur's theorem says nothing about the irrational case, where the group is the infinite dihedral group.

Process and Workflow

You have a torsion subgroup GGLn(k). Is it finite?

G is finitely generatedYes — finite, by Schur (9.9). No bound in terms of n and the number of generators is available; the order can be arbitrarily large.
G has exponent N with charkNYes — finite of order at most Nn3, by Burnside's First Theorem (9.4). Finite generation is not needed.
G has finitely many conjugacy classesYes — finite, by Burnside's Second Theorem (9.5), and torsion is not even needed.
None of the aboveG is locally finite by (9.9) but may well be infinite: μ and UT2(𝔽p¯) are the standard examples.

To prove that a given abstract group Γ is not linear, the corresponding workflow is: check that Γ is finitely generated; check that every element has finite order; check that Γ is infinite. If all three hold, Γ embeds in no GLn(k) over any field.

Comparison and Classification

Finiteness conditions: abstract groups versus linear groups
ConditionAbstract groupsLinear groups GGLn(k)
torsion locally finitefalse (Golod)true, (9.9)
f.g. + torsion finitefalse (Golod, Novikov–Adjan)true, (9.9)
f.g. + exponent N finitefalse for large Ntrue, (9.9)
exponent N finitefalsetrue if charkN, (9.4); false otherwise
torsion finitefalsefalse — μ, UT2(𝔽p¯)
f.g. residually finitefalsetrue (Mal'cev)
Which hypothesis each theorem consumes
finitely generatedbounded exponentchar conditionexplicit bound
Burnside I (9.4)noyesyesyes
Burnside II (9.5)nononono
Lemma (9.8)yesnonono
Schur (9.9)yesnonono
Selberg's lemmayesnoyes — char 0no

Which hypothesis each theorem consumes

Relationship Map

The classes below are nested, and the collapses that occur when linearity is imposed are exactly the content of this section.

All groupstorsion locally finite finite; both containments strict
Linear groupstorsion = locally finite, by (9.9)
+ finitely generatedtorsion = finite, by Schur (9.9)
+ exponent N, charkNfinite of order Nn3, by (9.4) — and finite generation becomes unnecessary
f.g. torsion linearbounded exponent (9.8)blocks finite by inductionabelian kernel of finite index (9.6)finite (9.7)

Applications and Industry Use

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

Geometric group theory

Proving non-linearity

Schur's theorem is one of the standard three obstructions to linearity, alongside Mal'cev's residual finiteness theorem and the Tits alternative. It is the one that applies to torsion groups such as Grigorchuk's group of intermediate growth, which is an infinite finitely generated 2-group and hence linear over no field.

Crystallography

Point groups and space groups

The point group of a crystal is a finite subgroup of GLn(). Together with Minkowski's bound on the orders of finite subgroups of GLn(), local finiteness makes the enumeration of n-dimensional space groups a terminating computation.

Algebraic groups

Torsion in G(k)

For a linear algebraic group G over k, the group of k-points is linear, so its torsion subgroups are locally finite. This is used when analysing the structure of maximal tori and of finite subgroups of Lie type groups.

Computational algebra

Finiteness tests

An algorithm testing whether a matrix group given by generators over a number field is finite may first test that each generator has finite order; Schur's theorem guarantees that torsion of the generators plus torsion of enough products is the right thing to look for, and Minkowski-type bounds terminate the search.

Inside ring theory the theorem is the group-theoretic counterpart of the statement that a finitely generated algebraic algebra over a field, satisfying enough finiteness, is finite-dimensional; the Kurosh problem for algebras is the exact analogue of the General Burnside Problem, and Golod's construction answers both at once.

Failure Modes and Common Mistakes

  • Do not assume the theorem gives an abelian subgroup of finite index in general; the Jordan–Schur refinement does so in characteristic 0, but in characteristic p the relevant normal subgroup is unipotent, not abelian.
  • Do not apply (9.9) to subgroups of GLn(R) for a general commutative ring R without checking that R embeds in a field, or at least reducing to a residue field.
  • Do not confuse local finiteness with residual finiteness. Both hold for the relevant linear groups, for entirely different reasons.
  • Do not read (9.9) as saying every linear group is locally finite; the hypothesis torsion is essential — GLn() is linear and not locally finite.

Historical Notes and Lessons Learned

  • 1878JordanA finite subgroup of GL_n(C) has an abelian normal subgroup whose index is bounded by a function of n alone.
  • 1902Burnside's questionThe General Burnside Problem is posed; Burnside himself settles exponent 3 and develops the trace method for linear groups.
  • 1911SchurA finitely generated torsion subgroup of GL_n(C) is finite; Schur also extends Jordan's bounded-index theorem from finite to torsion subgroups.
  • 1940Mal'cevFinitely generated linear groups are residually finite — an independent and now equally standard obstruction to linearity.
  • mid-centuryKaplanskyThe characteristic p case is settled; the proof is Schur's with the abelian-by-finite lemma replacing the injectivity step that fails when p divides the exponent.
  • 1960Selberg's lemmaEvery finitely generated linear group in characteristic zero has a torsion-free subgroup of finite index, giving a second proof of Schur's theorem in that case.
  • 1964GolodInfinite finitely generated p-groups exist. By Schur's theorem they are not linear over any field — the first widely used non-linearity argument.
  • 1972Tits alternativeA finitely generated linear group either contains a nonabelian free subgroup or is virtually solvable; torsion excludes the first option, yielding yet another route to (9.9).

The lesson is that finiteness theorems for linear groups are cheap and finiteness theorems for abstract groups are not. A representation of bounded degree is an enormously strong hypothesis: it forces the whole group into a fixed finite-dimensional algebra, where counting arguments become available.

Quick Reference

Schur (9.9)GGLn(k) f.g. torsion G finite
Equivalent form (9.9)linear: torsion locally finite
Input 1(9.8): f.g. torsion linear bounded exponent
Input 2(9.7): f.g. torsion abelian-by-finite finite
Input 3(9.3) Trace Lemma, via (7.3) Burnside
Characteristicarbitrary; char p only affects the reducible case
Effective?no bound on |G| from n and generator count
Contrapositiveinfinite f.g. torsion group not linear
Standard examples to keep at hand
Groupf.g.?torsion?finite?
μGL1()noyesno
UT2(𝔽p¯)noyesno
A,BD4GL2()yesyesyes — order 8
GLn()yesnono
Golod's p-groupyesyesno — hence not linear
infinite dihedral in GL2()yesnono

Frequently Asked Questions

Why can finite generation not be dropped?

Because infinite torsion linear groups exist. The group of all complex roots of unity is torsion and infinite inside GL1(); the additive group of 𝔽p¯, realised as unitriangular 2×2 matrices, is torsion of exponent p and infinite. Both are locally finite, in accordance with (9.9), and neither is finitely generated.

Where does the proof use the characteristic?

Only in the reducible step. The irreducible step counts eigenvalues among the roots of tN1, and that set is finite in every characteristic. In the reducible step Burnside's argument would kill the kernel using Nh=0 and N invertible; when charkN that fails, and Schur substitutes the observation that the kernel is abelian of finite index and appeals to (9.7).

Does Schur's theorem bound the order of G?

No. For fixed n and a fixed number of generators the order is unbounded: μmGL1() is cyclic on one generator and has order m. A bound requires extra data — the exponent, as in Burnside's Nn3, or arithmetic constraints on the field, as in Minkowski's bound for subgroups of GLn().

Are torsion subgroups of GLn() finite?

Yes, and uniformly so. Every finitely generated subgroup is finite by (9.9), and by Minkowski's theorem the order of a finite subgroup of GLn() divides an explicit function of n. A locally finite group whose finitely generated subgroups have uniformly bounded order is itself of that bounded order, so torsion subgroups of GLn() are finite with a bound depending only on n.

How is this used to prove a group is not linear?

Contrapositively. Exhibit the group as finitely generated, torsion and infinite — Golod's p-groups, the Grigorchuk group, the free Burnside groups of large exponent — and (9.9) forbids any faithful finite-dimensional representation over any field. This is usually easier than showing failure of residual finiteness, and it applies where the Tits alternative gives nothing new.

Is the analogue true for algebras?

The corresponding question is the Kurosh problem: must a finitely generated algebraic algebra over a field be finite-dimensional? The answer is no, by the same Golod–Shafarevich construction that answers the General Burnside Problem — the group example is manufactured from the algebra example. Within a fixed finite-dimensional matrix algebra, however, the answer is yes for trivial reasons of dimension.

References

  1. T. Y. Lam, A First Course in Noncommutative Rings, Graduate Texts in Mathematics 131, Springer-Verlag, 1991, §9 (pp. 153–154).
  2. I. Schur, “Über Gruppen periodischer linearer Substitutionen”, Sitzungsberichte der Preussischen Akademie der Wissenschaften (1911), 619–627.
  3. B. A. F. Wehrfritz, Infinite Linear Groups, Ergebnisse der Mathematik 76, Springer-Verlag, 1973, Chapters 4 and 9.
  4. I. Kaplansky, Fields and Rings, 2nd edition, Chicago Lectures in Mathematics, University of Chicago Press, 1972.
  5. J. Tits, “Free subgroups in linear groups”, Journal of Algebra 20 (1972), 250–270.
  6. D. Passman, The Algebraic Structure of Group Rings, Wiley-Interscience, 1977.

AI Suggested Questions

  • Reconstruct the proof of Selberg's lemma and check that it really gives Schur's theorem in characteristic zero.
  • State the Jordan-Schur theorem with an explicit bound on the index and compare with the best known values of Jordan's function.
  • Is the Grigorchuk group linear over any field, and what is the shortest proof either way?
  • How does the Tits alternative fail in characteristic p without a finite generation hypothesis?
  • Give the sharpest known bound for the order of a finite subgroup of GL(n,Q) and compare with Minkowski's bound.
  • What is the largest class of rings R for which torsion subgroups of GL(n,R) are still locally finite?
  • Explain how Golod's construction produces a group from an algebra, and why the resulting group cannot be linear.
Page
KEVOS-ENG-MATH-NCR-0070
Path
Engineering / Mathematics
Template
kevos-knowledge-article-v2
KEVOS® Knowledge Library — reviewed 2026-08-08

Continue learning

Absolutely Irreducible Modules and Schur’s Lemma over a Field | KEVOS®Article · Project ManagementAlgebraic and Geometric Multiplicities of Eigenvalues | KEVOS® MathematicsArticle · Project ManagementAmitsur’s Theorem on the Radical of a Polynomial Ring | KEVOS®Article · Project ManagementAmitsur’s Theorem on the Radical of an Algebra of Small Dimension | KEVOS®Article · Project Management