Start here

Welcome to GATE Mathematics (MA) — Complete Course

The whole GATE Mathematics (MA) syllabus in twelve chapters — every result GATE uses stated with its hypotheses, worked GATE-style examples, live labs, and MCQ, MSQ and NAT practice 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 the complete syllabus of the GATE Mathematics (MA) paper: calculus of several variables and vector calculus, linear algebra, real analysis, complex analysis, ordinary differential equations, algebra, functional analysis, numerical analysis, partial differential equations, topology and linear programming. It is written for two kinds of reader at once.

🎓 Students

Final-year BSc and MSc students preparing for GATE MA — and IIT JAM or CSIR NET aspirants revising the same topics — studying on their own. You should know BSc calculus, matrices and some analysis and differential equations; each section rebuilds what it needs.

🧑‍🏫 Teachers

Teachers running a GATE batch or a university course on the same material: every section has a lesson plan, discussion questions, the misconceptions to watch for, a homework set, and two interactive labs to project in class.

GATE rewards something specific: fast, accurate use of standard results on well-posed problems, and sharp judgement about which of several statements are true. So every section states each result GATE uses precisely — with all its hypotheses, because the false options of a multiple-select question are built from dropped hypotheses — drills the standard computations until they take a minute, and collects in a ⚠️ box the counterexamples that decide "true or false" options.

2. Two ways to use the course

🧭 The self-study path
  1. Read with a pencil. Copy each definition and theorem, with its hypotheses, into a notebook; next to it write one example and one non-example of your own.
  2. Cover the solutions. Attempt every worked example before opening "💡 Show solution"; if you are stuck, open it and read one step at a time.
  3. Play with the labs — predict what will happen before you press Play.
  4. Exercises, then the GATE corner. Do at least the homework set in the 🧑‍🏫 box. Then do the six GATE-corner problems under time: about two minutes for an MCQ, three for an MSQ or NAT.
  5. For every MSQ, decide every option and write a one-line reason or counterexample for each — that is the skill the exam rewards.
  6. Revisit after a week: retake the five-question quiz and redo two GATE-corner problems without notes.
🧑‍🏫 The classroom path

Each section is planned for two or three lectures of about an hour. The 🧑‍🏫 For the teacher box says which results to prove on the board, which examples to work, when to project which lab and which GATE-corner problems to do live. The labs run on a projector or a phone with no installation and no internet once the page has loaded, and solutions are hidden by default, so a page can be projected while students attempt a problem. The exercises are solved in full — use them for tutorials — and the GATE corner for timed class tests.

3. What every section contains

  1. Motivation — why the idea matters and how GATE examines it.
  2. Teaching in coloured boxes: 📘 definitions, 📐 theorems stated with all their hypotheses and followed by a Proof or proof idea, 🧭 problem-solving strategies, and a ⚠️ Counterexamples and pitfalls box.
  3. ✏️ Worked examples (five to seven), mixing computations with "prove or disprove" questions, each with a step-by-step solution.
  4. 📚 Go deeper — sections marked as focused cover topics that our CSIR NET courses develop at full length. These GATE sections are complete in themselves, but give the long proofs only in outline, and a 📚 box links to the CSIR NET sections where every proof is written out. Sections on topics the CSIR courses do not cover (multiple integrals, vector calculus, the Laplace transform, stability, functional analysis, transportation problems…) carry their full proofs here.
  5. Two interactive labs that show the idea moving: a contour map with gradients, a constraint curve with its Lagrange points, flux through a surface, a contraction pulling points to a fixed point, Newton's method converging, the simplex method walking round a polygon.
  6. Exercises — 25 to 40 parts from routine to challenging, including modelling problems, every one solved.
  7. 🎯 GATE corner — six original problems in the GATE MA format: E1–E2 MCQ, E3–E4 MSQ, E5–E6 NAT, with every option decided and the accepted range of every numerical answer.
  8. 🧑‍🏫 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. Key results are collected in the searchable Formula Sheet.

4. The GATE MA paper in brief

📘 The paper

