🔢 OPTIONAL — MATHEMATICS

Papers: VI & VII · 500 marks. GS overlap: NONE. Best for: mathematics graduates, and engineers with strong, recent command of the subject. Risk profile: HIGH RISK / HIGH REWARD — answers are objectively right or wrong, so a well-prepared candidate can score exceptionally (350+), but a partially-prepared one can score very low. There is no "writing well" fallback as in humanities optionals.

⚠️ Verify against the current UPSC notification at upsc.gov.in.

PAPER I

1. Linear Algebra: vector spaces over R and C, linear dependence and independence, subspaces, bases, dimensions, linear transformations, rank and nullity, matrix of a linear transformation. Algebra of Matrices; row and column reduction, echelon form, congruence and similarity; rank of a matrix; inverse of a matrix; solution of system of linear equations; eigenvalues and eigenvectors, characteristic polynomial, Cayley-Hamilton theorem, symmetric, skew-symmetric, Hermitian, skew-Hermitian, orthogonal and unitary matrices and their eigenvalues.
2. Calculus: real numbers, functions of a real variable, limits, continuity, differentiability, mean-value theorem, Taylor's theorem with remainders, indeterminate forms, maxima and minima, asymptotes; curve tracing; functions of two or three variables: limits, continuity, partial derivatives, maxima and minima, Lagrange's method of multipliers, Jacobian. Riemann's definition of definite integrals; indefinite integrals; infinite and improper integrals; double and triple integrals (evaluation techniques only); areas, surface and volumes.
3. Analytic Geometry: Cartesian and polar coordinates in three dimensions, second degree equations in three variables, reduction to canonical forms; straight lines, shortest distance between two skew lines, plane, sphere, cone, cylinder, paraboloid, ellipsoid, hyperboloid of one and two sheets and their properties.
4. Ordinary Differential Equations: formulation of differential equations; equations of first order and first degree, integrating factor; orthogonal trajectory; equations of first order but not of first degree, Clairaut's equation, singular solution. Second and higher order linear equations with constant coefficients, complementary function, particular integral and general solution. Second order linear equations with variable coefficients, Euler-Cauchy equation; determination of complete solution when one solution is known using method of variation of parameters. Laplace and Inverse Laplace transforms and their properties; Laplace transforms of elementary functions. Application to initial value problems for 2nd order linear equations with constant coefficients.
5. Dynamics and Statics: rectilinear motion, simple harmonic motion, motion in a plane, projectiles; constrained motion; work and energy, conservation of energy; Kepler's laws, orbits under central forces. Equilibrium of a system of particles; work and potential energy, friction; common catenary; principle of virtual work; stability of equilibrium, equilibrium of forces in three dimensions.
6. Vector Analysis: scalar and vector fields, differentiation of vector field of a scalar variable; gradient, divergence and curl in Cartesian and cylindrical coordinates; higher order derivatives; vector identities and vector equations. Application to geometry: curves in space, curvature and torsion; Serret-Frenet's formulae. Gauss and Stokes' theorems, Green's identities.

PAPER II

1. Algebra: groups, subgroups, cyclic groups, cosets, Lagrange's Theorem, normal subgroups, quotient groups, homomorphism of groups, basic isomorphism theorems, permutation groups, Cayley's theorem. Rings, subrings and ideals, homomorphisms of rings; integral domains, principal ideal domains, Euclidean domains and unique factorization domains; fields, quotient fields.
2. Real Analysis: real number system as an ordered field with least upper bound property; sequences, limit of a sequence, Cauchy sequence, completeness of real line; series and its convergence, absolute and conditional convergence of series of real and complex terms, rearrangement of series. Continuity and uniform continuity of functions, properties of continuous functions on compact sets. Riemann integral, improper integrals; fundamental theorems of integral calculus. Uniform convergence, continuity, differentiability and integrability for sequences and series of functions; partial derivatives of functions of several (two or three) variables, maxima and minima.
3. Complex Analysis: analytic functions, Cauchy-Riemann equations, Cauchy's theorem, Cauchy's integral formula, power series representation of an analytic function, Taylor's series; singularities; Laurent's series; Cauchy's residue theorem; contour integration.
4. Linear Programming: linear programming problems, basic solution, basic feasible solution and optimal solution; graphical method and simplex method of solutions; duality. Transportation and assignment problems.
5. Partial Differential Equations: family of surfaces in three dimensions and formulation of partial differential equations; solution of quasilinear partial differential equations of the first order, Cauchy's method of characteristics; linear partial differential equations of the second order with constant coefficients, canonical form; equation of a vibrating string, heat equation, Laplace equation and their solutions.
6. Numerical Analysis and Computer Programming: numerical methods — solution of algebraic and transcendental equations of one variable by bisection, Regula-Falsi and Newton-Raphson methods; solution of system of linear equations by Gaussian elimination and Gauss-Jordan (direct), Gauss-Seidel (iterative) methods. Newton's (forward and backward) interpolation, Lagrange's interpolation. Numerical integration: trapezoidal rule, Simpson's rule, Gaussian quadrature formula. Numerical solution of ordinary differential equations: Euler and Runge-Kutta methods. Computer Programming: binary system; arithmetic and logical operations on numbers; octal and hexadecimal systems; conversion to and from decimal systems; algebra of binary numbers. Elements of computer systems and concept of memory; basic logic gates and truth tables, Boolean algebra, normal forms. Representation of unsigned integers, signed integers and reals, double precision reals and long integers. Algorithms and flow charts for solving numerical analysis problems.
7. Mechanics and Fluid Dynamics: generalised coordinates; D'Alembert's principle and Lagrange's equations; Hamilton equations; moment of inertia; motion of rigid bodies in two dimensions. Equation of continuity; Euler's equation of motion for inviscid flow; stream-lines, path of a particle; potential flow; two-dimensional and axisymmetric motion; sources and sinks, vortex motion; Navier-Stokes equation for a viscous fluid.

BOOKLIST

STRATEGY

• Practice, not reading. Mathematics is learnt only by solving. Target 4–6 hours daily during the optional phase.
• Show every step. Marks are awarded for method; a correct final answer with skipped steps loses marks, and a wrong answer with correct method still earns partial credit.
• Time management is the biggest failure point — many candidates cannot finish the paper. Practise full 3-hour papers under timed conditions from early on.
• Solve 15+ years of PYQs — Mathematics repeats question types heavily; this is the single highest-return activity.
• Neatness and presentation matter — number each step, box final answers.
• Choose only if: you can currently solve past-year questions without looking at solutions. Test this before committing.

Pros: completely objective; no current affairs; no ambiguity in evaluation; very high ceiling for the well-prepared; smaller competition pool. Cons: zero GS overlap; high risk if under-prepared; enormous practice time required; no partial-credit safety net from "good writing".