Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Möbius inversion formula

Description

This lecture covers the Möbius inversion formula, defining the Möbius function and presenting a lemma for its proof. It also introduces the Möbius inversion theorem, providing a detailed proof and explaining the change of variables in summation.

Official source

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Related concepts (27)

Möbius function

The Möbius function μ(n) is a multiplicative function in number theory introduced by the German mathematician August Ferdinand Möbius (also transliterated Moebius) in 1832. It is ubiquitous in elementary and analytic number theory and most often appears as part of its namesake the Möbius inversion formula. Following work of Gian-Carlo Rota in the 1960s, generalizations of the Möbius function were introduced into combinatorics, and are similarly denoted μ(x). For any positive integer n, define μ(n) as the sum of the primitive nth roots of unity.

Möbius inversion formula

In mathematics, the classic Möbius inversion formula is a relation between pairs of arithmetic functions, each defined from the other by sums over divisors. It was introduced into number theory in 1832 by August Ferdinand Möbius. A large generalization of this formula applies to summation over an arbitrary locally finite partially ordered set, with Möbius' classical formula applying to the set of the natural numbers ordered by divisibility: see incidence algebra.

Arithmetic function

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n". An example of an arithmetic function is the divisor function whose value at a positive integer n is equal to the number of divisors of n.

Incidence algebra

In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory. A locally finite poset is one in which every closed interval [a, b] = {x : a ≤ x ≤ b} is finite.

Möbius transformation

In geometry and complex analysis, a Möbius transformation of the complex plane is a rational function of the form of one complex variable z; here the coefficients a, b, c, d are complex numbers satisfying ad − bc ≠ 0. Geometrically, a Möbius transformation can be obtained by first performing stereographic projection from the plane to the unit two-sphere, rotating and moving the sphere to a new location and orientation in space, and then performing stereographic projection (from the new position of the sphere) to the plane.

Related lectures (30)

Correlations of the Liouville function

Explores correlations of the Liouville function along deterministic and independent sequences, covering key concepts and theorems.

Number Theory: GCD and LCM

Covers GCD, LCM, and the Euclidean algorithm for efficient computation.

Cyclic Sequences: Counting and Equivalence

Explores linear and cyclic sequences, counting methods, and Mobius inversion formula.

Primes and Coprime

Explores prime numbers, coprime integers, and their properties in number theory.

Möbius inversion: posets

Covers the Möbius inversion for posets, defining partially ordered sets and explaining the incidence algebra.

Related concepts (27)

Möbius function

Möbius inversion formula

Arithmetic function

Incidence algebra

Möbius transformation