Bourbaki

Exercise 14, § 6

Algebra, IV, p. 101

Let LL be a finite ordered set and AA a commutative ring. In the ring MM of square matrices over AA with index set LL, the set of matrices m=(muv)m = (m_{uv}) such that muu=0m_{uu} = 0 except when u≤vu \leq v is a subring BB.

a) An element m=(muv)m = (m_{uv}) of BB is invertible in BB if and only if muum_{uu} is invertible in AA for all u∈Lu \in L.

b) Suppose henceforth that A=ZA = \mathbf{Z}. Let ζ\zeta be the element of BB defined by ζ(u,v)=1\zeta(u, v) = 1 if u≤vu \leq v and ζ(u,v)=0\zeta(u, v) = 0 otherwise. Show that SS has an inverse μ\mu (also written μL\mu_L) in BB (called the Mobius function of LL). Let ff and gg be two mappings of LL into Z\mathbf{Z}. Show that the relations

f(x)=∑y≥xg(y)for all x∈L f(x) = \sum_{y \geq x} g(y) \quad \text{for all } x \in L
and
g(x)=∑y≥xμ(x,y)f(y)for all x∈L g(x) = \sum_{y \geq x} \mu(x, y) f(y) \quad \text{for all } x \in L
are equivalent.

c) Assume that LL is the product of a finite family of ordered sets L1,…,LrL_1, \ldots, L_r. Show that

μL(x,y)=∏i=1rμLi(xi,yi) \mu_L(x, y) = \prod_{i=1}^r \mu_{L_i}(x_i, y_i)
for x=(x1,…,xr)x = (x_1, \ldots, x_r) and y=(y1,…,yr)y = (y_1, \ldots, y_r) such that x≤yx \leq y.

d) Let m≥1m \geq 1 be an integer and let DD be the set of divisors of mm, equipped with the order relation « xx divides yy ». Show that μD(x,y)=(−1)s\mu_D(x, y) = (-1)^s where ss is the cardinal of the set of prime numbers pp dividing y/xy/x when y/xy/x is not divisible by the square of an integer, and μD(x,y)=0\mu_D(x, y) = 0 otherwise. (By applying c) reduce to the case where mm is a power of a prime number.)

e) Suppose that the ordered set LL is lattice-ordered. Let a,b,ca, b, c be distinct elements of LL such that a≤b≤ca \leq b \leq c, and let Φ\Phi be the set of x∈Lx \in L such that a≤xa \leq x and sup⁡(x,b)=c\sup(x, b) = c, and Ψ\Psi the corresponding set defined by y≤cy \leq c and inf⁡(y,b)=a\inf(y, b) = a. Show that we have the relation

∑x∈Φμ(a,x)=∑y∈Ψμ(y,c)=0. \sum_{x \in \Phi} \mu(a, x) = \sum_{y \in \Psi} \mu(y, c) = 0.

f) Let TT be a finite set and R(T)\mathscr{R}(T) the set of equivalence relations on TT, ordered by the relation « RR is finer than SS », written R≤SR \leq S. Show that R(T)\mathscr{R}(T) is lattice-ordered. Let R,SR, S in R\mathscr{R} be such that R≤SR \leq S; let U1,…,UkU_1, \ldots, U_k be the equivalence classes under SS and for 1≤i≤k1 \leq i \leq k, let αi\alpha_i be the number of equivalence classes under RR contained in UiU_i. Show that

μR(T)(R,S)=∏i=1k(−1)αi−1(ai−1)! \mu_{\mathscr{R}(T)}(R, S) = \prod_{i=1}^k (-1)^{\alpha_i - 1} (a_i - 1)!
(if AiA_i is the set of equivalence classes under RR contained in UiU_i, observe that the interval (R,S)(R, S) of R(T)\mathscr{R}(T) is isomorphic to R(A1)×…×R(Ar)\mathscr{R}(A_1) \times \ldots \times \mathscr{R}(A_r), apply c) and reduce to the case where RR is the least element of R(T)\mathscr{R}(T) and SS the greatest ; treat this last case by using e)).

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.