Standard Course content of our Bachelor program in mathematics –

Information sheet for applicants of our Master program in Mathematics – Bonn

The following table contains short descriptions of the content of all lecture modules of the Bachelor Program in Mathematics of the
University of Bonn.
This document should give you an overview about the prerequisites that are necessary for entering the Master program in mathematics.
Our Bachelor students have to cover four of the six mathematical areas with at least 18, 18, 9 and 9 credit points.
Module Area Content
V1G1 Compulsory We discuss the axiomatic foundations of analysis and develop the theory of sequences and
Analysis I 9 CP functions of one real variable with attention to precise definitions and rigorous proofs. In
particular, we treat: convergence and limit points, series of real and complex numbers, continuity
and differentiability of functions in one variable, uniform convergence. Riemann integral, partial
integration and substitution formula. Power series, elementary functions (also in complex
numbers), including exponential and trigonometric functions. Characteristics of elementary
functions.
V1G2 Compulsory Functions of several real variables, their continuity and differentiability. Partial derivatives,
Analysis II 9 CP especially gradient, divergence and rotation. Implicit functions theorem, norms and maps
between normed spaces and connections to the convergence of functions, completeness and
Banach's fixed point theorem. Ordinary differential equations, theorem of Picard-Lindelöf,
solutions of linear first and second order ordinary differential equations.
V1G3 – Compulsory Linear Equations systems, Gaussian elimination method, groups, rings, fields (basics), vector
Linear Algebra I 9 CP spaces, bases and dimension, linear maps, standard scalar product on the three dimensional real
(Lineare Algebra I) space and geometric applications, matrix representation of linear maps, transformation of basis,
factor spaces, determinants, Eigenvalues and Eigenvectors, characteristic polynomial, methods to
diagonalize and trigonalize endomorphisms.
V1G4 Compulsory Jordan normal form, quadratic forms, bilinear forms, Euclidean and unitary vector spaces,
Linear Algebra II 9 CP principal axis transformation, symmetric maps, and geometric applications, multi-linear algebra.
(Lineare Algebra II) Following topics are optional: representation theory of chosen symmetry groups, generalized
vector spaces (modules), linear optimization.
V1G5 Compulsory Basic algorithms and introduction to programming: What are algorithms?, Computability,
Algorithmic 9 CP implementation of algorithms, basic concepts of programming. Introduction to programming,
Mathematics I elementary algorithms (e.g. Euclidean algorithm), representation of numbers: integers, floating
(Algorithmische points; rounding errors; stability and complexity; sorting algorithms,
Mathematik I) Discrete algorithms: Graphs, trees, arborescences, connectivity, BFS and DFS, bipartite, acyclic,
strongly connected graphs; linked lists; tree data structures; heaps; shortest paths, network flows,
max-flow-min-cut-theorem, algorithms by Ford-Fulkerson and Edmond-Karp; bipartite matching;
 Module Area Content
Algorithms for solving systems of linear equations: basics: matrix norms, absolute and relative
condition; algorithms: Gaussian elimination, LU-decomposition, pivoting, Cholesky-decomposition,
band matrices; introduction to linearized theory of errors: forward and backward analysis, stability
V1G6 Compulsory Elementary probability theory: concept of probability, basic models and combinatorics,
Algorithmic 9 CP expectation and variance, conditional probability, independence, weak law of large numbers,
Mathematics II random walk, Markov chains and transition matrices.
(Algorithmische Stochastic simulation: pseudo random numbers, Monte Carlo method, Metropolis algorithm.
Mathematik II) Interpolation and approximation: interpolation: Lagrange, Hermite, divided differences,
trigonometric interpolation (DFT, FFT); estimation of errors; choosing points of support; numerical
integration: Newton-Cotes formulas, Romberg integration, adaptivity.
Iteration methods for large systems of linear and non-linear equations: iterative solutions for
systems of linear equations: Richardson, Jacobi, Gauss-Seidel; fixed point iteration; nonlinear
minimization and calculation of zeroes: bisection method, secant method, regula falsi, Newton
method (multidimensional).
V2A1 A Groups and rings (basics), modules of (non-commutative) rings, homological algebra, Galois
Introduction to 9 CP theory
Algebra
(Einführung in die
Algebra)
V2A2 A Syntax and semantics of predicate logic, deduction systems: term models; Gödels completeness
Introduction to 9 CP theorem; theories and model classes; axioms of Zermelo Fraenkel set theory; formalization of
Mathematical Logic basic notions in mathematics.
(Einführung in die Optional topics: deepening of sentential logic, alternative deduction systems; logical
Mathematische Logik) programming; Gödels incompleteness theorems; logical investigation of logical theories;
V3A1 A Groups and rings (deepening), field theory, Galois theory and applications.
Algebra I 9 CP
V3A2 A Selected topics of algebra, for example, algebraic number theory, representation theory,
Algebra II 9 CP commutative algebra, Lie algebras
V3A3 Foundations in A Basic concepts of module theory, introduction to classical classification problem in representation
Representation Theory 9 CP theory
(Grundzüge der
Darstellungstheorie)
V3A4 Foundations in 9 CP classical topics in analytic or algebraic number theory, e.g. prime number theory, zeta- and L-
Number Theory functions, geometry of numbers, sieve methods, arithmetic in Dedekind domains, elements of
(Grundzüge der class field theory.
Zahlentheorie)
 Module Area Content
