Welcome to CSIR NET Unit 2 — Complex Analysis, Algebra & Topology
Complex analysis, algebra and topology at the depth CSIR NET JRF demands — definitions with every hypothesis, theorems with proofs, live labs, and Part B / Part C problems with every option decided. Here is how the course works and how to use it, alone or in a classroom.
1. Who this course is for
This course covers Unit 2 of the CSIR NET JRF Mathematical Sciences syllabus — Complex Analysis, Algebra and Topology: complex numbers and analytic functions, contour integration and residues, conformal maps; counting and elementary number theory; groups, rings, fields and Galois theory; and point-set topology. It is written for two kinds of reader at once.
🎓 Students
MSc students and final-year BSc students preparing for CSIR NET JRF, GATE MA or a university MSc examination, studying on their own. You should know complex numbers, matrices and basic real analysis at BSc level; everything else is developed from definitions, with full proofs.
🧑🏫 Teachers
College and university teachers who want a rigorous classroom text: every section comes with a lesson plan, discussion questions, the misconceptions to watch for, a suggested homework set, and two interactive labs to project in class.
The course is not a summary or a crash course. Unit 2 is the most varied unit of the syllabus — an afternoon may move from residues to Sylow subgroups to compact spaces — and CSIR Part C questions reward exactly what a summary leaves out: the hypothesis that makes a theorem true, the counterexample that shows it cannot be dropped, the difference between "if" and "if and only if". So we state every definition precisely, prove every central theorem, and collect the standard counterexamples of each topic in a ⚠️ box.
2. Two ways to use the course
- Read with a pencil. Copy each definition and theorem into a notebook, then write one example and one non-example of your own before reading on.
- Prove before you read the proof. Give yourself five minutes with each theorem; then compare your attempt with the proof given and note the idea you missed.
- Cover the solutions. Attempt every worked example before opening "💡 Show solution"; if you are stuck, open one step at a time.
- Play with the labs — predict what will happen before you press Play.
- Exercises, then the Exam corner. Do at least the homework set suggested in the 🧑🏫 box. For every Part C problem, decide every option and write the reason or counterexample in one line — that is the skill the exam tests.
- Revisit after a week: take the five-question quiz again and redo two Exam-corner problems without notes.
Each section is planned for two or three lectures of about an hour. The 🧑🏫 For the teacher box at the end of the section says which theorems to prove on the board, which examples to work, when to project which lab, and which Exam-corner problems to do live. The labs work on a projector or a phone, need no installation and no internet once the page has loaded. The worked solutions are hidden by default, so a page can be projected while students attempt a problem. Exercises are solved in full; use them for tutorials, and the Exam corner for class tests.
3. What every section contains
- Motivation — why the idea matters and how it is examined.
- Teaching in coloured boxes: 📘 definitions, 📐 theorems stated with all their hypotheses and followed by a Proof, 🧭 problem-solving strategies, and a ⚠️ Counterexamples and pitfalls box listing the standard traps.
- ✏️ Worked examples (five to seven per section), mixing computations with "prove or disprove" problems, each with a full step-by-step solution.
- Two interactive labs that show the idea moving: roots of unity closing a polygon, partial sums of a power series on the boundary of their disc, a contour winding round a pole, a group acting on a square, open sets building a topology.
- Exercises — 25 to 40 parts from routine to research-flavoured, every one solved.
- 🎯 Exam corner — six original problems: E1–E3 in the style of CSIR Part B (one correct option) and E4–E6 in the style of Part C (one or more correct options), with every option decided.
- 🧑🏫 For the teacher, a 🔬 Research–Teaching Nexus mini-project, and a 🧪 five-question quiz.
Words with a dotted underline are in the Glossary — hover or tap for the meaning. Every key result is collected in the Formula Sheet, which you can search.
4. The CSIR NET examination in brief
The Joint CSIR–UGC NET in Mathematical Sciences is a single computer-based paper of multiple-choice questions in three parts:
- Part A — general aptitude: logical reasoning, graphical analysis, numerical ability and puzzles. Common to all subjects; not covered by this course.
- Part B — mathematics, each question with exactly one correct option. Questions test one idea quickly: a computation, a definition, a standard result.
- Part C — mathematics at greater depth, where one or more of the options may be correct and all the correct options must be chosen. A single overlooked counterexample costs the whole question, so Part C rewards precise knowledge of hypotheses.
In Parts B and C the questions are spread over the four units of the syllabus, and candidates answer a prescribed number of the questions offered. The number of questions, the marks per question, the duration and the negative-marking rules have changed over the years and differ between parts: always check the latest official notification for the exam session you are taking. Many of the problems in this course also fit GATE MA, and are tagged so.
Treat each option as a separate true/false question. For a "true" option, know the theorem that proves it — with its hypotheses. For a "false" option, have a specific counterexample ready: "$|\sin i|=\sinh1\gt1$", "$\mathbb{Z}[x]$ is a UFD but $(2,x)$ is not principal", "the cofinite topology on $\mathbb{R}$ is $T_1$ but not Hausdorff", "$A_4$ has no subgroup of order $6$". The ⚠️ boxes of each section are designed to be learned as such a list.
5. A first taste: one polygon, six chapters
Before any theory, here is how the very different chapters of this course talk to each other. The $n$ solutions of $z^n=1$ are the corners of a regular $n$-gon. Start at $1$ and repeatedly multiply by $\omega^k$, where $\omega=e^{2\pi i/n}$: you jump $k$ corners at a time. Sometimes you visit every corner; sometimes you return early.
Chapter 1 — complex numbers
The corners are $e^{2\pi ij/n}$ (De Moivre), and $\sum_j\omega^{jk}=0$ unless $n\mid k$: the path's points always balance at the centre.
Chapter 3 — residues
$\frac1{z^n-1}$ has a simple pole at each corner $\zeta$ with residue $\zeta/n$; the residues add up to $0$, so $\oint_{|z|=2}\frac{dz}{z^n-1}=0$ for $n\ge2$.
Chapter 5 — number theory
The number of generators is Euler's $\varphi(n)$; sorting all $n$ corners by their exact order gives $\sum_{d\mid n}\varphi(d)=n$.
Chapter 6 — groups
The corners form a cyclic group isomorphic to $\mathbb{Z}_n$; the path from $\omega^k$ is the subgroup it generates, of order $n/\gcd(k,n)$. Rotations and reflections of the polygon form the dihedral group $D_n$.
Chapter 7 — polynomials
The generators are the roots of the cyclotomic polynomial $\Phi_n(x)$, which has integer coefficients and is irreducible over $\mathbb{Q}$; $x^n-1=\prod_{d\mid n}\Phi_d(x)$.
Chapter 8 — Galois theory
$\mathbb{Q}(\omega)$ has degree $\varphi(n)$ over $\mathbb{Q}$ and Galois group $(\mathbb{Z}/n\mathbb{Z})^\times$: each automorphism sends $\omega$ to a generator. Since $\varphi(17)=16=2^4$, the regular $17$-gon is constructible (Gauss).
6. Map of the course
The nine chapters follow the official Unit 2 syllabus: Chapters 1–4 are complex analysis, Chapter 5 is combinatorics and number theory, Chapters 6–8 are abstract algebra, and Chapter 9 is topology. Each chapter page opens with a short overview, the outcomes, a teaser lab and the list of its sections. The algebra chapters can be studied before the complex analysis ones if your syllabus runs that way; each chapter's "✅ Before you start" box names what it needs.
Complex Numbers and Elementary Functions
The complex plane, roots of unity, polynomials; power series, $e^z$, $\sin z$, $\log z$ and complex powers.
Analytic Functions and Complex Integration
Cauchy–Riemann equations, contour integrals, Cauchy's theorem and integral formula, Liouville, maximum modulus, Schwarz lemma, open mapping.
Series and Residues
Taylor and Laurent series, singularities, the residue theorem, real integrals, the argument principle and Rouché's theorem.
Conformal Mappings
Conformal maps, Möbius transformations, cross-ratio, maps between discs and half-planes.
Combinatorics and Number Theory
Counting, pigeonhole, inclusion–exclusion, derangements; divisibility, congruences, CRT; Euler's $\varphi$ and primitive roots.
Groups
Subgroups, cyclic groups, Lagrange; normal subgroups and homomorphisms; permutation groups, actions, class equation; Sylow theorems.
Rings
Ideals and quotient rings, prime and maximal ideals, ED ⇒ PID ⇒ UFD, polynomial rings and irreducibility criteria.
Fields and Galois Theory
Field extensions, splitting fields, finite fields, the fundamental theorem of Galois theory.
Topology
Topologies and bases, subspace, product and quotient topologies, separation axioms, connectedness and compactness.
The other three units of the syllabus are covered by the sister courses CSIR NET Unit 1 — Analysis and Linear Algebra, CSIR NET Unit 3 — Differential Equations, Numerical Analysis, Calculus of Variations, Integral Equations and Classical Mechanics, and CSIR NET Unit 4 — Statistics, Probability and Operations Research. Unit 1 supplies the real analysis (sequences, series, uniform convergence, metric spaces) and the linear algebra used here.
7. Conventions
- $\mathbb{N}=\{1,2,3,\dots\}$ does not contain $0$. $\mathbb{Z},\mathbb{Q},\mathbb{R},\mathbb{C}$ are the integers, rationals, reals and complex numbers.
- For real $x\gt0$, $\log x$ (or $\ln x$) is the natural logarithm. For complex $z\ne0$, $\operatorname{Arg}z\in(-\pi,\pi]$ is the principal argument, $\operatorname{Log}z=\ln|z|+i\operatorname{Arg}z$ the principal logarithm, and $\log z$ the set of all logarithms; principal values of powers use $\operatorname{Log}$.
- "Iff" means "if and only if". A theorem stated with "if" claims one direction only — the converse is often false, and Part C knows it.
- Definitions and theorems are numbered by chapter (Definition 1.4, Theorem 1.12). Results in other sections are referred to by section number and name, e.g. "Liouville's theorem (§2.3)". Each chapter states at first use any further conventions it needs (for instance about identities in rings or the order in which permutations are composed).
- Proofs end with ∎. "Proof (sketch)" means every key step is named but routine details are left to the reader.
Where to begin. Start with Chapter 1 — Complex Numbers and Elementary Functions. It assumes only BSc-level complex numbers and real analysis, and it sets up the plane, the roots of unity and the power series that the rest of the complex-analysis chapters use constantly.