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 EigenvectorsCharacter 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewVectors in Two DimensionsVector Operations: Addition, Subtraction, and Scalar MultiplicationDot Product (Inner Product in R^n)Matrix MultiplicationDeterminants of 2×2 and 3×3 MatricesInvertible Matrices and Matrix InversesSystems of Linear Equations and Matrix FormGaussian Elimination and Row ReductionRow Echelon Form and Back SubstitutionThe Standard Matrix of a Linear TransformationEigenvalues and EigenvectorsMatrix RepresentationsEquivalence of RepresentationsReducibility and IrreducibilitySchur's Lemma

Longest path: 89 steps · 454 total prerequisite topics

Prerequisites (2)

Leads To (3)