GATE Mathematics — Syllabus, Topics & Key Formulas

GATE Mathematics usually means the MA paper. If that is what you are searching for, the syllabus is broad: it covers 11 major areas from Calculus and Linear Algebra to Topology and Linear Programming, plus the common General Aptitude section that appears in every GATE paper.

The first thing to get right is the label. The MA paper is not the same as the Engineering Mathematics portion inside papers such as EE, ME, or CSE. If you mix those up, your study plan will be wrong before you even start.

What GATE Mathematics Covers

The MA syllabus is usually grouped into these broad units:

• Calculus
• Linear Algebra
• Real Analysis
• Complex Analysis
• Ordinary Differential Equations
• Algebra
• Functional Analysis
• Numerical Analysis
• Partial Differential Equations
• Topology
• Linear Programming

That list is broad on purpose. The quickest way to make sense of it is to sort the topics by how you actually study them:

• Calculation-heavy units usually include Calculus, Linear Algebra, Complex Analysis, Ordinary Differential Equations, Numerical Analysis, Partial Differential Equations, and parts of Linear Programming.
• Definition-and-theorem-heavy units usually include Real Analysis, Algebra, Functional Analysis, and Topology.
• Mixed units require both technique and theory. Complex Analysis and Linear Algebra are good examples.

If you only remember one idea from this page, make it this: GATE Mathematics is not a single "formula subject." Some units reward fast computation, but others reward careful use of definitions and hypotheses.

Which GATE Math Topics Need Formulas

The phrase "key formulas" is useful, but only up to a point. In several MA topics, the real scoring difference comes from knowing when a theorem applies, not from memorizing a long list.

For example, in Real Analysis, the dominated convergence theorem is powerful, but only when its hypotheses are actually satisfied. In Algebra, knowing the statement of Sylow's theorems matters more than carrying a formula sheet. In Topology, definitions such as compactness, connectedness, basis, and quotient topology do most of the work.

So the practical rule is:

• Keep a formula sheet for the computational blocks.
• Keep a condition sheet for the proof-heavy blocks.

Key Formulas Worth Revising

These are not the whole syllabus. They are anchor formulas that help you recognize standard moves quickly.

Calculus And Optimization

For a scalar function $f(x_1, \dots, x_n)$, the gradient is

$$\nabla f = \left(\frac{\partial f}{\partial x_1}, \dots, \frac{\partial f}{\partial x_n}\right)$$

For constrained extrema with a smooth constraint $g(x_1, \dots, x_n) = c$, the Lagrange multiplier condition is

$$\nabla f = \lambda \nabla g$$

This condition is used at candidate points where the method applies. It does not by itself guarantee a maximum or minimum.

Linear Algebra

The characteristic polynomial of a square matrix $A$ is

$$p_A(\lambda) = \det(\lambda I - A)$$

Eigenvalues and eigenvectors satisfy

$$Av = \lambda v$$

For a linear map $T: V \to W$ on a finite-dimensional vector space,

$$\dim(V) = \operatorname{rank}(T) + \operatorname{nullity}(T)$$

That rank-nullity relation is a structural fact you use often in proofs as well as computations.

Complex Analysis

If $f$ is analytic on and inside a suitable simple closed contour $C$, then Cauchy's integral formula gives

$$f(a) = \frac{1}{2\pi i} \oint_C \frac{f(z)}{z-a}\,dz$$

For isolated singularities inside $C$, the residue theorem says

$$\oint_C f(z)\,dz = 2\pi i \sum \operatorname{Res}(f; a_k)$$

The condition matters here too: you need the analytic and contour assumptions to be in place.

Numerical Analysis

Newton-Raphson iteration for solving $f(x)=0$ is

$$x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}$$

This requires $f'(x_n) \ne 0$, and it works well only when the starting guess is reasonable and the function behaves well near the root.

For the composite trapezoidal rule with $h = \frac{b-a}{n}$,

