Skip to main content

CBE Nexus · Global Mathematics · Graduate pathway

Postgraduate Mathematics

Advanced study notes and graduate problem sets for Master's and doctoral learners. The pathway spans pure mathematics, applied analysis, probability, computation and mathematical research.

← Back to Global Mathematics

Academic level and use

This is a graduate-level learning framework, not an accredited degree, official university syllabus, or substitute for a supervisor's guidance. Course depth and prerequisites differ by institution and research area. Learners should compare each module with their programme handbook and current course syllabus.

Postgraduate expectation: Work from definitions and hypotheses, prove central results, test the limits of theorems with counterexamples, connect results across fields, and communicate arguments in precise mathematical language. Computational work must record methods, software, parameters and verification checks.

Prerequisite profile: Strong undergraduate real analysis, linear algebra, abstract algebra, topology, probability and proof writing. Individual modules may require more specialised preparation.

01

Postgraduate topic 1 of 20

Measure theory and integration

Constructing measures and Lebesgue integration on abstract measure spaces.

Advanced study scope

Sigma-algebras; outer measure and Carathéodory extension; measurable functions; Lebesgue integral; monotone, Fatou and dominated convergence; product measures and Fubini–Tonelli; Radon–Nikodym and signed measures; modes of convergence; Lp spaces and duality.

Core theorems, methods and standards

Carathéodory extension theorem; monotone convergence; Fatou lemma; dominated convergence; Radon–Nikodym theorem; Fubini–Tonelli theorem.

Graduate problem set

  1. Let (X,Σ,μ) be a measure space. Prove that if f_n increases pointwise to f with f_n≥0, then ∫f_n dμ increases to ∫f dμ. State precisely where measurability is used.
  2. Construct a measurable function sequence that converges pointwise but for which the integrals do not converge to the integral of the pointwise limit. Identify the missing hypothesis.
  3. Prove that Lp(μ) is complete for 1≤p≤∞, or identify the additional assumptions needed for your chosen proof.
  4. For a finite measure space, compare convergence almost everywhere, in measure, and in Lp. Prove the valid implications and give counterexamples to the converses.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

02

Postgraduate topic 2 of 20

Functional analysis and operator theory

Study Banach and Hilbert spaces, bounded operators and spectral structure.

Advanced study scope

Normed spaces and completions; dual spaces; Hahn–Banach separation; uniform boundedness, open mapping and closed graph theorems; weak and weak-star topologies; compact operators; adjoints; spectrum and resolvent; self-adjoint and normal operators; Fredholm theory; unbounded operators and domains.

Core theorems, methods and standards

Hahn–Banach theorem; Banach–Steinhaus; open mapping theorem; spectral theorem for compact self-adjoint operators; Fredholm alternative.

Graduate problem set

  1. Prove that every bounded linear functional on a Hilbert space has a unique Riesz representation. Explain why completeness is essential.
  2. Let T be compact on an infinite-dimensional Banach space. Prove that T cannot be boundedly invertible on the whole space.
  3. For a bounded operator T, establish that the spectrum is nonempty and compact over a complex Banach space, stating the analytic ingredients.
  4. Construct an operator whose range is not closed and analyse how this obstructs a bounded inverse.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

03

Postgraduate topic 3 of 20

Advanced real and complex analysis

Develop higher analysis through differentiation, integration, harmonicity and complex function theory.

Advanced study scope

Uniform and absolute convergence; equicontinuity and Arzelà–Ascoli; implicit and inverse function theorems; Fourier analysis; distributions; harmonic and subharmonic functions; Cauchy theory and residues; normal families; analytic continuation; conformal maps; Riemann surfaces and meromorphic differentials.

Core theorems, methods and standards

Arzelà–Ascoli theorem; inverse function theorem; Cauchy integral formula; residue theorem; maximum modulus principle; Montel theorem; identity theorem.

Graduate problem set

  1. Use the residue theorem to evaluate an explicitly chosen real integral with poles off the real axis. Justify contour choice and limiting arc contribution.
  2. Prove a normal-family convergence result using Montel's theorem, and distinguish local uniform convergence from pointwise convergence.
  3. Show how a distributional derivative extends classical differentiation and compute the distributional derivative of a piecewise smooth function with a jump.
  4. State and prove a version of the identity theorem, then apply it to analytic continuation on a connected domain.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

04

Postgraduate topic 4 of 20

Advanced linear and multilinear algebra

Investigate vector spaces, tensor constructions, canonical forms and structure-preserving maps.

