Courses that cover these topics count towards your Master’s Degree application in the area “Real analysis”, only. They count up to at most 16 ECTS credits. Applicants must have completed courses covering both Riemann–Stieltjes integration and Lebesgue integration.

1. Logic: Sets, equivalence relation, inequalities and orderings, maps.
2. The real numbers: Supremum and infimum, monotone sequences, convergence of sequences, Chauchy sequences, real numbers are complete.
3. Continuity of real functions: Intermediate value theorem, inverse functions, convergence and uniform convergence of function sequences, direct comparison test.
4. Differentiability of real functions: Mean value theorem, Taylor’s theorem, find minimum and maximum values.
5. Series: Absolute and conditional convergence, geometric series, harmonic series, critieria for convergence, series of functions, component wise differentiation and integration, powerseries, radius of convergence.
6. Elementary functions: Exponential map, trigonometric functions, their inverses.
7. Integration (one variable): Integrals Fundamental theorem of calculus, antiderivative, improper integrals, partial integration, substitution, Leibniz’ Rule for integrals.
8. Spaces: Topology, continuity, compactness, metric spaces, completeness, Banach fixed point theorem, normed vector spaces.
9. Real analysis: Differential maps, partial differentiation, Taylor ‘s Theorem, inverse function theorem, implicit function theorem, extreme values, Lagrange multipliers.
10. Integration (multiple variable): Riemann–Stieltjes integral, Lebesgue measure, Lebesgue integral, dominated convergence theorem, transformation formula, Fubini’s Theorem.
11. Submanifolds: Submanifolds of R^n, Integration over submanifolds, Gaussian integrals.
12. Ordinary differential equations: Local existence and uniqueness, linear differential equations and systems of linear differential equations, fundamental solutions, variation of constants.

Courses that cover these topics count towards your Master’s Degree application in the area “Analytical geometry and linear algebra”, only. They count up to at most 16 ECTS credits.

1. Basic knowledge: Sets and maps, proofs: Proof by contradiction, Induction. Basics of groups, rings (in particular polynomial rings), fields; Introduction of complex numbers an residue fields.
2. Structures of vector spaces: linear dependence, basis, dimension; linear maps and fundamental theorem of homomorphisms.
3. Matrices I: Gaussian algorithm, trace and determinant, permutations, Cramer rule, solving of linear systems.
4. Eigenvalues: Characteristic polynomial, diogonalisability, Cayley-Hamilton theorem.
5. Euclidean geometry, geometry of unitary transformations Scalar products and norms, orthogonality, normal maps, euclidean and unitary vector spaces.
6. Quadratic and hermitian forms, Principal axis theorem, Sylvester's law of inertia
7. Affine and projective geometry
8. Matrices II: Jordan normal form, matrix exponentials
9. Multilinear algebra: tensor products and tensor algebras, exterior product.

Courses at level above real analysis / linear algebra are expected. Courses that cover these topics will be counted towards the area “Pure mathematics”.

1. Higher analysis: Analysis on manifolds, complex analysis, functional analysis, partial differential equations,... .
2. Advanced geometry: Algebraic geometry, algebraic topology, differential geometry, projective geometry,... .
3. Advanced algebra: Commutative algebra, field theory, Galois theory, homological algebra, Lie theory,... .
4. Number theory: Analytic number theory, algebraic number theory, geometry of numbers, diophantine equations,....
5. ...

Courses that contain these topics will be counted towards the area “Numerical mathematics”.

1. Conditioning and stability: Error analysis, error propagation, numerical stability, ill/well-conditioned.
2. Matrix decomposition: LU decomposition, QR decomposition, Cholesky decomposition.
3. Non-linear systems: Fixed-point iteration, Banach fixed-point theorem, Newton's method, Gauss–Newton algorithm.
4. Linear systems: Iterative algorithms, fixed point iteration, Gauss-Seidel method, gradient descent.
5. Eigenvalue problems: QR algorithm, singular value decomposition, Lanczos algorithm.
6. Numerical integration and interpolation: Polynomial interpolation, spline interpolation, Bézier curve, Newton-Cotes formulas, Gaussian quadrature rule, Gauss–Legendre quadrature.
7. Initial value problem: Initial condition, single-step method, implicit and explicit methods, Runge–Kutta method, adaptive step size, Fehlberg's method.
8. Boundary value problem: Boundary conditions, elliptic differential equations, finite difference method.

Courses that contain these topics will be counted towards the area “Measure and probability”. Applicants are expected to have taken courses covering all these topics.

1. Foundations: Sigma-algebra, measure, measurable space, measurable function.
2. Lebesgue theory: Lebesgue sigma-algebra, Lebesgue measure, Lebesgue integral.
3. Measure-theoretic probability theory: Axiomatic theory of probability, probability measure, probability space, continuous/discrete probability distribution.
4. Convergence of random variables: Convergence in measure, convergence in probability, weak convergence.
5. Weak law and strong law of large numbers (incl. proofs).
6. Central limit theorem and theorem of Lindeberg- Lindeberg-Lévy (incl. proofs).