Mathematics
Mathematics
DEPARTMENT OF MATHEMATICS
Bachelor of Science in Mathematics (Course 18)
Undergraduates in mathematics are encouraged to elect an Students planning to go on to graduate work in applied mathematics
undergraduate seminar during their junior or senior year. The should also take some basic subjects in analysis and algebra.
experience gained from active participation in a seminar conducted
by a research mathematician has proven to be valuable for students More detail on the Applied Mathematics option can be found on the
planning to pursue graduate work as well as for those going on to degree chart (http://catalog.mit.edu/degree-charts/mathematics-
other careers. These seminars also provide training in the verbal and course-18/#appliedmathematicstext).
written communication of mathematics and may be used to fulll the
Communication Requirement. Pure Mathematics Option
Pure (or "theoretical") mathematics is the study of the basic concepts
Many mathematics majors take 18.821 Project Laboratory in and structure of mathematics. Its goal is to arrive at a deeper
Mathematics, which fullls the Institute's Laboratory Requirement understanding and an expanded knowledge of mathematics itself.
and counts toward the Communication Requirement.
Traditionally, pure mathematics has been classied into three
general elds: analysis, which deals with continuous aspects of
mathematics; algebra, which deals with discrete aspects; and
Department of Mathematics | 3
DEPARTMENT OF MATHEMATICS
4 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Center within the Institute for Data, Systems, and Society. It is open Laurent Demanet, PhD
to current doctoral students in participating departments. For more Professor of Mathematics
information, including department-specic requirements, see the Professor of Earth, Atmospheric and Planetary Sciences
full program description (http://catalog.mit.edu/interdisciplinary/
graduate-programs/phd-statistics) under Interdisciplinary Graduate Joern Dunkel, PhD
Programs. MathWorks Professor of Mathematics
Department of Mathematics | 5
DEPARTMENT OF MATHEMATICS
6 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 7
DEPARTMENT OF MATHEMATICS
8 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 9
DEPARTMENT OF MATHEMATICS
18.06 Linear Algebra Reviews linear algebra with applications to life sciences, nance,
Prereq: Calculus II (GIR) engineering, and big data. Covers singular value decomposition,
U (Fall, Spring) weighted least squares, signal and image processing, principal
4-0-8 units. REST component analysis, covariance and correlation matrices, directed
Credit cannot also be received for 6.C06[J], 18.700, 18.C06[J] and undirected graphs, matrix factorizations, neural nets, machine
learning, and computations with large matrices.
Basic subject on matrix theory and linear algebra, emphasizing Sta
topics useful in other disciplines, including systems of equations,
vector spaces, determinants, eigenvalues, singular value
decomposition, and positive denite matrices. Applications to
least-squares approximations, stability of dierential equations,
networks, Fourier transforms, and Markov processes. Uses linear
algebra soware. Compared with 18.700, more emphasis on matrix
algorithms and many applications.
Fall: TBD. Spring: A. Borodin
10 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
18.0651 Matrix Methods in Data Analysis, Signal Processing, 18.085 Computational Science and Engineering I
and Machine Learning Subject meets with 18.0851
Subject meets with 18.065 Prereq: Calculus II (GIR) and (18.03 or 18.032)
Prereq: 18.06 U (Fall, Spring, Summer)
G (Spring) 3-0-9 units
3-0-9 units
Review of linear algebra, applications to networks, structures, and
Reviews linear algebra with applications to life sciences, nance, estimation, nite dierence and nite element solution of dierential
engineering, and big data. Covers singular value decomposition, equations, Laplace's equation and potential flow, boundary-value
weighted least squares, signal and image processing, principal problems, Fourier series, discrete Fourier transform, convolution.
component analysis, covariance and correlation matrices, directed Frequent use of MATLAB in a wide range of scientic and engineering
and undirected graphs, matrix factorizations, neural nets, machine applications.
learning, and computations with large matrices. Students in Course Fall: D. Kouskoulas. Spring: Sta
18 must register for the undergraduate version, 18.065.
Sta 18.0851 Computational Science and Engineering I
Subject meets with 18.085
18.075 Methods for Scientists and Engineers Prereq: Calculus II (GIR) and (18.03 or 18.032)
Subject meets with 18.0751 G (Fall, Spring, Summer)
Prereq: Calculus II (GIR) and 18.03 3-0-9 units
U (Spring)
3-0-9 units Review of linear algebra, applications to networks, structures,
Credit cannot also be received for 18.04 and estimation, nite dierence and nite element solution of
dierential equations, Laplace's equation and potential flow,
Covers functions of a complex variable; calculus of residues. boundary-value problems, Fourier series, discrete Fourier transform,
Includes ordinary dierential equations; Bessel and Legendre convolution. Frequent use of MATLAB in a wide range of scientic and
functions; Sturm-Liouville theory; partial dierential equations; heat engineering applications. Students in Course 18 must register for the
equation; and wave equations. undergraduate version, 18.085.
H. Cheng Fall: D. Kouskoulas. Spring: Sta
18.0751 Methods for Scientists and Engineers 18.086 Computational Science and Engineering II
Subject meets with 18.075 Subject meets with 18.0861
Prereq: Calculus II (GIR) and 18.03 Prereq: Calculus II (GIR) and (18.03 or 18.032)
G (Spring) U (Spring)
3-0-9 units Not oered regularly; consult department
Credit cannot also be received for 18.04 3-0-9 units
Covers functions of a complex variable; calculus of residues. Initial value problems: nite dierence methods, accuracy and
Includes ordinary dierential equations; Bessel and Legendre stability, heat equation, wave equations, conservation laws and
functions; Sturm-Liouville theory; partial dierential equations; heat shocks, level sets, Navier-Stokes. Solving large systems: elimination
equation; and wave equations. Students in Courses 6, 8, 12, 18, and with reordering, iterative methods, preconditioning, multigrid,
22 must register for undergraduate version, 18.075. Krylov subspaces, conjugate gradients. Optimization and minimum
H. Cheng principles: weighted least squares, constraints, inverse problems,
calculus of variations, saddle point problems, linear programming,
duality, adjoint methods.
Information: W. G. Strang
Department of Mathematics | 11
DEPARTMENT OF MATHEMATICS
12 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 13
DEPARTMENT OF MATHEMATICS
Covers fundamentals of mathematical analysis: convergence of Normed spaces, completeness, functionals, Hahn-Banach theorem,
sequences and series, continuity, dierentiability, Riemann integral, duality, operators. Lebesgue measure, measurable functions,
sequences and series of functions, uniformity, interchange of limit integrability, completeness of L-p spaces. Hilbert space. Compact,
operations. Shows the utility of abstract concepts and teaches Hilbert-Schmidt and trace class operators. Spectral theorem.
understanding and construction of proofs. More demanding than M. Jezequel
18.100A, for students with more mathematical maturity. Places more
emphasis on point-set topology and n-space. Includes instruction 18.1021 Introduction to Functional Analysis
and practice in written communication. Enrollment limited. Subject meets with 18.102
C. Oh Prereq: (18.06, 18.700, or 18.701) and (18.100A, 18.100B, 18.100P, or
18.100Q)
18.101 Analysis and Manifolds G (Spring)
Subject meets with 18.1011 3-0-9 units
Prereq: (18.06, 18.700, or 18.701) and (18.100A, 18.100B, 18.100P, or
18.100Q) Normed spaces, completeness, functionals, Hahn-Banach theorem,
U (Fall) duality, operators. Lebesgue measure, measurable functions,
3-0-9 units integrability, completeness of L-p spaces. Hilbert space. Compact,
Hilbert-Schmidt and trace class operators. Spectral theorem.
Introduction to the theory of manifolds: vector elds and densities Students in Course 18 must register for the undergraduate version,
on manifolds, integral calculus in the manifold setting and the 18.102.
manifold version of the divergence theorem. 18.901 helpful but not M. Jezequel
required.
M. Jezequel 18.103 Fourier Analysis: Theory and Applications
Subject meets with 18.1031
18.1011 Analysis and Manifolds Prereq: (18.06, 18.700, or 18.701) and (18.100A, 18.100B, 18.100P, or
Subject meets with 18.101 18.100Q)
Prereq: (18.06, 18.700, or 18.701) and (18.100A, 18.100B, 18.100P, or U (Fall)
18.100Q) 3-0-9 units
G (Fall)
3-0-9 units Roughly half the subject devoted to the theory of the Lebesgue
integral with applications to probability, and half to Fourier series
Introduction to the theory of manifolds: vector elds and densities and Fourier integrals.
on manifolds, integral calculus in the manifold setting and the J. Shi
manifold version of the divergence theorem. 18.9011 helpful but not
required. Students in Course 18 must register for the undergraduate 18.1031 Fourier Analysis: Theory and Applications
version, 18.101. Subject meets with 18.103
M. Jezequel Prereq: (18.06, 18.700, or 18.701) and (18.100A, 18.100B, 18.100P, or
18.100Q)
G (Fall)
3-0-9 units
14 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Studies the basic properties of analytic functions of one complex 18.125 Measure Theory and Analysis
variable. Conformal mappings and the Poincare model of non- Prereq: 18.100A, 18.100B, 18.100P, or 18.100Q
Euclidean geometry. Cauchy-Goursat theorem and Cauchy integral Acad Year 2023-2024: Not oered
formula. Taylor and Laurent decompositions. Singularities, Acad Year 2024-2025: G (Spring)
residues and computation of integrals. Harmonic functions and 3-0-9 units
Dirichlet's problem for the Laplace equation. The partial fractions
decomposition. Innite series and innite product expansions. The Provides a rigorous introduction to Lebesgue's theory of measure
Gamma function. The Riemann mapping theorem. Elliptic functions. and integration. Covers material that is essential in analysis,
Students in Course 18 must register for the undergraduate version, probability theory, and dierential geometry.
18.112. M. Jezequel
A. Lawrie
18.137 Topics in Geometric Partial Dierential Equations
Prereq: Permission of instructor
Acad Year 2023-2024: Not oered
Acad Year 2024-2025: G (Fall)
3-0-9 units
Can be repeated for credit.
Department of Mathematics | 15
DEPARTMENT OF MATHEMATICS
Introduces three main types of partial dierential equations: Topics vary from year to year.
diusion, elliptic, and hyperbolic. Includes mathematical tools, L. Guth
real-world examples and applications, such as the Black-Scholes
equation, the European options problem, water waves, scalar 18.199 Graduate Analysis Seminar
conservation laws, rst order equations and trac problems. Prereq: Permission of instructor
Students in Course 18 must register for the undergraduate version, Acad Year 2023-2024: G (Spring)
18.152. Acad Year 2024-2025: Not oered
T. Collins 3-0-9 units
Can be repeated for credit.
18.155 Dierential Analysis I
Prereq: 18.102 or 18.103 Studies original papers in dierential analysis and dierential
G (Fall) equations. Intended for rst- and second-year graduate students.
3-0-9 units Permission must be secured in advance.
V. W. Guillemin
First part of a two-subject sequence. Review of Lebesgue integration.
Lp spaces. Distributions. Fourier transform. Sobolev spaces.
Discrete Applied Mathematics
Spectral theorem, discrete and continuous spectrum. Homogeneous
distributions. Fundamental solutions for elliptic, hyperbolic and 18.200 Principles of Discrete Applied Mathematics
parabolic dierential operators. Recommended prerequisite: 18.112. Prereq: None. Coreq: 18.06
S. Dyatlov U (Spring)
4-0-11 units
18.156 Dierential Analysis II Credit cannot also be received for 18.200A
Prereq: 18.155
G (Spring) Study of illustrative topics in discrete applied mathematics,
3-0-9 units including probability theory, information theory, coding theory,
secret codes, generating functions, and linear programming.
Second part of a two-subject sequence. Covers variable coecient Instruction and practice in written communication provided.
elliptic, parabolic and hyperbolic partial dierential equations. Enrollment limited.
D. Jerison P. W. Shor, A. Moitra
16 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 17
DEPARTMENT OF MATHEMATICS
18.226 Probabilistic Methods in Combinatorics 18.303 Linear Partial Dierential Equations: Analysis and
Prereq: (18.211, 18.600, and (18.100A, 18.100B, 18.100P, or 18.100Q)) Numerics
or permission of instructor Prereq: 18.06 or 18.700
Acad Year 2023-2024: Not oered U (Fall)
Acad Year 2024-2025: G (Fall) 3-0-9 units
3-0-9 units
Provides students with the basic analytical and computational
Introduction to the probabilistic method, a fundamental and tools of linear partial dierential equations (PDEs) for practical
powerful technique in combinatorics and theoretical computer applications in science and engineering, including heat/diusion,
science. Focuses on methodology as well as combinatorial wave, and Poisson equations. Analytics emphasize the viewpoint of
applications. Suitable for students with strong interest and linear algebra and the analogy with nite matrix problems. Studies
background in mathematical problem solving. Topics include operator adjoints and eigenproblems, series solutions, Green's
linearity of expectations, alteration, second moment, Lovasz local functions, and separation of variables. Numerics focus on nite-
lemma, correlation inequalities, Janson inequalities, concentration dierence and nite-element techniques to reduce PDEs to matrix
inequalities, entropy method. problems, including stability and convergence analysis and implicit/
Y. Zhao explicit timestepping. Some programming required for homework
and nal project.
V. Heinonen
Continuous Applied Mathematics
18.300 Principles of Continuum Applied Mathematics 18.305 Advanced Analytic Methods in Science and Engineering
Prereq: Calculus II (GIR) and (18.03 or 18.032) Prereq: 18.04, 18.075, or 18.112
U (Fall) Acad Year 2023-2024: Not oered
3-0-9 units Acad Year 2024-2025: G (Fall)
3-0-9 units
Covers fundamental concepts in continuous applied mathematics.
Applications from trac flow, fluids, elasticity, granular flows, etc. Covers expansion around singular points: the WKB method on
Also covers continuum limit; conservation laws, quasi-equilibrium; ordinary and partial dierential equations; the method of stationary
kinematic waves; characteristics, simple waves, shocks; diusion phase and the saddle point method; the two-scale method and the
(linear and nonlinear); numerical solution of wave equations; method of renormalized perturbation; singular perturbation and
nite dierences, consistency, stability; discrete and fast Fourier boundary-layer techniques; WKB method on partial dierential
transforms; spectral methods; transforms and series (Fourier, equations.
Laplace). Additional topics may include sonic booms, Mach cone, H. Cheng
caustics, lattices, dispersion and group velocity. Uses MATLAB
computing environment. 18.306 Advanced Partial Dierential Equations with Applications
B. Geshkovski Prereq: (18.03 or 18.032) and (18.04, 18.075, or 18.112)
Acad Year 2023-2024: G (Spring)
Acad Year 2024-2025: Not oered
3-0-9 units
18 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
18.327 Topics in Applied Mathematics 18.336[J] Fast Methods for Partial Dierential and Integral
Prereq: Permission of instructor Equations
Acad Year 2023-2024: Not oered Same subject as 6.7340[J]
Acad Year 2024-2025: G (Fall) Prereq: 6.7300[J], 16.920[J], 18.085, 18.335[J], or permission of
3-0-9 units instructor
Can be repeated for credit. G (Fall, Spring)
3-0-9 units
Topics vary from year to year.
L. Demanet Unied introduction to the theory and practice of modern, near
linear-time, numerical methods for large-scale partial-dierential
18.330 Introduction to Numerical Analysis and integral equations. Topics include preconditioned iterative
Prereq: Calculus II (GIR) and (18.03 or 18.032) methods; generalized Fast Fourier Transform and other butterfly-
U (Fall) based methods; multiresolution approaches, such as multigrid
3-0-9 units algorithms and hierarchical low-rank matrix decompositions;
and low and high frequency Fast Multipole Methods. Example
Basic techniques for the ecient numerical solution of problems in applications include aircra design, cardiovascular system
science and engineering. Root nding, interpolation, approximation modeling, electronic structure computation, and tomographic
of functions, integration, dierential equations, direct and iterative imaging.
methods in linear algebra. Knowledge of programming in a language K. Burns
such as MATLAB, Python, or Julia is helpful.
L. Demanet 18.337[J] Parallel Computing and Scientic Machine Learning
Same subject as 6.7320[J]
18.335[J] Introduction to Numerical Methods Prereq: 18.06, 18.700, or 18.701
Same subject as 6.7310[J] Acad Year 2023-2024: Not oered
Prereq: 18.06, 18.700, or 18.701 Acad Year 2024-2025: G (Spring)
G (Spring) 3-0-9 units
3-0-9 units
Introduction to scientic machine learning with an emphasis on
Advanced introduction to numerical analysis: accuracy and eciency developing scalable dierentiable programs. Covers scientic
of numerical algorithms. In-depth coverage of sparse-matrix/iterative computing topics (numerical dierential equations, dense and
and dense-matrix algorithms in numerical linear algebra (for linear sparse linear algebra, Fourier transformations, parallelization
systems and eigenproblems). Floating-point arithmetic, backwards of large-scale scientic simulation) simultaneously with modern
error analysis, conditioning, and stability. Other computational data science (machine learning, deep neural networks, automatic
topics (e.g., numerical integration or nonlinear optimization) may dierentiation), focusing on the emerging techniques at the
also be surveyed. Final project involves some programming. connection between these areas, such as neural dierential
A. J. Horning equations and physics-informed deep learning. Provides direct
experience with the modern realities of optimizing code performance
for supercomputers, GPUs, and multicores in a high-level language.
A. Edelman
Department of Mathematics | 19
DEPARTMENT OF MATHEMATICS
20 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
High-level approaches to understanding complex optical media, Covers the mathematical modeling of physical systems, with
structured on the scale of the wavelength, that are not generally emphasis on the reading and presentation of papers. Addresses
analytically soluable. The basis for understanding optical a broad range of topics, with particular focus on macroscopic
phenomena such as photonic crystals and band gaps, anomalous physics and continuum systems: fluid dynamics, solid mechanics,
diraction, mechanisms for optical connement, optical bers (new and biophysics. Instruction and practice in written and oral
and old), nonlinearities, and integrated optical devices. Methods communication provided. Enrollment limited.
covered include linear algebra and eigensystems for Maxwell's O. Kodio
equations, symmetry groups and representation theory, Bloch's
theorem, numerical eigensolver methods, time and frequency- 18.385[J] Nonlinear Dynamics and Chaos
domain computation, perturbation theory, and coupled-mode Same subject as 2.036[J]
theories. Prereq: 18.03 or 18.032
S. G. Johnson Acad Year 2023-2024: G (Spring)
Acad Year 2024-2025: Not oered
18.376[J] Wave Propagation 3-0-9 units
Same subject as 1.138[J], 2.062[J]
Prereq: 2.003[J] and 18.075 Introduction to the theory of nonlinear dynamical systems with
G (Spring) applications from science and engineering. Local and global
3-0-9 units existence of solutions, dependence on initial data and parameters.
Elementary bifurcations, normal forms. Phase plane, limit cycles,
See description under subject 2.062[J]. relaxation oscillations, Poincare-Bendixson theory. Floquet
T. R. Akylas, R. R. Rosales theory. Poincare maps. Averaging. Near-equilibrium dynamics.
Synchronization. Introduction to chaos. Universality. Strange
attractors. Lorenz and Rossler systems. Hamiltonian dynamics and
KAM theory. Uses MATLAB computing environment.
R. R. Rosales
Department of Mathematics | 21
DEPARTMENT OF MATHEMATICS
Content varies from year to year. Recent developments in quantum A more extensive and theoretical treatment of the material in
eld theory require mathematical techniques not usually covered in 6.1400[J]/18.400[J], emphasizing computability and computational
standard graduate subjects. complexity theory. Regular and context-free languages. Decidable
V. G. Kac and undecidable problems, reducibility, recursive function theory.
Time and space measures on computation, completeness, hierarchy
theorems, inherently complex problems, oracles, probabilistic
Theoretical Computer Science
computation, and interactive proof systems. Students in Course 18
18.400[J] Computability and Complexity Theory must register for the undergraduate version, 18.404.
Same subject as 6.1400[J] M. Sipser
Prereq: (6.1200[J] and 6.1210) or permission of instructor
U (Spring) 18.405[J] Advanced Complexity Theory
4-0-8 units Same subject as 6.5410[J]
Prereq: 18.404
See description under subject 6.1400[J]. Acad Year 2023-2024: Not oered
R. Williams, R. Rubinfeld Acad Year 2024-2025: G (Spring)
3-0-9 units
18.404 Theory of Computation
Subject meets with 6.5400[J], 18.4041[J] Current research topics in computational complexity theory.
Prereq: 6.1200[J] or 18.200 Nondeterministic, alternating, probabilistic, and parallel
U (Fall) computation models. Boolean circuits. Complexity classes and
4-0-8 units complete sets. The polynomial-time hierarchy. Interactive proof
systems. Relativization. Denitions of randomness. Pseudo-
A more extensive and theoretical treatment of the material in randomness and derandomizations. Interactive proof systems and
6.1400[J]/18.400[J], emphasizing computability and computational probabilistically checkable proofs.
complexity theory. Regular and context-free languages. Decidable R. Williams
and undecidable problems, reducibility, recursive function theory.
Time and space measures on computation, completeness, hierarchy 18.408 Topics in Theoretical Computer Science
theorems, inherently complex problems, oracles, probabilistic Prereq: Permission of instructor
computation, and interactive proof systems. Acad Year 2023-2024: Not oered
M. Sipser Acad Year 2024-2025: G (Fall, Spring)
3-0-9 units
Can be repeated for credit.
22 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
18.413 Introduction to Computational Molecular Biology 18.417 Introduction to Computational Molecular Biology
Subject meets with 18.417 Subject meets with 18.413
Prereq: 6.1210 or permission of instructor Prereq: 6.1210 or permission of instructor
U (Spring) Acad Year 2023-2024: Not oered
Not oered regularly; consult department Acad Year 2024-2025: G (Spring)
3-0-9 units 3-0-9 units
Introduction to computational molecular biology with a focus Introduction to computational molecular biology with a focus
on the basic computational algorithms used to solve problems on the basic computational algorithms used to solve problems
in practice. Covers classical techniques in the eld for solving in practice. Covers classical techniques in the eld for solving
problems such as genome sequencing, assembly, and search; problems such as genome sequencing, assembly, and search;
detecting genome rearrangements; constructing evolutionary trees; detecting genome rearrangements; constructing evolutionary trees;
analyzing mass spectrometry data; connecting gene expression analyzing mass spectrometry data; connecting gene expression
to cellular function; and machine learning for drug discovery. to cellular function; and machine learning for drug discovery.
Prior knowledge of biology is not required. Particular emphasis on Prior knowledge of biology is not required. Particular emphasis on
problem solving, collaborative learning, theoretical analysis, and problem solving, collaborative learning, theoretical analysis, and
practical implementation of algorithms. Students taking graduate practical implementation of algorithms. Students taking graduate
version complete additional and more complex assignments. version complete additional and more complex assignments.
B. Berger B. Berger
See description under subject 6.5210[J]. Covers current research topics in computational molecular biology.
A. Moitra, D. R. Karger Recent research papers presented from leading conferences such as
the International Conference on Computational Molecular Biology
18.416[J] Randomized Algorithms (RECOMB) and the Conference on Intelligent Systems for Molecular
Same subject as 6.5220[J] Biology (ISMB). Topics include original research (both theoretical
Prereq: (6.1200[J] or 6.3700) and (6.1220[J] or 6.5210[J]) and experimental) in comparative genomics, sequence and structure
Acad Year 2023-2024: G (Spring) analysis, molecular evolution, proteomics, gene expression,
Acad Year 2024-2025: Not oered transcriptional regulation, biological networks, drug discovery,
5-0-7 units and privacy. Recent research by course participants also covered.
Participants will be expected to present individual projects to the
See description under subject 6.5220[J]. class.
D. R. Karger B. Berger
Department of Mathematics | 23
DEPARTMENT OF MATHEMATICS
24 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Propositional and predicate logic. Zermelo-Fraenkel set theory. Basics of stochastic processes. Markov chains, Poisson processes,
Ordinals and cardinals. Axiom of choice and transnite induction. random walks, birth and death processes, Brownian motion.
Elementary model theory: completeness, compactness, and J. He
Lowenheim-Skolem theorems. Godel's incompleteness theorem.
H. Cohn 18.619[J] Discrete Probability and Stochastic Processes (New)
Same subject as 6.7720[J], 15.070[J]
18.515 Mathematical Logic Prereq: 6.3702, 6.7700[J], 18.100A, 18.100B, or 18.100Q
Prereq: Permission of instructor G (Spring)
G (Spring) 3-0-9 units
Not oered regularly; consult department
3-0-9 units See description under subject 15.070[J].
G. Bresler, D. Gamarnik, E. Mossel, Y. Polyanskiy
More rigorous treatment of basic mathematical logic, Godel's
theorems, and Zermelo-Fraenkel set theory. First-order logic. 18.642 Topics in Mathematics with Applications in Finance
Models and satisfaction. Deduction and proof. Soundness and Prereq: 18.03, 18.06, and (18.05 or 18.600)
completeness. Compactness and its consequences. Quantier U (Fall)
elimination. Recursive sets and functions. Incompleteness and 3-0-9 units
undecidability. Ordinals and cardinals. Set-theoretic formalization of
mathematics. Introduction to mathematical concepts and techniques used in
Information: B. Poonen nance. Lectures focusing on linear algebra, probability, statistics,
stochastic processes, and numerical methods are interspersed
with lectures by nancial sector professionals illustrating the
corresponding application in the industry. Prior knowledge of
economics or nance helpful but not required.
P. Kempthorne, V. Strela, J. Xia
Department of Mathematics | 25
DEPARTMENT OF MATHEMATICS
Decision theory, estimation, condence intervals, hypothesis 18.677 Topics in Stochastic Processes
testing. Introduces large sample theory. Asymptotic eciency of Prereq: 18.675
estimates. Exponential families. Sequential analysis. Prior exposure G (Spring)
to both probability and statistics at the university level is assumed. 3-0-9 units
P. Kempthorne Can be repeated for credit.
26 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 27
DEPARTMENT OF MATHEMATICS
28 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Exposes students to arithmetic geometry, motivated by the problem 18.785 Number Theory I
of nding rational points on curves. Includes an introduction to p- Prereq: None. Coreq: 18.705
adic numbers and some fundamental results from number theory G (Fall)
and algebraic geometry, such as the Hasse-Minkowski theorem and 3-0-9 units
the Riemann-Roch theorem for curves. Additional topics may include
Mordell's theorem, the Weil conjectures, and Jacobian varieties. Dedekind domains, unique factorization of ideals, splitting of
S. Chidambaram primes. Lattice methods, niteness of the class group, Dirichlet's
unit theorem. Local elds, ramication, discriminants. Zeta and
L-functions, analytic class number formula. Adeles and ideles.
Statements of class eld theory and the Chebotarev density
theorem.
B. Poonen
Department of Mathematics | 29
DEPARTMENT OF MATHEMATICS
18.786 Number Theory II 18.897[J] Leadership and Professional Strategies & Skills
Prereq: 18.785 Training (LEAPS), Part II: Developing Your Leadership
G (Spring) Competencies
3-0-9 units Same subject as 5.962[J], 8.397[J], 9.981[J], 12.397[J]
Prereq: None
Continuation of 18.785. More advanced topics in number theory, G (Spring; rst half of term)
such as Galois cohomology, proofs of class eld theory, modular 2-0-1 units
forms and automorphic forms, Galois representations, or quadratic
forms. See description under subject 8.397[J]. Limited to 80.
A. Sutherland D. Rigos
30 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
Department of Mathematics | 31
DEPARTMENT OF MATHEMATICS
32 | Department of Mathematics
DEPARTMENT OF MATHEMATICS
18.C25[J] Real World Computation with Julia (New) 18.S097 Special Subject in Mathematics
Same subject as 1.C25[J], 6.C25[J], 12.C25[J], 16.C25[J], 22.C25[J] Prereq: Permission of instructor
Prereq: 6.100A, 18.03, and 18.06 U (IAP)
U (Fall) Units arranged [P/D/F]
3-0-9 units Can be repeated for credit.
Focuses on algorithms and techniques for writing and using modern Opportunity for group study of subjects in mathematics not
technical soware in a job, lab, or research group environment that otherwise included in the curriculum. Oerings are initiated by
may consist of interdisciplinary teams, where performance may be members of the Mathematics faculty on an ad hoc basis, subject to
critical, and where the soware needs to be flexible and adaptable. departmental approval. 18.S097 is graded P/D/F.
Topics include automatic dierentiation, matrix calculus, scientic Sta
machine learning, parallel and GPU computing, and performance
optimization with introductory applications to climate science, 18.S190 Special Subject in Mathematics
economics, agent-based modeling, and other areas. Labs and Prereq: Permission of instructor
projects focus on performant, readable, composable algorithms, U (IAP)
and soware. Programming will be in Julia. Expects students to Units arranged
have some familiarity with Python, Matlab, or R. No Julia experience Can be repeated for credit.
necessary.
A. Edelman, R. Ferrari, B. Forget, C. Leiseron,Y. Marzouk, J. Williams Opportunity for group study of subjects in mathematics not
otherwise included in the curriculum. Oerings are initiated by
18.UR Undergraduate Research members of the Mathematics faculty on an ad hoc basis, subject to
Prereq: Permission of instructor departmental approval.
U (Fall, IAP, Spring, Summer) Sta
Units arranged [P/D/F]
Can be repeated for credit. 18.S191 Special Subject in Mathematics
Prereq: Permission of instructor
Undergraduate research opportunities in mathematics. Permission U (Fall)
required in advance to register for this subject. For further Not oered regularly; consult department
information, consult the departmental coordinator. Units arranged
Information: W. Minicozzi Can be repeated for credit.
18.THG Graduate Thesis Opportunity for group study of subjects in mathematics not
Prereq: Permission of instructor otherwise included in the curriculum. Oerings are initiated by
G (Fall, IAP, Spring, Summer) members of the Mathematics faculty on an ad hoc basis, subject to
Units arranged departmental approval.
Can be repeated for credit. Sta
Program of research leading to the writing of a Ph.D. thesis; to be 18.S995 Special Subject in Mathematics
arranged by the student and an appropriate MIT faculty member. Prereq: Permission of instructor
Information: W. Minicozzi Acad Year 2023-2024: Not oered
Acad Year 2024-2025: G (Spring)
18.S096 Special Subject in Mathematics Units arranged
Prereq: Permission of instructor Can be repeated for credit.
U (IAP, Spring)
Units arranged Opportunity for group study of advanced subjects in mathematics
Can be repeated for credit. not otherwise included in the curriculum. Oerings are initiated by
members of the mathematics faculty on an ad hoc basis, subject to
Opportunity for group study of subjects in mathematics not departmental approval.
otherwise included in the curriculum. Oerings are initiated by Sta
members of the Mathematics faculty on an ad hoc basis, subject to
departmental approval.
Sta
Department of Mathematics | 33
DEPARTMENT OF MATHEMATICS
34 | Department of Mathematics