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 RepresentationsMaschke'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 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 Irreducibility

Longest path: 88 steps · 453 total prerequisite topics

Prerequisites (2)

Leads To (5)