Math 2.0

Areas

Pick an area of mathematics, and then one of its sub-areas. Each sub-area page lists its ideas.

Reasoning and proof

Reasoning and proof is the study of how mathematicians state results, prove them, write the proofs, and find them. A proof is an argument that shows that a statement follows from the axioms, the definitions and the results that were proved before. The area treats logic as a tool of practice: it explains how to read and write statements, which methods of proof exist, and how to check a proof. This topic collects the pages on the nature of proof, the language of statements, definitions, notation, the proof methods, induction, counting and extremal arguments, proof writing, errors in proofs, heuristics, experimental mathematics, rigour and the teaching of proof. Formal logic, set theory and constructive mathematics have their own topics.

  1. Proof, theorems and mathematical method 42
  2. The language of mathematical statements 30
  3. Definitions in mathematics 29
  4. Notation, conventions and jargon 65
  5. Basic proof methods 50
  6. Induction and well-ordering as proof methods 51
  7. Counting, invariant and extremal arguments 50
  8. Proof patterns for common goals 52
  9. Writing and reading proofs 42
  10. Fallacies and errors in proofs 29
  11. Heuristics of discovery 61
  12. Plausible reasoning and experimental mathematics 29
  13. Rigour and the acceptance of proofs 27
  14. Teaching reasoning and proof 31

Mathematical logic

Mathematical logic is the study of formal languages, formal proofs and the meaning of formulas with the methods of mathematics. A formal system has a language, axioms and rules of inference, and a proof in the system is a finite sequence of formulas that obeys these rules. Logic gives precise meanings to the words statement, proof and truth, so it supports the foundations of mathematics, and it has many uses in computer science. Boole and Frege started the modern subject in the 19th century, and the results of Gödel, Tarski, Gentzen and Church in the 1930s gave it its present form. This topic collects the mathematical logic pages of math2. Its sub-areas are listed below, in reading order. Reasoning and proof, model theory, set theory, computability theory, and type theory and constructive mathematics have their own topics.

  1. Logic, formal systems and foundations 80
  2. Propositions, connectives and quantifiers 146
  3. The propositional calculus 97
  4. First-order languages and syntax 82
  5. Structures, satisfaction and truth 54
  6. Proof systems for first-order logic 46
  7. Completeness, compactness and interpolation 36
  8. Decidability of logics and theories 50
  9. Formal arithmetic and its fragments 53
  10. Gödel's incompleteness theorems and related limits 61
  11. Natural independence results and fast-growing functions 32
  12. Structural proof theory 59
  13. Ordinal analysis and ordinal notations 59
  14. Proof interpretations and conservation results 51
  15. Provability and interpretability logics 32
  16. Reverse mathematics and subsystems of second-order arithmetic 65
  17. Bounded arithmetic 29
  18. Propositional proof complexity 64
  19. Syntax, Kripke semantics and completeness of modal logic 93
  20. Modal correspondence, bisimulation and extended modal logics 71
  21. Applied modal logics
  22. Intuitionistic and intermediate logics
  23. Many-valued and fuzzy logics
  24. Substructural, linear and relevance logics
  25. Paraconsistent, free, non-monotonic and other non-classical logics
  26. Algebraic logic
  27. Truth and the semantic paradoxes
  28. Second-order logic and extensions of first-order logic 41

Model theory

Model theory is the study of mathematical structures through the formal sentences that are true in them. A model of a theory is a structure, that is a set with functions, relations and constants, in which every sentence of the theory is true. Model theory classifies theories by the behaviour of their models and of their definable sets, and its results have applications in algebra, algebraic geometry and number theory. The subject grew from the work of Löwenheim, Skolem, Gödel and Tarski, and Tarski and Abraham Robinson made it a separate branch of logic in the 1950s. This topic collects the model theory pages of math2. Its sub-areas are listed below, in reading order. Mathematical logic, set theory and computability theory have their own topics.

  1. Basic notions of model theory
  2. Elementary extensions and the Löwenheim-Skolem theorems
  3. Ultraproducts and product constructions
  4. Back-and-forth methods and Ehrenfeucht-Fraïssé games
  5. Types and saturated models
  6. Countable models and categoricity
  7. Fraïssé theory and homogeneous structures
  8. Quantifier elimination and model completeness
  9. Preservation and definability theorems
  10. Interpretations and imaginaries
  11. Indiscernibles and two-cardinal theorems
  12. Strongly minimal sets, Morley rank and categoricity
  13. Stable theories and forking
  14. Classification theory and neostability
  15. NIP theories
  16. O-minimality and tame geometry
  17. Geometric stability and definable groups
  18. Model theory of fields
  19. Model theory of valued fields
  20. Applications to Diophantine geometry
  21. Decidability and definability in number theory
  22. Models of arithmetic
  23. Model-theoretic foundations of nonstandard analysis
  24. Infinitary logics and abstract model theory
  25. Continuous logic and metric structures
  26. Model theory of modules and other special theories
  27. Finite model theory and descriptive complexity

Set theory

Set theory is the study of sets, the collections from which almost all mathematical objects can be built. The standard axiom system is Zermelo-Fraenkel set theory with the axiom of choice, called ZFC, in which every object is a set and membership is the only basic relation. Set theory gives a common language and a foundation for mathematics, and it studies the infinite through ordinal and cardinal numbers. Cantor created the subject in the 1870s, Zermelo gave the first axioms in 1908, and the work of Gödel and Cohen showed that the continuum hypothesis is independent of ZFC. This topic collects the set theory pages of math2. Its sub-areas are listed below, in reading order. Mathematical logic, model theory, computability theory, and type theory and constructive mathematics have their own topics.

  1. Sets and the algebra of sets
  2. Ordered pairs, products and relations
  3. Functions as sets
  4. Naive set theory, the paradoxes and the axioms of ZFC
  5. Natural numbers and finite sets in set theory
  6. Cardinality, countable and uncountable sets
  7. Well-orders, transfinite induction and ordinals
  8. Ordinal arithmetic and normal functions
  9. Cardinal numbers and cardinal arithmetic
  10. The axiom of choice and its equivalents
  11. Weak choice principles and set theory without choice
  12. The cumulative hierarchy and models of set theory
  13. The constructible universe
  14. Forcing
  15. The continuum hypothesis and independence
  16. Cardinal characteristics of the continuum
  17. Forcing axioms and generic absoluteness
  18. Closed unbounded sets, stationary sets and ideals
  19. Trees, Suslin's problem and combinatorial principles
  20. Infinitary partition calculus
  21. Singular cardinals and pcf theory
  22. Large cardinals below measurability
  23. Measurable cardinals and elementary embeddings
  24. Inner model theory
  25. Polish spaces and Borel sets
  26. Analytic and projective sets
  27. Determinacy and infinite games
  28. Borel equivalence relations and invariant descriptive set theory
  29. Alternative set theories
  30. Fuzzy sets and generalized sets

Computability theory

Computability theory is the study of what an algorithm can compute and of the relative difficulty of the problems that no algorithm solves. A function on the natural numbers is computable when a Turing machine, or an equivalent model of computation, gives its value for every input. The theory sets the limits of algorithms, and it supplies the methods that show that problems in logic, algebra and analysis have no algorithmic solution. Church, Turing, Kleene and Post founded the subject in the 1930s, when they made the notion of an algorithm precise. This topic collects the computability theory pages of math2. Its sub-areas are listed below, in reading order. Mathematical logic, set theory, type theory and constructive mathematics, and the theory of computation have their own topics.

  1. Effective procedures and the Church-Turing thesis
  2. Turing machines
  3. Register machines, rewriting systems and other models
  4. Primitive recursive functions and subrecursive hierarchies
  5. Partial recursive functions and the equivalence of models
  6. Indices, the s-m-n theorem and the recursion theorems
  7. Computable and computably enumerable sets
  8. The halting problem, Rice's theorem and undecidability by reduction
  9. Many-one, truth-table and other strong reducibilities
  10. The lattice of computably enumerable sets
  11. Turing reducibility and the Turing degrees
  12. Forcing in arithmetic, effectively closed classes and basis theorems
  13. The c.e. degrees and the priority method
  14. The arithmetical and Ershov hierarchies
  15. The analytical hierarchy and hyperarithmetic theory
  16. Generalized recursion theory
  17. Hilbert's tenth problem and Diophantine sets
  18. Undecidable problems in mathematics
  19. Numberings and computable structure theory
  20. Computable analysis and real computation
  21. Weihrauch reducibility and the effective content of theorems
  22. Kolmogorov complexity and algorithmic information theory
  23. Algorithmic randomness
  24. Lowness, triviality and effective dimension
  25. Computable combinatorics and effective mathematics

Type theory and constructive mathematics

Type theory and constructive mathematics study the formal systems of functions and types, and the mathematics that does not use the law of excluded middle. A type theory is a formal system in which every term has a type, and its rules act both as a logic and as a programming language. Type theories are the logical base of many proof assistants, and a constructive proof of an existence statement gives a method to compute the object. Brouwer started intuitionism early in the 20th century, Church introduced the lambda calculus in the 1930s and simple type theory in 1940, and Martin-Löf developed dependent type theory in the 1970s. This topic collects the type theory and constructive mathematics pages of math2. Its sub-areas are listed below, in reading order. Mathematical logic, computability theory, category theory, and mathematical software and formalization have their own topics.

  1. Type theory and constructivism as foundations
  2. Constructive logic and the BHK interpretation
  3. The untyped lambda calculus
  4. Reduction theory and confluence of the lambda calculus
  5. Combinatory logic
  6. The simply typed lambda calculus and simple type theory
  7. The Curry-Howard correspondence
  8. Models and semantics of lambda calculi
  9. Polymorphism, System F and the lambda cube
  10. Type systems of programming languages
  11. Martin-Löf type theory and dependent types
  12. Inductive and coinductive types
  13. Identity types and extensionality principles
  14. Homotopy type theory and univalent foundations
  15. Higher inductive types and synthetic homotopy theory
  16. Categorical models of dependent type theory
  17. Cubical, two-level, directed and modal type theories
  18. Type-theoretic foundations of proof assistants
  19. Heyting arithmetic and the metamathematics of constructive systems
  20. Realizability
  21. Brouwer's intuitionistic mathematics
  22. Bishop-style constructive analysis
  23. Constructive algebra and point-free topology
  24. Recursive mathematics and constructive reverse mathematics
  25. Constructive and intuitionistic set theory

Category theory

Category theory is the study of categories, functors and natural transformations. A category consists of objects and arrows between them, with an associative composition of arrows and an identity arrow for each object. Many constructions in algebra, topology and logic are cases of a few categorical notions, such as limits, adjoint functors and monads, so category theory gives these fields a common language. Eilenberg and Mac Lane introduced categories in 1945 in their work on algebraic topology, and Grothendieck, Kan and Lawvere extended the theory in the next decades. This topic collects the category theory pages of math2. Its sub-areas are listed below, in reading order. Homological algebra and K-theory, homotopy theory, type theory and constructive mathematics, and order, lattices and universal algebra have their own topics.

  1. Categories, functors and natural transformations
  2. Examples of categories
  3. Constructions on categories
  4. Groupoids
  5. Universal properties and the Yoneda lemma
  6. Special morphisms, subobjects and factorization systems
  7. Limits and colimits
  8. Adjoint functors
  9. Kan extensions, ends and profunctors
  10. Monads and their algebras
  11. Algebraic theories, presentability and endofunctor algebras
  12. Cartesian closed categories
  13. Categorical logic and exactness properties
  14. Fibred categories and descent
  15. Elementary toposes
  16. Grothendieck topologies and sheaves on sites
  17. Grothendieck toposes and classifying toposes
  18. Locales, point-free topology and synthetic differential geometry
  19. Monoidal categories
  20. Braided, symmetric, closed and rigid monoidal categories
  21. Tensor, fusion and Tannakian categories
  22. Enriched categories
  23. 2-categories, bicategories and double categories
  24. Simplicial methods in category theory
  25. Higher categories
  26. (infinity,1)-categories
  27. Operads and multicategories
  28. Applied category theory

Numbers and arithmetic

Numbers and arithmetic is the study of the number systems and of calculation with numbers. A number system is a set of numbers with an addition and a multiplication, and in most cases an order. The natural numbers, the integers, the rational numbers, the real numbers and the complex numbers form the main chain of number systems. Arithmetic is the first mathematics that people learn, and the number systems are the base on which algebra and analysis are built. Positional notation with a zero came from India and reached Europe through the Islamic world, and Dedekind and Cantor published rigorous constructions of the real numbers in 1872. This topic collects the numbers and arithmetic pages of math2. Its sub-areas are listed below, in reading order. Elementary number theory, elementary algebra, real analysis and field theory have their own topics.

  1. The number concept and counting
  2. Historical numeral systems
  3. Positional notation and bases
  4. The four operations on whole numbers
  5. Written and mental calculation
  6. Fractions
  7. Decimals and decimal expansions
  8. Ratio, proportion and percent
  9. Negative numbers at school level
  10. Estimation, rounding and scientific notation
  11. Quantities, units and measurement
  12. The natural numbers and the Peano axioms
  13. The integers and the rationals
  14. The real number axioms and completeness
  15. Constructions of the real numbers
  16. Irrational numbers
  17. The complex numbers as a number system
  18. Ordered fields and the Archimedean property
  19. Hypercomplex number systems
  20. Nonstandard analysis and the hyperreal numbers
  21. Surreal numbers
  22. The number π
  23. Other famous constants
  24. Large numbers and their notations
  25. Teaching and learning number and arithmetic

Elementary algebra and functions

Elementary algebra and functions is the study of the algebra and the functions that a student meets from the first use of letters for numbers to the end of pre-calculus. Elementary algebra is calculation with expressions that contain variables, together with the solution of equations and inequalities in these variables. The elementary functions are the functions that come from the rational functions, the exponential, the logarithm and the trigonometric functions by arithmetic operations, roots, inverses and composition. This material is the language of most later mathematics and of physics, engineering and economics. This topic collects the elementary algebra and functions pages of math2. Its sub-areas are listed below, in reading order. Numbers and arithmetic, calculus, real analysis, special functions, and fields and Galois theory have their own topics.

  1. Algebraic expressions and identities
  2. Exponents and radicals
  3. Linear equations, inequalities and absolute value
  4. Systems of equations at school level
  5. Quadratic equations and functions
  6. Polynomials and polynomial equations
  7. Cubic and quartic equations
  8. Rational expressions and functions
  9. Real functions and their graphs
  10. Transformations of graphs
  11. Exponential and logarithmic functions
  12. Angles and right-triangle trigonometry
  13. The unit circle and the circular functions
  14. Trigonometric identities
  15. Hyperbolic functions
  16. Complex numbers at school level
  17. Sequences and series at school level
  18. Analytic construction of the real elementary functions
  19. Elementary functions of a complex variable
  20. Teaching algebra and functions

Order, lattices and universal algebra

Order, lattices and universal algebra is the study of ordered sets, of lattices, and of the notions that all algebraic structures share. A partially ordered set is a set with a relation that is reflexive, antisymmetric and transitive, and a lattice is a partially ordered set in which each pair of elements has a least upper bound and a greatest lower bound. Orders and lattices occur in logic, topology, combinatorics and computer science, for example as Boolean algebras, as lattices of subgroups and as the domains of program semantics. Universal algebra gives one theory of homomorphisms, congruences and identities for all algebras. Boole and Dedekind started the algebra of logic and the theory of lattices in the nineteenth century, and Garrett Birkhoff made lattice theory and universal algebra into fields of their own in the 1930s. This topic collects the order, lattices and universal algebra pages of math2. Its sub-areas are listed below, in reading order. Group theory, mathematical logic, set theory and category theory have their own topics.

  1. Preorders, partial orders and total orders
  2. Maps and constructions of posets
  3. Chains, antichains, linear extensions and dimension
  4. Well-founded orders, chain conditions and well-quasi-orders
  5. Incidence algebras, Möbius functions and named posets
  6. Galois connections, closure operators and concept lattices
  7. Fixed point theorems in ordered sets
  8. Lattices and semilattices
  9. Complete lattices and completions
  10. Continuous lattices, dcpos and the order theory of domains
  11. Modular, semimodular and geometric lattices
  12. Complemented, orthocomplemented and orthomodular lattices
  13. Distributive lattices and their dualities
  14. Pseudocomplements, Heyting algebras, frames and locales
  15. Boolean algebras
  16. Stone duality
  17. Boolean functions
  18. Congruences of lattices, lattice varieties and free lattices
  19. Ordered semigroups, residuation and quantales
  20. Ordered groups, lattice-ordered groups and ordered rings
  21. Algebras, operations and homomorphisms
  22. Congruences, quotients and the isomorphism theorems
  23. Products, subdirect representation and limits
  24. Terms, free algebras and equational logic
  25. Term rewriting
  26. Varieties and Birkhoff's HSP theorem
  27. Finite basis and residual bounds
  28. Mal'cev conditions, commutator theory and tame congruence theory
  29. Clones and the algebraic approach to constraint satisfaction
  30. Quasivarieties, natural dualities and categories of algebras

Group theory

Group theory is the study of groups. A group is a set with an operation that is associative, has an identity element, and has an inverse for each element. Groups describe symmetry: the symmetries of an object form a group under composition. The subject started with the work of Lagrange, Ruffini, Abel and Galois on the roots of polynomial equations, and it grew into a central part of algebra. This topic collects the group theory pages of math2. They start with the axioms and the first examples, and continue with subgroups, quotients, group actions and the Sylow theorems. Then they treat the structure of finite groups and the classification of finite simple groups. The last parts are on abelian groups, free groups, infinite and profinite groups, and the related structures: semigroups, monoids, quasigroups and loops. Geometric group theory, Lie groups, representation theory and group cohomology have their own topics.

  1. Groups and the group axioms 97
  2. Subgroups and cyclic groups 66
  3. Cosets and Lagrange's theorem 55
  4. Homomorphisms, normal subgroups and the isomorphism theorems 73
  5. Automorphisms, centres and commutators
  6. Symmetric and alternating groups
  7. Standard examples and small groups
  8. Group actions
  9. Products and extensions
  10. Cauchy and Sylow theorems
  11. Series, composition factors and simple groups
  12. Solvable groups
  13. Nilpotent groups
  14. Finite p-groups
  15. Transfer, fusion and local analysis
  16. Arithmetic and combinatorial properties of finite groups
  17. Permutation groups
  18. Finite groups of Lie type
  19. The classification of finite simple groups
  20. Sporadic simple groups
  21. Finite and finitely generated abelian groups
  22. Infinite abelian groups
  23. Free groups and presentations, basic level
  24. Infinite groups, local properties and varieties
  25. Profinite and pro-p groups
  26. Semigroups and monoids, basic theory
  27. Structure theory of semigroups
  28. Finite semigroups, automata and pseudovarieties
  29. Magmas, quasigroups, loops and other group-like structures
  30. Probabilistic and statistical group theory

Geometric group theory

Geometric group theory is the study of infinite groups, most of them finitely generated, through their presentations, their algorithms and the geometry of the spaces on which they act. A finite generating set makes a group into a metric space with the word metric, and the geometry of this space up to quasi-isometry does not depend on the choice of the finite generating set. The subject links algebra with topology and geometry, and the fundamental groups of manifolds, the mapping class groups of surfaces and the braid groups are central examples. Dehn stated the word, conjugacy and isomorphism problems for groups in 1911, and the work of Gromov on growth and on hyperbolic groups in the 1980s made the geometric view a field of its own. This topic collects the geometric group theory pages of math2. Its sub-areas are listed below, in reading order. Group theory, Lie groups, representation theory, low-dimensional topology and homological algebra have their own topics.

  1. Overview and groups acting on spaces
  2. Free groups and Nielsen methods
  3. Free products, amalgams and HNN extensions
  4. Presentations, Tietze moves and presentation complexes
  5. Decision problems for groups
  6. Small cancellation theory, van Kampen diagrams and random groups
  7. One-relator groups
  8. Cayley graphs and word metrics
  9. Quasi-isometry and coarse invariants of groups
  10. Bass-Serre theory, groups acting on trees and splittings
  11. Growth of groups
  12. Hyperbolic groups
  13. Relatively hyperbolic and acylindrically hyperbolic groups
  14. Dehn functions, isoperimetry and automatic groups
  15. CAT(0) groups, cube complexes and special groups
  16. Amenable groups and paradoxical decompositions
  17. Random walks on groups and analytic properties
  18. Coxeter groups and reflection groups
  19. Artin groups and braid groups
  20. Mapping class groups of surfaces
  21. Automorphisms of free groups
  22. Infinite nilpotent, polycyclic and solvable groups
  23. The Burnside problem and exotic infinite groups
  24. Groups acting on rooted trees and Thompson's groups
  25. Finitely generated linear groups and residual properties
  26. The modular group, Fuchsian groups and Kleinian groups as groups
  27. Crystallographic groups and discrete groups of Euclidean isometries
  28. Orderable groups
  29. Equations over groups and limit groups
  30. Topological finiteness properties and aspherical complexes

Linear algebra

Linear algebra is the study of vector spaces, of the linear maps between them, and of the matrices that represent these maps. A vector space over a field is a set with an addition and a multiplication by scalars that obey the usual rules of arithmetic, and a linear map is a map that keeps these two operations. Linear algebra is used in almost every part of mathematics and in physics, statistics, engineering and computer science, because many problems become linear in a first approximation. The Chinese text The Nine Chapters on the Mathematical Art solved systems of linear equations by elimination, and Peano gave the axioms of a vector space in 1888. This topic collects the linear algebra pages of math2. Its sub-areas are listed below, in reading order. Matrix theory and multilinear algebra, numerical analysis, rings and modules, and functional analysis have their own topics.

  1. Overview and vectors in the plane and in space
  2. Systems of linear equations and row reduction
  3. Matrices and the operations on them
  4. Invertible matrices and matrix factorizations
  5. Vector spaces, span, independence, bases and dimension
  6. Linear maps
  7. Direct sums, complements and quotient spaces
  8. Matrices of linear maps, rank and change of basis
  9. Dual spaces and duality
  10. Determinants
  11. Eigenvalues, the characteristic polynomial and the minimal polynomial
  12. Diagonalization, triangularization and invariant subspaces
  13. Canonical forms under similarity
  14. Inner product spaces
  15. Orthogonal complements, projections and least squares
  16. Adjoints, normal operators and the spectral theorems
  17. Isometries and the orthogonal and unitary groups
  18. Positive definite matrices and the singular value decomposition
  19. Bilinear and sesquilinear forms
  20. Quadratic forms over fields and the principal axis theorem
  21. Applications of linear algebra

