The following describes the format and scope of Qualifying Exams in each of the six areas of graduate study. It is department policy that qualifiers be based on curriculum from the first year graduate sequences and any undergraduate prerequisites. Students, who have mastered those courses, should be able to pass the exams. Faculty members, who write the exams, are expected to implement this policy, and to adhere conscientiously to the guidelines that follow. Students, in turn, are expected to interpret each exam problem in a reasonable fashion, so as not to trivialize any solution. Copies of past exams and a record of previous passing scores are available from the department by request.
Qualifying Exams (affectionately known as Quals) are given twice a year and typically take place the week or two before classes begin each semester. A precise schedule is posted months in advance. Students are allowed six hours to take the exam. Food can be brought in to help fuel the brain. Faculty, who grade the exams, are expected to release the results before the last date for students to drop or withdraw from courses without receiving a DR or W on their transcripts, and within two weeks in any case.
The books listed for each area below should be more than sufficient to cover topics that will appear on the exam. It should be emphasized, however, that the exams are intended to test general knowledge and competence rather than any particular set of books or courses.
List of Exams
ALGEBRA (20182019)
Galois Theory
Topics:
 Field extensions including: algebraic and transcendental elements, finite/algebraic/Galois/simple/separable/purely inseparable field extensions, separable and inseparable polynomials.
 Splitting fields and algebraic closures.
 The fundamental theorem of Galois theory.
 Examples including: finite fields, polynomials of degree at most 4, composite extensions.
 Primitive elements.
Reference: Dummitt and Foote’s “Abstract Algebra” book Chapter 13 (exlcuding 13.3) and Chapter 14 (excluding 14.7, 14.8, and 14.9). (110 pages).
General Algebra
You should know the meaning of and be able to give examples and nonexamples of:
 Left/right/twosided ideals, left and right modules, bimodules
 Annihilator of a module
 Matrix ring, quaternion ring, group ring
 Division ring, simple ring, zerodivisor
 Modules: Exact sequences of modules, tensor products, Hom, localization of modules, flat/projective/free modules, support of a module
References: For a commutative ring specifically, see the references below. For a not necessarily commutative ring, see Dummitt and Foote, Chapters 7 and 1012. (220 pages).
Commutative Algebra
Topics:
 Rings and ideals: prime/maximal/radical ideals, quotient rings, integral domains, localization of rings, local rings, polynomial rings, zerodivisors, nilpotent elements, nilradical, fraction fields, Nakayama’s Lemma.
 Modules: see the list in “general algebra.”
 Noetherian rings, including chain conditions and the Hilbert Basis Theorem.
Reference:
 In recent years 742, which concentrates on commutative algebra, has been taught from AltmanKleiman’s “A term of commutative algebra,” and the relevant chapters would be 15 and 813. (55 pages).
 An alternate source would be AtiyahMacDonald’s “Introduction to Commutative Algebra” chapters 13 and 67. (88 pages).
Group Theory
You should know the meaning of, and be able to give an example and a nonexample of the following:
 Group
 order (of a group)
 order (of a group element)
 normal subgroup
 quotient group
 abelian group, nilpotent group, lower central series, solvable group, simple group, perfect group
 commutator subgroup, centralizer, normalizer, conjugacy class
 group homomorphism
 group action, orbit, stabilizer, transitive action, faithful action
 free group, finitely presented group
 pgroup, symmetric group, permutation group, alternating group, dihedral group, general linear group
You should be able to:
 State and apply the orbitstabilizer theorem;
 Compute the conjugacy classes of a finite group;
 Work fluently with free groups, matrix groups, and symmetric groups
Reference: Dummit and Foote Chapters 1, 2.12.4, 3.13.3, 4.14.3, 5.15.2, 5.4, 6.1, and 6.3.
Linear Algebra
You should know the meaning of, and be able to give an example and a nonexample of the following:
 Eigenvalue, eigenvector, generalized eigenspace
 Jordan normal form
 dual vector space, transpose, bilinear form, Hermitian form
 orthogonal matrix, symplectic matrix
 tensor product of vector spaces