Advanced study scope

Duality and annihilators; tensor, symmetric and exterior algebras; multilinear maps; canonical forms; Jordan and rational canonical forms; bilinear and sesquilinear forms; spectral decompositions; matrix perturbation; singular values; determinants and exterior powers.

Core theorems, methods and standards

Rank–nullity; Jordan decomposition over suitable fields; Cayley–Hamilton; spectral theorem; canonical-form uniqueness statements.

Graduate problem set

  1. Derive the Jordan form of a parameterised family of matrices and identify parameter values where the Jordan structure changes.
  2. Prove the singular value decomposition for a finite-dimensional complex inner-product space and explain its relation to the spectral theorem for A* A.
  3. Use tensor products to express a bilinear map as a linear map on a tensor product; verify the universal property.
  4. Classify nondegenerate symmetric bilinear forms over the real numbers and explain which parts change over other fields.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

05

Postgraduate topic 5 of 20

Ring, field and module theory

Build structural algebra from ideals, modules, field extensions and exact sequences.

Advanced study scope

Ideals and quotient rings; Noetherian and Artinian conditions; PID and UFD; localization; modules and presentations; tensor products; exact sequences; field extensions; splitting fields; separability; Galois groups; integral extensions; commutative algebra foundations.

Core theorems, methods and standards

Isomorphism theorems; Hilbert basis theorem; structure theorem for finitely generated modules over a PID; fundamental theorem of Galois theory; Nakayama lemma.

Graduate problem set

  1. Prove the structure theorem for finitely generated modules over a PID in a form suitable for classifying finitely generated abelian groups.
  2. Compute a Galois group for a selected polynomial over Q and justify the group identification using factorisation and resolvents or a valid alternative.
  3. Give an example showing why localisation can simplify a module or ring problem; compute the localisation explicitly.
  4. Use Nakayama's lemma to prove a finite-generation result for a local ring, carefully stating the hypotheses.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

06

Postgraduate topic 6 of 20

Advanced group theory and representation theory

Study groups through actions, structure, characters and representations.

Advanced study scope

Group actions and orbit-stabiliser; Sylow theory; solvable and nilpotent groups; finite simple groups overview; group extensions; modules over group algebras; representations and complete reducibility; Schur's lemma; characters and orthogonality; induced representations; Lie groups and Lie algebras.

Core theorems, methods and standards

Class equations; Sylow theorems; Maschke theorem; Schur's lemma; character orthogonality relations.

Graduate problem set

  1. Decompose a representation of a finite group over C into irreducibles and calculate multiplicities using character inner products.
  2. Prove Maschke's theorem and explain exactly why the characteristic condition matters.
  3. Classify groups of a specified small order using Sylow constraints, explicitly showing all cases and exclusions.
  4. Use a group action to derive a counting identity and explain how the orbit decomposition yields it.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

07

Postgraduate topic 7 of 20

Algebraic and analytic number theory

Connect arithmetic structures with analytic tools and distribution of primes.

Advanced study scope

Dedekind domains and ideals; algebraic integers; norms and traces; ideal class groups; units; splitting of primes; zeta and L-functions; Dirichlet characters; analytic properties of the zeta function; prime number theorem framework; sieve methods; Diophantine approximation and modular forms introductions.

Core theorems, methods and standards

Unique factorisation of ideals in Dedekind domains; Dirichlet unit theorem; quadratic reciprocity; Euler product in its convergence region; analytic continuation results at stated scope.

Graduate problem set

  1. Prove quadratic reciprocity using one complete method and identify the auxiliary results on which the proof depends.
  2. Explain the Euler product for ζ(s), establish its initial domain of absolute convergence and show how unique factorisation enters.
  3. For a quadratic number field, compute its ring of integers, discriminant and factorisation of selected rational primes.
  4. Compare an elementary and an analytic strategy for a prime-distribution question; state what each method can and cannot establish.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

08

Postgraduate topic 8 of 20

Algebraic topology and homological methods

Use algebraic invariants to distinguish spaces and organise geometric information.

Advanced study scope

Fundamental groups and covering spaces; singular and cellular homology; chain complexes; exact sequences; homotopy invariance; excision; Mayer–Vietoris; cohomology and cup products; universal coefficient and Künneth theorems; spectral sequences at introductory level; derived functor viewpoint.

Core theorems, methods and standards

Van Kampen theorem; homotopy invariance; long exact sequence; Mayer–Vietoris; cellular homology theorem; universal coefficient theorem.

