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

Representations of Abelian Groups

Research Depth 90 in the knowledge graph I know this Set as goal
474prerequisites beneath it
See this on the map →
Representations of Cyclic GroupsSchur's Lemma+1 more
abelian-group dual-group pontryagin-duality one-dimensional

Core Idea

Every irreducible complex representation of a finite abelian group is one-dimensional, a consequence of Schur's lemma (every group element commutes with the entire representation, hence acts as a scalar). Since every finite abelian group is a product of cyclic groups ℤ/n₁ℤ × ··· × ℤ/nₖℤ, its irreducible representations are products of irreducible representations of the cyclic factors — each specified by a tuple of roots of unity. The set of all irreducible representations forms the dual group Ĝ, which is (non-canonically) isomorphic to G itself.

Explainer

The representation theory of finite abelian groups is completely determined by a single fact: Schur's lemma forces all irreducible representations to be 1-dimensional. Here is why. If G is abelian, then for any representation ρ: G → GL(V), every ρ(g) commutes with every ρ(h). So every ρ(g) is a G-equivariant endomorphism of V. By Schur's lemma (over ℂ), if V is irreducible, each ρ(g) must be a scalar λ_g · I. But then every subspace of V is invariant, so irreducibility forces dim(V) = 1.

Since every irreducible representation is a homomorphism χ: G → ℂ*, the set of irreducible representations forms a group under pointwise multiplication: (χ₁ · χ₂)(g) = χ₁(g) · χ₂(g). This group is the dual group (or character group) Ĝ = Hom(G, ℂ*). For G = ℤ/n₁ℤ × ··· × ℤ/nₖℤ, the fundamental theorem of finite abelian groups gives Ĝ ≅ ℤ/n₁ℤ × ··· × ℤ/nₖℤ ≅ G. The isomorphism Ĝ ≅ G is non-canonical (it depends on choices of generators), but the double dual Ĝ̂ ≅ G has a canonical isomorphism g ↦ (χ ↦ χ(g)). This is the finite-group version of Pontryagin duality.

The Fourier analysis on a finite abelian group decomposes functions f: G → ℂ into irreducible components. Every function can be written as f = Σ_{χ∈Ĝ} f̂(χ)·χ, where f̂(χ) = (1/|G|) Σ_{g∈G} f(g)·conjugate(χ(g)) are the Fourier coefficients. The Plancherel formula Σ_{g∈G} |f(g)|² = |G| Σ_{χ∈Ĝ} |f̂(χ)|² is a consequence of the orthogonality relations. For G = ℤ/nℤ, this is the classical discrete Fourier transform. For general abelian groups, the Fourier transform factors according to the product decomposition of G, recovering the multidimensional FFT.

The representation ring R(G) of a finite abelian group is particularly simple: it is isomorphic to the group ring ℤ[Ĝ] ≅ ℤ[x₁, …, xₖ]/(x₁^{n₁} − 1, …, xₖ^{nₖ} − 1). The tensor product of representations corresponds to multiplication of characters in Ĝ, and direct sum corresponds to addition. This ring structure encodes all the decomposition rules for representations of G and connects naturally to algebraic number theory through the cyclotomic fields generated by the roots of unity involved.

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 IrreducibilityMaschke's TheoremCharacter TheoryRepresentations of Abelian Groups

Longest path: 91 steps · 474 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.