Matrix theory and multilinear algebra

Matrix theory and multilinear algebra is the study of matrices beyond the first course in linear algebra, and of tensors and the algebras built from them. Matrix theory treats a matrix as an object of its own: it bounds and locates eigenvalues and singular values, compares matrices by norms and orders, and studies the classes of matrices that a pattern or a sign condition defines. The results are used in numerical analysis, statistics, optimization, control theory, quantum information and combinatorics. Grassmann introduced the exterior algebra in 1844, and Perron and Frobenius proved their theorems on positive and nonnegative matrices between 1907 and 1912. This topic collects the matrix theory and multilinear algebra pages of math2. Its sub-areas are listed below, in reading order. Linear algebra, numerical analysis, Lie theory and random structures have their own topics.

  1. Block matrices and determinant identities
  2. Matrix norms and the numerical range
  3. Eigenvalue variational principles and localization
  4. Matrix perturbation theory
  5. Singular value inequalities and low-rank approximation
  6. Majorization and doubly stochastic matrices
  7. Positive definite matrices
  8. Matrix and trace inequalities
  9. Operator monotone functions and matrix means
  10. Functions of matrices
  11. Matrix equations and matrix stability
  12. Matrix pencils and matrix polynomials
  13. Commuting matrices and matrix algebras
  14. Nonnegative matrices and Perron-Frobenius theory
  15. Stochastic matrices and their products
  16. Totally positive matrices
  17. Structured and named matrices
  18. Combinatorial matrix theory
  19. Permanents and immanants
  20. Generalized inverses of matrices
  21. Matrices over rings and integer matrices
  22. Max-plus and tropical linear algebra
  23. Matrix groups and matrix Lie algebras as matrices
  24. Tensor products of vector spaces
  25. Tensor and symmetric algebras and tensor invariants
  26. Exterior algebra and Grassmann algebra
  27. Clifford algebras and spinors
  28. Tensor rank and tensor decompositions
  29. Matrix completion, inverse eigenvalue problems and linear preservers

Rings and modules

Rings and modules is the study of rings that need not be commutative, of the modules over them, and of algebras in which the product need not be associative. A ring is a set with an addition that makes it an abelian group and an associative multiplication that distributes over the addition. A module over a ring is an abelian group on which the ring acts by multiplication with scalars. Modules give one setting for vector spaces, abelian groups, ideals and the representations of groups, and noncommutative rings occur as matrix rings, group rings and rings of differential operators. Wedderburn classified the semisimple finite-dimensional algebras in 1908, and Artin extended the result to rings with the descending chain condition in 1927. This topic collects the rings and modules pages of math2. Its sub-areas are listed below, in reading order. Commutative algebra, representation theory, Lie theory and homological algebra have their own topics.

  1. Rings, first examples and special elements
  2. Ring homomorphisms, ideals and quotient rings
  3. Polynomials over general and noncommutative rings
  4. Modules, submodules and homomorphisms
  5. Modules over a principal ideal domain
  6. Chain conditions on noncommutative rings, composition series and Krull-Schmidt
  7. Semisimple modules and the Artin-Wedderburn theorem
  8. The Jacobson radical, radicals, and prime and primitive rings
  9. Projective, injective and flat modules
  10. Morita theory and equivalences of module categories
  11. Local, semiperfect and quasi-Frobenius rings
  12. Von Neumann regular rings and conditions on elements
  13. Division rings and the quaternions
  14. Central simple algebras and Brauer groups
  15. Orders in semisimple algebras
  16. Noncommutative localization and Goldie theory
  17. Noncommutative Noetherian rings, dimension and growth
  18. Rings with polynomial identities
  19. Ring constructions, group rings and Weyl algebras
  20. Homological dimensions of noncommutative rings
  21. Hopf algebras and quantum groups
  22. Graded, filtered and involutive rings
  23. Semirings, near-rings and other generalizations
  24. General theory of nonassociative algebras
  25. Alternative algebras, composition algebras and octonion algebras
  26. Malcev, pre-Lie, Leibniz and other nonassociative algebras
  27. Jordan algebras, Jordan pairs and triple systems

Commutative algebra

Commutative algebra is the study of commutative rings, their ideals and their modules. A commutative ring is a ring in which the product of two elements does not depend on their order, such as the ring of integers or a ring of polynomials. Commutative algebra gives the algebraic tools of algebraic geometry and algebraic number theory, because the rings of polynomial functions on varieties and the rings of algebraic integers are commutative rings. The subject grew from the ideal theory of Dedekind and Kronecker and from the work of Hilbert on polynomial rings and invariants, and Emmy Noether gave it its abstract form in the 1920s. This topic collects the commutative algebra pages of math2. Its sub-areas are listed below, in reading order. Rings and modules, algebraic geometry, algebraic number theory and homological algebra have their own topics.

  1. Commutative rings and ideals
  2. Polynomial rings
  3. Divisibility and factorization in integral domains
  4. Modules over commutative rings
  5. Localization and local rings
  6. The prime spectrum of a ring
  7. Noetherian and Artinian rings
  8. Primary decomposition
  9. Integral dependence and integral closure
  10. Nullstellensatz and Noether normalization
  11. Graded rings, filtrations and Hilbert functions
  12. Dimension theory
  13. Completion and power series rings
  14. Valuation rings, Dedekind domains and class groups
  15. Projective, flat and injective modules
  16. Free resolutions and syzygies
  17. Regular sequences, depth and the Koszul complex
  18. Regular local rings
  19. Cohen-Macaulay rings and modules
  20. Gorenstein rings, complete intersections and canonical modules
  21. Local cohomology
  22. Multiplicity and integral closure of ideals
  23. Homological conjectures
  24. Derivations, differentials and étale algebras
  25. Henselian and excellent rings
  26. Characteristic p methods
  27. Invariant rings
  28. Combinatorial commutative algebra
  29. Gröbner bases and computational commutative algebra
  30. Finite rings and special constructions

Fields and Galois theory

Fields and Galois theory is the study of fields, of their extensions and of the polynomials over them. A field is a commutative ring in which every nonzero element has a multiplicative inverse, such as the rational numbers, the real numbers or the integers modulo a prime. Galois theory attaches a group of automorphisms to a field extension, so that questions about the roots of polynomials become questions about finite groups. Galois used groups of permutations of the roots in about 1830 to decide which polynomial equations are solvable by radicals, and Dedekind, Artin and others later gave the theory its modern form in terms of fields. This topic collects the fields and Galois theory pages of math2. Its sub-areas are listed below, in reading order. Commutative algebra, algebraic number theory, group theory and model theory have their own topics.

  1. Fields, characteristic and prime fields
  2. Roots, symmetric functions, resultants and discriminants
  3. Irreducibility criteria and factorization
  4. Field extensions and algebraic elements
  5. Splitting fields and algebraic closure
  6. Normal, separable and inseparable extensions
  7. Galois groups and the Galois correspondence
  8. Computing Galois groups of polynomials
  9. Finite fields
  10. Roots of unity and cyclotomic extensions
  11. Cyclic, abelian, Kummer and Artin-Schreier extensions
  12. Solution of equations by radicals
  13. Constructible numbers and the classical problems
  14. Polynomials and equations over finite fields
  15. Characters and character sums over finite fields
  16. Transcendence bases and transcendental extensions
  17. Orderings, formally real and real closed fields
  18. Location and counting of real roots
  19. Absolute values and completions
  20. Valuations, Henselian fields and series fields
  21. Infinite Galois theory and absolute Galois groups
  22. Galois cohomology and the Brauer group of a field
  23. Cohomological dimension, quasi-algebraically closed fields and Milnor K-theory
  24. The inverse Galois problem and field arithmetic
  25. Differential fields and differential Galois theory
  26. Difference fields and p-adic differential equations
  27. Near-fields, semifields and other generalized fields

Lie theory and topological groups

Lie theory and topological groups is the study of groups that carry a topology or a smooth structure, and of the Lie algebras that belong to them. A Lie group is a group that is also a smooth manifold, such that multiplication and inversion are smooth maps. Lie groups describe continuous symmetry, so they occur in differential geometry, in number theory and in physics. Sophus Lie introduced continuous groups of transformations in the 1870s to study differential equations, and Killing and Cartan later classified the simple Lie algebras over the complex numbers. This topic collects the Lie theory and topological groups pages of math2. Its sub-areas are listed below, in reading order. Representation theory, harmonic analysis, group theory and differential geometry have their own topics.

  1. Definitions and first properties of topological groups
  2. Uniform structures, metrizability and Polish groups
  3. Locally compact groups and Hilbert's fifth problem
  4. Structure of compact groups and of locally compact abelian groups
  5. Topological semigroups, groupoids and other topological algebraic structures
  6. Lie groups, the exponential map and the Lie correspondence
  7. Classical Lie groups and the standard examples
  8. Definitions, constructions and examples of Lie algebras
  9. Solvable and nilpotent Lie algebras
  10. Structure of semisimple Lie algebras
  11. Root systems, Weyl groups and Dynkin diagrams
  12. Classification of simple Lie algebras and the exceptional algebras
  13. Nilpotent orbits, invariant polynomials and the adjoint quotient
  14. Universal enveloping algebras and free Lie algebras
  15. Lie algebra cohomology and deformations
  16. Structure of compact Lie groups
  17. Semisimple, reductive and solvable Lie groups
  18. Homogeneous spaces and transformation groups
  19. Foundations of algebraic groups and group schemes
  20. Structure of reductive groups
  21. Algebraic groups over arbitrary fields
  22. Bruhat-Tits theory and reductive groups over local fields
  23. Reductive group actions and geometric invariant theory
  24. Lattices and arithmetic groups
  25. Rigidity of lattices and actions
  26. Kac-Moody algebras and infinite-dimensional Lie theory
  27. Vertex algebras and vertex operator algebras
  28. Lie bialgebras, Poisson-Lie groups and classical r-matrices
  29. Lie superalgebras and generalizations of Lie algebras

Representation theory

Representation theory is the study of groups and algebras through their actions by linear maps on vector spaces. A representation of a group is a homomorphism from the group to the group of invertible linear maps of a vector space. Representations turn questions about groups into questions of linear algebra, and they are used in number theory, in combinatorics, in harmonic analysis and in quantum physics. Frobenius created the character theory of finite groups in 1896, and Burnside, Schur, Weyl and Brauer extended the theory in the following decades. This topic collects the representation theory pages of math2. Its sub-areas are listed below, in reading order. Group theory, Lie theory and topological groups, harmonic analysis, rings and modules and automorphic forms have their own topics.

  1. Foundations of representations of finite groups
  2. Character theory of finite groups
  3. Induction, restriction and Clifford theory
  4. Real and projective representations, Burnside rings and applications
  5. Representations of the symmetric groups
  6. Schur-Weyl duality and polynomial representations of general linear groups
  7. Modular representations of finite groups
  8. Block theory of finite groups
  9. Integral and p-adic representations of finite groups
  10. Representations of finite groups of Lie type and of algebraic groups
  11. Hecke algebras and diagram algebras
  12. Foundations of representations of Lie algebras
  13. Highest weight theory and character formulas
  14. Verma modules and category O
  15. Representations of affine Kac-Moody and Virasoro algebras
  16. Representations of compact groups
  17. Representations of compact Lie groups
  18. Unitary representations of locally compact groups
  19. Group algebras, Plancherel theorems and rigidity
  20. Representations of real reductive groups
  21. Representations of nilpotent and solvable Lie groups and the Weil representation
  22. Smooth representations of p-adic reductive groups
  23. Representations of quivers and finite-dimensional algebras
  24. Auslander-Reiten theory, tilting and representation type
  25. Geometric representation theory
  26. Representations of quantum groups
  27. Categorification
  28. Representation theory in physics and chemistry

Homological algebra and K-theory

Homological algebra studies chain complexes, their homology, and the derived functors that measure how far a functor is from being exact. A chain complex is a sequence of modules and maps in which the composite of two consecutive maps is zero. K-theory attaches abelian groups to rings, schemes, spaces and categories, starting with the Grothendieck group of projective modules or of vector bundles, and it connects algebra with topology and number theory. Homological algebra took its modern form in the book of Cartan and Eilenberg of 1956, and Grothendieck introduced the Grothendieck group in the 1950s for his work on the Riemann-Roch theorem. This topic collects the homological algebra and K-theory pages of math2. Its sub-areas are listed below, in reading order. Category theory, commutative algebra, algebraic topology, homotopy theory and operator algebras have their own topics.

  1. Exact sequences and the diagram lemmas
  2. Chain complexes and their homology
  3. Abelian categories for homological algebra
  4. Projective and injective objects and resolutions
  5. Derived functors
  6. Ext and Tor
  7. Spectral sequences as algebra
  8. Homological dimensions and relative homological algebra
  9. Simplicial and nonabelian homological algebra
  10. Derived categories
  11. Triangulated categories
  12. t-structures and stability conditions
  13. dg categories and A-infinity structures
  14. Hochschild and cyclic homology
  15. Cohomology of groups
  16. Advanced cohomology of groups
  17. Grothendieck groups and K0
  18. Stably free modules and stability theorems
  19. K1 and Whitehead groups
  20. Relative, lower and negative K-theory
  21. K2 and Steinberg groups
  22. Constructions of higher algebraic K-theory
  23. Fundamental theorems and computations of higher K-theory
  24. K-theory of schemes, motivic and étale K-theory
  25. K-theory in number theory
  26. K-theory of group rings, assembly and Hermitian K-theory
  27. Trace methods
  28. Topological K-theory
  29. Advanced topological K-theory

Elementary number theory

Elementary number theory is the study of the integers with methods that use no complex analysis and little algebra beyond congruences. Its central objects are the primes, and a prime is an integer greater than 1 whose only positive divisors are 1 and itself. Congruences and primality tests are the base of public-key cryptography, of check digits and of many algorithms on integers. Euclid proved that there are infinitely many primes, and Gauss gave the subject its modern form in the Disquisitiones Arithmeticae of 1801. This topic collects the elementary number theory pages of math2. Its sub-areas are listed below, in reading order. Analytic number theory, additive number theory, algebraic number theory and arithmetic geometry have their own topics.

  1. Divisibility, division with remainder and the gcd
  2. Primes and unique factorization
  3. Elementary results on the distribution of primes
  4. Congruences and residue classes
  5. The theorems of Fermat, Euler and Wilson
  6. Polynomial congruences and Hensel lifting
  7. Primitive roots and multiplicative order
  8. Quadratic residues and quadratic reciprocity
  9. Gaussian and Eisenstein integers
  10. Sums of squares and Pythagorean triples
  11. Simple continued fractions
  12. Pell's equation and quadratic equations in two variables
  13. Farey sequences, the Stern-Brocot tree and floor identities
  14. Arithmetic functions and Dirichlet convolution
  15. Perfect, amicable and related numbers
  16. Mersenne, Fermat and other special primes
  17. Primality testing and pseudoprimes
  18. Factorials, binomial coefficients and Bernoulli numbers
  19. Figurate numbers and perfect powers
  20. Digits as number theory
  21. Linear Diophantine equations and the Frobenius problem
  22. Nonlinear Diophantine equations by elementary methods
  23. Fibonacci and Lucas numbers
  24. Recurrence sequences and integer iterations
  25. Applications and problems of elementary number theory

Analytic number theory

Analytic number theory is the study of the integers, and above all of the primes, with the methods of real and complex analysis. Its central object is the Riemann zeta function, which is the sum of the reciprocals of the s-th powers of the positive integers and which is equal to a product over the primes. The zeros of the zeta function control the error in the count of primes, so many questions on primes become questions on the zeros of zeta and L-functions. Dirichlet used L-functions in 1837 to prove that each arithmetic progression with coprime first term and difference contains infinitely many primes, and Hadamard and de la Vallée Poussin proved the prime number theorem in 1896. This topic collects the analytic number theory pages of math2. Its sub-areas are listed below, in reading order. Elementary number theory, additive number theory, Diophantine approximation, and automorphic forms and the Langlands program have their own topics.

  1. Counting functions and summation tools
  2. Elementary estimates for primes
  3. Dirichlet series and Euler products
  4. The Riemann zeta function
  5. Zeros of the zeta function
  6. The Riemann hypothesis
  7. The prime number theorem
  8. Explicit formulas and oscillation
  9. Dirichlet characters and L-functions
  10. Primes in arithmetic progressions
  11. Sieve methods
  12. The large sieve
  13. Exponential sums
  14. Character sums
  15. Sums over primes
  16. Multiplicative functions and the pretentious approach
  17. Probabilistic number theory
  18. Averages, extremal orders and lattice point problems
  19. Integers with restricted prime factors
  20. Prime gaps and primes in short intervals
  21. Bounded gaps and prime k-tuples
  22. Primes of special form
  23. Growth and value distribution of the zeta function
  24. Mean value theorems and moments
  25. Random matrix model for zeta and L-functions
  26. General L-functions and the Selberg class
  27. Other zeta functions and generalized primes
  28. Computations in analytic number theory

Algebraic number theory

Algebraic number theory is the study of number fields, of their rings of integers and of their completions. A number field is a field that contains the rational numbers and has finite dimension as a vector space over them. In a ring of integers the factorization of elements into irreducibles need not be unique, but each nonzero ideal is a product of prime ideals in exactly one way. Kummer introduced ideal numbers in his work on Fermat's Last Theorem, and Dedekind and Hilbert built the theory of ideals and of number fields in the late nineteenth century. This topic collects the algebraic number theory pages of math2. Its sub-areas are listed below, in reading order. Fields and Galois theory, arithmetic geometry, and automorphic forms and the Langlands program have their own topics.

  1. Number fields and algebraic integers
  2. Ideal arithmetic and prime decomposition in number rings
  3. The class group and Minkowski theory
  4. Units of number fields
  5. Quadratic fields
  6. Arithmetic of cyclotomic fields
  7. Hilbert's ramification theory
  8. Local fields and completions of number fields
  9. p-adic analysis in number theory
  10. Local class field theory
  11. Adeles and ideles
  12. Global class field theory
  13. Galois cohomology of local and global fields
  14. Zeta and L-functions of number fields
  15. Distribution of prime ideals
  16. Galois module structure and the counting of number fields
  17. Iwasawa theory
  18. Special algebraic numbers and Mahler measure
  19. Arithmetic of global function fields
  20. Central simple algebras over local and global fields
  21. Binary quadratic forms
  22. Algebraic theory of quadratic forms
  23. Quadratic forms over local and global fields
  24. Integral quadratic forms and lattices
  25. Computational algebraic number theory

Arithmetic geometry

Arithmetic geometry is the study of polynomial equations over number fields, local fields and finite fields with the methods of algebraic geometry. Its central objects are the rational points of varieties that are defined over number fields. The geometry of a variety controls its arithmetic: for example, a curve of genus at least two over a number field has only finitely many rational points, by the theorem of Faltings. Mordell proved in 1922 that the rational points of an elliptic curve over the rational numbers form a finitely generated group, and Wiles used the arithmetic of elliptic curves to prove Fermat's Last Theorem in 1995. This topic collects the arithmetic geometry pages of math2. Its sub-areas are listed below, in reading order. Algebraic geometry, algebraic number theory, Diophantine approximation, and automorphic forms and the Langlands program have their own topics.

  1. Foundations of Diophantine geometry
  2. The Hasse principle and its obstructions
  3. Diophantine equations of higher degree and the abc conjecture
  4. Rational points on curves
  5. Elliptic curves, their equations and the group law
  6. Isogenies, endomorphisms and pairings
  7. Elliptic curves over finite fields
  8. Elliptic curves over local fields
  9. The Mordell-Weil theorem and descent
  10. Torsion and rank of elliptic curves
  11. Congruent numbers and classical problems on cubic curves
  12. L-functions of elliptic curves
  13. The Birch and Swinnerton-Dyer conjecture and Euler systems
  14. Complex multiplication
  15. Arithmetic of modular curves and Shimura curves
  16. Fermat's Last Theorem and the modular method
  17. Galois representations attached to varieties
  18. p-adic Hodge theory
  19. Non-archimedean analytic geometry
  20. Heights and Arakelov theory
  21. Arithmetic of abelian varieties
  22. Zeta functions and varieties over finite fields
  23. L-functions of varieties and their special values
  24. Rational points on higher-dimensional varieties
  25. Counting rational points
  26. Unlikely intersections
  27. Shimura varieties and arithmetic moduli spaces
  28. Arithmetic geometry over function fields
  29. Arithmetic fundamental groups and anabelian geometry
  30. Arithmetic dynamics

Automorphic forms and the Langlands program