Graduate problem set

  1. Compute homology groups of a finite CW complex from its cellular chain complex, showing boundary maps and kernels/quotients.
  2. Use van Kampen's theorem to compute the fundamental group of a space formed by gluing two path-connected spaces along a path-connected intersection.
  3. Construct a chain homotopy in a simple example and prove that chain-homotopic maps induce the same map on homology.
  4. Explain how a spectral sequence organises a filtered complex and work through a small illustrative filtration.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

09

Postgraduate topic 9 of 20

Differential geometry and manifolds

Develop smooth manifolds, tangent structures, differential forms and curvature.

Advanced study scope

Charts and atlases; tangent and cotangent bundles; vector fields and flows; tensors; differential forms and exterior derivative; Stokes theorem; submanifolds and transversality; Riemannian metrics; geodesics; connections; curvature; Lie derivatives; bundles and characteristic classes.

Core theorems, methods and standards

Inverse function theorem; Stokes theorem on manifolds; Frobenius theorem; existence and uniqueness of geodesics under standard hypotheses; Gauss–Bonnet in suitable settings.

Graduate problem set

  1. Prove that the exterior derivative is coordinate-independent and verify d²=0 in local coordinates.
  2. Derive the geodesic equation from the energy functional for a Riemannian metric and explain the role of the Levi-Civita connection.
  3. Compute the curvature tensor of a standard constant-curvature model and interpret sectional curvature.
  4. Apply Stokes' theorem on an oriented manifold with boundary, checking orientation conventions.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

10

Postgraduate topic 10 of 20

Algebraic geometry

Study algebraic varieties and schemes through commutative algebra and geometry.

Advanced study scope

Affine and projective varieties; Zariski topology; coordinate rings; Nullstellensatz; morphisms; rational maps; local rings; divisors and line bundles; dimension and regularity; schemes and sheaves; sheaf cohomology; intersection theory; curves and Riemann–Roch.

Core theorems, methods and standards

Hilbert basis theorem; Nullstellensatz; correspondence between affine varieties and radical ideals over an algebraically closed field; Riemann–Roch for smooth projective curves.

Graduate problem set

  1. For a specified ideal in k[x,y], determine its variety and radical, stating assumptions on k and using the Nullstellensatz appropriately.
  2. Explain the affine variety–coordinate ring correspondence and demonstrate how a morphism induces a ring homomorphism.
  3. Compute the genus of a smooth projective plane curve using the appropriate theorem and verify smoothness.
  4. Compare Weil divisors and Cartier divisors on a normal variety, giving a case where the distinction matters.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

11

Postgraduate topic 11 of 20

Advanced partial differential equations

Analyse existence, uniqueness, regularity and qualitative behaviour of PDE solutions.

Advanced study scope

Distributional solutions; Sobolev spaces and embeddings; weak formulations; elliptic regularity; Lax–Milgram; maximum principles; energy estimates; hyperbolic equations and finite propagation; parabolic smoothing; conservation laws; weak solutions; nonlinear PDE and variational methods.

Core theorems, methods and standards

Lax–Milgram theorem; Sobolev embedding; Rellich–Kondrachov compactness; maximum principles; energy methods; selected elliptic regularity theorems.

Graduate problem set

  1. Derive the weak formulation of a second-order elliptic boundary-value problem and prove uniqueness using coercivity.
  2. Establish an energy estimate for the heat equation with homogeneous boundary conditions and explain the boundary terms.
  3. State the assumptions of a Sobolev embedding used in a regularity argument and show why the dimension matters.
  4. Compare weak and classical solutions for a conservation law; construct or analyse a shock using entropy conditions.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

12

Postgraduate topic 12 of 20

Stochastic processes and martingales

Develop stochastic processes using filtrations, conditional expectation and martingale methods.

Advanced study scope

Probability spaces and filtrations; conditional expectation; stopping times; discrete and continuous martingales; optional sampling; Doob inequalities; martingale convergence; Brownian motion; quadratic variation; stochastic integration; Itô formula; Markov processes and stochastic differential equations.

Core theorems, methods and standards

Doob martingale convergence theorem; optional stopping under suitable conditions; Doob inequalities; martingale representation in specified settings; Itô formula.

Graduate problem set

  1. Prove the optional stopping theorem for a clearly stated bounded stopping-time setting and explain why unbounded stopping requires extra conditions.
  2. Show that a simple random walk stopped at a suitable hitting time is a martingale; calculate the stopping expectation where justified.
  3. Use Itô's formula on a twice differentiable function of Brownian motion and derive the associated drift and martingale terms.
  4. Establish a martingale convergence result under a stated uniform-integrability or boundedness assumption.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