References: Dummit and Foote, chapters 1112.
Analysis (Exam Syllabus for 20192020)
The Analysis Qualifying Exam involves the tools from a) advanced calculus, b) Math 721, and c) one of the two courses: Math 722 (Complex Analysis) and Math 725 (Real Analysis). Choose one at the time of exam registration.
The exam usually consists of nine questions and six are to be attempted. There will be at least two from each of a), b) and c), though some problems may involve tools from more than one area. The content of 721, 722, and 725 certainly varies somewhat from instructor to instructor. Questions for 20182019 will come from the topics and tools below.
 Basic Advanced Calculus
 Basic undergraduate analysis, commensurate with the Math 521522 sequence at UW Madison.
 Study guide: These courses are typically taught at the level of Rudin’s Principles of Mathematical Analysis.
 A syllabus for this sequence may be found here.
 This list of practice problems consisting mainly of demanding undergraduate analysis problems may be a good start for those looking to review this material.
 Complex Analysis
 Graduate Real Analysis, commensurate with the Math 722 course at UW Madison.
 Recommended texts: The principal reference is Gamelin’s Complex Analysis, chapters 114.
 Good sources for additional problems: old qualifying exams, Rudin’s Real and Complex Analysis, SteinShakarchi: Princeton Lectures in Analysis II: Complex Analysis.
 List of topics:

 Continuous branches of multivalued functions, principal branches of elementary functions. Analytic functions and CauchyRiemann equations.
 Green’s theorem. Cauchy’s theorem and Cauchy’s formula. Harmonic functions and meanvalue property. Maximum principle.
 Line integrals and path independence of line integrals. Harmonic conjugate. Analytic continuation.
 Liouville’s theorem, Morera’s theorem, Goursat’s theorem. Pompeiu’s formula.
 Power series, Laurent series, and isolated singularity. Residue calculus.
 Argument principle, Rouche’s theorem, Hurwitz’s theorem, open mapping theorem. Winding numbers and Jump theorem for Cauchy integrals.
 Conformal mappings of the unit disc and fractional linear transformations. Schwarz’ lemma, Pick Lemma. Dirichlet problem on the unit disc. Schwarz reflection principle.
 Simply connected domains. Normal family and the proof of Riemann mapping theorem. SchwarzChristoffel formula
 Marty’s theorem, Montel’s theorem, and Picard theorems.
 Runge’s theorem, theorems by Weierstrass and MittagLeffler.
 The Gamma function, Laplace Transforms, the Zeta function, Dirichlet Series, and the prime number theorem.
 Measure, Integration and the Fundamentals of Functional Analysis
 First semester graduate Real Analysis, commensurate with the Math 721 course at UW Madison.
 Recommended texts:
 The principal reference is Folland’s Real Analysis: Modern Techniques and Their Applications, Chapters 15.
 Good sources for additional problems: old qualifying exams, Rudin’s Real and Complex Analysis, Chapters 18. Chapter 2 of Rudin’s Functional Analysis (for problems on the Baire Category Theorem). SteinShakarchi: Princeton Lectures in Analysis III: Real Analysis.
 List of topics:
 Measure and integration, with a particular emphasis on: measures, the Lebesgue integral and measure on R^n, modes of convergence (pointwise, almost everywhere, in measure, in mean), the Monotone Convergence Theorem, Fatou’s Lemma, the Dominated Convergence Theorem, Egorov’s Theorem, Lusin’s Theorem, product measures, the Fubini and Tonelli Theorems. Reference: Chapters 1 and 2 of Folland
 Signed measure and differentiation, with a particular emphasis on the RadonNikodym Theorem, the Lebesgue Differentiation Theorem in R^n, and the connection between differentiation theorems and bounds for maximal functions. Reference: Chapter 3 of Folland, excluding functions of bounded variation.
 Basic point set topology, commensurate with Chapter 4 of Folland, particularly nonmetric topologies, locally compact and locally convex spaces.
 Introductory functional analysis: Banach spaces, linear mappings, linear functionals, duality, adjoint mapping, HahnBanach Theorem, Baire Category Theorem, Open Mapping and Closed Graph Theorems, Principle of Uniform Boundedness, the weak and weak* topologies, operator topologies (norm, strong, weak), perturbations of invertible operators, Hilbert spaces. Reference: Chapter 5 of Folland.
 Functional analysis, distributions and the Fourier transform.
 Second semester Real Analysis, commensurate with Math 725 at UW Madison.
 Recommended texts. Details are given in the list of topics.
 Folland, Chapters 69.
 Rudin’s Functional Analysis, Chapters 68. (Distribution theory is typically taught at the level of Rudin’s Functional Analysis, rather than Folland.)
 Stein and Shakarchi’s Princeton Lectures in Analysis IV: Functional Analysis, Chapter 4. (Good reference and problems for further consequences of the Baire Category Theorem.)
 List of topics:
 Lp spaces and their duals. Reference: Chapter 6 of Folland.
 Radon measures and the Riesz Representation Theorem: Chapter 7 of Folland.
 Fourier series and transforms: Chapter 8 of Folland.
 Distributions: Chapter 67 Rudin.
 Sobolev spaces: 9.3 of Folland.
 Further consequences of the Baire Category Theorem: Chapter 4 of Stein and Shakarchi

