möbius functions

References

Summary

Definitions

Incidence coalgebra of a poset

Let L be a locally finite poset. We define a vector space C(L), generated by all of the intervals in L. The incidence coalgebra is C(L) with the comultiplication

Δ([x,z]) = ∑y ∈ [x,z][x,y] ⊗ [y,z] and counit ε([x,x]) = 1 ε([x,y]) = 0

Convolution algebra

The convolution algebra L(C)* has as elements linear functionals, which multiply as

(ϕ*ψ)[x,z] = ∑y ∈ [x,z]ϕ[x,y]ψ[y,z].

Zeta function

The zeta function ζ ∈ C(L)* is defined as the constant function on all intervals ζ[x,y] = 1

Mobius function

The möbius function μ ∈ C(L)* is the multiplicative inverse of the zeta function μ * ζ = ζ * μ = ε

So $$ \varepsilon[x,y] = \sum_{y \in [x,z]} \mu[x,y] = \begin{cases} 1, \quad x = y \\ 0, \quad x < y \end{cases} $$

Möbius function

Let L be a lattice. The möbius function μ : L × L → ℤ is defind recursively by

μ(x,x) = 1 μ(x,y) =  − ∑x ≤ z < yμ(x,z)

Theorems

Counting chains in an interval

(ζ−ε)n[x,y] is the number of chains of length n in [x,y].

Proof

(ζ−ε)n[x,y] = ∑w ∈ [x,y]

Distributive lattices

Möbius inversion

Product rule

Kronecker delta

Rota's cross-cut theorems

Möbius algebras

Examples