GATE is a three-hour, computer-based examination. The MA paper has two parts: a General Aptitude part — verbal ability, quantitative reasoning, analytical and spatial reasoning — common to all GATE papers and not covered here, and the Mathematics part, which carries most of the marks and is the subject of this course. The questions come in three formats:

  • MCQ (multiple choice) — four options, exactly one correct. A wrong answer carries negative marks, so an unsure guess has a cost.
  • MSQ (multiple select) — four options, one or more correct. To earn the marks you must select all the correct options and no incorrect one. There is no negative marking.
  • NAT (numerical answer type) — no options: you type a number with an on-screen keypad. The answer is accepted if it falls in a stated range, so the question says the precision it wants ("correct to two decimal places"). There is no negative marking.

Physical calculators are not allowed; an on-screen virtual calculator is provided, so arithmetic with decimals is part of the game — but slow to do on it, so simplify by hand first. The number of questions, the marks for each type, the size of the negative mark and other rules are set every year by the organising institute: always check the official GATE information brochure for your year. In this course every GATE-corner problem carries a tag such as GATE MA · MCQ, GATE MA · MSQ or GATE MA · NAT.

⚠️ How to answer each type
  • MSQ — treat each option as its own true/false question. For a true option, know the theorem that proves it and check its hypotheses. For a false one, produce a specific counterexample: "$\frac{x^3}{x^2+y^2}$ has all directional derivatives at $0$ but is not differentiable", "$\begin{pmatrix}0&1\\0&0\end{pmatrix}$ is not diagonalisable". The ⚠️ boxes of each section are designed to be learned as such a list.
  • MCQ — eliminate. The distractors are usually the results of standard slips (an un-normalised direction vector, a forgotten Jacobian factor, a sign error); spotting them is often faster than computing. Answer only when you can justify the choice — wrong answers cost marks.
  • NAT — keep exact values to the end. Work symbolically ($\sqrt2$, $\pi$, $\log3$), convert to decimals only at the last step, and round as instructed. Our solutions state the accepted range, e.g. "Answer: 1.15 (accept 1.14 to 1.16)".

5. A first taste: one integral, six chapters

The Gaussian integral $\displaystyle\int_{-\infty}^{\infty}e^{-x^2}\,dx=\sqrt\pi$ is a favourite of GATE — and it is a good picture of how the chapters of this course talk to each other. Below, a computer approximates it the simplest possible way: by trapezoids of width $h$. Watch how few trapezoids are needed for a NAT-quality answer.

Interactive — Trapezoids Under the Bell Curve

The blue curve is $e^{-x^2}$ and the shaded trapezoids have width $h$, with corners at the points $x=kh$. Their total area is $T(h)=h\sum_ke^{-k^2h^2}$ (the terms beyond $|x|=6$ are below $10^{-15}$). Move the slider or press Play, and watch the error. Would $T(h)$ pass as a NAT answer "correct to two decimal places", accepted from $1.76$ to $1.78$?

1.50
trapezoids used—
T(h)—
√π1.7724539
error T(h) − √π—
NAT range 1.76–1.78?—

Chapter 1 — polar coordinates

Square the integral: $I^2=\iint e^{-(x^2+y^2)}\,dx\,dy=\int_0^{2\pi}\!\int_0^\infty e^{-r^2}r\,dr\,d\theta=\pi$. The Jacobian factor $r$ does all the work (§1.3).

Chapter 4 — convergence theorems

$(1-x^2/n)^n$ on $|x|\le\sqrt n$ increases to $e^{-x^2}$; the monotone convergence theorem lets the limit pass through the integral.

Chapter 5 — Cauchy's theorem

Shifting the line of integration to $\operatorname{Im}z=b$ does not change the integral of $e^{-z^2}$, which gives the Fourier transform of the Gaussian.

Chapter 6 — Laplace transforms

$\Gamma(\tfrac12)=\sqrt\pi$ is the same integral in disguise, and gives $\mathcal{L}\{t^{-1/2}\}=\sqrt{\pi/s}$.

Chapter 9 — numerical integration

The trapezoid rule's usual error is of order $h^2$, yet here it is far smaller: for smooth, rapidly decaying integrands the error falls exponentially in $1/h^2$ — the lab shows it.

Chapter 10 — the heat equation

The heat kernel $\frac{1}{\sqrt{4\pi t}}e^{-x^2/4t}$ has total mass $1$ for every $t\gt0$ — exactly because $\int e^{-x^2}dx=\sqrt\pi$.