APPLIED MATHEMATICS
The Applied Mathematics Qualifying Exam consists of six problems, all of which are to be attempted. The exam is based on material usually covered in undergraduate ordinary differential equations, partial differential equations, complex variables, and the firstyear graduate sequence in Applied Mathematics (Math 703704).
 ODE Theory
 Existence and uniqueness for ODE; Linear systems; Solutions of equations and systems with constant coefficients; Variation of parameters; Green’s functions for ODE and solution of boundary value problems.
 Fourier Series and Transform Method; Separation of Variables for PDE
 Theory of Fourier Series; Orthogonal functions; SturmLiouville theory and connections with Fourier series; Special Fourier bases (Bessel functions, Legendre polynomials);Fourier transforms (Fourier and Fourier sine and Fourier cosine); Laplace transform and solution of initialboundary value problems for equations; Evaluation of integrals via complex variables techniques.
 Calculus of Variations
 Minimization problems in finite and infinite dimension; Constrained minimization – Lagrange multipliers; EulerLagrange equations of an infinite dimensional variational problems (cases of systems of ODE’s and systems of PDE’s).
 Advanced Techniques for Solutions of Partial Differential Equations
 Green’s functions for elliptic, parabolic and hyperbolic problems; Conformal mapping theorem and solution of 2d Laplace equation; Method of characteristics; Selfsimilarity methods; Traveling waves; Dispersive waves and dispersion relations.
 Elements of Analytical and Continuum Mechanics
 Balancing laws of continuum physics; Equation of incompressible and compressible fluid mechanics; Potential theory; Modeling of springmass systems; Modeling of the vibrating string.
 Asymptotic Methods
 Regular pertubations; Asymptotics of integrals (Laplace method, Stationary phase).
References
Churchill, Fourier Series and Boundary Value Problems
Gelfand and Fomin B, Calculus of Variation
Kevorkian, Partial Differential Equations
Levinson and Redheffer, Complex Variables
Pinsky B, Partial Differential Equations and Boundary Value Problems
Stakgold, Green’s Functions and Boundary Value Problems
Strang, Introduction to Applied Mathematics
Zanderer B, Partial Differential Equations
COMPUTATIONAL MATHEMATICS
The Computational Mathematics Qualifying Exam is administrated jointly between the Department of Mathematics and Department of Computer Science. Students from both departments will take the exam at the same time, but students will be given more problems than required to finish in order to fill the gap between different rules of the two departments. The problems for students from the two different departments will be slightly different.
The Mathematics Department students will have six hours to complete the exam; the material is based on Math/CS 714 and Math/CS 715. Math 714 / 715 is based on undergraduate knowledge of numerical analysis, which is covered in Math 513 / 514.
The Computer Science students will have three hours to complete the exam; the material is based on Math/CS 513, 514, 714, 717.
Covered Materials for Math Students
 Numerical Methods for Ordinary Differential Equations

 Basic ODE Theory: well–posedness
Explicit and implicit methods, stability, Runge–Kutta and multistep methods, stiff problems
 Basic ODE Theory: well–posedness
 Finite Difference Methods for Parabolic Partial Differential Equations

 Numerical differentiations, uniform and nonuniform meshes
 Consistency, stability and convergence
Multidimensional problems: ADI and fractional step methods
 Finite Difference Methods for Hyperbolic Partial Differential Equations

 Linear hyperbolic equations and their numerical discretizations
 Basic theory for nonlinear hyperbolic equations: shock formation, weak solution and entropy condition, Riemann problem
 Shock capturing methods: Godnov and Roe methods, slope limiters, fluxsplitting
 HamiltonJacobi equations and the level set method for front propagation
 Spectral Methods for Partial Differential Equations

 Fast Fourier transform
 Fourier spectral method, pseudospectral methods, Chebyshev method
 Numerical Algebra

 Direct and iterative methods for linear systems, eigenvalue problems, sparse matrices, Conjugate gradient methods, nonlinear algebraic equations
 Finite Element Methods For Elliptic Partial Differential Equations

 Variational formulation, Galerkin methods, energy estimate and error analysis, implementation,
 Discontinuous Galerkin, multigrid methods, boundary element method
 Monte Carlo Methods and Molecular Dynamics

 MC methods for integrations, random sampling, The Metropolis algorithm, molecular dynamics
