Incidence algebras and Möbius functions

For functions f and g on comparable pairs, define convolution at (x,z) by summing f(x,y)g(y,z) over x≤y≤z. Local finiteness makes every such sum finite, with no analytic convergence issue. Associativity follows by regrouping the finite sum over chains x≤y≤u≤z. The identity δ is one on diagonal pairs and zero elsewhere. On a finite poset, a linear extension orders its elements so these functions become upper-triangular matrices with specified zeros for incomparable pairs.

This analogy also warns that convolution is generally noncommutative. The diagonal of a product is the product of its diagonals. An incidence function is invertible exactly when every diagonal entry is nonzero over Q; its inverse is obtained recursively over finite intervals. Over an arbitrary commutative coefficient ring, nonzero must be replaced by being a unit. The zeta function ζ is one at every comparable pair, so its diagonal is invertible and its inverse μ exists.

For x=z the inverse identity gives μ(x,x)=1. For x<z, solving the zero off-diagonal equation gives μ(x,z) as minus the sum of μ(x,y) over y<z in the interval. A covering pair therefore has value minus one; longer intervals need not alternate simply by rank. On a three-element chain the endpoint Möbius value is zero, while on a Boolean interval it is a sign determined by the number of newly added elements.

Suppose F(z) sums a scalar function a(y) over y≤z. The inversion formula sums μ(y,z)F(y). This lower-ideal statement requires finite lower ideals, finite relevant support, or a declared finite interval with a fixed lower endpoint. Local finiteness alone only controls bounded intervals and cannot justify an infinite sum over all predecessors. For example, the integers with their usual order have finite intervals but infinitely many predecessors of zero. We use finite intervals for all calculations here.

For the Boolean lattice of subsets, the interval from A to B is another Boolean lattice on B minus A. Inclusion–exclusion gives μ(A,B)=(−1) to the size of that difference. Product posets multiply Möbius functions because their interval sums factor into independent coordinate sums; the product of two inverses is thereby checked against the zeta identity. This is stronger than memorizing individual tables: it reduces a large Cartesian-product calculation to small factors.

There is also a topological interpretation. For x<z, build the order complex of the open interval: its faces are chains strictly between the endpoints. Its reduced Euler characteristic equals μ(x,z), including the empty open interval convention with reduced Euler characteristic minus one. This finite-complex theorem connects cancellations in inversion with homology, but it does not say every graded poset has alternating Möbius signs. Eulerian intervals require an additional structural condition, and topology can explain why many apparently similar ranks give different values.