6. Map of the course

The twelve chapters follow the official GATE MA syllabus. Each chapter page opens with an overview, the outcomes, a teaser lab and the list of its sections.

Ch 1

Calculus of Several Variables

Directional and total derivatives, implicit functions, extrema and Lagrange multipliers, double and triple integrals.

$\nabla f=\lambda\nabla g$
Open chapter →
Ch 2

Vector Calculus

Gradient, divergence, curl; line and surface integrals; Green's, Stokes' and Gauss's theorems.

$\oint_C F\cdot dr=\iint_S(\nabla\times F)\cdot n\,dS$
Open chapter →
Ch 3

Linear Algebra

Rank and linear systems, eigenvalues, minimal polynomial, Jordan form, inner products, special matrices, quadratic forms.

$\operatorname{rank}+\operatorname{nullity}=n$
Open chapter →
Ch 4

Real Analysis

Metric spaces, uniform convergence, power series, Ascoli–Arzelà, Weierstrass, Lebesgue measure and integral.

$\int\lim f_n=\lim\int f_n$
Open chapter →
Ch 5

Complex Analysis

Analytic functions, Cauchy's theorem, series and singularities, residues, Rouché, conformal and Möbius maps.

$\oint f=2\pi i\sum\operatorname{Res}$
Open chapter →
Ch 6

Ordinary Differential Equations

First-order and linear equations, Laplace transforms, series solutions, Legendre and Bessel, Sturm theory, stability.

$\mathcal{L}\{y'\}=sY-y(0)$
Open chapter →
Ch 7

Algebra

Groups to Sylow theorems, rings and ideals, ED, PID, UFD, polynomial rings, fields and finite fields.

$|G|=|H|\,[G:H]$
Open chapter →
Ch 8

Functional Analysis

Banach and Hilbert spaces, Hahn–Banach, the big three theorems, Riesz representation, compact self-adjoint operators.

$\|T\|=\sup_{\|x\|\le1}\|Tx\|$
Open chapter →
Ch 9

Numerical Analysis

Linear systems, root finding, interpolation, numerical differentiation and integration, methods for initial value problems.

$x_{n+1}=x_n-\tfrac{f(x_n)}{f'(x_n)}$
Open chapter →
Ch 10

Partial Differential Equations

Characteristics, classification, separation of variables, d'Alembert's formula, the heat equation on the line, transform methods.

$u_{tt}=c^2u_{xx}$
Open chapter →
Ch 11

Topology

Bases and subbases, subspace, product, quotient and order topologies, connectedness, compactness, separation axioms, Urysohn.

$T_4\Rightarrow$ Urysohn
Open chapter →
Ch 12

Linear Programming

Convexity and basic feasible solutions, simplex and two-phase methods, duality, transportation and assignment problems.

$\max c^{\mathsf T}x=\min b^{\mathsf T}y$
Open chapter →

Readers who want the full proofs behind the focused sections will find them in our sister courses CSIR NET Unit 1 — Analysis and Linear Algebra, CSIR NET Unit 2 — Complex Analysis, Algebra and Topology, CSIR NET Unit 3 — Differential Equations, Numerical Analysis and related topics and CSIR NET Unit 4 — Statistics, Probability and Operations Research; each 📚 box links to the exact sections.

7. Conventions

⚠️ Conventions used throughout
  1. $\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.
  2. $\log x$ is the natural logarithm. Intervals are written $[a,b]$, $(a,b)$, $[a,b)$.
  3. "Iff" means "if and only if". A theorem stated with "if" claims one direction only — the converse is often false, and MSQs know it.
  4. A "direction" for a directional derivative is always a unit vector. In mixed partials, $f_{xy}=(f_x)_y$: differentiate in $x$ first.
  5. 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. "the implicit function theorem (§1.1)".
  6. Proofs end with ∎. "Proof (idea)" or "Proof (sketch)" names every key step but leaves routine details to the reader — or to the 📚 Go deeper link.

Where to begin. The chapters are largely independent, so you may start with the one you need most. If you have no preference, begin with Chapter 1 — Calculus of Several Variables: it uses only BSc calculus, and its derivatives, Jacobians and multiple integrals reappear in vector calculus, differential equations and analysis throughout the course.