Algebra, IV, p. 101
Let L be a finite ordered set and A a commutative ring. In the ring M of square matrices over A with index set L, the set of matrices m=(muv) such that muu=0 except when u≤v is a subring B.
a) An element m=(muv) of B is invertible in B if and only if muu is invertible in A for all u∈L.
b) Suppose henceforth that A=Z. Let ζ be the element of B defined by ζ(u,v)=1 if u≤v and ζ(u,v)=0 otherwise. Show that S has an inverse μ (also written μL) in B (called the Mobius function of L). Let f and g be two mappings of L into Z. Show that the relations
f(x)=y≥x∑g(y)for all x∈L and
g(x)=y≥x∑μ(x,y)f(y)for all x∈L are equivalent.
c) Assume that L is the product of a finite family of ordered sets L1,…,Lr. Show that
μL(x,y)=i=1∏rμLi(xi,yi) for
x=(x1,…,xr) and
y=(y1,…,yr) such that
x≤y.
d) Let m≥1 be an integer and let D be the set of divisors of m, equipped with the order relation « x divides y ». Show that μD(x,y)=(−1)s where s is the cardinal of the set of prime numbers p dividing y/x when y/x is not divisible by the square of an integer, and μD(x,y)=0 otherwise. (By applying c) reduce to the case where m is a power of a prime number.)
e) Suppose that the ordered set L is lattice-ordered. Let a,b,c be distinct elements of L such that a≤b≤c, and let Φ be the set of x∈L such that a≤x and sup(x,b)=c, and Ψ the corresponding set defined by y≤c and inf(y,b)=a. Show that we have the relation
x∈Φ∑μ(a,x)=y∈Ψ∑μ(y,c)=0.
f) Let T be a finite set and R(T) the set of equivalence relations on T, ordered by the relation « R is finer than S », written R≤S. Show that R(T) is lattice-ordered. Let R,S in R be such that R≤S; let U1,…,Uk be the equivalence classes under S and for 1≤i≤k, let αi be the number of equivalence classes under R contained in Ui. Show that
μR(T)(R,S)=i=1∏k(−1)αi−1(ai−1)! (if
Ai is the set of equivalence classes under
R contained in
Ui, observe that the interval
(R,S) of
R(T) is isomorphic to
R(A1)×…×R(Ar), apply c) and reduce to the case where
R is the least element of
R(T) and
S the greatest ; treat this last case by using e)).