References
 Basic Numerical Analysis

 Bradie, Friendly Introduction to Numerical Analysis, Prentice Hall, 2003.
 Burden and Faires, Numerical Analysis, Brooks Cole, 2004. .
 Finite Difference Methods

 LeVeque, Finite Difference Methods for Ordinary and Partial Differential Equations: SteadyState and TimeDependent Problems, SIAM, 2007.
 Strikwerda, Finite Difference Schemes and Partial Differential Equations: 2nd edition, SIAM, 2004
 Spectral Methods

 Trefethen, Spectral Methods in MATLAB, SIAM, 2000.
 Fornberg, Practical Guide to Pseudospectral Methods, Cambridge University Press, 1998.

Numerical Analysis of Spectral Methods: Theory and Applications
 Finite Volume Methods

 LeVeque, Finite Volume Methods for Hyperbolic Problems, Cambridge University Press, 2002.
 Finite Element Methods:

 Eriksson, Estep, and Hansbo, and C. Johnson, Computational Differential Equations: 2nd edition, Cambridge University Press, 1996.
 Zhangxin Chen, Finite Element Methods and Their Applications, Springer, 2005.
 Numerical Solution of Partial Differential Equations by the Finite Element Method , by Johnson
 Monte Carlo Methods:

 Kalos and Whitlock, Monte Carlo Methods, J. Wiley & Sons, New York, 1986.
GEOMETRY/TOPOLOGY (Exam Syllabus 20182019)
Logistics of the exam:
When registering for the exam, students must choose either the algebraic topology option or the differential topology option. The algebraic topology option is based on the courses Math 751/752, and the differential topology option is based on Math 751/761.
The exam consists of two parts, Part I and Part II. Each part has three questions. Part I is the same on both exams, and covers material from 751. Part II of the Algebraic Topology option covers material from 752, and Part II of the Differential Topology option covers material from 761.
Students are asked to answer two questions from Part I and two questions from Part II.
The exam is based on (a) background material usually covered in advanced calculus, undergraduate topology (e.g. 551) and undergraduate algebra courses (e.g. 541), and (b) topics from the first year graduate topology sequence (751, 752, 761), as identified below. Note that familiarity with basic concepts of point set topology (e.g. metric spaces, completeness, connectedness, and compactness) will be assumed, although these may not be treated in 751, 752, 761.
Reference texts:
The reference text for 751 and 752 is Allen Hatcher’s Algebraic Topology.
The reference texts for 761 are John Lee’s Introduction to Smooth Manifolds, Frank Warner’s Foundations of Differentiable Manifolds and Lie Groups, and Spivak’s A Comprehensive Introduction to Differential Geometry, Volume I.
Description of advanced material coverered by the exam.
Part I. The student should be prepared to:
 Work with the standard constructions in algebraic topology, such as homotopies, chain complexes, quotients, products, suspensions, retracts, and deformation retracts.
 Effectively use the fundamental tools of homology, reduced homology, the long exact sequence of a pair, excision, and the MayerVietoris sequence for homology.
 Compute the fundamental group of an explicitly given cell complex.
 Compute the fundamental group of a space using the SeifertVan Kampen Theorem.
 Compute the homology of an explicitly given cell complex using the definition of cellular homology.
 Make use of the standard cell structures of spheres and real and complex projective spaces in all dimensions.
 Know the fundamental and homology groups of spheres and real and complex projective spaces in all dimensions.
 Compute the homology of a space using the MayerVietoris sequence.
 Make use of the long exact sequence in homology to make computations.
 Compute the Euler characteristic of a space.
 Construct finite covering spaces of an explicitly given cell complex.
 Construct covering spaces with prescribed group of deck transformations by constructing a corresponding quotient of the fundamental group.
 Use contractibility of the universal cover to deduce that certain maps are nullhomotopic.
 Use local homology to distinguish two spaces.
 Use the Lefschetz fixed point theorem to find a fixed point of a continuous map.
 Combine the above machinery and techniques to solve problems.