The theory of automorphic forms studies functions on symmetric spaces that are invariant under arithmetic groups, together with their L-functions and their Galois representations. A modular form is a holomorphic function on the upper half-plane that transforms in a fixed way under a congruence subgroup of SL2(Z) and is holomorphic at the cusps. The Fourier coefficients of modular forms carry arithmetic data, for example the number of representations of an integer by a quadratic form and the number of points of an elliptic curve modulo a prime. The Langlands program, which Langlands formulated in the late 1960s, predicts a correspondence between automorphic representations and Galois representations, and class field theory is its abelian case. This topic collects the automorphic forms and the Langlands program pages of math2. Its sub-areas are listed below, in reading order. Arithmetic geometry, algebraic number theory, representation theory, and Lie theory and topological groups have their own topics.

  1. Modular forms for SL2(Z) and congruence subgroups
  2. Eisenstein series, the eta and discriminant functions, and the j-function
  3. Theta functions and theta series
  4. Hecke operators, eigenforms and newforms
  5. L-functions of modular forms
  6. Modular curves and modular Jacobians
  7. Derivatives of modular forms and quasimodular forms
  8. Modular forms of half-integral weight
  9. Maass forms and the spectral theory of the modular surface
  10. The Selberg and Kuznetsov trace formulas
  11. Congruences, modular forms mod p and p-adic modular forms
  12. Galois representations attached to modular and automorphic forms
  13. Modularity lifting and the modularity theorems
  14. Hilbert and Bianchi modular forms
  15. Siegel modular forms
  16. Jacobi forms, harmonic Maass forms and mock modular forms
  17. Modular forms on other groups and fields
  18. Cohomology of arithmetic groups and automorphic forms
  19. Automorphic forms and representations of adele groups
  20. L-groups, functoriality and global reciprocity
  21. Local factors and the Galois side of local Langlands
  22. The local Langlands correspondence
  23. Automorphic L-functions and periods
  24. The Arthur-Selberg trace formula and endoscopy
  25. The p-adic and mod p Langlands programs
  26. The geometric Langlands program

Additive and combinatorial number theory

Additive and combinatorial number theory is the study of sets of integers, and of subsets of abelian groups, through their sums. Its central object is the sumset A + B, the set of all sums a + b with a in A and b in B. The area asks which integers are sums of elements of a given set, how large a sumset must be, and what structure a set with few sums has. Goldbach's letter to Euler of 1742 and Waring's book of 1770 started the classical theory, and the circle method of Hardy and Littlewood in the 1920s became its main tool. This topic collects the additive and combinatorial number theory pages of math2. Its sub-areas are listed below, in reading order. Elementary number theory, analytic number theory, enumerative combinatorics and extremal and probabilistic combinatorics have their own topics.

  1. Foundations of additive number theory
  2. Densities of sets of integers
  3. Sums of polygonal numbers and classical representations
  4. Waring's problem and sums of powers
  5. The Hardy-Littlewood circle method
  6. Goldbach and additive problems with primes
  7. Elementary theory of integer partitions
  8. Analytic theory of partitions
  9. Partition congruences
  10. Partition identities and q-series
  11. Sumsets and direct theorems
  12. Freiman theory and inverse problems
  13. Roth's theorem and three-term progressions
  14. Szemerédi's theorem and higher order Fourier analysis
  15. Patterns in primes and sparse sets
  16. Sum-product phenomena
  17. Sidon sets and additive bases
  18. Sum-free sets and related extremal sets
  19. Zero-sum problems
  20. Covering systems, sets of multiples and Erdős problems

Diophantine approximation and geometry of numbers

Diophantine approximation is the study of how well real numbers can be approximated by rational numbers, and the geometry of numbers is the study of lattice points in convex bodies. A lattice in n-dimensional space is the set of all integer combinations of n linearly independent vectors. The two parts meet because a good rational approximation is a lattice point in a thin region, and Minkowski's convex body theorem finds such points. Dirichlet proved his approximation theorem in 1842, Liouville constructed the first transcendental numbers in 1844, and Minkowski founded the geometry of numbers in the 1890s. This topic collects the Diophantine approximation and geometry of numbers pages of math2. Its sub-areas are listed below, in reading order. Algebraic number theory, analytic number theory, arithmetic geometry, ergodic theory and convex and discrete geometry have their own topics.

  1. Rational approximation of real numbers
  2. Continued fractions in Diophantine approximation
  3. The Lagrange and Markov spectra
  4. Lattices in Euclidean space
  5. Minkowski's theorems on convex bodies and lattice points
  6. Reduction theory, minima of forms and lattice algorithms
  7. Root lattices, exceptional lattices and lattices from codes
  8. The space of lattices and mean value theorems
  9. Simultaneous approximation and linear forms
  10. Inhomogeneous approximation and Kronecker's theorem
  11. Rational approximation to algebraic numbers
  12. The Schmidt subspace theorem and its applications
  13. Mahler's classification and approximation by algebraic numbers
  14. Metric Diophantine approximation
  15. Metric theory of continued fractions
  16. Homogeneous dynamics and Diophantine problems
  17. Uniform distribution modulo one
  18. Discrepancy and quasi-random point sets
  19. Normal numbers
  20. Metric theory of digit expansions
  21. Powers modulo one and Pisot numbers
  22. Irrationality proofs
  23. Classical transcendence theorems
  24. Methods of transcendence theory
  25. Linear forms in logarithms
  26. Algebraic independence and periods
  27. Transcendence on algebraic groups and Diophantine approximation on varieties

Enumerative combinatorics

Enumerative combinatorics is the study of the number of ways to build a finite structure of a given kind. Its central object is a counting sequence, the number of structures of each size, and a generating function often records this sequence. Counting problems occur in probability, in the analysis of algorithms, in statistical physics and in every part of discrete mathematics. Pascal and Fermat used binomial coefficients to solve problems of probability in the 17th century, and Euler used generating functions to count partitions in the 18th century. This topic collects the enumerative combinatorics pages of math2: counting principles, binomial coefficients, inclusion-exclusion, generating functions and recurrences, lattice paths, Stirling and Bell numbers, permutation statistics and patterns, q-analogues, Pólya counting, species, analytic combinatorics, combinatorial identities and combinatorics on words. Algebraic combinatorics, additive and combinatorial number theory, graph theory and special functions have their own topics.

  1. Counting principles, permutations and combinations
  2. Binomial and multinomial coefficients
  3. Inclusion-exclusion and the sieve
  4. Generating functions
  5. Recurrence relations and finite differences
  6. Lattice paths and Catalan numbers
  7. Compositions and partition enumeration
  8. Set partitions, Stirling and Bell numbers
  9. Permutation statistics
  10. q-analogues
  11. Permutation patterns
  12. Pólya counting
  13. Labelled structures, trees and species
  14. The symbolic method
  15. Analytic combinatorics
  16. Combinatorial identities and their proofs
  17. Tilings, non-intersecting paths and determinants
  18. Rational generating functions and combinatorial reciprocity
  19. Unimodality and log-concavity
  20. Umbral calculus and Sheffer sequences
  21. Combinatorial number sequences
  22. Combinatorics on words
  23. Combinatorial generation and Gray codes

Algebraic combinatorics

Algebraic combinatorics is the study of combinatorial objects with the methods of algebra, and of algebraic structures through combinatorial models. A typical object is a standard Young tableau, a filling of a diagram of boxes with the numbers 1 to n that increase along each row and down each column. Tableaux count the dimensions of the irreducible representations of the symmetric groups, and symmetric functions record the characters of these groups and of the general linear groups. Young introduced tableaux in 1900, and Schur used symmetric functions to study the representations of the general linear group in his thesis of 1901. This topic collects the algebraic combinatorics pages of math2. Its sub-areas are listed below, in reading order. Enumerative combinatorics, representation theory, commutative algebra and convex and discrete geometry have their own topics.

  1. Young tableaux and their variants
  2. The ring of symmetric functions
  3. Schur functions and their identities
  4. The RSK correspondence and tableau algorithms
  5. The Littlewood-Richardson rule
  6. Hall-Littlewood, Macdonald and Jack polynomials
  7. Coinvariants, diagonal harmonics and parking functions
  8. Quasisymmetric functions and combinatorial Hopf algebras
  9. Chromatic symmetric functions
  10. Combinatorics of Coxeter groups
  11. Coxeter-Catalan combinatorics
  12. Schubert polynomials and the combinatorics of flag varieties
  13. Crystals as combinatorial objects
  14. Dynamical algebraic combinatorics
  15. Association schemes and distance-regular graphs
  16. Face numbers of simplicial complexes
  17. Poset topology and combinatorial complexes
  18. Combinatorics of hyperplane arrangements
  19. Combinatorics of cluster algebras
  20. Total positivity and the positive Grassmannian

Extremal and probabilistic combinatorics

Extremal and probabilistic combinatorics is the study of how large or small a finite structure can be under a given restriction. A typical result is Turán's theorem, which gives the largest number of edges in a graph on n vertices with no complete subgraph on r + 1 vertices. The probabilistic method proves that a structure exists by showing that a random choice has the required property with positive probability, and it is one of the main tools of the area. Ramsey proved his theorem in 1930, Turán proved his theorem in 1941, and Erdős used random colourings in 1947 to give a lower bound for Ramsey numbers. This topic collects the extremal and probabilistic combinatorics pages of math2. Its sub-areas are listed below, in reading order. Graph theory, additive and combinatorial number theory, probability theory and algebraic topology have their own topics.

  1. Ramsey's theorem and Ramsey numbers
  2. Ramsey theory of graphs
  3. Ramsey theory on the integers
  4. Hales-Jewett, Hindman and structural Ramsey theorems
  5. Antichains and intersecting families
  6. Shadows, compressions and isoperimetry in the cube
  7. Sunflowers and spread families
  8. VC dimension and traces
  9. Transversals, matchings and covers
  10. Turán-type problems for graphs
  11. Bipartite Turán problems
  12. Hypergraph Turán problems
  13. Dirac-type problems, tilings and absorption
  14. The regularity method
  15. Graph limits, quasirandomness and flag algebras
  16. The probabilistic method
  17. The local lemma and correlation inequalities
  18. Concentration in combinatorics
  19. Random graphs
  20. The semi-random method and random processes
  21. Sharp thresholds and influences
  22. The linear algebra method
  23. The polynomial method
  24. The container method
  25. The entropy method
  26. Combinatorial discrepancy
  27. Kneser graphs and their generalizations

Designs, matroids and finite geometries

The theory of designs, matroids and finite geometries is the study of finite incidence structures, which are sets of points and blocks with a rule that tells which points lie on which blocks. A balanced incomplete block design is a family of k-element blocks in a set of v points such that every pair of points lies in the same number of blocks. A matroid is an abstract independence structure that has the common properties of linear independence in vector spaces and of forests in graphs. Kirkman posed his schoolgirl problem in 1850, Fisher used designs to plan agricultural experiments in the 1920s, and Whitney introduced matroids in 1935. This topic collects the pages of math2 on the area: block designs, Steiner systems and resolvable designs, Latin squares and orthogonal arrays, difference sets, finite projective planes and Galois geometry, generalized polygons, matroids and their invariants, and polyomino tilings. Coding theory, group theory, graph theory and convex and discrete geometry have their own topics.

  1. Incidence structures and the language of designs
  2. Balanced incomplete block designs
  3. Symmetric designs and Hadamard designs
  4. Steiner systems and triple systems
  5. Resolvable designs and factorizations
  6. Latin squares and transversals
  7. Mutually orthogonal Latin squares and orthogonal arrays
  8. Difference sets and difference families
  9. Automorphisms and classification of designs
  10. t-designs and the existence of designs
  11. Packing and covering designs
  12. Codes of designs, spherical designs and q-analogues
  13. Configurations of points and lines
  14. Finite projective and affine planes
  15. Finite non-Desarguesian planes and spreads
  16. Galois geometry and finite projective spaces
  17. Arcs, ovals, caps and blocking sets
  18. Generalized polygons and partial geometries
  19. Matroid axioms and cryptomorphisms
  20. Examples and classes of matroids
  21. Matroid duality, minors and connectivity
  22. Representability of matroids
  23. Matroid union, intersection and matroid polytopes
  24. Matroid invariants and the Hodge theory of matroids
  25. Generalizations of matroids
  26. Polyominoes and combinatorial tilings

Graph theory

Graph theory is the study of graphs. A graph is a set of vertices together with a set of edges, where each edge joins two vertices. Graphs are models of networks of many kinds, such as road maps, electrical circuits, molecules and the links between web pages, and they are a basic tool of computer science. The subject started with Euler's solution of the problem of the seven bridges of Königsberg in 1736. This topic collects the graph theory pages of math2. Its sub-areas are listed below, in reading order. Extremal and probabilistic combinatorics, algebraic combinatorics, designs and matroids, and geometric group theory have their own topics.

  1. Graphs, degrees and subgraphs
  2. Walks, paths, cycles and components
  3. Degree sequences, distances and graph indices
  4. Trees, forests and spanning trees
  5. Connectivity
  6. Eulerian and Hamiltonian graphs
  7. Matchings and factors
  8. Vertex colouring
  9. Edge colouring, list colouring and other colourings
  10. Chromatic and other graph polynomials
  11. Planar graphs
  12. The four colour theorem and colouring planar graphs
  13. Embeddings on surfaces and crossing numbers
  14. Graph minors and treewidth
  15. Perfect graphs and intersection graphs
  16. Hereditary classes, chi-boundedness and width parameters
  17. Decompositions and packings of graphs
  18. Network science and models of complex networks
  19. Spectral graph theory
  20. Expanders and random walks on graphs
  21. Symmetry and algebraic graph theory
  22. Homomorphisms, products and reconstruction
  23. Cliques, independence, domination, labellings and games
  24. Directed graphs and tournaments
  25. Network flows, nowhere-zero flows and cycle covers
  26. Hypergraphs
  27. Infinite graphs

Euclidean geometry

Euclidean geometry is the study of the plane and of space with the notions of distance and angle that Euclid set out in his Elements. Its central objects are points, lines, circles, triangles and polygons, and two figures are congruent when an isometry takes one onto the other. Euclidean geometry is the first part of mathematics in which most students meet proofs, and it is the model for the axiomatic method. Euclid wrote the Elements in Alexandria around 300 BC, and Hilbert gave a complete modern system of axioms for the subject in 1899. This topic collects the Euclidean geometry pages of math2. Its sub-areas are listed below, in reading order. Classical geometries, convex and discrete geometry and differential geometry have their own topics.

  1. Euclid's Elements and the axioms of Euclidean geometry
  2. Points, lines and angles
  3. Triangles and congruence
  4. Similarity and proportion
  5. The Pythagorean theorem and right triangles
  6. Trigonometry of triangles
  7. Area and length in plane geometry
  8. Triangle centres and the Euler line
  9. Advanced triangle geometry
  10. Ceva, Menelaus and metric relations in the triangle
  11. Circle theorems
  12. Power of a point and coaxal circles
  13. Named circle theorems and configurations
  14. Polygons and quadrilaterals
  15. Straightedge and compass constructions
  16. Inversion in plane and solid geometry
  17. Isometries and similarities of Euclidean space
  18. Analytic geometry of lines and circles
  19. Conic sections in Euclidean geometry
  20. Analytic geometry of space and quadric surfaces
  21. Solid geometry of lines, planes, angles and spheres
  22. Solids and their volumes
  23. Geometric inequalities and extremum problems
  24. Olympiad geometry methods and lemmas
  25. Geometry education

Classical geometries

Classical geometries are the geometries other than plain Euclidean geometry that are defined by axioms or by a group of transformations, such as affine, projective, hyperbolic, spherical and inversive geometry. In the view of Klein, a geometry is a space with a group that acts on it, and the theorems of the geometry are the properties that the group preserves. Projective geometry, for example, is the geometry of the projective plane under the group of projective transformations, and its basic invariant is the cross-ratio of four points on a line. The discovery of hyperbolic geometry by Lobachevsky and Bolyai around 1830 showed that the parallel postulate does not follow from the other axioms of Euclid, and Klein stated his Erlangen program in 1872. This topic collects the classical geometries pages of math2. Its sub-areas are listed below, in reading order. Euclidean geometry, designs, matroids and finite geometries, differential geometry and geometric group theory have their own topics.

  1. Metatheory of geometric axiom systems
  2. Incidence, order and closure structures
  3. Absolute geometry and the parallel postulate
  4. Affine geometry
  5. Projective spaces and projective planes
  6. Projective transformations and cross-ratio
  7. Desargues, Pappus and the incidence theorems of planes
  8. Coordinatization and non-Desarguesian planes
  9. Conics and quadrics in projective geometry
  10. Polar spaces, line geometry and Grassmann spaces
  11. Topological and compact geometries
  12. The Erlangen program and Cayley-Klein geometries
  13. Hyperbolic plane geometry
  14. Models of hyperbolic geometry and hyperbolic space
  15. Hyperbolic polygons, tilings, polyhedra and volume
  16. Spherical and elliptic geometry
  17. Spherical trigonometry
  18. Inversive and Möbius geometry
  19. Circle geometries, chain geometries and Lie sphere geometry
  20. Reflection geometry and metric planes
  21. Distance geometry
  22. Metric geometry of normed planes, G-spaces and projective metrics
  23. Kinematic geometry and linkages
  24. Descriptive geometry, perspective and the geometry of cameras
  25. Map projections and the geometry of the Earth
  26. Order geometry of curves and surfaces

Convex and discrete geometry

Convex and discrete geometry is the study of convex sets, polytopes and finite or discrete configurations of points and bodies in Euclidean space. A set is convex if it contains the whole segment between any two of its points. The subject has applications in optimization, in the geometry of numbers, in crystallography and in computational geometry. Minkowski developed the theory of convex bodies around 1900, and Hales gave a computer-assisted proof of Kepler's conjecture on the densest packing of balls in 1998. This topic collects the convex and discrete geometry pages of math2. Its sub-areas are listed below, in reading order. Euclidean geometry, Diophantine approximation and geometry of numbers, algebraic combinatorics and designs, matroids and finite geometries have their own topics.

  1. Convex sets, convex hulls and cones
  2. Separation, support, polarity and extreme points
  3. Carathéodory, Radon, Helly and their relatives
  4. Convex bodies, width and covering problems
  5. Mixed volumes and the Brunn-Minkowski theory
  6. Isoperimetric and affine inequalities for convex bodies
  7. Asymptotic geometric analysis
  8. Valuations, integral geometry and geometric probability
  9. Polytopes, faces and their graphs
  10. Face numbers of polytopes
  11. Convex and non-convex polyhedra in three dimensions
  12. Regular, uniform and abstract polytopes
  13. Zonotopes, permutohedra, associahedra and their relatives
  14. Realization spaces, Gale duality and oriented matroids
  15. Polyhedral complexes, fans and subdivisions
  16. Lattice polytopes and Ehrhart theory
  17. Dissections and scissors congruence
  18. Packing and covering in the plane
  19. Sphere packing and covering in three and more dimensions
  20. Kissing numbers, spherical codes and energy minimization
  21. Tilings of the plane
  22. Aperiodic tilings, monotiles and quasicrystals
  23. Tilings and honeycombs of space
  24. Incidences of points and lines, and point configurations
  25. Erdős distance problems and metric configurations
  26. Line arrangements, pseudolines and geometric complexity
  27. Topological methods and equipartitions in discrete geometry
  28. Rigidity of frameworks and polyhedra
  29. Circle packings and discrete conformal geometry
  30. Art galleries, visibility and polygon problems

Differential geometry

Differential geometry is the study of curves, surfaces and manifolds with the methods of calculus. Its central object is a Riemannian manifold, a smooth manifold with an inner product on each tangent space that varies smoothly from point to point. Curvature is its main invariant, and the theory gives the mathematical language of general relativity and of gauge theory in physics. Gauss proved in 1827 that the curvature of a surface depends only on its intrinsic metric, and Riemann extended these ideas to spaces of any dimension in his lecture of 1854. This topic collects the differential geometry pages of math2. Its sub-areas are listed below, in reading order. Symplectic and Poisson geometry, complex geometry, manifolds and differential topology and global analysis have their own topics.

  1. Curves in the plane and in space
  2. Local theory of surfaces in Euclidean space
  3. Intrinsic geometry of surfaces
  4. Special surfaces and the global theory of surfaces in space
  5. Minimal surfaces and surfaces of constant mean curvature
  6. Tensor fields, connections and covariant derivatives
  7. Riemannian metrics, the Levi-Civita connection and isometries
  8. Geodesics, the exponential map and completeness
  9. Curvature of Riemannian manifolds
  10. Comparison theorems
  11. Curvature, topology and rigidity
  12. The Bochner technique and scalar curvature
  13. Submanifolds, isometric embeddings and Riemannian submersions
  14. Lie groups with invariant metrics and homogeneous Riemannian spaces
  15. Riemannian symmetric spaces
  16. Principal bundles, Ehresmann connections and holonomy
  17. Chern-Weil theory, secondary classes and differential characters
  18. Riemannian holonomy, Einstein manifolds and special holonomy
  19. Almost complex, almost contact and related structures
  20. Spin structures, spinors and Dirac operators
  21. Yang-Mills connections and instantons
  22. Conformal, projective and parabolic geometry of manifolds
  23. Finsler and sub-Riemannian geometry
  24. Pseudo-Riemannian and Lorentzian geometry
  25. Length spaces, CAT(kappa) spaces and Alexandrov spaces
  26. Convergence of Riemannian manifolds, synthetic Ricci bounds and systolic geometry
  27. Tube formulas and integral geometry in Riemannian manifolds
  28. Information geometry
  29. Affine, projective, web and discrete differential geometry
  30. Differential geometry in the sciences and in data analysis

Symplectic, contact and Poisson geometry