$$\int_a^b f(x)\,dx \approx \frac{h}{2}\left[f(x_0) + 2\sum_{k=1}^{n-1} f(x_k) + f(x_n)\right]$$

That is an approximation formula, not an identity.

Differential Equations And Transforms

The Laplace transform is defined by

$$\mathcal{L}\{f\}(s) = \int_0^\infty e^{-st} f(t)\,dt$$

when the integral converges.

In PDE, classification, canonical forms, separation of variables, and transform methods matter more than one single formula, so it is better to memorize the workflow than a bare list of expressions.

Linear Programming

A standard linear programming model is written as

$$\text{maximize or minimize } c^T x \quad \text{subject to } Ax \le b,\ x \ge 0$$

The exact form depends on the problem statement. In this unit, setup is as important as solving.

Worked Example: Newton-Raphson For $\sqrt{2}$

Take

$$f(x) = x^2 - 2$$

Then

$$f'(x) = 2x$$

Newton-Raphson gives

$$x_{n+1} = x_n - \frac{x_n^2 - 2}{2x_n}$$

Start with $x_0 = 1.5$. Then

$$x_1 = 1.5 - \frac{1.5^2 - 2}{2(1.5)} = 1.5 - \frac{0.25}{3} = 1.4167$$

One more step gives

$$x_2 = 1.4167 - \frac{1.4167^2 - 2}{2(1.4167)} \approx 1.4142$$

That is already very close to $\sqrt{2} \approx 1.4142$.

This is worth remembering because it shows the difference between knowing a formula and knowing a method. In GATE Mathematics, many questions are really about turning one standard method into a clean sequence of steps.

Common Mistakes In GATE Mathematics Preparation

Mixing Up MA With Engineering Mathematics

This is the most basic mistake. The official MA paper is much broader than the mathematics section in many other GATE papers.

Building Only A Formula Sheet

That works poorly for Real Analysis, Algebra, Functional Analysis, and Topology. In those subjects, definitions, examples, and theorem conditions carry much more weight.

Using A Theorem Without Its Hypotheses

Many wrong solutions look plausible because the theorem itself is correct but the hypotheses were never checked. This happens often with convergence theorems, inverse and implicit function theorems, and contour-integration results.

Treating Numerical Methods As Exact

Methods such as Newton-Raphson, trapezoidal rule, Simpson rule, Jacobi iteration, and Gauss-Seidel are numerical procedures. They come with approximation or convergence conditions.

Ignoring Problem Setup In Linear Programming

The algebra may be easy once the model is correct, but the real mistake often happens one step earlier, when the objective function or constraints are written incorrectly.

When GATE Mathematics Is Used Like A Formula Subject

GATE Mathematics behaves like a formula subject in units where you repeatedly apply a standard tool: finding eigenvalues, evaluating residues, iterating Newton-Raphson, solving a differential equation, or setting up a linear program.

It behaves less like a formula subject in units where you must interpret definitions and theorem hypotheses carefully. Real Analysis, Algebra, Functional Analysis, and Topology often work this way.

How To Revise GATE Mathematics Efficiently

A practical revision plan is to split your notes into three compact sections:

• One for formulas and computational templates
• One for definitions, theorem statements, and standard counterexamples
• One for short solved problems

That structure matches the syllabus better than a single long notebook. It also keeps you from over-studying formula-heavy units and under-studying proof-heavy ones.

When This Overview Is Most Useful

This page is most useful at the start of preparation, when you need to see the shape of the MA paper quickly, and during revision, when you want to decide what belongs on a formula sheet and what belongs on a theorem sheet.

It is also useful if you are switching from a branch-specific GATE paper to MA, because the jump is not just about difficulty. It is also about the type of mathematics being tested.

Try Your Own Version

Pick one MA unit and make a one-page summary with two parts: the conditions you must not forget, and the two or three formulas or methods you use most often in that unit. If you want to check the arithmetic in a step such as a Newton-Raphson iteration or an eigenvalue calculation, try your own version with GPAI Solver and compare it with your handwritten work.