Indian Institute of Technology Delhi which conducts the GATE 2020 releases syllabus for the exam. Among the 25 papers, Mathematics is one among them that candidates choose. Here in this post, we have given all the details of the **GATE Mathematics Syllabus 2020** for the reference. Candidates appearing for the MA subject can go through information given below to have knowledge on all the topics from which the questions will be asked in the exam.

## Gate Exam Syllabus for Mathematics

GATE Syllabus for Mathematics includes various topics from calculus, Real Analysis, Linear Algebra, Complex Analysis, Algebra, Ordinary Differential Equations, Numerical Analysis, Functional Analysis, Topology, Partial Differential Equations and Linear Programming. The syllabus is prepared from the topics of the graduation.

Mathematics paper will include the 55 questions from the subject along with the 10 General Aptitude questions which comes to a total of 65 questions. It is important for the candidates to prepare all the topics including GA to score good marks in the exam.

SI. No. |
Subject |
Topics |

1. |
Calculus | Finite, countable and uncountable sets, Real number system as a complete ordered field, Archimedean property; Sequences and series, convergence; Limits, continuity, uniform continuity, differentiability, mean value theorems; Riemann integration, Improper integrals; Functions of two or three variables, continuity, directional derivatives, partial derivatives, total derivative, maxima and minima, saddle point, method of Lagrange’s multipliers; Double and Triple integrals and their applications; Line integrals and Surface integrals, Green’s theorem, Stokes’ theorem, and Gauss divergence theorem. |

2. |
Linear Algebra | Finite dimensional vector spaces over real or complex fields; Linear transformations and their matrix representations, rank and nullity; systems of linear equations, eigenvalues and eigenvectors, minimal polynomial, Cayley-Hamilton Theorem, diagonalization, Jordan canonical form, symmetric, skew-symmetric, Hermitian, skew-Hermitian, orthogonal and unitary matrices; Finite dimensional inner product spaces, Gram-Schmidt orthonormalization process, definite forms. |

3. |
Real Analysis | Metric spaces, connectedness, compactness, completeness; Sequences and series of functions, uniform convergence; Weierstrass approximation theorem; Power series; Functions of several variables: Differentiation, contraction mapping principle, Inverse and Implicit function theorems; Lebesgue measure, measurable functions; Lebesgue integral, Fatou’s lemma, monotone convergence theorem, dominated convergence theorem. |

4. |
Complex Analysis | Analytic functions, harmonic functions; Complex integration: Cauchy’s integral theorem and formula; Liouville’s theorem, maximum modulus principle, Morera’s theorem; zeros and singularities; Power series, radius of convergence, Taylor’s theorem and Laurent’s theorem; residue theorem and applications for evaluating real integrals; Rouche’s theorem, Argument principle, Schwarz lemma; conformal mappings, bilinear transformations. |

5. |
Ordinary Differential equations | First order ordinary differential equations, existence and uniqueness theorems for initial value problems, linear ordinary differential equations of higher order with constant coefficients; Second order linear ordinary differential equations with variable coefficients; Cauchy-Euler equation, method of Laplace transforms for solving ordinary differential equations, series solutions (power series, Frobenius method); Legendre and Bessel functions and their orthogonal properties; Systems of linear first order ordinary differential equations. |

6. |
Algebra | Groups, subgroups, normal subgroups, quotient groups, homomorphisms, automorphisms; cyclic groups, permutation groups, Sylow’s theorems and their applications; Rings, ideals, prime and maximal ideals, quotient rings, unique factorization domains, Principle ideal domains, Euclidean domains, polynomial rings and irreducibility criteria; Fields, finite fields, field extensions. |

7. |
Functional Analysis | Normed linear spaces, Banach spaces, Hahn-Banach theorem, open mapping and closed graph theorems, principle of uniform boundedness; Inner-product spaces, Hilbert spaces, orthonormal bases, Riesz representation theorem. |

8. |
Numerical Analysis | Numerical solutions of algebraic and transcendental equations: bisection, secant method, Newton-Raphson method, fixed point iteration; Interpolation: error of polynomial interpolation, Lagrange and Newton interpolations; Numerical differentiation; Numerical integration: Trapezoidal and Simpson’s rules; Numerical solution of a system of linear equations: direct methods (Gauss elimination, LU decomposition), iterative methods (Jacobi and Gauss-Seidel); Numerical solution of initial value problems of ODEs: Euler’s method, Runge-Kutta methods of order 2. |

9. |
Partial Differential Equations | Linear and quasi-linear first order partial differential equations, method of characteristics; Second order linear equations in two variables and their classification; Cauchy, Dirichlet and Neumann problems; Solutions of Laplace and wave equations in two dimensional Cartesian coordinates, interior and exterior Dirichlet problems in polar coordinates; Separation of variables method for solving wave and diffusion equations in one space variable; Fourier series and Fourier transform and Laplace transform methods of solutions for the equations mentioned above. |

10. |
Topology | Basic concepts of topology, bases, subbases, subspace topology, order topology, product topology, metric topology, connectedness, compactness, countability and separation axioms, Urysohn’s Lemma. |

11. |
Linear Programmin | Linear programming problem and its formulation, convex sets and their properties, graphical method, basic feasible solution, simplex method, two phase methods; infeasible and unbounded LPP’s, alternate optima; Dual problem and duality theorems; Balanced and unbalanced transportation problems, Vogel’s approximation method for solving transportation problems; Hungarian method for solving assignment problems. |

12. |
General Aptitude | Syllabus Link |

Candidates preparing for the Mathematics paper are suggested to go through some text books and solve the questions of the GATE syllabus for mathematics as it is one of the toughest subjects. We suggest candidates to check out for some recommended books and buy those mathematics books for preparation.

Solving previous papers and practicing mock tests will help a lot for the candidates to confidently appear for the exam and score good marks. Along with the gate syllabus for mathematics 2020, candidates should also know the important topics and their weightage so that they can put more efforts on those topics which helps them score more marks in the paper.

As if you have check out the **GATE Mathematics Syllabus**, you can also check out the GA syllabus available @ ePostbag as it is part of every paper of GATE 2020. Hope the article is helpful.

## Leave a Reply