V3A5 Mathematical 9 CP selected chapters of mathematical logic, e.g. model theory, set theory, computability theory.
Logic
(Mathematische Logik)
V2B1 B Integration theory and applications: Lebesgue integral, especially for the n-dimensional
9 CP Lebesgue-measure (also for counting measure and Dirac-measure), theorems of monotone and
Analysis III dominated convergence, Fubini's theorem for the Lebesgue-measure, transformation formula,
surfaces in the Euclidean space and surface integrals, Gauss's and Stokes's theorems.
V2B2 B Standard differential equations and classical solution methods (fundamental solutions, Fourier-
Introduction to PDEs 9 CP Transformation):
(Einführung in die Laplace equation: reference to electro statics (gradient and divergence), boundary value problems
partiellen and their representation with the help of potentials, characteristics of harmonic functions (mean
Diffentialgleichungen) value, maximum, analyticity), Dirichlet's principle
Heat equation: initial (boundary) value problem, fundamental solution, integral representation of
solutions
Wave equation: initial (boundary) value problem, conservation of energy, integral representation
of the solution
V2B3 B Holomorphic functions, power series, curve integrals, Laurent-series, Riemann's lifting theorem,
Introduction to 9 CP essential singularities, Weierstrass's theorem of products and Mittag-Leffler's theorem, Runge-
Complex Analysis and Mergelyan approximation, Hadamard factorization theorem, Riemann's mapping theorem,
(Einführung in die prospects for the theory of several complex variables, application to selected functions, e.g.
komplexe Analysis) gamma-functions and elliptic functions
V3B1 B Functional analysis: Banach spaces and Hilbert spaces, Lax-Milgram's theorem, Sobolev spaces, in
PDEs and Functional 9 CP particular embedding theorems and trace theorems, weak convergence, weak sequential
Analysis compactness, spectral theorem for symmetric operators with compact inverse.
(Partielle Differential- Calculus of variations and elliptic PDEs: Elliptic differential equations with nonconstant
gleichungen und coefficients, weak and variational formulations for Dirichlet and Neumann problems, existence of
Funktionalanalysis) minimizers, L2-regularity theory.
V3B2 B Selection of one or more of the following topics:
PDEs and Modeling 9 CP 1. PDEs in fluid dynamics
(Partielle Differentiel- 2. PDEs for free boundary value problems and image processing
gleichungen und 3. PDEs and mathematical physics
Modellierung) 4. PDEs in material science
V3B3 B Distribution and Fourier-Transformation, oscillating integral, operators of Fourier-integrals,
Global Analysis 9 CP pseudo-differential operators, Sobolev spaces on Manifolds, embedding theorems, regularity
(Globale Analysis) theorem of elliptic equations on manifolds, spectral theorem for elliptic operators on closed
manifolds, applications, for example, Hodge Theory.
 Module Area Content
V2C1 C Branchings, network flows, Goldberg-Tarjan algorithm, minimum cuts, connectivity, minimum cost
Introduction to 9 CP flows, applications of flows and networks, bipartite matching, multi commodity flows and disjoint
Discrete Mathematics paths
(Einführung in die
Diskrete Mathematik)
V3C1 C Modeling of optimization problems as (integer) linear programs, polyhedron, Fourier-Motzkin
Linear and Integer 9 CP elimination, Farkas' lemma, duality theorems, the simplex algorithm, network simplex, ellipsoid
Optimization method, conditions for integer polyhedra, TDI systems, total unimodularity, cutting plane methods
(Lineare und
Ganzzahlige
Optimierung)
V3C2 C Combinatorics of finite sets, basic counting theory, graphs, trees, circuits, connectivity, planarity,
Combinatorics, 9 CP coloring of graphs, matroids, planar and combinatorial duality
Graphs, Matroids

