CSIR NET Mathematics Syllabus 2026, Check Exam Pattern

The CSIR NET (Council of Scientific and Industrial Research – National Eligibility Test) in Mathematical Sciences stands as one of the most prestigious and challenging examinations in India for aspiring researchers and lecturers. Conducted biannually by the National Testing Agency (NTA) on behalf of CSIR-HRDG, this examination serves as the gateway to the Junior Research Fellowship (JRF), Assistant Professorship, and PhD admissions in various universities and research institutes across the country.

The examination structure is designed not to test rote memorization, but to assess a candidate’s conceptual depth, analytical ability, and capacity for advanced problem-solving. This article provides a detailed breakdown of the CSIR NET Mathematics Syllabus 2026 and the updated exam pattern to help you build a strategic preparation plan.

CSIR NET Mathematical Sciences 2026 Exam Pattern: Structure and Marking Scheme

A thorough understanding of the exam pattern is the first step toward effective preparation. The CSIR NET Mathematical Science paper is a single, 3-hour Computer-Based Test (CBT) with a maximum score of 200 marks. The question paper is strategically divided into three distinct parts, each designed to test a different skill set.

Section-Wise Breakdown

Part A: General Aptitude
This section is common to all CSIR NET subjects and evaluates the candidate’s reasoning and analytical abilities outside core mathematics.

• Total Questions: 20

• Questions to Attempt: 15

• Marks per Correct Answer: 2

• Total Marks: 30

• Negative Marking: 0.5 marks per wrong answer (25% of 2 marks)

• Topics Covered: General Science, Quantitative Reasoning, Graphical Analysis (Pie-charts, Bar graphs), Data Interpretation, Logical Reasoning (Puzzles, Series, Coding-Decoding), and Numerical Ability.

Part B: Core Mathematics
Part B focuses on fundamental concepts from the core mathematical sciences syllabus. It requires a solid grasp of basic principles and their straightforward applications.

• Total Questions: 40

• Questions to Attempt: 25

• Marks per Correct Answer: 3

• Total Marks: 75

• Negative Marking: 0.75 marks per wrong answer (25% of 3 marks)

• Topics Covered: Questions are generally drawn from the core topics of Analysis, Linear Algebra, Complex Analysis, Algebra, and Differential Equations .

Part C: Advanced Mathematics
This is the most crucial part of the paper, as it carries the highest weightage and determines the final selection. The questions in Part C are analytical, research-oriented, and often contain multiple correct options. Credit is awarded only if ALL the correct options are identified; there is no partial credit or negative marking.

• Total Questions: 60

• Questions to Attempt: 20

• Marks per Correct Answer: 4.75

• Total Marks: 95

• Negative Marking: None (0 marks if any incorrect option is selected)

• Purpose: Tests the application of scientific concepts to solve complex problems and involves higher-order thinking .

Summary of Marking Scheme

Source: CSIR-HRDG Official Exam Scheme 

CSIR NET Mathematics Syllabus 2026: Unit-Wise Breakdown

The syllabus for Parts B and C is vast and is typically divided into four major units. Candidates are advised to download the official PDF from the CSIR-HRDG website (csirhrdg.res.in) for the most authentic and detailed reference. While the syllabus is extensive, analyzing past year trends reveals that Linear Algebra and Real Analysis are the most heavily weighted topics, often accounting for a significant portion of the total marks.

Unit 1: Analysis and Linear Algebra

Analysis

• Elementary Set Theory: Finite, countable, and uncountable sets.

• Real Number System: Complete ordered field, Archimedean property, supremum, infimum.

• Sequences & Series: Convergence, limsup, liminf, Bolzano-Weierstrass theorem, Heine-Borel theorem.

• Continuity & Differentiability: Continuity, uniform continuity, differentiability, Mean Value Theorem.

• Sequence & Series of Functions: Uniform convergence.

• Integration: Riemann sums, Riemann integral, improper integrals.

• Functions of Bounded Variation & Lebesgue Theory: Monotonic functions, types of discontinuity, functions of bounded variation, Lebesgue measure, and Lebesgue integral.

• Functions of Several Variables: Directional derivative, partial derivative, derivative as a linear transformation, Inverse and Implicit Function Theorems.

• Metric Spaces: Compactness, connectedness, normed linear spaces (with spaces of continuous functions as examples) .

Linear Algebra

• Vector Spaces: Subspaces, linear dependence, basis, dimension, algebra of linear transformations.

• Matrix Algebra: Rank, determinant, systems of linear equations, Cayley-Hamilton theorem.

• Matrix Representation & Canonical Forms: Change of basis, diagonal forms, triangular forms, Jordan forms.

• Inner Product Spaces: Orthonormal basis, quadratic forms, reduction, and classification of quadratic forms.

Unit 2: Complex Analysis, Algebra, and Topology

Complex Analysis

• Algebra of Complex Numbers: Complex plane, polynomials, power series, transcendental functions (exponential, trigonometric, hyperbolic).

• Analytic Functions: Cauchy-Riemann equations.

• Integral Calculus: Contour integral, Cauchy’s theorem, Cauchy’s integral formula, Liouville’s theorem, Maximum Modulus Principle, Schwarz lemma, Open Mapping Theorem.

• Series & Residues: Taylor series, Laurent series, calculus of residues.

• Conformal Mappings: Mobius transformations.

Algebra

• Combinatorics: Permutations, combinations, pigeon-hole principle, inclusion-exclusion principle, derangements.

• Number Theory: Fundamental theorem of arithmetic, divisibility, congruences, Chinese Remainder Theorem, Euler’s φ-function, primitive roots.

