A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Schur's Lemma

Research Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
14topics build on this
454prerequisites beneath it
See this on the map →
Reducibility and IrreducibilityEigenvalues and Eigenvectors→→Character TheoryRepresentations of Abelian Groups+1 more
schur intertwining-operator irreducible

Core Idea

Schur's lemma states that any intertwining operator between irreducible representations is either zero or an isomorphism. Over an algebraically closed field, any self-intertwining operator of an irreducible representation is a scalar multiple of the identity. This seemingly simple result has enormous consequences: it constrains the structure of Hom_G spaces, underpins the orthogonality relations for characters, and is the single most-used tool in representation theory.

Explainer

Schur's lemma is the workhorse of representation theory. It comes in two parts. Part 1: If ρ: G → GL(V) and σ: G → GL(W) are irreducible representations and T: V → W is a G-equivariant linear map (meaning Tρ(g) = σ(g)T for all g), then T is either the zero map or an isomorphism. Part 2 (over an algebraically closed field like ℂ): If T: V → V is a G-equivariant endomorphism of an irreducible representation, then T = λI for some scalar λ.

The proof of Part 1 is elegant and short. The key observation is that ker(T) ⊆ V and im(T) ⊆ W are both G-invariant subspaces. For the kernel: if v ∈ ker(T), then T(ρ(g)v) = σ(g)(Tv) = σ(g)(0) = 0, so ρ(g)v ∈ ker(T). Similarly, the image is invariant. Since V is irreducible, ker(T) is either {0} or V; since W is irreducible, im(T) is either {0} or W. If T ≠ 0, the kernel must be {0} (T is injective) and the image must be W (T is surjective), so T is an isomorphism. There is no room for anything in between.

Part 2 uses algebraic closure. Over ℂ, the operator T: V → V has at least one eigenvalue λ. The map T − λI is still G-equivariant (since λI commutes with everything), and it has a nontrivial kernel (the λ-eigenspace). By Part 1, T − λI must be zero, so T = λI. Over ℝ, this argument fails because real operators need not have real eigenvalues — for instance, a 90° rotation has eigenvalues ±i.

The consequences are far-reaching. For abelian groups over ℂ, every ρ(g) commutes with the entire representation and is therefore scalar by Part 2. This forces all irreducible representations to be one-dimensional — a complete classification in one stroke. For non-abelian groups, Schur's lemma constrains the algebra of intertwining operators (the endomorphism ring of an irreducible is a division algebra), and this constraint underpins the orthogonality relations that make character theory work. Nearly every structural result in finite-group representation theory traces back to Schur's lemma.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Vectors in Two Dimensions → Vector Operations: Addition, Subtraction, and Scalar Multiplication → Dot Product (Inner Product in R^n) → Matrix Multiplication → Determinants of 2×2 and 3×3 Matrices → Invertible Matrices and Matrix Inverses → Systems of Linear Equations and Matrix Form → Gaussian Elimination and Row Reduction → Row Echelon Form and Back Substitution → The Standard Matrix of a Linear Transformation → Eigenvalues and Eigenvectors → Matrix Representations → Equivalence of Representations → Reducibility and Irreducibility → Schur's Lemma

Longest path: 89 steps · 454 total prerequisite topics

Prerequisites (2)

Leads To (3)