Skip to content

Algebra

CSIR NET Mathematical Sciences Unit 2 algebra: combinatorics, number theory, groups and Sylow, rings and ideals, polynomials, fields and Galois theory.

6
Topics
109
Min read

Chapter Overview

Algebra is part of Unit 2 of the CSIR NET Mathematical Sciences syllabus, the unit meant for candidates taking the mathematics route (Units 1 to 3), alongside complex analysis and topology. The official heading is wider than “abstract algebra”: it starts with combinatorics and elementary number theory and then builds groups, rings and fields on top of them. The two halves are closely linked. \( \varphi(n) \) counts the generators of a cyclic group, primitive roots are generators of \( U(n) \), and the Chinese remainder theorem is a ring isomorphism.

The notes assume an MSc first course in algebra (Gallian’s Contemporary Abstract Algebra, Dummit and Foote’s Abstract Algebra, Herstein’s Topics in Algebra) and a first course in number theory (Niven, Zuckerman and Montgomery, or Burton). They do not re-teach those courses. They collect the exact statements, the counting formulas and the standard examples that decide Part B and Part C questions.

What You’ll Learn

By the end of this chapter you will be able to:

  • Count arrangements, distributions, surjections and derangements, and prove existence statements with pigeonhole
  • Solve linear congruences and CRT systems, compute large powers mod \( n \), find \( \varphi(n) \) and decide when primitive roots exist
  • Work with subgroups, cyclic groups, permutations, normal subgroups, quotients and homomorphisms, and count homomorphisms and elements of a given order
  • Use the class equation and the Sylow theorems to decide whether every group of a given order is abelian, cyclic or simple, and count abelian groups
  • Classify ideals as prime or maximal through their quotients, place a ring in the ED–PID–UFD hierarchy, and test polynomials for irreducibility
  • Compute degrees of extensions, count subfields and generators of finite fields, and use the Galois correspondence to list intermediate fields

Prerequisites

  • Basic set theory, functions and equivalence relations
  • Linear algebra up to dimension and bases (field extensions are vector spaces)
  • Comfort with proofs by contradiction and induction

Learning Path

graph TD
    A[1. Combinatorics: Counting, Pigeonhole, Derangements] --> B[2. Number Theory: Congruences, CRT, Primitive Roots]
    B --> C[3. Groups, Subgroups and Homomorphisms]
    A --> C
    C --> D[4. Group Actions, Class Equation and Sylow]
    B --> E[5. Rings, Ideals and Polynomial Rings]
    C --> E
    E --> F[6. Fields, Extensions and Galois Theory]
    D --> F
    F --> G[Quick Revision]

Topics in This Chapter

TopicWhat it coversTime
Combinatorics: Counting, Pigeonhole and DerangementsPermutations, combinations, stars and bars, Stirling and Catalan numbers, pigeonhole, inclusion-exclusion, derangements30 min
Number Theory: Congruences, CRT and Primitive RootsDivisibility, Bézout, linear congruences, CRT, Fermat–Euler–Wilson, Euler’s \( \varphi \), orders and primitive roots30 min
Groups, Subgroups and HomomorphismsSubgroups and Lagrange, cyclic groups, permutation groups, normal subgroups, quotients, isomorphism theorems, automorphisms, Cayley’s theorem35 min
Group Actions, Class Equation and Sylow TheoremsOrbit-stabiliser, Burnside, conjugacy classes, class equation, \( p \)-groups, Cauchy, Sylow, finite abelian groups, small groups35 min
Rings, Ideals and Polynomial RingsUnits, nilpotents, ideals, quotient rings, prime and maximal ideals, ED–PID–UFD, polynomial rings, irreducibility tests35 min
Fields, Extensions and Galois TheoryDegree and tower law, minimal polynomials, splitting fields, finite fields, separability and normality, Galois correspondence35 min
Quick RevisionEvery formula, count and counter-example on one page10 min

Official syllabus lines and where they are covered

The JSON entry for this chapter lists six official topic lines. Each is covered in full on the page shown.

Official syllabus lineCovered in
Permutations, combinations, pigeon-hole, inclusion-exclusion, derangementsCombinatorics
Divisibility, congruences, CRT, Euler phi, primitive rootsNumber Theory
Groups: subgroups, normal subgroups, quotients, homomorphisms, cyclic and permutation groups, Cayley, class equation, SylowGroups, Subgroups and Homomorphisms (subgroups to Cayley) and Group Actions, Class Equation and Sylow Theorems (class equation, Sylow)
Rings, ideals, quotient rings, UFD, PID, Euclidean domainsRings, Ideals and Polynomial Rings (first half)
Polynomial rings, irreducibilityRings, Ideals and Polynomial Rings (second half)
Fields, finite fields, extensions, Galois theoryFields, Extensions and Galois Theory

The group-theory line is long, so it is split across two pages: the structural ideas (subgroups to Cayley) on one, the counting theorems (class equation, Sylow) on the next.


How CSIR NET Asks It

Per the NTA information bulletin for December 2026, the Mathematical Sciences paper (code 704) is marked as follows:

Part BPart C
Questions given4060
Questions to attempt2520
Marks per correct answer34.75
Marks per wrong answer−0.750
Maximum7595

NTA publishes no topic-wise weightage, so we make no claim about how many questions come from this chapter. The question formats tell you how to prepare:

  • Part B (single correct) rewards counting formulas applied without error: \( \varphi(n) \), the number of primitive roots, homomorphisms \( \mathbb{Z}_m \to \mathbb{Z}_n \), elements of order 2 in \( S_n \), abelian groups of order \( n \), nilpotents in \( \mathbb{Z}_n \), subfields of \( \mathbb{F}_{p^n} \), the degree of a splitting field.
  • Part C (one or more correct) gives a structure (a group of order 56, the ring \( \mathbb{Z}[x] \), the field \( \mathbb{Q}(\zeta_7) \)) and four statements. Each is a theorem or is broken by a standard example: \( A_4 \), \( Q_8 \), \( \mathbb{Z}[\sqrt{-5}] \), \( x^4 + 1 \), \( \mathbb{Q}(\sqrt[3]{2}) \). Every topic page ends with Level 3 practice in exactly this format, with every option justified.

For the marking scheme and the other units, see the Mathematical Sciences overview. Unit 1, which every candidate answers, starts with Real Analysis. Part A (General Aptitude) is common to all subjects; its Numerical Ability chapter reuses the counting and remainder techniques of the first two pages. Found an error? See About for how to report it.


Start Learning

Begin with the first topic:

→ Combinatorics: Counting, Pigeonhole and Derangements

Advertisement
Advertisement