Möbius function

Möbius function
Name	Möbius function
Domain	Positive integers
Codomain	{-1, 0, 1}
Introduced	1884
Introduced by	August Möbius

Möbius function is a multiplicative arithmetic function defined on positive integers that takes values in {-1, 0, 1} and plays a central role in multiplicative number theory, inversion formulas, and combinatorial enumeration. It is closely connected to prime factorization, Dirichlet convolution, and summatory functions studied by mathematicians associated with institutions such as University of Leipzig, Cambridge University, and Princeton University. The function appears in results related to the Riemann zeta function, Legendre, Gauss, and modern research involving Andrew Wiles, Terence Tao, Enrico Bombieri, and Manjul Bhargava.

Definition and basic properties

The function is defined for a positive integer n by μ(n)=1 if n is a squarefree product of an even number of distinct primes, μ(n)=-1 if n is a squarefree product of an odd number of distinct primes, and μ(n)=0 if n is divisible by the square of a prime; this ties the function to primes studied by Euclid, Euler, Sophie Germain, Évariste Galois, and Dirichlet. It is multiplicative: μ(mn)=μ(m)μ(n) whenever gcd(m,n)=1, a property used in proofs by scholars at École Normale Supérieure and University of Göttingen in the 19th century. Basic identities include sum_{d|n} μ(d)=1 if n=1 and 0 otherwise, an identity employed in analytic investigations by Bernhard Riemann and extended in work by Atle Selberg and Harald Bohr.

Dirichlet convolution and Möbius inversion

Under Dirichlet convolution, μ is the inverse of the constant-one function 1; more precisely, 1 * μ = ε where ε is the identity at 1. This inversion principle—used in combinatorial number theory in papers from Institut des Hautes Études Scientifiques, Massachusetts Institute of Technology, and University of Chicago—allows recovery of arithmetic functions from their summatory functions. The Möbius inversion formula converts relations like f(n)=sum_{d|n} g(d) to g(n)=sum_{d|n} μ(d) f(n/d), a tool applied in analyses by Srinivasa Ramanujan, G. H. Hardy, John von Neumann, and researchers affiliated with Columbia University and Yale University.

Values, distribution, and average order

Values μ(n)=±1 occur for squarefree integers; zeros correspond to integers divisible by a squared prime such as those investigated by Kummer and Leopold Kronecker. The summatory function M(x)=sum_{n≤x} μ(n) is central to conjectures linked to the Riemann Hypothesis, as explored by H. M. Edwards, A. M. Odlyzko, G. H. Hardy, Niels Henrik Abel, and scholars at Princeton University and University of Cambridge. Results on average order and cancellations in M(x) involve techniques developed by Atle Selberg, Paul Erdős, Alfred Rényi, Pál Erdős, Heini Halberstam, and teams at University of Toronto and University of Illinois Urbana–Champaign. Conditional bounds on M(x) relate to zero-free regions of the Riemann zeta function and estimates by Vinogradov, Korobov, Enrico Bombieri, and Alan Turing.

Relations to prime factorization and number-theoretic functions

The function is intimately connected to prime factorization: μ(p)=-1 for primes p such as those in sequences studied by Sophie Germain and Paul Erdős, μ(pq)=1 for distinct primes p,q, and μ(pk)=0 for k≥2. It interacts with multiplicative functions like the Liouville function, the Euler totient function, and the Mertens function; these interactions appear in analytic work by Leonhard Euler, Carl Friedrich Gauss, Dirichlet, Jacques Hadamard, and later by Pál Turán and Estermann. Möbius transforms connect to generating functions including Dirichlet series: sum μ(n)/n^s = 1/ζ(s) for Re(s)>1, a relation leveraged in research by Bernhard Riemann, Dirichlet, Dedekind, Hecke, and the Institute for Advanced Study.

Generalizations and variants

Generalizations include the Möbius function for posets, the incidence algebra Möbius functions used by Gian-Carlo Rota at MIT and Princeton University, and versions for algebraic number fields studied by Richard Dedekind, Heinrich Weber, Emil Artin, and Jean-Pierre Serre. Variants include the k-fold Möbius function, multiplicative twists with characters from Émile Picard and Richard Dedekind, and extensions to function fields explored by André Weil, Alexander Grothendieck, Pierre Deligne, and teams at Institut Fourier. Generalized inversion principles are applied in algebraic combinatorics by William Tutte, Philippe Flajolet, and researchers at CNRS.

Applications in combinatorics and topology

In combinatorics, Möbius inversion on posets underlies enumerative results and the theory of incidence algebras developed by Gian-Carlo Rota, with applications in counting problems by Richard Stanley, László Lovász, Paul Erdős, and scholars at Princeton University and Bell Labs. In topology, the Möbius function appears in Lefschetz-type fixed-point formulae and Euler characteristic computations in work by Henri Poincaré, Solomon Lefschetz, Emmy Noether, John Milnor, and William Thurston; algebraic topology contexts include sheaf-theoretic and homological methods used at Institute for Advanced Study and Mathematical Sciences Research Institute. It also informs inclusion–exclusion principles applied in algorithmic complexity studies by Donald Knuth, Edsger Dijkstra, Leslie Valiant, and groups at Bell Labs and Carnegie Mellon University.

Category:Number theory