13

Postgraduate topic 13 of 20

Advanced probability and statistics

Unify probability theory, asymptotics, inference and modern statistical reasoning.

Advanced study scope

Weak convergence and tightness; characteristic functions; LLN and CLT; large deviations; conditional distributions; Bayesian and frequentist inference; sufficiency and exponential families; likelihood asymptotics; hypothesis testing; empirical processes; concentration inequalities; nonparametric methods.

Core theorems, methods and standards

Prokhorov theorem; continuous mapping and Slutsky theorems; central limit theorem; Le Cam or likelihood asymptotic results at stated scope; concentration inequalities.

Graduate problem set

  1. Prove a weak-convergence result using characteristic functions and state the continuity conditions required.
  2. Derive the asymptotic distribution of a maximum-likelihood estimator under regularity assumptions, identifying each assumption used.
  3. Compare consistency, asymptotic normality and efficiency with a concrete estimator example.
  4. Construct a concentration bound for a sum of independent bounded random variables and discuss sharpness.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

14

Postgraduate topic 14 of 20

Ergodic theory and dynamical systems

Analyse long-term behaviour of measure-preserving and smooth dynamical systems.

Advanced study scope

Measure-preserving transformations; recurrence; ergodicity and mixing; Birkhoff averages; invariant measures; symbolic dynamics; entropy; rotations and shifts; hyperbolic systems; stable and unstable manifolds; Lyapunov exponents; ergodic decompositions.

Core theorems, methods and standards

Poincaré recurrence theorem; Birkhoff ergodic theorem; von Neumann mean ergodic theorem; entropy inequalities at the appropriate level.

Graduate problem set

  1. Prove Poincaré recurrence for a finite measure-preserving system and explain the finiteness assumption.
  2. Apply Birkhoff's theorem to an ergodic transformation and interpret almost-sure time averages.
  3. Distinguish ergodicity, mixing and weak mixing by definitions and examples.
  4. Analyse the invariant measures of a simple circle rotation and determine when the system is ergodic.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

15

Postgraduate topic 15 of 20

Advanced numerical analysis

Study stability, convergence and error for numerical approximation of mathematical problems.

Advanced study scope

Conditioning and stability; floating-point error; polynomial approximation; quadrature; interpolation; iterative linear solvers; eigenvalue algorithms; finite difference and finite element methods; consistency and convergence; stiffness; adaptive methods; a posteriori error estimation; reproducible computational experiments.

Core theorems, methods and standards

Lax equivalence theorem in its applicable setting; convergence of selected iterative schemes; error bounds for quadrature and approximation; stability analysis.

Graduate problem set

  1. Derive a truncation-error estimate for a finite-difference scheme and determine its order of consistency.
  2. Analyse convergence and stability of an iterative method for solving Ax=b, relating the spectral radius to convergence.
  3. Compare finite difference and finite element formulations for a boundary-value problem, including approximation spaces and error norms.
  4. Design a reproducible numerical experiment that separates discretisation error, solver error and floating-point effects.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

16

Postgraduate topic 16 of 20

Convex and nonlinear optimisation

Connect geometry, duality, optimality conditions and algorithms.

Advanced study scope

Convex sets and functions; separation; subgradients; conjugate functions; Fenchel duality; KKT conditions; constraint qualifications; linear and semidefinite programming; proximal methods; gradient and Newton methods; nonsmooth and nonconvex optimisation; convergence analysis.

Core theorems, methods and standards

Supporting hyperplane theorem; separation theorems; KKT conditions under stated constraint qualifications; strong duality under suitable assumptions.

Graduate problem set

  1. Derive the Lagrange dual of a constrained convex optimisation problem and establish conditions for strong duality.
  2. Prove first-order optimality for a differentiable convex function on a convex set and explain when it is sufficient.
  3. Analyse convergence of gradient descent under Lipschitz-gradient and strong-convexity assumptions.
  4. Give an example where KKT conditions fail to be sufficient because a required regularity or convexity assumption is absent.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

17

Postgraduate topic 17 of 20

Mathematical logic and set theory

Explore formal languages, proof systems, models, computability and foundations.

Advanced study scope

Propositional and first-order logic; syntax and semantics; soundness and completeness; compactness; model theory; computability and undecidability; axiomatic set theory; ordinals and cardinals; choice principles; forcing and independence at an introductory graduate level.

