Skip to content

MATH3030

Abstract Algebra

Groups and group actions, Sylow theory, solvable and simple groups, finite abelian groups, rings and ideals, polynomials and unique factorization, with proofs and solved exercises.

13 chapters · 23 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 23 sections marked complete

Next section: Groups, quotients, and structure maps

Completion marks are saved in this browser.

This course in the web

In the MATH3030 notes

Theorem cards
67
Definitions
35
Counterexamples
25
Concept lenses
16
Histories of ideas
1
Proof X-rays
26

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 23 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 67 · Definitions 35 · Counterexamples 25 · Concept lenses 16 · Histories of ideas 1 · Proof X-rays 26

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 23 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 · 6 sections

Groups, quotients, and structure maps

Develop cosets, normality, quotient groups, and isomorphism theorems with explicit well-definedness proofs.

Theorems 20 · Definitions 13Counterexamples 6Lenses 4Proof X-rays 6

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

  1. 1.1

    Groups, quotients, and structure maps

    Develop cosets, normality, quotient groups, and isomorphism theorems with explicit well-definedness proofs.

  2. 1.2

    Internal direct products of groups

    Prove when subgroup multiplication gives a direct-product isomorphism.

  3. 1.3

    Groups: Axioms, First Consequences, and Concrete Calculations

    Binary operations, the group axioms, uniqueness and cancellation, subgroup criteria, permutation groups, symmetries of the square, and the unit groups U(n), with worked calculations and solved exercises.

  4. 1.4

    Homomorphisms of finite cyclic groups

    Use generators and element orders to classify maps, kernels and automorphisms of cyclic groups.

  5. 1.5

    Subgroups and quotients of a dihedral group

    Classify dihedral subgroups and use the eight-element example to practice normality and quotients.

  6. 1.6

    Direct products and independent coordinates

    Construct product groups, recognize internal products, and distinguish independent factors from subgroups with linked coordinates.

Chapter 2 · 3 sections

Group actions, counting, and Sylow theory

Use actions to prove orbit–stabilizer, Cauchy's theorem, and the Sylow theorems, then constrain finite-group structure.

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

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

  1. 2.1

    Group actions, counting, and Sylow theory

    Use actions to prove orbit–stabilizer, Cauchy's theorem, and the Sylow theorems, then constrain finite-group structure.

  2. 2.2

    Groups of order pq: normal subgroups and explicit products

    Apply Sylow theory to groups of order pq and construct an explicit noncommutative example.

  3. 2.3

    Transitive actions and equivariant maps

    Classify transitive actions by stabilizers and compute their equivariant maps and automorphisms.

Chapter 3 · 3 sections

Rings, ideals, and Chinese remainders

Explain why ideals define ring quotients, characterize prime and maximal ideals, and prove the Chinese remainder theorem.

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

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

  1. 3.1

    Rings, ideals, and Chinese remainders

    Explain why ideals define ring quotients, characterize prime and maximal ideals, and prove the Chinese remainder theorem.

  2. 3.2

    Compatible congruences in a ring

    Characterize the image of the Chinese remainder map for arbitrary ideals, reconstruct compatible residues, and explain the obstruction for three ideals.

  3. 3.3

    Arithmetic and structure in residue rings

    Solve linear congruences and classify units, nilpotents and idempotents in integer residue rings.

Chapter 4 · 2 sections

Polynomial arithmetic and irreducibility

Prove division, Bézout, unique factorization over a field, Gauss's lemma, reduction tests, and Eisenstein's criterion.

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

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

  1. 4.1

    Polynomial arithmetic and irreducibility

    Prove division, Bézout, unique factorization over a field, Gauss's lemma, reduction tests, and Eisenstein's criterion.

  2. 4.2

    Finite subgroups of field units

    Prove cyclicity from element orders and the polynomial root bound, then solve power equations with exact existence and counting conditions.

Chapter 5 · 1 section

5. Euclidean domains, principal ideals, and unique factorization

Prove the Euclidean–PID–UFD implications, distinguish prime from irreducible, and test the hypotheses in Gaussian and quadratic integer rings.

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

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

  1. 5.1

    Euclidean domains, principal ideals, and unique factorization

    Prove the Euclidean–PID–UFD implications, distinguish prime from irreducible, and test the hypotheses in Gaussian and quadratic integer rings.

Chapter 6 · 1 section

6. Derived series, solvable groups, and the obstruction in A5

Prove solvability passes through subgroups and extensions, compute the derived series of S3 and S4, and prove A5 is simple by conjugacy-class counting.

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

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

  1. 6.1

    Derived series, solvable groups, and the obstruction in A5

    Prove solvability passes through subgroups and extensions, compute the derived series of S3 and S4, and prove A5 is simple by conjugacy-class counting.

Chapter 7 · 1 section

Finite abelian groups

Finite abelian groups

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

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

  1. 7.1

    Finite abelian groups and intrinsic invariants

    Deduce finite abelian classification from Smith form, prove uniqueness through primary filtrations, and recover generators and exponents from the cyclic factors.

Chapter 8 · 1 section

Fraction fields and factorization

Fraction fields and factorization

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

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

  1. 8.1

    Fraction fields, content, and polynomial unique factorization

    Construct the fraction field, prove Gauss's primitive-product and descent lemmas, and establish that a polynomial ring over a UFD is a UFD.

Chapter 9 · 1 section

Composition series

Composition series

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

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

  1. 9.1

    Composition series and the Jordan–Hölder theorem

    Prove finite-group factor uniqueness by the maximal-normal-subgroup diamond, refine subnormal series, and relate composition factors to extensions and solvability.

Chapter 10 · 1 section

Semidirect products

Semidirect products

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

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

  1. 10.1

    Semidirect products and groups of order pq

    Prove the external and internal semidirect-product constructions, characterize split group extensions, and classify groups of order two distinct primes.

Chapter 11 · 1 section

Permutation cycle types

Permutation cycle types

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

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

  1. 11.1

    Cycle types, centralizers, and alternating classes

    Prove permutation cycle classification, count centralizers without guessing, and characterize exactly when an even symmetric-group class splits in the alternating group.

Chapter 12 · 1 section

Simple alternating groups

Simple alternating groups

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

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

  1. 12.1

    Simple alternating groups and symmetric normal structure

    Prove A_n is nonabelian simple for n at least five by small-support commutators, then determine symmetric normal subgroups, abelianization and minimum subgroup index.

Chapter 13 · 1 section

Finitely generated abelian groups

Finitely generated abelian groups

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

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

  1. 13.1

    Finitely generated abelian groups

    Separate free rank from torsion and compute invariant factors from integer relations.

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