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

Reducibility and Irreducibility

Research Depth 87 in the knowledge graph ☐ I know this ☆ Set as goal
19topics build on this
453prerequisites beneath it
See this on the map →
Equivalence of RepresentationsGroup Representations→→Maschke's TheoremRepresentations of Cyclic Groups+3 more
irreducible-representation subrepresentation invariant-subspace complete-reducibility

Core Idea

A subrepresentation of ρ: G → GL(V) is a subspace W ⊆ V that is invariant under every ρ(g). A representation is irreducible if its only invariant subspaces are {0} and V itself — it cannot be broken into smaller pieces. Irreducible representations are the atoms of representation theory: under favorable conditions (characteristic zero, finite groups), every representation decomposes as a direct sum of irreducibles.

Explainer

The idea of breaking a representation into simpler pieces is the heart of the subject. Given a representation ρ: G → GL(V), a subrepresentation (or invariant subspace) is a subspace W ⊆ V such that ρ(g)(W) ⊆ W for every g ∈ G — the action of G keeps W within itself. In matrix terms, if we choose a basis where the first k vectors span W, every ρ(g) takes block upper-triangular form with a k×k block in the top-left corner. That block defines a representation of G on W.

A representation is irreducible (or simple) if its only invariant subspaces are {0} and V. This means there is no way to decompose the action into smaller independent pieces. For a one-dimensional representation, this is automatic. For higher dimensions, irreducibility is a strong condition: it says the group action thoroughly "mixes" the space, so that no proper subspace is left alone by all group elements simultaneously.

When a representation is reducible (has a proper invariant subspace W), the natural question is whether V decomposes as a direct sum V = W ⊕ U where U is also invariant. If so, the representation splits into two independent pieces. A representation is completely reducible (or semisimple) if it decomposes as a direct sum of irreducible subrepresentations. This is not automatic — the example of [[1,1],[0,1]] for ℤ/2ℤ over a field of characteristic 2 shows a reducible representation with no invariant complement.

The remarkable fact, which you will see formalized as Maschke's theorem, is that for finite groups over fields of characteristic zero (or more generally, characteristic not dividing |G|), complete reducibility is guaranteed. This means the study of all representations reduces to the study of irreducible ones plus the combinatorics of how they assemble via direct sums. Irreducible representations are thus the atoms from which the entire representation theory of a group is built — finding and classifying them is the central problem.

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

Longest path: 88 steps · 453 total prerequisite topics

Prerequisites (2)

Leads To (5)