Skip to content

MATH4080

Modules and Representation Theory

Modules, exact sequences and tensor products, modules over a PID, Noetherian conditions, characters of finite groups, induced representations and semisimple algebras.

14 chapters · 21 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 21 sections marked complete

Next section: 1. Modules, quotients, and homomorphisms

Completion marks are saved in this browser.

This course in the web

In the MATH4080 notes

Theorem cards
60
Definitions
37
Counterexamples
24
Concept lenses
9
Histories of ideas
1
Proof X-rays
27

Sections with a history of an idea

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 21 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 60 · Definitions 37 · Counterexamples 24 · Concept lenses 9 · Histories of ideas 1 · Proof X-rays 27

None of these is on the timeline yet.

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 21 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 5 sections

1. Modules, quotients, and homomorphisms

Understand modules as compatible scalar actions, construct quotient modules, and prove the first isomorphism theorem without assuming a basis.

Theorems 16 · Definitions 8Counterexamples 6Proof X-rays 9

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1

    1. Modules, quotients, and homomorphisms

    Understand modules as compatible scalar actions, construct quotient modules, and prove the first isomorphism theorem without assuming a basis.

  2. 1.2

    Noetherian modules and finite relations

    Explain when finite generators force finite relations, prove the Hilbert basis theorem, and distinguish Noetherian modules from free or semisimple modules.

  3. 1.3

    Composition series, finite length, and the Jordan–Hölder theorem

    Build finite modules from simple quotients, prove independence of their multiplicities, and distinguish composition factors from direct summands.

  4. 1.4

    Nakayama's lemma and minimal generators

    Use finite generation and the Jacobson radical to lift generators from a residue field and prove that finite projective modules over local rings are free.

  5. 1.5

    Chinese remainders and primary decomposition of modules

    Construct module remainders and polynomial projections, then use them to separate invariant pieces of an operator.

Chapter 2 · 1 section

2. Free modules, exact sequences, and splitting

Describe modules by generators and relations, prove the splitting criterion for short exact sequences, and see why linear algebra's complement argument can fail.

Theorems 3 · Definitions 4Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2

    2. Free modules, exact sequences, and splitting

    Describe modules by generators and relations, prove the splitting criterion for short exact sequences, and see why linear algebra's complement argument can fail.

Chapter 3 · 2 sections

3. Smith form and finitely generated modules over a PID

Derive module decompositions from relation matrices, justify Smith reduction, and distinguish invariant factors, elementary divisors, and operator canonical forms.

Theorems 9 · Definitions 4Counterexamples 3Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3

    3. Smith form and finitely generated modules over a PID

    Derive module decompositions from relation matrices, justify Smith reduction, and distinguish invariant factors, elementary divisors, and operator canonical forms.

  2. 3.2

    Linear Operators as F[t]-Modules: Rational Canonical Form and Jordan Form

    How a linear operator on a finite-dimensional vector space becomes a finitely generated torsion module over F[t], and how the structure theorem for modules over a PID yields the rational canonical form, the Jordan form, and the kernel-dimension formula for counting Jordan blocks.

Chapter 4 · 2 sections

4. Finite group representations, Maschke's theorem, and Schur's lemma

Translate group actions into modules, construct invariant complements by averaging, and track the field hypotheses behind irreducibility and scalar endomorphisms.

Theorems 5 · Definitions 7Counterexamples 2Lenses 2Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 4

    4. Finite group representations, Maschke's theorem, and Schur's lemma

    Translate group actions into modules, construct invariant complements by averaging, and track the field hypotheses behind irreducibility and scalar endomorphisms.

  2. 4.2

    Dual actions, tensor representations, and invariant pairings

    Derive the inverse-transpose action, identify equivariant maps with invariant tensors, and use bilinear forms to understand self-duality without assuming semisimplicity.

Chapter 5 · 1 section

5. Characters, orthogonality, and decomposition

Derive character orthogonality by averaging on a Hom space, compute the character table of S3, and use characters to decompose tensor and permutation representations.

Theorems 2 · Definitions 1Counterexamples 1History 1Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 5

    5. Characters, orthogonality, and decomposition

    Derive character orthogonality by averaging on a Hom space, compute the character table of S3, and use characters to decompose tensor and permutation representations.

Chapter 6 · 1 section

6. Tensor products, Hom, and exactness

Construct tensor products by a universal property, prove the tensor–Hom correspondence and right exactness, and locate failures of left or right exactness with integer modules.

Theorems 3 · Definitions 3Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 6

    6. Tensor products, Hom, and exactness

    Construct tensor products by a universal property, prove the tensor–Hom correspondence and right exactness, and locate failures of left or right exactness with integer modules.

Chapter 7 · 1 section

7. Induction, coset characters, and Frobenius reciprocity

Construct induction with explicit sided tensor relations, prove its Hom adjunction and character formula, and compute induced S3 and cyclic characters.

Theorems 3 · Definitions 1Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 7

    7. Induction, coset characters, and Frobenius reciprocity

    Construct induction with explicit sided tensor relations, prove its Hom adjunction and character formula, and compute induced S3 and cyclic characters.

Chapter 8 · 1 section

8. Noetherian conditions

Finite generation, exact sequences and polynomial rings.

Theorems 3 · Definitions 1Counterexamples 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 8.1

    Noetherian modules and polynomial rings

    Connect finite generation to ascending chains and prove the Hilbert basis theorem.

Chapter 9 · 2 sections

9. Extensions and splitting

Classify extensions with a finite cyclic quotient.

Theorems 4 · Definitions 3Counterexamples 2Lenses 1Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 9.1

    Cyclic quotients and the obstruction to splitting

    Classify extensions of a finite cyclic group by a fixed abelian group using a lift.

  2. 9.2

    Module extensions, first Ext, and injective modules

    Classify short exact module extensions from a free presentation, prove the Baer-sum group law and projective/injective criteria, and compute concrete abelian-group examples.

Chapter 10 · 1 section

10. Primary decomposition

Use coprime annihilators to split modules.

Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 10.1

    Primary decomposition from the Chinese remainder theorem

    Split modules annihilated by coprime factors and examine the hypotheses.

Chapter 11 · 1 section

11. Stable decomposition

Separate nilpotent and invertible operator parts.

Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 11.1

    Stable kernels and the Fitting decomposition

    Use stabilized powers to split a finite-dimensional operator.

Chapter 12 · 1 section

Krull-Schmidt decomposition

Uniqueness of indecomposable decompositions.

Theorems 2 · Definitions 1Counterexamples 2Lenses 1Proof X-rays 2

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 12.1

    Krull–Schmidt and local endomorphism rings

    Prove existence and uniqueness of indecomposable decompositions using Fitting's lemma, a local endomorphism ring, and an explicit exchange argument.

Chapter 13 · 1 section

Semisimple algebras

Artin-Wedderburn theory and group algebras.

Theorems 4 · Definitions 1Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 13.1

    Semisimple algebras and matrix blocks

    Prove Artin–Wedderburn through endomorphisms of the regular module, explain opposite division rings, and compute real, complex and modular group-algebra examples.

Chapter 14 · 1 section

Mackey theory

Double cosets and irreducibility of induced representations.

Theorems 2 · Definitions 1Counterexamples 1Lenses 1Proof X-rays 1

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 14.1

    Double cosets, Mackey decomposition, and induced irreducibility

    Decompose restricted induction by subgroup orbits, prove Mackey's formula over any field, and derive the complex irreducibility criterion with explicit examples.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details