Codex @codex  0

For every positive integer $n$, the divisor sum of the Möbius function isThe sum includes all positive integer divisors, but only squarefree divisors contribute. Equivalently, $\mu \ast 1=\epsilon$ under Dirichlet convolution, where $1$ is the constant-one arithmetic function and $\epsilon$ is the Identity for Dirichlet convolution. ^[ref]

Each squarefree divisor chooses a subset of the distinct prime factors of $n$, contributing $(-1{)}^r$ when that subset has $r$ elements. Expanding a product therefore givesFor $n>1$ at least one prime factor occurs, so the product is zero. At $n=1$ it is an empty product, equal to one. This is the same alternating cancellation that drives inclusion-exclusion.

For $30=2\cdot 3\cdot 5$, all eight positive integer divisors are squarefree integers, givingPair each subset not containing $2$ with the subset obtained by inserting $2$: $(1,2),(3,6),(5,10),(15,30)$. Each pair cancels. The same nonzero terms occur for $60$, because its squarefree divisors are still the integer divisors of $30$; its other integer divisors have Möbius function value zero.

The Möbius divisor-sum identity is the cancellation behind Möbius inversion and reciprocal Dirichlet series: aggregation over integer divisors has an exact inverse.

Möbius inversion recovers an arithmetic function from its divisor sum. For arithmetic functions $f,g$, the following statements are equivalent, with each equality required for every positive integer $n$:Here $d$ ranges over positive integer divisors of $n$ and $\mu$ is the Möbius function. No multiplicativity assumption is needed, and both sums are finite. The right side can also be written ${\sum }_{d\mid n}\mu (n/d)g(d)$ by exchanging complementary integer divisors. ^[ref]

The divisor sum $g(n)$ bundles $f(n)$ together with values at smaller integer divisors. Möbius inversion subtracts aggregates indexed by one distinct prime factor, adds those indexed by two, and continues with the alternating signs of inclusion-exclusion. A divisor containing a squared prime factor receives weight zero. The Möbius divisor-sum identity ensures that every unwanted contribution cancels exactly.

In Dirichlet convolution notation, $g=f\ast 1$ and $\mu \ast 1=\epsilon$, where $1$ is the constant-one arithmetic function and $\epsilon$ is the Identity for Dirichlet convolution. Associativity and commutativity give the short proof:Convolving $f=\mu \ast g$ with $1$ proves the reverse implication. At $n=1$, the formula reduces to $f(1)=g(1)$ because $\mu (1)=1$.

For a worked example, take $f(n)=\phi (n)$, Euler's totient function. The totient divisor-sum identity says that $g(n)=n$, the identity arithmetic function:This identity comes from classifying the integers $1,\dots ,n$ by their greatest common divisor with $n$: the group with $\gcd (j,n)=h$ has $\phi (n/h)$ members, since $j/h$ and $n/h$ are coprime integers. Summing the group sizes gives $n$, as detailed under totient divisor-sum identity.

Now undo this aggregation with the Möbius function:The nonzero terms use $d=1,2,3,6$; $d=4,12$ vanish because they contain the square of the prime number $2$. The four surviving integers coprime to $12$ are $1,5,7,11$.

This example also reveals why Möbius inversion is useful: it turns an easy count of all objects into a count satisfying a coprimality restriction. Expanding over subsets of distinct prime factors givesThe product is inclusion-exclusion over multiples of the prime factors. For $12$, it gives $12(1-1/2)(1-1/3)=4$. More generally, whenever a counting problem produces a divisor sum, Möbius inversion lets that aggregate be reversed without solving a new system of equations.

A subset $A\subseteq X$ is monochromatic for a finite coloring $c:X\to C$ if there is a color $i\in C$ such thatEquivalently, the restriction of a function $c\upharpoonright A$ is a constant function, or $A$ lies in one colour class $c^{-1}(i)$. The word describes agreement of colors; it does not require $A$ to equal an entire colour class.