Part II. Algebraic option. The student should be prepared to:
 Compute the cohomology of an explicitly given cell complex using the definition of cellular cohomology.
 Effectively use the fundamental tools of cohomology, reduced cohomology, cup product, cap product, cross product, the long exact sequence of a pair, excision, and the MayerVietoris sequence.
 Apply the Universal Coefficient Theorem in computations.
 Compute cup products of cohomology classes.
 Distinguish the homotopy types of two spaces using the Cohomology Ring.
 Make effective use of Poincaré duality.
 Make elementary computations of homotopy groups using the Hurewicz Theorem.
 Know the homotopy groups of the nsphere through dimension n.
 Know the homotopy groups of the 2sphere through dimension 3.
 Build continuous maps between cell complexes inductively using highconnectivity of the target: e.g. “Using the fact that Y is kconnected, construct a map from the given X to Y.”
 Make effective use of Whitehead’s Theorem.
 Recognize and construct fiber bundles.
 Use the long exact sequence of homotopy groups of a fibration.
 Know the standard examples of fiber bundles of spheres over spheres arising from the unit spheres in the real division algebras.
 Combine the above machinery and techniques to solve problems.
Part II. Differential Option. The student should be prepared to:
 Work with the standard concepts in differential topology, including smooth manifolds, local coordinates, transversality, regular values, the Inverse Function Theorem, tubular neighborhoods, vector fields, flows, differential forms, integration of forms, distributions, de Rham cohomology, and Stokes Theorem.
 Perform computations with differential forms, including integration of explicit forms over given submanifolds.
 Perform computations with the Lie derivative.
 Make use of Sard’s theorem.
 Distinguish de Rham cohomology classes given explicit forms on an explicit manifold.
 Show that a given manifold admits a smooth structure. For example, the student should be able to show that spheres, projective spaces, Grassmannians, the special linear group, and the orthogonal group admit smooth structures.
 Construct trivializations of explicit vector bundles, such as the tangent bundle of the 3sphere.
 Combine the above machinery and techniques to solve problems.
LOGIC
The Logic Qualifying Exam will consist of a basic section plus three advanced sections, one in Model Theory, one in Computability Theory, and one in Set Theory. Students taking the exam will answer the questions in the basic section plus the questions in one of the advanced sections. Students will indicate beforehand, when they register for the logic exam, which one of the advanced sections they intend to take.
The elementary section covers material taught in 770, plus undergraduate knowledge. The advanced Model Theory, Computability Theory, and Set Theory sections correspond, roughly, to the contents of 776, 773, and 771, respectively. Thus, two logic courses (770 plus one of 776, 773, 771) should be adequate preparation for the exam.
Students should be prepared to answer questions on the following topics. Since these topics may be presented in different ways from year to year, the student should read broadly from the references to supplement the course work.
 Elementary
 Firstorder logic syntax and semantics, Completeness and Compactness Theorems, Löwenheim–Skolem Theorem, Incompleteness Theorem, decidable and undecidable theories, axioms of ZFC, ordinal and cardinal arithmetic.
References
Ebbinghaus, Flum and Thomas: Mathematical Logic (Chs.1–6 and 10)
Kunen: The Foundations of Mathematics
Kunen: Set Theory (Chs. 1 and 3)  Computability Theory
 Computable sets and (partial) computable functions, Recursion Theorem, computably enumerable sets, halting problem, Turing reducibility, Turing degrees and jump, arithmetical hierarchy, index sets, low and high degrees, Martin’s high domination theorem, Friedberg and Shoenfield jump inversion, minimal degrees, exact pairs, 1generic, hyperimmune, and hyperimmunefree degrees, diagonally noncomputable functions, Π^{0}_{1}classes, PA degrees, low and hyperimmunefree basis theorems, finite injury, FriedbergMuchnik theorem, Sacks Splitting theorem, priority trees, infinite injury, Sacks jump inversion, computable ordinals, Kleene’s O, hyperarithmetical hierarchy.
References
Soare: Recursively Enumerable Sets and Degrees (Chs.1–8)
Rogers: Theory of Recursive Functions and Effective Computability (Ch.11) or Ash/Knight: Computable Structures and the Hyperarithmetical Hierarchy (Chs. 45)  Set Theory
 Martin’s Axiom, Suslin and Aronszajn trees, absoluteness and reflection, constructible universe, and onestep forcing constructions.
References
Kunen: Set Theory (Chs.1–7)
Jech: Set Theory (Chs. 1–4)  Model Theory
 Elementary chains and extensions, preservation theorems, ultraproducts, quantifier elimination, model completeness, types, saturated and special models, small theories, indiscernibles, countable categoricity, strong minimality, BaldwinLachlan characterization of uncountably categorical theories.
References
Hodges: A Shorter Model Theory
Marker: Model Theory, An Introduction
Tent, Ziegler: A Course in Model Theory