Core theorems, methods and standards

Soundness and completeness theorems; compactness theorem; Cantor theorem; recursion theorems; Gödel incompleteness theorems at stated scope.

Graduate problem set

  1. Prove compactness for first-order logic or give a detailed proof outline identifying the role of finite satisfiability.
  2. Construct a model-theoretic argument showing that a theory has a model under specified consistency assumptions.
  3. Explain the first incompleteness theorem and distinguish syntactic consistency from semantic truth.
  4. Compare the axiom of choice, Zorn's lemma and well-ordering theorem by proving their equivalence within ZF.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

18

Postgraduate topic 18 of 20

Research seminars, literature review and proof writing

Move from learning established theory to communicating and evaluating mathematical research.

Advanced study scope

Reading research papers; identifying definitions and dependencies; theorem-proof architecture; counterexample design; mathematical exposition; LaTeX; seminar talks; referee-style critique; citation practice; open-problem framing; research proposal and oral defence.

Core theorems, methods and standards

No single universal theorem: assessment focuses on correct reconstruction, logical completeness, attribution, critical comparison and a defensible research question.

Graduate problem set

  1. Select a theorem from a research paper and write a self-contained proof map: prerequisites, lemmas, dependencies, main argument and limitations.
  2. Prepare a critical literature review comparing at least three research papers on one narrowly defined mathematical question; distinguish established results from conjectures.
  3. Rewrite a dense proof for clarity without weakening hypotheses or omitting logical steps; annotate every dependency.
  4. Deliver a 20-minute seminar plan with motivation, precise statements, proof architecture, examples and open questions.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

19

Postgraduate topic 19 of 20

Research design, reproducibility and scholarly communication

Design mathematical research that is transparent, verifiable and responsibly communicated.

Advanced study scope

Research question and scope; literature search strategy; proof verification; computational mathematics; code and data provenance; version control; numerical reproducibility; research integrity; authorship and citation; preprints and peer review; LaTeX manuscripts; open research artefacts.

Core theorems, methods and standards

Research quality is judged through verifiable reasoning, transparent methods, accurate attribution, reproducible computation where applicable and clear communication—not a single theorem.

Graduate problem set

  1. Write a research protocol for a computational mathematics project specifying algorithms, software versions, parameters, test cases, error checks and archival artefacts.
  2. Audit a mathematical manuscript for unsupported claims, missing assumptions, citation gaps and non-reproducible computational results.
  3. Design a version-controlled workflow for a collaborative proof or computational project, including review and release practices.
  4. Draft an abstract and methods section that distinguish theorem-proof results from numerical evidence and conjectural interpretation.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

20

Postgraduate topic 20 of 20

Dissertation and doctoral research

Plan, execute and defend a substantial original mathematical investigation.

Advanced study scope

Problem selection and significance; proposal and research questions; background and literature review; preliminary lemmas; originality and contribution; proof or computational methodology; chapter architecture; limitations; publication strategy; supervisor and committee feedback; thesis writing and oral defence.

Core theorems, methods and standards

A dissertation must make a clearly delimited, defensible contribution appropriate to its degree and institution; originality, scope and examination rules are programme-specific.

Graduate problem set

  1. Draft a dissertation proposal with problem statement, motivation, literature gap, precise objectives, methods, expected contribution, risks and timeline.
  2. Construct a chapter plan for a thesis proving a new result, showing where definitions, lemmas, main theorem, examples and limitations belong.
  3. Prepare an oral-defence examination with questions probing novelty, assumptions, proof gaps, alternative approaches and future work.
  4. Write a reproducibility and verification appendix for a thesis containing computational experiments or computer-assisted proofs.

Expected postgraduate standard: State all hypotheses; define notation; justify every inference; distinguish theorem, conjecture and example; provide complete proofs or a transparent computational argument; cite sources for results not proved.

Extended lecture framework for all 20 postgraduate topics

Each topic now has a dedicated graduate lecture framework for formal definitions, theorem proof development, worked-example method and assessed exercises. Topic-specific proof solutions and extended problem banks should be developed alongside these frameworks.