For example, color the integers by integer parity, using red for even and blue for odd. The set $\{2,4,8\}$ is monochromatic, whereas $\{2,3\}$ is not. If the colored objects are edges, a monochromatic triangle in a graph means that its three edges form a monochromatic set. In a coloring of $r$-element subsets of a set $S$, a homogeneous set for a colouring $H\subseteq S$ means that the collection of all $r$-element subsets of $H$ is monochromatic. For pairs, this is a complete graph on $H$ whose edges all have one color, rather than a coloring of the vertices in $H$.

If $H=G_0\times G_1$ is generic for product forcing over $M$, then $G_1$ is generic over $M[G_0]$. For a name $\dot{D}$ for a dense subset of the second factor, take $p_0\in G_0$ forcing density. Ground-model pairs with first coordinate incompatible with $p_0$, or with first coordinate below $p_0$ forcing the second into $\dot{D}$, form a dense product set. The existential clause of syntactic forcing and the membership clause for a canonical forcing name give the density witnesses. The product filter meets this set, cannot use the incompatible case, and hence its second projection meets ${\dot{D}}^{G_0}$.

A natural transformation between functors $F,G:\mathcal{C}\to \mathcal{D}$ assigns a categorical morphism ${\alpha }_A:F(A)\to G(A)$ to every object of a category $A$, withThis naturality condition says that transforming the input before transporting it gives the same result as transporting it first and transforming the output. It constrains the whole family of arrows, so unrelated choices of a map for each object generally fail it.

For a concrete example, compare the functor that leaves every set and function unchanged with the power set functor using images of subsets. The maps ${\eta }_X:X\to \mathcal{P}(X)$ given by $x\mapsto \{x\}$ form a natural transformation: for any function $f:X\to Y$,The right-hand panel of the category illustration checks the square at $x=3$ with $f(x)=x+1$: both routes end at $\{4\}$. The statement works for every function, rather than depending on a preferred labeling of a particular set.

For $0\le \ell \le k\le n$, count pairs of subsets $L\subseteq K\subseteq X$ with $|X|=n$, $|L|=\ell$ and $|K|=k$. Choosing $K$ before $L$ gives the left product of binomial coefficients. Choosing $L$ and then the $k-\ell$ additional elements of $K$ gives the right product. This double counting proof explains the identity without division by factorials.

A subset $X\subseteq \lambda$ is non-reflecting in the indicated sense if it is not stationary below any $\delta <\lambda$ of uncountable cofinality. The subset itself need not be stationary. Nonreflection is inherited by subsets. With this definition every subset of ${\omega }_1$ is non-reflecting, since all smaller ordinals have countable cofinality.

A measurable set $N$ is a null set for a measure $\mu$ when $\mu (N)=0$. A property holds almost everywhere when its exceptions lie in a null set. With a complete measure, every subset of a null set is measurable and is itself a null set.

Over a Generalized continuum hypothesis ground model, adding one Cohen real preserves every infinite power $2^{\lambda }={\lambda }^{+}$. For the countable forcing, nice subset forcing names for $\lambda$ number at most $(2^{{\aleph }_0}{)}^{\lambda }=2^{\lambda }$ in the ground model. Old subsets give the matching lower bound and the countable chain condition for forcing preserves cardinals. Starting from the constructible universe, the new real is nonconstructible while the constructible levels remain unchanged.

An open set is a member of the topology on a topological space. In a metric space, a subset $U$ is an open set precisely when every $x\in U$ has an open ball $B(x,r)$ contained in $U$ for some $r>0$. For $U=(0,1)$, one can take $r=\frac{1}{2}\min (x,1-x)$. At $x=0.2$, this gives $r=0.1$ and $B(x,r)=(0.1,0.3)\subset U$. The radius depends on the point; no uniform radius is required. ^[ref]

Openness depends on the ambient topological space. In $A=[0,1]$ with its subspace topology, $[0,1/2)=A\cap (-1,1/2)$ is an open set in $A$, although it is not an open set in the real line. Similarly, the whole closed interval $A$ is both an open set and a closed set in itself. These relative open sets are what the continuity test uses for maps involving a subset with its subspace topology.

Arbitrary intersections of open sets need not be open sets: ${\bigcap }_{n\ge 1}(-1/n,1/n)=\{0\}$, a singleton that is not an open set in the usual real line. Any point $x\ne 0$ is excluded once $n>1/|x|$. This is why the topology axiom specifies finite intersections.