Symplectic, contact and Poisson geometry is the study of manifolds with a symplectic form, a contact structure or a Poisson bracket. A symplectic form on a manifold is a closed 2-form that is nondegenerate at every point, and a manifold with such a form always has even dimension. Symplectic geometry is the geometry of the phase spaces of classical mechanics, where the symplectic form turns each energy function into a Hamiltonian flow. The subject grew from the work of Lagrange and Hamilton on mechanics, and the pseudoholomorphic curves of Gromov in 1985 and the homology theory of Floer in the late 1980s started modern symplectic topology. This topic collects the symplectic, contact and Poisson geometry pages of math2. Its sub-areas are listed below, in reading order. Differential geometry, dynamical systems, classical mechanics and low-dimensional topology have their own topics.

  1. Linear symplectic algebra
  2. Symplectic manifolds and their first examples
  3. Hamiltonian vector fields and Poisson brackets
  4. Moser's method and local normal forms
  5. Lagrangian submanifolds and the Maslov index
  6. Compatible almost complex structures
  7. Constructions of symplectic manifolds
  8. Moment maps and Hamiltonian group actions
  9. Symplectic reduction and symplectic quotients
  10. Toric symplectic manifolds
  11. Integrable Hamiltonian systems
  12. Periodic orbits of Hamiltonian systems
  13. Pseudoholomorphic curves
  14. Symplectic capacities and non-squeezing
  15. Symplectic four-manifolds
  16. Gromov-Witten invariants and quantum cohomology
  17. Hamiltonian Floer homology and the Arnold conjecture
  18. Lagrangian Floer theory and symplectic homology
  19. Groups of symplectic and Hamiltonian diffeomorphisms
  20. Fukaya categories and mirror symmetry
  21. Contact manifolds
  22. Contact topology of three-manifolds
  23. Reeb dynamics and contact homology
  24. Liouville, Weinstein and Stein manifolds and flexibility
  25. Poisson manifolds
  26. Symplectic groupoids, Courant algebroids and Dirac structures
  27. Deformation quantization
  28. Geometric quantization
  29. Generalized and relaxed symplectic structures

Algebraic geometry

Algebraic geometry is the study of the solution sets of systems of polynomial equations. Its basic object is an algebraic variety, the set of common zeros of a family of polynomials, and in the modern theory a scheme, a space that is built locally from commutative rings. The subject connects algebra with geometry, and it has applications in number theory, in mathematical physics, and in coding theory and cryptography. The Italian school studied curves and surfaces at the end of the 19th century, and Grothendieck rebuilt the foundations of the subject on schemes around 1960. This topic collects the algebraic geometry pages of math2. Its sub-areas are listed below, in reading order. Commutative algebra, arithmetic geometry, complex geometry and several complex variables, and algebraic combinatorics have their own topics.

  1. Affine algebraic varieties
  2. Projective varieties
  3. Dimension, smoothness and rational maps
  4. Plane algebraic curves
  5. Sheaves on varieties and schemes
  6. Properties of schemes
  7. Morphisms of schemes
  8. Quasi-coherent sheaves, vector bundles and differentials
  9. Divisors, line bundles and positivity
  10. Cohomology of coherent sheaves
  11. Algebraic curves and the Riemann-Roch theorem
  12. Jacobians and linear series on curves
  13. Abelian varieties
  14. Algebraic surfaces
  15. Special varieties in higher dimension
  16. Intersection theory
  17. Birational geometry and the minimal model program
  18. Singularities and their resolution
  19. Algebraic de Rham cohomology, Hodge theory and cycles
  20. Étale cohomology and the étale fundamental group
  21. Weil cohomologies and motives
  22. Deformation theory and parameter spaces
  23. Moduli spaces, algebraic spaces and stacks
  24. Derived categories of varieties and derived methods
  25. Toric varieties
  26. Grassmannians, Schubert calculus and enumerative geometry
  27. Tropical geometry
  28. Real algebraic and semialgebraic geometry
  29. Affine algebraic geometry and computation

Complex geometry and several complex variables

Complex geometry and several complex variables is the study of holomorphic functions of several complex variables and of complex manifolds and complex analytic spaces. A complex manifold is a space that looks locally like a domain in n-dimensional complex space, with holomorphic changes of coordinates. Holomorphic functions of several variables behave differently from those of one variable: by Hartogs' theorem, a holomorphic function on a ball in complex space of dimension two or more with one point removed extends across that point. Hartogs found this phenomenon in 1906, and Oka, Cartan and Grauert built the theory of Stein manifolds and coherent analytic sheaves in the 1940s and 1950s. This topic collects the complex geometry and several complex variables pages of math2. Its sub-areas are listed below, in reading order. Complex analysis, algebraic geometry, differential geometry and symplectic, contact and Poisson geometry have their own topics.

  1. Holomorphic functions of several variables
  2. Holomorphic maps and biholomorphic equivalence
  3. Hartogs phenomena and domains of holomorphy
  4. Pseudoconvexity, convexity notions and the Levi problem
  5. The d-bar problem and L2 methods
  6. Integral representations, residues and function spaces
  7. Bergman kernel, Szegő kernel and invariant metrics
  8. Kobayashi hyperbolicity and value distribution
  9. Local analytic geometry
  10. Complex analytic spaces and coherent analytic sheaves
  11. Stein manifolds and the theorems of Cartan and Oka
  12. Oka theory
  13. Pluripotential theory
  14. CR geometry
  15. Complex manifolds and almost complex structures
  16. Holomorphic vector bundles and Dolbeault cohomology
  17. Hermitian and Kähler metrics
  18. Hodge theory of compact Kähler manifolds
  19. Vanishing theorems
  20. Projective embedding and algebraicity of complex manifolds
  21. Kähler-Einstein metrics and Calabi-Yau manifolds
  22. Hermitian-Einstein metrics and Higgs bundles
  23. Compact complex surfaces and non-Kähler geometry
  24. Deformations of complex structures
  25. Period maps and variations of Hodge structure
  26. Bounded symmetric domains and homogeneous complex manifolds
  27. Twistor theory
  28. Complex singularities and the Milnor fibration
  29. Stratifications, perverse sheaves and D-modules on analytic spaces
  30. Real analytic and subanalytic geometry

General topology

General topology is the study of topological spaces and continuous maps, and of the properties of spaces that homeomorphisms preserve. A topological space is a set with a family of open subsets that contains the empty set and the whole set and is closed under arbitrary unions and finite intersections. The subject gives the common language of continuity, convergence, compactness and connectedness that analysis, geometry and algebraic topology use. Fréchet introduced metric spaces in 1906, and Hausdorff gave an axiomatic definition of a topological space by neighbourhoods in 1914. This topic collects the general topology pages of math2. Its sub-areas are listed below, in reading order. Algebraic topology, manifolds and differential topology, set theory and functional analysis have their own topics.

  1. Topological spaces and their basic notions
  2. Standard examples of topologies
  3. Continuous maps and homeomorphisms
  4. Subspaces, products, quotients and other constructions
  5. Convergence of sequences, nets and filters
  6. Separation axioms
  7. Countability axioms and cardinal functions
  8. Connectedness
  9. Compactness
  10. Compactifications
  11. Rings of continuous functions
  12. Paracompactness and covering properties
  13. Metric spaces
  14. Complete metric spaces and Baire category
  15. Metrization theorems
  16. Uniform and proximity spaces
  17. Function spaces
  18. Hyperspaces and set-valued maps
  19. Extension theorems and absolute retracts
  20. Zero-dimensional spaces and the Cantor set
  21. Dimension theory
  22. Continuum theory
  23. Counterexamples in topology
  24. Set-theoretic topology
  25. Generalized and applied topology

Algebraic topology

Algebraic topology is the study of topological spaces through algebraic invariants, such as groups, rings and modules, that do not change under homeomorphism or homotopy. Its central example is homology, which assigns to each space a sequence of abelian groups that measure the holes of the space in each dimension. These invariants show that spaces are different, give the degree and fixed-point theorems, and have applications in geometry, combinatorics and data analysis. Poincaré started the subject in his memoir Analysis situs of 1895, and Eilenberg and Steenrod gave axioms for homology theories in the 1940s. This topic collects the algebraic topology pages of math2. Its sub-areas are listed below, in reading order. Homotopy theory, general topology, manifolds and differential topology and homological algebra and K-theory have their own topics.

  1. Overview and foundations
  2. The fundamental group
  3. The Seifert-van Kampen theorem
  4. Covering spaces
  5. Simplicial complexes, polyhedra and cell structures
  6. Simplicial and singular homology
  7. Exact sequences and excision
  8. Cellular homology and computations
  9. Degree and winding number
  10. Homology and the topology of Euclidean space
  11. Fixed-point theory
  12. The Borsuk-Ulam theorem and topological combinatorics
  13. Cohomology and products
  14. Orientation and duality
  15. Axioms for homology and cohomology
  16. Čech, Borel-Moore and other theories
  17. Sheaf cohomology of topological spaces
  18. Fibre bundles
  19. Vector bundles
  20. Classifying spaces
  21. Characteristic classes
  22. Spectral sequences in topology
  23. Cohomology operations
  24. Equivariant topology
  25. Configuration spaces
  26. Lusternik-Schnirelmann category and topological complexity
  27. Persistent homology
  28. Topological data analysis

Homotopy theory

Homotopy theory is the study of spaces and maps up to continuous deformation. Two maps are homotopic when one deforms continuously into the other, and two spaces have the same homotopy type when there are maps in both directions whose composites are homotopic to the identity maps. Homotopy invariants classify maps and bundles, and the stable methods of the subject compute cobordism rings and solve classical problems about spheres and division algebras. Hurewicz defined the higher homotopy groups in 1935, and Serre computed many homotopy groups of spheres with spectral sequences in the early 1950s. This topic collects the homotopy theory pages of math2. Its sub-areas are listed below, in reading order. Algebraic topology, manifolds and differential topology, category theory and homological algebra and K-theory have their own topics.

  1. Homotopy and homotopy equivalence
  2. Constructions on spaces
  3. Cofibrations and cofiber sequences
  4. Fibrations and fiber sequences
  5. Homotopy groups
  6. CW complexes in homotopy theory
  7. Whitehead, Hurewicz, excision and suspension
  8. Eilenberg-MacLane spaces and Postnikov towers
  9. Obstruction theory
  10. Homotopy groups of spheres and unstable homotopy
  11. Stable stems and the J-homomorphism
  12. Hopf invariant one, vector fields and the Kervaire invariant
  13. H-spaces, loop spaces and topological groups
  14. Infinite loop spaces and operads in topology
  15. Spectra and the stable homotopy category
  16. Structured ring spectra
  17. Generalized cohomology theories and complex orientation
  18. Thom spaces, Thom spectra and cobordism
  19. The Adams and Adams-Novikov spectral sequences
  20. Chromatic homotopy theory
  21. Localization and completion of spaces
  22. Rational homotopy theory
  23. Model categories and homotopical algebra
  24. Simplicial homotopy theory
  25. Goodwillie calculus and functor calculus
  26. Equivariant homotopy theory
  27. Motivic homotopy theory (overview)
  28. Shape theory, proper homotopy and wild spaces

Manifolds and differential topology

Manifolds and differential topology is the study of manifolds as spaces and of the smooth maps between them. A manifold of dimension n is a Hausdorff space with a countable base in which each point has a neighbourhood homeomorphic to n-dimensional Euclidean space. Manifolds are the spaces of geometry and physics, and differential topology gives the tools to classify them, such as transversality, cobordism and surgery. Whitney proved in 1936 that every smooth manifold embeds in a Euclidean space, and Milnor found exotic smooth structures on the 7-sphere in 1956. This topic collects the manifolds and differential topology pages of math2. Its sub-areas are listed below, in reading order. Differential geometry, algebraic topology, low-dimensional topology and knot theory and global analysis have their own topics.

  1. Manifolds, charts and atlases
  2. Examples and constructions of manifolds
  3. Smooth manifolds, smooth maps and tangent spaces
  4. Immersions, submersions and submanifolds
  5. Sard's theorem, Whitney's theorems and smooth approximation
  6. Transversality, intersection theory and degree
  7. Smooth vector bundles and tubular neighbourhoods
  8. Vector fields and flows on manifolds
  9. Distributions and foliations
  10. Differential forms on manifolds
  11. Integration on manifolds and Stokes' theorem
  12. De Rham cohomology
  13. Handle decompositions and Cerf theory
  14. Cobordism as a geometric relation
  15. The h-cobordism theorem and exotic spheres
  16. Surgery theory
  17. PL topology and triangulations
  18. Topological manifolds in high dimensions
  19. Homology manifolds and infinite-dimensional topological manifolds
  20. Group actions on manifolds
  21. Isotopy and the topology of diffeomorphism groups
  22. Jets, the h-principle and exterior differential systems
  23. Supermanifolds, diffeology and generalized smooth spaces
  24. Stratified spaces and Thom-Mather theory
  25. Lie groupoids and pseudogroups as manifold structures
  26. Nonlinear calculus and degree theory between manifolds
  27. Singularities of smooth maps
  28. Catastrophe theory and unfoldings
  29. Cobordism categories and field theories

Low-dimensional topology and knot theory

Low-dimensional topology and knot theory is the study of manifolds of dimension two, three and four, and of knots and links in them. A knot is an embedding of a circle in three-dimensional space, and two knots are equivalent when an isotopy of space moves one onto the other. These dimensions show phenomena that do not occur in higher dimensions, and the subject uses methods from hyperbolic geometry, gauge theory and quantum algebra. Tait made the first tables of knots in the 1870s and 1880s, and Perelman proved Thurston's geometrization conjecture, and with it the Poincaré conjecture, in 2002 and 2003. This topic collects the low-dimensional topology and knot theory pages of math2. Its sub-areas are listed below, in reading order. Manifolds and differential topology, geometric group theory, algebraic topology and symplectic, contact and Poisson geometry have their own topics.

  1. Knots, links and their diagrams
  2. Elementary knot invariants
  3. Seifert surfaces, genus and the Seifert form
  4. The Alexander polynomial and abelian invariants
  5. Knot groups and knot quandles
  6. The Jones polynomial and skein invariants
  7. Finite-type and quantum invariants
  8. Knot homology theories
  9. Knot concordance and slice knots
  10. Braids and closed braids
  11. Tangles, rational knots and Montesinos knots
  12. Torus, satellite, hyperbolic and other families of knots
  13. Virtual knots, generalized knots and spatial graphs
  14. Geometric and physical knot theory
  15. Higher-dimensional knots and wild embeddings
  16. Topology of surfaces
  17. Curves on surfaces and Teichmüller theory
  18. Three-manifolds and basic examples
  19. Heegaard splittings and triangulations
  20. Incompressible surfaces and Haken manifolds
  21. Seifert fibred spaces and graph manifolds
  22. Dehn surgery and Kirby calculus
  23. Branched coverings and group actions
  24. Geometrization and the Poincaré conjecture
  25. Hyperbolic 3-manifolds
  26. Kleinian groups and 3-manifold groups as topology
  27. Gauge-theoretic and Floer invariants of 3-manifolds
  28. Topology of 4-manifolds
  29. Smooth 4-manifolds and gauge theory

Global analysis and geometric analysis

Global analysis and geometric analysis is the study of analysis on manifolds and on spaces of maps, and of the use of differential equations to answer questions of geometry and topology. A typical object is an elliptic differential operator on a closed manifold, such as the Laplacian, whose kernel and spectrum carry geometric and topological information. The subject gives the index theorem, the spectral theory of manifolds, and the geometric flows that Perelman used to prove the Poincaré conjecture. Morse developed the calculus of variations in the large in the 1920s and 1930s, and Atiyah and Singer proved their index theorem in 1963. This topic collects the global analysis and geometric analysis pages of math2. Its sub-areas are listed below, in reading order. Differential geometry, partial differential equations, manifolds and differential topology and calculus of variations and optimal control have their own topics.

  1. Infinite-dimensional manifolds
  2. Manifolds of maps, diffeomorphism groups and spaces of metrics
  3. Morse theory on finite-dimensional manifolds
  4. Morse homology, Morse-Bott theory and Witten's deformation
  5. Critical point theory in infinite dimensions
  6. Symmetry and bifurcation in variational problems
  7. Variational theory of geodesics and closed geodesics
  8. Harmonic maps
  9. Existence of minimal submanifolds by variational methods
  10. Differential operators on vector bundles and elliptic theory
  11. Pseudodifferential operators and calculi on manifolds
  12. Hodge theory on Riemannian manifolds
  13. Harmonic functions and the Laplacian on Riemannian manifolds
  14. The Atiyah-Singer index theorem
  15. Index theory on manifolds with boundary, families and secondary invariants
  16. Heat kernels and stochastic analysis on manifolds
  17. Zeta functions, determinants and analytic torsion
  18. The spectrum of the Laplacian, Weyl's law and eigenfunctions
  19. Eigenvalue estimates
  20. Isospectrality and inverse spectral problems
  21. Wave trace, eigenfunction asymptotics and quantum ergodicity
  22. Curve shortening and flows of curves
  23. Mean curvature flow and other extrinsic flows
  24. Ricci flow
  25. Other intrinsic flows of metrics
  26. The Yamabe problem and prescribed curvature equations
  27. Analysis of gauge-theoretic equations
  28. Analysis of the Seiberg-Witten equations
  29. Analysis on metric measure spaces

Calculus

Calculus is the study of change and accumulation for functions of one and several real variables, through derivatives and integrals. The derivative of a function at a point is the limit of its difference quotients, and it gives the slope of the graph and the instantaneous rate of change. The fundamental theorem of calculus connects derivatives with integrals, and calculus is the main mathematical tool of physics, engineering, economics and the other sciences. Newton and Leibniz developed calculus independently in the second half of the 17th century, and Cauchy and Weierstrass gave it rigorous foundations by limits in the 19th century. This topic collects the calculus pages of math2. Its sub-areas are listed below, in reading order. Real analysis, sequences, series and summability, manifolds and differential topology and ordinary differential equations have their own topics.

  1. Limits at the calculus level
  2. Continuity at the calculus level
  3. The derivative
  4. Rules of differentiation
  5. Derivatives of the elementary functions
  6. Rates of change, related rates and linear approximation
  7. The mean value theorem and its consequences
  8. Extrema, curve sketching and optimization problems
  9. Taylor polynomials and Taylor series
  10. The definite integral
  11. The fundamental theorem of calculus and antiderivatives
  12. Techniques of integration
  13. Improper integrals and integrals with a parameter
  14. Applications of integration
  15. Parametric curves, polar coordinates and vector functions
  16. Functions of several variables
  17. Partial derivatives
  18. The total derivative and the chain rule
  19. The gradient and directional derivatives
  20. Higher derivatives and Taylor's theorem in several variables
  21. Extrema in several variables and Lagrange multipliers
  22. Multiple integrals
  23. Change of variables and curvilinear coordinates in integrals
  24. Vector fields and line integrals
  25. Divergence, curl and the vector identities
  26. Parametrised surfaces and surface integrals
  27. The integral theorems of vector calculus
  28. Differential forms on Euclidean space
  29. Infinitesimals and variant calculi
  30. Teaching and learning calculus

Real analysis

Real analysis is the rigorous theory of real numbers, real sequences and real functions, with full proofs of the results that calculus uses. Its starting point is the completeness of the real numbers: every nonempty set of real numbers that has an upper bound has a least upper bound. Real analysis gives proofs for the results of calculus, and its counterexamples show why each hypothesis of a theorem is necessary. Bolzano and Cauchy started the rigorous theory of limits and continuity in the early 19th century, and Weierstrass gave it the epsilon-delta form that is in use today. This topic collects the real analysis pages of math2. Its sub-areas are listed below, in reading order. Calculus, measure and integration, inequalities and sequences, series and summability have their own topics.

  1. Foundations of rigorous analysis
  2. Sequences of real numbers
  3. Subsequences, lim sup and Cauchy sequences
  4. Topology of the real line
  5. Rigorous limits and continuity
  6. Uniform, Hölder and Dini continuity
  7. Monotone functions
  8. Differentiation theory in one variable
  9. Mean value theorems and Taylor theory
  10. Riemann and Darboux integral theory
  11. Riemann-Stieltjes and gauge integrals
  12. Bounded variation and absolute continuity
  13. Sequences and series of functions
  14. Power series of a real variable
  15. Weierstrass and Stone-Weierstrass approximation
  16. Smooth, real analytic and quasi-analytic functions
  17. Pathological functions and counterexamples
  18. Convex functions of one variable
  19. Differentiation in Euclidean and normed spaces
  20. Inverse and implicit function theorems
  21. Riemann integration in several variables
  22. Lipschitz analysis and extension theorems
  23. Fractional integrals and derivatives
  24. Iteration of real functions
  25. Growth orders and regular variation
  26. Time scales and set-valued calculus
  27. History of rigour in analysis

Inequalities

The study of inequalities collects the named classical inequalities of analysis and algebra and the methods that prove them. An inequality states that one expression is at most another for all values of its variables in a given set, and a sharp inequality also tells when equality holds. Inequalities give the estimates that analysis, probability and the theory of differential equations need, and they are a standard part of olympiad mathematics. Hardy, Littlewood and Pólya made the subject a field of its own with their book Inequalities of 1934. This topic collects the inequalities pages of math2. Its sub-areas are listed below, in reading order. Real analysis, convex and discrete geometry, matrix theory and multilinear algebra and problem solving and competitions have their own topics.

  1. Basic principles of inequalities
  2. Means and their inequalities
  3. Cauchy-Schwarz, Hölder and Minkowski inequalities
  4. Convexity and Jensen-type inequalities
  5. Majorization inequalities
  6. Rearrangement and Chebyshev inequalities
  7. Rearrangements of functions
  8. Symmetric and cyclic polynomial inequalities
  9. Methods for proving competition inequalities
  10. Inequalities for elementary functions
  11. Hardy, Hilbert and Carleman inequalities
  12. Integral inequalities
  13. Grönwall-type inequalities
  14. Inequalities involving derivatives
  15. Sharp multilinear inequalities

Sequences, series and summability

