Papalocal
Loading…
Papalocal · Things
Work

Schur's lemma

Schur's lemma is a lemma stating that a module homomorphism between two simple modules over the same ring is either an isomorphism or identically zero.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
lemma One source
Named after
Issai Schur One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2565833185
Described as
lemma stating that a module homomorphism between two simple modules over the same ring is either an isomorphism or identically zero
What it is
lemma
Named after
Issai Schur
Wikipedias with a page
15

Wikidata item Q1816952 (wikidata.org/wiki/Q1816952), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1363731042

In mathematics, Schur's lemma is an elementary but useful statement in representation theory of groups and algebras. In the group case it says that if M and N are two finite-dimensional irreducible representations
of a group G and φ is a linear map from M to N that commutes with the action of the group, then either φ is invertible, or φ = 0. An important special case occurs when M = N, i.e. φ is a self-map; in particular, for representations over an algebraically closed field (e.g. ℂ), any element of the center of a group must act as a scalar operator (a scalar multiple of the identity) on M. The lemma is named after Issai Schur who used it to prove the Schur orthogonality relations and develop the basics of the representation theory of finite groups. Schur's lemma admits generalisations to Lie groups and Lie algebras, the most common of which are due to Jacques Dixmier and Daniel Quillen.

From the Wikipedia article “Schur's lemma” (en.wikipedia.org/wiki/Schur's_lemma), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it