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 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 → Maschke's Theorem → Character Theory → Representations of Abelian Groups

Longest path: 91 steps · 474 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.