Bourbaki

Exercise 8, § 9

Algebra, I, 175

Bourbaki marks this one as harder than the rest.

A ring A is called a Boolean ring if each of its elements is idempotent (in other words, if x2=xx^2 = x for all x∈Ax \in A). (a) In the set P(E)\mathscr{P}(E) of subsets of a set E, show that a Boolean ring structure is defined by setting AB=A∩BAB = A \cap B and A+B=(A∩∁B)∪(B∩∁A)A + B = (A \cap \complement B) \cup (B \cap \complement A). This ring is isomorphic to the ring KEK^E of mappings of E into the ring K=Z/(2)K = \mathbf{Z}/(2) of integers modulo 2 (consider for each subset X⊂EX \subset E its "characteristic function" ϕX\phi_X such that ϕX(x)=1\phi_X(x) = 1 if x∈Xx \in X, ϕX(x)=0\phi_X(x) = 0 if x∉Xx \notin X). (b) Every Boolean ring A is commutative and such that x+x=0x + x = 0 for x∈Ax \in A (write x+xx + x as an idempotent and then x+yx + y as an idempotent). (c) If a Boolean ring A contains no divisor of 0, it is reduced to 0 or is isomorphic to Z/(2)\mathbf{Z}/(2) (if xx and yy are any two elements of A, show that xy(x+y)=0xy(x + y) = 0). Deduce that in a Boolean ring every prime ideal is maximal. (d) In a Boolean ring A, every ideal a≠Aa \neq A is the intersection of the prime ideals containing a (apply Exercise 7(c)). Deduce that every irreducible ideal is maximal (in other words, that the notions of irreducible ideal, prime ideal and maximal ideal coincide in a Boolean ring).

(e) Show that every Boolean ring is isomorphic to a subring of a product ring KEK^E, where K=Z/(2)K = \mathbf{Z}/(2) (use (d)).

(f) If pip_i (1≤i≤n1 \leq i \leq n) are nn distinct maximal ideals in a Boolean ring AA and a=⋂1≤i≤npia = \bigcap_{1 \leq i \leq n} p_i, show that the quotient ring A/aA/a is isomorphic to the product ring KnK^n. Deduce that every finite Boolean ring is of the form KnK^n.

(g) In a Boolean ring AA, the relation xy=xxy = x is an order relation; if it is denoted by x≤yx \leq y, show that with this relation AA is a distributive lattice (Set Theory, III, § 1, Exercise 16), has a least element α\alpha and that, for every ordered pair (x,y)(x, y) of elements such that x≤yx \leq y, there exists an element d(x,y)d(x, y) such that inf⁡(x,d(x,y))=α\inf(x, d(x, y)) = \alpha, sup⁡(x,d(x,y))=y\sup(x, d(x, y)) = y. Conversely, if an ordered set AA has these three properties, show that the laws of composition xy=inf⁡(x,y)xy = \inf(x, y) and x+y=d(sup⁡(x,y),inf⁡(x,y))x + y = d(\sup(x, y), \inf(x, y)) define a Boolean ring structure on AA.

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.