(Kombinatorik,
Graphen, Matroide)
V2D1 D Metric and topological spaces and their construction; concept of connectedness, separation
Introduction to 9 CP axioms, compactness. Manifolds, especially surfaces and 3-manifolds, curves and surfaces in
Geometry and spaces, their local geometry; geodetic coverings and fundamental group.
Topology
(Einführung in die
Geometrie und
Topologie)
V3D1 D Singular homology groups with integer and or abitrary coefficients; axioms of homology theory,
Topoplogy I 9 CP cw-complexes and cellular homology, computation of the homology for selected important
(Topologie I) spaces, such as spheres, projective spaces and surfaces. degree of maps and its application,
universal coefficient theorem and Kuenneth-theorem
V3D2 D Singular cohomology groups with coefficients in commutative rings; axioms of cohomology
Topology II 9 CP theory. computation of the cohomology groups of some spaces, DeRahm cohomology. Universal
(Topologie II) coefficient theorem and Kuenneth-theorem. cup-product and ring structure of the cohomology.
Cap-product and Poincare duality for manifolds. Higher homotopy groups, Hurewicz's theorem
and Whitehead's theorem
V3D3 D manifolds, tangent space, vector fields, Lie bracket and derivative, integration of vector fields,
Foundations in 9 CP metrics, tensor calculus, connections on vector bundles, Stokes’ Theorem optional (depending on
Geometry and Analysis preferences of the lecturer): geodesics, geodesic vs. metric completeness, de Rham cohomology,
 Module Area Content
on Manifolds Theorem of Gauß-Bonnet, Poincaré Hopf Index Theorem
(Grundzüge der
Analysis und
Geometrie auf
Mannigfaltigkeiten)
V3D4 D Relations between geometry and topology, symmetries
Geometry 9 CP
(Geometrie)
V2E1 E Linear system solvers: sparse systems, gradient methods, cg, gmres, linear regression;
Introduction to the 9 CP Eigenvalue computations: vector iteration, qr-method, krylov subspace methods, svd;
Basics in Numerical Numerical integration: Gaussian quadrature, more dimensional integration, Monte-Carlo methods
Mathematics
(Einführung in die
Grundlagen der
Numerik)
V2E2 E Nonlinear programming: Lagrange multipliers, KKT-systems, numerical methods;
Introduction to 9 CP Splines: B-splines, Bezier curves, cadg;
Numerical Numerical methods for ode's: one step methods, more step methods, consistency, stability
Mathematics
(Einführung in die
Numerische
Mathematik)

V3E1 E Mathematical modelling: first principles, conserved quantities, scaling aspects (dimensional
Scientific Computing I 9 CP analysis, homogenization, filtering);
(Wissenschaftliches Classification of pde's and discretization: finite differences, finite elements, adaptivity, error
Rechnen I) estimators

V3E2 E Spectral methods, finite volume, continuous and discontinuous Galerkin, coupling of transport and
Scientific Computing II 9 CP diffusion, fast solvers for sparse systems, multi-grid and multi-level methods, domain
(Wissenschaftliches decomposition. Parallelizing; strategies and load-balancing
Rechnen II)
V2F1 F Probability spaces and random variables, standard models. Conditional probabilities,
Introduction to 9 CP independence, Borel-Cantelli lemma, random walks and difference equations. Expectation,
Probability Theory variance and co-variance. Laws of large numbers, notions of convergence for random variables.
(Einführung in die Moment generating and characteristic functions, multivariate normal distribution, central limit
 Module Area Content
Wahrscheinlichkeits- theorem. Basics of statistics: maximum likelihood principle, basic methods for estimation and
theorie) hypothesis testing, confidence intervals. Entropy and statistical distinguishability, exponential
families.
V2F2 F Statistics: parametric, non-parametric and Bayesian models, model choice, robustness. Mean
Introduction to 9 CP square error of estimators, information inequality, connection to Fisher information and relative
Statistics entropy. Level and power of hypothesis tests, Neyman-Pearson lemma. Confidence intervals and
(Einführung in die tests in Gaussian product models. Consistency of maximum likelihood, asymptotic power of
Statistik) likelihood quotient tests. Asymptotic normality of ML estimators. Convergence of empirical
distributions, normal approximation of multinomial distribution, goodness of fit tests and their
asymptotics, tests for independence, regression, analysis of variance. Optional: Basics of
mathematical finance.
V3F1 F Conditional expectations, conditional densities, transition probabilities. Markov chains in discrete
Stochastic Processes 9 CP time: Construction, Dirichlet problem, recurrence and transience, convergence to equilibrium,
(Stochastische ergodicity, reversible Markov chains and Markov Chain Monte Carlo methods, Ising model.
Prozesse) Poisson processes and Markov chains in continuous time, forward and backward equation.
Brownian motion: Motivation as scaling limit of random walks, marginal laws, connection to the
heat equation, existence theorem of Kolmogorov. Wiener-Lévy construction, scale invariance and
symmetries, regularity of sample paths. Large deviations: Cramér's theorem, Sanov's theorem on
finite state spaces.
V3F2 F Martingales: Optional stopping, ruin problem, discrete stochastic integrals, convergence
Foundations in 9 CP theorems, application to Markov chains, regularity and bounds for martingales in continuous time.
Stochastic Analysis Itô calculus: Quadratic variation of Brownian motion, stochastic integrals with respect to
(Grundzüge der Brownian motion, Itô's formula, Martingales of Brownian motion, Lévy's characterization,
stochastischen stochastic representation for solutions of the Dirichlet problem and the heat equation, exit and
Analysis) passing times, integration with respect to Brownian semimartingales, Feyman-Kac formula,
Girsanov transform.