• Group Theory: Groups, subgroups, normal subgroups, quotient groups, homomorphisms, cyclic groups, permutation groups, Cayley’s theorem, class equations, Sylow theorems.

• Ring Theory: Rings, ideals, prime and maximal ideals, quotient rings, Unique Factorization Domain (UFD), Principal Ideal Domain (PID), Euclidean domain.

• Polynomials: Polynomial rings, irreducibility criteria.

• Field Theory: Fields, finite fields, field extensions, Galois Theory.

Topology

• Topological Spaces: Basis, dense sets, subspace, and product topology.

• Axioms & Properties: Separation axioms, connectedness, and compactness.

Unit 3: Differential Equations, Numerical Analysis, and Classical Mechanics

Ordinary Differential Equations (ODEs)

• First Order ODEs: Existence and uniqueness of solutions of initial value problems, singular solutions, systems of first-order ODEs.

• Higher Order Linear ODEs: General theory of homogeneous and non-homogeneous linear ODEs, variation of parameters.

• Boundary Value Problems: Sturm-Liouville boundary value problem, Green’s function.

Partial Differential Equations (PDEs)

• First Order PDEs: Lagrange and Charpit methods for solving the Cauchy problem.

• Second-Order PDEs: Classification, general solution of higher-order PDEs with constant coefficients.

• Methods of Solution: Method of separation of variables for Laplace, Heat, and Wave equations.

Numerical Analysis

• Algebraic & Transcendental Equations: Numerical solutions (Iteration, Newton-Raphson), Rate of convergence.

• Linear Systems: Gauss elimination, Gauss-Seidel methods.

• Interpolation: Finite differences, Lagrange, Hermite, and spline interpolation.

• Numerical Differentiation & Integration.

• ODEs (IVP): Picard, Euler, modified Euler, and Runge-Kutta methods.

Calculus of Variations

• Functionals: Variation of a functional, Euler-Lagrange equation.

• Extrema: Necessary and sufficient conditions for extrema.

• Variational Methods: Boundary value problems in ODEs and PDEs.

Linear Integral Equations

• Types: Linear integral equations of the first and second kind of Fredholm and Volterra type.

• Solution Methods: Solutions with separable kernels.

• Theory: Characteristic numbers, eigenfunctions, resolvent kernel.

Classical Mechanics

• Lagrangian Mechanics: Generalized coordinates, Lagrange’s equations.

• Hamiltonian Mechanics: Hamilton’s canonical equations, Hamilton’s principle, principle of least action.

• Rigid Body Dynamics: Two-dimensional motion of rigid bodies, Euler’s dynamical equations.

• Oscillations: Theory of small oscillations.

Unit 4: Statistics and Probability

This unit covers a wide range of topics in descriptive and inferential statistics, probability theory, and stochastic processes.

• Descriptive Statistics: Exploratory data analysis.

• Probability: Sample space, discrete probability, independent events, Bayes’ theorem, random variables, expectation, moments.

• Distributions: Univariate and multivariate distributions, marginal and conditional distributions, characteristic functions.

• Probability Inequalities: Tchebyshef, Markov, Jensen.

• Limit Theorems: Weak and strong laws of large numbers, Central Limit Theorems.

• Stochastic Processes: Markov chains (finite and countable state space), classification of states, stationary distribution, Poisson and birth-and-death processes.

• Sampling & Estimation: Standard discrete/continuous distributions, sampling distributions, methods of estimation, confidence intervals.

• Hypothesis Testing: Most powerful and uniformly most powerful tests, likelihood ratio tests, chi-square test, large sample tests.

• Nonparametric Tests & Bayesian Inference: Rank correlation, test for independence, elementary Bayesian inference.

• Linear Models: Gauss-Markov models, estimability of parameters, BLUEs, ANOVA, ANCOVA, regression (simple, multiple, logistic).

• Multivariate Analysis: Multivariate normal distribution, Wishart distribution, principal component analysis, discriminant analysis, cluster analysis.

• Sampling Techniques: Simple random, stratified, systematic, PPS sampling, ratio, and regression methods.

• Design of Experiments: CRD, RBD, LSD, BIBD, factorial experiments.

• Reliability & Queueing: Hazard function, life testing, linear programming problems (simplex methods, duality), Markovian queuing models (M/M/1, M/M/C, M/G/1).

CSIR UGC NET Maths 2026 PDF Download

Get a free PDF of the CSIR Maths Syllabus.  Click on the Link to get a free PDF

Strategic Preparation Tips

1. Prioritize High-Weightage Topics: Given the exam pattern, Linear Algebra and Real Analysis should be your primary focus, as they traditionally carry the highest weight. Complex Analysis and Algebra are close seconds.

2. Master Part C Strategy: Since Part C has no negative marking and requires identifying all correct options, focus on accuracy and thorough understanding. Practice solving multi-concept problems.

3. Formulate the ‘Attempt’ Strategy: The paper gives you a choice of which questions to attempt. Do not feel pressured to solve all questions. Aim to maximize your score by focusing on questions you are most confident about to minimize negative marking in Parts A and B.

4. Practice with Test Series: Enrolling in a test series that mimics the actual exam pattern (with the specific 20/40/60 question distribution) is invaluable for time management and understanding the level of difficulty.

Conclusion

The CSIR NET Mathematical Sciences examination is a rigorous test of mathematical aptitude and conceptual clarity. By thoroughly understanding the syllabus structure—from the analytical demands of Part C to the fundamental concepts of Part B—and by strategically focusing on high-weightage topics like Linear Algebra and Real Analysis, candidates can significantly enhance their preparation. A balanced study plan, combined with consistent practice and a smart attempt strategy, is key to qualifying for the prestigious Junior Research Fellowship and lectureship.