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

Representations of Cyclic Groups

Research Depth 88 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
469prerequisites beneath it
See this on the map →
Group RepresentationsReducibility and Irreducibility+1 more→→Representations of Abelian Groups
cyclic-group roots-of-unity one-dimensional classification

Core Idea

Every irreducible complex representation of a cyclic group ℤ/nℤ is one-dimensional, given by sending a generator g to an nth root of unity ζ = e2πik/n for k = 0, 1, …, n−1. This gives exactly n irreducible representations, matching the n conjugacy classes (each element is its own conjugacy class since the group is abelian). The character table is the DFT matrix (1/√n)(ζʲᵏ), and the representation theory of cyclic groups is equivalent to the discrete Fourier transform — a fact that connects algebra to signal processing.

Explainer

The cyclic group ℤ/nℤ = ⟨g | gⁿ = e⟩ has the simplest representation theory of any group family. Since the group is abelian, Schur's lemma implies that every irreducible complex representation is one-dimensional. A 1-dimensional representation is just a group homomorphism ρ: ℤ/nℤ → ℂ*, which is determined by ρ(g) since g generates the group. The constraint ρ(g)ⁿ = ρ(gⁿ) = ρ(e) = 1 means ρ(g) must be an nth root of unity. There are exactly n choices: ρ_k(g) = e2πik/n for k = 0, 1, …, n−1. These n representations are pairwise non-isomorphic and exhaust all irreducibles.

The character table of ℤ/nℤ is the n×n matrix with entry (j,k) equal to ω^{jk}, where ω = e2πi/n. This is exactly the discrete Fourier transform (DFT) matrix. The orthogonality relations for characters — Σ_{g∈G} χᵢ(g)·conjugate(χⱼ(g)) = |G|·δᵢⱼ — become the statement that the DFT matrix (scaled by 1/√n) is unitary. This is not a coincidence: the DFT decomposes functions on ℤ/nℤ into irreducible components, and the Fourier inversion formula is the character orthogonality relation. Representation theory of cyclic groups is Fourier analysis on finite cyclic groups.

Over the real numbers, the picture changes. The representations ρ_k and ρ_{n−k} are complex conjugates, and when k ≠ 0, n/2, they cannot be individually realized over ℝ. Instead, they combine into a 2-dimensional real irreducible representation where g acts as the rotation matrix [[cos(2πk/n), −sin(2πk/n)], [sin(2πk/n), cos(2πk/n)]]. So the real irreducible representations of ℤ/nℤ consist of some 1-dimensional ones (corresponding to real roots of unity: ±1 when they exist) and some 2-dimensional ones (corresponding to conjugate pairs of complex roots).

The group algebra ℂ[ℤ/nℤ] ≅ ℂ[x]/(xⁿ − 1) ≅ ℂ ⊕ ℂ ⊕ ··· ⊕ ℂ (n copies), where the isomorphism uses the Chinese Remainder Theorem and the factorization xⁿ − 1 = ∏(x − ω^k). Each factor ℂ corresponds to one irreducible representation. This is the simplest instance of the Artin-Wedderburn decomposition. For cyclic groups, the representation ring R(ℤ/nℤ) ≅ ℤ[x]/(xⁿ − 1), with the tensor product of representations corresponding to multiplication of characters (pointwise product of roots of unity).

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 → Representations of Cyclic Groups

Longest path: 89 steps · 469 total prerequisite topics

Prerequisites (3)

Leads To (1)