This area is the study of infinite series and of the methods that give a value to a series or a sequence that does not converge. A series converges when the sequence of its partial sums has a limit, and a summation method is a rule that gives a value to a wider class of series and keeps the sum of each convergent series. Series give expansions of functions and values of constants, and summation methods are tools in Fourier analysis, number theory and physics. Euler worked freely with divergent series in the 18th century, and Hardy wrote the standard account of their theory in his book Divergent Series of 1949. This topic collects the sequences, series and summability pages of math2. Its sub-areas are listed below, in reading order. Calculus, real analysis, harmonic analysis and analytic number theory have their own topics.

  1. Series of real and complex numbers
  2. Convergence tests for series of nonnegative terms
  3. Absolute and conditional convergence
  4. Rearrangements and unconditional convergence
  5. Products of series and double series
  6. Infinite products
  7. Named series and their sums
  8. Summation formulas and series expansions
  9. Series acceleration and sequence transformations
  10. Analytic theory of continued fractions
  11. Divergent series and the idea of a summation method
  12. Matrix methods and the Toeplitz theory
  13. Cesàro, Hölder, Nörlund, Riesz, Hausdorff and Euler means
  14. Abel, Borel and function-theoretic methods
  15. Abelian and Tauberian theorems
  16. Strong, absolute and statistical summability
  17. Sequence spaces and the functional-analytic theory of summability

Measure and integration

Measure and integration is the study of measures, which give a size to the sets of a family, and of the integral that a measure defines. A measure is a function on a sigma-algebra of sets, with values in the nonnegative extended real numbers, that is zero on the empty set and countably additive. The Lebesgue integral that a measure defines has good convergence theorems, and it is the base of probability theory, functional analysis and harmonic analysis. Lebesgue defined his measure and integral in his thesis of 1902, and Kolmogorov built probability theory on measure theory in 1933. This topic collects the measure and integration pages of math2. Its sub-areas are listed below, in reading order. Real analysis, probability theory, ergodic theory and functional analysis have their own topics.

  1. Foundations and set systems
  2. Measures and measure spaces
  3. Outer measures and the Carathéodory construction
  4. Lebesgue measure on Euclidean space
  5. Non-measurable sets
  6. Lebesgue-Stieltjes measures
  7. Measurable functions and modes of convergence
  8. The Lebesgue integral
  9. Convergence theorems and uniform integrability
  10. Lp spaces
  11. Product measures and Fubini-Tonelli
  12. Kernels, projective limits and disintegration
  13. Signed and complex measures and the Radon-Nikodym theorem
  14. Differentiation of measures and integrals
  15. Measures on topological spaces
  16. Convergence of measures
  17. Haar measure and invariant measures
  18. Measures on infinite-dimensional spaces
  19. Hausdorff measures and dimensions
  20. Fractals, self-similar sets and measures
  21. Rectifiable sets and the area and coarea formulas
  22. Currents, varifolds and sets of finite perimeter
  23. Vector measures and integration of vector-valued functions
  24. Measure algebras and abstract integration
  25. Capacities, non-additive measures and nonstandard measures

Complex analysis

Complex analysis is the study of functions of one complex variable that are complex differentiable. A holomorphic function is a function on an open set of the complex plane that has a complex derivative at each point of the set. Each holomorphic function is given locally by a convergent power series, and the theory is a main tool in number theory, in the evaluation of real integrals and in mathematical physics. Cauchy, Riemann and Weierstrass built the theory in the nineteenth century from three different starting points: integrals, geometry and power series. This topic collects the complex analysis pages of math2: Cauchy theory and residues, conformal maps and the Riemann mapping theorem, entire and meromorphic functions, Nevanlinna theory, univalent and quasiconformal maps, Hardy and Bergman spaces, and Riemann surfaces as analytic objects. Complex geometry and several complex variables, potential theory, special functions and dynamical systems have their own topics.

  1. Complex functions and the extended plane
  2. Holomorphic functions and the Cauchy-Riemann equations
  3. Complex power series and series expansions
  4. Branches and multivalued functions
  5. Complex integration and Cauchy theory
  6. Zeros, maximum principles and the Schwarz lemma
  7. Isolated singularities and Laurent series
  8. Residues and the argument principle
  9. Möbius transformations and elementary conformal maps
  10. The Riemann mapping theorem and boundary behaviour
  11. Harmonic functions in the plane
  12. Normal families and the Picard theorems
  13. Analytic continuation and monodromy
  14. Entire and meromorphic functions
  15. Nevanlinna theory and value distribution
  16. Geometry of zeros of polynomials
  17. Elliptic functions
  18. Univalent functions and Loewner theory
  19. Quasiconformal maps and analytic Teichmüller theory
  20. Analytic capacity and removable sets
  21. Hardy spaces and inner functions
  22. Spaces of analytic functions and interpolation
  23. Approximation by holomorphic functions
  24. Cauchy integrals and boundary value problems
  25. Riemann surfaces as analytic objects
  26. Iteration of holomorphic self-maps of the disc
  27. Generalized function theories

Special functions

The theory of special functions studies the named functions of classical analysis, such as the gamma function, the hypergeometric functions, the Bessel functions and the orthogonal polynomials. A special function is known through its series and integral representations, its differential equation, its identities, its zeros and its asymptotic behaviour. Special functions appear when the equations of physics are solved by separation of variables, and they are also used in probability, combinatorics and number theory. Euler defined the gamma function, and Gauss gave the first systematic study of the hypergeometric series. This topic collects the special functions pages of math2. Its sub-areas are listed below, in reading order. Complex analysis, integral transforms and asymptotic methods, and automorphic forms and the Langlands program have their own topics.

  1. Foundations and methods
  2. The gamma and beta functions
  3. Stirling's formula, polygamma and multiple gamma functions
  4. Error functions and incomplete gamma functions
  5. Exponential and logarithmic integrals, Lambert W and Mittag-Leffler functions
  6. Polylogarithms and related functions
  7. Linear differential equations in the complex domain
  8. The Gauss hypergeometric function
  9. Generalized hypergeometric series and summation identities
  10. Mellin-Barnes integrals and hypergeometric functions of several variables
  11. Confluent hypergeometric functions
  12. Bessel functions
  13. Kelvin, Struve, Anger-Weber and Lommel functions
  14. Airy functions and turning points
  15. Legendre functions and spherical harmonics
  16. General theory of orthogonal polynomials
  17. Classical orthogonal polynomials
  18. The Askey scheme and discrete orthogonal polynomials
  19. Basic hypergeometric series and q-special functions
  20. Orthogonal polynomials in several variables and Dunkl theory
  21. Elliptic integrals and the arithmetic-geometric mean
  22. Jacobi elliptic functions and theta-function formulas
  23. Mathieu, Lamé, spheroidal and Heun functions
  24. Painlevé transcendents
  25. Special functions and group representations
  26. Computation of special functions

Integral transforms and asymptotic methods

This area studies integral transforms as tools of computation, and the asymptotic methods of analysis. An integral transform sends a function to a new function by integration against a fixed kernel, as the Laplace transform does with an exponential kernel. Transforms change linear differential and integral equations into algebraic equations, and asymptotic methods give approximate answers when a parameter is large or small. Heaviside used an operational calculus to solve the equations of electrical circuits at the end of the nineteenth century, and the Laplace transform later gave this calculus a rigorous base. This topic collects the transform and asymptotics pages of math2: the Laplace, Mellin, Hilbert, Stieltjes, Hankel, Radon and Z-transforms, operational calculus, moment problems, asymptotic expansions, Laplace's method and steepest descent, the WKB approximation, perturbation methods and boundary layers, and resurgence. Harmonic analysis, special functions and approximation theory have their own topics.

  1. Integral transforms in general
  2. Definition and convergence of the Laplace transform
  3. Operational rules of the Laplace transform
  4. Uniqueness and inversion of the Laplace transform
  5. Solving equations with the Laplace transform
  6. Bilateral and Laplace-Stieltjes transforms
  7. The Mellin transform
  8. The Hilbert and Stieltjes transforms
  9. Hankel, Abel and special-function transforms
  10. Other named integral transforms
  11. Half-line convolution and operational calculus
  12. The Z-transform and discrete operational calculus
  13. Multidimensional integral transforms
  14. The Radon transform and tomography
  15. Moment problems
  16. Asymptotic notation and asymptotic expansions
  17. Asymptotics of Laplace-type integrals
  18. Mellin transform methods in asymptotics
  19. Saddle points, steepest descent and Fourier-type integrals
  20. Asymptotics of solutions of differential equations
  21. Regular perturbation and multiple scales
  22. Singular perturbation and boundary layers
  23. Exponential asymptotics and resurgence

Approximation theory

Approximation theory studies how well general functions can be approximated by simple functions, such as polynomials, splines, rational functions and sums of basis elements. The central quantity is the error of best approximation, which is the distance in a chosen norm from a function to a given set of approximants. The theory gives the error bounds behind numerical methods for interpolation, quadrature and differential equations, and it is the base of computer-aided geometric design. Chebyshev studied best uniform approximation by polynomials in the middle of the nineteenth century, and Weierstrass proved in 1885 that each continuous function on a closed interval is a uniform limit of polynomials. This topic collects the approximation theory pages of math2. Its sub-areas are listed below, in reading order. Harmonic analysis, numerical analysis, and integral transforms and asymptotic methods have their own topics.

  1. Foundations of approximation
  2. Best approximation in normed spaces
  3. Uniform best approximation and Chebyshev systems
  4. Markov-Bernstein-type inequalities
  5. Moduli of smoothness and smoothness classes
  6. Direct and inverse theorems
  7. Linear and positive approximation operators
  8. Polynomial interpolation
  9. Interpolation nodes and convergence
  10. Spline functions and B-splines
  11. Bézier curves and geometric design
  12. Rational and Padé approximation
  13. Least squares and orthogonal expansions
  14. Müntz, weighted and restricted approximation
  15. Multivariate and scattered data approximation
  16. High-dimensional approximation
  17. Widths, entropy and optimal recovery
  18. Nonlinear and sparse approximation
  19. Shift-invariant spaces and wavelet approximation
  20. Superposition and ridge function approximation

Harmonic analysis

Harmonic analysis is the study of functions through their decomposition into basic waves. Its central tool is the Fourier transform, which writes a function on the circle, on n-dimensional space or on a locally compact abelian group in terms of the characters of the group. Fourier methods are used to solve the heat and wave equations, to analyse signals, and in number theory and probability. Fourier used trigonometric series in his work on heat conduction at the start of the nineteenth century, and the question of their convergence shaped much of modern analysis. This topic collects the harmonic analysis pages of math2. Its sub-areas are listed below, in reading order. Representation theory, functional analysis and approximation theory have their own topics.

  1. Fourier series on the circle
  2. Pointwise convergence and divergence of Fourier series
  3. Summability, kernels and convolution
  4. Fine theory of trigonometric series
  5. The Fourier transform on Euclidean space
  6. Uncertainty principles
  7. Sampling and band-limited functions
  8. Fourier analysis on finite groups and the Boolean cube
  9. Interpolation of operators on Lp spaces
  10. Maximal functions, decompositions and weights
  11. Singular integrals and Calderón-Zygmund theory
  12. Fourier multipliers and Bochner-Riesz means
  13. Littlewood-Paley theory and function spaces
  14. Real Hardy spaces and BMO
  15. Oscillatory integrals, restriction and decoupling
  16. Kakeya sets and geometric questions in Fourier analysis
  17. Time-frequency analysis and Gabor analysis
  18. Frames, Riesz bases and nonharmonic Fourier series
  19. Wavelets
  20. Orthogonal and complete systems of functions
  21. Positive-definite functions
  22. Almost periodic functions
  23. Harmonic analysis on locally compact abelian groups
  24. Group algebras, Tauberian theorems and spectral synthesis
  25. Invariant means and amenability of locally compact groups
  26. Fourier analysis on compact groups and spheres
  27. Gelfand pairs, spherical functions and symmetric spaces

Functional analysis

Functional analysis is the study of vector spaces of infinite dimension that carry a topology, and of the continuous linear maps between them. A Banach space is a normed vector space that is complete, so that each Cauchy sequence in it converges. Function spaces such as the Lp spaces and the Sobolev spaces are Banach spaces, and this frame is used in the theory of differential equations, in probability and in quantum mechanics. Hilbert, Riesz, Banach and von Neumann built the subject in the first half of the twentieth century. This topic collects the functional analysis pages of math2. Its sub-areas are listed below, in reading order. Operator theory, operator algebras and harmonic analysis have their own topics.

  1. Normed and Banach spaces
  2. Dual spaces and the Hahn-Banach theorem
  3. Uniform boundedness, open mapping and closed graph
  4. Hilbert spaces
  5. Topological vector spaces
  6. Fréchet, barrelled, Montel and nuclear spaces
  7. Duality and weak topologies
  8. Reflexivity and the geometry of the norm
  9. Bases in Banach spaces
  10. Isomorphic structure of Banach spaces
  11. Local theory and tensor products
  12. Nonlinear geometry of Banach spaces
  13. Classical Banach spaces
  14. Orlicz and other Banach function spaces
  15. Vector-valued function spaces
  16. Interpolation of spaces
  17. Sobolev spaces
  18. Sobolev embeddings and functional inequalities
  19. Reproducing kernel Hilbert spaces
  20. Test functions and distributions
  21. Tempered distributions and generalized functions
  22. Ordered vector spaces and Banach lattices
  23. Compact convex sets and Choquet theory
  24. Banach algebras and the spectrum
  25. Structure theory of Banach algebras
  26. Commutative Banach algebras and Gelfand theory
  27. Holomorphy and smoothness in infinite dimension
  28. Nonclassical settings and applications

Operator theory

Operator theory is the study of linear and nonlinear operators on Banach and Hilbert spaces. A bounded linear operator is a linear map between normed spaces that sends bounded sets to bounded sets, and this property is the same as continuity. Operators model differential and integral equations and the observables of quantum mechanics, and their spectra generalize the eigenvalues of matrices. Hilbert's study of integral equations and von Neumann's spectral theory of unbounded self-adjoint operators were the early bases of the subject. This topic collects the operator theory pages of math2. Its sub-areas are listed below, in reading order. Functional analysis, operator algebras and partial differential equations have their own topics.

  1. Bounded linear operators and operator topologies
  2. Classes of operators on Hilbert space
  3. Standard examples of operators
  4. Spectrum and resolvent
  5. Numerical range and operator inequalities
  6. Functional calculus and local spectral theory
  7. Compact operators
  8. Trace ideals and operator ideals
  9. Fredholm theory
  10. Spectral theorem for bounded operators
  11. Unbounded operators and self-adjoint extensions
  12. Spectral theorem for unbounded self-adjoint operators
  13. Quadratic forms and form methods
  14. Perturbation theory of linear operators
  15. Operator semigroups and evolution equations
  16. Invariant subspaces
  17. Linear dynamics and ergodic theorems for operators
  18. Dilation theory and functional models
  19. Toeplitz and Hankel operators
  20. Operators on spaces of analytic functions
  21. Commutators, similarity and structure of operators
  22. Nonselfadjoint operator algebras
  23. Positive operators on ordered spaces
  24. Schrödinger operators
  25. Jacobi, random and quasiperiodic operators
  26. Abstract scattering theory
  27. Fixed-point theorems for operators on infinite-dimensional spaces
  28. Degree theory and bifurcation for nonlinear operators
  29. Monotone operators and variational inequalities

Operator algebras and noncommutative geometry

This area studies algebras of bounded operators on Hilbert space, their abstract versions, and the geometry and topology that are built on them. A C*-algebra is a Banach algebra with an involution in which the norm of the product of x* and x is the square of the norm of x, for each element x. By the Gelfand-Naimark theorem each commutative C*-algebra is an algebra of continuous functions on a locally compact space, so a general C*-algebra is studied as a noncommutative space. Murray and von Neumann started the theory of von Neumann algebras in the 1930s, and Gelfand and Naimark gave the abstract theory of C*-algebras in 1943. This topic collects the operator algebras and noncommutative geometry pages of math2. Its sub-areas are listed below, in reading order. Functional analysis, operator theory and quantum theory have their own topics.

  1. Axioms and first structure of C*-algebras
  2. Commutative C*-algebras and the functional calculus
  3. States and representations
  4. Ideal structure and type I C*-algebras
  5. Topologies and first structure of von Neumann algebras
  6. Comparison of projections, traces and the type classification
  7. Injective factors and the Connes embedding problem
  8. Tomita-Takesaki modular theory
  9. Subfactors and the Jones index
  10. Rigidity theory of II1 factors
  11. Crossed products and C*-algebras from dynamics and combinatorics
  12. Automorphisms, derivations and group actions
  13. Hilbert C*-modules and Morita equivalence
  14. K-theory of C*-algebras
  15. Extensions, K-homology and KK-theory
  16. The Baum-Connes conjecture and higher index theory
  17. Tensor products, nuclearity and exactness
  18. The Elliott classification program
  19. Completely positive maps, operator systems and operator spaces
  20. Noncommutative integration and Lp spaces
  21. Free probability
  22. Operator algebraic quantum groups
  23. Noncommutative geometry and spectral triples
  24. Jordan operator algebras
  25. Operator algebras of quantum physics

Potential theory

Potential theory is the study of harmonic and subharmonic functions and of the potentials of measures. A harmonic function is a twice differentiable function whose Laplacian is zero. The theory started from the gravitational and electrostatic potentials of physics, and it has deep links with Brownian motion, with complex analysis and with elliptic partial differential equations. Green introduced the functions that now have his name in 1828, and Gauss studied the equilibrium distribution of charges in 1840. This topic collects the potential theory pages of math2. Its sub-areas are listed below, in reading order. Complex analysis, partial differential equations and stochastic processes have their own topics.

  1. Harmonic functions and Laplace's equation
  2. Mean value property and maximum principles
  3. Regularity, estimates and convergence
  4. Harmonic polynomials and expansions
  5. Poisson integrals and boundary behaviour
  6. Subharmonic and superharmonic functions
  7. Newtonian and logarithmic potentials
  8. Energy and equilibrium measures
  9. Capacity and polar sets
  10. Logarithmic capacity and transfinite diameter
  11. Riesz and Bessel potentials
  12. Green's functions
  13. The Dirichlet problem and the Perron method
  14. The Dirichlet principle, the Neumann problem and layer potentials
  15. Harmonic measure
  16. Martin boundary
  17. Balayage, reduced functions and the fine topology
  18. Probabilistic potential theory
  19. Dirichlet forms in potential theory
  20. Axiomatic potential theory and harmonic spaces
  21. Potential theory on graphs and networks
  22. Nonlinear potential theory
  23. Potential theory on fractals and metric spaces
  24. Biharmonic and polyharmonic functions
  25. Potentials in gravitation, electrostatics and geodesy

Ordinary differential equations

This area studies ordinary differential equations, which relate an unknown function of one variable to its derivatives. A solution of an ordinary differential equation on an interval is a differentiable function that satisfies the equation at each point of the interval. Ordinary differential equations are the main models for systems that change in time, in mechanics, electrical circuits, chemistry, biology and economics. Newton and Leibniz solved the first differential equations in the seventeenth century, and Cauchy proved the first general existence theorem in the nineteenth century. This topic collects the ordinary differential equations pages of math2. Its sub-areas are listed below, in reading order. Dynamical systems, partial differential equations and numerical methods for differential equations have their own topics.

  1. Basic notions and models
  2. Elementary methods for first-order equations
  3. Existence and uniqueness of solutions
  4. Maximal solutions and dependence on data
  5. Differential inequalities and comparison theorems
  6. Linear differential equations of order n
  7. Linear equations with constant coefficients
  8. Linear systems of differential equations
  9. Power series solutions and the Frobenius method
  10. Named linear and nonlinear equations
  11. Autonomous systems, first integrals and linear stability
  12. Floquet theory and periodic linear equations
  13. Boundary value problems
  14. Sturm-Liouville theory
  15. Oscillation theory and zeros of solutions
  16. Spectral theory of ordinary differential operators
  17. Analytic and nonlinear ODEs in the complex domain
  18. Symmetry methods and integrability
  19. Delay and functional differential equations
  20. Generalized, abstract and nonclassical ODEs

Partial differential equations

This area studies partial differential equations, which relate an unknown function of several variables to its partial derivatives. The Laplace equation, the heat equation and the wave equation are the model elliptic, parabolic and hyperbolic equations, and the classification of equations follows these three types. Partial differential equations are the language of continuum physics, of fluid flow, of electromagnetism, of general relativity and of quantum mechanics, and they are central tools of geometry. D'Alembert found the wave equation for the vibrating string in 1747, and Fourier solved the heat equation by trigonometric series in the early nineteenth century. This topic collects the partial differential equations pages of math2. Its sub-areas are listed below, in reading order. Potential theory, numerical methods for differential equations, fluid mechanics, and the calculus of variations and optimal control have their own topics.

  1. Foundations, classification and well-posedness
  2. First-order equations and characteristics
  3. The Laplace, Poisson, Helmholtz and biharmonic equations
  4. The heat equation
  5. The wave equation
  6. Separation of variables, transform methods and explicit solutions
  7. Fundamental solutions, constant coefficients and hypoellipticity
  8. Analytic theory, uniqueness and local solvability
  9. Maximum principles and symmetry
  10. Weak solutions and the variational theory of linear elliptic equations
  11. Regularity theory for linear elliptic equations
  12. Rough coefficients and De Giorgi-Nash-Moser theory
  13. Semilinear and quasilinear elliptic equations
  14. Fully nonlinear elliptic equations and the Monge-Ampère equation
  15. General parabolic equations
  16. Reaction-diffusion equations and pattern formation
  17. Hamilton-Jacobi equations and viscosity solutions
  18. Hyperbolic conservation laws, shocks and entropy solutions
  19. Hyperbolic systems, energy methods and nonlinear wave equations
  20. Dispersive equations and Strichartz estimates
  21. Integrable PDEs and solitons
  22. Existence and regularity theory for the Navier-Stokes and Euler equations
  23. Kinetic equations
  24. Free boundary problems and variational inequalities
  25. Eigenvalue problems and spectral theory for PDE operators on domains
  26. Pseudodifferential operators and microlocal analysis
  27. Inverse problems and ill-posed problems for PDE
  28. Homogenization
  29. Controllability and stabilization of PDE
  30. Mixed-type, nonlocal and other classes of PDE

Dynamical systems