Lecture 1: Measure theory and integration

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 2: Functional analysis and operator theory

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 3: Advanced real and complex analysis

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 4: Advanced linear and multilinear algebra

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 5: Ring, field and module theory

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 6: Advanced group theory and representation theory

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 7: Algebraic and analytic number theory

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 8: Algebraic topology and homological methods

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 9: Differential geometry and manifolds

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 10: Algebraic geometry

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 11: Advanced partial differential equations

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 12: Stochastic processes and martingales

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 13: Advanced probability and statistics

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 14: Ergodic theory and dynamical systems

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 15: Advanced numerical analysis

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 16: Convex and nonlinear optimisation

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 17: Mathematical logic and set theory

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 18: Research seminars, literature review and proof writing

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 19: Research design, reproducibility and scholarly communication

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Lecture 20: Dissertation and doctoral research

Definitions and foundations

Begin with precise definitions, ambient spaces, domains, codomains, regularity assumptions and notation. State all standing hypotheses before using any result. Distinguish algebraic, topological, measure-theoretic and analytic structures relevant to this subject.

Theorem and proof development

For each central theorem in this area, write the exact statement with every hypothesis, identify prerequisite lemmas, prove each implication, and explain where completeness, compactness, measurability, finite dimensionality or other assumptions enter. Include a counterexample when an essential hypothesis is removed.

Worked-example method

Develop a nontrivial example from the definitions, compute intermediate objects explicitly, justify each transformation and verify the final result independently. Include a second example where a tempting method fails and explain the obstruction.

Graduate exercise and marking guide

Exercise: formulate and prove a proposition in this topic, then apply it to a new example and construct a counterexample to an overgeneralised version. Marking: definitions and hypotheses 20%; proof structure 35%; calculations or construction 20%; counterexample and limitations 15%; mathematical exposition and citations 10%.

Additional Master's and doctoral mathematical problem bank

Fresh, calculation-led and proof-oriented problems extending the existing graduate lectures and sample examinations. State all hypotheses, justify theorem use, and distinguish a numerical observation from a rigorous conclusion.

Real analysis, measure theory and functional analysis

  1. Uniform integrability (12 marks). Let (fn) be a family in L¹(μ). State the definition of uniform integrability and prove that Lp-boundedness for some p>1 on a finite measure space implies uniform integrability. Give an example showing why an L¹ bound alone is insufficient.
  2. Weak convergence (12 marks). In a Hilbert space H, prove that every weakly convergent sequence is norm-bounded. Then show that weak convergence need not imply norm convergence by constructing a sequence in ℓ².
  3. Compact operators (12 marks). Let T be compact and self-adjoint on an infinite-dimensional Hilbert space. Prove that every nonzero spectral value is an eigenvalue of finite multiplicity and explain why 0 may remain in the spectrum.
  4. Fourier analysis (12 marks). For f(x)=x on (−π,π), compute its Fourier coefficients, establish the pointwise convergence value at the jump under the Dirichlet theorem, and discuss convergence in L².

Algebra, topology and geometry

  1. Galois theory (12 marks). Determine the splitting field and Galois group of x⁴−2 over ℚ. Identify the real and complex roots, describe generators of the extension and justify the degree.
  2. Modules over a PID (12 marks). Classify the finitely generated abelian group ℤ/12ℤ ⊕ ℤ/18ℤ in invariant-factor form. Determine its order, exponent and number of elements of order exactly 6.
  3. Fundamental group (12 marks). Use van Kampen's theorem to compute the fundamental group of a wedge of two circles. Describe the reduced-word representation and explain why the group is non-abelian.
  4. Differential geometry (12 marks). For the surface z=f(x,y) with f(x,y)=½(ax²+by²), compute the first and second fundamental forms at the origin and determine the principal curvatures with a consistent choice of unit normal.

Probability, PDE and stochastic analysis

  1. Conditional expectation (12 marks). Let X be integrable and 𝒢 a sub-σ-algebra. Prove the defining uniqueness of E[X|𝒢] almost surely and derive the tower property for 𝒢⊂ℋ. Identify where integrability is used.
  2. Brownian motion (12 marks). For standard Brownian motion Bt, use Itô's formula to derive the stochastic differential of exp(λBt−½λ²t). Explain why the resulting process is a martingale and state any integrability or localisation qualification needed.
  3. Elliptic PDE (12 marks). Consider −Δu=f in a bounded domain Ω with homogeneous Dirichlet boundary conditions. Formulate the weak problem in H₀¹(Ω), prove uniqueness using the energy method, and state conditions sufficient for existence by Lax–Milgram.
  4. Heat equation (12 marks). Solve ut=κuxx on 0<x<L with zero Dirichlet boundary conditions and initial data u(x,0)=sin(2πx/L). Derive the solution and its decay rate.

