Advanced Maths for Research: Integral Cup Grand Prix Preparation

Four tracks, and you choose three

The Integral Cup Grand Prix is built on four tracks: Integration and Analysis; Linear Algebra and Optimization; Probability and Statistics; Game Theory. Each participant chooses three of the four, and Round 1 is written offline with 5 multiple-choice and 5 numerical problems per track in two hours.

That format decides how to prepare. Ten problems per track in two hours is twelve minutes each, which is generous by competition standards and unforgiving in a different way: these are not problems that yield to pattern recognition. A student either has the technique or spends twelve minutes discovering they do not.

Choosing your three

This is the first real decision and students usually make it badly, picking the tracks that sound most impressive.

Game Theory is the most self-contained of the four. It needs probability for mixed strategies and little else, which makes it a sensible third track for many students. Integration and Analysis is the deepest and rewards a student who already has solid calculus; it is the track where unprepared students lose most. Linear Algebra and Optimization and Probability and Statistics overlap considerably — eigenvalues and positive semidefiniteness run through convex optimization, covariance and PCA run through both — so taking the pair shares a good deal of preparation.

We settle this with each student after a few weeks of seeing actual work, not at enrolment on a preference.

What each track actually contains

Track 1 runs from integration technique — substitution, the Weierstrass substitution, parts, partial fractions — through sequences and series with the full convergence-test set, limits and continuity to epsilon-delta rigour, the mean value theorems, Riemann sums and the Riemann-Lebesgue lemma, linear recurrences, the inequality toolkit, ODEs and Laplace transforms, and finally Fourier methods, differentiation under the integral sign and symmetry techniques. That last unit is where an apparently intractable integral becomes a short one.

Track 2 runs from matrices and determinants through Gaussian elimination, diagonal dominance and the Gershgorin circle theorem, vector spaces and Gram-Schmidt, lattices, then eigen theory, the spectral theorem and the matrix decompositions, and into convex optimization: convex sets and functions, Lagrangian duality, KKT conditions, linear programming and the simplex method.

Track 3 covers probability spaces, the standard distributions, joint and conditional distributions, the limit theorems, then statistical inference and hypothesis testing, Markov chains with absorbing states and the fundamental matrix, Bayesian updating with conjugate priors, and basic queuing including M/M/1 and Little's law.

Track 4 covers strategic and extensive form, Nash equilibria pure and mixed, iterated dominance and rationalizability, zero-sum and non-zero-sum games, impartial games with Nim and the Sprague-Grundy theorem, and backward and forward induction.

Order is not a presentational choice

The single most common way students waste a year on material like this is by starting with whatever sounds most interesting.

The dependencies here are real. Measure theory needs Lebesgue integration from analysis. Gaussian processes need kernel methods from linear algebra and multivariate Gaussians from probability. Optimal transport needs measure theory and convex optimization together. Attention and the neural tangent kernel need matrix algebra and gradient calculus. A student who skips ahead cannot follow the arguments, concludes the material is beyond them, and is simply wrong — they arrived without the prerequisites.

So the course follows a stated dependency order throughout, and we say which unit unlocks which.

Beyond the competition

The four tracks are the competition syllabus and are covered completely. For students continuing further, three extension blocks are available and taken by interest rather than by requirement.

Multivariable and optimization theory: gradients, Jacobians and Hessians, multiple integrals, vector calculus, constrained optimization, gradient descent with momentum and adaptive methods, automatic differentiation and backpropagation. Measure, information and learning theory: sigma-algebras, the Lebesgue integral, dominated convergence, entropy and KL divergence, concentration inequalities, PAC learning and VC dimension. Modern methods: spectral graph theory, kernels and RKHS, optimal transport, attention as matrix operations, the neural tangent kernel, variational inference, MCMC, Gaussian processes, SDEs, score matching and diffusion models.

This is the mathematics modern machine learning research is written in. A student who has done the four tracks properly can read it.

Who this suits

Students from Class 11 upward through undergraduate study who want university-level mathematics taught as problems rather than as lectures. Entry assumes single-variable calculus and confident school algebra; the early units rebuild the core deliberately, because students arrive from very different school systems.

It suits three groups: Integral Cup entrants, students bridging into a quantitative undergraduate programme, and students who intend to work in machine learning research and have realised the mathematics is the hard part.

Competition dates, fees, eligibility and registration are set by the organisers and change between seasons. Check theintegralcup.in for the current cycle rather than relying on figures reproduced on a coaching page, including this one.