This area studies the long-run behaviour of the orbits of iterated maps and of flows, how this behaviour changes with parameters, and which systems are the same up to a change of coordinates. A dynamical system is a space together with a map of the space to itself, or a flow, and the orbit of a point is the sequence or curve of its images. Dynamical systems model the motion of planets, the evolution of populations and many other systems that change in time, and they show that simple deterministic rules can give chaotic behaviour. Poincaré started the qualitative theory around 1890 in his work on the three-body problem of celestial mechanics. This topic collects the dynamical systems pages of math2. Its sub-areas are listed below, in reading order. Ergodic theory, ordinary differential equations, and symplectic and Poisson geometry have their own topics.

  1. Foundations of dynamical systems
  2. Interval maps and renormalization
  3. Circle dynamics
  4. Topological dynamics
  5. Conley theory and chain recurrence
  6. Topological entropy and orbit growth
  7. Symbolic dynamics and shift spaces
  8. Cellular automata
  9. Invariant manifolds and local theory of equilibria
  10. Lyapunov stability theory
  11. Planar flows and limit cycles
  12. Periodic orbits and connecting orbits
  13. Averaging and adiabatic theory
  14. Local bifurcations
  15. Global bifurcations and routes to chaos
  16. Chaos and strange attractors
  17. Uniformly hyperbolic dynamics
  18. Structural stability and generic dynamics
  19. Nonuniform and partial hyperbolicity
  20. Thermodynamic formalism and dynamical zeta functions
  21. Surface dynamics and twist maps
  22. Translation surfaces and interval exchanges
  23. Billiard dynamics
  24. Hamiltonian dynamics and KAM theory
  25. Infinite-dimensional integrable systems
  26. Dissipative dynamics in infinite dimensions
  27. Random dynamical systems
  28. Iteration of rational maps
  29. The quadratic family and the Mandelbrot set
  30. Transcendental and higher-dimensional complex dynamics

Ergodic theory

Ergodic theory is the study of dynamical systems that preserve a measure, of the average behaviour of their orbits, and of the question of when two such systems are isomorphic. A measure-preserving transformation of a probability space is a measurable map such that the inverse image of each measurable set has the same measure as the set. The subject gives a mathematical base for the ergodic hypothesis of statistical mechanics, and its methods give proofs of deep results in combinatorics and number theory, such as Szemerédi's theorem on arithmetic progressions. Birkhoff and von Neumann proved the first ergodic theorems in the early 1930s. This topic collects the ergodic theory pages of math2. Its sub-areas are listed below, in reading order. Dynamical systems, probability theory and operator algebras have their own topics.

  1. Measure-preserving systems
  2. Ergodicity and recurrence
  3. Ergodic theorems
  4. Mixing properties
  5. Spectral theory of measure-preserving systems
  6. Measure-theoretic entropy
  7. Bernoulli systems and Ornstein theory
  8. Constructions and generic transformations
  9. Joinings and disjointness
  10. Invariant measures of topological systems
  11. Nonsingular and infinite ergodic theory
  12. Orbit equivalence and measured equivalence relations
  13. Measure-preserving actions of general groups
  14. Homogeneous dynamics
  15. Measure rigidity
  16. Ergodic Ramsey theory and multiple recurrence
  17. Cocycles and Lyapunov exponents
  18. Dynamics, probability and statistical mechanics

Functional, difference and integral equations

This area studies equations in which the unknown is a function and the equation relates the values of the function at different points, its differences, or its integrals against a kernel. An integral equation contains the unknown function under an integral sign, and in a Fredholm equation of the second kind the function equals a given function plus a multiple of the integral of a kernel times the function. These equations come from boundary value problems, population models, renewal theory, scattering and the characterization of the elementary functions, and the Fredholm theory of integral equations was a main source of functional analysis. Cauchy studied the additive functional equation in 1821, and Fredholm published his theory of integral equations in 1903. This topic collects the functional, difference and integral equations pages of math2. Its sub-areas are listed below, in reading order. Operator theory, ordinary differential equations and real analysis have their own topics.

  1. Panorama and history
  2. Cauchy's equation and additive functions
  3. Classical functional equations
  4. Equations on groups, conditional equations and functional inequalities
  5. Stability of functional equations
  6. Iterative functional equations
  7. Functional equations in competitions
  8. Calculus of finite differences
  9. Linear difference equations
  10. Asymptotics, stability and boundary value problems
  11. Nonlinear difference equations
  12. Difference equations in applications
  13. Partial, delay, q-, stochastic and integrable difference equations
  14. Basic notions of integral equations
  15. Fredholm integral equations
  16. Eigenvalue problems for integral equations
  17. Volterra integral equations
  18. Abel and singular integral equations
  19. Wiener-Hopf and convolution equations
  20. Nonlinear integral equations
  21. Integro-differential equations
  22. Integral equations of physics
  23. First-kind equations and ill-posedness
  24. Approximation and qualitative theory
  25. Abstract and random integral equations

Calculus of variations and optimal control

The calculus of variations studies the minimization of functionals, which assign numbers to functions or to geometric objects, and optimal control studies how to choose the input of a dynamical system so that a cost becomes minimal. The Euler-Lagrange equation is the differential equation that each smooth minimizer of an integral functional satisfies. Variational principles express many laws of physics, and the methods of the area give existence theorems for nonlinear partial differential equations, minimal surfaces and optimal transport, with uses in engineering and economics. Johann Bernoulli posed the brachistochrone problem in 1696, and Pontryagin and his coworkers proved the maximum principle of optimal control in the 1950s. This topic collects the calculus of variations and optimal control pages of math2. Its sub-areas are listed below, in reading order. Optimization, partial differential equations, measure and integration, and control and systems theory have their own topics.

  1. Functionals, the first variation and the Euler-Lagrange equation
  2. Classical problems
  3. Constraints, multipliers and variable endpoints
  4. The second variation and sufficient conditions
  5. Canonical formalism, Hamilton-Jacobi theory and variational principles
  6. The direct method and existence of minimizers
  7. Quasiconvexity and vectorial variational problems
  8. Regularity of minimizers
  9. Relaxation, Young measures and microstructure
  10. Γ-convergence, homogenization and phase transitions
  11. Free discontinuity problems
  12. Plateau's problem and parametric minimal surfaces
  13. Area-minimizing currents, regularity and geometric variational problems
  14. Optimal transport
  15. Wasserstein spaces, gradient flows and computational transport
  16. Nonsmooth analysis, variational analysis and well-posedness
  17. Optimal control problems and existence of optimal controls
  18. The Pontryagin maximum principle and necessary conditions
  19. Linear-quadratic control, Riccati equations and feedback synthesis
  20. Dynamic programming and the Hamilton-Jacobi-Bellman equation
  21. Differential games and mean-field games
  22. Optimal control of partial differential equations
  23. Shape optimization, topology optimization and variational eigenvalue problems

Probability theory

Probability theory is the mathematical study of chance, of random variables and their distributions, and of the limit laws for sums of many random terms. A probability space is a measure space with total mass one, and a random variable is a measurable function on such a space. Probability is the base of statistics, of statistical physics and of the analysis of randomized algorithms, and it gives tools to many other parts of mathematics. Pascal and Fermat started the theory in their letters of 1654, and Kolmogorov gave its axioms in the language of measure theory in 1933. This topic collects the probability theory pages of math2. Its sub-areas are listed below, in reading order. Stochastic processes, stochastic analysis, random structures and probabilistic models, and statistical inference have their own topics.

  1. Probability at school
  2. Probability spaces and axioms
  3. Conditional probability and Bayes' theorem
  4. Paradoxes and puzzles of probability
  5. Independence
  6. Random variables and distribution functions
  7. Joint distributions and transformations
  8. Expectation, variance and moments
  9. Discrete distributions
  10. Continuous distributions
  11. The normal distribution and Gaussian vectors
  12. Generating functions and characteristic functions
  13. Conditional expectation
  14. Probability inequalities
  15. Concentration inequalities
  16. Modes of convergence
  17. Probability metrics, coupling and stochastic orders
  18. Zero-one laws and the Borel-Cantelli lemmas
  19. Laws of large numbers and random series
  20. Central limit theorems
  21. Poisson approximation and Stein's method
  22. Infinitely divisible and stable laws
  23. Characterization and decomposition of distributions
  24. Large deviations
  25. Empirical processes and uniform limit theorems
  26. Extreme value theory
  27. Probability on groups
  28. Probability in Banach spaces
  29. Combinatorial probability
  30. Foundations and interpretations of probability

Stochastic processes

This area studies families of random variables indexed by time or by space as whole random objects, with their laws, their path properties and their long-run behaviour. A stochastic process is a collection of random variables on one probability space, indexed by a set such as the integers or the half-line. Stochastic processes model queues, populations, prices, signals and physical diffusion, and Brownian motion is a central object both in probability and in analysis. Markov introduced the chains that have his name in 1906, and Wiener gave the first rigorous construction of Brownian motion in 1923. This topic collects the stochastic processes pages of math2. Its sub-areas are listed below, in reading order. Probability theory, stochastic analysis, and random structures and probabilistic models have their own topics.

  1. Foundations of stochastic processes
  2. Martingales in discrete time
  3. Random walks
  4. Basic theory of Markov chains
  5. Long-run behaviour of Markov chains
  6. Mixing times of Markov chains
  7. Markov chains on general state spaces
  8. Continuous-time Markov chains
  9. Poisson processes
  10. Renewal and regenerative processes
  11. Branching processes
  12. Continuous-time martingales and the general theory of processes
  13. Brownian motion
  14. Path properties of Brownian motion
  15. Excursions and path decompositions
  16. Convergence of processes and invariance principles
  17. Gaussian processes
  18. Stationary processes
  19. Exchangeability and urn models
  20. Lévy processes
  21. Point processes and random measures
  22. Markov processes and their semigroups
  23. Optimal stopping and the theory of gambling

Stochastic analysis

Stochastic analysis is the calculus of random processes, with stochastic integrals, stochastic differential equations and the analysis of functionals of Brownian motion. The Itô integral of an adapted process against Brownian motion is the limit in mean square of sums in which the integrand takes its value at the left end of each interval. Stochastic differential equations model systems under random forcing in physics, biology, engineering and finance, and their solutions give probabilistic formulas for the solutions of partial differential equations. Itô defined the stochastic integral and stochastic differential equations in the 1940s. This topic collects the stochastic analysis pages of math2. Its sub-areas are listed below, in reading order. Stochastic processes, random structures and probabilistic models, and partial differential equations have their own topics.

  1. The setting of stochastic integration
  2. Continuous local martingales and quadratic variation
  3. The Itô integral
  4. Itô's formula and stochastic exponentials
  5. Change of measure and martingale representation
  6. Local times of semimartingales
  7. Stratonovich calculus
  8. Semimartingales with jumps
  9. Existence and uniqueness for SDEs
  10. Explicit SDEs and model diffusions
  11. Diffusion processes and their generators
  12. Feynman-Kac formulas and probabilistic representation
  13. Ergodicity and stability of SDEs
  14. Small noise and multiscale diffusions
  15. McKean-Vlasov equations and propagation of chaos
  16. Backward stochastic differential equations
  17. Regularization by noise
  18. Random integral equations and random operators
  19. Wiener chaos and white noise analysis
  20. Malliavin calculus and anticipating calculus
  21. Stochastic flows and stochastic calculus on manifolds
  22. Nonlinear filtering
  23. Stochastic partial differential equations
  24. Singular SPDEs and regularity structures
  25. Rough path theory
  26. Path signatures and the algebra of rough analysis

Random structures and probabilistic models

This area studies large random objects in space, such as random media, random geometry, random matrices and random combinatorial structures, with their phase transitions, scaling limits and universality. In Bernoulli bond percolation on a lattice, each edge is open with probability p independently of the other edges, and the main question is whether an infinite connected cluster of open edges exists. Many of these models come from statistical physics, and their study joins probability with combinatorics, complex analysis and mathematical physics. Broadbent and Hammersley introduced percolation in 1957, and Wigner introduced random matrices in the 1950s as models for the energy levels of heavy nuclei. This topic collects the random structures and probabilistic models pages of math2. Its sub-areas are listed below, in reading order. Extremal and probabilistic combinatorics, stochastic processes, and thermodynamics and statistical mechanics have their own topics.

  1. Scaling limits, universality and common tools
  2. Basic theory of Bernoulli percolation
  3. The percolation phase transition on the integer lattice
  4. Two-dimensional percolation
  5. Percolation on general graphs and variant models
  6. The random-cluster model
  7. First-passage percolation and random metrics
  8. Self-avoiding walk and lattice path models
  9. Random polymer models
  10. Random walks in random environment
  11. Interacting particle systems
  12. Hydrodynamic limits and fluctuations
  13. Random growth, aggregation and sandpiles
  14. KPZ universality and integrable probability
  15. Random matrix ensembles
  16. Global eigenvalue laws and extreme singular values
  17. Local eigenvalue statistics and universality
  18. Determinantal, Pfaffian and Gibbs point processes
  19. Random fields and their level sets
  20. The Gaussian free field and random surfaces
  21. Schramm-Loewner evolution
  22. Conformally invariant scaling limits of lattice models
  23. Random planar maps and Liouville quantum gravity
  24. Random trees and their scaling limits
  25. Random graphs as probability models
  26. Mean-field spin glasses and random constraint satisfaction
  27. Random permutations and exchangeable random partitions
  28. Coalescents and fragmentation processes
  29. Stochastic geometry
  30. Dimers and random tilings

Statistical inference

Statistical inference is the theory of how to learn about an unknown probability law from data, and of how to judge the procedures that do it. A statistical model is a family of probability laws indexed by a parameter, and the data are taken as a sample from one unknown member of the family. Inference gives the methods by which the sciences, medicine and industry draw conclusions from data with a measured uncertainty. Fisher introduced maximum likelihood and sufficiency in the 1920s, and Neyman and Pearson gave their theory of optimal tests in 1933. This topic collects the statistical inference pages of math2. Its sub-areas are listed below, in reading order. Statistical models and methods, probability theory and information theory have their own topics.

  1. Statistical models, samples and statistics
  2. Statistical inference at school
  3. Sampling distributions and large-sample approximations
  4. Sufficiency, completeness and exponential families
  5. Point estimation
  6. Unbiased estimation and information inequalities
  7. Maximum likelihood and the likelihood function
  8. M-estimators and estimating equations
  9. Confidence intervals, regions and prediction sets
  10. Errors, power and p-values of hypothesis tests, and the standard tests
  11. Optimal tests
  12. Likelihood ratio, Wald and score tests and their asymptotics
  13. Multiple testing, selection and ranking
  14. Statistical decision theory, shrinkage and empirical Bayes
  15. Invariance and equivariance
  16. Bayesian inference
  17. Bayesian nonparametric inference
  18. Inference from order statistics, quantiles and extremes
  19. Goodness-of-fit tests
  20. Rank tests, U-statistics and distribution-free inference
  21. Nonparametric density and functional estimation
  22. Bootstrap, permutation and resampling inference
  23. Robust statistics
  24. Sequential analysis, anytime-valid inference and stochastic approximation
  25. Le Cam theory and the asymptotics of experiments
  26. Semiparametric inference
  27. Minimax theory and lower bounds
  28. Empirical process methods in statistics
  29. Model selection and model averaging
  30. Foundations of statistical inference

Statistical models and methods

This area studies the models and the methods of statistics as a working science, such as the description of data, regression models, the design of experiments and surveys, and the methods for data with special structure. A regression model describes how the distribution of a response variable depends on explanatory variables, and the linear model takes the mean of the response to be a linear function of these variables. These methods are the daily tools of data analysis in medicine, biology, economics, engineering and the social sciences. Legendre and Gauss introduced the method of least squares in the early nineteenth century, and Fisher developed the analysis of variance and the design of experiments in the 1920s and 1930s. This topic collects the statistical models and methods pages of math2. Its sub-areas are listed below, in reading order. Statistical inference, probability theory and the mathematics of machine learning have their own topics.

  1. Descriptive statistics and data displays
  2. Correlation and simple linear regression
  3. Linear models and least squares
  4. Regression diagnostics and remedies
  5. Variable selection and model building
  6. High-dimensional regression and sparsity
  7. Analysis of variance and covariance
  8. Mixed models and correlated data
  9. Generalized linear models
  10. Nonlinear and nonparametric regression
  11. Robust regression and measurement error
  12. Principles of experimental design
  13. Factorial, response surface and optimal designs
  14. Survey sampling
  15. Missing data
  16. Causal inference
  17. Categorical data analysis
  18. Multivariate normal theory and covariance estimation
  19. Dimension reduction and latent variable models
  20. Discriminant analysis, mixtures and cluster analysis
  21. Graphical models in statistics
  22. Time series models and forecasting
  23. Spectral analysis, state-space models and inference for processes
  24. Spatial statistics
  25. Directional, shape, functional and object data
  26. Algebraic statistics
  27. Survival analysis and reliability
  28. Computational statistics
  29. Econometric models
  30. Applied statistics in science and industry

Information theory

Information theory is the mathematical theory of information in the sense of Shannon, with the measures of information and the limits on the compression and the transmission of data. The entropy of a discrete random variable is the expected value of the negative logarithm of its probability mass function, and it measures the average uncertainty of the variable. The coding theorems give the least rate at which a source can be compressed and the greatest rate at which data can pass reliably through a noisy channel, and these limits guide the design of modern communication systems. Shannon founded the subject in 1948 with his paper A Mathematical Theory of Communication. This topic collects the information theory pages of math2. Its sub-areas are listed below, in reading order. Coding theory, mathematical cryptography and statistical inference have their own topics.

  1. Foundations and history of information theory
  2. Entropy and mutual information
  3. Relative entropy and divergences
  4. Information inequalities
  5. Typical sequences and the asymptotic equipartition property
  6. Entropy rates and information sources
  7. Method of types and hypothesis testing
  8. Lossless source coding
  9. Universal source coding
  10. Discrete memoryless channels and capacity
  11. Channel coding theorems
  12. Channels with memory, state and feedback
  13. Differential entropy and continuous information measures
  14. The Gaussian channel
  15. Rate-distortion theory and quantization
  16. Multi-user channels
  17. Distributed source coding and network coding
  18. Information-theoretic security
  19. Generalized entropies and other information measures
  20. The maximum entropy principle
  21. Gambling, investment and information
  22. Signals, modulation and detection
  23. Shift register sequences and sequence design

Mathematics of machine learning

This area studies the mathematics of learning from data, with the models of learning, the theorems that bound what a learner can do, and the analysis of the main families of learning methods. In the basic model, a learner receives a sample of labelled examples drawn from an unknown distribution and must choose a hypothesis whose expected loss on new examples is small. Machine learning methods are now in use across science and industry, and their mathematics joins probability, statistics, optimization, approximation theory and the theory of computation. Vapnik and Chervonenkis introduced their measure of the capacity of a class of sets around 1970, and Valiant defined probably approximately correct learning in 1984. This topic collects the mathematics of machine learning pages of math2. Its sub-areas are listed below, in reading order. Statistical inference, statistical models and methods, and optimization have their own topics.

  1. The learning problem
  2. PAC learning and sample complexity
  3. Capacity measures and generalization bounds
  4. Stability, PAC-Bayes and information-theoretic bounds
  5. Inductive inference and exact learning
  6. Losses, surrogates and evaluation of predictors
  7. Classification rules and their consistency
  8. Kernel methods in learning
  9. Linear classifiers and support vector machines
  10. Boosting
  11. Online learning and regret
  12. Bandit theory
  13. Markov decision processes
  14. Reinforcement learning theory
  15. The basic model of neural networks
  16. Neural network architectures as mathematical objects
  17. Approximation and expressivity of neural networks
  18. Optimization theory for learning
  19. Infinite-width limits of neural networks
  20. Generalization of overparameterized models
  21. Learning theory of transformers
  22. Generative models
  23. Probabilistic graphical models
  24. Clustering theory
  25. Dimensionality reduction and manifold learning
  26. Learning settings beyond supervised learning
  27. Robust, fair and private learning

Numerical analysis

Numerical analysis studies algorithms that compute approximate answers to problems of continuous mathematics, with their accuracy, their stability and their cost. An algorithm is backward stable when each answer that it computes is the exact answer for data that differ from the given data by a small relative amount. Numerical methods are the base of scientific computation in physics, engineering, statistics and data analysis, and their error theory tells when a computed answer can be trusted. Von Neumann, Goldstine and Turing analysed rounding errors in matrix computations in the 1940s, and Wilkinson developed backward error analysis in the 1950s and 1960s. This topic collects the numerical analysis pages of math2. Its sub-areas are listed below, in reading order. Numerical methods for differential equations, approximation theory and optimization have their own topics.

  1. Foundations of numerical analysis
  2. Floating-point arithmetic
  3. Rounding error analysis
  4. Conditioning and numerical stability
  5. Interval arithmetic and validated numerics
  6. Root finding for one equation
  7. Polynomial root finding
  8. Systems of nonlinear equations
  9. Direct methods for linear systems
  10. Orthogonal factorizations and least squares
  11. Sparse matrices and sparse direct methods
  12. Stationary iterative methods
  13. Krylov subspace methods and preconditioning
  14. Matrix eigenvalue algorithms
  15. Matrix functions and matrix equations
  16. Low-rank and randomized matrix computations
  17. High-performance and parallel numerical computing
  18. Numerical and automatic differentiation
  19. Newton-Cotes and composite quadrature
  20. Gaussian quadrature and cubature
  21. Fast transforms
  22. Numerical evaluation of elementary functions
  23. Monte Carlo methods and random variate generation
  24. Markov chain Monte Carlo methods
  25. Quasi-Monte Carlo methods and the complexity of numerical problems
  26. Ill-posed problems and operator equations
  27. Uncertainty quantification

Numerical methods for differential equations