Numerical analysis, optimisation and research mathematics

  1. Finite-element error (12 marks). For a coercive variational problem and conforming finite-element space Vh, state Céa's lemma and derive the quasi-optimal energy-norm estimate. Explain how interpolation estimates convert it into an h-rate.
  2. Convex duality (12 marks). Derive the Fenchel dual of minimising f(x)+g(Ax), state conditions for strong duality, and apply the result to a quadratic least-squares objective with an ℓ¹ penalty.
  3. Concentration inequality (12 marks). State Hoeffding's inequality for independent bounded random variables and use it to derive a sample-size bound ensuring P(|X̄−E X̄|≥ε)≤δ. Explain the role of boundedness and independence.
  4. Research-level counterexample (12 marks). Construct an explicit sequence of functions that converges pointwise but not uniformly on [0,1]. Determine whether convergence holds in L¹, and explain how the example demonstrates the distinction between pointwise and uniform convergence.

Graduate marking standard: definitions and hypotheses 15%; mathematical derivation/proof 40%; correct computation 20%; counterexamples or interpretation 15%; exposition and notation 10%. In research problems, cite any theorem imported rather than proved.

Hidden worked answers — reveal after attempting

Select “Show answer” to reveal the solution; select again to hide it.

Show answer 1

Uniform integrability: supₙ∫{|fₙ|>K}|fₙ|→0. Lᵖ boundedness p>1 gives tail ≤CᵖK¹⁻ᵖ. L¹ bound alone fails for fₙ=n1_(0,1/n).

Show answer 2

Weak convergence implies boundedness by uniform boundedness theorem. In ℓ², eₙ⇀0 but ||eₙ||=1.

Show answer 3

Compact self-adjoint spectral theorem: nonzero spectral values are eigenvalues; eigenspaces finite-dimensional, else compactness fails on an orthonormal sequence. Nonzero eigenvalues may accumulate at 0.

Show answer 4

For f(x)=x on (−π,π), aₙ=0, bₙ=2(−1)ⁿ⁺¹/n. At the periodic jump the series converges to 0; convergence also holds in L².

Show answer 5

Roots ±2^(1/4), ±i2^(1/4); splitting field ℚ(2^(1/4),i), degree 8, Galois group D₄.

Show answer 6

ℤ/12⊕ℤ/18≅ℤ/6⊕ℤ/36; order 216, exponent 36. Elements of order exactly 6: 36−9−4+1=24.

Show answer 7

By van Kampen, π₁(S¹∨S¹)=F₂, free on two generators; reduced words ab and ba differ, so non-abelian.

Show answer 8

At origin I=dx²+dy², II=a dx²+b dy² (upward normal); principal curvatures a,b; reversing normal changes signs.

Show answer 9

Uniqueness: if Z,W both satisfy conditional expectation identities, ∫G(Z−W)=0 for all G∈𝒢, forcing equality a.s. Tower property follows by testing integrals over G∈𝒢.

Show answer 10

Itô gives d exp(λBₜ−λ²t/2)=λ exp(…)dBₜ; drift cancels. This exponential Brownian process is a true martingale on finite horizons.

Show answer 11

Weak form: find u∈H₀¹ with ∫∇u·∇v=⟨f,v⟩. Poincaré gives coercivity; Lax–Milgram existence, energy test gives uniqueness.

Show answer 12

u(x,t)=sin(2πx/L) exp[−4π²κt/L²].

Show answer 13

Céa: ||u−u_h||V≤(M/α)infᵥₕ||u−vₕ||V. Interpolation error O(hˢ) yields energy error O(hˢ) under regularity/mesh assumptions.

Show answer 14

Fenchel dual: supᵧ{−f*(−Aᵀy)−g*(y)}. For LASSO dual: maximise −½||y||²−bᵀy subject to ||Aᵀy||∞≤λ.

Show answer 15

Hoeffding: P(|X̄−E X̄|≥ε)≤2exp(−2nε²/R²) for common range width R; require n≥R²ln(2/δ)/(2ε²).

Show answer 16

fₙ(x)=xⁿ on [0,1] converges pointwise to 0 on [0,1) and 1 at 1, not uniformly; dominated convergence gives L¹ error 1/(n+1)→0.

\n

Master's and doctoral sample examinations

Four original CBE Nexus practice papers. Each paper is 3 hours and 100 marks. These are not official university examinations. Candidates must state hypotheses, show full reasoning and justify conclusions.

