Schur's Lemma states that any homomorphism between two irreducible representations of a group is either the zero map or an isomorphism, and that any endomorphism of an irreducible representation over an algebraically closed field is a scalar multiple of the identity. Named for Issai Schur, it is a foundational result of representation theory underlying the classification of irreducible representations.
Facts
StatementIn representation theory, Schur's Lemma states that a homomorphism between two finite-dimensional irreducible representations of a group is either invertible or the zero map, and that a linear map commuting with an irreducible representation over an algebraically closed field must be a scalar multiple of the identity. 1 Classification
Statement Form Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Sources
1. Schur's Lemma (Representation Theory) (Wikipedia)
Wikimedia FoundationLead section, closing sentenceQuote, Lead section, closing sentence
Schur's lemma admits generalisations to Lie groups and Lie algebras, the most common of which are due to Jacques Dixmier and Daniel Quillen.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.