This area studies methods that approximate the solutions of ordinary, partial, differential-algebraic, delay and stochastic differential equations, with the theory of their convergence, stability and errors. A numerical method converges when the difference between the computed and the exact solution goes to zero as the step size or the mesh size goes to zero. These methods make it possible to simulate weather, flows, structures, circuits and chemical reactions, and they are among the main uses of computers in science and engineering. Euler described his method for the initial value problem in 1768, and Courant, Friedrichs and Lewy found their stability condition for difference schemes in 1928. This topic collects the numerical methods for differential equations pages of math2. Its sub-areas are listed below, in reading order. Numerical analysis, ordinary differential equations and partial differential equations have their own topics.

  1. Foundations of numerical methods for ODEs
  2. Runge-Kutta methods and their order theory
  3. Linear multistep methods
  4. Absolute stability and stiff problems
  5. Error estimation, step-size control and extrapolation
  6. Geometric numerical integration
  7. Numerical methods for DAEs and delay equations
  8. Numerical boundary value problems for ODEs
  9. Finite difference methods for elliptic problems
  10. Stability theory for time-dependent difference schemes
  11. Finite difference methods for parabolic problems
  12. Finite difference methods for hyperbolic and wave problems
  13. Numerical methods for conservation laws
  14. The Galerkin framework
  15. Finite element spaces and a priori error estimates
  16. Mixed, saddle-point and stabilized finite element methods
  17. Discontinuous Galerkin and polytopal methods
  18. Finite elements for time-dependent problems
  19. Spectral methods
  20. Multigrid methods
  21. Domain decomposition and parallel-in-time methods
  22. A posteriori error estimation and adaptivity
  23. Boundary integral, particle, meshfree and interface methods
  24. Numerical Hamilton-Jacobi equations and level set methods
  25. Splitting, IMEX and exponential integrators
  26. Numerical methods for stochastic differential equations
  27. Numerical analysis of dynamical systems
  28. Eigenvalue, ill-posed and inverse problems for differential equations
  29. Multiscale, reduced-order and uncertainty quantification methods

Optimization

Optimization is the study of how to find the best point of a set with respect to a given objective. An optimization problem asks for a point that minimizes a function over a feasible set, and equations and inequalities usually describe this set. Optimization problems arise in engineering, economics, statistics and machine learning, and convexity often decides whether a problem is tractable. Fermat and Lagrange gave the first conditions for extrema, and the work of Kantorovich and Dantzig on linear programming in the 1940s started the modern subject. This topic collects the optimization pages of math2: convex analysis and duality, optimality conditions, linear, integer, conic and polynomial programming, combinatorial optimization, the algorithms and their complexity, and optimization under uncertainty and with several objectives. Operations research, game theory, the calculus of variations and optimal control, and convex and discrete geometry have their own topics.

  1. Optimization problems
  2. Convex functions on R^n
  3. Subdifferentials of convex functions
  4. Conjugate functions and Fenchel duality
  5. Lagrangian duality and saddle points
  6. Optimality conditions for nonlinear programs
  7. Linear programming
  8. The simplex method and decomposition
  9. Complexity of linear and convex programming
  10. Integer programming
  11. Polyhedral combinatorics
  12. Combinatorial optimization problems
  13. Submodular and discrete convex optimization
  14. Network optimization
  15. Conic and semidefinite programming
  16. Polynomial optimization and sums of squares
  17. Quadratic, fractional and other special programs
  18. Line search, Newton and quasi-Newton methods
  19. First-order methods and oracle complexity
  20. Operator splitting and proximal algorithms
  21. Algorithms for constrained nonlinear programs
  22. Interior point methods
  23. Stochastic programming and stochastic optimization
  24. Robust and distributionally robust optimization
  25. Multiobjective and vector optimization
  26. Global and derivative-free optimization
  27. Finite-dimensional variational inequalities and complementarity
  28. Discrete-time dynamic programming
  29. Optimization in infinite dimensions and on manifolds
  30. Numerical methods for optimal control

Operations research

Operations research is the study of mathematical models for the planning and running of operations, logistics, service systems and decisions. An operations research model states a real problem as a mathematical program, a stochastic system or a decision problem, and the theory then solves it or bounds its value. These models are used in transport, manufacturing, inventory control, telecommunications, health care and many other fields. The subject took its name and its first methods from the work of British and American scientists on military operations in the Second World War. This topic collects the operations research pages of math2: modelling, transportation, network and routing models, project planning and scheduling, location and packing, inventory and supply chains, queueing theory, stochastic dynamic programming, reliability, decision analysis, simulation, heuristics and revenue management. Optimization, game theory, stochastic processes and mathematical economics have their own topics.

  1. OR modelling and formulation
  2. Transportation and assignment models
  3. Network flow models in OR
  4. Project planning with CPM and PERT
  5. Machine scheduling theory
  6. Personnel scheduling and timetabling
  7. Vehicle routing and TSP practice
  8. Facility location models
  9. Cutting and packing models
  10. Deterministic inventory models
  11. Stochastic inventory models
  12. Supply chain and production models
  13. Queueing fundamentals
  14. Markovian queueing models
  15. Non-Markovian single-station queues
  16. Queueing network models
  17. Heavy-traffic and queueing approximations
  18. Stochastic dynamic programming in OR
  19. Stochastic scheduling and index policies
  20. Reliability theory
  21. Maintenance and replacement models
  22. Decision analysis and multicriteria decisions
  23. Simulation modelling and output analysis
  24. Heuristics and metaheuristics
  25. Revenue management and pricing models
  26. Traffic and network equilibrium models
  27. Search theory
  28. Data envelopment analysis and efficiency

Game theory

Game theory is the mathematical study of strategic interaction between decision makers. A game in strategic form consists of a set of players, a set of strategies for each player, and a payoff function for each player on the profiles of strategies. Game theory gives models for economics, political science, evolutionary biology and computer science, and the Nash equilibrium is its central solution concept. Von Neumann proved the minimax theorem for zero-sum games in 1928, and his 1944 book with Morgenstern and the work of Nash around 1950 started the modern subject. This topic collects the game theory pages of math2: strategic, zero-sum, extensive and Bayesian games, equilibrium refinements, repeated and stochastic games, cooperative games and values, bargaining, evolutionary and learning dynamics, algorithmic game theory, mechanism design and auctions, and combinatorial games. Mathematical economics, optimization, the calculus of variations and optimal control, and recreational mathematics have their own topics.

  1. Games in strategic form
  2. Classic games and standard examples
  3. Zero-sum games and the minimax theorem
  4. Existence and structure of Nash equilibria
  5. Correlated equilibrium and epistemic game theory
  6. Extensive-form games
  7. Equilibrium refinements and equilibrium selection
  8. Bayesian games, signaling and information design
  9. Repeated games and folk theorems
  10. Stochastic games, games on graphs and games of timing
  11. Coalitional games, the core and related solutions
  12. The Shapley value and power indices
  13. Bargaining theory
  14. Evolutionary game theory
  15. Learning in games
  16. Potential and congestion games
  17. Algorithmic game theory
  18. Mechanism design and implementation
  19. Auction theory
  20. Impartial combinatorial games
  21. Partisan games and Conway's theory
  22. Positional games and strategy stealing
  23. Solved games
  24. Behavioral and experimental game theory
  25. Large, network and quantum games

Mathematical economics and social sciences

Mathematical economics uses mathematical models to study the choices of agents, markets, prices and the allocation of resources, and the mathematical social sciences use such models for collective decisions, measurement and social structure. The central object of economic theory is an economy, which is a set of agents with preferences and endowments or technologies, together with the rules by which they trade or decide. The models give exact forms to economic and social claims, such as the existence of a competitive equilibrium and the impossibility theorems of social choice. Cournot and Walras started the mathematical theory of markets in the nineteenth century, and Arrow, Debreu and McKenzie proved the existence of general equilibrium in the 1950s. This topic collects the mathematical economics and social sciences pages of math2. Its sub-areas are listed below, in reading order. Game theory, mathematical finance and insurance, operations research and mathematical biology have their own topics.

  1. Foundations of mathematical economics
  2. Preferences and utility
  3. Choice functions and revealed preference
  4. Consumer theory and demand
  5. Producer theory and cost
  6. Market structure, monopoly and oligopoly
  7. Expected utility and risk aversion
  8. Uncertainty, non-expected utility and intertemporal choice
  9. Exchange economies, efficiency and the welfare theorems
  10. Existence, uniqueness, stability and computation of equilibrium
  11. Welfare economics and public economics
  12. Inequality, poverty and the economic theory of index numbers
  13. Information economics, contracts and search
  14. Linear and multisectoral models
  15. International trade and spatial economics
  16. Economic growth and natural resources
  17. Economic dynamics and macroeconomic models
  18. Social choice theory
  19. Strategy-proofness and judgment aggregation
  20. Voting rules, criteria and paradoxes
  21. Apportionment and proportional representation
  22. Fair division of divisible goods
  23. Fair allocation of indivisible goods
  24. Matching markets and market design
  25. Measurement theory and psychometrics
  26. Mathematical psychology
  27. Mathematical sociology and social networks
  28. Mathematical demography
  29. Mathematics in other social and behavioural sciences

Mathematical finance and insurance

Mathematical finance and insurance is the study of the valuation of cash flows, securities and contingent claims, the choice of portfolios, the measurement of financial risk, and the actuarial models of life and non-life insurance. Its central notion is the absence of arbitrage, and the fundamental theorem of asset pricing links this condition to the existence of an equivalent probability measure under which discounted prices are martingales. Banks and insurers use the theory to price and hedge contracts, to manage risk and to set capital requirements. Bachelier modelled prices by Brownian motion in 1900, Lundberg started the theory of ruin in 1903, and Black, Scholes and Merton published their option pricing theory in 1973. This topic collects the mathematical finance and insurance pages of math2. Its sub-areas are listed below, in reading order. Stochastic analysis, stochastic processes, mathematical economics and statistical models have their own topics.

  1. Foundations and overview
  2. Theory of interest
  3. Bonds and fixed income
  4. Derivative contracts and model-free arbitrage relations
  5. Arbitrage theory in discrete time
  6. Binomial and lattice models
  7. Mean-variance portfolio theory
  8. Equilibrium asset pricing and factor models
  9. Optimal investment, utility and growth
  10. Black-Scholes theory
  11. Greeks and hedging
  12. American and exotic options
  13. Volatility modelling
  14. Jump and Lévy models in finance
  15. Short-rate models of the term structure
  16. Forward rate and market models
  17. Credit risk models
  18. General arbitrage theory, incomplete markets and robust finance
  19. Systemic risk and financial networks
  20. Corporate finance and market microstructure
  21. Risk measures
  22. Quantitative risk management
  23. Numerical methods in finance
  24. Survival models and life tables
  25. Life insurance and annuity mathematics
  26. Multiple state models, mortality projection and pensions
  27. Risk theory and premium principles
  28. Ruin theory
  29. Credibility theory and claims reserving
  30. Market-consistent insurance and insurance-linked finance

Control and systems theory

Control and systems theory is the study of dynamical systems that have inputs and outputs, and of the ways to choose the inputs so that a system behaves as required. A control system is a dynamical system with an input that we can choose, called the control, and an output that we can measure. Feedback computes the input from the measured output, and it can make a system stable and less sensitive to disturbances and to errors in the model. Maxwell studied the stability of governors in 1868, Nyquist and Bode built the frequency-domain theory of feedback amplifiers in the 1930s and 1940s, and Kalman introduced the state-space theory around 1960. This topic collects the control and systems theory pages of math2. Its sub-areas are listed below, in reading order. Optimal control and the calculus of variations, dynamical systems, ordinary differential equations and information theory have their own topics.

  1. Foundations of systems and control
  2. Linear time-invariant systems and transfer functions
  3. Classical feedback design and PID control
  4. Stability of linear systems and polynomials
  5. Frequency-domain methods
  6. Controllability and observability
  7. System structure and canonical forms
  8. Realization theory and model reduction
  9. State feedback, pole placement and observers
  10. Discrete-time, sampled-data and digital control
  11. Robust and H-infinity control
  12. Absolute stability, passivity and dissipativity
  13. Nonlinear control and feedback stabilization
  14. Geometric nonlinear control
  15. State estimation and filtering
  16. Stochastic control
  17. System identification and adaptive control
  18. Predictive, learning and intelligent control
  19. Infinite-dimensional and time-delay control systems
  20. Hybrid, switched, descriptor and other system classes
  21. Networked, decentralized and multi-agent control
  22. Robotics and applications of control
  23. Electrical circuit theory and network synthesis
  24. Switching circuits and logic design

Coding theory

Coding theory is the study of codes that detect and correct errors in data that is sent over a noisy channel or kept in storage. A block code of length n over a finite alphabet is a set of words of length n, and its minimum distance is the least number of positions in which two different codewords differ. A code with minimum distance d corrects every pattern of fewer than d/2 errors, and a good code has both a large distance and a high rate. The subject started from 1948 to 1950 with Shannon's channel coding theorem and with the codes of Hamming and Golay, and it grew to use algebra, combinatorics, algebraic geometry and probability. This topic collects the coding theory pages of math2. Its sub-areas are listed below, in reading order. Information theory, mathematical cryptography and the theory of computation have their own topics, and so do designs and finite geometries.

  1. Foundations of coding theory
  2. Linear codes
  3. Weight enumerators and the MacWilliams identities
  4. Bounds on codes
  5. Perfect codes and MDS codes
  6. Hamming, simplex, Hadamard and Golay codes
  7. Cyclic codes
  8. BCH, Reed-Solomon and Goppa codes
  9. Reed-Muller codes
  10. Self-dual codes and invariant theory
  11. Codes over rings
  12. Algebraic geometry codes
  13. Concatenated, expander and asymptotically good codes
  14. Decoding methods and complexity
  15. List decoding
  16. Convolutional codes and trellis decoding
  17. Codes on graphs and iterative decoding
  18. Polar codes
  19. Erasure, fountain and distributed storage codes
  20. Locally decodable and locally testable codes
  21. Quantum error-correcting codes
  22. Codes for bursts, deletions and other error models
  23. Rank-metric and subspace codes
  24. Covering codes and the covering radius
  25. Geometric and structural theory of linear codes

Mathematical cryptography

Mathematical cryptography is the study of methods that keep information secret and authentic in the presence of an adversary, and of the mathematics on which their security rests. A cryptosystem is a set of algorithms for key generation, encryption and decryption, and it is secure in the computational sense when no efficient adversary can learn useful information about the message from the ciphertext without the key. Cryptography protects communication, payments and stored data, and its security rests on problems that are believed to be hard, such as integer factorization, discrete logarithms and lattice problems. Shannon gave a mathematical theory of secrecy systems in 1949, and Diffie and Hellman in 1976 and Rivest, Shamir and Adleman in 1977 started public-key cryptography. This topic collects the mathematical cryptography pages of math2. Its sub-areas are listed below, in reading order. Coding theory, information theory and the theory of computation have their own topics.

  1. Basic notions and classical ciphers
  2. Perfect secrecy and information-theoretic security
  3. The framework of computational security
  4. One-way functions and hardness assumptions
  5. Pseudorandom generators, functions and permutations
  6. Symmetric encryption and block ciphers
  7. Cryptanalysis of symmetric primitives and cryptographic Boolean functions
  8. Hash functions and message authentication
  9. RSA and factoring-based cryptography
  10. Integer factorization algorithms
  11. The discrete logarithm and Diffie-Hellman problems
  12. Public-key encryption and key exchange
  13. Digital signatures
  14. Elliptic and hyperelliptic curve cryptography
  15. Pairing-based cryptography
  16. Lattice problems and their hardness
  17. Lattice-based cryptosystems
  18. Code-based cryptography
  19. Multivariate cryptography
  20. Isogeny-based cryptography
  21. Post-quantum cryptography and the quantum threat
  22. Commitments and zero-knowledge proofs
  23. Secret sharing and threshold cryptography
  24. Secure multiparty computation
  25. Homomorphic encryption, obfuscation and other advanced primitives

Theory of computation

The theory of computation is the study of models of computation and of the resources, such as time, space and randomness, that computational problems need. A complexity class is the set of problems that a model of computation solves within a given bound on a resource, and the class P, for example, holds the decision problems that a deterministic Turing machine solves in polynomial time. The area tells which problems have efficient algorithms, it gives the basis for the security of modern cryptography, and its automata and grammars are in use in compilers and in program verification. Finite automata and the Chomsky hierarchy date from the 1950s, Hartmanis and Stearns defined time complexity classes in 1965, and Cook in 1971 and Levin in 1973 proved that satisfiability is NP-complete. This topic collects the theory of computation pages of math2. Its sub-areas are listed below, in reading order. Computability theory, mathematical cryptography, coding theory and the mathematics of machine learning have their own topics.

  1. Problems, languages and machine models
  2. Regular languages and finite automata
  3. Transducers and variants of finite automata
  4. Automata on infinite words and trees
  5. Context-free languages and pushdown automata
  6. Grammars, the Chomsky hierarchy and rewriting systems
  7. Resource measures and hierarchy theorems
  8. P, NP and NP-completeness
  9. Space complexity classes
  10. The polynomial hierarchy, oracles and barriers
  11. Randomized complexity classes
  12. Counting complexity
  13. Boolean circuit complexity
  14. Query complexity and complexity measures of Boolean functions
  15. Communication complexity
  16. Interactive proofs and zero knowledge
  17. Probabilistically checkable proofs and hardness of approximation
  18. Pseudorandomness and derandomization
  19. Fine-grained and parameterized complexity
  20. Average-case complexity and total search problems
  21. Algebraic complexity theory
  22. Quantum circuits and quantum algorithms
  23. Quantum complexity theory
  24. Parallel, cellular and nonclassical models of computation
  25. Program logics and verification
  26. Concurrency theory and distributed computing
  27. Property testing and sublinear models
  28. Differential privacy

Mathematical biology and chemistry

Mathematical biology and chemistry is the use of mathematical models to study living systems and chemical processes. A typical model is a system of differential equations, difference equations or random processes whose variables are the sizes of populations, the frequencies of genes, or the concentrations of chemical species. Such models explain observed patterns, such as the cycles of predators and prey or the spread of an epidemic, and they help decisions in public health, fisheries and conservation. Malthus wrote on population growth in 1798, Lotka and Volterra proposed their predator-prey equations in the 1920s, and Fisher, Haldane and Wright built mathematical population genetics in the 1920s and 1930s. This topic collects the mathematical biology and chemistry pages of math2. Its sub-areas are listed below, in reading order. Dynamical systems, ordinary and partial differential equations, stochastic processes and game theory have their own topics.

  1. Foundations of mathematical biology
  2. Single-species population models
  3. Predator-prey models
  4. Competition, mutualism and community dynamics
  5. Age- and stage-structured population models
  6. Stochastic population models
  7. Harvesting and pest management models
  8. Community ecology and biodiversity
  9. Spatial ecology, movement and collective behaviour
  10. Deterministic epidemic models
  11. Stochastic and network epidemic models
  12. Classical population genetics
  13. Stochastic population genetics
  14. Evolutionary dynamics and selection theory
  15. Phylogenetic trees and tree spaces
  16. Mathematics of phylogenetic inference
  17. Biological sequence analysis
  18. Macromolecular structure and DNA geometry
  19. Chemical, biochemical and enzyme kinetics
  20. Chemical reaction network theory
  21. Chemical oscillations and excitable media
  22. Systems biology and gene regulation
  23. Neuron and membrane models
  24. Neural populations, plasticity and biological rhythms
  25. Physiology, biomechanics and biofluids
  26. Morphogenesis and biological pattern formation
  27. Molecular graphs and simple quantum chemistry models

Mathematical modelling and applied methods

Mathematical modelling is the work of turning a question about the real world into a mathematical problem, solving that problem, and testing the answer against the world. A mathematical model is a set of variables, equations or rules that represents the main parts of a real system and the relations between them. Models let scientists and engineers predict the behaviour of a system, compare designs and estimate quantities that they cannot measure directly. Dimensional analysis goes back to Fourier and Rayleigh, and the Buckingham pi theorem of 1914 gave it a general form. This topic collects the mathematical modelling and applied methods pages of math2. Its sub-areas are listed below, in reading order. Ordinary and partial differential equations, numerical analysis, statistical models, fluid mechanics and mathematical biology have their own topics.

  1. The modelling process and kinds of model
  2. Dimensional analysis, scaling and similarity
  3. Conservation laws and continuum models as modelling
  4. Compartment models
  5. Traffic flow models
  6. Collective motion, crowds and agent-based models
  7. Network models in applications
  8. Mathematics of climate and weather
  9. Data assimilation methods
  10. The framework of inverse problems
  11. Regularization methods for inverse problems
  12. Statistical and Bayesian inverse problems
  13. Geophysical inversion
  14. Mathematics of tomographic and medical imaging
  15. Image formation, deconvolution and resolution
  16. Digital images and basic image processing
  17. Mathematical morphology
  18. Scale space and PDE methods in image processing
  19. Variational image restoration
  20. Image segmentation
  21. Image registration, optical flow and shape
  22. Image compression
  23. Simulation models, validation and model uncertainty
  24. Multiscale modelling
  25. Industrial mathematics

Classical mechanics

Classical mechanics is the study of the motion of particles, systems of particles and rigid bodies under forces, in the setting of Newton's laws. A mechanical system is described by its configuration, and its equations of motion fix how the configuration changes in time from given initial positions and velocities. Classical mechanics predicts the motion of planets, satellites, machines and structures, and it is the starting point for the other parts of physics. Newton published his laws of motion in 1687, and Lagrange, Hamilton and Jacobi later recast mechanics in terms of energy and variational principles. This topic collects the classical mechanics pages of math2. Its sub-areas are listed below, in reading order. Symplectic geometry, dynamical systems, the calculus of variations, continuum mechanics and relativity have their own topics.

  1. Newtonian foundations
  2. Kinematics of particles and moving frames
  3. Rotations and rigid-body kinematics
  4. Statics and virtual work
  5. Collisions, friction and variable mass
  6. Central forces and the Kepler problem
  7. Lagrangian mechanics and constraints
  8. Variational principles of mechanics
  9. Symmetry and conservation laws in mechanics
  10. Hamiltonian mechanics
  11. Hamilton-Jacobi theory of mechanics
  12. Small oscillations and linear vibrations
  13. Pendulums and nonlinear mechanical oscillators
  14. Rigid body dynamics
  15. Tops and gyroscopes
  16. Nonholonomic mechanics
  17. Geometric mechanics and reduction
  18. Constrained Hamiltonian systems and Dirac theory
  19. Two-body problem and orbital mechanics
  20. The three-body problem
  21. The n-body problem
  22. Celestial perturbation theory and resonances
  23. Tides, planetary rotation and small-body dynamics
  24. Spherical astronomy and astrometry
  25. Stellar and galactic dynamics
  26. Classical field theory