Master's Paper 1 — Analysis and Functional Analysis

  1. State and prove monotone convergence; give a counterexample to unjustified limit-integral interchange. (20)
  2. Prove completeness of Lp for 1≤p<∞. (20)
  3. State Hahn–Banach and derive a separation result. (15)
  4. State the spectral theorem for compact self-adjoint operators and prove finite-dimensionality of nonzero eigenspaces. (15)
  5. Evaluate a contour integral with at least two poles using residues. (15)
  6. Critique and repair an invalid limit-integral interchange proof. (15)

Marking: hypotheses 20; proof logic 30; applications 25; counterexample 15; exposition 10.

Master's Paper 2 — Algebra, Topology and Geometry

  1. State the structure theorem for finitely generated modules over a PID and classify a finite abelian group. (20)
  2. Find the splitting field and Galois group of a separable polynomial over Q. (15)
  3. Prove Maschke's theorem and decompose a representation using characters. (15)
  4. Compute homology or fundamental group of a finite CW complex. (20)
  5. Derive geodesic equations for a metric and calculate curvature. (15)
  6. Find the coordinate ring of an affine variety and apply Nullstellensatz. (15)

Marking: structure 20; proof 35; calculations 25; hypotheses 10; exposition 10.

Doctoral Qualifying Paper 1 — Analysis, Probability and PDE

  1. Prove a Radon–Nikodym consequence in a finite-measure setting; discuss uniqueness almost everywhere. (20)
  2. Establish a weak compactness or reflexivity result and identify hypotheses. (15)
  3. Prove optional stopping for bounded stopping times and explain failure without integrability. (15)
  4. Establish a distributional limit using characteristic functions. (15)
  5. Formulate a weak elliptic PDE and prove existence, uniqueness and an energy estimate. (20)
  6. Propose a rigorous route to weaken a regularity hypothesis, including obstacles and counterexamples. (15)

Marking: proofs 45; hypotheses 20; research synthesis 20; communication 15.

Doctoral Qualifying Paper 2 — Algebra, Geometry, Dynamics and Research

  1. Analyse a number-field extension: degree, embeddings and prime splitting. (20)
  2. Use chain complexes or characteristic classes to distinguish spaces or bundles. (20)
  3. Apply an ergodic theorem and distinguish ergodicity from mixing. (15)
  4. Derive primal and dual optimisation problems, prove weak duality and state strong-duality conditions. (15)
  5. Prove stability and convergence of a numerical scheme with an error restriction. (15)
  6. Defend a thesis claim, novelty, assumptions, counterexamples and proof strategy. (15)

Marking: proof validity 35; structural insight 20; computation 15; research judgement 20; communication 10.

Research methodology and dissertation assessment

Critical literature review — 20 marks

Review at least eight primary sources on one focused question. Compare assumptions and methods, identify a research gap, and distinguish established results from conjectures. Marking: source quality 4; synthesis 6; gap 4; mathematical accuracy 4; citations 2.

Research proposal — 20 marks

Prepare 2,000–3,000 words: problem, motivation, questions, literature gap, definitions, method, expected contribution, feasibility, risks, timeline and references. Marking: significance 4; precision 4; literature 3; method 4; feasibility 3; presentation 2.

Proof portfolio and referee report — 20 marks

Reconstruct a substantial theorem, map dependencies, provide a proof or label imported lemmas, test boundary cases and write a referee-style critique. Marking: correctness 8; completeness 4; critique 4; exposition 4.

Reproducible computational investigation — 15 marks

Submit code, environment versions, data provenance, seeds, precision, error analysis, tests and checkable outputs. For theoretical work, submit a proof-audit dossier. Marking: reproducibility 5; verification 4; analysis 4; documentation 2.

Dissertation and oral defence — 25 marks

Present original contribution, theorem claims, proof architecture, limitations and future directions. Defend novelty, assumptions, counterexamples and alternative methods in a 20–30-minute viva. Marking: contribution 6; validity 8; literature 3; limitations 3; defence 5.

Integrity: Cite sources, label reproduced results, and do not present conjectures or numerical evidence as proved original mathematics. Institutional degree rules take precedence.

Academic reference points and further reading

The topic architecture was cross-checked against published graduate course descriptions and postgraduate research guidance. These sources provide examples of university-level scope; they do not imply endorsement of CBE Nexus or a single universal syllabus.

Use current institutional syllabi and primary literature for formal study. Reading lists and examination requirements vary by university, degree and supervisor.

Official Education References

Use these official organisations for curriculum guidance, examinations and further learning information.