Continuum and solid mechanics

Continuum mechanics is the study of bodies that deform, and solid mechanics is its part that deals with solids. A continuum is a model of matter that fills space without gaps, so that quantities such as density, displacement and stress are fields on the body. The theory gives the deformation and the stress in structures, machines, materials and the Earth, and engineers use it to design bridges, aircraft and buildings. Cauchy introduced the stress tensor in the 1820s, and Navier, Cauchy and Poisson wrote the first equations of linear elasticity at about the same time. This topic collects the continuum and solid mechanics pages of math2. Its sub-areas are listed below, in reading order. Fluid mechanics, classical mechanics, partial differential equations, the calculus of variations and numerical methods for differential equations have their own topics.

  1. Foundations and overview
  2. Kinematics of continua
  3. Stress and balance laws
  4. Constitutive theory and thermodynamics of materials
  5. Linear elastic materials and field equations
  6. Classical solutions of elastostatics
  7. Energy and variational principles of elasticity
  8. Nonlinear elasticity and hyperelasticity
  9. Beams, trusses and frames
  10. Nonlinear rods and filaments
  11. Plates and membranes
  12. Elastic shells
  13. Elastic stability and buckling
  14. Elastodynamics and elastic waves
  15. Plasticity and limit analysis
  16. Viscoelasticity and creep
  17. Thermoelasticity and coupled fields
  18. Fracture, damage and fatigue
  19. Micromechanics and composite materials
  20. Contact mechanics and friction
  21. Phase transformations and microstructure in solids
  22. Generalized continua and defects
  23. Granular media, geomechanics and biomechanics
  24. Computational solid mechanics and structural optimization
  25. Seismic waves, rays and Earth structure
  26. Earthquake sources and statistical seismology
  27. Seismic imaging and exploration seismology
  28. Geodynamics and plate tectonics
  29. Physical geodesy and the figure of the Earth

Fluid mechanics

Fluid mechanics is the study of liquids and gases at rest and in motion. A fluid is a material that deforms without limit under a shear stress, however small, and its motion is described by velocity, pressure and density fields that obey balance laws of mass, momentum and energy. The subject explains the flow of air over wings, of water in pipes, rivers and oceans, of the atmosphere and of the interiors of stars, and it is used in engineering, meteorology, geophysics and biology. Euler wrote the equations of ideal fluid motion in the 1750s, and Navier and Stokes added the effects of viscosity in the first half of the nineteenth century. This topic collects the fluid mechanics pages of math2. Its sub-areas are listed below, in reading order. The analysis of the fluid equations as partial differential equations, computational fluid dynamics, continuum and solid mechanics, and thermodynamics have their own topics.

  1. Foundations and fluid statics
  2. Fluid kinematics
  3. The equations of fluid motion
  4. Dimensional analysis and similarity in fluid mechanics
  5. Bernoulli's theorem and ideal flow theorems
  6. Vortex dynamics
  7. Potential flow and aerofoil theory
  8. Exact viscous flows and pipe flow
  9. Stokes flow, lubrication and thin films
  10. Boundary layers, jets and wakes
  11. Hydrodynamic stability
  12. Convection, mixing and transport in flows
  13. Physics and theory of turbulence
  14. Turbulence modelling and wall-bounded turbulence
  15. Linear water waves
  16. Nonlinear water waves and ocean wave statistics
  17. Shallow water and open-channel flow
  18. Compressible flow, gas dynamics and acoustics
  19. Shock waves, blast waves, detonation and reacting flow
  20. Rarefied gas flow
  21. Rotating and stratified flows
  22. Balanced models and waves in geophysical fluid dynamics
  23. Atmosphere, ocean circulation and ocean tides
  24. Ice, mantle and magma flows
  25. Flow in porous media, groundwater and hydrology
  26. Magnetohydrodynamics and dynamo theory
  27. Multiphase and particle-laden flows
  28. Non-Newtonian and complex fluids
  29. Biological fluid mechanics
  30. Astrophysical fluid dynamics

Electromagnetism and optics

Electromagnetism is the study of electric charges, currents and the electric and magnetic fields that they make, and optics is the study of light. The electric and magnetic fields are vector fields in space and time, and Maxwell's equations fix how charges and currents produce them and how they change. The theory explains electric circuits, motors, radio, radar and optical instruments, and light itself is an electromagnetic wave. Maxwell wrote his equations in the 1860s and predicted electromagnetic waves, and Hertz produced such waves in the laboratory in the late 1880s. This topic collects the electromagnetism and optics pages of math2. Its sub-areas are listed below, in reading order. Potential theory, partial differential equations, relativity, quantum theory and thermodynamics have their own topics.

  1. Foundations of electromagnetism
  2. Electrostatics
  3. Electric and magnetic fields in matter
  4. Magnetostatics
  5. Maxwell's equations and the conservation laws
  6. Potentials and gauge invariance
  7. Covariant formulation of electrodynamics
  8. Electromagnetism in differential forms
  9. Mathematical theory of Maxwell's equations
  10. Charged particles in electromagnetic fields
  11. Electromagnetic waves
  12. Dispersion and absorption
  13. Reflection, refraction and layered media
  14. Radiation and antennas
  15. Transmission lines, waveguides and resonators
  16. Photonic crystals, gratings and periodic media
  17. Scattering of electromagnetic waves
  18. Inverse problems in electromagnetism
  19. Geometric optics and rays
  20. Paraxial optics and optical systems
  21. Interference and coherence
  22. Diffraction
  23. Fourier optics and imaging
  24. Optical beams
  25. Polarization
  26. Crystal optics and anisotropic media
  27. Nonlinear optics
  28. Lasers and classical light-matter models
  29. Metamaterials and transformation optics
  30. Asymptotic and computational electromagnetics

Thermodynamics and statistical mechanics

Thermodynamics and statistical mechanics study the bulk properties of matter and their relation to heat, work and temperature. Thermodynamics gives laws for macroscopic quantities such as energy, entropy and temperature, and statistical mechanics derives these quantities from a probability distribution on the microscopic states of a system. The theory explains the behaviour of gases, liquids, solids and magnets, the phase transitions between them, and the approach of a system to equilibrium. Thermodynamics grew from the work of Carnot, Clausius and Kelvin on heat engines in the nineteenth century, and statistical mechanics started with the kinetic theory of Maxwell and Boltzmann and the ensembles of Gibbs. This topic collects the thermodynamics and statistical mechanics pages of math2. Its sub-areas are listed below, in reading order. Random structures such as percolation and spin glasses, ergodic theory, the partial differential equations of heat and of kinetic theory, and quantum theory have their own topics.

  1. Thermodynamic systems, states and processes
  2. The laws of thermodynamics and their axiomatics
  3. Thermodynamic potentials and response functions
  4. Equations of state and phase equilibria
  5. Chemical thermodynamics, kinetics and combustion
  6. Thermodynamic cycles and heat engines
  7. Irreversible thermodynamics
  8. Heat conduction
  9. Convective heat transfer and heat exchangers
  10. Thermal radiation
  11. Foundations of statistical mechanics and the Gibbs ensembles
  12. The thermodynamic limit and rigorous foundations
  13. Gibbs states on lattices and DLR theory
  14. Cluster expansions and classical fluids
  15. The Ising model
  16. Other lattice spin models
  17. Phase transitions and critical phenomena
  18. Mean-field and Landau theory
  19. The renormalization group in statistical mechanics
  20. Exactly solved lattice models
  21. Quantum statistical mechanics and quantum gases
  22. Quantum lattice models and spin chains
  23. Kinetic theory of gases
  24. Linear response, fluctuations and the thermodynamics of information
  25. Stochastic lattice dynamics and thermalization
  26. Crystals, electrons and phonons
  27. Superconductivity and superfluidity
  28. Polymers, liquid crystals, electrolytes, plasmas and reactors
  29. Computational statistical mechanics

Quantum theory

Quantum theory is the physical theory of matter and radiation at the scale of atoms and below, together with its mathematical formulation. In quantum mechanics a state of a system is a unit vector in a Hilbert space up to a phase factor, an observable is a self-adjoint operator, and the Born rule gives the probabilities of the results of a measurement. The theory explains atomic spectra, chemical bonds, the properties of solids and the elementary particles, and it is the basis of quantum information and quantum computing. Planck introduced the quantum of action in 1900, and Heisenberg, Schrödinger, Born and Dirac gave quantum mechanics its modern form in 1925 and 1926. This topic collects the quantum theory pages of math2. Its sub-areas are listed below, in reading order. The spectral theory of Schrödinger operators, operator algebras, quantum computation, quantum error correction and quantum cryptography have their own topics.

  1. Postulates, states and the Hilbert space formalism
  2. Dynamics, pictures and uncertainty relations
  3. Wells, barriers and tunnelling
  4. The harmonic oscillator and coherent states
  5. The hydrogen atom and atomic structure
  6. Angular momentum and spin
  7. Symmetry in quantum mechanics
  8. Perturbation theory and approximation methods
  9. Semiclassical limits and geometric phases
  10. Identical particles and second quantization
  11. Quantum scattering theory
  12. Quantization, phase space and path integrals
  13. Measurement, tomography and state discrimination
  14. Interpretations and foundations
  15. Bell nonlocality and contextuality
  16. Density operators and entanglement
  17. Quantum channels and open quantum systems
  18. Quantum entropy and quantum Shannon theory
  19. Quantum protocols and no-go theorems
  20. Relativistic quantum mechanics
  21. Free fields and canonical quantum field theory
  22. Axiomatic, algebraic and constructive quantum field theory
  23. Feynman diagrams and renormalization
  24. Quantum gauge theories and the Standard Model
  25. Anomalies, instantons and nonperturbative effects
  26. Conformal, two-dimensional and integrable field theory
  27. Supersymmetry and string theory
  28. Quantum optics and light-matter interaction

Relativity, gravitation and cosmology

Relativity, gravitation and cosmology study space, time and gravity, and the structure and history of the universe. In general relativity spacetime is a four-dimensional Lorentzian manifold, and the Einstein field equations relate its curvature to the energy and momentum of matter. The theory predicts the bending of light, gravitational waves and black holes, it is the frame of modern cosmology, and satellite navigation systems must correct for its effects. Einstein published special relativity in 1905 and general relativity in 1915, and Friedmann and Lemaître found the expanding models of the universe in the 1920s. This topic collects the relativity, gravitation and cosmology pages of math2. Its sub-areas are listed below, in reading order. Differential geometry, the partial differential equations of general relativity, quantum field theory and classical mechanics have their own topics.

  1. Special relativity, spacetime and kinematics
  2. Accelerated observers and paradoxes
  3. Relativistic mechanics
  4. Principles of general relativity
  5. The Einstein field equations and the action principle
  6. Geodesic motion and test bodies
  7. Weak fields and approximation methods
  8. Classical tests and gravitomagnetism
  9. Gravitational lensing
  10. Spherically symmetric exact solutions
  11. Rotating, maximally symmetric and other exact solutions
  12. Black holes, horizons and their structure
  13. Uniqueness, no-hair and stability of black holes
  14. Black hole mechanics, thermodynamics and quantum effects
  15. Spacetime singularities and cosmic censorship
  16. Gravitational waves
  17. The initial value problem and the 3+1 formalism
  18. Mass, energy and asymptotic structure
  19. Spinors, tetrads and the algebraic classification of curvature
  20. Alternative theories of gravity
  21. Higher dimensions, supergravity and strings
  22. Approaches to quantum gravity
  23. Homogeneous cosmological models
  24. Early universe, inflation and the dark sector
  25. Cosmic microwave background and structure formation
  26. Stellar structure and evolution
  27. Compact objects and relativistic stars
  28. Stellar atmospheres, radiative processes and photometry
  29. Star formation and high-energy astrophysics
  30. Galaxies and dark matter halos

Mathematics and culture

Mathematics and culture is the study of mathematics as a part of human culture today. It looks at the links of mathematics with music, the visual arts, architecture, literature and film, and at the way mathematicians work, publish and give credit. Some of these links produce mathematics of their own, such as the theory of musical tuning, the symmetry groups of ornament and the rules of constrained writing. Pythagorean tuning, which builds a scale from the frequency ratios 2 to 1 and 3 to 2, is one of the oldest uses of mathematics in an art. This topic collects the mathematics and culture pages of math2. Its sub-areas are listed below, in reading order. The history of mathematics, the philosophy of mathematics, mathematics education and recreational mathematics have their own topics.

  1. Mathematics in human culture
  2. Tuning and temperament
  3. Mathematical music theory
  4. Rhythm, composition and digital sound
  5. Perspective in art history and practice
  6. Symmetry and ornament
  7. Mathematical art and visualization
  8. Proportion and the golden ratio in art
  9. Mathematics and architecture
  10. Mathematics in literature and theatre
  11. Mathematics in film and television
  12. Popular mathematics
  13. The language and typography of mathematics
  14. The mathematical profession
  15. Societies, institutes and congresses
  16. Publishing and peer review
  17. The structure of the mathematical literature
  18. Collaboration and the collaboration graph
  19. Prizes and recognition
  20. Women and diversity in mathematics
  21. Mathematics, ethics, law and policy

History of mathematics

The history of mathematics studies what people knew of mathematics in the past, who found it, and how it was written, taught and passed on. Its sources are documents such as clay tablets, papyri, manuscripts and printed books, and historians read each source in its own language and context. The history shows where the concepts and notations of present mathematics come from, and it shows that many cultures made mathematics. Eudemus of Rhodes wrote a history of geometry in the fourth century BCE, and Montucla published a large history of mathematics in 1758. This topic collects the history of mathematics pages of math2. Its sub-areas are listed below, in reading order. Mathematics and culture and the philosophy of mathematics have their own topics.

  1. Overview and historiography
  2. Prehistoric and indigenous mathematics
  3. Mesopotamian mathematics
  4. Egyptian mathematics
  5. Classical Greek mathematics
  6. Hellenistic, Roman and late antique mathematics
  7. Chinese mathematics
  8. Indian mathematics
  9. Mathematics in the medieval Islamic world
  10. Byzantine and medieval European mathematics
  11. Mathematics of the Americas
  12. Japanese, Korean and Southeast Asian mathematics
  13. Renaissance mathematics
  14. Seventeenth-century mathematics
  15. Eighteenth-century mathematics
  16. Nineteenth-century mathematics
  17. The foundational crisis
  18. Twentieth-century mathematics
  19. Computing and contemporary mathematics
  20. Famous problems in the history of mathematics
  21. History of mathematical institutions
  22. Women and under-represented groups in the history of mathematics
  23. Transmission of mathematics
  24. History of mathematical notation and language
  25. Histories of algebraic, arithmetic and geometric fields
  26. Histories of analytic and applied fields

Philosophy of mathematics

The philosophy of mathematics studies the nature of mathematical objects, mathematical knowledge and mathematical truth. Its central questions ask whether mathematical objects exist, how we can know facts about them, and why mathematics applies to the physical world. The answers to these questions bear on the foundations of mathematics and on the philosophy of science. Plato and Aristotle already discussed the status of mathematical objects, and the debate between logicism, formalism and intuitionism shaped the field in the early 20th century. This topic collects the philosophy of mathematics pages of math2. Its sub-areas are listed below, in reading order. Reasoning and proof, mathematical logic, set theory, and type theory and constructive mathematics have their own topics.

  1. The field and its main questions
  2. Classical and modern views
  3. Logicism and neo-logicism
  4. Formalism and deductivism
  5. Intuitionism and constructivism as philosophy
  6. Finitism and predicativism
  7. Platonism and realism
  8. Structuralism
  9. Nominalism and fictionalism
  10. Epistemology of mathematics
  11. Indispensability and applicability
  12. Philosophy of the infinite
  13. Philosophy of set theory
  14. Philosophy of logic for mathematics
  15. Truth in mathematics
  16. Philosophy of mathematical practice
  17. Philosophical aesthetics of mathematics
  18. Philosophy of probability

Mathematics education

Mathematics education is the study of the teaching and learning of mathematics. It is both a field of research and the professional practice of teachers, teacher educators and curriculum designers. Its research uses methods from psychology, sociology and mathematics, and its results shape school curricula, textbooks and the education of teachers. The International Commission on Mathematical Instruction was founded in 1908 with Felix Klein as its first president, and the field grew into a research discipline in the second half of the 20th century. This topic collects the mathematics education pages of math2: the theories of learning and of didactics, mathematical cognition and affect, the social dimensions of learning, teaching methods, assessment, curricula and international comparisons, teacher education, university teaching, technology and research methods. The teaching of each content field, such as algebra, geometry or calculus, is in the topic of that field, and problem solving and competitions, recreational mathematics, and mathematics and culture have their own topics.

  1. Mathematics education as a field
  2. History of mathematics education
  3. General theories of learning in mathematics
  4. Theories of mathematics didactics
  5. Mathematical cognition and neuroscience
  6. Affect in mathematics learning
  7. Social, cultural and linguistic dimensions
  8. Understanding and learning trajectories
  9. Teaching methods in mathematics
  10. Problem solving and inquiry in teaching
  11. Mathematical modelling and applications in education
  12. Student errors and misconceptions
  13. Assessment in mathematics education
  14. School mathematics curricula and standards
  15. International comparisons
  16. Knowledge, education and development of mathematics teachers
  17. University mathematics education
  18. Technology in mathematics education
  19. Teaching materials and textbooks
  20. Teaching numerical mathematics, discrete mathematics and computer science
  21. Diverse learners, adult and vocational mathematics education
  22. Education systems and policy
  23. Research methods in mathematics education

Recreational mathematics

Recreational mathematics is mathematics done for pleasure. Its objects are puzzles, games, curiosities and tricks, and each page states a puzzle, gives its solution and proves why the solution works. Many puzzles lead to real mathematics: the knight's tour leads to Hamiltonian paths, and the Rubik's Cube leads to permutation groups. The tradition goes back at least to the puzzle collection attributed to Alcuin of York, and Sam Loyd, Henry Dudeney and Martin Gardner made puzzles popular in the 19th and 20th centuries. This topic collects the recreational mathematics pages of math2. Its sub-areas are listed below, in reading order. Game theory, problem solving and competitions, and mathematics and culture have their own topics.

  1. Overview and history
  2. Logic and deduction puzzles
  3. Weighing and measuring puzzles
  4. Arithmetic puzzles and number tricks
  5. Numbers defined by their digits
  6. Prime curiosities
  7. Recreational sequences
  8. Magic squares
  9. Magic cubes, stars and other figures
  10. Chessboard problems
  11. Sudoku and pencil puzzles
  12. Permutation and sliding puzzles
  13. Assembly, packing and mechanical puzzles
  14. Dissection and geometric puzzles
  15. Origami mathematics
  16. Flexagons and topological recreations
  17. Card tricks and mathematical magic
  18. Mathematics of juggling
  19. Pencil-and-paper games
  20. Mathematics of board, card and dice games
  21. Recreational paradoxes and brain teasers
  22. Mazes and labyrinths
  23. Ciphers and word puzzles as recreation

Problem solving and competitions

Problem solving is the work of finding and proving answers to mathematical questions that the solver has not met before. A problem differs from an exercise: an exercise practises a known method, and a problem asks the solver to find a method. Competitions use such problems to find and train talented students, and many research mathematicians took part in competitions when they were young. Hungary started a national competition for school students in 1894, and the first International Mathematical Olympiad took place in Romania in 1959. This topic collects the problem solving and competitions pages of math2. Its sub-areas are listed below, in reading order. Reasoning and proof, mathematics education and recreational mathematics have their own topics.

  1. Problem solving as a discipline
  2. General contest tactics
  3. Olympiad combinatorics
  4. Olympiad algebra and number theory
  5. Famous competition problems
  6. The International Mathematical Olympiad
  7. International and regional olympiads
  8. National olympiad systems
  9. University and modelling competitions
  10. Formats of school competitions
  11. Olympiad training
  12. Culture and history of competitions
  13. Problem collections and catalogs of open problems

Mathematical software and formalization

Mathematical software and formalization is the study of mathematics done with computers. A proof assistant is a program that checks each step of a formal proof against the rules of a logic. Computers now check long proofs, search large sets of finite cases, compute with symbols, and store large collections of mathematical data. Automated theorem proving began in the 1950s, de Bruijn's Automath system of the late 1960s started the machine checking of formal proofs, and Appel and Haken proved the four colour theorem with a computer in 1976. This topic collects the math2 pages on proof assistants and formal libraries, landmark formalizations, automated theorem proving, SAT and SMT solving, computer-assisted proof, computer algebra, experimental mathematics, mathematical databases, knowledge management, typesetting, and artificial intelligence in mathematics. Type theory and constructive mathematics, mathematical logic, theory of computation, and the mathematics of machine learning have their own topics.

  1. Overview and history
  2. Proof assistants and their design
  3. Formal libraries and library design
  4. Landmark formalizations
  5. Automated theorem proving
  6. SAT and SMT solving
  7. Computer-assisted proof and verification
  8. Foundations of computer algebra
  9. Polynomial gcd and factorization
  10. Symbolic integration and summation
  11. Tools of experimental mathematics
  12. Mathematical databases
  13. Mathematical knowledge management
  14. Mathematical typesetting
  15. Artificial intelligence and mathematics