MEASURE THEORY Volume 3
D.H.Fremlin
By the same author: Topological Riesz Spaces and Measure Theory, Cambridge University Press, 1974. Consequences of Martin’s Axiom, Cambridge University Press, 1982. Companions to the present volume: Measure Theory, vol. 1, Torres Fremlin, 2000. Measure Theory, vol. 2, Torres Fremlin, 2001.
First printing May 2002
MEASURE THEORY Volume 3 Measure Algebras
D.H.Fremlin Reader in Mathematics, University of Essex
Dedicated by the Author to the Publisher
This book may be ordered from the publisher at the address below. For price and means of payment see the author’s Web page http://www.essex.ac.uk/maths/staff/fremlin/mtsales.htm, or enquire from
[email protected].
First published in 2002 by Torres Fremlin, 25 Ireton Road, Colchester CO3 3AT, England c D.H.Fremlin 2002 ° The right of D.H.Fremlin to be identified as author of this work has been asserted in accordance with the Copyright, Designs and Patents Act 1988. This work is issued under the terms of the Design Science License as published in http://dsl.org/copyleft/dsl.txt. For the source files see http://www.essex. ac.uk/maths/staff/fremlin/mt3.2002/readme.txt. Library of Congress classification QA312.F72 AMS 2000 classification 28A99 ISBN 0-9538129-3-6 Typeset by AMS-TEX Printed in England by Biddles Short Run Books, King’s Lynn
5
Contents General Introduction Introduction to Volume 3
10 11
Chapter 31: Boolean algebras Introduction 311 Boolean algebras
13 13
Boolean rings and algebras; ideals and ring homomorphisms to Z2 ; Stone’s theorem; the operations ∪ , ∩ , 4 , \ and the relation ⊆ ; topology of the Stone space; Boolean algebras as complemented distributive lattices.
312 Homomorphisms
21
Subalgebras; ideals; Boolean homomorphisms; the ordering determines the ring structure; quotient algebras; extension of homomorphisms; homomorphisms and Stone spaces.
313 Order-continuity
30
General distributive laws; order-closed sets; order-closures; Monotone Class Theorem; order-preserving functions; order-continuity; order-dense sets; order-continuous Boolean homomorphisms; regularly embedded subalgebras.
314 Order-completeness
40
Dedekind completeness and σ-completeness; quotients, subalgebras, principal ideals; order-continuous homomorphisms; extension of homomorphisms; Loomis-Sikorski representation of a σ-complete algebra as a quotient of a σ-algebra of sets; regular open algebras; Stone spaces; Dedekind completion of a Boolean algebra.
315 Products and free products
51
Simple product of Boolean algebras; free product of Boolean algebras; algebras of sets and their quotients.
316 Further topics
59
The countable chain condition; weak (σ, ∞)-distributivity; Stone spaces; atomic and atomless Boolean algebras.
Chapter 32: Measure algebras Introduction 321 Measure algebras
68 68
Measure algebras; elementary properties; the measure algebra of a measure space; Stone spaces.
322 Taxonomy of measure algebras
72
Totally finite, σ-finite, semi-finite and localizable measure algebras; relation to corresponding types of measure space; completions and c.l.d. versions of measures; semi-finite measure algebras are weakly (σ, ∞)-distributive; subspace measures; simple products of measure algebras; Stone spaces of localizable measure algebras; localizations of semi-finite measure algebras.
323 The topology of a measure algebra
82
Defining a topology and uniformity on a measure algebra; continuity of algebraic operations; order-closed sets; Hausdorff and metrizable topologies, complete uniformities; closed subalgebras.
324 Homomorphisms
88
Homomorphisms induced by measurable functions; order-continuous and continuous homomorphisms; the topology of a semi-finite measure algebra is determined by the algebraic structure; measure-preserving homomorphisms.
325 Free products and product measures
95
The measure algebra of a product measure; the localizable measure algebra free product of two semi-finite measure algebras; the measure algebra of a product of probability measures; the probability algebra free product of probability algebras; factorizing through subproducts.
326 Additive functionals on Boolean algebras
104
Additive, countably additive and completely additive functionals; Jordan decomposition; Hahn decomposition.
327 Additive functionals on measure algebras Absolutely continuous and continuous additive functionals; Radon-Nikod´ ym theorem; the standard extension of a continuous additive functional on a closed subalgebra.
116
6
Chapter 33: Maharam’s theorem Introduction 331 Classification of homogeneous measure algebras
123 123
Relatively atomless algebras; one-step extension of measure-preserving homomorphisms; Maharam type of a measure algebra; Maharam-type-homogeneous probability algebras of the same Maharam type are isomorphic; the measure algebra of {0, 1}κ is homogeneous.
332 Classification of localizable measure algebras
132
Any localizable measure algebra is isomorphic to a simple product of homogeneous totally finite algebras; exact description of isomorphism types; closed subalgebras.
333 Closed subalgebras
142
Relative Maharam types; extension of measure-preserving Boolean homomorphisms; complete classification of closed subalgebras of probability algebras as triples (A, µ ¯, C).
334 Products
158
Maharam types of product measures.
Chapter 34: Liftings Introduction 341 The lifting theorem
162 162
Liftings and lower densities; strictly localizable spaces have lower densities; construction of a lifting from a density; complete strictly localizable spaces have liftings; liftings and Stone spaces.
342 Compact measure spaces
174
Inner regular measures; compact classes; compact and locally compact measures; perfect measures.
343 Realization of homomorphisms
182
Representing homomorphisms between measure algebras by functions; possible when target measure space is locally compact; countably separated measures and uniqueness of representing functions; the split interval; perfect measures.
344 Realization of automorphisms
190
Simultaneously representing countable groups of automorphisms of measure algebras by functions – countably separated measure spaces, measures on {0, 1}I ; characterization of Lebesgue measure as a measure space; strong homogeneity of usual measure on {0, 1}I .
345 Translation-invariant liftings
200
Translation-invariant liftings on Rr and {0, 1}I ; there is no t.-i. Borel lifting on R.
346 Consistent liftings
208
Liftings of product measures which respect the product structure; translation-invariant liftings on {0, 1}I ; products of Maharam-type-homogeneous probability spaces; lower densities respecting product structures; consistent liftings; the Stone space of Lebesgue measure.
Chapter 35: Riesz spaces Introduction 351 Partially ordered linear spaces
219 219
Partially ordered linear spaces; positive cones; suprema and infima; positive linear operators; ordercontinuous linear operators; Riesz homomorphisms; quotient spaces; reduced powers; representation of p.o.l.ss as subspaces of reduced powers of R; Archimedean spaces.
352 Riesz spaces
226
Riesz spaces; identities; general distributive laws; Riesz homomorphisms; Riesz subspaces; order-dense subspaces and order-continuous operators; bands; the algebra of complemented bands; the algebra of projection bands; principal bands; f -algebras.
353 Archimedean and Dedekind complete Riesz spaces
237
Order-dense subspaces; bands; Dedekind (σ)-complete spaces; order-closed Riesz subspaces; order units; f -algebras.
354 Banach lattices
246
Riesz norms; Fatou norms; the Levi property; order-continuous norms; order-unit norms; M -spaces; are isomorphic to C(X) for compact Hausdorff X; L-spaces; uniform integrability in L-spaces.
355 Spaces of linear operators Order-bounded linear operators; the space L∼ (U ; V ); order-continuous operators; extension of ordercontinuous operators; the space L× (U ; V ); order-continuous norms.
255
7
356 Dual spaces
264
The spaces U ∼ , U × , U ∗ ; biduals, embeddings U →V × where V ⊆U ∼ ; perfect Riesz spaces; L- and M -spaces; uniformly integrable sets in the dual of an M -space; relative weak compactness in L-spaces.
Chapter 36: Function spaces Introduction 361 S
275 276
Additive functions on Boolean rings; the space S(A); universal mapping theorems for linear operators on S; the map Tπ : S(A)→S(B) induced by a ring homomorphism π : A → B; projection bands in S(A); identifying S(A) when A is a quotient of an algebra of sets.
362 S ∼
287
Bounded additive functionals on A identified with order-bounded linear functionals on S(A); the Lspace S ∼ and its bands; countably additive, completely additive, absolutely continuous and continuous functionals; uniform integrability in S ∼ .
363 L∞
298
The space L∞ (A), as an M -space and f -algebra; universal mapping theorems for linear operators on L∞ ; Tπ : L∞ (A)→L∞ (B); representing L∞ when A is a quotient of an algebra of sets; integrals with respect to finitely additive functionals; projection bands in L∞ ; (L∞ )∼ and its bands; Dedekind completeness of A and L∞ ; representing σ-complete M -spaces; the generalized Hahn-Banach theorem; the Banach-Ulam problem.
364 L0
314
The space L0 (A); representing L0 when A is a quotient of a σ-algebra of sets; algebraic operations on L0 ; action of Borel measurable functions on L0 ; identifying L0 (A) with L0 (µ) when A is a measure algebra; embedding S and L∞ in L0 ; suprema and infima in L0 ; Dedekind completeness in A and L0 ; multiplication in L0 ; projection bands; Tπ : L0 (A)→L0 (B); simple products; *regular open algebras; *the space C ∞ (X).
365 L1
335
366 Lp
351
R R The space L1 (A, µ ¯); identification with L1 (µ); a u; the Radon-Nikod´ ym theorem again; w×Tπ u d¯ ν= R u d¯ µ; the duality between L1 and L∞ ; additive functions on A and linear operators on L1 ; Tπ : L1 (A, µ ¯)→L1 (B, ν¯) and Pπ : L1 (B, ν¯)→L1 (A, µ ¯); conditional expectations; bands in L1 ; varying µ ¯. The spaces Lp (A, µ ¯); identification with Lp (µ); Lq as the dual of Lp ; the spaces M 0 and M 1,0 ; Tπ : M 0 (A, µ ¯)→M 0 (B, ν¯) and Pπ : M 1,0 (B, ν¯)→M 1,0 (A, µ ¯); conditional expectations; the case p = 2.
367 Convergence in measure
360
Order*-convergence of sequences in lattices; in Riesz spaces; in Banach lattices; in quotients of spaces of measurable functions; in C(X); Lebesgue’s Dominated Convergence Theorem and Doob’s Martingale Theorem; convergence in measure in L0 (A); and pointwise convergence; defined by the Riesz space structure; positive linear operators on L0 ; convergence in measure and the canonical projection (L1 )∗∗ →L1 .
368 Embedding Riesz spaces in L0
375
Extension of order-continuous Riesz homomorphisms into L0 ; representation of Archimedean Riesz spaces as subspaces of L0 ; Dedekind completion of Riesz spaces; characterizing L0 spaces as Riesz spaces; weakly (σ, ∞)-distributive Riesz spaces.
369 Banach function spaces
386
Riesz spaces separated by their order-continuous duals; representing U × when U ⊆L0 ; Kakutani’s repre0 sentation of L-spaces as L1 spaces; extended Fatou norms; associate norms; Lτ ∼ = (Lτ )× ; Fatou norms ∞,1 1,∞ τ τ 1 2 and convergence in measure; M and M , k k∞,1 and k k1,∞ ; L + L .
Chapter 37: Linear operators between function spaces Introduction 371 The Chacon-Krengel theorem
402 402 (0)
L∼ (U ; V ) = L× (U ; V ) = B(U ; V ) for L-spaces U and V ; the class Tµ,¯ ¯ ν of k k1 -decreasing, k k∞ -decreasing linear operators from M 1,0 (A, µ ¯) to M 1,0 (B, ν¯).
372 The ergodic theorem
407 (0)
The Maximal Ergodic Theorem and the Ergodic Theorem for operators in Tµ, ¯ µ ¯ ; for inverse-measurepreserving functions φ : X→X; limit operators as conditional expectations; applications to continued fractions; mixing and ergodic transformations.
8
373 Decreasing rearrangements
R R The classes T , T × ; the space M 0,∞ ; decreasing rearrangements u∗ ; ku∗ kp = kukp ; |T u×v| ≤ u∗ ×v ∗ if T ∈ T ; the very weak operator topology and compactness of T ; v is expressible as T u, where T ∈ T , R R R R (0) iff 0t v ∗ ≤ 0t u∗ for every t; finding T such that T u×v = u∗ ×v ∗ ; the adjoint operator from Tµ,¯ ¯ ν to
422
(0)
Tν¯,µ¯ .
374 Rearrangement-invariant spaces
440
T -invariant subspaces of M 1,∞ , and T -invariant extended Fatou norms; relating T -invariant norms on different spaces; rearrangement-invariant sets and norms; when rearrangement-invariance implies T -invariance.
375 Kwapien’s theorem
451
Linear operators on L0 spaces; if B is measurable, a positive linear operator from L0 (A) to L0 (B) can be assembled from Riesz homomorphisms.
376 Integral operators
457
Kernel operators; free products of measure algebras and tensor products of L0 spaces; tensor products of L1 spaces; abstract integral operators (i) as a band in L× (U ; V ) (ii) represented by kernels belonging b to L0 (A⊗B) (iii) as operators converting weakly convergent sequences into order*-convergent sequences; operators into M -spaces or out of L-spaces; disintegrations.
Chapter 38: Automorphism groups Introduction 381 Automorphism groups of Boolean algebras
477 477
Assembling an automorphism; elements supporting an automorphism; cyclic automorphisms; exchanging involutions; the support of an automorphism; full subgroups of Aut A; expressing an automorphism as a product of involutions; subgroups of Aut A with many involutions; normal subgroups of full groups with many involutions; simple groups.
382 Automorphism groups of measure algebras
488
Measure-preserving automorphisms as products of involutions; normal subgroups of Aut A and Autµ¯ A.
383 Outer automorphisms
492
If G ≤ Aut A, H ≤ Aut B have many involutions, any isomorphism between G to H arises from an isomorphism between A and B; if A is nowhere rigid, Aut A has no outer automorphisms; applications to localizable measure algebras.
384 Entropy
502
Entropy of a partition of unity in a probability algebra; conditional entropy; entropy of a measurepreserving homomorphism; calculation of entropy (Kolmogorov-Sinaˇı theorem); Bernoulli shifts; isomorphic homomorphisms and conjugacy classes in Autµ¯ A; almost isomorphic inverse-measure-preserving functions.
385 More about entropy
515
Periodic and aperiodic parts of an endomorphism; the Halmos-Rokhlin-Kakutani lemma; the ShannonMcMillan-Breiman theorem; various lemmas.
386 Ornstein’s theorem
528
Bernoulli partitions; finding Bernoulli partitions with elements of given measure (Sinaˇı’s theorem); adjusting Bernoulli partitions; Ornstein’s theorem (Bernoulli shifts of the same finite entropy are isomorphic); Ornstein’s and Sinaˇı’s theorems in the case of infinite entropy.
387 Dye’s theorem
551
Full subgroups of Aut A; and orbits of inverse-measure-preserving functions; induced automorphisms of principal ideals; von Neumann transformations; von Neumann transformations generating a given full subgroup; classification of full subgroups generated by a single automorphism.
Chapter 39: Measurable algebras Introduction 391 Kelley’s theorem
567 567
Measurable algebras; strictly positive additive functionals and weak (σ, ∞)-distributivity; additive functionals subordinate to or dominating a given functional; intersection numbers; existence of strictly positive additive functionals; σ-linked Boolean algebras; Gaifman’s example.
392 Submeasures Submeasures; exhaustive, uniformly exhaustive and Maharam submeasures; the Kalton-Roberts theorem (a strictly positive uniformly exhaustive submeasure provides a strictly positive additive functional).
575
9
393 The Control Measure Problem
579
Forms of the Control Measure Problem; strictly positive Maharam submeasures, exhaustive submeasures, exhaustive submeasures on the clopen algebra of {0, 1}N ; absolute continuity of submeasures; countable atomless Boolean algebras; topologies on Boolean algebras; topologies on L0 spaces; vector measures; examples of submeasures.
394 Kawada’s theorem
595
Full local semigroups; τ -equidecomposability; fully non-paradoxical subgroups of Aut A; bb : ac and db : ae; invariant additive functions from A to L∞ (C), where C is the fixed-point algebra of a group; invariant additive functionals and measures; ergodic fully non-paradoxical groups.
395 The Hajian-Ito theorem
610
Invariant measures on measurable algebras; weakly wandering elements.
Appendix to Volume 3 Introduction 3A1 Set theory
613 613
Calculation of cardinalities; cofinal sets, cofinalities; notes on the use of Zorn’s Lemma; the natural numbers as finite ordinals; lattice homomorphisms; the Marriage Lemma.
3A2 Rings
615
Rings; subrings, ideals, homomorphisms, quotient rings, the First Isomorphism Theorem; products.
3A3 General topology
618
Hausdorff, regular, completely regular, zero-dimensional, extremally disconnected, compact and locally compact spaces; continuous functions; dense subsets; meager sets; Baire’s theorem for locally compact spaces; products; Tychonoff’s theorem; the usual topologies on {0, 1}I , RI ; cluster points of filters; topology bases; uniform convergence of sequences of functions; one-point compactifications.
3A4 Uniformities
622
Uniform spaces; and pseudometrics; uniform continuity; subspaces; product uniformities; Cauchy filters and completeness; extending uniformly continuous functions; completions.
3A5 Normed spaces
625
The Hahn-Banach theorem in analytic and geometric forms; cones and convex sets; weak and weak* topologies; reflexive spaces; Uniform Boundedness Theorem; completions; normed algebras; compact linear operators; Hilbert spaces.
3A6 Groups
628
Involutions; inner and outer automorphisms; normal subgroups.
References for Volume 3
629
Index to Volumes 1-3 Principal topics and results General index
633 641
10
General introduction In this treatise I aim to give a comprehensive description of modern abstract measure theory, with some indication of its principal applications. The first two volumes are set at an introductory level; they are intended for students with a solid grounding in the concepts of real analysis, but possibly with rather limited detailed knowledge. As the book proceeds, the level of sophistication and expertise demanded will increase; thus for the volume on topological measure spaces, familiarity with general topology will be assumed. The emphasis throughout is on the mathematical ideas involved, which in this subject are mostly to be found in the details of the proofs. My intention is that the book should be usable both as a first introduction to the subject and as a reference work. For the sake of the first aim, I try to limit the ideas of the early volumes to those which are really essential to the development of the basic theorems. For the sake of the second aim, I try to express these ideas in their full natural generality, and in particular I take care to avoid suggesting any unnecessary restrictions in their applicability. Of course these principles are to to some extent contradictory. Nevertheless, I find that most of the time they are very nearly reconcilable, provided that I indulge in a certain degree of repetition. For instance, right at the beginning, the puzzle arises: should one develop Lebesgue measure first on the real line, and then in spaces of higher dimension, or should one go straight to the multidimensional case? I believe that there is no single correct answer to this question. Most students will find the one-dimensional case easier, and it therefore seems more appropriate for a first introduction, since even in that case the technical problems can be daunting. But certainly every student of measure theory must at a fairly early stage come to terms with Lebesgue area and volume as well as length; and with the correct formulations, the multidimensional case differs from the one-dimensional case only in a definition and a (substantial) lemma. So what I have done is to write them both out (§§114-115). In the same spirit, I have been uninhibited, when setting out exercises, by the fact that many of the results I invite students to look for will appear in later chapters; I believe that throughout mathematics one has a better chance of understanding a theorem if one has previously attempted something similar alone. As I write this Introduction (December 2001), the plan of the work is as follows: Volume Volume Volume Volume Volume
1: 2: 3: 4: 5:
The Irreducible Minimum Broad Foundations Measure Algebras Topological Measure Spaces Set-theoretic Measure Theory.
Volume 1 is intended for those with no prior knowledge of measure theory, but competent in the elementary techniques of real analysis. I hope that it will be found useful by undergraduates meeting Lebesgue measure for the first time. Volume 2 aims to lay out some of the fundamental results of pure measure theory (the Radon-Nikod´ ym theorem, Fubini’s theorem), but also gives short introductions to some of the most important applications of measure theory (probability theory, Fourier analysis). While I should like to believe that most of it is written at a level accessible to anyone who has mastered the contents of Volume 1, I should not myself have the courage to try to cover it in an undergraduate course, though I would certainly attempt to include some parts of it. Volumes 3 and 4 are set at a rather higher level, suitable to postgraduate courses; while Volume 5 will assume a wide-ranging competence over large parts of analysis and set theory. There is a disclaimer which I ought to make in a place where you might see it in time to avoid paying for this book. I make no attempt to describe the history of the subject. This is not because I think the history uninteresting or unimportant; rather, it is because I have no confidence of saying anything which would not be seriously misleading. Indeed I have very little confidence in anything I have ever read concerning the history of ideas. So while I am happy to honour the names of Lebesgue and Kolmogorov and Maharam in more or less appropriate places, and I try to include in the bibliographies the works which I have myself consulted, I leave any consideration of the details to those bolder and better qualified than myself. The work as a whole is not yet complete; and when it is finished, it will undoubtedly be too long to be printed as a single volume in any reasonable format. I am therefore publishing it one part at a time. However, drafts of most of the rest are available on the Internet; see http://www.essex.ac.uk/ maths/staff/fremlin/mt.htm for detailed instructions. For the time being, at least, printing will be in short runs. I hope that readers will be energetic in commenting on errors and omissions, since it should be possible to correct these relatively promptly. An inevitable consequence of this is that paragraph references may go out of date rather quickly. I shall be most flattered if anyone chooses to rely on this book as a source
Introduction to Volume 3
11
for basic material; and I am willing to attempt to maintain a concordance to such references, indicating where migratory results have come to rest for the moment, if authors will supply me with copies of papers which use them. I mention some minor points concerning the layout of the material. Most sections conclude with lists of ‘basic exercises’ and ‘further exercises’, which I hope will be generally instructive and occasionally entertaining. How many of these you should attempt must be for you and your teacher, if any, to decide, as no two students will have quite the same needs. I mark with a > those which seem to me to be particularly important. But while you may not need to write out solutions to all the ‘basic exercises’, if you are in any doubt as to your capacity to do so you should take this as a warning to slow down a bit. The ‘further exercises’ are unbounded in difficulty, and are unified only by a presumption that each has at least one solution based on ideas already introduced. Occasionally I add a final ‘problem’, a question to which I do not know the answer and which seems to arise naturally in the course of the work. The impulse to write this book is in large part a desire to present a unified account of the subject. Cross-references are correspondingly abundant and wide-ranging. In order to be able to refer freely across the whole text, I have chosen a reference system which gives the same code name to a paragraph wherever it is being called from. Thus 132E is the fifth paragraph in the second section of the third chapter of Volume 1, and is referred to by that name throughout. Let me emphasize that cross-references are supposed to help the reader, not distract her. Do not take the interpolation ‘(121A)’ as an instruction, or even a recommendation, to lift Volume 1 off the shelf and hunt for §121. If you are happy with an argument as it stands, independently of the reference, then carry on. If, however, I seem to have made rather a large jump, or the notation has suddenly become opaque, local cross-references may help you to fill in the gaps. Each volume will have an appendix of ‘useful facts’, in which I set out material which is called on somewhere in that volume, and which I do not feel I can take for granted. Typically the arrangement of material in these appendices is directed very narrowly at the particular applications I have in mind, and is unlikely to be a satisfactory substitute for conventional treatments of the topics touched on. Moreover, the ideas may well be needed only on rare and isolated occasions. So as a rule I recommend you to ignore the appendices until you have some direct reason to suppose that a fragment may be useful to you. During the extended gestation of this project I have been helped by many people, and I hope that my friends and colleagues will be pleased when they recognise their ideas scattered through the pages below. But I am especially grateful to those who have taken the trouble to read through earlier drafts and comment on obscurities and errors.
Introduction to Volume 3 One of the first things one learns, as a student of measure theory, is that sets of measure zero are frequently ‘negligible’ in the straightforward sense that they can safely be ignored. This is not quite a universal principle, and one of my purposes in writing this treatise is to call attention to the exceptional cases in which ‘negligible’ sets are important. But very large parts of the theory, including some of the topics already treated in Volume 2, can be expressed in an appropriately abstract language in which negligible sets have been factored out. This is what the present volume is about. A ‘measure algebra’ is a quotient of an algebra of measurable sets by an ideal of negligible sets; that is, the elements of the measure algebra are equivalence classes of measurable sets. At the cost of an extra layer of abstraction, we obtain a language which can give concise and elegant expression to a substantial proportion of the ideas of measure theory, and which offers insights almost everywhere in the subject. It is here that I embark wholeheartedly on ‘pure’ measure theory. I think it is fair to say that the applications of measure theory to other branches of mathematics are more often through measure spaces rather than measure algebras. Certainly there will be in this volume many theorems of wide importance outside measure theory; but typically their usefulness will be in forms translated back into the language of the first two volumes. But it is also fair to say that the language of measure algebras is the only reasonable way to discuss large parts of a subject which, as pure mathematics, can bear comparison with any. In the structure of this volume I can distinguish seven ‘working’ and two ‘accessory’ chapters. The ‘accessory’ chapters are 31 and 35. In these I develop the theories of Boolean algebras and Riesz spaces (= vector lattices) which are needed later. As in Volume 2 you have a certain amount of choice in the order in
12
Introduction to Volume 3
which you take the material. Everything except Chapter 35 depends on Chapter 31, and everything except Chapters 31 and 35 depends on Chapter 32. Chapters 33, 34 and 36 can be taken in any order, but Chapter 36 relies on Chapter 35. (I do not mean that Chapter 33 is never referred to in Chapter 34, nor even that no results from Chapter 33 are relied on in the later chapters. What I mean is that their most important ideas are accessible without learning the material of Chapter 33 properly.) Chapter 37 depends on Chapters 35 and 36. Chapter 38 would be difficult to make sense of without some notion of what has been done in Chapter 33. Chapter 39 uses fragments of Chapters 35 and 36. The first half of the volume follows almost the only line permitted by the structure of the subject. If we are going to study measure algebras at all, we must know the relevant facts about Boolean algebras (Chapter 31) and how to translate what we know about measure spaces into the new language (Chapter 32). Then we must get a proper grip on the two most important theorems: Maharam’s theorem on the classification of measure algebras (Chapter 33) and the von Neumann-Maharam lifting theorem (Chapter 34). Since I am now writing for readers who are committed – I hope, happily committed – to learning as much as they can about the subject, I take the space to push these ideas as far as they can easily go, giving a full classification of closed subalgebras of probability algebras, for instance (§333), and investigating special types of lifting (§§345-346). I mention here three sections interpolated into Chapter 34 (§§342-344) which attack a subtle and important question: when can we expect homomorphisms between measure algebras to be realizable in terms of transformations between measure spaces, as discussed briefly in §235 and elsewhere. Chapters 36 and 37 are devoted to re-working the ideas of Chapter 24 on ‘function spaces’ in the more abstract context now available, and relating them to the general Riesz spaces of Chapter 35. I am concerned here not to develop new structures, nor even to prove striking new theorems, but rather to offer new ways of looking at the old ones. Only in the Ergodic Theorem (§372) do I come to a really important new result. Chapter 38 looks at two questions, both obvious ones to ask if you have been trained in twentieth-century pure mathematics: what does the automorphism group of a measure algebra look like, and inside such an automorphism group, what do the conjugacy classes look like? (The second question is a fancy way of asking how to decide, given two automorphisms of one of the structures considered in this volume, whether they are really different, or just copies of each other obtained by looking at the structure a different way up.) Finally, in Chapter 39, I discuss what is known about the question of which Boolean algebras can appear as measure algebras. Concerning the prerequisites for this volume, we certainly do not need everything in Volume 2. The important chapters there are 21, 23, 24, 25 and 27. If you are approaching this volume without having read the earlier parts of this treatise, you will need the Radon-Nikod´ ym theorem and product measures (of arbitrary families of probability spaces), for Maharam’s theorem; a simple version of the martingale theorem, for the lifting theorem; and an acquaintance with Lp spaces (particularly, with L0 spaces) for Chapter 36. But I would recommend the results-only versions of Volumes 1 and 2 in case some reference is totally obscure. Outside measure theory, I call on quite a lot of terms from general topology, but none of the ideas needed are difficult (Baire’s and Tychonoff’s theorems are the deepest); they are sketched in §§3A3 and 3A4. We do need some functional analysis for Chapters 36 and 39, but very little more than was already used in Volume 2, except that I now call on versions of the Hahn-Banach theorem (§3A5). In this volume I assume that readers have substantial experience in both real and abstract analysis, and I make few concessions which would not be appropriate when addressing active researchers, except that perhaps I am a little gentler when calling on ideas from set theory and general topology than I should be with my own colleagues, and I continue to include all the easiest exercises I can think of. I do maintain my practice of giving proofs in very full detail, not so much because I am trying to make them easier, but because one of my purposes here is to provide a complete account of the ideas of the subject. I hope that the result will be accessible to most doctoral students who are studying topics in, or depending on, measure theory.
311B
Boolean algebras
13
Chapter 31 Boolean algebras The theory of measure algebras naturally depends on certain parts of the general theory of Boolean algebras. In this chapter I collect those results which will be useful later. Since many students encounter the formal notion of Boolean algebra for the first time in this context, I start at the beginning; and indeed I include in the Appendix (§3A2) a brief account of the necessary part of the theory of rings, as not everyone will have had time for this bit of abstract algebra in an undergraduate course. But unless you find the algebraic theory of Boolean algebras so interesting that you wish to study it for its own sake – in which case you should perhaps turn to Sikorski 64 or Koppelberg 89 – I do not think it would be very sensible to read the whole of this chapter before proceeding to the main work of the volume in Chapter 32. Probably §311 is necessary to get an idea of what a Boolean algebra looks like, and a glance at the statements of the theorems in §312 would be useful, but the later sections can wait until you have need of them, on the understanding that apparently innocent formal manipulations may depend on concepts which take some time to master. I hope that the cross-references will be sufficiently well-targeted to make it possible to read this material in parallel with its applications.
311 Boolean algebras In this section I try to give a sufficient notion of the character of abstract Boolean algebras to make the calculations which will appear on almost every page of this volume seem both elementary and natural. The principal result is of course M.H.Stone’s theorem: every Boolean algebra can be expressed as an algebra of sets (311E). So the section divides naturally into the first part, proving Stone’s theorem, and the second, consisting of elementary consequences of the theorem and a little practice in using the insights it offers. 311A Definitions (a) A Boolean ring is a ring (A, +, .) in which a2 = a for every a ∈ A. (b) A Boolean algebra is a Boolean ring A with a multiplicative identity 1 = 1A ; I allow 1 = 0 in this context. Remark For notes on those parts of the elementary theory of rings which we shall need, see §3A2. I hope that the rather arbitrary use of the word ‘algebra’ here will give no difficulties; it gives me the freedom to insist that the ring {0} should be accepted as a Boolean algebra. 311B Examples (a) For any set X, (PX, 4, ∩) is a Boolean algebra; its zero is ∅ and its multiplicative identity is X. P P We have to check the following, which are all easily established, using Venn diagrams or otherwise: A4B ⊆ X for all A, B ⊆ X, (A4B)4C = A4(B4C) for all A, B, C ⊆ X, so that (PX, 4) is a semigroup; A4∅ = ∅4A = A for every A ⊆ X, so that ∅ is the identity in (PX, 4); A4A = ∅ for every A ⊆ X, so that every element of PX is its own inverse in (PX, 4), and (PX, 4) is a group; A4B = B4A for all A, B ⊆ X, so that (PX, 4) is an abelian group; A ∩ B ⊆ X for all A, B ⊆ X, (A ∩ B) ∩ C = A ∩ (B ∩ C) for all A, B, C ⊆ X, so that (PX, ∩) is a semigroup; A ∩ (B4C) = (A ∩ B)4(A ∩ C), (A4B) ∩ C = (A ∩ C)4(B ∩ C) for all A, B, C ⊆ X, so that (PX, 4, ∩) is a ring;
14
Boolean algebras
311B
A ∩ A = A for every A ⊆ X, so that (PX, 4, ∩) is a Boolean ring; A ∩ X = X ∩ A = A for every A ⊆ X, so that (PX, 4, ∩) is a Boolean algebra and X is its identity. Q Q (b) Recall that an ‘algebra of subsets of X’ (136E) is a family Σ ⊆ PX such that ∅ ∈ Σ, X \ E ∈ Σ for every E ∈ Σ, and E ∪ F ∈ Σ for all E, F ∈ Σ. In this case (Σ, 4, ∩) is a Boolean algebra with zero ∅ and identity X. P P If E, F ∈ Σ, then E ∩ F = X \ ((X \ E) ∪ (X \ F )) ∈ Σ, E4F = (E ∩ (X \ F )) ∪ (F ∩ (X \ E)) ∈ Σ. Because ∅ and X = X \ ∅ both belong to Σ, we can work through the identities in (a) above to see that Σ, like PX, is a Boolean algebra. Q Q (c) Consider the ring Z2 = {0, 1}, with its ring operations +2 , · given by setting 0 +2 0 = 1 +2 1 = 0,
0 +2 1 = 1 +2 0 = 1,
0 · 0 = 0 · 1 = 1 · 0 = 0,
1 · 1 = 1.
I leave it to you to check, if you have not seen it before, that this is a ring. Because 0 · 0 = 0 and 1 · 1 = 1, it is a Boolean algebra. 311C Proposition Let A be a Boolean ring. (a) a + a = 0, that is, a = −a, for every a ∈ A. (b) ab = ba for all a, b ∈ A. proof (a) If a ∈ A, then a + a = (a + a)(a + a) = a2 + a2 + a2 + a2 = a + a + a + a, so we must have 0 = a + a. (b) Now for any a, b ∈ A, a + b = (a + b)(a + b) = a2 + ab + ba + b2 = a + ab + ba + b, so 0 = ab + ba = ab + ab and ab = ba. 311D Lemma Let A be a Boolean ring, I an ideal of A (3A2E), and a ∈ A \ I. Then there is a ring homomorphism φ : A → Z2 such that φa = 1 and φd = 0 for every d ∈ I. proof (a) Let I be the family of those ideals J of A which include I and do not contain a. Then I has a maximal element K say. P PSApply Zorn’s lemma. Since I ∈ I, I 6= ∅. If J is a non-empty totally ordered subset of I, then set J ∗ = J . If b, c ∈ J ∗ and d ∈ A, then there are J1 , J2 ∈ J such that b ∈ J1 and c ∈ J2 ; now J = J1 ∪ J2 is equal to one of J1 , J2 , so belongs to J , and 0, b + c, bd all belong to J, so all belong to J ∗ . Thus J ∗ C A; of course I ⊆ J ∗ and a ∈ / J ∗ , so J ∗ ∈ I and is an upper bound for J in I. As J is arbitrary, the hypotheses of Zorn’s lemma are satisfied and I has a maximal element. Q Q (b) For b ∈ A set Kb = {d : d ∈ A, bd ∈ K}. The following are easy to check: (i) K ⊆ Kb for every b ∈ A, because K is an ideal. (ii) Kb C A for every b ∈ A. P P 0 ∈ K ⊆ Kb . If d, d0 ∈ Kb and c ∈ A then b(d + d0 ) = bd + bd0 , b(dc) = (bd)c belong to K, so d + d0 , dc ∈ Kb . Q Q (iii) If b ∈ A and a ∈ / Kb , then Kb ∈ I so Kb = K.
311Fc
Boolean algebras
15
(iv) Now a2 = a ∈ / K, so a ∈ / Ka and Ka = K. (v) If b ∈ A \ K then b ∈ / Ka , that is, ba = ab ∈ / K, and a ∈ / Kb ; consequently Kb = K. (vi) If b, c ∈ A \ K then c ∈ / Kb so bc ∈ / K. (vii) If b, c ∈ A \ K then bc(b + c) = b2 c + bc2 = bc + bc = 0 ∈ K, so b + c ∈ Kbc . By (vi) and (v), Kbc = K so b + c ∈ K. (c) Now define φ : A → Z2 by setting φd = 0 if d ∈ K, φd = 1 if d ∈ A \ K. Then φ is a ring homomorphism. P P (i) If b, c ∈ K then b + c, bc ∈ K so φ(b + c) = 0 = φb +2 φc,
φ(bc) = 0 = φb φc.
(ii) If b ∈ K, c ∈ A \ K then c = (b + b) + c = b + (b + c) ∈ /K so b + c ∈ / K, while bc ∈ K, so φ(b + c) = 1 = φb +2 φc,
φ(bc) = 0 = φb φc.
φ(b + c) = 1 = φb +2 φc,
φ(bc) = 0 = φb φc
(iii) Similarly, if b ∈ A \ K and c ∈ K. (iv) If b, c ∈ A \ K, then by (b-vi) and (b-vii) we have b + c ∈ K, bc ∈ / K so φ(b + c) = 0 = φb +2 φc,
φ(bc) = 1 = φb φc.
Thus φ is a ring homomorphism. Q Q (d) Finally, if d ∈ I then d ∈ K so φd = 0; and φa = 1 because a ∈ / K. 311E M.H.Stone’s Theorem: first form Let A be any Boolean ring, and let Z be the set of ring homomorphisms from A onto Z2 . Then we have an injective ring homomorphism a 7→ b a : A → PZ, setting b a = {z : z ∈ Z, z(a) = 1}. If A is a Boolean algebra, then b 1A = Z. proof (a) If a, b ∈ A, then d = {z : z(a+b) = 1} = {z : z(a) +2 z(b) = 1} = {z : {z(a), z(b)} = {0, 1}} = b a+b a4bb, b = {z : z(ab) = 1} = {z : z(a)z(b) = 1} = {z : z(a) = z(b) = 1} = b ab a ∩ bb. Thus a 7→ b a is a ring homomorphism. (b) If a ∈ A and a 6= 0, then by 311D, with I = {0}, there is a z ∈ Z such that z(a) = 1, that is, z ∈ b a; so that b a 6= ∅. This shows that the kernel of a 7→ b a is {0}, so that the homomorphism is injective (3A2Db). (c) If A is a Boolean algebra, and z ∈ Z, then there is some a ∈ A such that z(a) = 1, so that z(1A )z(a) = z(1A a) 6= 0 and z(1A ) 6= 0; thus b 1A = Z. 311F Remarks (a) For any Boolean ring A, I will say that the Stone space of A is the set Z of non-zero ring homomorphisms from A to Z2 , and the canonical map a 7→ b a : A → PZ is the Stone representation. (b) Because the map a 7→ b a : A → PZ is an injective ring homomorphism, A is isomorphic, as Boolean ring, to its image E = {b a : a ∈ A}, which is a subring of PZ. Thus the Boolean rings PX of 311Ba are leading examples in a very strong sense. (c) I have taken the set Z of the Stone representation to be actually the set of homomorphisms from A onto Z2 . Of course we could equally well take any set which is in a natural one-to-one correspondence with Z; a popular choice is the set of maximal ideals of A, since a subset of A is a maximal ideal iff it is the kernel of a member of Z, which is then uniquely defined.
16
Boolean algebras
311G
311G The operations ∪ , \ , 4 on a Boolean ring Let A be a Boolean ring. (a) Using the Stone representation, we can see that the elementary operations ∪, ∩, \, 4 of set theory all correspond to operations on A. If we set a ∪ b = a + b + ab,
a ∩ b = ab,
a \ b = a + ab,
a4b = a+b
for a, b ∈ A, then we see that ad ∪b = b a4bb4(b a ∩ bb) = b a ∪ bb, ad ∩b = b a ∩ bb, ac \b = b a \ bb, ad 4b = b a4bb. Consequently all the familiar rules for manipulation of ∩, ∪, etc. will apply also to ∩ , ∪ , and we shall have, for instance, a ∩ (b ∪ c) = (a ∩ b) ∪ (a ∩ c),
a ∪ (b ∩ c) = (a ∪ b) ∩ (a ∪ c)
for any members a, b, c of any Boolean ring A. (b) Still importing terminology from elementary set theory, I will say that a set A ⊆ A is disjoint if a ∩ b = 0, that is, ab = 0, for all distinct a, b ∈ A; and that an indexed family hai ii∈I in A is disjoint if ai ∩ aj = 0 for all distinct i, j ∈ I. (Just as I allow ∅ to be a member of a disjoint family of sets, I allow 0 ∈ A or ai = 0 in the present context.) (c) A partition of unity in A will be either a disjoint set C ⊆ A such that there is no non-zero a ∈ A such that a ∩ c = 0 for every c ∈ C or a disjoint family hci ii∈I in A such that there is no non-zero a ∈ A such that a ∩ ci = 0 for every i ∈ I. (In the first case I allow 0 ∈ C, and in the second I allow ci = 0.) (d) If C and D are two partitions of unity, I say that C refines D if for every c ∈ C there is a d ∈ D such that cd = d. Note that if C refines D and D refines E then C refines E. P P If c ∈ C, there is a d ∈ D such that cd = c; now there is an e ∈ E such that de = d; in this case, ce = (cd)e = c(de) = cd = c; as c is arbitrary, C refines E. Q Q 311H The order structure of a Boolean ring Again treating a Boolean ring A as an algebra of sets, we have a natural ordering on it, setting a ⊆ b if ab = a, so that a ⊆ b iff b a ⊆ bb. This translation makes it obvious that ⊆ is a partial ordering on A, with least element 0, and with greatest element 1 iff A is a Boolean algebra. Moreover, A is a lattice (definition: 2A1Ad), with a ∪ b = sup{a, b}, a ∩ b = inf{a, b} for all a, b ∈ A. Generally, for a0 , . . . , an ∈ A, supi≤n ai = a0 ∪ . . . ∪ an ,
inf i≤n ai = a0 ∩ . . . ∩ an ;
suprema and infima of finite subsets A correspond to unions and intersections of the corresponding families in the Stone space. (But suprema and infima of infinite subsets of A are a very different matter; see §313 below.) It may be obvious, but it is nevertheless vital to recognise that when A is a ring of sets then ⊆ agrees with ⊆. 311I The topology of a Stone space: Theorem Let Z be the Stone space of a Boolean ring A, and let T be {G : G ⊆ Z and for every z ∈ G there is an a ∈ A such that z ∈ b a ⊆ G}. Then T is a topology on Z, under which Z is a locally compact zero-dimensional Hausdorff space, and E = {b a : a ∈ A} is precisely the set of compact open subsets of Z. A is a Boolean algebra iff Z is compact.
311J
Boolean algebras
17
S proof (a) Because E is closed under ∩, and E = Z (recall that Z is the set of surjective homomorphisms from A to Z2 , so that every z ∈ Z is somewhere non-zero and belongs to some b a), E is a topology base, and T is a topology. (b) T is Hausdorff. P P Take any distinct z, w ∈ Z. Then there is an a ∈ A such that z(a) 6= w(a); let us take it that z(a) = 1, w(a) = 0. There is also a b ∈ A such that w(b) = 1, so that w(b + ab) = w(b) +2 w(a)w(b) = 1 and w ∈ (b + ab)b; also a(b + ab) = ab + a2 b = ab + ab = 0, so b a ∩ (b + ab)b = (a(b + ab))b = b 0 = ∅, and b a, (b + ab)b are disjoint members of T containing z, w respectively. Q Q (c) If a ∈ A then b a is compact. P P Let F be an ultrafilter on Z containing b a. For each b ∈ A, z0 (b) = limz→F z(b) must be defined in Z2 , since one of the sets {z : z(b) = 0}, {z : z(b) = 1} must belong to F. If b, c ∈ A, then the set F = {z : z(b) = z0 (b), z(c) = z0 (c), z(b + c) = z0 (b + c), z(bc) = z0 (bc)} belongs to F, so is not empty; take any z1 ∈ F ; then z0 (b + c) = z1 (b + c) = z1 (b) +2 z1 (c) = z0 (b) +2 z0 (c), z0 (bc) = z1 (bc) = z1 (b)z1 (c) = z0 (b)z0 (c). As b, c are arbitrary, z0 : A → Z2 is a ring homomorphism. Also z0 (a) = 1, because b a ∈ F , so z0 ∈ b a. Now let G be any open subset of Z containing z0 ; then there is a b ∈ A such that z0 ⊆ bb ⊆ G; since limz→F z(b) = z0 (b) = 1, we must have bb = {z : z(b) = 1} ∈ F and G ∈ F. Thus F converges to z0 . As F is arbitrary, b a is compact (2A3R). Q Q (d) This shows that b a is a compact open set for every a ∈ A. Moreover, since every point of Z belongs to some b a, every point of Z has a compact neighbourhood, and Z is locally compact. Every b a is closed (because it is compact, or otherwise), so E is a base for T consisting of open-and-closed sets, and T is zero-dimensional. (e) Now suppose that E ⊆ Z is an open compact set. If E = ∅ then E = b 0. Otherwise, set G = {b a : a ∈ A, b a ⊆ E}. S Then G is a family of open subsets S of Z and G = E, because E is open. But E is also compact, so there is a finite G0 ⊆ G such that E = G0 . Express G0 as {b a0 , . . . , b an }. Then E=b a0 ∪ . . . ∪ b an = (a0 ∪ . . . ∪ an )b. This shows that every compact open subset of Z is of the form b a for some a ∈ A. (f ) Finally, if A is a Boolean algebra then Z = b 1 is compact, by (c); while if Z is compact then (e) tells us that Z = b a for some a ∈ A, and of course this a must be a multiplicative identity for A, so that A is a Boolean algebra. 311J
We have a kind of converse of Stone’s theorem.
Proposition Let X be a locally compact zero-dimensional Hausdorff space. Then the set A of open-andcompact subsets of X is a subring of PZ. If Z is the Stone space of A, there is a unique homeomorphism θ : Z → X such that b a = θ−1 [a] for every a ∈ A. proof (a) Because X is Hausdorff, all its compact sets are closed, so every member of A is closed. Consequently a ∪ b, a \ b, a ∩ b and a4b belong to A for all a, b ∈ A, and A is a subring of PX. It will be helpful to know that A is a base for the topology of X. P P If G ⊆ X is open and x ∈ G, then (because X is locally compact) there is a compact set K ⊆ X such that x ∈ int K; now (because X is zero-dimensional) there is an open-and-closed set a ⊆ X such that x ∈ a ⊆ G ∩ int K; because a is a closed subset of a compact subset of X, it is compact, and belongs to A, while x ∈ a ⊆ G. Q Q
18
Boolean algebras
311J
(b) Let R ⊆ Z × X be the relation {(z, x): for every a ∈ A, x ∈ a ⇐⇒ z(a) = 1}. Then R is the graph of a bijective function θ : Z → X. P P (i) If z ∈ Z and x, x0 ∈ X are distinct, then, because X is Hausdorff, there is an open set G ⊆ X containing x and not containing x0 ; because A is a base for the topology of X, there is an a ∈ A such that x ∈ a ⊆ G, so that x0 ∈ / a. Now either z(a) = 1 and (z, x0 ) ∈ / R, or z(a) = 0 and (z, x) ∈ / R. Thus R is the graph of a function θ with domain included in Z and taking values in X. (ii) If z ∈ Z, there is an a0 ∈ A such that z(a0 ) = 1. Consider A = {a : z(a) = 1}.TThis is a family of closed subsets ofTX containing the compact set a0 , and a ∩ b ∈ A for all a, b ∈ A. So A is not empty (3A3Db); take x ∈ A. Then x ∈ a whenever z(a) = 1. On the other hand, if z(a) = 0, then z(a0 \ a) = z(a0 4(a ∩ a0 )) = z(a0 ) +2 z(a0 )z(a) = 1, so x ∈ a0 \ a and x ∈ / a. Thus (z, x) ∈ R and θ(z) = x is defined. As z is arbitrary, the domain of θ is the whole of Z. (iii) If x ∈ X, define z : A → Z2 by setting z(a) = 1 if x ∈ a, 0 otherwise. It is elementary to check that z is a ring homomorphism form A to Z2 . To see that it takes the value 1, note that because A is a base for the topology of X there is an a ∈ A such that x ∈ a, so that z(a) = 1. So z ∈ Z, and of course (z, x) ∈ R. As x is arbitrary, θ is surjective. (iv) If z, z 0 ∈ Z and θ(z) = θ(z 0 ), then, for any a ∈ A, z(a) = 1 ⇐⇒ θ(z) ∈ a ⇐⇒ θ(z 0 ) ∈ a ⇐⇒ z 0 (a) = 1, so z = z 0 . Thus θ is injective. Q Q (c) For any a ∈ A, θ−1 [a] = {z : θ(z) ∈ a} = {z : z(a) = 1} = b a. It follows that P (i) If G ⊆ X is open, then (because A is a base for the topology S θ is a homeomorphism. P of X) G = {a : a ∈ A, a ⊆ G} and S S θ−1 [G] = {θ−1 [a] : a ∈ A, a ⊆ G} = {b a : a ∈ A, a ⊆ G} is an open subset of Z. As G is S arbitrary, θ is continuous. (ii) On theSother hand, if G ⊆ X and θ−1 [G] is −1 a for some A ⊆ A, so that G = A is an open set in X. Accordingly open, then θ [G] is of the form a∈A b θ is a homeomorphism. Q Q (d) Finally, I must check the uniqueness of θ. But of course if θ˜ : Z → X is any function such that −1 ˜ θ [a] = b a for every a ∈ A, then the graph of θ˜ must be R, so θ˜ = θ. 311K Remark Thus we have a correspondence between Boolean rings and zero-dimensional locally compact Hausdorff spaces which is (up to isomorphism, on the one hand, and homeomorphism, on the other) one-to-one. Every property of Boolean rings which we study will necessarily correspond to some property of zero-dimensional locally compact Hausdorff spaces. 311L Complemented distributive lattices I have introduced Boolean algebras through the theory of rings; this seems to be the quickest route to them from an ordinary undergraduate course in abstract algebra. However there are alternative approaches, taking the order structure rather than the algebraic operations as fundamental, and for the sake of an application in Chapter 35 I give the details of one of these. Proposition Let A be a lattice such that (i) (a ∨ b) ∧ c = (a ∧ c) ∨ (b ∧ c) for all a, b, c ∈ A; (ii) there is a bijection a 7→ a0 : A → A which is order-reversing, that is, a ≤ b iff b0 ≤ a0 , and such that a00 = a for every a; (iii) A has a least element 0 and a ∧ a0 = 0 for every a ∈ A. Then A has a Boolean algebra structure for which a ⊆ b iff a ≤ b.
311X
Boolean algebras
19
proof (a) Write 1 for 00 ; if a ∈ A, then a0 ≥ 0 so a = a00 ≤ 00 = 1, and 1 is the greatest element of A. If a, b ∈ A then, because 0 is an order-reversing bijection, a0 ∨ b0 = (a ∧ b)0 . P P For c ∈ A, a0 ∨ b0 ≤ c ⇐⇒ a0 ≤ c & b0 ≤ c ⇐⇒ c0 ≤ a & c0 ≤ b ⇐⇒ c0 ≤ a ∧ b ⇐⇒ (a ∧ b)0 ≤ c. Q Q Similarly, a0 ∧ b0 = (a ∨ b)0 . If a, b, c ∈ A then (a ∧ b) ∨ c = ((a0 ∨ b0 ) ∧ c0 )0 = ((a0 ∧ c0 ) ∨ (b0 ∧ c0 ))0 = (a ∨ c) ∧ (b ∨ c). (b) Define addition and multiplication on A by setting a + b = (a ∧ b0 ) ∨ (a0 ∧ b),
ab = a ∧ b
for a, b ∈ A. (c)(i) If a, b ∈ A then (a + b)0 = (a0 ∨ b) ∧ (a ∨ b0 ) = (a0 ∧ a) ∨ (a0 ∧ b0 ) ∨ (b ∧ a) ∨ (b ∧ b0 ) = 0 ∨ (a0 ∧ b0 ) ∨ (b ∧ a) = (a0 ∧ b0 ) ∨ (a ∧ b). So if a, b, c ∈ A then (a + b) + c = ((a + b) ∧ c0 ) ∨ ((a + b)0 ∧ c) = (((a ∧ b0 ) ∨ (a0 ∧ b)) ∧ c0 ) ∨ (((a0 ∧ b0 ) ∨ (a ∧ b)) ∧ c) = (a ∧ b0 ∧ c0 ) ∨ (a0 ∧ b ∧ c0 ) ∨ (a0 ∧ b0 ∧ c) ∨ (a ∧ b ∧ c); as this last formula is symmetric in a, b and c, it is also equal to a + (b + c). Thus addition is associative. (ii) For any a ∈ A, a + 0 = 0 + a = (a0 ∧ 0) ∨ (a ∧ 00 ) = 0 ∨ (a ∧ 1) = a, so 0 is the additive identity of A. Also a + a = (a ∧ a0 ) ∨ (a0 ∧ a) = 0 ∨ 0 = 0 so each element of A is its own additive inverse, and (A, +) is a group. It is abelian because ∨, ∧ are commutative. (d) Because ∧ is associative and commutative, (A, ·) is a commutative semigroup; also 1 is its identity, because a ∧ 1 = a for every a ∈ A. As for the distributive law in A, ab + ac = (a ∧ b ∧ (a ∧ c)0 ) ∨ ((a ∧ b)0 ∧ a ∧ c) = (a ∧ b ∧ (a0 ∨ c0 )) ∨ ((a0 ∨ b0 ) ∧ a ∧ c) = (a ∧ b ∧ a0 ) ∨ (a ∧ b ∧ c0 ) ∨ (a0 ∧ a ∧ c) ∨ (b0 ∧ a ∧ c) = (a ∧ b ∧ c0 ) ∨ (b0 ∧ a ∧ c) = a ∧ ((b ∧ c0 ) ∨ (b0 ∧ c)) = a(b + c) for all a, b, c ∈ A. Thus (A, +, ·) is a ring; because a ∧ a = a for every a, it is a Boolean ring. (e) For a, b ∈ A, a ⊆ b ⇐⇒ ab = a ⇐⇒ a ∧ b = a ⇐⇒ a ≤ b, so the order relations of A coincide. Remark It is the case that the Boolean algebra structure of A is uniquely determined by its order structure, but I delay the proof to the next section (312L). 311X Basic exercises (a) Let A0 , . . . , An be sets. Show that A0 4 . . . 4An = {x : #({i : i ≤ n, x ∈ Ai }) is odd}.
20
Boolean algebras
311Xb
(b) Let X be a set, and Σ ⊆ PX. Show that the following are equiveridical: (i) Σ is an algebra of subsets of X; (ii) Σ is a subring of PX (that is, contains ∅ and is closed under 4 and ∩) and contains X; (iii) ∅ ∈ Σ, X \ E ∈ Σ for every E ∈ Σ, and E ∩ F ∈ Σ for all E, F ∈ Σ. (c) Let A be any Boolean ring. Let a 7→ a0 be any bijection between A and a set B disjoint from A. Set B = A ∪ B, and extend the addition and multiplication of A to form binary operations on B by using the formulae a + b0 = a0 + b = (a + b)0 , a0 b = b + ab,
a0 + b0 = a + b,
ab0 = a + ab, a0 b0 = (a + b + ab)0 .
Show that B is a Boolean algebra and that A is an ideal in B. > (d) Let A be a Boolean ring, and K a finite subset of A. Show that the subring of A generated by K #(K) has at most 22 members, being the set of sums of products of members of K. > (e) Show that any finite Boolean ring is isomorphic to PX for some finite set X (and, in particular, is a Boolean algebra). (f ) Let A be any Boolean ring. Show that a ∪ (b ∩ c) = (a ∩ b) ∪ (a ∩ c), a ∪ (b ∩ c) = (a ∩ b) ∪ (a ∩ c) for all a, b, c ∈ A directly from the definitions in 311G, without using Stone’s theorem. >(g) Let A be any Boolean ring. Show that if we regard the Stone space Z of A as a subset of {0, 1}A , then the topology of Z (311I) is just the subspace topology induced by the ordinary product topology of {0, 1}A . (h) Let I be any set, and set X = {0, 1}I with its usual topology (3A3K). Show that for a subset E of X the following are equiveridical: (i) E is open-and-compact; (ii) E is determined by coordinates in a finite subset of I (definition: 254M); (iii) E belongs to the algebra of subsets of X generated by {Ei : i ∈ I}, where Ei = {x : x(i) = 1} for each i. (i) Let (A, ≤) be a lattice such that (α) A has a least element 0 and a greatest element 1 (β) for every a, b, c ∈ A, a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) and a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c) (γ) for every a ∈ A there is an a0 ∈ A such that a ∨ a0 = 1 and a ∧ a0 = 0. Show that there is a Boolean algebra structure on A for which ≤ agrees with ⊆ . 311Y Further exercises (a) Let A be a Boolean ring, and B the Boolean algebra constructed by the method of 311Xc. Show that the Stone space of B can be identified with the one-point compactification (3A3O) of the Stone space of A. (b) Let (A, ∨, ∧, 0, 1) be such that (i) (A, ∨) is a commutative semigroup with identity 0 (ii) (A, ∧) is a commutative semigroup with identity 1 (iii) a ∧ (b ∨ c) = (a ∧ b) ∨ (a ∧ c), a ∨ (b ∧ c) = (a ∨ b) ∧ (a ∨ c) for all a, b, c ∈ A (iv) a ∨ a = a ∧ a = a for every a ∈ A (v) for every a ∈ A there is an a0 ∈ A such that a ∨ a0 = 1, a ∧ a0 = 0. Show that there is a Boolean algebra structure on A for which ∨ = ∪ , ∧ = ∩ . 311 Notes and comments My aim in this section has been to get as quickly as possible to Stone’s theorem, since this is surely the best route to a picture of general Boolean algebras; they are isomorphic to algebras of sets. This means that all their elementary algebraic properties – indeed, all their first-order properties – can be effectively studied in the context of elementary set theory. In 311G-311H I describe a few of the ways in which the Stone representation suggests algebraic properties of Boolean algebras. You should not, however, come too readily to the conclusion that Boolean algebras will never be able to surprise you. In this book, in particular, we shall need to work a good deal with suprema and infima of infinite sets in Boolean algebras, for the ordering of 311H; and even though this corresponds to the ordering S ⊆ of ordinary sets, we find that (sup A)b is sufficiently different from a∈A b a to need new kinds of intuition.
312B
Homomorphisms
21
S (The point is that a∈A b a is an open set in the Stone space, but need not be compact if A is infinite, so may well be smaller than (sup A)b, even when sup A is defined in A.) There is also the fact that Stone’s theorem depends crucially on a fairly strong form of the axiom of choice (employed through Zorn’s Lemma in the argument of 311D). Of course I shall be using the axiom of choice without scruple throughout this volume. But it should be clear that such results as 312B-312C in the next section cannot possibly need the axiom of choice for their proofs, and that to use Stone’s theorem in such a context is slightly misleading. Nevertheless, it is so useful to be able to regard a Boolean algebra as an algebra of sets – especially when dealing with only finitely many elements of the algebra at a time – that henceforth I will almost always use the symbols 4 , ∩ for the addition and multiplication of a Boolean ring, and will use ∪ , \ , ⊆ without further comment, just as if I were considering ∪, \ and ⊆ in the Stone space. (In 311Gb I have given a definition of ‘disjointness’ in a Boolean algebra based on the same idea.) Even without the axiom of choice this approach can be justified, once we have observed that finitely-generated Boolean algebras are finite (311Xd), since relatively elementary methods show that any finite Boolean algebra is isomorphic to PX for some finite set X. I have taken a Boolean algebra to be a particular kind of commutative ring with identity. Of course there are other approaches. If we wish to think of the order relation as primary, then 311L and 311Xi are reasonably natural. Other descriptions can be based on a list of the properties of the binary operations ∪ , ∩ and the complementation operation a 7→ a0 = 1 \ a, as in 311Yb. I give extra space to 311L only because this is well adapted to an application in 352Q below.
312 Homomorphisms I continue the theory of Boolean algebras with a section on subalgebras, ideals and homomorphisms. From now on, I will relegate Boolean rings which are not algebras to the exercises; I think there is no need to set out descriptions of the trifling modifications necessary to deal with the extra generality. The first part of the section (312A-312K) concerns the translation of the basic concepts of ring theory into the language which I propose to use for Boolean algebras. 312L shows that the order relation on a Boolean algebra defines the algebraic structure, and in 312M-312N I give a fundamental result on the extension of homomorphisms. I end the section with results relating the previous ideas to the Stone representation of a Boolean algebra (312O-312S). 312A Subalgebras Let A be a Boolean algebra. I will use the phrase subalgebra of A to mean a subring of A containing its multiplicative identity 1 = 1A . 312B Proposition Let A be a Boolean algebra, and B a subset of A. Then the following are equiveridical, that is, if one is true so are the others: (i) B is a subalgebra of A; (ii) 0 ∈ B, a ∪ b ∈ B for all a, b ∈ B, and 1 \ a ∈ B for all a ∈ B; (iii) B 6= ∅, a ∩ b ∈ B for all a, b ∈ B, and 1 \ a ∈ B for all a ∈ B. proof (a)(i)⇒(iii) If B is a subalgebra of A, and a, b ∈ B, then of course we shall have 0, 1 ∈ B, so B 6= ∅, a ∩ b ∈ B,
1 \ a = 1 4 a ∈ B.
(b)(iii)⇒(ii) If (iii) is true, then there is some b0 ∈ B; now 1 \ b0 ∈ B, so 0 = b0 ∩ (1 \ b0 ) ∈ B. If a, b ∈ B, then a ∪ b = 1 \ ((1 \ a) ∩ (1 \ b)) ∈ B. So (ii) is true.
22
Boolean algebras
312B
(c)(ii)⇒(i) If (ii) is true, then for any a, b ∈ B, a ∩ b = 1 \ ((1 \ a) ∪ (1 \ b)) ∈ B, a 4 b = (a ∩ (1 \ b)) ∪ (b ∩ (1 \ a)) ∈ B, so (because also 0 ∈ B) B is a subring of A, and 1 = 1 \ 0 ∈ B, so B is a subalgebra. Remark Thus an algebra of subsets of a set X, as defined in 136E or 311Bb, is just a subalgebra of the Boolean algebra PX. 312C Ideals in Boolean algebras: Proposition If A is a Boolean algebra, a set I ⊆ A is an ideal of A iff 0 ∈ I, a ∪ b ∈ I for all a, b ∈ I, and a ∈ I whenever b ∈ I and a ⊆ b. proof (a) Suppose that I is an ideal. Then of course 0 ∈ I. If a, b ∈ I then a ∩ b ∈ I so a ∪ b = (a 4 b) 4 (a ∩ b) ∈ I. If b ∈ I and a ⊆ b then a = a ∩ b ∈ I. (b) Now suppose that I satisfies the conditions proposed. If a, b ∈ I then a4b ⊆ a∪b ∈ I so a 4 b ∈ I, while of course −a = a ∈ I, and also 0 ∈ I, by hypothesis; thus I is a subgroup of (A, 4). Finally, if a ∈ I and b ∈ A then a ∩ b ⊆ a ∈ I, so b ∩ a = a ∩ b ∈ I; thus I is an ideal. Remark Thus what I have called an ‘ideal of subsets of X’ in 232Xc is just an ideal in the Boolean algebra PX. 312D Principal ideals Of course, while an ideal I in a Boolean algebra A is necessarily a subring, it is not as a rule a subalgebra, except in the special case I = A. But if we say that a principal ideal of A is the ideal Aa generated by a single element a of A, we have a special phenomenon. 312E Proposition Let A be a Boolean algebra, and a any element of A. Then the principal ideal Aa of A generated by a is just {b : b ∈ A, b ⊆ a}, and (with the inherited operations ∩ ¹ Aa × Aa , 4 ¹ Aa × Aa ) is a Boolean algebra in its own right, with multiplicative identity a. proof b ⊆ a iff b ∩ a = a, so that Aa = {b : b ⊆ a} = {b ∩ a : b ∈ A} is an ideal of A, and of course it is the smallest ideal of A containing a. Being an ideal, it is a subring; the idempotent relation b ∩ b = b is inherited from A, so it is a Boolean ring; and a is plainly its multiplicative identity. 312F Boolean homomorphisms Now suppose that A and B are two Boolean algebras. I will use the phrase Boolean homomorphism to mean a function π : A → B which is a ring homomorphism (that is, π(a 4 b) = πa 4 πb, π(a ∩ b) = πa ∩ πb for all a, b ∈ A) which is uniferent, that is, π(1A ) = 1B . 312G Proposition Let A, B and C be Boolean algebras. (a) If π : A → B is a Boolean homomorphism, then π[A] is a subalgebra of B. (b) If π : A → B and θ : B → C are Boolean homomorphisms, then θπ : A → C is a Boolean homomorphism. (c) If π : A → B is a bijective Boolean homomorphism, then π −1 : B → A is a Boolean homomorphism. proof These are all immediate consequences of the corresponding results for ring homomorphisms (3A2D).
312K
Homomorphisms
23
312H Proposition Let A and B be Boolean algebras, and π : A → B a function. Then the following are equiveridical: (i) π is a Boolean homomorphism; (ii) π(a ∩ b) = πa ∩ πb and π(1A \ a) = 1B \ πa for all a, b ∈ A; (iii) π(a ∪ b) = πa ∪ πb and π(1A \ a) = 1B \ πa for all a, b ∈ A; (iv) π(a ∪ b) = πa ∪ πb and πa ∩ πb = 0B whenever a, b ∈ A and a ∩ b = 0A , and π(1A ) = 1B . proof (i)⇒(iv) If π is a Boolean homomorphism then of course π(1A ) = 1B ; also, given that a ∩ b = 0 in A, πa ∩ πb = π(a ∩ b) = π(0A ) = 0B , π(a ∪ b) = π(a 4 b) = πa 4 πb = πa ∪ πb. (iv)⇒(iii) Assume (iv), and take a, b ∈ A. Then πa = π(a ∩ b) ∪ π(a \ b),
πb = π(a ∩ b) ∪ π(b \ a),
so π(a ∪ b) = πa ∪ π(b \ a) = π(a ∩ b) ∪ π(a \ b) ∪ π(b \ a) = πa ∪ πb. Taking b = 1 \ a, we must have 1B = π(1A ) = πa ∪ π(1A \ a),
0B = πa ∩ π(1A \ a),
so π(1A \ a) = 1B \ πa. Thus (iii) is true. (iii)⇒(ii) If (iii) is true and a, b ∈ A, then π(a ∪ b) = π(1A \ ((1A \ a) ∩ (1A \ b))) = 1B \ ((1B \ πa) ∩ (1B \ πb))) = πa ∪ πb. So (ii) is true. (ii)⇒(i) If (ii) is true, then π(a 4 b) = π((1A \ ((1A \ a) ∩ (1A \ b)) ∩ (1A \ (a ∩ b))) = (1B \ ((1B \ πa) ∩ (1B \ πb)) ∩ (1B \ (πa ∩ πb))) = πa 4 πb for all a, b ∈ A, so π is a ring homomorphism; and now π(1A ) = π(1A \ 0A ) = 1B \ π(0A ) = 1B \ 0B = 1B , so that π is a Boolean homomorphism. 312I Proposition If A, B are Boolean algebras and π : A → B is a Boolean homomorphism, then πa ⊆ πb whenever a ⊆ b in A. proof a ⊆ b =⇒ a ∩ b = a =⇒ πa ∩ πb = πa =⇒ πa ⊆ πb. 312J Proposition Let A be a Boolean algebra, and a any member of A. Then the map b 7→ a ∩ b is a surjective Boolean homomorphism from A onto the principal ideal Aa generated by a. proof This is an elementary verification. 312K Quotient algebras: Proposition Let A be a Boolean algebra and I an ideal of A. Then the quotient ring A/I (3A2F) is a Boolean algebra, and the canonical map a 7→ a• : A → A/I is a Boolean homomorphism, so that (a 4 b)• = a• 4 b• , for all a, b ∈ A.
(a ∪ b)• = a• ∪ b• ,
(a ∩ b)• = a• ∩ b• ,
(a \ b)• = a• \ b•
24
Boolean algebras
312K
(b) The order relation on A/I is defined by the formula a• ⊆ b• ⇐⇒ a \ b ∈ I. For any a ∈ A, {u : u ⊆ a• } = {b• : b ⊆ a}. proof (a) Of course the map a 7→ a• = {a 4 b : b ∈ I} is a ring homomorphism (3A2F). Because (a• )2 = (a2 )• = a• for every a ∈ A, A/I is a Boolean ring; because 1• is a multiplicative identity, it is a Boolean algebra, and a 7→ a• is a Boolean homomorphism. The formulae given are now elementary. (b) We have a• ⊆ b• ⇐⇒ a• \ b• = 0 ⇐⇒ a \ b ∈ I. Now {u : u ⊆ a• } = {u ∩ a• : u ∈ A/I} = {(b ∩ a)• : b ∈ A} = {b• : b ⊆ a}. 312L The above results are both repetitive and nearly trivial. Now I come to something with a little more meat to it. Proposition If A and B are Boolean algebras and π : A → B is a bijection such that πa ⊆ πb whenever a ⊆ b, then π is a Boolean algebra isomorphism. proof (a) Because π is surjective, there must be c0 , c1 ∈ A such that πc0 = 0B , πc1 = 1B ; now π(0A ) ⊆ πc0 , πc1 ⊆ π(1A ), so we must have π(0A ) = 0B , π(1A ) = 1B . (b) If a ∈ A, then πa ∪ π(1A \ a) = 1B . P P There is a c ∈ A such that πc = 1B \ (πa ∪ π(1A \ a)). Now π(c ∩ a) ⊆ πc ∩ πa = 0B ,
π(c \ a) ⊆ πc ∩ π(1A \ a) = 0B ;
as π is injective, c ∩ a = c \ a = 0A and c = 0A , πc = 0B , πa ∪ π(1A \ a) = 1B . Q Q (c) If a ∈ A, then πa ∩ π(1A \ a) = 0B . P P It may be clear to you that this is just a dual form of (b). If not, I repeat the argument in the form now appropriate. There is a c ∈ A such that πc = 1B \ (πa ∩ π(1A \ a)). Now π(c ∪ a) ⊇ πc ∪ πa = 1B ,
π(c ∪ (1A \ a)) ⊇ πc ∪ π(1A \ a) = 1B ;
as π is injective, c ∪ a = c ∪ (1A \ a) = 1A and c = 1A , πc = 1B , πa ∩ π(1A \ a) = 0B . Q Q (d) Putting (b) and (c) together, we have π(1A \ a) = 1B \ πa for every a ∈ A. Now π(a ∪ b) = πa ∪ πb for every a, b ∈ A. P P Surely πa ∪ πb ⊆ π(a ∪ b). Let c ∈ A be such that πc = π(a ∪ b) \ (πa ∪ πb). Then π(c ∩ a) ⊆ πc ∩ πa = 0B ,
π(c ∩ b) ⊆ πc ∩ πb = 0B ,
so c ∩ a = c ∩ b = 0 and c ⊆ 1A \ (a ∪ b); accordingly πc ⊆ π(1A \ (a ∪ b)) = 1B \ π(a ∪ b); as also πc ⊆ π(a ∪ b), πc = 0B and π(a ∪ b) = πa ∪ πb. Q Q (e) So the conditions of 312H(iii) are satisfied and π is a Boolean homomorphism; being bijective, it is an isomorphism. 312M I turn next to a fundamental lemma on the construction of homomorphisms. We need to start with a proper description of a certain type of subalgebra. Lemma Let A be a Boolean algebra, and A0 a subalgebra of A; let c be any member of A. Then A1 = {(a ∩ c) ∪ (b \ c) : a, b ∈ A0 } is a subalgebra of A; it is the subalgebra of A generated by A0 ∪ {c}.
312N
Homomorphisms
25
proof We have to check the following: a = (a ∩ c) ∪ (a \ c) ∈ A1 for every a ∈ A0 , so A0 ⊆ A1 ; in particular, 0 ∈ A1 . 1 \ ((a ∩ c) ∪ (b \ c)) = ((1 \ a) ∩ c) ∪ ((1 \ b) \ c) ∈ A1 for all a, b ∈ A0 , so 1 \ d ∈ A1 for every d ∈ A1 . (a ∩ c) ∪ (b \ c) ∪ (a0 ∩ c) ∪ (b0 \ c) = ((a ∪ a0 ) ∩ c) ∪ ((b ∪ b0 ) \ c) ∈ A1 for all a, b, a0 , b0 ∈ A0 , so d ∪ d0 ∈ A1 for all d, d0 ∈ A1 . Thus A1 is a subalgebra of A (using 312B). c = (1 ∩ c) ∪ (0 \ c) ∈ A1 , so A1 includes A0 ∪ {c}; and finally it is clear that any subalgebra of A including A0 ∪ {c}, being closed under ∩ , ∪ and complementation, must include A1 , so that A1 is the subalgebra of A generated by A0 ∪ {c}. 312N Lemma Let A and B be Boolean algebras, A0 a subalgebra of A, π : A0 → B a Boolean homomorphism, and c ∈ A. If v ∈ B is such that πa ⊆ v ⊆ πb whenever a, b ∈ A0 and a ⊆ c ⊆ b, then there is a unique Boolean homomorphism π1 from the subalgebra A1 of A generated by A0 ∪ {c} such that π1 extends π and π1 c = v. proof (a) The basic fact we need to know is that if a, a0 , b, b0 ∈ A0 and (a ∩ c) ∪ (b \ c) = d = (a0 ∩ c) ∪ (b0 \ c), then (πa ∩ v) ∪ (πb \ v) = (πa0 ∩ v) ∪ (πb0 \ v). P P We have a ∩ c = d ∩ c = a0 ∩ c. Accordingly (a 4 a0 ) ∩ c = 0 and c ⊆ 1 \ (a 4 a0 ). Consequently (since a 4 a0 surely belongs to A0 ) v ⊆ π(1 \ (a 4 a0 )) = 1 \ (πa 4 πa0 ), and πa ∩ v = πa0 ∩ v. Similarly, b \ c = d \ c = b0 \ c, so (b 4 b0 ) \ c = 0,
b 4 b0 ⊆ c,
π(b 4 b0 ) ⊆ v
and πb \ v = πb0 \ v. Putting these together, we have the result. Q Q (b) Consequently, we have a function π1 defined by writing π1 ((a ∩ c) ∪ (b \ c)) = (πa ∩ v) ∪ (πb \ c) for all a, b ∈ A0 ; and 312M tells us that the domain of π1 is just A1 . Now π1 is a Boolean homomorphism. P P This amounts to running through the proof of 312M again. (i) If a, b ∈ A0 , then π1 (1 \ ((a ∩ c) ∪ (b \ c))) = π1 (((1 \ a) ∩ c) ∪ ((1 \ b) \ c)) = (π(1 \ a) ∩ v) ∪ (π(1 \ b) \ v) = ((1 \ πa) ∩ v) ∪ ((1 \ πb) \ v) = 1 \ ((πa ∩ v) ∪ (πb \ v)) = 1 \ π1 ((a ∩ c) ∪ (b \ c)).
26
Boolean algebras
312N
So π1 (1 \ d) = 1 \ π1 d for every d ∈ A1 . (ii) If a, b, a0 , b0 ∈ A0 , then π1 ((a ∩ c) ∪ (b \ c) ∪ (a0 ∩ c) ∪ (b0 \ c)) = π1 (((a ∪ a0 ) ∩ c) ∪ ((b ∪ b0 ) \ c)) = (π(a ∪ a0 ) ∩ v) ∪ (π(b ∪ b0 ) \ v) = ((πa ∪ πa0 ) ∩ v) ∪ ((πb ∪ πb0 ) \ v) = (πa ∩ v) ∪ (πb \ v) ∪ (πa0 ∩ v) ∪ (πb0 \ v) = π1 ((a ∩ c) ∪ (b \ c)) ∪ π1 ((a0 ∩ v) ∪ (b0 \ v)). So π1 (d ∪ d0 ) = π1 d ∪ π1 d0 for all d, d0 ∈ A1 . By 312H(iii), π1 is a Boolean homomorphism. Q Q (c) If a ∈ A0 , then π1 a = π1 ((a ∩ c) ∪ (a \ c)) = (πa ∩ v) ∪ (πa \ v) = πa, so π1 extends π. As for the action of π1 on c, π1 c = π1 ((1 ∩ c) ∪ (0 \ c)) = (π1 ∩ v) ∪ (π0 \ v) = (1 ∩ v) ∪ (0 \ v) = v, as required. (d) Finally, the formula of (b) is the only possible definition for any Boolean homomorphism from A1 to B which will extend π and take c to v. So π1 is unique. 312O Homomorphisms and Stone spaces Because the Stone space Z of a Boolean algebra A (311E) can be constructed explicitly from the algebraic structure of A, it must in principle be possible to describe any feature of the Boolean structure of A in terms of Z. In the next few paragraphs I work through the most important identifications. Proposition Let A be a Boolean algebra, and Z its Stone space; write b a ⊆ Z for the open-and-closed set corresponding to a ∈ A. Then there is a one-to-one correspondence between ideals I of A and open sets G ⊆ Z, given by the formulae S a, I = {a : b a ⊆ G}. G = a∈I b S a; then H(I) is a union of open subsets of Z, so is open. proof (a) For any ideal I C A, set H(I) = a∈I b For any open set G ⊆ Z, set J(G) = {a : a ∈ A, b a ⊆ G}; then J(G) satisfies the conditions of 312C, so is an ideal of A. (b) If I C A, then J(H(I)) = I. P P (i) If a ∈ I, then b a ⊆ H(I) so a ∈ J(H(I)). (ii) If a ∈ J(H(I)), then S b b a is compact and all the b are open, there must be finitely many b0 , . . . , bn ∈ I b a ⊆ H(I) = b∈I b. Because b such that b a ⊆ bb0 ∪ . . . ∪ bbn . But now a ⊆ b0 ∪ . . . ∪ bn ∈ I, so a ∈ I. Q Q (c) If G ⊆ Z is open, then H(J(G)) = G. P P (i) If z ∈ G, then (because {b a : a ∈ A} is a base for the topology of Z) there is an a ∈ A such that z ∈ b a ⊆ G; now a ∈ J(G) and z ∈ H(J(G)). (ii) If z ∈ H(J(G)), there is an a ∈ J(G) such that z ∈ b a; now b a ⊆ G, so z ∈ G. Q Q This shows that the maps G 7→ J(G), I 7→ H(I) are two halves of a one-to-one correspondence, as required. 312P Theorem Let A, B be Boolean algebras, with Stone spaces Z, W ; write b a ⊆ Z, bb ⊆ W for the open-and-closed sets corresponding to a ∈ A, b ∈ B. Then we have a one-to-one correspondence between Boolean homomorphisms π : A → B and continuous functions φ : W → Z, given by the formula πa = b ⇐⇒ φ−1 [b a] = bb. proof (a) Recall that I have constructed Z, W as the sets of Boolean homomorphisms from A, B to Z2 (311E). So if π : A → B is any Boolean homomorphism, and w ∈ W , ψπ (w) = wπ is a Boolean homomorphism from A to Z2 (312Gb), and belongs to Z. Now ψπ−1 [b a] = π ca for every a ∈ A. P P
312R
Homomorphisms
27
ψπ−1 [b a] = {w : ψπ (w) ∈ b a} = {w : wπ ∈ b a} = {w : wπ(a) = 1} = {w : w ∈ π ca}. Q Q S Consequently ψπ is continuous. P P Let G be any open subset of Z. Then G = {b a:b a ⊆ G}, so S S ψπ−1 [G] = {ψπ−1 [b a] : b a ⊆ G} = {c πa : b a ⊆ G} is open. As G is arbitrary, ψπ is continuous. Q Q (b) If φ : W → Z is continuous, then for any a ∈ A the set φ−1 [b a] must be an open-and-closed set in W ; consequently there is a unique member of B, call it θφ a, such that φ−1 [b a] = θd φ a. Observe that, for any w ∈ W and a ∈ A, w(θφ a) = 1 ⇐⇒ w ∈ θd a ⇐⇒ (φ(w))(a) = 1, φ a ⇐⇒ φ(w) ∈ b so φ(w) = wθφ . Now θφ is a Boolean homomorphism. P P (i) If a, b ∈ A then c θφ (a ∪ b)b = φ−1 [(a ∪ b)b] = φ−1 [b a ∪ bb] = φ−1 [b a] ∪ φ−1 [bb] = θd φ a ∪ θφ b = (θφ a ∪ θφ b)b, so θφ (a ∪ b) = θφ a ∪ θφ b. (ii) If a ∈ A, then θφ (1 \ a)b = φ−1 [(1 \ a)b] = φ−1 [Z \ b a] = W \ φ−1 [b a] = W \ θd φ a = (1 \ θφ a)b, so θφ (1 \ a) = 1 \ θφ a. (iii) By 312H, θφ is a Boolean homomorphism. Q Q (c) For any Boolean homomorphism π : A → B, π = θψπ . P P For a ∈ A, (θψπ a)b = ψπ−1 [b a] = π ca, so θψπ a = a. Q Q (d) For any continuous function φ : W → Z, φ = ψθφ . P P For any w ∈ W , ψθφ (w) = wθφ = φ(w). Q Q (e) Thus π 7→ ψπ , φ 7→ θφ are the two halves of a one-to-one correspondence, as required. 312Q Theorem Let A, B, C be Boolean algebras, with Stone spaces Z, W and V . Let π : A → B and θ : B → C be Boolean homomorphisms, with corresponding continuous functions φ : W → Z and ψ : V → W . Then the Boolean homomorphism θπ : A → C corresponds to the continuous function φψ : V → Z. proof For any a ∈ A, d = (θ(πa))b = ψ −1 [c θπa π a] = ψ −1 [φ−1 [b a]] = (φψ)−1 [b a].
312R Proposition Let A and B be Boolean algebras, with Stone spaces Z and W , and π : A → B a Boolean homomorphism, with associated continuous function φ : W → Z. Then (a) π is injective iff φ is surjective; (b) π is surjective iff φ is injective. proof (a) If a ∈ A, then b a ∩ φ[W ] = ∅ ⇐⇒ φ(w) ∈ /b a for every w ∈ W ⇐⇒ (φ(w))(a) = 0 for every w ∈ W ⇐⇒ w(πa) = 0 for every w ∈ W ⇐⇒ πa = 0. Now W is compact, so φ[W ] is also compact, therefore closed, and
28
Boolean algebras
312R
φ is not surjective ⇐⇒ Z \ φ[W ] 6= ∅ ⇐⇒ there is a non-zero a ∈ A such that b a ⊆ Z \ φ[W ] ⇐⇒ there is a non-zero a ∈ A such that πa = 0 ⇐⇒ π is not injective (3A2Db). (b)(i) If π is surjective and w, w0 are distinct members of W , then there is a b ∈ B such that w ∈ bb and w0 ∈ / bb. Now b = πa for some a ∈ A, so φ(w) ∈ b a and φ(w0 ) ∈ /b a, and φ(w) 6= φ(w0 ). As w and w0 are arbitrary, φ is injective. (ii) If φ is injective and b ∈ B,Sthen K = φ[bb], L = φ[W \ bb] are disjoint compact subsets of Z. Consider I = {a : a ∈ A, L ∩ b a = ∅}. Then a∈I b a = Z \ L ⊇ K. Because K is compact and every b a is open, there is a finite family a0 , . . . , an ∈ I such that K ⊆ b a0 ∪ . . . ∪ b an . Set a = a0 ∪ . . . ∪ an . Then b a=b a0 ∪ . . . ∪ b an includes K and is disjoint from L. So π ca = φ−1 [b a] includes bb and is disjoint from W \ bb; that is, π ca = bb and πa = b. As b is arbitrary, π is surjective. 312S Principal ideals If A is a Boolean algebra and a ∈ A, we have a natural surjective Boolean homomorphism b 7→ b ∩ a : A → Aa , the principal ideal generated by a (312J). Writing Z for the Stone space of A and Za for the Stone space of Aa , this homomorphism must correspond to an injective continuous function φ : Za → Z (312Rb). Because Za is compact and Z is Hausdorff, φ must be a homeomorphism between Za and its image φ[Za ] ⊆ Z (3A3Dd). To identify φ[Za ], note that it is compact, therefore closed, and that Z \ φ[Za ] = =
[ [
{bb : b ∈ A, bb ∩ φ[Za ] = ∅} [ {bb : φ−1 [bb] = ∅} = {bb : b ∩ a = 0} = Z \ b a,
so that φ[Za ] = b a. It is therefore natural to identify Za with the open-and-closed set b a ⊆ Z. 312X Basic exercises (a) Let A be a Boolean ring, and B a subset of A. Show that B is a subring of A iff 0 ∈ B and a ∪ b, a \ b ∈ B for all a, b ∈ B. (b) Let A be a Boolean algebra and B a subset of A. Show that B is a subalgebra of A iff 1 ∈ B and a \ b ∈ B for all a, b ∈ B. (c) Let A be a Boolean algebra. Suppose that I ⊆ A ⊆ A are such that 1 ∈ A, a ∩ b ∈ I for all a, b ∈ I and a \ b ∈ A whenever a, b ∈ A and b ⊆ a. Show that A includes the subalgebra of A generated by I. (Hint: 136Xf.) (d) Show that if A is a Boolean ring, a set I ⊆ A is an ideal of A iff 0 ∈ I, a ∪ b ∈ I for all a, b ∈ I, and a ∈ I whenever b ∈ I and a ⊆ b. (e) Let A and B be Boolean algebras, and φ : A → B a function such that (i) φ(a) ⊆ φ(b) whenever a ⊆ b (ii) φ(a) ∩ φ(b) = 0B whenever a ∩ b = 0A (iii) φ(a) ∪ φ(b) ∪ φ(c) = 1B whenever a ∪ b ∪ c = 1A . Show that φ is a Boolean homomorphism. (f ) Let A be a Boolean ring, and a any member of A. Show that the map b 7→ a∩b is a ring homomorphism from A onto the principal ideal Aa generated by a. (g) Let A1 and A2 be Boolean rings, and let B1 , B2 be the Boolean algebras constructed from them by the method of 311Xc. Show that any ring homomorphism from A1 to A2 has a unique extension to a Boolean homomorphism from B1 to B2 .
312 Notes
Homomorphisms
29
(h) Let A and B be Boolean rings, A0 a subalgebra of A, π : A0 → B a ring homomorphism, and c ∈ A. Show that if v ∈ B is such that πa \ v = πb ∩ v = 0 whenever a, b ∈ A0 and a \ c = b ∩ c = 0, then there is a unique ring homomorphism π1 from the subring A1 of A generated by A0 ∪ {c} such that π1 extends π0 and π1 c = v. (i) Let A be a Boolean ring, and Z its Stone space. Show that there S is a one-to-one correspondence between ideals I of A and open sets G ⊆ Z, given by the formulae G = a∈I b a, I = {a : b a ⊆ G}. (j) Let A be a Boolean algebra, and suppose that A is the subalgebra of itself generated by A0 ∪ {c}, where A0 is a subalgebra of A and c ∈ A. Let Z be the Stone space of A and Z0 the Stone space of A0 . Let ψ : Z → Z0 be the continuous surjection corresponding to the embedding of A0 in A. Show that ψ¹ b c and ψ¹Z \ b c are injective. Now let B be another Boolean algebra, with Stone space W , and π : A0 → B a Boolean homomorphism, with corresponding function φ : W → Z0 . Show that there is a continuous function φ1 : W → Z such that ψφ1 = φ iff there is an open-and-closed set V ⊆ W such that φ[V ] ⊆ ψ[b c] and φ[W \ V ] ⊆ ψ[Z \ b c]. (k) Let A be a Boolean algebra, with Stone space Z, and I an ideal of A, corresponding to an open set G ⊆ Z. Show that the Stone space of the quotient algebra A/I may be identified with Z \ G. 312Y Further exercises (a) Find a function φ : P{0, 1, 2} → Z2 such that φ(1 \ a) = 1 \ φa for every a ∈ P{0, 1, 2} and φ(a) ⊆ φ(b) whenever a ⊆ b, but φ is not a Boolean homomorphism. (b) Let A be the Boolean ring of finite subsets of N. Show that there is a bijection π : A → A such that πa ⊆ πb whenever a ⊆ b but π is not a ring homomorphism. (c) Let A, B be Boolean rings, with Stone spaces Z, W . Show that we have a one-to-one correspondence between ring homomorphisms π : A → B and continuous functions φ : H → Z, where H ⊆ W is an open set, such that φ−1 [K] is compact for every compact set K ⊆ Z, given by the formula πa = b ⇐⇒ φ−1 [b a] = bb. (d) Let A, B, C be Boolean rings, with Stone spaces Z, W and V . Let π : A → B and θ : B → C be ring homomorphisms, with corresponding continuous functions φ : H → Z and ψ : G → W . Show that the ring homomorphism θπ : A → C corresponds to the continuous function φψ : ψ −1 [H] → Z. (e) Let A and B be Boolean rings, with Stone spaces Z and W , and π : A → B a ring homomorphism, with associated continuous function φ : H → Z. Show that π is injective iff φ[H] is dense in Z, and that π is surjective iff φ is injective and H = W . (f ) Let A be a Boolean ring and a ∈ A. Show that the Stone space of the principal ideal Aa of A generated by a can be identified with the compact open set b a in the Stone space of A. Show that the identity map is a ring homomorphism from Aa to A, and corresponds to the identity function on b a. 312 Notes and comments The definitions of ‘subalgebra’ and ‘Boolean homomorphism’ (312A, 312F), like that of ‘Boolean algebra’, are a trifle arbitrary, but will be a convenient way of mandating appropriate treatment of multiplicative identities. I run through the work of 312A-312J essentially for completeness; once you are familiar with Boolean algebras, they should all seem obvious. 312L has a little bit more to it. It shows that the order structure of a Boolean algebra defines the ring structure, in a fairly strong sense. I call 312N a ‘lemma’, but actually it is the most important result in this section; it is the basic tool we have for extending a homomorphism from a subalgebra to a slightly larger one, and with Zorn’s Lemma (another ‘lemma’ which deserves a capital L) will provide us with general methods of constructing homomorphisms. In 312O-312S I describe the basic relationships between the Boolean homomorphisms and continuous functions on Stone spaces. 312P-312Q show that, in the language of category theory, the Stone representation provides a ‘contravariant functor’ from the category of Boolean algebras with Boolean homomorphisms to the category of topological spaces with continuous functions. Using 311I-311J, we know exactly which topological spaces appear, the zero-dimensional compact Hausdorff spaces; and we know also that the functor is faithful, that is, that we can recover Boolean algebras and homomorphisms from the corresponding topological spaces
30
Boolean algebras
312 Notes
and continuous functions. There is an agreeable duality in 312R. All of this can be done for Boolean rings, but there are some extra complications (312Yc-312Yf). To my mind, the very essence of the theory of Boolean algebras is the fact that they are abstract rings, but at the same time can be thought of ‘locally’ as algebras of sets. Consequently we can bring two quite separate kinds of intuition to bear. 312N gives an example of a ring-theoretic problem, concerning the extension of homomorphisms, which has a resolution in terms of the order relation, a concept most naturally described in terms of algebras-of-sets. It is very much a matter of taste and habit, but I myself find that a Boolean homomorphism is easiest to think of in terms of its action on finite subalgebras, which are directly representable as PX for some finite X (311Xe); the corresponding continuous map between Stone spaces is less helpful. I offer 312Xj, the Stone-space version of 312N, for you to test your own intuitions on.
313 Order-continuous homomorphisms Because a Boolean algebra has a natural partial order (311H), we have corresponding notions of upper bounds, lower bounds, suprema and infima. These are particularly important in the Boolean algebras arising in measure theory, and the infinitary operations ‘sup’ and ‘inf’ require rather more care than the basic binary operations ‘ ∪ ’, ‘ ∩ ’, because intuitions from elementary set theory are sometimes misleading. I therefore take a section to work through the most important properties of these operations, together with the homomorphisms which preserve them. 313A Relative complementation: Proposition Let A be a Boolean algebra, e a member of A, and A a non-empty subset of A. (a) If sup A is defined in A, then inf{e \ a : a ∈ A} is defined and equal to e \ sup A. (b) If inf A is defined in A, then sup{e \ a : a ∈ A} is defined and equal to e \ inf A. proof (a) Writing a0 for sup A, we have e \ a0 ⊆ e \ a for every a ∈ A, so e \ a0 is a lower bound for C = {e \ a : a ∈ A}. Now suppose that c is any lower bound for C. Then (because A is not empty) c ⊆ e, and a = (a \ e) ∪ (e \ (e \ a)) ⊆ (a0 \ e) ∪ (e \ c) for every a ∈ A. Consequently a0 ⊆ (a0 \ e) ∪ (e \ c) is disjoint from c and c = c ∩ e ⊆ e \ a0 . Accordingly e \ a0 is the greatest lower bound of C, as claimed. (b) This time set a0 = inf A, C = {e \ a : a ∈ A}. As before, e \ a0 is surely an upper bound for C. If c is any upper bound for C, then e \ c ⊆ e \ (e \ a) = e ∩ a ⊆ a for every a ∈ A, so e \ c ⊆ a0 and e \ a0 ⊆ c. As c is arbitrary, e \ a0 is indeed the least upper bound of C. Remark In the arguments above I repeatedly encourage you to treat ∩ , ∪ , \ , ⊆ as if they were the corresponding operations and relation of basic set theory. This is perfectly safe so long as we take care that every manipulation so justified has only finitely many elements of the Boolean algebra in hand at once. 313B General distributive laws: Proposition Let A be a Boolean algebra. (a) If e ∈ A and A ⊆ A is a non-empty set such that sup A is defined in A, then sup{e ∩ a : a ∈ A} is defined and equal to e ∩ sup A. (b) If e ∈ A and A ⊆ A is a non-empty set such that inf A is defined in A, then inf{e ∪ a : a ∈ A} is defined and equal to e ∪ inf A. (c) Suppose that A, B ⊆ A are non-empty and sup A, sup B are defined in A. Then sup{a ∩ b : a ∈ A, b ∈ B} is defined and is equal to sup A ∩ sup B. (d) Suppose that A, B ⊆ A are non-empty and inf A, inf B are defined in A. Then inf{a ∪ b : a ∈ A, b ∈ B} is defined and is equal to inf A ∪ inf B.
313C
Order-continuous homomorphisms
31
proof (a) Set B = {e \ a : a ∈ A}, C = {e \ b : b ∈ B} = {e ∩ a : a ∈ A}. Using 313A, we have inf B = e \ sup A,
sup C = e \ inf B = e ∩ sup A,
as required. (b) Set a0 = inf A, B = {e ∪ a : a ∈ A}. Then e ∪ a0 ⊆ e ∪ a for every a ∈ A, so e ∪ a0 is a lower bound for B. If c is any lower bound for B, then c \ e ⊆ a for every a ∈ A, so c \ e ⊆ a0 and c ⊆ e ∪ a0 ; thus e ∪ a0 is the greatest lower bound for B, as claimed. (c) By (a), we have a ∩ sup B = supb∈B a ∩ b for every a ∈ A, so supa∈A,b∈B a ∩ b = supa∈A (a ∩ sup B) = sup A ∩ sup B, using (a) again. (d) Similarly, using (b) twice, inf a∈A,b∈B a ∪ b = inf a∈A (a ∪ inf B) = inf A ∪ inf B. 313C As always, it is worth developing a representation of the concepts of sup and inf in terms of Stone spaces. Proposition Let A be a Boolean algebra, and Z its Stone space; for a ∈ A write b a for the corresponding open-and-closed subset of Z. S (a) If A ⊆ A and a0 ∈ A then a0 = sup A in A iff b a0 = a∈A b a. T a. (b) If A ⊆ A is non-empty and a0 ∈ A then a0 = inf A in A iff b a0 = int a∈A b T a is nowhere dense in Z. (c) If A ⊆ A is non-empty then inf A = 0 in A iff a∈A b proof (a) For any b ∈ A, b is an upper bound for A ⇐⇒ b a ⊆ bb for every a ∈ A [ [ ⇐⇒ b a ⊆ bb ⇐⇒ b a ⊆ bb a∈A
a∈A
S because bb is certainly closed in Z. It follows at once that if b a0 is actually equal to a∈A b a then a0 must be S S the least upper bound of A in A. On the other hand, if a0 = sup A, then a∈A b a⊆b a0 . ?? If b a0 6= a∈A b a, S then b a0 \ a∈A b a is a non-empty open set in Z, so includes bb for some non-zero b ∈ A; now b a⊆b a0 \ bb, so a ⊆ a0 \ b for every a ∈ A, and a0 \ b is an upper bound for A strictly less than a0 . X X Thus b a0 must be S exactly a∈A b a. (b) Take complements: setting a1 = 1 \ a0 , we have a0 = inf A ⇐⇒ a1 = sup 1 \ a a∈A
(by 313A) ⇐⇒ b a1 =
[ a∈A
⇐⇒ b a0 = Z \
Z \b a [ a∈A
(c) Since
T
a a∈A b
Z \b a = int
\
b a.
a∈A
is surely a closed set, it is nowhere dense iff it has empty interior, that is, iff 0 = inf A.
32
Boolean algebras
313D
313D I started the section with the results above because they are easily stated and of great importance. But I must now turn to some new definitions, and I think it may help to clarify the ideas involved if I give them in their own natural context, even though this is far more general than we have any immediate need for here. Definitions Let P be a partially ordered set and C a subset of P . (a) C is order-closed if sup A ∈ C whenever A is a non-empty upwards-directed subset of C such that sup A is defined in P , and inf A ∈ C whenever A is a non-empty downwards-directed subset of C such that inf A is defined in P . (b) C is sequentially order-closed if supn∈N pn ∈ C whenever hpn in∈N is a non-decreasing sequence in C such that supn∈N pn is defined in P , and inf n∈N pn ∈ C whenever hpn in∈N is a non-increasing sequence in C such that inf n∈N pn is defined in P . Remark I hope it is obvious that an order-closed set is sequentially order-closed. 313E Order-closed subalgebras and ideals Of course, in the very special cases of a subalgebra or ideal of a Boolean algebra, the concepts ‘order-closed’ and ‘sequentially order-closed’ have expressions simpler than those in 313D. I spell them out. (a) Let B be a subalgebra of a Boolean algebra A. (i) The following are equiveridical: (α) B is order-closed in A; (β) sup B ∈ B whenever B ⊆ B and sup B is defined in A; (β 0 ) inf B ∈ B whenever B ⊆ B and inf B is defined in A; (γ) sup B ∈ B whenever B ⊆ B is non-empty and upwards-directed and sup B is defined in A; (γ 0 ) inf B ∈ B whenever B ⊆ B is non-empty and downwards-directed and inf B is defined in A. P P Of course (β) ⇒ (γ). If (γ) is true and B ⊆ B is any set with a supremum in A, then B 0 = {0} ∪ {b0 ∪ . . . ∪ bn : b0 , . . . , bn ∈ B} is a non-empty upwards-directed set with the same upper bounds as B, so sup B = sup B 0 ∈ B. Thus (γ) ⇒ (β) and (β), (γ) are equiveridical. Next, if (β) is true and B ⊆ B is a set with an infimum in A, then B 0 = {1 \ b : b ∈ B} ⊆ B and sup B 0 = 1 \ inf B is defined, so sup B 0 and inf B belong to B . Thus (β) ⇒ (β 0 ). In the same way, (γ 0 ) ⇐⇒ (β 0 ) ⇒ (β) and (β), (β 0 ), (γ), (γ 0 ) are all equiveridical. But since we also have (α) ⇐⇒ (γ)&(γ 0 ), (α) is equiveridical with the others. Q Q Replacing the sets B above by sequences, the same arguments provide conditions for B to be sequentially order-closed, as follows.
A;
(ii) The following are equiveridical: (α) B is sequentially order-closed in A; (β) supn∈N bn ∈ B whenever hbn in∈N is a sequence in B and supn∈N bn is defined in A; (β 0 ) inf n∈N bn ∈ B whenever hbn in∈N is a sequence in B and inf n∈N bn is defined in A; (γ) supn∈N bn ∈ B whenever hbn in∈N is a non-decreasing sequence in B and supn∈N bn is defined in (γ 0 ) inf n∈N bn ∈ B whenever hbn in∈N is a non-increasing sequence in B and inf n∈N bn is defined in
A. (b) Now suppose that I is an ideal of A. Then if A ⊆ I is non-empty all lower bounds of A necessarily belong to I; so that I is order-closed iff sup A ∈ I whenever A ⊆ I is non-empty, upwards-directed and has a supremum in A; I is sequentially order-closed iff supn∈N an ∈ I whenever han in∈N is a non-decreasing sequence in I with a supremum in A. Moreover, because I is closed under ∪ , I is order-closed iff sup A ∈ I whenever A ⊆ I has a supremum in A; I is sequentially order-closed iff supn∈N an ∈ I whenever han in∈N is a sequence in I with a supremum in A.
313G
Order-continuous homomorphisms
33
(c) If A = PX is a power set, then a sequentially order-closed subalgebra of A is just a σ-algebra of sets, while a sequentially order-closed ideal of A is a what I have called a σ-ideal of sets (112Db). If A is itself a σ-algebra of sets, then a sequentially order-closed subalgebra of A is a ‘σ-subalgebra’ in the sense of 233A. Accordingly I will normally use the phrases σ-subalgebra, σ-ideal for sequentially order-closed subalgebras and ideals of Boolean algebras. 313F Order-closures and generated sets (a) It is an immediate consequence of the definitions that T (i) if S is any non-empty family of subalgebras of a Boolean algebra A, then S is a subalgebra T of A; (ii) if F is any non-empty family of order-closed subsets of a partially ordered set P , then F is an order-closed subset of P ; T (iii) if F is any non-empty family of sequentially order-closed subsets of a partially ordered set P , then F is a sequentially order-closed subset of P . (b) Consequently, given any Boolean algebra A and a subset B of A, we have a smallest subalgebra B of A including B, being the intersection of all the subalgebras of A which include B; a smallest σ-subalgebra Bσ of A including B, being the intersection of all the σ-subalgebras of A which include B; and a smallest order-closed subalgebra Bτ of A including B, being the intersection of all the order-closed subalgebras of A which include B. We call B, Bσ and Bτ the subalgebra, σ-subalgebra and order-closed subalgebra generated by B. (I shall return to this in 331E.) (c) If A is a Boolean algebra and B any subalgebra of A, then the smallest order-closed subset B of A which includes B is again a subalgebra of A (so is the order-closed subalgebra of A generated by B). P P (i) The set {b : 1 \ b ∈ B} is order-closed (use 313A) and includes B, so includes B; thus 1 \ b ∈ B for every b ∈ B. (ii) If c ∈ B, the set {b : b ∪ c ∈ B} is order-closed (use 313Bb) and includes B, so includes B; thus b ∪ c ∈ B whenever b ∈ B and c ∈ B. (iii) If c ∈ B, the set {b : b ∪ c ∈ B} is order-closed and includes B (by (ii)), so includes B; thus b ∪ c ∈ B whenever b, c ∈ B. (iv) By 312B, B is a subalgebra of A. Q Q 313G This is a convenient moment at which to spell out an abstract version of the Monotone Class Theorem (136B). Lemma Let A be a Boolean algebra. (a) Suppose that 1 ∈ I ⊆ A ⊆ A and that a ∩ b ∈ I for all a, b ∈ I, b \ a ∈ A whenever a, b ∈ A and a ⊆ b. Then A includes the subalgebra of A generated by I. (b) If moreover supn∈N an ∈ A for every non-decreasing sequence han in∈N in A with a supremum in A, then A includes the σ-subalgebra of A generated by I. (c) And if sup C ∈ A whenever C ⊆ A is an upwards-directed set with a supremum in A, then A includes the order-closed subalgebra of A generated by I. proof (a)(i) Let P be the family of all sets J such that IS⊆ J ⊆ A and a ∩ b ∈ J for all a, b ∈ J. Then I ∈ P and if Q ⊆ P is upwards-directed and not empty, Q ∈ P. By Zorn’s Lemma, P has a maximal element B. (ii) Now B = {c : c ∈ A, c ∩ b ∈ A for every b ∈ B}. P P If c ∈ B, then of course c ∩ b ∈ B ⊆ A for every b ∈ B, because B ∈ P. If c ∈ A \ B, consider J = B ∪ {c ∩ b : b ∈ B}. Then c = c ∩ 1 ∈ J so J properly includes B and cannot belong to P. On the other hand, if b1 , b2 ∈ B, b1 ∩ b2 ∈ B ⊆ J,
(c ∩ b1 ) ∩ b2 = b1 ∩ (c ∩ b2 ) = (c ∩ b1 ) ∩ (c ∩ b2 ) = c ∩ (b1 ∩ b2 ) ∈ J,
so c1 ∩ c2 ∈ J for all c1 , c2 ∈ J; and of course I ⊆ B ⊆ J. So J cannot be a subset of A, and there must be a b ∈ B such that c ∩ b ∈ / A. Q Q
34
Boolean algebras
313G
(iii) Consequently c \ b ∈ B whenever b, c ∈ B and b ⊆ c. P P If a ∈ B, then b ∩ a, c ∩ a ∈ B ⊆ A and b ∩ a ⊆ c ∩ a, so (c \ b) ∩ a = (c ∩ a) \ (b ∩ a) ∈ A by the hypothesis on A. By (ii), c \ b ∈ B. Q Q (iv) It follows that B is a subalgebra of A. P P If b ∈ B, then b ⊆ 1 ∈ I ⊆ B, so 1 \ b ∈ B. If a, b ∈ B, then a ∪ b = 1 \ ((1 \ a) ∩ (1 \ b)) ∈ B. 0 = 1 \ 1 ∈ B, so that the conditions of 312B(ii) are satisfied. Q Q Now the subalgebra of A generated by I is included in B and therefore in A, as required. (b) Now suppose that supn∈N an belongs to A whenever han in∈N is a non-decreasing sequence in A with a supremum in A. Then B, as defined in part (a) of the proof, is a σ-subalgebra of A. P P Let hbn in∈N be a non-decreasing sequence in B with a supremum c in A. Then for any b ∈ B, hbn ∩ bin∈N is a non-decreasing sequence in A with a supremum c ∩ b in A (313Ba). So c ∩ b ∈ A. As b is arbitrary, c ∈ B, by the criterion in (a-ii) above. As hbn in∈N is arbitrary, B is a σ-subalgebra, by 313Ea. Q Q Accordingly the σ-subalgebra of A generated by I is included in B and therefore in A. (c) Finally, if sup C ∈ A whenever C is a non-empty upwards-directed subset of A with a least upper bound in A, B is order-closed. P P Let C ⊆ B be a non-empty upwards-directed set with a supremum c in A. Then for any b ∈ B, {c ∩ b : c ∈ C} is a non-empty upwards-directed set in A with supremum c ∩ b in A. So c ∩ b ∈ A. As b is arbitrary, c ∈ B. As C is arbitrary, B is order-closed in A. Q Q Accordingly the order-closed subalgebra of A generated by I is included in B and therefore in A. 313H Definitions It is worth distinguishing various types of supremum- and infimum-preserving function. Once again, I do this in almost the widest possible context. Let P and Q be two partially ordered sets, and φ : P → Q an order-preserving function, that is, a function such that φ(p) ≤ φ(q) in Q whenever p ≤ q in P . (a) I say that φ is order-continuous if (i) φ(sup A) = supp∈A φ(p) whenever A is a non-empty upwardsdirected subset of P and sup A is defined in P (ii) φ(inf A) = inf p∈A φ(p) whenever A is a non-empty downwards-directed subset of P and inf A is defined in P . (b) I say that φ is sequentially order-continuous or σ-order-continuous if (i) φ(p) = supn∈N φ(pn ) whenever hpn in∈N is a non-decreasing sequence in P and p = supn∈N pn in P (ii) φ(p) = inf n∈N φ(pn ) whenever hpn in∈N is a non-increasing sequence in P and p = inf n∈N pn in P . Remark You may feel that one of the equivalent formulations in Proposition 313Lb gives a clearer idea of what is really being demanded of φ in the ordinary cases we shall be looking at. 313I Proposition Let P , Q and R be partially ordered sets, and φ : P → Q, ψ : Q → R order-preserving functions. (a) ψφ : P → R is order-preserving. (b) If φ and ψ are order-continuous, so is ψφ. (c) If φ and ψ are sequentially order-continuous, so is ψφ. (d) φ is order-continuous iff φ−1 [B] is order-closed for every order-closed B ⊆ Q. proof (a)-(c) I think the only point that needs remarking is that if A ⊆ P is upwards-directed, then φ[A] ⊆ Q is upwards-directed, because φ is order-preserving. So if sup A is defined in P and φ, ψ are order-continuous, we shall have ψ(φ(sup A)) = ψ(sup φ[A]) = sup ψ[φ[A]]. (d)(i) Suppose that φ is order-continuous and that B ⊆ Q is order-closed. Let A ⊆ φ−1 [B] be a nonempty upwards-directed set with supremum p ∈ P . Then φ[A] ⊆ B is non-empty and upwards-directed, because φ is order-preserving, and φ(p) = sup φ[A] because φ is order-continuous. Because B is order-closed,
313L
Order-continuous homomorphisms
35
φ(p) ∈ B and p ∈ φ−1 [B]. Similarly, if A ⊆ φ−1 [B] is non-empty and downwards-directed, and inf A is defined in P , then φ(inf A) = inf φ[A] ∈ B and inf A ∈ φ−1 [B]. Thus φ−1 [B] is order-closed; as B is arbitrary, φ satisfies the condition. (ii) Now suppose that φ−1 [B] is order-closed in P whenever B ⊆ Q is order-closed in Q. Let A ⊆ P be a non-empty upwards-directed subset of P with a supremum p ∈ P . Then φ(p) is an upper bound of φ[A]. Let q be any upper bound of φ[A] in Q. Consider B = {r : r ≤ q}; then B ⊆ Q is upwards-directed and order-closed, so φ−1 [B] is order-closed. Also A ⊆ φ−1 [B] is non-empty and upwards-directed and has supremum p, so p ∈ φ−1 [B] and φ(p) ∈ B, that is, φ(p) ≤ q. As q is arbitrary, φ(p) = sup φ[A]. Similarly, φ(inf A) = inf φ[A] whenever A ⊆ P is non-empty, downwards-directed and has an infimum in P ; so φ is order-continuous. 313J
It is useful to introduce here the following notion.
Definition Let A be a Boolean algebra. A set D ⊆ A is order-dense if for every non-zero a ∈ A there is a non-zero d ∈ D such that d ⊆ a. Remark Many authors use the simple word ‘dense’ where I have insisted on the phrase ‘order-dense’. In the work of this treatise it will be important to distinguish clearly between this concept of ‘dense’ set and the topological concept (2A3U); typically, in those contexts in which both appear, an order-dense set can be in some sense much smaller than a topologically dense set. 313K Lemma If A is a Boolean algebra and D ⊆ A is order-dense, then for any a ∈ A there is a disjoint C ⊆ D such that sup C = a; in particular, a = sup{d : d ∈ D, d ⊆ a} and there is a partition of unity C ⊆ D. proof Set Da = {d : d ∈ D, d ⊆ a}. Applying Zorn’s lemma to the family C of disjoint sets C ⊆ Da , we have a maximal C ∈ C. Now if b ∈ A and b 6⊇ a, there is a d ∈ D such that 0 6= d ⊆ a \ b. Because C is maximal, there must be a c ∈ C such that c ∩ d 6= 0, so that c 6⊆ b. Turning this round, any upper bound of C must include a, so that a = sup C. It follows at once that a = sup Da . Taking a = 1 we obtain a partition of unity included in D. 313L Proposition Let A and B be Boolean algebras and π : A → B a Boolean homomorphism. (a) π is order-preserving. (b) The following are equiveridical: (i) π is order-continuous; (ii) whenever A ⊆ A is non-empty and downwards-directed and inf A = 0 in A, then inf π[A] = 0 in B; (iii) whenever A ⊆ A is non-empty and upwards-directed and sup A = 1 in A, then sup π[A] = 1 in B; (iv) whenever A ⊆ A and sup A is defined in A, then π(sup A) = sup π[A] in B; (v) whenever A ⊆ A and inf A is defined in A, then π(inf A) = inf π[A] in B; (vi) whenever C ⊆ A is a partition of unity, then π[C] is a partition of unity in B. (c) The following are equiveridical: (i) π is sequentially order-continuous; (ii) whenever han in∈N is a non-increasing sequence in A and inf n∈N an = 0 in A, then inf n∈N πan = 0 in B; (iii) whenever A ⊆ A is countable and sup A is defined in A, then π(sup A) = sup π[A] in B; (iv) whenever A ⊆ A is countable and inf A is defined in A, then π(inf A) = inf π[A] in B; (v) whenever C ⊆ A is a countable partition of unity, then π[C] is a partition of unity in B. proof (a) This is 312I. (b)(i)⇒(ii) is trivial, as π0 = 0. (ii)⇒(iv) Assume (ii), and let A be any subset of A such that c = sup A is defined in A. If A = ∅, then c = 0 and sup π[A] = 0 = πc. Otherwise, set A0 = {a0 ∪ . . . ∪ an : a0 , . . . , an ∈ A},
C = {c \ a : a ∈ A0 }.
36
Boolean algebras
313L
Then A0 is upwards-directed and has the same upper bounds as A, so c = sup A0 and 0 = inf C, by 313Aa. Also C is downwards-directed, so inf π[C] = 0 in B. But now π[C] = {πc \ πa : a ∈ A0 } = {πc \ b : b ∈ π[A0 ]}, π[A0 ] = {πa0 ∪ . . . ∪ πan : a0 , . . . , an ∈ A} = {b0 ∪ . . . ∪ bn : b0 , . . . , bn ∈ π[A]}, because π is a Boolean homomorphism. Again using 313Aa and the fact that b ⊆ πc for every b ∈ π[A0 ], we get πc = sup π[A0 ] = sup π[A]. As A is arbitrary, (iv) is satisfied. (iv)⇒(v) If A ⊆ A and c = inf A is defined in A, then 1 \ c = supa∈A 1 \ a, so πc = 1 \ π(1 \ c) = 1 \ supa∈A π(1 \ a) = inf a∈A 1 \ π(1 \ a) = inf a∈A πa. (v)⇒(ii) is trivial, because π0 = 0. (iv)⇒(iii) is similarly trivial. (iii)⇒(vi) Assume (iii), and let C be a partition of unity in A. Then C 0 = {c0 ∪ . . . ∪ cn : c0 , . . . , cn ∈ C} is upwards-directed and has supremum 1, so sup π[C 0 ] = 1. But (because π is a Boolean homomorphism) π[C] and π[C 0 ] have the same upper bounds, so sup π[C] = 1, as required. (vi)⇒(ii) Assume (vi), and let A ⊆ A be a set with infimum 0. Set D = {d : d ∈ A, ∃ a ∈ A, d ∩ a = 0}. Then D is order-dense in A. P P If e ∈ A \ {0}, then there is an a ∈ A such that e 6⊆ a, so that e \ a is a non-zero member of D included in e. Q Q Consequently there is a partition of unity C ⊆ D, by 313K. But now if b is any lower bound for π[A] in B, we must have b ∩ πd = 0 for every d ∈ D, so πc ⊆ 1 \ b for every c ∈ C, and 1 \ b = 1, b = 0. Thus inf π[A] = 0. As A is arbitrary, (ii) is satisfied. (v)&(iv)⇒(i) is trivial. (c) We can use nearly identical arguments, remembering only to interpolate the word ‘countable’ from time to time. I spell out the new version of (ii)⇒(iii), even though it requires no more than an adaptation of the language. Assume (ii), and let A be a countable subset of A with a supremum c ∈ A. If A = ∅, then c = 0 so πc = 0 = sup π[A]. Otherwise, let han in∈N be a sequence running over A; set a0n = a0 ∪ . . . ∪ an and cn = c \ a0n for each n. Then ha0n in∈N is non-decreasing, with supremum c, and hcn in∈N is non-increasing, with infimum 0; so inf n∈N πcn = 0 and supn∈N πan = supn∈N πa0n = πc. For (v)⇒(ii), however, a different idea is involved. Assume (v), and suppose that han in∈N is a nonincreasing sequence in A with infimum 0. Set c0 = 1 \ a0 , cn = an−1 \ an for n ≥ 1; then C = {cn : n ∈ N} is a partition of unity in A (because if c ∩ cn = 0 for every n, then c ⊆ an for every n), so π[C] is a partition of unity in B. Now if b ≤ πan for every n, b ∩ πcn for every n, so b = 0; thus inf n∈N πan = 0. As han in∈N is arbitrary, (ii) is satisfied. 313M out.
The following result is perfectly elementary, but it will save a moment later on to have it spelt
Lemma Let A and B be Boolean algebras and π : A → B an order-continuous Boolean homomorphism. (a) If D is an order-closed subalgebra of B, then π −1 [D] is an order-closed subalgebra of A. (b) If C is the order-closed subalgebra of A generated by C ⊆ A, then the order-closed subalgebra D of B generated by π[C] includes π[C]. (c) Now suppose that π is surjective and that C ⊆ A is such that the order-closed subalgebra of A generated by C is A itself. Then the order-closed subalgebra of B generated by π[C] is B. proof (a) Setting C = π −1 [D]: if a, a0 ∈ C then π(a ∩ b) = πa ∩ πb, π(a 4 a0 ) = πa 4 πa0 ∈ D, so a ∩ a0 , a 4 a0 ∈ C; π1 = 1 ∈ D so 1 ∈ C; thus C is a subalgebra of A. By 313Id, C is order-closed.
313R
Order-continuous homomorphisms
37
(b) By (a), π −1 [D] is an order-closed subalgebra of A. It includes C so includes C, and π[C] ⊆ D. (c) In the language of (b), we have C = A, so D must be B. 313N Definition The phrase regular embedding is sometimes used to mean an injective ordercontinuous Boolean homomorphism; a subalgebra B of a Boolean algebra A is said to be regularly embedded in A if the identity map from B to A is order-continuous, that is, if whenever b ∈ B is the supremum (in B) of B ⊆ B, then b is also the supremum in A of B; and similarly for infima. One important case is when B is order-dense (313O); another is in 314G-314H below. 313O Proposition Let A be a Boolean algebra and B an order-dense subalgebra of A. Then B is regularly embedded in A. In particular, if B ⊆ B and c ∈ B then c = sup B in B iff c = sup B in A. proof I have to show that the identity homomorphism ι : B → A is order-continuous. ?? Suppose, if possible, otherwise. By 313L(b-ii), there is a non-empty set B ⊆ B such that inf B = 0 in B but B = ι[B] has a non-zero lower bound a ∈ A. In this case, however (because B is order-dense) there is a non-zero d ∈ B with d ⊆ a, in which case d is a non-zero lower bound for B in B. X X 313P The most important use of these ideas to us concerns quotient algebras (313Q); I approach by means of a superficially more general result. Theorem Let A and B be Boolean algebras and π : A → B a Boolean homomorphism with kernel I. (a)(i) If π is order-continuous then I is order-closed. (ii) If π[A] is regularly embedded in B and I is order-closed then π is order-continuous. (b)(i) If π is sequentially order-continuous then I is a σ-ideal. (ii) If π[A] is regularly embedded in B and I is a σ-ideal then π is sequentially order-continuous. proof (a)(i) If A ⊆ I is upwards-directed and has a supremum c ∈ A, then πc = sup π[A] = 0, so c ∈ I. As remarked in 313Eb, this shows that I is order-closed. (ii) We are supposing that the identity map from π[A] to B is order-continuous, so it will be enough to show that π is order-continuous when regarded as a map from A to π[A]. Suppose that A ⊆ A is non-empty and downwards-directed and that inf A = 0. ?? Suppose, if possible, that 0 is not the greatest lower bound of π[A] in π[A]. Then there is a c ∈ A such that 0 6= πc ⊆ πa for every a ∈ A. Now π(c \ a) = πc \ πa = 0 for every a ∈ A, so c \ a ∈ I for every a ∈ A. The set C = {c \ a : a ∈ A} is upwards-directed and has supremum c; because I is order-closed, c = sup C ∈ I, and πc = 0, contradicting the specification of c. X X Thus inf π[A] = 0 in either π[A] or B. As A is arbitrary, π is order-continuous, by the criterion (ii) of 313Lb. (b) Argue in the same way, replacing each set A by a sequence. 313Q Corollary Let A be a Boolean algebra and I an ideal of A; write π for the canonical map from A to A/I. (a) π is order-continuous iff I is order-closed. (b) π is sequentially order-continuous iff I is a σ-ideal. proof π[A] = A/I is surely regularly embedded in A/I. 313R For order-continuous homomorphisms, at least, there is an elegant characterization in terms of Stone spaces. Proposition Let A and B be Boolean algebras, and π : A → B a Boolean homomorphism. Let Z and W be their Stone spaces, and φ : W → Z the corresponding continuous function (312P). Then the following are equiveridical: (i) π is order-continuous; (ii) φ−1 [M ] is nowhere dense in W for every nowhere dense set M ⊆ Z; (iii) int φ[H] 6= ∅ for every non-empty open set H ⊆ W .
38
Boolean algebras
313R
proof (a)(i)⇒(iii) Suppose that π is order-continuous. ?? Suppose, if possible, that H ⊆ W is a non-empty open set and int φ[H] = ∅. Let b ∈ B \ {0} be such that bb ⊆ H. Then φ[bb] has empty interior; but also it S is a closed set, so its complement is dense. Set A = {a : a ∈ A, b a ∩ φ[bb] = ∅}. Then a∈A b a = Z \ φ[bb] is a dense open set, so sup A = 1 in A (313Ca). Because π is order-continuous, sup π[A] = 1 in B (313L(b-iii)), and there is an a ∈ A such that πa ∩ b 6= 0. But this means that bb ∩ φ−1 [b a] 6= ∅ and φ[bb] ∩ b a 6= ∅, contrary to the definition of A. X X Thus there is no such set H, and (iii) is true. (b)(iii)⇒(ii) Now assume (iii). If M ⊆ Z is nowhere dense, set N = φ−1 [M ], so that N ⊆ W is a closed set. If H = int N , then int φ[H] ⊆ int M = ∅, so (iii) tells us that H is empty; thus N and φ−1 [M ] are nowhere dense, as required by (ii). T (c)(ii)⇒(i) Assume (ii), and let A ⊆ A be a non-empty set such that inf A = 0 in A. Then M = a∈A b a −1 has empty interior in Z (313Cb), so (being closed) is nowhere dense, and φ [M ] is also nowhere dense. If b ∈ B \ {0}, then T −1 bb 6⊆ φ−1 [M ] = T [b a] = a∈A π ca, a∈A φ so b is not a lower bound for π[A]. This shows that inf π[A] = 0 in B. As A is arbitrary, π is order-continuous (313L(b-ii)). 313X Basic exercises (a) Use 313C to give alternative proofs of 313A and 313B. (b) Let P be a partially ordered set. Show that there is a topology on P for which the closed sets are just the order-closed sets. (c) Let P be a partially ordered set, Q ⊆ P an order-closed set, and R a subset of Q which is order-closed in Q when Q is given the partial ordering induced by that of P . Show that R is order-closed in P . > (d) Let A be a Boolean algebra. Suppose that 1 ∈ I ⊆ A and that a ∩ b ∈ I for all a, b ∈ I. (i) Let B be the intersection of all those subsets A of A such that I ⊆ A and b \ a ∈ A whenever a, b ∈ A and a ⊆ b. Show that B is a subalgebra of A. (ii) Let Bσ be the intersection of all those subsets A of A such that I ⊆ A, b \ a ∈ A whenever a, b ∈ A and a ⊆ b and supn∈N bn ∈ A whenever hbn in∈N is a non-decreasing sequence in A with a supremum in A. Show that Bσ is a σ-subalgebra of A. (iii) Let Bτ be the intersection of all those subsets A of A such that I ⊆ A, b \ a ∈ A whenever a, b ∈ A and a ⊆ b and sup B ∈ A whenever B is a non-empty upwards-directed subset of A with a supremum in A. Show that Bτ is an order-closed subalgebra of A. (iv) Hence give a proof of 313G not relying on Zorn’s Lemma or any other use of the axiom of choice. (e) Let A be a Boolean algebra, and B a subalgebra of A. Let Bσ be the smallest sequentially order-closed subset of A including B. Show that Bσ is a subalgebra of A. > (f ) Let X be a set, and A a subset of PX. Show that A is an order-closed subalgebra of PX iff it is of the form {f −1 [F ] : F ⊆ Y } for some set Y , function f : X → Y . (g) Let P and Q be partially ordered sets, and φ : P → Q an order-preserving function. Show that φ is sequentially order-continuous iff φ−1 [C] is sequentially order-closed in A for every sequentially order-closed C ⊆ B. (h) For partially ordered sets P and Q, let us call a function φ : P → Q monotonic if it is either order-preserving or order-reversing. State and prove definitions and results corresponding to 313H, 313I and 313Xg for general monotonic functions. >(i) Let A be a Boolean algebra. Show that the operations (a, b) 7→ a ∪ b and (a, b) 7→ a ∩ b are ordercontinuous operations from A×A to A, if we give A×A the product partial order, saying that (a, b) ≤ (a0 , b0 ) iff a ⊆ a0 and b ⊆ b0 .
313Yf
Order-continuous homomorphisms
39
(j) Let A be a Boolean algebra. Show that if a subalgebra of A is order-dense then it is dense in the topology of 313Xb. > (k) Let A be a Boolean algebra and A ⊆ A any disjoint set. Show that there is a partition of unity in A including A. > (l) Let A, B be Boolean algebras and π1 , π2 : A → B two order-continuous Boolean homomorphisms. Show that {a : π1 a = π2 a} is an order-closed subalgebra of A. (m) Let A and B be Boolean algebras and π1 , π2 : A → B two Boolean homomorphisms. Suppose that π1 and π2 agree on some order-dense subset of A, and that one of them is order-continuous. Show that they are equal. (Hint: if π1 is order-continuous, π2 a ⊇ π1 a for every a.) (n) Let A and B be Boolean algebras, A0 an order-dense subalgebra of A, and π : A → B a Boolean homomorphism. Show that π is order-continuous iff π¹ A0 : A0 → B is order-continuous. > (o) Let A be a Boolean algebra. For A ⊆ A set A⊥ = {b : a ∩ b = 0 ∀ a ∈ A}. (i) Show that A⊥ is an order-closed ideal of A. (ii) Show that a set A ⊆ A is an order-closed ideal of A iff A = A⊥⊥ . (iii) Show that if I ⊆ A is an order-closed ideal then {a• : a ∈ I ⊥ } is an order-dense ideal in the quotient algebra A/I. (p) Let A and B be Boolean algebras, with Stone spaces Z and W ; let π : A → B be a Boolean homomorphism, and φ : W → Z the corresponding continuous function. Show that the following are equiveridical: (i) π is order-continuous; (ii) int φ−1 [F ] = φ−1 [int F ] for every closed F ⊆ Z (iii) φ−1 [G] = φ−1 [G] for every open G ⊆ Z. 313Y Further exercises (a) Prove 313A-313C for general Boolean rings. (b) Let A and B be Boolean algebras, with Stone spaces Z and W , and π : A → B a Boolean homomorphism, with associated continuous function φ : W → Z. Show that π is sequentially order-continuous iff φ−1 [M ] is nowhere dense for every nowhere dense zero set M ⊆ Z. (c) Let P be any partially ordered set, and let T be the topology of 313Xb. (i) Show that a sequence hpn in∈N in P is T-convergent to p ∈ P iff every subsequence of hpn in∈N has a monotonic sub-subsequence with supremum or infimum equal to p. (ii) Show that a subset A of P is sequentially order-closed, in the sense of 313Db, iff the T-limit of any T-convergent sequence in A belongs to A. (iii) Suppose that A is an upwards-directed subset of P with supremum p0 ∈ P . For a ∈ A set Fa = {p : a ≤ p ∈ A}, and let F be the filter on P generated by {Fa : a ∈ A}. Show that F → p0 for T. (iv) Show that if Q is another partially ordered set, endowed with a topology S in the same way, then a monotonic function φ : P → Q is order-continuous iff it is continuous for the topologies T and S, and is sequentially order-continuous iff it is sequentially continuous for these topologies. (d) Let U be a Banach lattice (242G, 354Ab). Show that its norm is order-continuous in the sense of 242Yc (or 354Dc) iff its restriction to {u : u ≥ 0} is order-continuous in the sense of 313Ha. (e) Let A and B be Boolean algebras with Stone spaces Z and W respectively, π : A → B a Boolean homomorphism and φ : W → Z the corresponding continuous function. Show that π[A] is order-dense in B iff φ is irreducible, that is, φ[F ] 6= φ[W ] for any proper closed subset F of W . (f ) Let A and B be Boolean algebras with Stone spaces Z and W respectively, π : A → B a Boolean homomorphism and φ : W → Z the corresponding continuous function. Show that the following are equiveridical: (i) π is injective and order-continuous; (ii) for M ⊆ Z, M is nowhere dense iff φ−1 [M ] is nowhere dense.
40
Boolean algebras
313 Notes
313 Notes and comments I give ‘elementary’ proofs of 313A-313B because I believe that they help to exhibit the relevant aspects of the structure of Boolean algebras; but various abbreviations are possible, notably if we allow ourselves to use the Stone representation (313Xa). 313A and 313Ba-b can be expressed by saying that the Boolean operations ∪ , ∩ and \ are (separately) order-continuous. Of course, \ is orderreversing, rather than order-preserving, in the second variable; but the natural symmetry in the concept of partial order means that the ideas behind 313H-313I can be applied equally well to order-reversing functions (313Xh). In fact, ∪ and ∩ can be regarded as order-continuous functions on the product space (313Bc-d, 313Xi). Clearly 313Bc-d can be extended into forms valid for any finite sequence A0 , . . . , An of subsets of A in place of A, B. But if we seek to go to infinitely many subsets of A we find ourselves saying something new; see 316G-316J below. Proposition 313C, and its companions 313R, 313Xp and 313Yb, are worth studying not only as a useful technique, but S also in order to understand the difference between sup A, where A is a set in a Boolean algebra, and A, where A is a family of sets. Somehow sup A can be larger, and inf A smaller, than one’s first intuition might suggest, corresponding to the fact that not every subset of the Stone space corresponds to an element of the Boolean algebra. I should like to use the words ‘order-closed’ and ‘sequentially order-closed’ to mean closed, or sequentially closed, for some more or less canonical topology. The difficulty is that while a great many topologies can be defined from a partial order (one is described in 313Xb and 313Yc, and another in 367Yc), none of them has such pre-eminence that it can be called ‘the’ order-topology. Accordingly there is a degree of arbitrariness in the language I use here. Nevertheless (sequentially) order-closed subalgebras and ideals are of such importance that they seem to deserve a concise denotation. The same remarks apply to (sequential) ordercontinuity. Concerning the term ‘order-dense’ in 313J, this has little to do with density in any topological sense, but the word ‘dense’, at least, is established in this context. With all these definitions, there is a good deal of scope for possible interrelations. The most important to us is 313Q, which will be used repeatedly (typically, with A an algebra of sets), but I think it is worth having the expanded version in 313P available. I take the opportunity to present an abstract form of an important lemma on σ-algebras generated by families closed under ∩ (136B, 313Gb). This time round I use the Zorn’s Lemma argument in the text and suggest the alternative, ‘elementary’ method in the exercises (313Xd). The two methods are opposing extremes in the sense that the Zorn’s Lemma argument looks for maximal subalgebras included in A (which are not unique, and have to be picked out using the axiom of choice) and the other approach seeks minimal subalgebras including I (which are uniquely defined, and can be described without the axiom of choice). Note that the concept of ‘order-closed’ algebra of sets is not particularly useful; there are too few orderclosed subalgebras of PX and they are of too simple a form (313Xf). It is in abstract Boolean algebras that the idea becomes important. In the most important partially ordered sets of measure theory, the sequentially order-closed sets are the same as the order-closed sets (see, for instance, 316Fb below), and most of the important order-closed subalgebras dealt with in this chapter can be thought of as σ-subalgebras which are order-closed because they happen to lie in the right kind of algebra.
314 Order-completeness The results of §313 are valid in all Boolean algebras, but of course are of most value when many suprema and infima exist. I now set out the most useful definitions which guarantee the existence of suprema and infima (314A) and work through their elementary relationships with the concepts introduced so far (314C314J). I then embark on the principal theorems concerning order-complete Boolean algebras: the extension theorem for homomorphisms to a Dedekind complete algebra (314K), the Loomis-Sikorski representation of a Dedekind σ-complete algebra as a quotient of a σ-algebra of sets (314M), the characterization of Dedekind complete algebras in terms of their Stone spaces (314S), and the idea of ‘Dedekind completion’ of a Boolean algebra (314T-314U). On the way I describe ‘regular open algebras’ (314O-314Q).
314Be
Order-completeness
41
314A Definitions Let P be a partially ordered set. (a) P is Dedekind complete, or order-complete, or conditionally complete if every non-empty subset of P with an upper bound has a least upper bound. (b) P is Dedekind σ-complete, or σ-order-complete, if (i) every countable non-empty subset of P with an upper bound has a least upper bound (ii) every countable non-empty subset of P with a lower bound has a greatest lower bound. 314B Remarks (a) I give these definitions in the widest possible generality because they are in fact of great interest for general partially ordered sets, even though for the moment we shall be concerned only with Boolean algebras. Indeed I have already presented the same idea in the context of Riesz spaces (241F). (b) You will observe that the definition in (a) of 314A is asymmetric, unlike that in (b). This is because the inverted form of the definition is equivalent to that given; that is, P is Dedekind complete (on the definition 314Aa) iff every non-empty subset of P with a lower bound has a greatest lower bound. P P (i) Suppose that P is Dedekind complete, and that B ⊆ P is non-empty and bounded below. Let A be the set of lower bounds for B. Then A has at least one upper bound (since any member of B is an upper bound for A) and is not empty; so a0 = sup A is defined. Now if b ∈ B, b is an upper bound for A, so a0 ≤ b; thus a0 ∈ A and must be the greatest member of A, that is, the greatest lower bound of B. (ii) Similarly, if every non-empty subset of P with a lower bound has a greatest lower bound, P is Dedekind complete. Q Q (c) In the special case of Boolean algebras, we do not need both halves of the definition 314Ab; in fact we have, for any Boolean algebra A, A is Dedekind σ-complete ⇐⇒ every non-empty countable subset of A has a least upper bound ⇐⇒ every non-empty countable subset of A has a greatest lower bound. P P Because A has a least element 0 and a greatest element 1, every subset of A has upper and lower bounds; so the two one-sided conditions together are equivalent to saying that A is Dedekind σ-complete. I therefore have to show that they are equiveridical. Now if A ⊆ A is a non-empty countable set, so is B = {1 \ a : a ∈ A}, and inf A = 1 \ sup B,
sup A = 1 \ inf B
whenever the right-hand-sides are defined (313A). So if the existence of a supremum (resp. infimum) of B is guaranteed, so is the existence of an infimum (resp. supremum) of A. Q Q The real point here is of course that (A, ⊆ ) is isomorphic to (A, ⊇ ). (d) Most specialists in Boolean algebra speak of ‘complete’, or ‘σ-complete’, Boolean algebras. I prefer the longer phrases ‘Dedekind complete’ and ‘Dedekind σ-complete’ because we shall be studying metrics on Boolean algebras and shall need the notion of metric completeness as well as that of order-completeness. (e) I have had to make some rather arbitrary choices in the definition here. The principal examples of partially ordered set to which we shall apply these definitions are Boolean algebras and Riesz spaces, which are all lattices. Consequently it is not possible to distinguish in these contexts between the property of Dedekind completeness, as defined above, and the weaker property, which we might call ‘monotone ordercompleteness’, (i) whenever A ⊆ P is non-empty, upwards-directed and bounded above then A has a least upper bound in P (ii) whenever A ⊆ P is non-empty, downwards-directed and bounded below then A has a greatest lower bound in P . (See 314Xa below. ‘Monotone order-completeness’ is the property involved in 314Ya, for instance.) Nevertheless I am prepared to say, on the basis of my own experience of working with other partially ordered sets, that ‘Dedekind completeness’, as I have defined it, is at least of sufficient importance to deserve a name. Note that it does not imply that P is a lattice, since it allows two elements of P to have no common upper bound.
42
Boolean algebras
314Bf
(f ) The phrase complete lattice is sometimes used to mean a Dedekind complete lattice with greatest and least elements; equivalently, a Dedekind complete partially ordered set with greatest and least elements. Thus a Dedekind complete Boolean algebra is a complete lattice in this sense, but R is not. (g) The most important Dedekind complete Boolean algebras (at least from the point of view of measure theory) are the ‘measure algebras’ of the next chapter. I shall not pause here to give other examples, but will proceed directly with the general theory. 314C Proposition Let A be a Dedekind σ-complete Boolean algebra and I a σ-ideal of A. Then the quotient Boolean algebra A/I is Dedekind σ-complete. proof I use the description in 314Bc. Let B ⊆ A/I be a non-empty countable set. For each u ∈ B, choose an au ∈ A such that u = a•u = au + I. Then c = supu∈B au is defined in A; consider v = c• in A/I. Because the map a 7→ a• is sequentially order-continuous (313Qb), v = sup B. As B is arbitrary, A/I is Dedekind σ-complete. 314D Corollary Let X be a set, Σ a σ-algebra of subsets of X, and I a σ-ideal of subsets of X. Then Σ ∩ I is a σ-ideal of the Boolean algebra Σ, and Σ/Σ ∩ I is Dedekind σ-complete. S proof Of course Σ is Dedekind σ-complete, because if hEn in∈N is any sequence in Σ then n∈N En is the least upper bound of {En : n ∈ N} in Σ. It is also easy to see that Σ ∩ I is a σ-ideal of Σ, since S F ∩ n∈N En ∈ I whenever F ∈ Σ and hEn in∈N is a sequence in Σ ∩ I. So 314C gives the result. 314E Proposition Let A be a Boolean algebra. (a) If A is Dedekind complete, then all its order-closed subalgebras and principal ideals are Dedekind complete. (b) If A is Dedekind σ-complete, then all its σ-subalgebras and principal ideals are Dedekind σ-complete. proof All we need to note is that if C is either an order-closed subalgebra or a principal ideal of A, and B ⊆ C is such that b = sup B is defined in A, then b ∈ C (see 313E(a-i-β)), so b is still the supremum of B in C; while the same is true if C is a σ-subalgebra and B ⊆ C is countable, using 313E(a-ii-β). 314F I spell out some further connexions between the concepts ‘order-closed set’, ‘order-continuous function’ and ‘Dedekind complete Boolean algebra’ which are elementary without being quite transparent. Proposition Let A and B be Boolean algebras and π : A → B a Boolean homomorphism. (a)(i) If A is Dedekind complete and π is order-continuous, then π[A] is order-closed in B. (ii) If B is Dedekind complete and π is injective and π[A] is order-closed then π is order-continuous. (b)(i) If A is Dedekind σ-complete and π is sequentially order-continuous, then π[A] is a σ-subalgebra of B. (ii) If B is Dedekind σ-complete and π is injective and π[A] is a σ-subalgebra of B then π is sequentially order-continuous. proof (a)(i) If B ⊆ π[A], then a0 = sup(π −1 [B]) is defined in A; now πa0 = sup(π[π −1 [B]]) = sup B in B (313L(b-iv)), and of course πa0 ∈ π[A]. By 313E(a-i-β) again, this is enough to show that π[A] is order-closed in B. (ii) Suppose that A ⊆ A and inf A = 0 in A. Then π[A] has an infimum b0 in B, which belongs to π[A] because π[A] is an order-closed subalgebra of B (313E(a-i-β 0 )). Now if a0 ∈ A is such that πa0 = b0 , we have π(a ∩ a0 ) = πa ∩ πa0 = πa for every a ∈ A, so (because π is injective) a ∩ a0 = a0 and a0 ⊆ a for every a ∈ A. But this means that a0 = 0 and b0 = π0 = 0. As A is arbitrary, π is order-continuous (313L(b-ii)). (b) Use the same arguments, but with sequences in place of the sets B, A above.
314J
Order-completeness
43
314G Corollary (a) If A is a Dedekind complete Boolean algebra and B is an order-closed subalgebra of A, then B is regularly embedded in A (definition: 313N). (b) Let A be a Dedekind complete Boolean algebra, B a Boolean algebra and π : A → B an ordercontinuous Boolean homomorphism. If C ⊆ A and C is the order-closed subalgebra of A generated by C, then π[C] is the order-closed subalgebra of B generated by π[C]. proof (a) Apply 314F(a-ii) to the identity map from B to A. (b) Let D be the order-closed subalgebra of B generated by π[C]. By 313Mb, π[C] ⊆ D. On the other hand, the identity homomorphism ι : C → A is order-continuous, by (a), so πι : C → B is order-continuous, and π[C] = πι[C] is order-closed in B, by 314F(a-i). But since π[C] is surely included in π[C], D is also included in π[C]. Accordingly π[C] = D, as claimed. 314H Corollary Let A be a Boolean algebra and B a subalgebra of A. (a) If A is Dedekind complete, then B is order-closed iff it is Dedekind complete in itself and is regularly embedded in A. (b) If A is Dedekind σ-complete, then B is a σ-subalgebra iff it is Dedekind σ-complete in itself and the identity map from B to A is sequentially order-continuous. proof Put 314E and 314F together. 314I Corollary (a) If A is a Boolean algebra and B is an order-dense subalgebra of A which is Dedekind complete in itself, then B = A. (b) If A is a Dedekind complete Boolean algebra, B is a Boolean algebra, π : A → B is an injective Boolean homomorphism and π[A] is order-dense in B, then π is an isomorphism. proof (a) Being order-dense, B is regularly embedded in A (313O), so this is a special case of 314Ha. (b) Because π[A] is order-dense, it is regularly embedded in B; also, the kernel of π is {0}, which is surely order-closed in A, so 313P(a-ii) tells us that π is order-continuous. By 314F(a-i), π[A] is order-closed in B; being order-dense, it must be the whole of B (313K). Thus π is surjective; being injective, it is an isomorphism. 314J When we come to applications of the extension procedure in 312N, the following will sometimes be needed. Lemma Let A be a Boolean algebra and A0 a subalgebra of A. Take any c ∈ A, and set A1 = {(a ∩ c) ∪ (b \ c) : a, b ∈ A0 }, the subalgebra of A generated by A0 ∪ {c} (312M). (a) Suppose that A is Dedekind complete. If A0 is order-closed in A, so is A1 . (b) Suppose that A is Dedekind σ-complete. If A0 is a σ-subalgebra of A, so is A1 . proof (a) Let D be any subset of A1 . Set E = {e : e ∈ A, there is some d ∈ D such that e ⊆ d}, A = {a : a ∈ A0 , a ∩ c ∈ E}, ∗
B = {b : b ∈ A0 , b \ c ∈ E}.
∗
Because A is Dedekind complete, a = sup A and b = sup B are defined in A; because A0 is order-closed, both belong to A0 , so d∗ = (a∗ ∩ c) ∪ (b∗ \ c) belongs to A1 . Now if d ∈ D, it is expressible as (a ∩ c) ∪ (b \ c) for some a, b ∈ A0 ; since a ∈ A and b ∈ B, we have a ⊆ a∗ and b ⊆ b∗ , so d ⊆ d∗ . Thus d∗ is an upper bound for D. On the other hand, if d0 is any other upper bound for D in A, it is also an upper bound for E, so we must have a∗ ∩ c = supa∈A a ∩ c ⊆ d0 ,
b∗ \ c = supb∈B b \ c ⊆ d0 ,
and d∗ ⊆ d0 . Thus d∗ = sup D. This shows that the supremum of any subset of A1 belongs to A1 , so that A1 is order-closed. (b) The argument is the same, except that we replace D by a sequence hdn in∈N , and A, B by sequences han in∈N , hbn in∈N in A0 such that dn = (an ∩ c) ∪ (bn \ c) for every n.
44
Boolean algebras
314K
314K Extension of homomorphisms The following is one of the most striking properties of Dedekind complete Boolean algebras. Theorem Let A be a Boolean algebra and B a Dedekind complete Boolean algebra. Let A0 be a Boolean subalgebra of A and π0 : A0 → B a Boolean homomorphism. Then there is a Boolean homomorphism π1 : A → B extending π0 . proof (a) Let P be the set of all Boolean homomorphisms π such that dom π is a Boolean subalgebra of A including A0 and π extends π0 . Identify each member of P with its graph, which is a subset of A × B, and order P by inclusion, so that π ⊆ θ means just that θ extends π. Then any non-empty totally ordered subset Q of P has an upper bound in P . P P Let π ∗ be the simple union of these graphs. (i) If (a, b) and 0 ∗ (a, b ) both belong to π , then there are π, π 0 ∈ Q such that πa = b, π 0 a = b0 ; now either π ⊆ π 0 or π 0 ⊆ π; in either case, θ = π ∪ π 0 ∈ Q, so that b = πa = θa = π 0 a = b0 . This shows that π ∗ is a function. (ii) Because Q 6= ∅, dom π0 ⊆ dom π ⊆ dom π ∗ for some π ∈ Q; thus π ∗ extends π0 (and, in particular, 0 ∈ dom π ∗ ). (iii) Now suppose that a, a0 ∈ dom(π ∗ ). Then there are π, π 0 ∈ Q such that a ∈ dom π, a0 ∈ dom π 0 ; once again, θ = π ∪π 0 ∈ Q, so that a, a0 ∈ dom θ, and a ∩ a0 ∈ dom θ ⊆ dom π ∗ ,
1 \ a ∈ dom θ ⊆ dom π ∗ ,
π ∗ (a ∩ a0 ) = θ(a ∩ a0 ) = θa ∩ θa0 = π ∗ a ∩ π ∗ a0 , π ∗ (1 \ a) = θ(1 \ a) = 1 \ θa = 1 \ π ∗ a. (iv) This shows that dom π ∗ is a subalgebra of A and that π ∗ is a Boolean homomorphism, that is, that π ∗ ∈ P ; and of course π ∗ is an upper bound for Q in P . Q Q (b) By Zorn’s Lemma, P has a maximal element π1 say. ?? Suppose, if possible, that A1 = dom π1 is not the whole of A; take c ∈ A \ A1 . Set A = {a : a ∈ A1 , a ⊆ c}. Because B is Dedekind complete, d = sup π1 [A] is defined in B. If a0 ∈ A and c ⊆ a0 , then of course a ⊆ a0 and π1 a ⊆ π1 a0 whenever a ∈ A, so that π1 a0 is an upper bound for π1 [A], and d ⊆ π1 a0 . But this means that there is an extension of π1 to a Boolean homomorphism π on the Boolean subalgebra of A generated by A1 ∪ {c} (312N). And this π must be a member of P properly extending π1 , which is supposed to be maximal. X X Thus dom π1 = A and π1 is an extension of π0 to A, as required. 314L The Loomis-Sikorski representation of a Dedekind σ-complete Boolean algebra The construction in 314D is not only the commonest way in which new Dedekind σ-complete Boolean algebras appear, but is adequate to describe them all. I start with an elementary general fact. Lemma Let X be any topological space, and write M for the family of meager subsets of X. Then M is a σ-ideal of subsets of X. proof The point is that if A ⊆ X is nowhere dense, so is every subset of A; this is obvious, since if B ⊆ A then B ⊆ A so int B ⊆ int A = ∅. So if B ⊆ A ∈ M, let hAn in∈N be a sequence of nowhere dense sets with union A; then hB ∩ An in∈N is a sequence of nowhere dense sets with union B, so B ∈ M. If hAn in∈N is a sequence in M with union A, then for each n we may choose a sequence hAnm im∈N of nowhere dense sets with union An ; then the countable family hAnm in,m∈N may be re-indexed as a sequence of nowhere dense sets with union A, so A ∈ M. Finally, ∅ is nowhere dense, so belongs to M. 314M Theorem Let A be a Dedekind σ-complete Boolean algebra, and Z its Stone space. Let E be the algebra of open-and-closed subsets of Z, and M the σ-ideal of meager subsets of Z. Then Σ = {E4A : E ∈ E, A ∈ M} is a σ-algebra of subsets of Z, M is a σ-ideal of Σ, and A is isomorphic, as Boolean algebra, to Σ/M.
314P
Order-completeness
45
proof (a) I start by showing that Σ is a σ-algebra. P P Of course ∅ = ∅4∅ ∈ Σ. If F ∈ Σ, express it as E4A where E ∈ E, A ∈ M; then Z \ F = (Z \ E)4A ∈ Σ. If hFn in∈N is a sequence in Σ, express each Fn as En 4An , where En ∈ E and An ∈ M. Now each En is expressible as b an , where an ∈ A. Because A is Dedekind σ-complete, a = supn∈N an is defined in A. Set S S E =b a ∈ E. By 313Ca, E = n∈N ESn , so the closed set E \ n∈N En has empty interior and is nowhere dense. Accordingly, setting A = E4 n∈N Fn , we have S S A ⊆ (E \ n∈N En ) ∪ n∈N An ∈ M, S so that n∈N Fn = E4A ∈ Σ. Thus Σ is closed under countable unions and is a σ-algebra. Q Q Evidently M ⊆ Σ, because ∅ ∈ E. (b) For each F ∈ Σ, there is exactly one E ∈ E such that F 4E ∈ M. P P There is surely some E ∈ E such that F is expressible as E4A where A ∈ M, so that F 4E = A ∈ M. If E 0 is any other member of E, then E 0 4E is a non-empty open set in X, while E 0 4E ⊆ A ∪ (F 4E 0 ); by Baire’s theorem for compact Hausdorff spaces (3A3G), A ∪ (F 4E 0 ) ∈ / M and F 4E 0 ∈ / M. Thus E is unique. Q Q (c) Consequently the maps E 7→ E • : E → Σ/M and a 7→ b a• : A → Σ/M are bijections. But since they are also Boolean homomorphisms, they are isomorphisms, and A ∼ = Σ/M, as claimed. 314N Corollary A Boolean algebra A is Dedekind σ-complete iff it is isomorphic to a quotient Σ/I where Σ is a σ-algebra of sets and I is a σ-ideal of Σ. proof Put 314D and 314M together. 314O Regular open algebras For Boolean algebras which are Dedekind complete in the full sense, there is another general method of representing them, which leads to further very interesting ideas. Definition Let X be a topological space. A regular open set in X is an open set G ⊆ X such that G = int G. Note that if F ⊆ X is any closed set, then G = int F is a regular open set, because G ⊆ G ⊆ F so G ⊆ int G ⊆ int F = G and G = int G. 314P Theorem Let X be any topological space, and write G for the set of regular open sets in X. Then G is a Dedekind complete Boolean algebra, with 1G = X and 0G = ∅, and with Boolean operations given by G 4G H = int G4H,
G ∩G H = G ∩ H,
G ∪G H = int G ∪ H,
with Boolean ordering given by G ⊆ G H ⇐⇒ G ⊆ H, and with suprema and infima given by sup H = int
S
H,
inf H = int
T
H = int
for all non-empty H ⊆ G. Remark I use the expressions ∩G
∪G
4G
\G
⊆G
in case the distinction between ∩
∪
4
\
⊆
∪
4
\
⊆
and ∩
is insufficiently marked.
T
H
G \G H = G \ H,
46
Boolean algebras
314P
proof I base the proof on the study of an auxiliary algebra of sets which involves some of the ideas already used in 314M. (a) Let I be the family of nowhere dense subsets of X. Then I is an ideal of subsets of X. P P Of course ∅ ∈ I. If A ⊆ B ∈ I then int A ⊆ int B = ∅. If A, B ∈ I and G is a non-empty open set, then G \ A is a non-empty open set and (G \ A) \ B is non-empty; accordingly G cannot be a subset of A ∪ B = A ∪ B. This shows that int A ∪ B = ∅, so that A ∪ B ∈ I. Q Q (b) For any set A ⊆ X, write ∂A for the boundary of A, that is, A \ int A. Set Σ = {E : E ⊆ X, ∂E ∈ I}. The Σ is an algebra of subsets of X. P P (i) ∂∅ = ∅ ∈ I so ∅ ∈ Σ. (ii) If A, B ⊆ X, then A ∪ B = A ∪ B, while int(A ∪ B) ⊇ int A ∪ int B; so ∂(A ∪ B) ⊆ ∂A ∪ ∂B. So if E, F ∈ Σ, ∂(E ∪ F ) ⊆ ∂E ∪ ∂F ∈ I and E ∪ F ∈ Σ. (iii) If A ⊆ X, then ∂(X \ A) = X \ A \ int(X \ A) = (X \ int A) \ (X \ A) = A \ int A = ∂A. So if E ∈ Σ, ∂(X \ E) = ∂E ∈ I and X \ E ∈ Σ. Q Q If A ∈ I, then of course ∂A = A ∈ I, so A ∈ Σ; accordingly I is an ideal in the Boolean algebra Σ, and we can form the quotient Σ/I. It will be helpful to note that every open set belongs to Σ, since if G is open then ∂G = G \ G cannot include any non-empty open set (since any open set meeting G must meet G). (c) For each E ∈ Σ, set VE = int E; then VE is the unique member of G such that E4VE ∈ I. P P (i) Being the interior of a closed set, VE ∈ G. Since int E ⊆ VE ⊆ E, E4VE ⊆ ∂E ∈ I. (ii) If G ∈ G is such that E4G ∈ I, then G \ VE ⊆ G \ VE ⊆ (G4E) ∪ (VE 4E) ∈ I, so G \ VE , being open, must be actually empty, and G ⊆ VE ; but this means that G ⊆ int VE = VE . Similarly, VE ⊆ G and VE = G. This shows that VE is unique. Q Q (d) It follows that the map G 7→ G• : G → Σ/I is a bijection, and we have a Boolean algebra structure on G defined by the Boolean algebra structure of Σ/I. What this means is that for each of the binary Boolean operations ∩G , 4G , ∪G , \G and for G, H ∈ G we must have G∗G H = int G ∗ H, writing ∗G for the operation on the algebra G and ∗ for the corresponding operation on Σ or PX. (e) Before working through the identifications, it will be helpful to observe that if H is any non-empty T T T subset of G, then int H = int H. P P Set G = int H. For every H ∈ H, G ⊆ H so G ⊆ int H = H; thus T T G ⊆ int H ⊆ int H = G, T T so G = int H. Q Q Consequently int H, being the interior of a closed set, belongs to G. (f )(i) If G, H ∈ G then their intersection in the algebra G is G ∩G H = int G ∩ H = int(G ∩ H) = G ∩ H, using (d) for the first equality and (e) for the second. (ii) Of course X ∈ G and X • = 1Σ/I , so X = 1G . (iii) If G ∈ G then its complement 1G \G G in G is int X \ G = int(X \ G) = X \ G. (iv) If G, H ∈ G, then the relative complement in G is G \G H = G ∩G (1G \G H) = G ∩ (X \ H) = G \ H = int(G \ H). (v) If G, H ∈ G, then G ∪G H = int G ∪ H and G 4G H = int G4H, by the remarks in (d). (g) We must note that for G, H ∈ G, G ⊆ G H ⇐⇒ G ∩G H = G ⇐⇒ G ∩ H = G ⇐⇒ G ⊆ H;
*314R
Order-completeness
47
that is, the ordering of the Boolean algebra G is just the partial ordering induced on G by the Boolean ordering ⊆ of PX or Σ. T S (h) If H is any non-empty subset of G, consider G0 = int H and G1 = int H. G0 = inf H in G. P P By (e), G0 ∈ G. Of course G0 ⊆ H for every H ∈ H, T so G0 is a lower bound for H. If G T is any lower bound for H in G, then G ⊆ H for every H ∈ H, so G ⊆ H; but also G is open, so G ⊆ int H = G0 . Thus G0 is the greatest lower bound for H. Q Q G1 = sup H in G. P P Being the interior of a closed set, G1 ∈ G, and of course S H = int H ⊆ int H = G1 for every H ∈ H, so G1 is an upper bound for H in G. If G is any upper bound for H in G, then S G = int G ⊇ int H = G1 ; thus G1 is the least upper bound for H in G. Q Q This shows that every non-empty H ⊆ G has a supremum and an infimum in G; consequently G is Dedekind complete, and the proof is finished. 314Q Remarks (a) G is called the regular open algebra of the topological space X. (b) Note that the map E 7→ VE : Σ → G of part (c) of the proof above is a Boolean homomorphism, if G is given its Boolean algebra structure. Its kernel is of course I; the induced map E • → 7 VE : Σ/I → G is just the inverse of the isomorphism G 7→ G• : G → Σ/I. *314R
I interpolate a lemma corresponding to 313R.
Lemma Let X and Y be topological spaces, and f : X → Y a continuous function such that f −1 [M ] is nowhere dense in X for every nowhere dense M ⊆ Y . Then we have an order-continuous Boolean homomorphism π from the regular open algebra RO(Y ) of Y to the regular open algebra RO(X) of X defined by setting πH = int f −1 [H] for every H ∈ RO(Y ). proof (a) By the remark in 314O, the formula for πH always defines a member of RO(X); and of course π is order-preserving. Observe that if H ∈ RO(Y ), then f −1 [H] is open, so f −1 [H] ⊆ πH. It will be convenient to note straight away that if V ⊆ Y is a dense open set then f −1 [V ] is dense in X. P P M = Y \ V is nowhere dense, so f −1 [M ] is nowhere dense and its complement f −1 [V ] is dense. Q Q (b) If H1 , H2 ∈ RO(Y ) then π(H1 ∩ H2 ) = πH1 ∩ πH2 . P P Because π is order-preserving, π(H1 ∩ H2 ) ⊆ πH1 ∩ πH2 . ?? Suppose, if possible, that they are not equal. Then (because π(H1 ∩ H2 ) is a regular open set) G = πH1 ∩ πH2 \ π(H1 ∩ H2 ) is non-empty. Set M = f [G]. Then f −1 [M ] ⊇ G is not nowhere dense, so H = int M must be non-empty. Now G ⊆ πH1 ⊆ f −1 [H1 ], so f [G] ⊆ f [f −1 [H1 ]] ⊆ f [f −1 [H1 ]] ⊆ H 1 , so M ⊆ H 1 and H ⊆ int H 1 = H1 . Similarly, H ⊆ H2 , and f −1 [H] ⊆ f −1 [H1 ∩ H2 ] ⊆ π(H1 ∩ H2 ). But also H ∩ f [G] is not empty, so ∅ 6= G ∩ f −1 [H] ⊆ G ∩ π(H1 ∩ H2 ), which is impossible. X XQ Q (c) If H ∈ RO(Y ) and H 0 = Y \ H is its complement in RO(Y ) then πH 0 = X \ πH is the complement of πH in RO(X). P P By (b), πH and πH 0 are disjoint. Now H ∪ H 0 is a dense open subset of Y , so πH ∪ πH 0 ⊇ f −1 [H] ∪ f −1 [H 0 ] = f −1 [H ∪ H 0 ] is dense in X, and the regular open set πH 0 must include the complement of πH in RO(X). Q Q Putting (b) and (c) together, we see that the conditions of 312H(ii) are satisfied, so that π is a Boolean homomorphism. (d)STo see that it is order-continuous, let H ⊆ RO(Y ) be a non-empty set with supremum Y . Then H0 = H is a dense open subset of Y (see the formula in 314P). So
48
Boolean algebras
S H∈H
πH ⊇
S H∈H
*314R
f −1 [H] = f −1 [H0 ]
is dense in X, and supH∈H πH = X in RO(X). By 313L(b-iii), π is order-continuous. 314S
It is now easy to characterize the Stone spaces of Dedekind complete Boolean algebras.
Theorem Let A be a Boolean algebra, and Z its Stone space; write E for the algebra of open-and-closed subsets of Z, and G for the regular open algebra of Z. Then the following are equiveridical: (i) A is Dedekind complete; (ii) Z is extremally disconnected (definition: 3A3Ae); (iii) E = G. proof (i)⇒(ii) If A is Dedekind complete, let G be any open set in Z. Set A = {a : a ∈ A, b a ⊆ G}, S a0 = sup A. Then G = {b a : a ∈ A}, because E is a base for the topology of Z, so b a0 = G, by 313Ca. Consequently G is open. As G is arbitrary, Z is extremally disconnected. (ii)⇒(iii) If E ∈ E, then of course E = E = int E, so E is a regular open set. Thus E ⊆ G. On the other hand, suppose that G ⊆ Z is a regular open set. Because Z is extremally disconnected, G is open; so G = int G = G is open-and-closed, and belongs to E. Thus E = G. (iii)⇒(i) Since G is Dedekind complete (314P), E and A are also Dedekind complete Boolean algebras. Remark Note that if the conditions above are satisfied, either 312L or the formulae in 314P show that the Boolean structures of E and G are identical. 314T I come now to a construction of great importance, both as a foundation for further constructions and as a source of insight into the nature of Dedekind completeness. Theorem Let A be a Boolean algebra, with Stone space Z; for a ∈ A let b a be the corresponding open-andb be the regular open algebra of Z (314P). closed subset of A. Let A (a) The map a 7→ b a is an injective order-continuous Boolean homomorphism from A onto an order-dense b subalgebra of A. (b) If B is any Dedekind complete Boolean algebra and π : A → B is an order-continuous Boolean b → B such that π1 b homomorphism, there is a unique order-continuous Boolean homomorphism π1 : A a = πa for every a ∈ A. proof (a)(i) Setting E = {b a : a ∈ A}, every member of E is open-and-closed, so is surely equal to the b for every a ∈ A. The formulae in 314P tell us interior of its closure, and is a regular open set; thus b a∈A b b that if a, b ∈ A, then b a ∩ b, taken in A, is just the set-theoretic intersection b a ∩ bb = (a ∩ b) b ; while 1 \ b a, b taken in A, is Z \b a = Z \b a = (1 \ a) b . b Thus the map a 7→ b b preserves ∩ and complementation, so And of course b 0 = ∅ is the zero of A. a:A→A is a Boolean homomorphism (312H). Of course it is injective. T (ii) If A ⊆ A is non-empty and inf A = 0, then a∈A b a is nowhere dense in Z (313Cc), so T inf{b a : a ∈ A} = int( a∈A b a) = ∅ b is order-continuous. (314P again). As A is arbitrary, the map a 7→ b a:A→A b is not empty, then there is a non-empty member of E included in it, by the definition of (iii) If G ∈ A b the topology of Z (311I). So E is an order-dense subalgebra of A. (b) Now suppose that B is a Dedekind complete Boolean algebra and π : A → B is an order-continuous b is an isomorphism between A and the Boolean homomorphism. Write ιa = b a for a ∈ A, so that ι : A → A −1 b Accordingly πι : E → B is an order-continuous Boolean homomorphism, order-dense subalgebra E of A. being the composition of the order-continuous Boolean homomorphisms π and ι−1 . By 314K, it has an b → B, and π1 ι = π, that is, π1 b extension to a Boolean homomorphism π1 : A a = πa for every a ∈ A. Now b b π1 is order-continuous. P P Suppose that H ⊆ A has supremum 1 in A. Set
314Xc
Order-completeness
49
H0 = {E : E ∈ E, E ⊆ H for some H ∈ H}. b Because E is order-dense in A, H = supE∈E,E⊆H E = supE∈H0 ,E⊆H E b It follows at once that sup H0 = 1 in E, so sup π1 [H0 ] = for every H ∈ H (313K), and sup H0 = 1 in A. −1 0 sup(πι )[H ] = 1. Since any upper bound for π1 [H] must also be an upper bound for π1 [H0 ], sup π1 [H] = 1 in B. As H is arbitrary, π1 is order-continuous (313L(b-iii)). Q Q 0 b → B is any other Boolean homomorphism such that π 0 b If π10 : A 1 a = πa for every a ∈ A, then π1 and π1 0 b G is the agree on E, and the argument just above shows that π1 is also order-continuous. But if G ∈ A, b supremum (in A) of F = {E : E ∈ E, E ⊆ G}, so π10 G = supE∈F π10 E = supE∈F π1 E = π1 G. As G is arbitrary, π10 = π1 . Thus π1 is unique. 314U The Dedekind completion of a Boolean algebra For any Boolean algebra A, I will say that b constructed in 314T is the Dedekind completion of A. the Boolean algebra A b and treat When using this concept I shall frequently suppress the distinction between a ∈ A and b a ∈ A, b A as itself an order-dense subalgebra of A. 314V Upper envelopes (a) Let A be a Boolean algebra, and C a subalgebra of A. For a ∈ A, write upr(a, C) = inf{c : c ∈ C, a ⊆ c} if the infimum is defined in C. (The most important cases are when A is Dedekind complete and C is orderclosed in A, so that C is Dedekind complete (314E) and upr(a, C) is defined for every a ∈ A; but others also arise.) (b) If A ⊆ A is such that upr(a, C) is defined for every a ∈ A, a0 = sup A is defined in A and c0 = supa∈A upr(a, C) is defined in C, then c0 = upr(a0 , C). P P If c ∈ C then c0 ⊆ c ⇐⇒ upr(a, C) ⊆ c for every a ∈ A ⇐⇒ a ⊆ c for every a ∈ A ⇐⇒ a0 ⊆ c. Q Q In particular, upr(a ∪ a0 , C) = upr(a, C) ∪ upr(a0 , C) whenever the right-hand side is defined. (c) If a ∈ A is such that upr(a, C) is defined, then upr(a ∩ c, C) = c ∩ upr(a, C) for every c ∈ C. P P For c0 ∈ C, a ∩ c ⊆ c0 ⇐⇒ a ⊆ c0 ∪ (1 \ c) ⇐⇒ upr(a, C) ⊆ c0 ∪ (1 \ c) ⇐⇒ c ∩ upr(a, C) ⊆ c0 . Q Q 314X Basic exercises (a) Let A be a Boolean algebra. (i) Show that the following are equiveridical: (α) A is Dedekind complete (β) every non-empty upwards-directed subset of A with an upper bound has a least upper bound (γ) every non-empty downwards-directed subset of A with a lower bound has a greatest lower bound. (ii) Show that the following are equiveridical: (α) A is Dedekind σ-complete (β) every nondecreasing sequence in A with an upper bound has a least upper bound (γ) every non-increasing sequence in A with a lower bound has a greatest lower bound. (b) Let A be a Boolean algebra. Show that any principal ideal of A is order-closed. Show that A is Dedekind complete iff every order-closed ideal is principal. >(c) Let A be a Dedekind σ-complete Boolean algebra, B a Boolean algebra and π : A → B a sequentially order-continuous Boolean homomorphism. If C ⊆ A and C is the σ-subalgebra of A generated by C, show that π[C] is the σ-subalgebra of B generated by π[C].
50
Boolean algebras
314Xd
(d) Let A be a Dedekind complete Boolean algebra, B an order-closed subalgebra of A, and a ∈ A; let Aa be the principal ideal of A generated by a. Show that {a ∩ b : b ∈ B} is an order-closed subalgebra of Aa . (e) Find a proof of 314Tb which does not appeal to 314K. > (f ) Let A be a Dedekind complete Boolean algebra and B an order-dense subalgebra of A. Show that A is isomorphic to the Dedekind completion of B. (g) Let A be a Dedekind complete Boolean algebra and C an order-closed subalgebra of A. Show that an element a of A belongs to C iff upr(1 \ a, C) = 1 \ upr(a, C) iff upr(1 \ a, C) ∩ upr(a, C) = 0. > (h) Let A be a Dedekind complete Boolean algebra, C an order-closed subalgebra of A, and a0 ∈ A, c0 ∈ C. Show that the following are equiveridical: (i) there is a Boolean homomorphism π : A → C such that πc = c for every c ∈ C and πa0 = c0 (ii) 1 \ upr(1 \ a0 , C) ⊆ c0 ⊆ upr(a0 , C). 314Y Further exercises (a) Let P be a Dedekind complete partially ordered set. Show that a set Q ⊆ P is order-closed iff sup R, inf R belong to Q whenever R ⊆ Q is a totally ordered subset of Q with upper and lower bounds in P . (Hint: show by induction on κ that if A ⊆ Q is upwards-directed and bounded above and #(A) ≤ κ then sup A ∈ Q.) (b) Let P be a lattice. Show that P is Dedekind complete iff every non-empty totally ordered subset of P with an upper bound in P has a least upper bound in P . (Hint: if A ⊆ P is non-empty and bounded below in P , let B be the set of lower bounds of A and use Zorn’s Lemma to find a maximal element of B.) (c) Give an example of a Boolean algebra A with an order-closed subalgebra A0 and an element c such that the subalgebra generated by A0 ∪ {c} is not order-closed. (d) Let X be any topological space. Let M be the σ-ideal of meager subsets of X, and set Bb = {G4A : G ⊆ X is open, A ∈ M}. b (i) Show that Bb is a σ-algebra of subsets of X, and that B/M is Dedekind complete. (Members of Bb are said b to be the subsets of X with the Baire property; B is the Baire property algebra of X.) (ii) Show that S b is dense, then A ∈ B. b (iii) Show that there is a largest open if A ⊆ X and {G : G ⊆ X is open, A ∩ G ∈ B} set V ∈ M. (iv) Let G be the regular open algebra of X. Show that the map G 7→ G• is an order-continuous b Boolean homomorphism from G onto B/M, so induces a Boolean isomorphism between the principal ideal b b of G generated by X \ V and B/M. (B/M is the category algebra of X; it is a Dedekind complete b Boolean algebra. X is called a Baire space if V = ∅; in this case G ∼ = B/M.) (e) Let A be a Dedekind σ-complete Boolean algebra, and han in∈N any sequence in A. For n ∈ N set En = {x : x ∈ {0, 1}N , x(n) = 1}, and let B be the σ-algebra of subsets of {0, 1}N generated by {En : n ∈ N}. (B is the ‘Borel σ-algebra’ of {0, 1}N ; see 4A2Wd.) Show that there is a unique sequentially order-continuous Boolean homomorphism θ : B → A such that θ(En ) = an for every n ∈ N. (Hint: define a suitable function φ from the Stone space Z of A to {0, 1}N , and consider {E : E ⊆ {0, 1}N , φ−1 [E] has the Baire property in Z}.) Show that θ[B] is the σ-subalgebra of A generated by {an : n ∈ N}. (f ) Let A be a Boolean algebra, and Z its Stone space. Show that A is Dedekind σ-complete iff G is open whenever G is a cozero set in Z. (Such spaces are called basically disconnected or quasi-Stonian.) (g) Let A, B be Dedekind complete Boolean algebras and D ⊆ A \ {0} an order-dense set. Suppose that φ : D → B is such that (i) φ[D] is order-dense in B (ii) for all d, d0 ∈ D, d ∩ d0 = 0 iff φd ∩ φd0 = 0. Show that φ has a unique extension to a Boolean isomorphism from A to B. (h) Let A be any Boolean algebra. Let J be the family of order-closed ideals in A. Show that (i) J is a Dedekind complete Boolean algebra with operations defined by the formulae I ∩ J = I ∩ J, 1 \ J = {a : a ∩ b = 0 for every b ∈ J} (ii) the map a 7→ Aa , the principal ideal generated by a, is an injective order-continuous Boolean homomorphism from A onto an order-dense subalgebra of J (iii) J is isomorphic to the Dedekind completion of A.
315Ab
Products and free products
51
314 Notes and comments At the risk of being tiresomely long-winded, I have taken the trouble to spell out a large proportion of the results in this section and the last in their ‘sequential’ as well as their ‘unrestricted’ forms. The point is that while (in my view) the underlying ideas are most clearly and dramatically expressed in terms of order-closed sets, order-continuous functions and Dedekind complete algebras, a large proportion of the applications in measure theory deal with sequentially order-closed sets, sequentially order-continuous functions and Dedekind σ-complete algebras. As a matter of simple technique, therefore, it is necessary to master both, and for the sake of later reference I generally give the statements of both versions in full. Perhaps the points to look at most keenly are just those where there is a difference in the ideas involved, as in 314Bb, or in which there is only one version given, as in 314M and 314T. If you have seen the Hahn-Banach theorem (3A5A), it may have been recalled to your mind by Theorem 314K; in both cases we use an order relation and a bit of algebra to make a single step towards an extension of a function, and Zorn’s lemma to turn this into the extension we seek. A good part of this section has turned out to be on the borderland between the theory of Boolean algebra and general topology; naturally enough, since (as always with the general theory of Boolean algebra) one of our first concerns is to establish connexions between algebras and their Stone spaces. I think 314T is the first substantial ‘universal mapping theorem’ in this volume; it is by no means the b is not just that we obtain a Dedekind complete Boolean algebra in last. The idea of the construction A which A is embedded as an order-dense subalgebra, but that we simultaneously obtain a theorem on the b of order-continuous Boolean homomorphisms defined on A. This characterization canonical extension to A b a 7→ b b becomes is enough to define the pair (A, a) up to isomorphism, so the exact method of construction of A of secondary importance. The one used in 314T is very natural (at least, if we believe in Stone spaces), but there are others (see 314Yh), with different virtues. 314K and 314T both describe circumstances in which we can find extensions of Boolean homomorphisms. Clearly such results are fundamental in the theory of Boolean algebras, but I shall not attempt any systematic presentation here. 314Ye can also be regarded as belonging to this family of ideas.
315 Products and free products I describe here two algebraic constructions of fundamental importance. They are very different in character, indeed may be regarded as opposites, despite the common use of the word ‘product’. The first part of the section (315A-315G) deals with the easier construction, the ‘simple product’; the second part (315H-315P) with the ‘free product’. Q 315A Products of Boolean algebras (a) Let hAi ii∈I be any family of Boolean algebras. Set A = i∈I Ai , with the natural ring structure a 4 b = ha(i) 4 b(i)ii∈I , a ∩ b = ha(i) ∩ b(i)ii∈I for a, b ∈ A. Then A is a ring (3A2H); it is a Boolean ring because a ∩ a = ha(i) ∩ a(i)ii∈I = a for every a ∈ A; and it is a Boolean algebra because if we set 1A = h1Ai ii∈I , then 1A ∩ a = a for every a ∈ A. I will call A the simple product of the family hAi ii∈I . I should perhaps remark that when I = ∅ then A becomes {∅}, to be interpreted as the singleton Boolean algebra. (b) The Boolean operations on A are now defined by the formulae a ∪ b = ha(i) ∪ b(i)ii∈I , for all a, b ∈ A.
a \ b = ha(i) \ b(i)ii∈I
52
Boolean algebras
315B
315B Theorem Let hAi ii∈I be a family of Boolean algebras, and A their simple product. (a) The maps a 7→ πi (a) = a(i) : A → Ai are all Boolean homomorphisms. (b) If B is any other Boolean algebra, then a map φ : B → A is a Boolean homomorphism iff πi φ : B → Ai is a Boolean homomorphism for every i ∈ I. proof Verification of these facts amounts just to applying the definitions with attention. 315C Products of partially ordered sets (a) It is perhaps worth spelling out the following elemenQ tary definition. If hPi ii∈I is any family of partially ordered sets, its product is the set P = i∈I Pi ordered by saying that p ≤ q iff p(i) ≤ q(i) for every i ∈ I; it is easy to check that P is now a partially ordered set. (b) The point is that if A is the simple product of a family hAi ii∈I of Boolean algebras, then the ordering of A is just the product partial order: a ⊆ b ⇐⇒ a ∩ b = a ⇐⇒ a(i) ∩ b(i) = a(i) ∀ i ∈ I ⇐⇒ a(i) ⊆ b(i) ∀ i ∈ I. Now we have the following elementary, but extremely useful, general facts about products of partially ordered sets. 315D Proposition Let hPi ii∈I be a family of non-empty partially ordered sets with product P . (a) For any non-empty set A ⊆ P and q ∈ P , (i) sup A = q in P iff supp∈A p(i) = q(i) in Pi for every i ∈ I, (ii) inf A = q in P iff inf p∈A p(i) = q(i) in Pi for every i ∈ I. (b) The coordinate maps p 7→ πi (p) = p(i) : P → Pi are all order-preserving and order-continuous. (c) For any partially ordered set Q and function φ : Q → P , φ is order-preserving iff πi φ is order-preserving for every i ∈ I. (d) For any partially ordered set Q and order-preserving function φ : Q → P , (i) φ is order-continuous iff πi φ is order-continuous for every i, (ii) φ is sequentially order-continuous iff πi φ is sequentially order-continuous for every i. (e)(i) P is Dedekind complete iff every Pi is Dedekind complete. (ii) P is Dedekind σ-complete iff every Pi is Dedekind σ-complete. proof All these are elementary verifications. Of course parts (b), (d) and (e) rely on (a). 315E Factor algebras as principal ideals Because Boolean algebras have least elements, we have a second type of canonical map associated with their products. If hAi ii∈I is a family of Boolean algebras with simple product A, define θi : Ai → A by setting (θi a)(i) = a, (θi a)(j) = 0Aj if i ∈ I, a ∈ Ai and j ∈ I \ {i}. Each θi is a ring homomorphism, and is a Boolean isomorphism between Ai and the principal ideal of A generated by θi (1Ai ). The family hθi (1Ai )ii∈I is a partition of unity in A. Associated with these embeddings is the following important result. 315F Proposition Let A be a Boolean algebra and hei ii∈I a partition of unity in A. Suppose either (i) that I is finite or (ii) that I is countable and A is Dedekind σ-complete or (iii) that A is Dedekind complete. Q Then the map a 7→ ha ∩ ei ii∈I is a Boolean isomorphism between A and i∈I Aei , writing Aei for the principal ideal of A generated by ei for each i. proof The given map is a Boolean homomorphism because each of the maps a 7→ a ∩ ei : A → Aei is (312J). It is injective because supi∈I ei = 1,Qso if a ∈ A \ {0} there is an i such that a ∩ ei 6= 0. It is surjective because hei ii∈I is disjoint and if c ∈ i∈I Aei then a = supi∈I c(i) is defined in A and a ∩ ej = supi∈I c(i) ∩ ej = c(j) for every j ∈ I (using 313Ba). The three alternative versions of the hypotheses of this proposition are designed to ensure that the supremum is always well-defined in A.
315I
Products and free products
53
315G Algebras of sets and their quotients The Boolean algebras of measure theory are mostly presented as algebras of sets or quotients of algebras of sets, so it is perhaps worth spelling out the ways in which the product construction applies to such algebras. Proposition Let hXi ii∈I be Q a family of sets, and Σi an algebra of subsets of Xi for each i. (a) The simple product i∈I Σi may be identified with the algebra Σ = {E : E ⊆ X, {x : (x, i) ∈ E} ∈ Σi for every i ∈ I} of subsets of X = {(x, i) : i ∈ I, x ∈ Xi }, with the canonical homomorphisms πi : Σ → Σi being given by πi E = {x : (x, i) ∈ E} for each E ∈ Σ. Q (b) Now suppose that Ji is an ideal of Σi for each i. Then i∈I Σi /Ji may be identified with Σ/J , where J = {E : E ∈ Σ, {x : (x, i) ∈ E} ∈ Ji for every i ∈ I}, and the canonical homomorphisms π ˜i : Σ/J → Σi /Ji are given by the formula π ˜i (E • ) = (πi E)• for every E ∈ Σ. Q proof (a) It is easy to check that Σ is a subalgebra of PX, and that the map E 7→ hπi Eii∈I : Σ → i∈I Σi is a Boolean isomorphism. (b) Again, it is easy to check that J is an ideal of Σ, that the proposed formula for π ˜i does Q indeed define a map from Σ/J to Σi /Ji , and that E • 7→ h˜ πi E • ii∈I is an isomorphism between Σ/J and i∈I Σi /Ji . 315H Free products I come now to the second construction of this section. (a) Definition Q Let hAi ii∈I be a family of Boolean algebras. For each i ∈ I, let Zi be the Stone space Then the free product of hAi ii∈I is the algebra A of of Ai . Set Z = i∈I Zi , with the product topology. N open-and-closed sets in Z; I will denote it by i∈I Ai . (b) For i ∈ I and a ∈ Ai , the set b a ⊆ Zi representing a is an open-and-closed subset of Zi ; because z 7→ z(i) : Z → Zi is continuous, εi (a) = {z : z(i) ∈ b a} is open-and-closed, so belongs to A. In this context I will call εi : Ai → A the canonical map. (c) The topological space Z may be identified with the Stone space of the Boolean algebra A. P P By Tychonoff’s theorem (3A3J), Z is compact. If z ∈ Z and G is an open subset of Z containing z, then there are J, hGj ii∈J such that J is a finite subset of I, Gj is an open subset of Zj for each j ∈ J, and z ∈ {w : w ∈ Z, w(j) ∈ Gj for every j ∈ J} ⊆ G. Because each Zj is zero-dimensional, we can find an open-and-closed set Ej ⊆ Zj such that z(j) ∈ Ej ⊆ Gj . Now T E = Z ∩ j∈J {w : w(j) ∈ Ej } is a finite intersection of open-and-closed subsets of Z, so is open-and-closed; and z ∈ E ⊆ G. As z and G are arbitrary, Z is zero-dimensional. Finally, Z, being the product of Hausdorff spaces, is Hausdorff. So the result follows from 311J. Q Q 315I Theorem Let hAi ii∈I be a family of Boolean algebras, with free product A. (a) The canonical map εi : Ai → A is a Boolean homomorphism for every i ∈ I. (b) For any Boolean algebra B and any family hφi ii∈I such that φi is a Boolean homomorphism from Ai to B for every i, there is a unique Boolean homomorphism φ : A → B such that φi = φεi for each i. proof These are both consequences of 312P-312Q. As in 315H, write Zi for the Stone space of A, and Z for Q Z i∈I i , identified with the Stone space of A, as observed in 315Hc. The maps εi : Ai → A are defined as the homomorphisms corresponding to the continuous maps z 7→ ε˜i (z) = z(i) : Z → Zi , so (a) is surely true. Now suppose that we are given a Boolean homomorphism φi : Ai → B for each i ∈ I. Let W be the Stone space of B, and let φ˜i : W → Zi be the continuous function corresponding to φi . By 3A3Ib, the map ˜ w 7→ φ(w) = hφ˜i (w)ii∈I : W → Z is continuous, and corresponds to a Boolean homomorphism φ : A → B;
54
Boolean algebras
315I
˜ φεi = φi for each i. Moreover, φ is the only Boolean homomorphism with this property, because φ˜i = ε˜i φ, because if ψ : A → B is a Boolean homomorphism such that ψεi = φi for every i, then ψ corresponds to a continuous map ψ˜ : W → Z, and we must have ε˜i ψ˜ = φ˜i for each i, so that ψ˜ = φ˜ and ψ = φ. This proves (b). 315J Of course 315I is the defining property of the free product (see 315Xg below). I list a few further basic facts. Proposition Let hAi ii∈I be a family of Boolean algebras, and A their free product; write εi : Ai → A for the canonical maps. S (a) A is the subalgebra of itself generated by i∈I εi [Ai ]. (b) Write C for the set of those members of A expressible in the form inf j∈J εj (aj ), where J ⊆ I is finite and aj ∈ Aj for every j. Then every member of A is expressible as the supremum of a disjoint finite subset of C. In particular, C is order-dense in A. (c) Every εi is order-continuous. (d) A = {0A } iff there is some i ∈ I such that Ai = {0Ai }. (e) Now suppose that Ai 6= {0Ai } for every i ∈ I. (i) εi is injective for every i ∈ I. (ii) If J ⊆ I is finite and aj is a non-zero member of Aj for each j ∈ J, then inf j∈J εj (aj ) 6= 0. (iii) If i, j are distinct members of I and a ∈ Ai , b ∈ Aj , then εi (a) = εj (b) iff either a = 0Ai and b = 0Aj or a = 1Ai and b = 1Aj . Q proof As usual, write Zi for the Stone space of Ai , and Z = i∈I Zi , identified with the Stone space of A (315Hc). S (a) Write A0 for the subalgebra of A generated by i∈I εi [Ai ]. Then εi : Ai → A0 is a Boolean homomorphism for each i, so by 315Ib there is a Boolean homomorphism φ : A → A0 such that φεi = εi for each i. Now, regarding φ as a Boolean homomorphism from A to itself, the uniqueness assertion of 315Ib (with B = A) shows that φ must be the identity, so that A0 = A. (b) Write D for the set of finite partitions of unity in A consisting of members of C, and A for the set of members of A expressible in the form sup D0 where D0 is a subset of a member of D. Then A is a subalgebra of A. P P (i) 1A ∈ C (set J = ∅ in the definition of members of C) so {1A } ∈ D and 0A , 1A ∈ A. (ii) Note that if c, d ∈ C then c ∩ d ∈ C. (iii) If a, b ∈ A, express them as sup D0 , sup E 0 where D0 ⊆ D ∈ D, E 0 ⊆ E ∈ D. Then F = {d ∩ e : d ∈ D, e ∈ E} ∈ D, so 1A \ a = sup D \ D0 ∈ A, a ∪ b = sup{f : f ∈ F, f ⊆ a ∪ b} ∈ A. Q Q Also, εi [Ai ] ⊆ A for each i ∈ I. P P If a ∈ Ai , then {εi (a), εi (1Ai \ a)} ∈ D, so εi (a) ∈ A. Q Q So (a) tells us that A = A, and every member of A is a finite disjoint union of members of C. (c) If i ∈ I and A ⊆ Ai and inf A = 0 in Ai , take any non-zero c ∈ A. By (b), we can find a finite J ⊆ I and a family haj ij∈J such that c0 = inf j∈J εj (aj ) ⊆ c and c0 6= 0. Regarding c0 as a subset of Z, we have a point z ∈ c0 . Adding i to J and setting ai = 1Ai if necessary, we may suppose that i ∈ J. Now c0 6= 0A so ai 6= 0Ai and there is an a ∈ A such that ai 6⊆ a, so there is a t ∈ b ai \ b a. In this case, setting w(i) = t, w(j) = z(j) for j 6= i, we have w ∈ c0 \ εi (a), and c0 , c are not included in εi (a). As c is arbitrary, this shows that inf εi [A] = 0. As A is arbitrary, εi is order-continuous. (d) The point is that A = {0A } iff Z = ∅, which is so iff some Zi is empty. (e)(i) Because no Zi is empty, all the coordinate maps from Z to Zi are surjective, so the corresponding homomorphisms εi are injective (312Ra). (ii) Because J is finite,
315L
Products and free products
55
inf j∈J εj (aj ) = {z : z ∈ Z, z(j) ∈ b aj for every j ∈ J} is not empty. (iii) If εi (a) = εj (b) = 0A then (using (i)) a = 0Ai and b = 0Aj ; if εi (a) = εj (b) = 1A then a = 1Ai and b = 1Aj . ?? If εi (a) = εj (b) ∈ A \ {0A , 1A }, then there are t ∈ b a and u ∈ Zj \ bb. Now there is a z ∈ Z such that z(i) = t and z(j) = u, so that z ∈ εi (a) \ εj (b). X X 315K Proposition Let hAi ii∈I be any family of Boolean algebras, and hJk ik∈K any partition of I. Then the free product A of hAi ii∈I is isomorphic to the free product B of hBk ik∈K , where each Bk is the free product of hAi ii∈Jk . proof Write εi : Ai → A, ε0i : A → Bk and δk : Bk → B for the canonical maps when k ∈ K, i ∈ Jk . Then the homomorphisms δk ε0i : Ai → B correspond to a homomorphism φ : A → B such that φεi = δk ε0i whenever i ∈ Jk . Next, for each k, the homomorphisms εi : Ai → A, for i ∈ Jk , correspond to a homomorphism ψk : Bk → A such that ψk ε0i = εi for i ∈ Jk ; and the family hψk ik∈K corresponds to a homomorphism ψ : B → A such that ψδk = ψk for k ∈ K. Consequently ψφεi = ψδk ε0i = ψk ²0i = ²i whenever k ∈ K, i ∈ Jk . Once again using the uniqueness assertion in 315Ib, ψφ is the identity homomorphism on A. On the other hand, if we look at φψ : B → B, then we see that φψδk ε0i = φψk ²0i = φ²i = δk ε0i whenever k ∈ K, i ∈ Jk . Now, for given k, {b : b ∈ Bk , φψδk b = δk b} is a subalgebra of Bk including S ε0 [A ], and must be the whole of Bk , by 315Ja. So {b : b ∈ B, φψb = b} is a subalgebra of B including Si∈Jk i i k∈K δk [Bk ], and is the whole of B. Thus φψ is the identity on B and φ, ψ are the two halves of an isomorphism between A and B. 315L Algebras of sets and their quotients Once again I devote a paragraph to spelling out the application of the construction to the algebras most important to us. Proposition Let hXi ii∈I Nbe a family of sets, and Σi an algebra of subsets of Xi for eachQi. (a) The free product i∈I Σi may be identified with the algebra Σ of subsets of X = i∈I Xi generated by the set {εi (E) : i ∈ I, E ∈ Σi }, where εi (E) = {x : x ∈ X,Nx(i) ∈ E}. (b) Now suppose that Ji is an ideal of Σi for each i. Then i∈I Σi /Ji may be identified with Σ/J , where J is the ideal of Σ generated by {εi (E) : i ∈ I, E ∈ Ji }; the corresponding canonical maps ε˜i : Σi /Ji → Σ/J being defined by the formula ε˜i (E • ) = (εi (E))• for i ∈ I, E ∈ Σi . proof I start by proving (b) in detail; the argument for (a) is then easy to extract. Write Ai = Σi /Ji , A = Σ/J . (i) Fix i ∈ I for the moment. By the definition of Σ, εi (E) ∈ Σ for E ∈ Σi , and it is easy to check that εi : Σi → Σ is a Boolean homomorphism. Again, because εi (E) ∈ J whenever E ∈ Ji , the kernel of the homomorphism E 7→ (εi (E))• : Σi → A includes Ji , so the formula for ε˜i defines a homomorphism from Ai to A. N Now let C = i∈I Ai be the free product, and write ε0i : Ai → C for the canonical homomorphisms. By 315I, there is a Boolean homomorphism φ : C → A such that φε0i = ε˜i for each i. The set {E : E ∈ Σ, E • ∈ φ[C]} is a subalgebra of Σ including εi [Σi ] for every i, so is Σ itself, and φ is surjective. (ii) We need a simple description of the ideal J , as follows: a set ES ∈ Σ belongs to J iff there are a finite K ⊆ I and a family hFk ik∈K such that Fk ∈ Jk for each k and E ⊆ k∈K εk (Fk ). For evidently such sets have to belong to J , since the εk (Fk ) will be in J , while the family of all these sets is an ideal containing εi (F ) whenever i ∈ I, F ∈ Ji . (iii) Now we can see that φ : C →QA is injective. P P Take any non-zero c ∈ C. By 315Jb, we can find a finite J ⊆ I and a family haj ij∈J in j∈J Aj such that 0 6= inf j∈J ε0j aj ⊆ c. Express each aj as Ej• , where T Ej ∈ Σj , and consider E = X ∩ j∈J εj (Ej ) ∈ Σ. Then
56
Boolean algebras
315L
E • = inf j∈J ε˜j aj = φ(inf j∈J ε0j aj ) ⊆ φ(c). Also, because ε0j aj 6= 0, Ej ∈ / Jj for each j. But it follows that E ∈ / J , because if K ⊆ I is finite and Fk ∈ Jk for each k ∈ K, set Ei = Xi for i ∈S I \ J, Fi = ∅ for i ∈ I \ K; then there is an x ∈ X such that x(i) ∈ Ei \ Fi for each i ∈ I, so that x ∈ E \ k∈K Fk . By the criterion of (ii), E ∈ / J . So 0 6= E • ⊆ φ(c). As c is arbitrary, the kernel of φ is {0}, and φ is injective. Q Q So φ : C → A is the required isomorphism. (iv) This proves (b). Reading through the arguments above, it is easy to see the simplifications which compose a proof of (a), reading Σi for Ai and {∅} for Ji . 315M Notation Free products are sufficiently surprising that I think it worth taking a moment to look at a pair of examples relevant to the kinds of application I wish to make of the concept in the next chapter. First let me introduce a somewhat more direct notation which seems appropriate for the free product of finitely many factors. If A and B are two Boolean algebras, I write A ⊗ B for their free product, and for a ∈ A, b ∈ B I write a ⊗ b for ε1 (a) ∩ ε2 (b), where ε1 : A → A ⊗ B, ε2 : B → A ⊗ B are the canonical maps. Observe that (a1 ⊗ b1 ) ∩ (a2 ⊗ b2 ) = (a1 ∩ a2 ) ⊗ (b1 ∩ b2 ), and that the maps a 7→ a ⊗ b0 , b 7→ a0 ⊗ b are always ring homomorphisms. Now 315J(e-ii) tells us that a ⊗ b = 0 only when one of a, b is 0. In the context of 315L, we can identify E ⊗ F with E × F for E ∈ Σ1 , F ∈ Σ2 , and E • ⊗ F • with (E × F )• . 315N Lemma Let A, B be Boolean algebras. (a) Any element of A ⊗ B is expressible as supi∈I ai ⊗ bi where hai ii∈I is a finite partition of unity in A. (b) If c ∈ A ⊗ B is non-zero there are non-zero a ∈ A, b ∈ B such that a ⊗ b ⊆ c. proof (a) Let C be the set of elements of A ⊗ B representable in this form. Then C is a subalgebra of A ⊗ B. P P (i) If hai ii∈I , ha0j ij∈J are finite partitions of unity in A, and bi , b0j members of B for i ∈ I and j ∈ J, the hai ∩ a0j ii∈I,j∈J is a partition of unity in A, and (sup ai ⊗ bi ) ∩ (sup a0j ⊗ b0j ) = sup (ai ⊗ bi ) ∩ (a0j ⊗ b0j ) i∈I
j∈J
i∈I,j∈J
= sup (ai ∩ a0j ) ⊗ (bi ∩ b0j ) ∈ C. i∈I,j∈J
0
0
So c ∩ c ∈ C for all c, c ∈ C. (ii) If hai ii∈I is a finite partition of unity in A and bi ∈ B for each i, then 1 \ supi∈I ai ⊗ bi = (supi∈I ai ⊗ 1) \ (supi∈I ai ⊗ bi ) = supi∈I ai ⊗ (1 \ bi ) ∈ C. Thus 1 \ c ∈ C for every c ∈ C. Q Q Since a ⊗ 1 = (a ⊗ 1) ∪ ((1 \ a) ⊗ 0) and 1 ⊗ b belong to C for every a ∈ A, b ∈ B, C must be the whole of A ⊗ B, by 315Ja. (b) Now this follows at once, just as in 315Jb. 315O Example A = PN ⊗ PN is not Dedekind σ-complete. P P Consider A = {{n} ⊗ {n} : n ∈ N} ⊆ A. ?? If A has a least upper bound c in A, then c is expressible as a supremum supj≤k aj ⊗bj , by 315Jb. Because k is finite, there must be distinct m, n such that {j : m ∈ aj } = {j : n ∈ aj }. Now {n} × {n} ⊆ c, so there is a j ≤ k such that (aj ∩ {n}) ⊗ (bj ∩ {n}) = ({n} ⊗ {n}) ∩ (aj ⊗ bj ) 6= 0, so that neither aj ∩ {n} nor bj ∩ {n} is empty, that is, n ∈ aj ∩ bj . But this means that m ∈ aj , so that (aj ⊗ bj ) ∩ ({m} ⊗ {n}) = (aj ∩ {m}) ⊗ (bj ∩ {n}) 6= 0, and c ∩ ({m} ⊗ {n}) 6= 0, even though a ∩ ({m} ⊗ {n}) = 0 for every a ∈ A. X X Thus we have found a countable subset of A with no supremum in A, and A is not Dedekind σ-complete. Q Q 315P Example Now let A be any non-trivial atomless Boolean algebra, and B the free product A ⊗ A. Then the identity homomorphism from A to itself induces a homomorphism φ : B → A given by setting
315Xj
Products and free products
57
φ(a ⊗ b) = a ∩ b for every a, b ∈ A. The point I wish to make is that φ is not order-continuous. P P Let C be the set {a ⊗ b : a, b ∈ A, a ∩ b = 0}. Then φ(c) = 0A for every c ∈ C. If d ∈ B is non-zero, then by 315Nb there are non-zero a, b ∈ A such that a ⊗ b ⊆ d; now, because A is atomless, there is a non-zero a0 ⊆ a such that a \ a0 6= 0. At least one of b \ a0 , b \ (a \ a0 ) is non-zero; suppose the former. Then a0 ⊗ (b \ a0 ) is a non-zero member of C included in d. As d is arbitrary, this shows that sup C = 1B . So supc∈C φ(c) = 0A 6= 1A = φ(sup C), and φ is not order-continuous. Q Q Thus the free product (unlike the product, see 315Dd) does not respect order-continuity. 315X Basic exercises (a) Let hAi ii∈I be any family of Boolean algebras, with simple product A, and πi : A → Ai the coordinate homomorphisms. Suppose we have another Boolean algebra A0 , with homomorphisms πi0 : A0 → Ai , such that for every Boolean algebra B and every family hφi ii∈I of homomorphisms from B to the Ai there is a unique homomorphism φ : B → A0 such that φi = πi0 φ for every i. Show that there is a unique isomorphism ψ : A → A0 such that πi0 ψ = πi for every i ∈ I. (b) Let hPi ii∈I be a family of non-empty partially ordered sets, with product partially ordered set P . Show that P is a lattice iff every Pi is a lattice, and that in this case it is the product lattice in the sense that p ∨ q = hp(i) ∨ q(i)ii∈I , p ∧ q = hp(i) ∧ q(i)ii∈I for all p, q ∈ P . (c) Let hAi ii∈I be a family of Boolean algebras with simple product A. For each i ∈ I let Zi be the Stone space of Ai , and let Z be the Stone space of A. Show that the coordinate maps from A onto Ai induce homeomorphisms between the Zi and open-and-closed subsets Zi∗ of Z. Show that hZi∗ ii∈I is disjoint. Show S ∗ that i∈I Zi is dense in Z, and is equal to Z iff {i : Ai 6= {0}} is finite. (d) Let hAi ii∈I be a family of Boolean algebras, with simple product A. Suppose that for each i ∈ I we Q are given an ideal Ii ofQAi . Show that I = i∈I Ii is an ideal of A, and that A/I may be identified, as Boolean algebra, with i∈I Ai /Ii . (e) Let hXi ii∈I be any family of topological spaces. Let X be their disjoint union {(x, i) : i ∈ I, x ∈ Xi }, with the disjoint union topology; that is, a set G ⊆ X is open in X iff {x : (x, i) ∈ G} is open in Xi for every i ∈ I. (i) Show that the algebra of open-and-closed subsets of X can be identified, as Boolean algebra, with the simple product of the algebras of open-and-closed sets of the Xi . (ii) Show that the regular open algebra of X can be identified, as Boolean algebra, with the simple product of the regular open algebras of the Xi . (f ) Show that the topological product of any family of zero-dimensional spaces is zero-dimensional. (g) Let hAi ii∈I be any family of Boolean algebras, with free product A, and εi : Ai → A the canonical homomorphisms. Suppose we have another Boolean algebra A0 , with homomorphisms ε0i : Ai → A0 , such that for every Boolean algebra B and every family hφi ii∈I of homomorphisms from the Ai to B there is a unique homomorphism φ : A0 → B such that φi = φε0i for every i. Show that there is a unique isomorphism ψ : A → A0 such that ε0i = ψεi for every i ∈ I. (h) Let I be any set, and let A be the algebra of open-and-closed sets of {0, 1}I ; for each i ∈ I set ai = {x : x ∈ {0, 1}I , x(i) = 1} ∈ A. Show that for any Boolean algebra B, any family hbi ii∈I in B there is a unique Boolean homomorphism φ : A → B such that φ(ai ) = bi for every i ∈ I. (i) Let hAi ii∈I , hB Q j ij∈J beQtwo families Q of Boolean algebras. Show that there is a natural injective homomorphism φ : i∈I Ai ⊗ j∈J Bj → i∈I,j∈J Ai ⊗ Bj defined by saying that for a ∈
Q i∈I
Ai , b ∈
Q j∈J
φ(a ⊗ b) = ha(i) ⊗ b(j)ii∈I,j∈J Bj . Show that φ is surjective if I and J are finite.
Q (j) Let hJ(i)ii∈I be a family of sets, with product Q = i∈I N J(i). QLet hAij ii∈I,j∈J(i) Q be Na family of Boolean algebras. Describe a natural injective homomorphism φ : i∈I j∈J(i) Aij → q∈Q i∈I Ai,q(i) .
58
Boolean algebras
315Xk
(k) Let A and B be Boolean algebras with partitions of unity hai ii∈I , hbj ij∈J . Show that hai ⊗ bj ii∈I,j∈J is a partition of unity in A ⊗ B. (l) Let A and B be Boolean algebras and a ∈ A, b ∈ B. Write Aa , Bb for the corresponding principal ideals. Show that there is a canonical isomorphism between Aa ⊗ Bb and the principal ideal of A ⊗ B generated by a ⊗ b. N (m) Let hAi ii∈I be any family of Boolean algebras, with free product i∈I Ai , and εi : Ai → A the canonical maps. Show that εi [Ai ] is an order-closed subalgebra of A for every i. (n) Let A be a Boolean algebra. Let us say that a family hAi ii∈I of subalgebras of A is Booleanindependent if inf j∈J aj 6= 0 wheneverSJ ⊆ I is finite and aj ∈ Aj \ {0} for every Nj ∈ J. Show that in this case the subalgebra of A generated by i∈I Ai is isomorphic to the free product i∈I Ai . (o) Let hAi ii∈I and hBi ii∈I be two families of Boolean algebras, and suppose that for each i ∈ I we are given a Boolean homomorphism N Nφi : Ai → Bi with kernel Ki C Ai . Show that the φi induce a Boolean homomorphism φ : i∈I Ai → i∈I Bi with kernel generated by the images of the Ki . Show that if every φi is surjective, so is φ. (p) Let hAi ii∈I be any family of non-trivial Boolean algebras. Show that if J ⊆ N NI and Bj is a subalgebra of Aj for each j ∈ J, then j∈J Bj is canonically embedded as a subalgebra of i∈I Ai . (q) Let A and B be Boolean algebras, neither {0}. Show that any element of A⊗B is uniquely expressible as supi∈I ai ⊗ bi where hai ii∈I is a partition of unity in A, with no ai equal to 0, and bi 6= bj in B for i 6= j. 315Y Further exercises (a) Let hAi ii∈I and hBi ii∈I be two families of Boolean algebras, N and suppose N A → that we are given Boolean homomorphisms φi : Ai → Bi for each i; let φ : i i∈I Bi be the i∈I induced homomorphism. (i) Show that if every φi is order-continuous, so is φ. (ii) Show that if every φi is sequentially order-continuous, so is φ. (b) Let hZi ii∈I be any family of topological spaces with product Z. For i ∈ I, z ∈ Z set ε˜i (z) = z(i). Show that if M ⊆ Zi is nowhere dense in Zi then ε˜−1 i [M ] is nowhere dense in Z. Use this to prove 315Jc. (c) Let hAi ii∈IN be a family of Boolean N algebras, and suppose that we are given subalgebras Bi of Ai for each i; set A = i∈I Bi , and let φ : B → A be the homomorphism induced by the i∈I Ai and B = embeddings Bi ⊆ Ai . (i) Show that if every Bi is order-closed in Ai , then φ[B] is order-closed in A. (ii) Show that if every Bi is a σ-subalgebra of Ai , then φ[B] is a σ-subalgebra in A. (d) Let hXi ii∈I be a family of topological spaces, with product X. Let Gi , G be Nthe corresponding regular open algebras. Show that G can be identified with the Dedekind completion of i∈I Gi . (e) Use the ideas of 315Xh and 315L to give an alternative construction of ‘free product’, for which 315I and 315J(e-ii) are true, which does not depend on the concept of Stone space nor on any other use of the axiom of choice. (Hint: show that for any Boolean algebra A there is a canonical surjection from the algebra EA onto A, where EJ is the algebra of subsets of {0, 1}J generated by sets of the form {x : x(j) = 1}; show that for such N algebras EJ , at least, the method of 315H-315I can be used; now apply the method of 315L to describe i∈I Ai as a quotient of EJ where J = {(a, i) : i ∈ I, a ∈ Ai }. Finally check that if no Ai is trivial, then nor is the free product.) (f ) Let A and B be Boolean algebras. Show that A ⊗ B is Dedekind complete iff either A = {0} or B = {0} or A is finite and B is Dedekind complete or B is finite and A is Dedekind complete. (g) Let hPi ii∈I be any family of partially ordered spaces. (i) Give a construction of a partially ordered space P , together with a family of order-preserving maps εi : Pi → P , such that whenever Q is a partially ordered set and φi : Pi → Q is order-preserving for every i ∈ I, there is a unique order-preserving map φ : P → Q such that φi = φεi for every i. (ii) Show that φ will be order-continuous iff every φi is. (iii) Show that P will be Dedekind complete iff every Pi is, but (except in trivial cases) is not a lattice.
316Ab
Further topics
59
315 Notes and comments In this section I find myself asking for slightly more sophisticated algebra than seems necessary elsewhere. The point is that simple products and free products are best regarded as defined by the properties described in 315B and 315I. That is, it is sometimes right to think of a simple product of a family hAi ii∈I of Boolean algebras as being a structure (A, hπi ii∈I ) where A is a Boolean algebra, πi : A → Ai is a homomorphism for every i ∈ I, and every family of homomorphisms from a Boolean algebra B to the Ai can be uniquely represented by a single homomorphism from B to A. Similarly, reversing the direction of the homomorphisms, we can speak of a free product (it would be natural to say ‘coproduct’) (A, hεi ii∈I ) of hAi ii∈I . On such definitions, it is elementary that any two simple products, or free products, are isomorphic in the obvious sense (315Xa, 315Xg), and very general arguments from abstract algebra, not restricted to Boolean algebras (see Bourbaki 68, IV.3.2), show that they exist. (But in order to prove such basic facts as that the πi are surjective, or that the εi are, except when the construction collapses altogether, injective, we do of course have to look at the special properties of Boolean algebras.) Now in the case of simple products, the Cartesian product construction is so direct and so familiar that there seems no need to trouble our imaginations with any other. But in the case of free products, things are more complicated. I have given primacy to the construction in terms of Stone spaces because I believe that this is the fastest route to effective mental pictures. But in some ways this approach seems to be inappropriate. If you take what in my view is a tenable position, and say that a Boolean algebra is best regarded as the limit of its finite subalgebras, then you might prefer a construction of a free product as a limit of free products of finitely many finite subalgebras. Or you might feel that it is wrong to rely on the axiom of choice to prove a result which certainly does not need it (see 315Ye). Because I believe that the universal mapping theorem 315I is the right basis for the study of free products, I am naturally led to use it as the starting point for proofs of theorems about free products, as in 315K. But 315J(e-ii) seems to lie deeper. (Note, for instance, that in 315L we do need the axiom of choice, in part Q (c) of the proof, since without it the product i∈I Xi could be empty.) Both ‘simple product’ and ‘free product’ are essentially algebraic constructions involving the category of Boolean algebras and Boolean homomorphisms, and any relationships with such concepts as order-continuity must be regarded as accidental. 315Cb and 315D show that simple products behave very straightforwardly when the homomorphisms involved are order-continuous. 315P, 315Xm and 315Ya-315Yc show that free products are much more complex and subtle. For finite products, we have a kind of distributivity; (A × B) ⊗ C can be identified with (A ⊗ C) × (B ⊗ C) (315Xi, 315Xj). There are contexts in which this makes it seem more natural to write A ⊕ B in place of A × B, and indeed I have already spoken of a ‘direct sum’ of measure spaces (214K) in terms which correspond closely to the simple product of algebras of sets described in 315Ga. Generally, the simple product corresponds to disjoint unions of Stone spaces (315Xc) and the free product to products of Stone spaces. But the simple product is indeed the product Boolean algebra, in the ordinary category sense; the universal mapping theorem 315B is exactly of the type we expect from products of topological spaces (3A3Ib) or partially ordered sets (315Dc), etc. It is the ‘free product’ which is special to Boolean algebras. The nearest analogy that I know of elsewhere is with the concept of ‘tensor product’ of linear spaces (cf. §253).
316 Further topics I introduce two special properties of Boolean algebras which will be of great importance in the rest of this volume: the countable chain condition (316A-316F) and weak (σ, ∞)-distributivity (316G-316K). I end the section with brief notes on atoms in Boolean algebras (316L-316M). 316A Definitions (a) A Boolean algebra A is ccc, or satisfies the countable chain condition, if every disjoint subset of A is countable. (b) A topological space X is ccc, or satisfies the countable chain condition, or has Souslin’s property, if every disjoint collection of open sets in X is countable.
60
Boolean algebras
316B
316B Theorem A Boolean algebra A is ccc iff its Stone space Z is ccc. proof (a) If A is ccc and G is a disjoint family of open sets in Z, then for each G ∈ G 0 = G \ {∅} we can find a non-zero aG ∈ A such that the corresponding open-and-closed set b aG is included in G. Now {aG : G ∈ G 0 } is a disjoint family in A, so is countable; since aG 6= aH for distinct G, H ∈ G 0 , G 0 and G must be countable. As G is arbitrary, Z is ccc. (b) If Z is ccc and A ⊆ A is disjoint, then {b a : a ∈ A} is a disjoint family of open subsets of Z, so must be countable, and A is countable. As A is arbitrary, A is ccc. 316C Proposition Let A be a Dedekind σ-complete Boolean algebra and I a σ-ideal of A. Then the quotient algebra B = A/I is ccc iff every disjoint family in A \ I is countable. proof (a) Suppose that B is ccc and that A is a disjoint family in A \ I. Then {a• : a ∈ A} is a disjoint family in B, therefore countable, and a• 6= b• when a, b are distinct members of A; so A is countable. (b) Now suppose that B is not ccc. Then there is an uncountable disjoint set B ⊆ B. Of course B \ {0} is still uncountable, so may be enumerated as hbξ iξ<κ , where κ is an uncountable cardinal (2A1K), so that ω1 ≤ κ. For each ξ < ω1 , choose aξ ∈ A such that a•ξ = bξ . Of course aξ ∈ / I. If η < ξ < ω1 , then bη ∩ bξ = 0, so aξ ∩ aη ∈ I. Because ξ < ω1 , it is countable; because I is a σ-ideal, and A is Dedekind σ-complete, dξ = supη<ξ aξ ∩ aη ∈ I, so that cξ = aξ \ dξ ∈ A \ I. But now of course cξ ∩ cη ⊆ cξ ∩ aη ⊆ cξ ∩ dξ = 0 whenever η < ξ < ω1 , so {cξ : ξ < ω1 } is an uncountable disjoint family in A \ I. Remark An ideal I satisfying the conditions of this proposition is said to be ω1 -saturated in A. 316D Corollary Let X be a set, Σ a σ-algebra of subsets of X, and I a σ-ideal of A. Then the quotient algebra Σ/I is ccc iff every disjoint family in Σ \ I is countable. 316E Proposition Let A be a ccc Boolean algebra. Then for any A ⊆ A there is a countable B ⊆ A such that B has the same upper and lower bounds as A. proof (a) Set D=
S
a∈A {d
: d ⊆ a}.
Applying Zorn’s lemma to the family C of disjoint subsets of D, we have a maximal C0 ∈ C. For each c ∈ C0 choose a bc ∈ A such that c ⊆ bc , and set B0 = {bc : c ∈ C0 }. Because A is ccc, C0 is countable, so B0 is also countable. ?? If there is an upper bound e for B0 which is not an upper bound for A, take a ∈ A such that c0 = a \ e 6= 0; then c0 ∈ D and c0 ∩ c = c0 ∩ bc = 0 for every c ∈ C0 , so C0 ∪ {c0 } ∈ C; but C0 was supposed to be maximal in C. X X Thus every upper bound for B0 is also an upper bound for A. (b) Similarly, there is a countable set B10 ⊆ A0 = {1 \ a : a ∈ A} such that every upper bound for B10 is an upper bound for A0 . Set B1 = {1 \ b : b ∈ B10 }; then B1 is a countable subset of A and every lower bound for B1 is a lower bound for A. Try B = B0 ∪ B1 . Then B is a countable subset of A and every upper (resp. lower) bound for B is an upper (resp. lower) bound for A; so that B must have exactly the same upper and lower bounds as A has. 316F Corollary Let A be a ccc Boolean algebra. (a) If A is Dedekind σ-complete it is Dedekind complete. (b) If A ⊆ A is sequentially order-closed it is order-closed. (c) If Q is any partially ordered set and φ : A → Q is a sequentially order-continuous order-preserving function, it is order-continuous.
316Hb
Further topics
61
(d) If B is another Boolean algebra and π : A → B is a sequentially order-continuous Boolean homomorphism, it is order-continuous. proof (a) If A is any subset of A, let B ⊆ A be a countable set with the same upper bounds as A; then sup B is defined in A and must be sup A. (b) Suppose that B ⊆ A is non-empty and upwards-directed and has a supremum a in A. Then there is a non-empty countable set C ⊆ B with the same upper bounds as B. Let hcn in∈N be a sequence running over C. Because B is upwards-directed, we can choose hbn in∈N inductively such that b0 = c0 ,
bn+1 ∈ B, bn+1 ⊇ bn ∪ cn+1 for every n ∈ N.
Now any upper bound for {bn : n ∈ N} must also be an upper bound for {cn : n ∈ N} = C, so is an upper bound for the whole set B. But this means that a = supn∈N bn . As hbn in∈N is a non-decreasing sequence in A, and A is sequentially order-closed, a ∈ A. In the same way, if B ⊆ A is downwards-directed and has an infimum in A, this is also the infimum of some non-increasing sequence in B, so must belong to A. Thus A is order-closed. (c)(i) Suppose that A ⊆ A is a non-empty upwards-directed set with supremum a0 ∈ A. As in (b), there is a non-decreasing sequence hcn in∈N in A with supremum a0 . Because φ is sequentially order-continuous, φa0 = supn∈N φcn in Q. But this means that φa0 must be the least upper bound of φ[A]. (ii) Similarly, if A ⊆ A is a non-empty downwards-directed set with infimum a0 , there is a non-increasing sequence hcn in∈N in A with infimum a0 , so that inf φ[A] = inf n∈N φcn = φa0 . Putting this together with (i), we see that φ is order-continuous, as claimed. (d) This is a special case of (c). 316G Definition Let A be a Boolean algebra. We say that A is weakly (σ, ∞)-distributive if whenever hAn in∈N is a sequence of non-empty downwards-directed subsets of A all with infimum 0 in A, there is a set A ⊆ A, also with infimum 0, such that for every a ∈ A, n ∈ N there is an a0 ∈ An such that a0 ⊆ a. 316H Remarks (a) Note that for any Boolean algebra A, and any sequence hAn in∈N of non-empty downwards-directed subsets of A, the set B = {b : b ∈ A, ∀ n ∈ N ∃ a0 ∈ An such that a0 ⊆ b} is downwards-directed. P P If b1 , b2 ∈ B and n ∈ N, there are b01 , b02 ∈ An such that b1 ⊇ b01 and b2 ⊇ b02 ; now 0 there is a b ∈ An such that b0 ⊆ b01 ∩ b02 , and b1 ∩ b2 ⊇ b0 . As n is arbitrary, b1 ∩ b2 ∈ B; as b1 and b2 are arbitrary, B is downwards-directed. Q Q Also, B is not empty (as 1 ∈ B). If A is weakly (σ, ∞)-distributive and inf An = 0 for every n, then there is an A ⊆ B such that inf A = 0, so in this case inf B = 0. Thus a Boolean algebra A is weakly (σ, ∞)-distributive iff whenever hAn in∈N is a sequence of non-empty downwards-directed subsets of A all with infimum 0 in A, there is a downwards-directed set A ⊆ A, also with infimum 0, such that for every a ∈ A, n ∈ N there is an a0 ∈ An such that a0 ⊆ a. (b) I have expressed the definition above in terms which are adapted to general Boolean algebras. More often than not, however, the algebras we are concerned with will be Dedekind σ-complete, and in this case the condition for every a ∈ A, n ∈ N there is an a0 ∈ An such that a0 ⊆ a can be replaced by for every a ∈ A there is a sequence han in∈N such that an ∈ An for every n and supn∈N an ⊆ a; so that the whole conclusion there is a set A ⊆ A, also with infimum 0, such that for every a ∈ A, n ∈ N there is an a0 ∈ An such that an ⊆ a
62
Boolean algebras
316Hb
can be replaced by inf{supn∈N an : an ∈ An for every n ∈ N} = 0. Note that the set B 0 = {supn∈N an : an ∈ An for every n ∈ N} is also downwards-directed. 316I
As usual, a characterization of the property in terms of the Stone spaces is extremely valuable.
Theorem Let A be a Boolean algebra, and Z its Stone space. Then A is weakly (σ, ∞)-distributive iff every meager set in Z is nowhere dense. proof (a) Suppose that A is weakly (σ, ∞)-distributive and that M is a meager subset of Z. Then M S can be expressed as n∈N Mn where each Mn is nowhere dense. Set Bn = {b : b ∈ A, bb ∩ Mn = ∅}. S Then b∈Bn bb = Z \ M n is dense in Z, so sup Bn = 1 in A (313Ca). Set An = {1 \ b : b ∈ Bn }; then inf An = 0 (313Aa). Also Bn is upwards-directed (indeed, closed under ∪ ), so An is downwards-directed. Let A ⊆ A be a set with infimum 0 such that every member of A includes members of every An , and set B = {1 \ a : a ∈ A}. Then sup B = 1 and every member of B is included in members of every Bn , so that bb ∩ Mn = ∅ for every b ∈ B, n ∈ N. Now S b b∈B b is a dense open subset of Z (313Ca again) disjoint from M , so M is nowhere dense, as claimed. (b) Suppose that every meager set in Z is nowhere dense, and T that hAn in∈N is a sequence of non-empty a is nowhere dense for each n (313Cc), downwards-directed sets in A, all with infimum 0. Then Mn = a∈An b S so M = n∈N Mn is meager, therefore nowhere dense. Set B = {b : b ∈ A, bb ∩ M = ∅}, A = {1 \ b : b ∈ B}; then sup B = 1 and inf A = 0. If c ∈ A, n ∈ N then b c ⊇ M ⊇ Mn , so S a) = Mn \ b c = ∅; (Z \ b c) \ a∈An (Z \ b because Z \ b c is a is open for every a ∈ An , there must be finitely many a0 , . . . , ak ∈ An T compact and Z \ b ai , that is, c ⊇ inf i≤k ai . Because An is downwards-directed, there must be an a0 ∈ An such that b c ⊇ i≤k b such that a0 ⊆ ai for every i ≤ k, so that c ⊇ a0 . But this is exactly what is required of A in the definition 316G. As hAn in∈N is arbitrary, A is weakly (σ, ∞)-distributive. 316J
It will be convenient later to have spelt out an elementary inversion of the definition in 316G.
Proposition Let A be a Dedekind σ-complete weakly (σ, ∞)-distributive Boolean algebra. If hAn in∈N is a sequence of non-empty subsets of A such that cn = sup An is defined in A for each n ∈ N, then inf n∈N cn = sup{inf n∈N an : an ∈ An for every n ∈ N}. proof Set c = inf n∈N cn , A = {inf n∈N an : an ∈ An for every n ∈ N}. If an ∈ An for every n ∈ N, then inf n∈N an ⊆ c, just because an ⊆ cn for every n; thus c is an upper bound for A. On the other hand, if 0 6= d ⊆ c, d = sup{a ∩ d : a ∈ An }, so inf a∈An d \ a = 0, for every n (313Ba, 313Aa). Because A is weakly (σ, ∞)-distributive, there must therefore be a sequence han in∈N such that an ∈ An for every n ∈ N and inf n∈N d \ an 6= d, that is, d ∩ supn∈N an 6= 0. This shows that c \ d cannot be and upper bound for A; as d is arbitrary, c = sup A, as claimed. 316K The regular open algebra of R For examples of weakly (σ, ∞)-distributive algebras, I think we can wait for Chapter 32 (see also 392I). But the standard example of an algebra which is not weakly (σ, ∞)distributive is of such importance that (even though it has nothing to do with measure theory, narrowly defined) I think it right to describe it here. Proposition The algebra G of regular open subsets of R (314O) is not weakly (σ, ∞)-distributive. proof Enumerate Q as hqn in∈N . For each n ∈ N, set An = {G : G ∈ G, qi ∈ G for every i ≤ n}. Then An is downwards-directed, and inf An = int
T
An = int{qi : i ≤ n} = ∅.
316Xj
Further topics
63
But if A ⊆ G is such that for every n ∈ N, G ∈ A there is an H ∈ An such that H ⊆ G, then we must have Q ⊆ G for every G ∈ A, so that R = int Q ⊆ int G = G for every G ∈ A, and A ⊆ {R}; which means that inf A 6= ∅ in G, and 316G cannot be satisfied. 316L Atoms in Boolean algebras (a) If A is a Boolean algebra, an atom in A is a non-zero a ∈ A such that the only elements included in a are 0 and a. (b) A Boolean algebra is atomless if it has no atoms. (c) A Boolean algebra is purely atomic if every non-zero element includes an atom. 316M Proposition Let A be a Boolean algebra, with Stone space Z. (a) There is a one-to-one correspondence between atoms a of A and isolated points z ∈ Z, given by the formula b a = {z}. (b) A is atomless iff Z has no isolated points. (c) A is purely atomic iff the isolated points of Z form a dense subset of Z. proof (a)(i) If z is an isolated point in Z, then {z} is an open-and-closed subset of Z, so is of the form b a for some a ∈ A; now if b ⊆ a, bb must be either ∅ or {z}, so b must be either a or 0, and a is an atom. (ii) If a ∈ A and b a has two points z and w, then (because Z is Hausdorff, 311I) there is an open set G containing z but not w. Now there is a c ∈ A such that z ∈ b c ⊆ G, so that a ∩ c must be different from both 0 and a, and a is not an atom. (b) This follows immediately from (a). (c) From (a) we see that A is purely atomic iff b a contains an isolated point for every non-zero a ∈ A; since every non-empty open set in Z includes a non-empty set of the form b a, this happens iff every non-empty open set in Z contains an isolated point, that is, iff the set of isolated points is dense. 316X Basic exercises >(a) Show that any subalgebra of a ccc Boolean algebra is ccc. (b) Show that any principal ideal of a ccc Boolean algebra is ccc. (c) Let hAi ii∈I be a family of Boolean algebras, with simple product A. Show that A is ccc iff every Ai is ccc and {i : Ai 6= {0}} is countable. > (d) Let X be a separable topological space. Show that X is ccc. > (e) Show that the regular open algebra of a topological space X is ccc iff X is ccc, so that, in particular, the regular open algebra of R is ccc. (f ) Show that if A is a Boolean algebra and B is an order-dense subalgebra of A, then A is ccc iff B is. (g) Let A be a Dedekind σ-complete Boolean algebra. Show that it is ccc iff there is no family haξ iξ<ω1 in A such that aξ ⊂ aη whenever ξ < η < ω1 . (h) Let A be any Boolean algebra and I an order-closed ideal of A. Show that A/I is ccc iff there is no uncountable disjoint family in A \ I. (i) Let A be a ccc Boolean algebra. Show that if I is a σ-ideal of A, then it is order-closed, and A/I is ccc. (j) Let A be a Boolean algebra. Show that the following are equiveridical: (i) A is ccc; (ii) every σ-ideal of A is order-closed; (iii) every σ-subalgebra of A is order-closed; (iv) every sequentially order-continuous Boolean homomorphism from A to another Boolean algebra is order-continuous. (Hint: 313Q.)
64
Boolean algebras
316Xk
(k) Show that any principal ideal of a weakly (σ, ∞)-distributive Boolean algebra is a weakly (σ, ∞)distributive Boolean algebra. (l) Let hAi ii∈I be a family of Boolean algebras, with simple product A. Show that A is weakly (σ, ∞)distributive iff every Ai is. > (m) Show that if A is a weakly (σ, ∞)-distributive Boolean algebra and B is a subalgebra of A which is regularly embedded in A, then B is weakly (σ, ∞)-distributive. (n) Show that if A is a weakly (σ, ∞)-distributive Boolean algebra and I is an order-closed ideal of A, then A/I is weakly (σ, ∞)-distributive. > (o) (i) Show that if A is a Boolean algebra and B is an order-dense subalgebra of A, then A is weakly (σ, ∞)-distributive iff B is. (ii) Let X be a zero-dimensional compact Hausdorff space. Show that the regular open algebra of X is weakly (σ, ∞)-distributive iff the algebra of open-and-closed subsets of X is. (p) Let A be a Boolean algebra. Show that it is weakly (σ, ∞)-distributive iff whenever hCn in∈N is a sequence of partitions of unity in A, there is a partition C of unity such that for every c ∈ C, n ∈ N there is a finite set I ⊆ Cn such that c ⊆ sup I. > (q) Show that the algebra of open-and-closed subsets of {0, 1}N , with its usual topology, is not weakly (σ, ∞)-distributive. (r) Let A be a Boolean algebra and B an order-dense subalgebra of A. Show that A and B have the same atoms, so that A is atomless, or purely atomic, iff B is. (s) Let A be a Boolean algebra and B a regularly embedded subalgebra of A. Show that (i) every atom of A is included in an atom of B (ii) if A is purely atomic, so is B (iii) if B is atomless, so is A. >(t) Let A be a Dedekind complete purely atomic Boolean algebra. Show that it is isomorphic to PA, where A is the set of atoms of A. (u) Let A be a Boolean algebra and I an order-closed ideal of A. Show that (i) if A is atomless, so is A/I (ii) if A is purely atomic, so is A/I. (v) Let A be a Boolean algebra. Show that (i) if A is atomless, so is every principal ideal of A (ii) if A is purely atomic, so is every principal ideal of A. (w) Let hAi ii∈I be a family of Boolean algebras with simple product A. Show that (i) A is purely atomic iff every Ai is (ii) A is atomless iff every Ai is. > (x) Show that any purely atomic Boolean algebra is weakly (σ, ∞)-distributive. (y) Let A be a Boolean algebra. Show that there is a one-to-one correspondence between atoms a of A and order-continuous Boolean homomorphisms φ : A → Z2 , defined by saying that φ corresponds to a iff φ(a) = 1. 316Y Further exercises (a) Let I be any set. Show that {0, 1}I , with its usual topology, is ccc. (Hint: show that if E ⊆ {0, 1}I is a non-empty open-and-closed set, then µE > 0, where µ is the usual measure on {0, 1}I .) (b) Show that the Stone space of the regular open algebra of R is separable. More generally, show that if a topological space X is separable so is the Stone space of its regular open algebra. (c) Let A be a Boolean algebra and Z its Stone space. Show that A is ccc iff every nowhere dense subset of Z is included in a nowhere dense zero set.
316Ym
Further topics
65
(d) Let X be a zero-dimensional topological space. Show that X is ccc iff the regular open algebra of X is ccc iff the algebra of open-and-closed subsets of X is ccc. (e) Set X = {0, 1}ω1 , and for ξ < ω1 set Eξ = {x : x ∈ X, x(ξ) = 1}. Let Σ be the algebra of subsets of X generated by {Eξ : ξ < ω1 } ∪ {{x} : x ∈ X}, and I the σ-ideal of Σ generated by {Eξ ∩ Eη : ξ < η < ω1 } ∪ {{x} : x ∈ X}. Show that Σ/I is not ccc, but that there is no uncountable disjoint family in Σ \ I. (f ) Let X be a regular topological space and G its regular open algebra. Show that G is weakly (σ, ∞)distributive iff every meager set in X is nowhere dense. (g) Let A be a Boolean algebra. A is weakly σ-distributive if whenever hamn im,n∈N is a double sequence in A such that hamn in∈N is non-increasing and has infimum 0 for every m ∈ N, then inf{a : ∀ m ∈ N ∃ n ∈ N, amn ⊆ a} = 0. (Dedekind complete weakly σ-distributive algebras are also called ω ω -bounding.) A has the Egorov property if whenever hamn im,n∈N is a double sequence in A such that hamn in∈N is non-increasing and has infimum 0 for every m ∈ N, then there is a non-increasing sequence ham im∈N such that inf m∈N am = 0 and for every m ∈ N there is an n ∈ N such that am ⊇ amn . (i) Show that if A has the Egorov property it is weakly σ-distributive. (ii) Show that if A is weakly (σ, ∞)-distributive it is weakly σ-distributive. (iii) Show that if A is ccc then it is weakly (σ, ∞)-distributive iff it has the Egorov property iff it is weakly σ-distributive. (iv) Show that P(NN ) does not have the Egorov property, even though it is weakly (σ, ∞)distributive. (Hint: try amn = {f : f (m) ≥ n}.) (h) Let A be a Boolean algebra and Z its Stone space. (i) Show that A is weakly σ-distributive iff the union of any sequence of nowhere dense zero sets in Z is nowhere dense. (ii) Show that A has the Egorov property iff the union of any sequence of nowhere dense zero sets in Z is included in a nowhere dense zero set. (i) Let A be a Dedekind σ-complete weakly (σ, ∞)-distributive Boolean algebra, Z its Stone space, E the algebra of open-and-closed subsets of Z, M the σ-ideal of meager subsets of Z, and Σ the Baire property algebra {E4M : E ∈ E, M ∈ M}, as in 314M. (i) Suppose that f : Z → R is a Σ-measurable function. Show that there is a dense open set G ⊆ Z such that f ¹G is continuous. (ii) Now suppose that A is Dedekind complete. Show that if f : Z → R is a function such that f ¹G is continuous for some dense open set G ⊆ Z, then f is Σ-measurable; and that if f is also bounded, there is a continuous function g : Z → R such that {z : f (z) 6= g(z)} is meager. (Hint: the graph of g will be the closure of the graph of f ¹G; because Z is extremally disconnected, this is the graph of a function.) (j) (i) Let X be a non-empty separable Hausdorff space without isolated points. Show that its regular open algebra is not weakly (σ, ∞)-distributive. (ii) Let (X, ρ) be a non-empty metric space without isolated points. Show that its regular open algebra is not weakly (σ, ∞)-distributive. (iii) Let I be any infinite set. Show that the algebra of open-and-closed subsets of {0, 1}I is not weakly (σ, ∞)-distributive. Show that the regular open algebra of {0, 1}I is not weakly (σ, ∞)-distributive. (k) For any set X, write CX = {I : I ⊆ X is finite} ∪ {X \ I : I ⊆ X is finite}. (i) Show that CX is an algebra of subsets of X (the finite-cofinite algebra). (ii) Show that a Boolean algebra is purely atomic iff it has an order-dense subalgebra isomorphic to the finite-cofinite algebra of some set. (iii) Show that a Dedekind σ-complete Boolean algebra is purely atomic iff it has an order-dense subalgebra isomorphic to the countable-cocountable algebra of some set (211R). (l) Let hAi ii∈I be a family of Boolean algebras, none of them {0}, with free product A. (i) Show that A is purely atomic iff every Ai is purely atomic and {i : Ai 6= {0, 1}} is finite. (ii) Show that A is atomless iff either some Ai is atomless or {i : Ai 6= {0, 1}} is infinite. (m) Show that a Boolean algebra is isomorphic to the algebra of open-and-closed subsets of {0, 1}N iff it is countable, atomless and not {0}.
66
Boolean algebras
316Yn
(n) Show that a Boolean algebra is isomorphic to the regular open algebra of R iff it is atomless, Dedekind complete, has a countable order-dense subalgebra and is not {0}. (o) Let G be the regular open algebra of R. Show that there is an injective Boolean homomorphism π : G → PN. (Hint: the Stone space of G is separable.) Show that there is a Boolean homomorphism φ : PN → G such that φπ is the identity on PN. (Hint: 314K.) (p) Write [N]<ω for the ideal of PN consisting of the finite subsets of N. Show that PN/[N]<ω is atomless, weakly (σ, ∞)-distributive and not ccc. (q) Let X be a Hausdorff space and G its regular open algebra. (i) Show that the atoms of G are precisely the sets {x} where x is an isolated point in X. (ii) Show that G is atomless iff X has no isolated points. (iii) Show that G is purely atomic iff the set of isolated points in X is dense in X. 316 Notes and comments The phrase ‘countable chain condition’ is perhaps unfortunate, since the disjoint sets to which the definition 316A refers could more naturally be called ‘antichains’; but there is in fact a connexion between countable chains and countable antichains (316Xg). While some authors speak of the ‘countable antichain condition’ or ‘cac’, the term ‘ccc’ has become solidly established. In the Boolean algebra context, it could equally well be called the ‘countable sup property’ (316E). The countable chain condition can be thought of as a restriction on the ‘width’ of a Boolean algebra; it means that the algebra cannot spread too far laterally (see 316Xc), though it may be indefinitely complex in other ways. Generally it means that in a wide variety of contexts we need look only at countable families and monotonic sequences, rather than arbitrary families and directed sets (316E, 316F, 316Yg). Many of the ideas of 316B-316F have already appeared in 215B; see 322G below. I remarked in the notes to §313 that the distributive laws described in 313B have important generalizations, of which ‘weak (σ, ∞)-distributivity’ and its cousin ‘weak σ-distributivity’ (316Yg) are two. They are characteristic of the measure algebras which are the chief subject of this volume. The ‘Egorov property’ (316Yg) is an alternative formulation applicable to ccc spaces. Of course every property of Boolean algebras has a reflection in a topological property of their Stone spaces; happily, the concepts of this section correspond to reasonably natural topological expressions (316B, 316I, 316M, 316Yh). With four new properties (ccc, weakly (σ, ∞)-distributive, atomless, purely atomic) to incorporate into the constructions of the last few sections, a very large number of questions can be asked; most are elementary. Any subalgebra of a ccc algebra is ccc (316Xa). All four properties are inherited by order-dense subalgebras and principal ideals (316Xb, 316Xf, 316Xk, 316Xo, 316Xs, 316Xv); with the exception of the countable chain condition (316Xc), they are inherited by simple products (316Xl, 316Xw); with the exception of atomlessness, they are inherited by regularly embedded subalgebras (316Xm, 316Xs), and, in particular, by order-closed subalgebras of Dedekind complete algebras. As for quotient algebras (equivalently, homomorphic images), all four properties are inherited by order-continuous images (316Xi, 316Xn, 316Xu). The countable chain condition is so important that it is worth noting that a sequentially order-continuous image of a ccc algebra is ccc (316Xi), and that there is a useful necessary and sufficient condition for a sequentially order-continuous image of a σ-complete algebra to be ccc (316C, 316D, 316Xh; but see also 316Ye). To see that sequentially order-continuous images do not inherit weak (σ, ∞)-distributivity, recall that the regular open algebra of R is isomorphic to the quotient of the Baire-property algebra Bb of R by the meager ideal M (314Yd); but that Bb is purely atomic (since it contains all singletons), therefore weakly (σ, ∞)-distributive (316Xx). Similarly, PN/[N]<ω is a non-ccc image of a ccc algebra (316Yp). The definitions here provide a language in which a remarkably interesting question can be asked: is the free product of ccc Boolean algebras always ccc? equivalently, is the product of ccc topological spaces always ccc? What is special about this question is that it cannot be answered within the ordinary rules of mathematics (even including the axiom of choice); it is undecidable, in the same way that the continuum hypothesis is. I will deal with a variety of undecidable questions in Volume 5; this particular one is treated in Jech 78 and Fremlin 84. Note that the free product of two weakly (σ, ∞)-distributive algebras need not be weakly (σ, ∞)-distributive (325Yd). I have taken the opportunity to mention three of the most important of all Boolean algebras: the algebra of open-and-closed subsets of {0, 1}N (316Ym), the regular open algebra of R (316K, 316Yn) and the quotient
316 Notes
Further topics
67
PN/[N]<ω (316Yp). A fourth algebra which belongs in this company is the Lebesgue measure algebra, which is atomless, ccc and weakly (σ, ∞)-distributive (so that every countable subset of its Stone space Z is nowhere dense, and Z is a non-separable ccc space); but for this I wait for the next chapter.
68
Measure algebras
Chapter 32 Measure algebras I now come to the real work of this volume, the study of the Boolean algebras of equivalence classes of measurable sets. In this chapter I work through the ‘elementary’ theory, defining this to consist of the parts which do not depend on Maharam’s theorem or the lifting theorem or non-trivial set theory. §321 gives the definition of ‘measure algebra’, and relates this idea to its origin as the quotient of a σalgebra of measurable sets by a σ-ideal of negligible sets, both in its elementary properties (following those of measure spaces treated in §112) and in an appropriate version of the Stone representation. §322 deals with the classification of measure algebras according to the scheme already worked out in §211 for measure spaces. §323 discusses the canonical topology and uniformity of a measure algebra. §324 contains results concerning Boolean homomorphisms between measure algebras, with the relationships between topological continuity, order-continuity and preservation of measure. §325 is devoted to the measure algebras of product measures, and their abstract characterization. Finally, §§326-327 address the properties of additive functionals on Boolean algebras, generalizing the ideas of Chapter 23.
321 Measure algebras I begin by defining ‘measure algebra’ and relating this concept to the work of Chapter 31 and to the elementary properties of measure spaces. 321A Definition A measure algebra is a pair (A, µ ¯), where A is a Dedekind σ-complete Boolean algebra and µ ¯ : A → [0, ∞] is a function such that µ ¯0 = 0; P∞ ¯ an ; whenever han in∈N is a disjoint sequence in A, µ ¯(supn∈N an ) = n=0 µ µ ¯a > 0 whenever a ∈ A and a 6= 0. 321B Elementary properties of measure algebras Corresponding to the most elementary properties of measure spaces (112C in Volume 1), we have the following basic properties of measure algebras. Let (A, µ ¯) be a measure algebra. (a) If a, b ∈ A and a ∩ b = 0 then µ ¯(a ∪ b) = µ ¯a + µ ¯b. P P Set a0 = a, a1 = b, an = 0 for n ≥ 2; then P∞ µ ¯(a ∪ b) = µ ¯(supn∈N an ) = n=0 µ ¯ an = µ ¯a + µ ¯b. Q Q (b) If a, b ∈ A and a ⊆ b then µ ¯a ≤ µ ¯b. P P µ ¯a ≤ µ ¯a + µ ¯(b \ a) = µ ¯b. Q Q (c) For any a, b ∈ A, µ ¯(a ∪ b) ≤ µ ¯a + µ ¯b. P P µ ¯(a ∪ b) = µ ¯a + µ ¯(b \ a) ≤ µ ¯a + µ ¯b. Q Q P∞ (d) If han in∈N is any sequence in A, then µ ¯(supn∈N an ) ≤ n=0 µ ¯ an . P P For each n, set bn = an \ supi
321F
Measure algebras
µ ¯(sup an ) = µ ¯(sup bn ) = n∈N
n∈N
= lim
n→∞
n X
∞ X
69
µ ¯bn
n=0
µ ¯bi = lim µ ¯(sup bi ) = lim µ ¯ an . Q Q
i=0
n→∞
n→∞
i≤n
(f ) If han in∈N is a non-increasing sequence in A and inf n∈N µ ¯an < ∞, then µ ¯(inf n∈N an ) = limn→∞ µ ¯ an . P P (Cf. 112Cf.) Set a = inf n∈N an . Take k ∈ N such that µ ¯ak < ∞. Set bn = ak \ an for n ∈ N; then hbn in∈N is non-decreasing and supn∈N bn = ak \ a (313Ab). Because µ ¯ak is finite, µ ¯a = µ ¯ ak − µ ¯(ak \ a) = µ ¯ak − lim µ ¯ bn n→∞
(by (e) above) = lim µ ¯(ak \ bn ) = lim µ ¯an . Q Q n→∞
n→∞
321C Proposition Let (A, µ ¯) be a measure algebra, and A ⊆ A a non-empty upwards-directed set. If supa∈A µ ¯a < ∞, then sup A is defined in A and µ ¯(sup A) = supa∈A µ ¯a. proof (Compare 215A.) Set γ = supa∈A µ ¯a, and for each n ∈ N choose an ∈ A such that µ ¯an ≥ γ − 2−n . Next, choose hbn in∈N in A such that bn+1 ⊇ bn ∪ an for each n, and set b = supn∈N bn . Then µ ¯b = limn→∞ µ ¯bn ≤ γ,
µ ¯ an ≤ µ ¯b for every n ∈ N,
so µ ¯b = γ. If a ∈ A, then for every n ∈ N there is an a0n ∈ A such that a ∪ an ⊆ a0n , so that µ ¯(a \ b) ≤ µ ¯(a \ an ) ≤ µ ¯(a0n \ an ) = µ ¯a0n − µ ¯ an ≤ γ − µ ¯an ≤ 2−n . This means that µ ¯(a \ b) = 0, so a \ b = 0 and a ⊆ b. Accordingly b is an upper bound of A, and is therefore sup A; since we already know that µ ¯b = γ, the proof is complete. 321D Corollary Let (A, µ ¯) be a measure algebra and A ⊆ A a non-empty upwards-directed set. If sup A is defined in A, then µ ¯(sup A) = supa∈A µ ¯a. proof If supa∈A µ ¯a = ∞, this is trivial; otherwise it follows from 321C. 321E Corollary ¯) be a measure algebra and A ⊆ A a disjoint set. If sup A is defined in A, P Let (A, µ ¯a. then µ ¯(sup A) = a∈A µ proof If A = ∅ then sup A = 0 and the result is trivial. Otherwise, set B = {a0 ∪ . . . ∪ an : a0 , . . . , an ∈ A P are distinct}. Then B is upwards-directed, and supb∈B µ ¯b = a∈A µ ¯a because A is disjoint. Also B has the same upper bounds as A, so sup B = sup A and P µ ¯(sup A) = µ ¯(sup B) = supb∈B µ ¯b = a∈A µ ¯a. 321F Corollary Let (A, µ ¯) be a measure algebra and A ⊆ A a non-empty downwards-directed set. If inf a∈A µ ¯a < ∞, then inf A is defined in A and µ ¯(inf A) = inf a∈A µ ¯a. proof Take a0 ∈ A with µ ¯a0 < ∞, and set B = {a0 \ a : a ∈ A}. Then B is upwards-directed, and supb∈B µ ¯b ≤ µ ¯a0 < ∞, so sup B is defined. Accordingly inf A = a0 \ sup B is defined (313Aa), and µ ¯(inf A) = µ ¯a0 − µ ¯(sup B) = µ ¯a0 − sup µ ¯b b∈B
= inf µ ¯(a0 \ b) = inf µ ¯(a0 ∩ a) = inf µ ¯a. b∈B
a∈A
a∈A
70
Measure algebras
321G
321G Subalgebras If (A, µ ¯) is a measure algebra, and B is a σ-subalgebra of A, then (B, µ ¯¹ B) is a measure algebra. P P As remarked in 314Eb, B is Dedekind σ-complete. If hbn in∈N is a disjoint sequence in P∞ B, then the supremum b = supn∈N bn is the same whether taken in B or A, so that we have µ ¯b = n=0 µ ¯ bn . Q Q 321H The measure algebra of a measure space I introduce the abstract notion of ‘measure algebra’ because I believe that this is the right language in which to formulate the questions addressed in this volume. However it is very directly linked with the idea of ‘measure space’, as the next two results show. Proposition Let (X, Σ, µ) be a measure space, and N the ideal of µ-negligible sets. Let A be the Boolean algebra quotient Σ/Σ ∩ N . Then we have a functional µ ¯ : A → [0, ∞] defined by setting µ ¯E • = µE for every E ∈ Σ, and (A, µ ¯) is a measure algebra. The canonical map E 7→ E • : Σ → A is sequentially order-continuous. proof (a) By 314C, A is a Dedekind σ-complete Boolean algebra. By 313Qb, E 7→ E • is sequentially order-continuous, because N ∩ Σ is a σ-ideal of Σ. (b) If E, F ∈ Σ and E • = F • in A, then E4F ∈ N , so µE ≤ µF + µ(E \ F ) = µF ≤ µE + µ(F \ E) = µE and µE = µF . Accordingly the given formula does indeed define a function µ ¯ : A → [0, ∞]. (c) Now µ ¯0 = µ ¯∅• = µ∅ = 0. If hanS in∈N is a disjoint sequence in A, choose for each n ∈ N an En ∈ Σ such that En• = an . Set Fn = En \ i
0. Thus (A, µ ¯) is a measure algebra. 321I Definition For any measure space (X, Σ, µ) I will call (A, µ ¯), as constructed above, the measure algebra of (X, Σ, µ). 321J The Stone representation of a measure algebra Just as with Dedekind σ-complete Boolean algebras (314N), every measure algebra is obtainable from the construction above. Theorem Let (A, µ ¯) be any measure algebra. Then it is isomorphic, as measure algebra, to the measure algebra of some measure space. proof (a) We know from 314M that A is isomorphic, as Boolean algebra, to a quotient algebra Σ/M where Σ is a σ-algebra of subsets of the Stone space Z of A, and M is the ideal of meager subsets of Z. Let π : Σ/M → A be the canonical isomorphism, and set θE = πE • for each E ∈ Σ; then θ : Σ → A is a sequentially order-continuous surjective Boolean homomorphism with kernel M. (b) For E ∈ Σ, set νE = µ ¯(θE). Then (Z, Σ, ν) is a measure space. P P (i) We know already that Σ is a σ-algebra of subsets of Z. (ii) ν∅ = µ ¯(θ∅) = µ ¯0 = 0. (iii) If hEn in∈N is a disjoint sequence in Σ, then (because θ is a Boolean S homomorphism) hθEn in∈N is a disjoint sequence in A and (because θ is sequentially order-continuous) θ( n∈N En ) = supn∈N θEn ; so
321 Notes
Measure algebras
71
S P∞ P∞ ν( n∈N En ) = µ ¯(supn∈N θEn ) = n=0 µ ¯(θEn ) = n=0 νEn . Q Q (c) For E ∈ Σ, νE = 0 ⇐⇒ µ ¯(θE) = 0 ⇐⇒ θE = 0 ⇐⇒ E ∈ M. So the measure algebra of (Z, Σ, ν) is just Σ/M, with ν¯E • = νE = µ ¯(θE) = µ ¯(πE • ) for every E ∈ Σ. Thus the Boolean algebra isomorphism π is also an isomorphism between the measure algebras (Σ/M, ν¯) and (A, µ ¯), and (A, µ ¯) is represented in the required form. 321K Definition I will call the measure space (Z, Σ, ν) constructed in the proof of 321J the Stone space of the measure algebra (A, µ ¯). For later reference, I repeat the description of this space as developed in 311E, 311I, 314M and 321J. Z is a compact Hausdorff space, being the Stone space of A. A can be identified with the algebra of open-andclosed sets in Z. The ideal of ν-negligible sets coincides with the ideal of meager subsets of Z; in particular, ν is complete. The measurable sets are precisely those expressible in the form E = b a4M where a ∈ A, b a ⊆ Z is the corresponding open-and-closed set, and M is meager; in this case νE = µ ¯a and a = θE is the member of A corresponding to E. For the most important classes of measure algebras, more can be said; see 322M et seq. below. 321X Basic exercises (a) Let (A, µ ¯) be a measure algebra, and a ∈ A. Show that (Aa , µ ¯¹ Aa ) is a measure algebra, writing Aa for the principal ideal of A generated by a. (b) Let (X, Σ, µ ¯) be a measure space, and A its measure algebra. (i) Show that if T is a σ-subalgebra of Σ, then {E • : E ∈ T} is a σ-subalgebra of A. (ii) Show that if B is a σ-subalgebra of A then {E : E ∈ Σ, E • ∈ B} is a σ-subalgebra of Σ. 321Y Further exercises (a) Let (A, µ ¯) be a measure algebra, and I C A a σ-ideal. For u ∈ A/I set µ ¯u = inf{¯ µa : a ∈ A, a• = u}. Show that (A, µ ¯) is a measure algebra. 321 Notes and comments The idea behind taking the quotient Σ/N , where Σ is the algebra of measurable sets and N is the ideal of negligible sets, is just that if negligible sets can be ignored – as is the case for a very large proportion of the results of measure theory – then two measurable sets can be counted as virtually the same if they differ by a negligible set, that is, if they represent the same member of the measure algebra. The definition in 321A is designed to be an exact characterization of these quotient algebras, taking into account the measures with which they are endowed. In the course of the present chapter I will work through many of the basic ideas dealt with in Volumes 1 and 2 to show how they can be translated into theorems about measure algebras, as I have done in 321B-321F. It is worth checking these correspondences carefully, because some of the ideas mutate significantly in translation. In measure algebras, it becomes sensible to take seriously the suprema and infima of uncountable sets (see 321C-321F). I should perhaps remark that while the Stone representation (321J-321K) is significant, it is not the most important method of representing measure algebras, which is surely Maharam’s theorem, to be dealt with in the next chapter. Nevertheless, the Stone representation is a canonical one, and will appear at each point that we meet a new construction involving measure algebras, just as the ordinary Stone representation of Boolean algebras can be expected to throw light on any aspect of Boolean algebra.
72
Measure algebras
§322 intro.
322 Taxonomy of measure algebras Before going farther with the general theory of measure algebras, I run through those parts of the classification of measure spaces in §211 which have expressions in terms of measure algebras. The most important concepts at this stage are those of ‘semi-finite’, ‘localizable’ and ‘σ-finite’ measure algebra (322Ac322Ae); these correspond exactly to the same terms applied to measure spaces (322B). I briefly investigate the Boolean-algebra properties of semi-finite and σ-finite measure algebras (322F, 322G), with mentions of completions and c.l.d. versions (322D), subspace measures (322I-322J), direct sums of measure spaces (322K, 322L) and subalgebras of measure algebras (322M). It turns out that localizability of a measure algebra is connected in striking ways to the properties of the canonical measure on its Stone space (322N). I end the section with a description of the ‘localization’ of a semi-finite measure algebra (322O-322P) and with some further properties of Stone spaces (322Q). 322A Definitions Let (A, µ ¯) be a measure algebra. (a) I will say that (A, µ ¯) is a probability algebra if µ ¯1 = 1. (b) (A, µ ¯) is totally finite if µ ¯1 < ∞. ¯an < ∞ for every n ∈ N and (c) (A, µ ¯) is σ-finite if there is a sequence han in∈N in A such that µ supn∈N an = 1. Note that in this case han in∈N can be taken either to be non-decreasing (consider a0n = supi
The first step is to relate these concepts to the corresponding ones for measure spaces.
Theorem Let (X, Σ, µ) be a measure space, and (A, µ ¯) its measure algebra. Then (a) (X, Σ, µ) is a probability space iff (A, µ ¯) is a probability algebra; (b) (X, Σ, µ) is totally finite iff (A, µ ¯) is; (c) (X, Σ, µ) is σ-finite iff (A, µ ¯) is; (d) (X, Σ, µ) is semi-finite iff (A, µ ¯) is; (e) (X, Σ, µ) is localizable iff (A, µ ¯) is; (f) if E ∈ Σ, then E is an atom for µ iff E • is an atom in A; (g) (X, Σ, µ) is atomless iff A is; (h) (X, Σ, µ) is purely atomic iff A is. proof (a), (b) are trivial, since µ ¯1 = µX. (c)(i) If µ is σ-finite, let hEn in∈N be a sequence of sets of finite measure covering X; then µ ¯En• < ∞ for every n, and S supn∈N En• = ( n∈N En )• = 1, so (A, µ ¯) is σ-finite. (ii) If (A, µ ¯) is σ-finite, let han in∈N be a sequence in A such ¯an < ∞ for every n and supn∈N an = 1. Sthat µ For each n, choose En ∈ Σ such that En• = an . Set E = n∈N En ; then E • = supn∈N an = 1, so E is conegligible. Now (X \ E, E0 , E1 , . . . ) is a sequence of sets of finite measure covering X, so µ is σ-finite. (d)(i) Suppose that µ is semi-finite and that a ∈ A, µ ¯a = ∞. Then there is an E ∈ Σ such that E • = a, so that µE = µ ¯a = ∞. As µ is semi-finite, there is an F ∈ Σ such that F ⊆ E and 0 < µF < ∞. Set b = F • ; then b ⊆ a and 0 < µ ¯b < ∞. (ii) Suppose that (A, µ ¯) is semi-finite and that E ∈ Σ, µE = ∞. Then µ ¯E • = ∞, so there is a • • b ⊆ E such that 0 < µ ¯b < ∞. Let F ∈ Σ be such that F = b. Then F ∩ E ∈ Σ, F ∩ E ⊆ E and (F ∩ E)• = E • ∩ b = b, so that µ(F ∩ E) = µ ¯b ∈ ]0, ∞[.
322D
Taxonomy of measure algebras
73
(e)(i) Note first that if E ⊆ Σ and F ∈ Σ, then E \ F is negligible for every E ∈ E ⇐⇒ E • ⊆ F • = 0 for every E ∈ E ⇐⇒ F • is an upper bound for {E • : E ∈ E}. So if E ⊆ Σ and H ∈ Σ, then H is an essential supremum of E in Σ, in the sense of 211G, iff H • is the supremum of A = {E • : E ∈ E} in A. P P Writing F for {F : F ∈ Σ, E \ F is negligible for every E ∈ E}, we see that B = {F • : F ∈ F } is just the set of upper bounds of A, and that H is an essential supremum of E iff H ∈ F and H • is a lower bound for B; that is, iff H • = sup A. Q Q (ii) Thus A is Dedekind complete iff every family in Σ has an essential supremum in Σ. Since we already know that (A, µ ¯) is semi-finite iff µ is, we see that (A, µ ¯) is localizable iff µ is. (f ) This is immediate from the definitions in 211I and 316L, if we remember always that {b : b ⊆ E • } = {F • : F ∈ Σ, F ⊆ E} (312Kb). (g), (h) follow at once from (f). 322C
I copy out the relevant parts of Theorem 211L in the new context.
Theorem (a) A probability algebra is totally finite. (b) A totally finite measure algebra is σ-finite. (c) A σ-finite measure algebra is localizable. (d) A localizable measure algebra is semi-finite. proof All except (c) are trivial; and (c) may be deduced from 211Lc-211Ld, 322Bc, 322Be and 321J, or from 316Fa and 322G below. 322D Of course not all the definitions in §211 are directly relevant to measure algebras. The concepts of ‘complete’, ‘locally determined’ and ‘strictly localizable’ measure space do not correspond in any direct way to properties of the measure algebras. Indeed, completeness is just irrelevant, as the next proposition shows. ˆ µ ˜ µ Proposition Let (X, Σ, µ) be a measure space, with completion (X, Σ, ˆ) and c.l.d. version (X, Σ, ˜) (213E). Write (A, µ ¯), (A1 , µ ¯1 ) and (A2 , µ ¯2 ) for the measure algebras of µ, µ ˆ and µ ˜ respectively. ˆ corresponds to an isomorphism between (A, µ (a) The embedding Σ ⊆ Σ ¯) and (A1 , µ ¯1 ). ˜ defines an order-continuous Boolean homomorphism π : A → A2 . Setting (b)(i) The embedding Σ ⊆ Σ Af = {a : a ∈ A, µ ¯a < ∞}, π¹ Af is a measure-preserving bijection between Af and Af2 = {c : c ∈ A2 , µ ¯2 c < ∞}. (ii) π is injective iff µ is semi-finite, and in this case µ ¯2 (πa) = µ ¯a for every a ∈ A. (iii) If µ is localizable, π is a bijection. ˆ I write F ∗ for its image in A1 ; and for G ∈ Σ, ˜ I proof For E ∈ Σ, I write E ◦ for its image in A; for F ∈ Σ, • write F for its image in A2 . (a) This is nearly trivial. The map E 7→ E ∗ : Σ → A1 is a Boolean homomorphism, being the composition ˆ and F 7→ F ∗ : Σ ˆ → A1 . Its kernel is {E : E ∈ Σ, µ of the Boolean homomorphisms E 7→ E : Σ → Σ ˆE = 0} = {E : E ∈ Σ, µE = 0}, so it induces an injective Boolean homomorphism φ : A → A1 given by the formula φ(E ◦ ) = E ∗ for every E ∈ Σ (312F, 3A2G). To see that φ is surjective, take any b ∈ A1 . There is ˆ such that F ∗ = b, and there is an E ∈ Σ such that E ⊆ F and µ an F ∈ Σ ˆ(F \ E) = 0, so that π(E ◦ ) = E ∗ = F ∗ = b. Thus π is a Boolean algebra isomorphism. It is a measure algebra isomorphism because for any E ∈ Σ µ ¯1 φ(E ◦ ) = µ ¯1 E ∗ = µ ˆE = µE = µ ¯E ◦ .
74
Measure algebras
322D
(b)(i) The map E 7→ E • : Σ → A2 is a Boolean homomorphism with kernel {E : E ∈ Σ, µ ˜E = 0} ⊇ {E : E ∈ Σ, µE = 0}, so induces a Boolean homomorphism π : A → A2 , defined by saying that πE ◦ = E • for every E ∈ Σ. If a ∈ Af , it is expressible as E ◦ where µE < ∞. Then µ ˜E = µE (213Fa), so πa = E • belongs to Af2 , 0 f and µ ¯2 (πa) = µ ¯a. If a, a are distinct members of A , then µ ¯2 (πa 4 πa0 ) = µ ¯2 π(a 4 a0 ) = µ ¯(a 4 a0 ) > 0, so πa 6= πa0 ; thus π¹ Af is an injective map from Af to Af2 . If c ∈ Af2 , then c = G• where µ ˜G < ∞; by 213Fc, there is an E ∈ Σ such that E ⊆ G, µE = µ ˜G and µ ˜(G \ E) = 0, so that E ◦ ∈ Af and πE ◦ = E • = G• = c. As c is arbitrary, φ[Af ] = Af2 . Finally, π is order-continuous. P P Let A ⊆ A be a non-empty downwards-directed set with infimum 0, and b ∈ A2 a lower bound for π[A]. ?? If b 6= 0, then (because (A2 , µ ¯2 ) is semi-finite) there is a b0 ∈ Af2 such that 0 6= b0 ⊆ b. Let a0 ∈ A be such that πa0 = b0 . Then a0 6= 0, so there is an a ∈ A such that a 6⊇ a0 , that is, a ∩ a0 6= a0 . But now, because π¹ Af is injective, b0 = πa0 6= π(a ∩ a0 ) = πa ∩ πa0 = πa ∩ b0 , and b0 6⊆ πa, which is impossible. X X Thus b = 0, and 0 is the only lower bound of π[A]. As A is arbitrary, π is order-continuous (313L(b-ii)). Q Q (ii) (α) If µ is semi-finite, then µ ˜E = µE for every E ∈ Σ (213Hc), so µ ¯2 (πE ◦ ) = µ ¯2 E • = µ ˜E = µE = µ ¯E ◦ for every E ∈ Σ. In particular, πa = 0 =⇒ 0 = µ ¯2 (πa) = µ ¯a =⇒ a = 0, so π is injective. (β) If µ is not semi-finite, there is an E ∈ Σ such that µE = ∞ but µH = 0 whenever H ∈ Σ, H ⊆ E and µH < ∞; so that µ ˜E = 0 and E ◦ 6= 0,
πE ◦ = E • = 0.
So in this case π is not injective. ˜ there is an E ∈ Σ such that µ (iii) Now suppose that µ is localizable. Then for every G ∈ Σ ˜(E4G) = 0, ◦ • • by 213Hb; accordingly πE = E = G . As G is arbitrary, π is surjective; and we know from (ii) that π is injective, so it is a bijection, as claimed. 322E Proposition Let (A, µ ¯) be a measure algebra. (a) (A, µ ¯) is semi-finite iff it has a partition of unity consisting of elements of finite measure. (b) If (A, µ ¯) is semi-finite, a = sup{b : b ⊆ a, µ ¯b < ∞} and µ ¯a = sup{¯ µb : b ⊆ a, µ ¯b < ∞} for every a ∈ A. proof Set Af = {b : b ∈ A, µ ¯b < ∞}. (a)(i) If (A, µ ¯) is semi-finite, then Af is order-dense in A, so there is a partition of unity consisting of f members of A (313K). (ii) If there is a partition of unity C ⊆ Af , and µ ¯a = ∞, then there is a c ∈ C such that a ∩ c 6= 0, and now a ∩ c ⊆ a and 0 < µ ¯(a ∩ c) < ∞; as a is arbitrary, (A, µ ¯) is semi-finite. (b) Of course Af is upwards-directed, by 321Bc, and we are supposing that its supremum is 1. If a ∈ A, then B = {b : b ∈ Af , b ⊆ a} = {a ∩ b : b ∈ Af } is upwards-directed and has supremum a (313Ba), so µ ¯a = supb∈B µ ¯b, by 321D. Remark Compare 213A. 322F Proposition If (A, µ ¯) is a semi-finite measure algebra, then A is a weakly (σ, ∞)-distributive Boolean algebra.
322J
Taxonomy of measure algebras
75
proof Let hAn in∈N be a sequence of non-empty downwards-directed subsets of A, all with infimum 0. Set A = {supn∈N an : an ∈ An for every n ∈ N}. If c ∈ A \ {0}, let b ⊆ c be such that 0 < µ ¯b < ∞. For each n ∈ N, inf a∈An µ ¯(b ∩ an ) = 0, by 321F; so we may choose an ∈ An such that µ ¯(b ∩ an ) ≤ 2−n−2 µ ¯b. Set a = supn∈N an ∈ A. Then P∞ µ ¯(b ∩ a) ≤ n=0 µ ¯(b ∩ an ) < µ ¯b, so b 6⊆ a and c 6⊆ a. As c is arbitrary, inf A = 0; as hAn in∈N is arbitrary, A is weakly (σ, ∞)-distributive. 322G
Corresponding to 215B, we have the following description of σ-finite algebras.
Proposition Let (A, µ ¯) be a semi-finite measure algebra. Then the following are equiveridical: (i) (A, µ ¯) is σ-finite; (ii) A is ccc; (iii) either A = {0} or there is a functional ν¯ : A → [0, 1] such that (A, ν¯) is a probability algebra. proof (i) ⇐⇒ (ii) By 321J, it is enough to consider the case in which (A, µ ¯) is the measure algebra of a measure space (X, Σ, µ), and µ is semi-finite, by 322Bd. We know that A is ccc iff there is no uncountable disjoint set in Σ\N , where N is the ideal of negligible sets (316D). But 215B(iii) shows that this is equivalent to µ being σ-finite, which is equivalent to (A, µ ¯) being σ-finite, by 322Bc. (i)⇒(iii) If (A, µ ¯) is σ-finite, and A 6= {0}, let han in∈N be a disjoint sequence in A such ¯an < ∞ P∞that µ γ ¯an = 1. for every n and supn∈N an = 1. Then µ ¯ a > 0 for some n, so there are γ > 0 such that n n=0 n µ P∞ P∞ n ¯(a ∩ an ) for every a ∈ A; it is easy to ¯ai ).) Set νa = n=0 γn µ (Set γn0 = 2−n /(1 + µ ¯an ), γn = γn0 /( i=0 γi0 µ check that (A, ν¯) is a probability algebra. (iii)⇒(i) is a consequence of (ii)⇒(i). 322H Principal ideals If (A, µ ¯) is a measure algebra and a ∈ A, then it is easy to see (using 314Eb) that (Aa , µ ¯¹ Aa ) is a measure algebra, where Aa is the principal ideal of A generated by a. 322I Subspace measures General subspace measures give rise to complications in the measure algebra (see 322Xg, 322Yd). But subspaces with measurable envelopes (132D, 213K) are manageable. Proposition Let (X, Σ, µ) be a measure space, and A ⊆ X a set with a measurable envelope E. Let µA be the subspace measure on A, and ΣA its domain; let (A, µ ¯) be the measure algebra of (X, Σ, µ) and (AA , µ ¯A ) the measure algebra of (A, ΣA , µA ). Set a = E • and let Aa be the principal ideal of A generated by a. Then we have an isomorphism between (Aa , µ ¯¹ Aa ) and (AA , µ ¯A ) given by the formula F • 7→ (F ∩ A)◦ whenever F ∈ Σ and F ⊆ E, writing F • for the equivalence class of F in A and (F ∩ A)◦ for the equivalence class of F ∩ A in AA . proof Set ΣE = {E ∩ F : F ∈ Σ}. For F , G ∈ ΣE , F • = G• ⇐⇒ µ(F 4G) = 0 ⇐⇒ µA (A ∩ (F 4G)) = 0 ⇐⇒ (F ∩ A)◦ = (G ∩ A)◦ , because E is a measurable envelope of A. Accordingly the given formula defines an injective function from the image {F • : F ∈ ΣE } of ΣE in A to AA ; but this image is just the principal ideal Aa . It is easy to check that the map is a Boolean homomorphism from Aa to AA , and it is a Boolean isomorphism because ΣA = {F ∩ A : F ∈ ΣE }. Finally, it is measure-preserving because µ ¯F • = µF = µ∗ (F ∩ A) = µA (F ∩ A) = µ ¯A (F ∩ A)◦ for every F ∈ ΣE , again using the fact that E is a measurable envelope of A. 322J Corollary Let (X, Σ, µ) be a measure space, with measure algebra (A, µ ¯). (a) If E ∈ Σ, then the measure algebra of the subspace measure µE can be identified with the principal ideal AE • of A. (b) If A ⊆ X is a set of full outer measure (in particular, if µ∗ A = µX < ∞), then the measure algebra of the subspace measure µA can be identified with A.
76
Measure algebras
322K
322K Simple products (a) QLet h(Ai , µ ¯i )ii∈I be any indexed family ofP measure algebras. Let A be the simple product Boolean algebra i∈I Ai (315A), and for a ∈ A set µ ¯a = i∈I µ ¯i a(i). Then it is easy to check (using 315D(e-ii)) that (A, µ ¯) is a measure algebra; I will call it the simple product of the family h(Ai , µ ¯i )ii∈I . Each of the Ai corresponds to a principal ideal Aei say in A, where ei ∈ A corresponds to 1Ai ∈ Ai (315E), and the Boolean isomorphism between Ai and Aei is a measure algebra isomorphism between (Ai , µ ¯i ) and (Aei , µ ¯¹ Aei ). (b) If h(Xi , Σi , µi )ii∈I is a family of measure spaces, with direct sum (X, Σ, µ) (214K), then the measure algebra (A, µ ¯) of (X, Σ, µ) can be identified with the simple product of the measure algebras (Ai , µ ¯i ) of the (Xi , Σi , µi ). P P If, as in 214K, we set X = {(x, i) : i ∈ I, x ∈ Xi }, andQfor E ⊆ X, i ∈ I we set Ei = {x : (x, i) ∈ E}, Q then the Boolean isomorphism E 7→ hEi ii∈I : Σ → i∈I Σi induces a Boolean isomorphism from A to i∈I Ai , which is also a measure algebra isomorphism, because P P µ ¯E • = µE = i∈I µi Ei = i∈I µ ¯i Ei• for every E ∈ Σ. Q Q (c) A product of measure algebras is semi-finite, or localizable, or atomless, or purely atomic, iff every factor is. (Compare 214Jb.) (d) Let (A, µ ¯) be a localizable measure algebra.
Q ¯ ¹ Aei ) (i) If hei ii∈I is any partition of unity in A, then (A, µ ¯) is isomorphic to the product i∈I (Aei , µ of the corresponding principal ideals. P P By 315F(iii), the map a → 7 ha ∩ ei ii∈I is a Boolean isomorphism P Q µ ¯(a ∩ ei ) (321E), for ¯a = i∈I Q between A and i∈I Ai . Because hei ii∈I is disjoint and a = supi∈I a ∩ ei , µ ¯¹ Aei ). Q Q every a ∈ A. So a 7→ ha ∩ ei ii∈I is a measure algebra isomorphism between (A, µ ¯) and i∈I (Ai , µ (ii) In particular, since A has a partition of unity consisting of elements of finite measure (322Ea), (A, µ ¯) is isomorphic to a simple product of totally finite measure algebras. Each of these is isomorphic to the measure algebra of a totally finite measure space, so (A, µ ¯) is isomorphic to the measure algebra of a direct sum of totally finite measure spaces, which is strictly localizable. Thus every localizable measure algebra is isomorphic to the measure algebra of a strictly localizable measure space. (See also 322N below.) *322L Strictly localizable spaces The following fact is occasionally useful. Proposition Let (X, Σ, µ) be a strictly localizable measure space with µX > 0, and (A, µ ¯) its measure algebra. If hai ii∈I is a partition of unity in A, there is a disjoint family hXi ii∈I in Σ, with union X, such that Xi• = ai for every i ∈ I and Σ = {E : E ⊆ X, E ∩ Xi ∈ Σ ∀ i ∈ I, P µE = i∈I µ(E ∩ Xi ) for every E ∈ Σ; Q that is, the isomorphism between A and the simple product i∈I Aai of its principal ideals (315F) corresponds to an isomorphism between (X, Σ, µ) and the direct sum of the subspace measures on Xi . proof (a) Suppose to begin with that µX < ∞. In this case J = {i : S ai 6= 0} must be countable (322G). For each i ∈ J, choose Ei ∈ Σ such that Ei• = ai , and set Fi = Ei \ j∈J,j6=i Ej ; then Fi• = ai for each i ∈ J, and hFi ii∈J is disjoint. Because µX > 0, J is non-empty; fix some j0 ∈ J and set [ Xi = Fj0 ∪ (X \ Fj ) if i = j0 , j∈J
= Fi for i ∈ J \ {j0 }, = ∅ for i ∈ I \ J. S Then hXi ii∈I is a disjoint family in Σ, i∈I Xi = X and Xi• = ai for every i. Moreover, because only countably many of the Xi are non-empty, we certainly have Σ = {E : E ⊆ X, E ∩ Xi ∈ Σ ∀ i ∈ I,
322N
Taxonomy of measure algebras
µE =
P i∈I
77
µ(E ∩ Xi ) for every E ∈ Σ.
(b) For the general case, start by taking a decomposition hYj ij∈J of X. We can suppose that no Yj is negligible, because there is certainly some j0 such that µYj0 > 0, and we can if necessary replace Yj0 by S Yj0 ∪ {Yj : µYj = 0}. For each j, we can identify the measure algebra of the subspace measure on Yj with the principal ideal Abj generated by bj = Yj• (322I). Now hai ∩ bjS ii∈I is a partition of unity in Abj , so by (a) • just above we can find a disjoint family hXji ii∈I in Σ such that i∈I Xji = Yj , Xji = ai ∩ bj for every i and Σ ∩ PYj = {E : E ⊆ Yj , E ∩ Xji ∈ Σ ∀ i ∈ I}, P µE = i∈I µ(E ∩ Xji ) for every E ∈ Σ ∩ PYj .
S Set Xi = j∈I Xji for every i ∈ I. Then hXi ii∈I is disjoint and covers X. Because Xi ∩ Yj = Xji is measurable for every j, Xi ∈ Σ. Because Xi• ⊇ ai ∩ bj for every j, and hbj ij∈J is a partition of unity in A (322Kb), Xi• ⊇ ai for each i; because hXi• ii∈I is disjoint and supi∈I ai = 1, Xi• = ai for every i. If E ⊆ X is such that E ∩ Xi ∈ Σ for every i, then E ∩ Xji ∈ Σ for all i ∈ I and j ∈ J, so E ∩ Yj ∈ Σ for every j ∈ J and E ∈ Σ. If E ∈ Σ, then X X X X µE = µ(E ∩ Yj ) = µ(E ∩ Xji ) = sup µ(E ∩ Xji ) j∈J
≤ so µE =
X i∈I
P i∈I
j∈J,i∈I
µ(E ∩ Xi ) =
sup
X
K⊆I is finite i∈K
i∈I K⊆J is finite j∈K
µ(E ∩ Xi ) ≤ µE;
µ(E ∩ Xi ). Thus hXi ii∈I is a suitable family.
322M Subalgebras: Proposition Let (A, µ ¯) be a measure algebra, and B a σ-subalgebra of A. Set ν¯ = µ ¯¹ B. (a) (B, ν¯) is a measure algebra. (b) If (A, µ ¯) is totally finite, or a probability algebra, so is (B, ν¯). (c) If (A, µ ¯) is σ-finite and (B, ν¯) is semi-finite, then (B, ν¯) is σ-finite. (d) If (A, µ ¯) is localizable and B is order-closed and (B, ν¯) is semi-finite, then (B, ν¯) is localizable. (e) If (B, ν¯) is a probability algebra, or totally finite, or σ-finite, so is (A, µ ¯). proof (a) By 314Eb, B is Dedekind σ-complete, and the identity map π : B → A is sequentially ordercontinuous; so that ν¯ = µ ¯π will be countably additive and (B, ν¯) will be a measure algebra. (b) This is trivial. (c) Use 322G. Every disjoint subset of B is disjoint in A, therefore countable, because A is ccc; so B is also ccc and (B, ν¯) (being semi-finite) is σ-finite. (d) By 314Ea, B is Dedekind complete; we are supposing that (B, ν¯) is semi-finite, so it is localizable. (e) This is elementary. 322N The Stone space of a localizable measure algebra I said above that the concepts of ‘strictly localizable’ and ‘locally determined’ measure space have no equivalents in the theory of measure algebras. But when we look at the canonical measure on the Stone space of a measure algebra, we can of course hope that properties of the measure algebra will be reflected in the properties of this measure, as happens in the next theorem. Theorem Let (A, µ ¯) be a measure algebra, Z the Stone space of A, and ν the standard measure on Z constructed by the method of 321J-321K. Then the following are equiveridical: (i) (A, µ ¯) is localizable; (ii) ν is localizable; (iii) ν is locally determined; (iv) ν is strictly localizable. proof Write Σ for the domain of ν, that is,
78
Measure algebras
322N
{E4A : E ⊆ Z is open-and-closed, A ⊆ Z is meager}, and M for the ideal of meager subsets of Z, that is, the ideal of ν-negligible sets (314M, 321K). Then a 7→ b a• : A → Σ/M is an isomorphism between (A, µ ¯) and the measure algebra of (Z, Σ, ν) (314M). Note that because any subset of a meager set is meager, ν is surely complete. (a)(i) ⇐⇒ (ii) is a consequence of 322Be. (b)(ii)⇒(iii) Suppose that ν is localizable. Of course it is semi-finite. Let V ⊆ Z be a set such that V ∩ E ∈ Σ whenever E ∈ Σ and νE < ∞. Because ν is localizable, there is a W ∈ Σ which is an essential supremum in Σ of {V ∩ E : E ∈ Σ, νE < ∞}, that is, W • = sup{(V ∩ E)• : νE < ∞} in Σ/M. I claim that W 4V is nowhere dense. P P Let G ⊆ Z be a non-empty open set. Then there is a non-zero a ∈ A such that b a ⊆ G. Because (A, µ ¯) is semi-finite, we may suppose that µ ¯a < ∞. Now (W ∩ b a)• = W • ∩ b a• = supνE<∞ (V ∩ E)• ∩ b a• = supνE<∞ (V ∩ E ∩ b a)• = (V ∩ b a)• , so (W 4V ) ∩ b a is negligible, therefore meager. But we know that A is weakly (σ, ∞)-distributive (322F), so that meager sets in Z are nowhere dense (316I), and there is a non-empty open set H ⊆ b a \ (W 4V ). Now H ⊆ G \ W 4V . As G is arbitrary, int W 4V = ∅ and W 4V is nowhere dense. Q Q But this means that W 4V ∈ M ⊆ Σ and V = W 4(W 4V ) ∈ Σ. As V is arbitrary, ν is locally determined. (c)(iii)⇒(iv) Assume that ν is locally determined. Because (A, µ ¯) is semi-finite, there is a partition of unity C ⊆ A consisting of elements of finite measure (322Ea). Set C = {b c : c ∈ C}. This is a disjoint family of sets of finite measure for ν. Now suppose that F ∈ Σ and νF > 0. Then there is an open-and-closed set E ⊆ Z such that F 4E is meager, and E is of the form b a for some a ∈ A. Since µ ¯a = νb a = νF > 0, there is some c ∈ C such that a ∩ c 6= 0, and now ν(F ∩ b c) = µ ¯(a ∩ c) > 0. This means that ν satisfies the conditions of 213O and must be strictly localizable. (d)(iv)⇒(ii) This is just 211Ld. b be the Dedekind completion 322O Proposition Let (A, µ ¯) be a semi-finite measure algebra, and let A b b µ of A (314U). Then there is a unique extension of µ ¯ to a functional µ ˜ on A such that (A, ˜) is a localizable b b µ measure algebra. The embedding A ⊆ A identifies the ideals {a : a ∈ A, µ ¯a < ∞} and {a : a ∈ A, ˜a < ∞}. b For c ∈ A, b set proof (I write the argument out as if A were actually a subalgebra of A.) µ ˜c = sup{¯ µa : a ∈ A, a ⊆ c}. b to [0, ∞] extending µ b µ Evidently µ ˜ is a function from A ¯, so µ ˜0 = 0. Because A is order-dense in A, ˜c > 0 b whenever c 6= 0, because any P such c includes a non-zero member of A. If hcn in∈N is a disjoint sequence in A ∞ ˜cn . P P Let A be the set of all members of A expressible as a = supn∈N an with supremum c, then µ ˜c = n=0 µ where an ∈ A, an ⊆ cn for every n ∈ N. Now ∞ X
sup µ ¯a = sup{ a∈A
µ ¯an : an ∈ A, an ⊆ cn for every n ∈ N}
n=0
=
∞ X n=0
sup{¯ µan : an ⊆ cn } =
∞ X
µ ˜cn .
n=0
b cn = sup{a : a ∈ A, a ⊆ cn } for each n, and sup A, taken in A, b must be Also, because A is order-dense in A, 0 0 0 0 b c. But this means that if a ∈ A, a ⊆ c then a = supa∈A a ∩ a in A and therefore also in A; so that µ ¯a0 = supa∈A µ ¯(a0 ∩ a) ≤ supa∈A µ ¯a. Accordingly
322Q
Taxonomy of measure algebras
µ ˜c = supa∈A µ ¯a =
P∞ n=0
79
µ ˜cn . Q Q
b µ This shows that (A, ˜) is a measure algebra. It is semi-finite because (A, µ ¯) is and every non-zero element b includes a non-zero element of A, which in turn includes a non-zero element of finite measure. Since A b of A b µ is Dedekind complete, (A, ¯) is localizable. If µ ¯a is finite, then surely µ ˜a = µ ¯a is finite. If µ ˜c is finite, then {A : a ∈ A, a ⊆ c} is upwards-directed b and supa∈A µ ¯A = µ ˜c is finite, so b = sup A is defined in A and µ ¯b = µ ˜c. Because A is order-dense in A, b = c (313K, 313O) and c ∈ A, with µ ¯c = µ ˜c. b µ 322P Definition Let (A, µ ¯) be any semi-finite measure algebra. I will call (A, ˜), as constructed above, the localization of (A, µ ¯). Of course it is unique just in so far as the Dedekind completion of A is. 322Q Further properties of Stone spaces: Proposition Let (A, µ ¯) be a semi-finite measure algebra and (Z, Σ, ν) its Stone space. (a) Meager sets in Z are nowhere dense; every E ∈ Σ is uniquely expressible as G4M where G ⊆ Z is open-and-closed and M is nowhere dense, and νE = sup{νH : H ⊆ E is open-and-closed}. (b) The c.l.d. version ν˜ of ν is strictly localizable, and has the same negligible sets as ν. (c) If (A, µ ¯) is totally finite then νE = inf{νH : H ⊇ E is open-and-closed} for every E ∈ Σ. proof (a) I have already remarked (in the proof of 322N) that A is weakly (σ, ∞)-distributive, so that meager sets in Z are nowhere dense. But we know that every member of Σ is expressible as G4M where G is open-and-closed and M is meager, therefore nowhere dense. Moreover, the expression is unique, because if G4M = G0 4M 0 then G4G0 ⊆ M ∪ M 0 is open and nowhere dense, therefore empty, so G = G0 and M = M 0. Now let a ∈ A be such that b a = G, and consider B = {b : b ∈ A, bb ⊆ E}. Then sup B = a in A. P P If b b ∈ B, then b \ b a ⊆ M is nowhere dense, therefore empty; so a is an upper bound for B. ?? If a is not the supremum of B, then there is a non-zero c ⊆ a such that b ⊆ a \ c for every b ∈ B. But now b c cannot be empty, so b c \ M is non-empty, and there is a non-zero d ∈ A such that db ⊆ b c \ M . In this case d ∈ B and d⊆ 6 a \ c. X X Thus a = sup B. Q Q It follows that νE = νG = µ ¯a = sup µ ¯b b∈B
= sup νbb ≤ sup{νH : H ⊆ E is open-and-closed} ≤ νE b∈B
and νE = sup{νH : H ⊆ E is open-and-closed}. (b) This is the same as part (c) of the proof of 322N. We have a disjoint family C of sets of finite measure for ν such that whenever E ∈ Σ, νE > 0 there is a C ∈ C such that µ(C ∩ E) > 0. Now if ν˜F is defined and not 0, there is an E ∈ Σ such that E ⊆ F and νE > 0 (213Fc), so that there is a C ∈ C such that ν(E ∩ C) > 0; since νC < ∞, we have ν˜(F ∩ C) ≥ ν˜(E ∩ C) = ν(E ∩ C) > 0. And of course ν˜C < ∞ for every C ∈ C. This means that C witnesses that ν˜ satisfies the conditions of 213O, so that ν˜ is strictly localizable. Any ν-negligible set is surely ν˜-negligible. If M is ν˜-negligible then it is nowhere dense. P P If G ⊆ Z is open and not empty then there is a non-empty open-and-closed set H1 ⊆ G, and now H1 ∈ Σ, so there is a non-empty open-and-closed set H ⊆ H1 such that νH is finite (because ν is semi-finite). In this case H ∩ M is ν-negligible, therefore nowhere dense, and H 6⊆ M . But this means that G 6⊆ M ; as G is arbitrary, M is nowhere dense. Q Q Accordingly M ∈ M and is ν-negligible. Thus ν and ν˜ have the same negligible sets. (c) Because νZ < ∞,
80
Measure algebras
322Q
νE = νZ − ν(Z \ E) = νZ − sup{νH : H ⊆ Z \ E is open-and-closed} = inf{ν(Z \ H) : H ⊆ Z \ E is open-and-closed} = inf{νH : H ⊇ E is open-and-closed}. 322X Basic exercises > (a) Let (A, µ ¯) be a measure algebra. Let I∞ be the set of those a ∈ A which are ‘purely infinite’, that is, µ ¯a = ∞ and µ ¯b = ∞ for every non-zero b ⊆ a. Show that I∞ is a σ-ideal of A. Show that there is a function µ ¯sf : A/I∞ → [0, ∞] defined by setting µ ¯sf a• = sup{¯ µb : b ⊆ a, µ ¯b < ∞} for every a ∈ A. Show that (A/I∞ , µ ¯sf ) is a semi-finite measure algebra. (b) Let (X, Σ, µ) be a measure space and let µsf be the ‘semi-finite version’ of µ, as defined in 213Xc. Let (A, µ ¯) be the measure algebra of (X, Σ, µ). Show that the measure algebra of (X, Σ, µsf ) is isomorphic to the measure algebra (A/I∞ , µ ¯sf ) of (a) above. ˜ µ (c) Let (X, Σ, µ) be a measure space and (X, Σ, ˜) its c.l.d. version. Let (A, µ ¯) and (A2 , µ ¯2 ) be the corresponding measure algebras, and π : A → A2 the canonical homomorphism, as in 322Db. Show that the kernel of π is the ideal I∞ , as described in 322Xa, so that A/I∞ is isomorphic, as Boolean algebra, to π[A] ⊆ A2 . Show that this isomorphism identifies µ ¯sf , as described in 322Xa, with µ ¯2 ¹π[A]. (d) Give a direct proof of 322G, not relying on 215B and 321J. > (e) Let (A, µ ¯) be any measure algebra, A a non-empty subset of A, and c ∈ A such that µ ¯c < ∞. Show that (i) c0 = sup{a ∩ c : a ∈ A} is defined in A (ii) there is a countable set B ⊆ A such that c0 = sup{a ∩ c : a ∈ B}. (f ) Let (X, Σ, µ) be a measure space and ν an indefinite-integral measure over µ (§234). Show that the measure algebra of ν can be identified, as Boolean algebra, with a principal ideal of the measure algebra of µ. (g) Let (X, Σ, µ) be a measure space and A any subset of X; let µA be the subspace measure on A and ΣA its domain. Write (A, µ ¯) for the measure algebra of (X, Σ, µ) and (AA , µ ¯A ) for the measure algebra of (A, ΣA , µA ). Show that the formula F • 7→ (F ∩ A)• defines a sequentially order-continuous Boolean homomorphism π : A → AA which has kernel I = {F • : F ∈ Σ, F ∩ A = ∅}. Show that for any a ∈ A, µ ¯A (πa) = min{¯ µb : b ∈ A, a \ b ∈ I}. (h) Let (A, µ ¯) be a measure algebra and B an order-closed subalgebra of A. Suppose that (B, µ ¯¹ B) is semi-finite. Show that (A, µ ¯) is semi-finite. (i) Let (A, µ ¯) be any measure algebra and (Z, Σ, ν) its Stone space. Show that the c.l.d. version of ν is strictly localizable. 322Y Further exercises (a) Let X be a set, Σ a σ-algebra of subsets of X, and I a σ-ideal of Σ. Set ˆ = {E4N : E ∈ Σ, N ∈ N }. N = {N : ∃ F ∈ I, N ⊆ F }. Show that N is a σ-ideal of subsets of X. Set Σ ˆ is a σ-algebra of subsets of X and that Σ/N ˆ Show that Σ is isomorphic to Σ/I. (b) Let (A, µ ¯) be a semi-finite measure algebra, and (Z, Σ, ν) its Stone space. Let ν˜ be the c.l.d. version ˜ its domain. Show that Σ ˜ is precisely the Baire property algebra {G4A : G ⊆ Z is open, A ⊆ Z of ν, and Σ ˜ is meager}, so that Σ/M can be identified with the regular open algebra of Z (314Yd) and the measure algebra of ν˜ can be identified with the localization of A. (c) Give an example of a localizable measure algebra (A, µ ¯) with a σ-subalgebra B such that (B, µ ¯¹ B) is semi-finite and atomless, but A is not atomless. (d) Let (X, Σ, µ) be a measure space and A ⊆ X a subset; let µA be the subspace measure on A, A and AA the measure algebras of µ and µA , and π : A → AA the canonical homomorphism, as described in 322Xg. (i) Show that if µA is semi-finite, then π is order-continuous. (ii) Show that if µ is semi-finite but µA is not, then π is not order-continuous.
322 Notes
Taxonomy of measure algebras
81
(e) Show that if (A, µ ¯) is a measure algebra, with Stone space (Z, Σ, ν), then ν has locally determined negligible sets in the sense of 213I. (f ) Let (A, µ ¯) be a localizable measure algebra and (Z, Σ, ν) its Stone space. (i) Show that a function f : Z → R is Σ-measurable iff there is a conegligible set G ⊆ X such that f ¹G is continuous. (Hint: 316Yi.) (ii) Show that f : Z → [0, 1] is Σ-measurable iff there is a continuous function g : Z → [0, 1] such that f = g ν-a.e. 322 Notes and comments I have taken this leisurely tour through the concepts of Chapter 21 partly to recall them (or persuade you to look them up) and partly to give you practice in the elementary manipulations of measure algebras. The really vital result here is the correspondence between ‘localizability’ in measure spaces and measure algebras. Part of the object of this volume (particularly in Chapter 36) is to try to make sense of the properties of localizable measure spaces, as discussed in Chapter 24 and elsewhere, in terms of their measure algebras. I hope that 322Be has already persuaded you that the concept really belongs to measure algebras, and that the formulation in terms of ‘essential suprema’ is a dispensable expedient. I have given proofs of 322C and 322G depending on the realization of an arbitrary measure algebra as the measure algebra of a measure space, and the corresponding theorems for measure spaces, because this seems the natural approach from where we presently stand; but I am sympathetic to the view that such proofs must be inappropriate, and that it is in some sense better style to look for arguments which speak only of measure algebras (322Xd). For any measure algebra (A, µ ¯), the set Af of elements of finite measure is an ideal of A; consequently it is order-dense iff it includes a partition of unity (322E). In 322F we have something deeper: any semifinite measure algebra must be weakly (σ, ∞)-distributive when regarded as a Boolean algebra, and this has significant consequences in its Stone space, which are used in the proofs of 322N and 322Q. Of course a result of this kind must depend on the semi-finiteness of the measure algebra, since any Dedekind σ-complete Boolean algebra becomes a measure algebra if we give every non-zero element the measure ∞. It is natural to look for algebraic conditions on a Boolean algebra sufficient to make it ‘measurable’, in the sense that it should carry a semi-finite measure; this is an unresolved problem to which I will return in Chapter 39. Subspace measures, simple products, direct sums, principal ideals and order-closed subalgebras give no real surprises; I spell out the details in 322I-322M and 322Xg-322Xh. It is worth noting that completing a measure space has no effect on its measure algebra (322D, 322Ya). We see also that from the point of view of measure algebras there is no distinction to be made between ‘localizable’ and ‘strictly localizable’, since every localizable measure algebra is representable as the measure algebra of a strictly localizable measure space (322Kd). (But strict localizability does have implications for some processes starting in the measure algebra; see 322L.) It is nevertheless remarkable that the canonical measure on the Stone space of a semifinite measure algebra is localizable iff it is strictly localizable (322N). This canonical measure has many other interesting properties, which I skim over in 322Q, 322Xi, 322Yb and 322Yf. In Chapter 21 I discussed a number of methods of improving measure spaces, notably ‘completions’ (212C) and ‘c.l.d. versions’ (213E). Neither of these is applicable in any general way to measure algebras. But in fact we have a more effective construction, at least for semi-finite measure algebras, that of ‘localization’ (322O-322P); I say that it is more effective just because localizability is more important than completeness or local determinedness, being of vital importance in the behaviour of function spaces (241Gb, 243Gb, 245Ec, 363M, 364O, 365J, 367N, 369A, 369C). Note that the localization of a semi-finite measure algebra does in fact correspond to the c.l.d. b do not have the same Stone spaces, version of a certain measure (322Q, 322Yb). But of course A and A b can be effectively represented as the measure algebra of a measure on the Stone space of A. even when A b not just What is happening in 322Yb is that we are using all the open sets of Z to represent members of A, the open-and-closed sets, which correspond to members of A.
82
Measure algebras
§323 intro.
323 The topology of a measure algebra I take a short section to discuss one of the fundamental tools for studying totally finite measure algebras, the natural metric that each carries. The same ideas, suitably adapted, can be applied to an arbitrary measure algebra, where we have a topology corresponding closely to the topology of convergence in measure on the function space L0 . Most of the section consists of an analysis of the relations between this topology and the order structure of the measure algebra. 323A The pseudometrics ρa (a) Let (A, µ ¯) be a measure algebra. Write Af = {a : a ∈ A, µ ¯a < ∞}. f For a ∈ A and b, c ∈ A, write ρa (b, c) = µ ¯(a ∩ (b 4 c)). Then ρa is a pseudometric on A. P P (i) Because µ ¯a < ∞, ρa takes values in [0, ∞[. (ii) If b, c, d ∈ A then b 4 d ⊆ (b 4 c) ∪ (c 4 d), so ρa (b, d) = µ ¯(a ∩ (b 4 d)) ≤ µ ¯((a ∩ (b 4 c)) ∪ (a ∩ (c 4 d))) ≤µ ¯(a ∩ (b 4 c)) + µ ¯(a ∩ (c 4 d)) = ρa (b, c) + ρa (c, d). (iii) If b, c ∈ A then ρa (b, c) = µ ¯(a ∩ (b 4 c)) = µ ¯(a ∩ (c 4 b)) = ρa (c, b). Q Q (b) Now the measure-algebra topology of the measure algebra (A, µ ¯) is that generated by the family P = {ρa : a ∈ Af } of pseudometrics on A. Similarly the measure-algebra uniformity on A is that generated by P. (For a general discussion of topologies defined by pseudometrics, see 2A3F et seq. For the associated uniformities see §3A4.) (c) Note that P is upwards-directed, since ρa∪a0 ≥ max(ρa , ρa0 ) for all a, a0 ∈ Af . (d) When (A, µ ¯) is totally finite, it is more natural to work from the measure metric ρ = ρ1 , with ρ(a, b) = µ ¯(a 4 b), since this by itself defines the measure-algebra topology and uniformity. *(e) Even when (A, µ ¯) is not totally finite, we still have a metric ρ on Af defined by setting ρ(a, b) = f µ ¯(a 4 b) for all a, b ∈ A , which is sometimes useful (323Xg). Note however that the topology on Af defined from ρ is not in general the topology induced by the measure-algebra topology of A. 323B Proposition Let (A, µ ¯) be any measure algebra. Then the operations ∪ , ∩ , \ and 4 are all uniformly continuous. proof The point is that for any b, c, b0 , c0 ∈ A we have (b ∗ c) 4 (b0 ∗ c0 ) ⊆ (b 4 b0 ) ∪ (c 4 c0 ) for any of the operations ∗ = ∪ , ∩ etc.; so that if a ∈ Af then ρa (b ∗ c, b0 ∗ c0 ) ≤ ρa (b, b0 ) + ρa (c, c0 ). Consequently the operation ∗ must be uniformly continuous. 323C Proposition (a) Let (A, µ ¯) be a totally finite measure algebra. Then µ ¯ : A → [0, ∞[ is uniformly continuous. (b) Let (A, µ ¯) be a semi-finite measure algebra. Then µ ¯ : A → [0, ∞] is lower semi-continuous. (c) Let (A, µ ¯) be any measure algebra. If a ∈ A and µ ¯a < ∞, then b 7→ µ ¯(b ∩ a) : A → R is uniformly continuous. proof (a) For any a, b ∈ A, |¯ µa − µ ¯b| ≤ µ ¯(a 4 b) = ρ1 (a, b). (b) Suppose that b ∈ A and µ ¯b > α ∈ R. Then there is an a ⊆ b such that α < µ ¯a < ∞ (322Eb). If c ∈ A is such that ρa (b, c) < µ ¯a − α, then
323D
The topology of a measure algebra
83
µ ¯c ≥ µ ¯(a ∩ c) = µ ¯a − µ ¯(a ∩ (b \ c)) > α. Thus {b : µ ¯b > α} is open; as α is arbitrary, µ ¯ is lower semi-continuous. (c) |¯ µ(a 4 b) − µ ¯(a 4 c)| ≤ ρa (b, c) for all b, c ∈ A. 323D The following facts are basic to any understanding of the relationship between the order structure and topology of a measure algebra. Lemma Let (A, µ ¯) be a measure algebra. (a) Let B ⊆ A be a non-empty upwards-directed set. For b ∈ B set Fb = {c : b ⊆ c ∈ B}. (i) {Fb : b ∈ B} generates a Cauchy filter F(B ↑) on A. (ii) If sup B is defined in A, then it is a topological limit of F(B ↑); in particular, it belongs to the topological closure of B. (b) Let B ⊆ A be a non-empty downwards-directed set. For b ∈ B set Fb = {c : b ⊇ c ∈ B}. (i) {Fb : b ∈ B} generates a Cauchy filter F(B↓) on A. (ii) If inf B is defined in A, then it is a topological limit of F(B ↓); in particular, it belongs to the topological closure of B. (c)(i) Closed subsets of A are order-closed in the sense of 313D. (ii) An order-dense subalgebra of A must be dense in the topological sense. (d) Now suppose that (A, µ ¯) is semi-finite. (i) The sets {b : b ⊆ c}, {b : b ⊇ c} are closed for every c ∈ A. (ii) If B ⊆ A is non-empty and upwards-directed and e is a cluster point of F(B ↑), then e = sup B. (iii) If B ⊆ A is non-empty and downwards-directed and e is a cluster point of F(B↓), then e = inf B. proof I use the notations Af , ρa from 323A. (a)(i) (α) If b, c ∈ B then there is a d ∈ B such that b ∪ c ⊆ d, so that Fd ⊆ Fb ∩ Fc ; consequently F(B ↑) = {F : F ⊆ A, ∃ b ∈ B, Fb ⊆ F } is a filter on A. (β) Let a ∈ Af , ² > 0. Then there is a b ∈ B such that µ ¯(a ∩ c) ≤ µ ¯(a ∩ b) + 12 ² for every 0 0 0 c ∈ B, and Fb ∈ F(B ↑). If now c, c ∈ Fb , c 4 c ⊆ (c \ b) ∪ (c \ b), so ρa (c, c0 ) ≤ µ ¯(a ∩ c \ b) + µ ¯(a ∩ c0 \ b) = µ ¯(a ∩ c) + µ ¯(a ∩ c0 ) − 2¯ µ(a ∩ b) ≤ ². As a and ² are arbitrary, F(B ↑) is Cauchy. (ii) Suppose that e = sup B is defined in A. Let a ∈ Af , ² > 0. By 313Ba, a ∩ e = supb∈B a ∩ b; but {a ∩ b : b ∈ B} is upwards-directed, so µ ¯(a ∩ e) = supb∈B µ ¯(a ∩ b), by 321D. Let b ∈ B be such that µ ¯(a ∩ b0 ) ≥ µ ¯(a ∩ e) − ². Then for any c ∈ Fb , e 4 c ⊆ e \ b, so ρa (e, c) = µ ¯(a ∩ (e 4 c)) ≤ µ ¯(a ∩ (e \ b)) = µ ¯(a ∩ e) − µ ¯(a ∩ b) ≤ ². As a and ² are arbitrary, F(B ↑) → e. Because B ∈ F(B ↑), e surely belongs to the topological closure of B. (b) Either repeat the arguments above, with appropriate inversions, using 321F in place of 321D, or apply (a) to the set {1 \ b : b ∈ B}. (c)(i) This follows at once from (a) and (b) and the definition in 313D. (ii) If B ⊆ A is an order-dense subalgebra and a ∈ A, then B = {b : b ∈ B, b ⊆ a} is upwards-directed and has supremum a (313K); by (a-ii), a ∈ B ⊆ B. As a is arbitrary, B is topologically dense. (d)(i) Set F = {b : b ⊆ c}. If d ∈ A \ F , then (because (A, µ ¯) is semi-finite) there is an a ∈ Af such that δ=µ ¯(a ∩ d \ c) > 0; now if b ∈ F , ρa (d, b) ≥ µ ¯(a ∩ d \ b) ≥ δ, so that d cannot belong to the closure of F . As d is arbitrary, F is closed. Similarly, {b : b ⊇ c} is closed. (ii) (α) If b ∈ B, then e ∈ Fb , because Fb ∈ F(B ↑); but {c : b ⊆ c ∈ A} is a closed set including Fb , so contains e, and b ⊆ e. As b is arbitrary, e is an upper bound for B. (β) If d is an upper bound of B,
84
Measure algebras
323D
then {c : c ⊆ d} is a closed set belonging to F(B ↑), so contains e. As d is arbitrary, this shows that e is the supremum of B, as claimed. (iii) Use the same arguments as in (ii), but inverted. 323E Corollary Let (A, µ ¯) be a measure algebra. (a) If hbn in∈N is a non-decreasing sequence in A with supremum b, then hbn in∈N → b for the measurealgebra topology. (b) If hbn in∈N is a non-increasing sequence in A with infimum b, then hbn in∈N → b for the measure-algebra topology. proof I call this a ‘corollary’ because it is the special case of 323Da-323Db in which B is the set of terms of a monotonic sequence; but it is probably easier to work directly from the definition in 323A, and use 321Be or 321Bf to see that limn→∞ ρa (bn , b) = 0 whenever µ ¯a < ∞. 323F
The following is a useful calculation.
P∞ Lemma Let (A, µ ¯) be a measure algebra and hcn in∈N a sequence in A such that the sum n=0 µ ¯(cn 4 cn+1 ) is finite. Set d0 = supn∈N inf m≥n cm , d1 = inf n∈N supm≥n cm . Then d0 = d1 and, writing d for their common value, limn→∞ µ ¯(cn 4 d) = 0. P∞ proof Write αn = µ ¯(cn 4 cn+1 ), βn = k=n αk for n ∈ N; we are supposing that limn→∞ βn = 0. Set bn = supm≥n cm 4 cm+1 ; then P∞ µ ¯bn ≤ m=n µ ¯(cm 4 cm+1 ) = βn for each n. If m ≥ n, then cm 4 cn ⊆ supn≤k<m ck 4 ck+1 ⊆ bn , so cn \ bn ⊆ cm ⊆ cn ∪ bn . Consequently cn \ bn ⊆ inf k≥m ck ⊆ supk≥m ck ⊆ cn ∪ bn for every m ≥ n, and cn \ bn ⊆ d0 ⊆ d1 ⊆ cn ∪ bn , so that cn 4 d0 ⊆ bn ,
cn 4 d1 ⊆ bn ,
d1 \ d0 ⊆ bn .
As this is true for every n, limn→∞ µ ¯(cn 4 di ) ≤ limn→∞ µ ¯bn = 0 for both i, and µ ¯(d1 4 d0 ) ≤ inf n∈N µ ¯bn = 0, so that d1 = d0 . 323G The classification of measure algebras: Theorem Let (A, µ ¯) be a measure algebra, T its measure-algebra topology and U its measure-algebra uniformity. (a) (A, µ ¯) is semi-finite iff T is Hausdorff. (b) (A, µ ¯) is σ-finite iff T is metrizable, and in this case U is also metrizable. (c) (A, µ ¯) is localizable iff T is Hausdorff and A is complete under U. proof I use the notations Af , ρa from 323A. (a)(i) Suppose that (A, µ ¯) is semi-finite and that b, c are distinct members of A. Then there is an a ⊆ b 4 c such that 0 < µ ¯a < ∞, and now ρa (b, c) > 0. As b and c are arbitrary, T is Hausdorff (2A3L).
323G
The topology of a measure algebra
85
(ii) Suppose that T is Hausdorff and that b ∈ A has µ ¯b = ∞. Then b 6= 0 so there must be an a ∈ Af such that µ ¯(a ∩ b) = ρa (0, b) > 0; in which case a ∩ b ⊆ b and 0 < µ ¯(a ∩ b) < ∞. As b is arbitrary, µ ¯ is semi-finite. (b)(i) Suppose that µ ¯ is σ-finite. Let han in∈N be a non-decreasing sequence in Af with supremum 1. Set ρ(b, c) =
∞ X ρan (b, c) 1 + 2n µ ¯an n=0
for b, c ∈ A. Then ρ is a metric on A, because if ρ(b, c) = 0 then an ∩ (b 4 c) = 0 for every n, so b 4 c = 0 and b = c. If a ∈ Af and ² > 0, take n such that µ ¯(a \ an ) ≤ 12 ². If b, c ∈ A and ρ(b, c) ≤ ²/2(1 + 2n µ ¯an ), then 1 ρan (b, c) ≤ 2 ² so ρa (b, c) = ρa\an (b, c) + ρa∩an (b, c) ≤ µ ¯(a \ an ) + ρan (b, c) 1 2
≤ ² + (1 + 2n µ ¯an )ρ(b, c) ≤ ². In the other direction, given ² > 0, take n ∈ N such that 2−n ≤ 21 ²; then ρ(b, c) ≤ ² whenever ρan (b, c) ≤ ²/2(n + 1). This shows that U is the same as the metrizable uniformity defined by {ρ}; accordingly T is also defined by ρ. (ii) Now suppose that T is metrizable, and let ρ be a metric defining T. For each n ∈ N there must be an0 , . . . , ankn ∈ Af and δn > 0 such that ρani (b, 1) ≤ δn for every i ≤ kn =⇒ ρ(b, 1) ≤ 2−n . Set d = supn∈N,i≤kn ani . Then ρani (d, 1) = 0 for every n, i, so ρ(d, 1) ≤ 2−n for every n and d = 1. Thus 1 is the supremum of countably many elements of finite measure and (A, µ ¯) is σ-finite. (c)(i) Suppose that (A, µ ¯) is localizable. Then T is Hausdorff, by (a). Let F be a Cauchy filter on A. For each a ∈ Af , choose a sequence hFn (a)in∈N in F such that ρa (b, c) ≤ 2−n whenever b, c ∈ Fn (a) and n ∈ N. T Choose can ∈ k≤n Fk (a) for each n; then ρa (can , ca,n+1 ) ≤ 2−n for each n. Set da = supn∈N inf k≥n a ∩ cak . Then limn→∞ ρa (da , can ) = limn→∞ µ ¯(da 4 (a ∩ can )) = 0, by 323F. If a, b ∈ Af and a ⊆ b, then da = a ∩ db . P P For each n ∈ N, Fn (a) and Fn (b) both belong to F, so must have a point e in common; now ρa (da , db ) ≤ ρa (da , can ) + ρa (can , e) + ρa (e, cbn ) + ρa (cbn , db ) ≤ ρa (da , can ) + ρa (can , e) + ρb (e, cbn ) + ρb (cbn , db ) ≤ ρa (da , can ) + 2−n + 2−n + ρb (cbn , db ) → 0 as n → ∞. Consequently ρa (da , db ) = 0, that is, da = a ∩ da = a ∩ db . Q Q Set d = sup{db : b ∈ Af }; this is defined because A is Dedekind complete. Then F → d. P P If a ∈ Af and ² > 0, then a ∩ d = supb∈Af a ∩ db = supb∈Af a ∩ b ∩ da∪b = supb∈Af a ∩ b ∩ da = a ∩ da . So if we choose n ∈ N such that 2−n + ρa (can , da ) ≤ ², then for any e ∈ Fn (a) we shall have ρa (e, d) ≤ ρa (e, can ) + ρa (can , d) ≤ 2−n + ρa (can , da ) ≤ ². Thus
86
Measure algebras
323G
{e : ρa (d, e) ≤ ²} ⊇ Fn (a) ∈ F. As a, ² are arbitrary, F converges to d. Q Q As F is arbitrary, A is complete. (ii) Now suppose that T is Hausdorff and that A is complete under U. By (a), (A, µ ¯) is semi-finite. Let B be any non-empty subset of A, and set B 0 = {b0 ∪ . . . ∪ bn : b0 , . . . , bn ∈ B}, so that B 0 is upwardsdirected and has the same upper bounds as B. By 323Da, we have a Cauchy filter F(B 0 ↑); because A is complete, this is convergent; and because (A, µ ¯) is semi-finite, its limit must be sup B 0 = sup B, by 323Dd. As B is arbitrary, A is Dedekind complete, so (A, µ ¯) is localizable. 323H Closed subalgebras The ideas used in the proof of (c) above have many other applications, of which one of the most important is the following. You may find it helpful to read the next theorem first on the assumption that (A, µ ¯) is a probability algebra. Theorem Let (A, µ ¯) be a localizable measure algebra, and B a subalgebra of A. Then it is closed for the measure-algebra topology iff it is order-closed. proof (a) If B is closed, it must be order-closed, by 323Dc. (b) Now suppose that B is order-closed. I repeat the ideas of part (c-i) of the proof of 323G. Let e be any member of the closure of B in A. For each a ∈ Af , n ∈ N choose can ∈ B such that ρa (can , e) ≤ 2−n . Then ∞ X
µ ¯((a ∩ can ) 4 (a ∩ ca,n+1 )) =
n=0
≤
∞ X n=0 ∞ X
ρa (can , ca,n+1 ) ρa (can , e) + ρa (e, ca,n+1 ) < ∞.
n=0
So if we set ea = supn∈N inf k≥n cak , then ρa (ea , can ) = ρa (a ∩ ea , a ∩ can ) → 0 as n → ∞, by 323F, and ρa (e, ea ) = 0, that is, a ∩ ea = a ∩ e. Also, because B is order-closed, inf k≥n cak ∈ B for every n, and ea ∈ B. Because A is Dedekind complete, we can set e0a = inf{eb : b ∈ Af , a ⊆ b}; then e0a ∈ B and e0a ∩ a = inf b⊇a eb ∩ a = inf b⊇a eb ∩ b ∩ a = inf b⊇a e ∩ b ∩ a = e ∩ a. Now e0a ⊆ e0b whenever a ⊆ b, so B = {e0a : a ∈ Af } is upwards-directed, and sup B = sup{e0a ∩ a : a ∈ Af } = sup{e ∩ a : a ∈ Af } = e because (A, µ ¯) is semi-finite. Accordingly e ∈ B. As e is arbitrary, B is closed, as claimed. 323I Notation In the context of 323H, I will say simply that B is a closed subalgebra of A. 323J Proposition If (A, µ ¯) is a localizable measure algebra and B is a subalgebra of A, then the topological closure B of B in A is precisely the order-closed subalgebra of A generated by B. proof Write Bτ for the smallest order-closed subset of A including B. By 313Fc, Bτ is a subalgebra of A, and is the order-closed subalgebra of A generated by B. Being an order-closed subalgebra of A, it is topologically closed, by 323H, and must include B. On the other hand, B, being topologically closed, is order-closed (323D(c-i)), so includes Bτ . Thus B = Bτ is the order-closed subalgebra of A generated by B. 323K
I note some simple results for future reference.
Lemma If (A, µ ¯) is a localizable measure algebra and B is a closed subalgebra of A, then for any a ∈ A the subalgebra C of A generated by B ∪ {a} is closed. proof By 314Ja, C is order-closed.
323Y
The topology of a measure algebra
87
323L Proposition Let h(Ai , µ ¯i )ii∈I be aQfamily of measure algebras with simple product (A, µ ¯) (322K). Then the measure-algebra topology on A = i∈I Ai defined by µ ¯ is just the product of the measure-algebra topologies of the Ai . proof I use the notations Af , ρa from 323A. Write T for the measure-algebra topology of A and S for the product topology. For i ∈ I, d ∈ Afi define a pseudometric ρ˜di on A by setting ρ˜di (b, c) = ρd (b(i), c(i)) whenever b, c ∈ A; then S is defined by P = {˜ ρdi : i ∈ I, a ∈ Afi } (3A3Ig). Now each ρ˜di is one of the defining pseudometrics for T, since ρ˜di (b, c) = µ ¯(d˜ ∩ (b4c)) ˜ = d, d(j) ˜ = 0 for j 6= i. So S ⊆ T. where d(i) P Now suppose that a ∈ Af and ² > 0. Then i∈I µ ¯i a(i) = µ ¯a is finite, so there is a finite set J ⊆ I such P that i∈I\J µ ¯i a(i) ≤ 12 ². For each j ∈ J, τj = ρ˜a(j),j belongs to P, and ρa (b, c) =
X
µ ¯i (a(i) ∩ (b(i) 4 c(i))) ≤
i∈I
=
X j∈J
X j∈J
τj (b(j), c(j)) +
1 ² 2
1 2
µ ¯j (a(j) ∩ (b(j) 4 c(j))) + ²
≤²
whenever b, c are such that τj (b(j), c(j)) ≤ ²/(1 + 2#(J)) for every j ∈ J. By 2A3H, the identity map from (A, S) to (A, T) is continuous, that is, T ⊆ S. Putting these together, we see that S = T, as claimed. 323X Basic exercises (a) Let (A, µ ¯) be a semi-finite measure algebra. Show that the set {(a, b) : a ⊆ b} is a closed set in A × A. > (b) Let (X, Σ, µ) be a σ-finite measure space and (A, µ ¯) its measure algebra. (i) Show that if T is a σ-subalgebra of Σ, then {F • : F ∈ T} is a closed subalgebra of A. (ii) Show that if B is a closed subalgebra of A, then {F : F ∈ Σ, F • ∈ B} is a σ-subalgebra of Σ. (c) Let (A, µ ¯) be a localizable measure algebra, and C ⊆ A a set such that sup A, inf A belong to C for all non-empty subsets A of C. Show that C is closed for the measure-algebra topology. (d) (i) Show that if (A, µ ¯) is any measure algebra and B is a subalgebra of A, then its topological closure B is again a subalgebra. (ii) Use this fact instead of 313Fc to prove 323J. (e) Let (A, µ ¯) be a measure algebra, and e ∈ A; let Ae be the principal ideal of A generated by e, and µ ¯e its measure (322H). Show that the topology on Ae defined by µ ¯e is just the subspace topology induced by the measure-algebra topology of A. > (f ) Let (X, Σ, µ) be a measure space, and (A, µ ¯) its measure algebra. (i) Show that we have an injection χ : A → L0 (µ) (see §241) given by setting χ(E • ) = (χE)• for every E ∈ Σ. (ii) Show that χ is a homeomorphism between A and its image if A is given its measure-algebra topology and L0 (µ) is given its topology of convergence in measure (245A). (g) Let (A, µ ¯) be a measure algebra, and Af the ideal of elements of finite measure. For a, b ∈ Af set ρ(a, b) = µ ¯(a 4 b). Show that (Af , µ ¯) is a complete metric space and that the operations ∪ , ∩ , \ and 4 are uniformly continuous on Af , while µ ¯ : Af → R is also uniformly continuous. Show that the f embedding A ⊆ A is continuous for the measure-algebra topology on A. In the context of 323Xf, show that χ : Af → L0 (µ) is an isometry between Af and a subset of L1 (µ). 323Y Further exercises (a) Let (A, µ ¯) be a σ-finite measure algebra. Show that a set F ⊆ A is closed for the measure-algebra topology iff e ∈ F whenever there are non-empty sets B, C ⊆ A such that B is upwards-directed, C is downwards-directed, sup B = inf C = e and [b, c] ∩ F 6= ∅ for every b ∈ B, c ∈ C, writing [b, c] = {d : b ⊆ d ⊆ c}.
88
Measure algebras
323Yb
(b) Give an example to show that (a) is false for general localizable measure algebras. (c) Give an example of a semi-finite measure algebra (A, µ ¯) with an order-closed subalgebra which is not closed for the measure-algebra topology. (d) Let (A, µ ¯) be a probability algebra and write B for the family of closed subalgebras of A. For B, ¯(b 4 c) + supc∈C inf b∈B µ ¯(b 4 c). Show that (B, ρ) is a complete metric C ∈ B set ρ(B, C) = supb∈B inf c∈C µ space. (e) Let (A, µ ¯) be the measure algebra of Lebesgue measure on R. Show that it is separable in its measurealgebra topology. (Hint: 245Yj.) 323Z Problem Find a localizable measure algebra (A, µ ¯), a σ-subalgebra B of A and a sequence hbn in∈N in B which converges, for the measure-algebra topology, to a member of A \ B. 323 Notes and comments The message of this section is that the topology of a measure algebra is essentially defined by its order and algebraic structure; see also 324F-324H below. Of course the results are really about semi-finite measure algebras, and indeed this whole volume, like the rest of measure theory, has little of interest to say about others; they are included only because they arise occasionally and it is not absolutely essential to exclude them. We therefore expect to be able to describe such things as closed subalgebras and continuous homomorphisms in terms of the ordering, as in 323H and 324G. For σ-finite algebras, indeed, there is an easy description of the topology in terms of the order (323Ya). I think the result of this section which I shall most often wish to quote is 323I: in most contexts, there is no need to distinguish between ‘closed subalgebra’ and ‘order-closed subalgebra’. I conjecture, however, that a σ-subalgebra of a localizable measure algebra need not be topologically sequentially closed (323Z). It is also the case that the topology of a measure algebra corresponds very closely indeed to the topology of convergence in measure. A description of this correspondence is in 323Xf. Indeed all the results of this section have analogues in the theory of topological Riesz spaces. I will enlarge on the idea here in §367. For the moment, however, if you look back to Chapter 24, you will see that 323B and 323G are closely paralleled by 245D and 245E, while 323Ya is related to 245L. It is I think natural to ask whether there are any other topological Boolean algebras with the properties 323B-323D. In fact a question in this direction, the Control Measure Problem, is one of the most important questions outstanding in abstract measure theory. I will discuss it in §393; the particular form relevant to the present section is what I call ‘CM4 ’ (393J).
324 Homomorphisms In the course of Volume 2, I had occasion to remark that elementary measure theory was unusual among abstract topics in pure mathematics in not being dominated by any particular class of structure-preserving operators. We now come to what I think is one of the reasons for the gap: the most important operators of the theory are not between measure spaces at all, but between their measure algebras. In this section I run through the most elementary facts about Boolean homomorphisms between measure algebras. I start with results on the construction of such homomorphisms from functions between measure spaces (324A324E), then investigate continuity and order-continuity of homomorphisms (324F-324H) before turning to measure-preserving homomorphisms (324I-324O). 324A Theorem Let (X, Σ, µ) and (Y, T, ν) be measure spaces, and (A, µ ¯), (B, ν¯) their measure algebras. ˆ for the domain of the completion µ Write Σ ˆ of µ. Let D ⊆ X be a set of full outer measure (definition: ˆ D be the subspace σ-algebra on D induced by Σ. ˆ Let φ : D → Y be a function such that 132E), and let Σ −1 −1 ˆ D for every F ∈ T and φ [F ] is µ-negligible whenever νF = 0. Then there is a sequentially φ [F ] ∈ Σ order-continuous Boolean homomorphism π : B → A defined by the formula πF • = E • whenever F ∈ T, E ∈ Σ and (E ∩ D)4φ−1 [F ] is negligible.
324E
Homomorphisms
89
ˆ such that H ∩ D = φ−1 [F ]; now there is an E ∈ Σ such proof Let F ∈ T. Then there is an H ∈ Σ −1 that E4H is negligible, so that (E ∩ D)4φ [F ] is negligible. If E1 is another member of Σ such that (E1 ∩ D)4φ−1 [F ] is negligible, then (E4E1 ) ∩ D is negligible, so is included in a negligible member G of Σ. Since (E4E1 ) \ G belongs to Σ and is disjoint from D, it is negligible; accordingly E4E1 is negligible and E • = E1• in A. What this means is that the formula offered defines a map π : B → A. It is now easy to check that π is a Boolean homomorphism, because if (E ∩ D)4φ−1 [F ],
(E 0 ∩ D)4φ−1 [F 0 ]
are negligible, so are ((X \ E) ∩ D)4φ−1 [Y \ F ],
((E ∪ E 0 ) ∩ D)4φ−1 [F ∪ F 0 ].
To see that π is sequentially order-continuous, let hbn in∈N be a sequence in B. For each n we may • −1 choose S an Fn ∈ T such S that Fn = bn , and En ∈ Σ such that (En ∩ D)4φ [Fn ] is negligible; now, setting F = n∈N Fn , E = n∈N En , S (E ∩ D)4φ−1 [F ] ⊆ n∈N (En ∩ D)4φ−1 [Fn ] is negligible, so π(supn∈N bn ) = π(F • ) = E • = supn∈N En• = supn∈N πbn . (Recall that the maps E 7→ E • , F 7→ F • are sequentially order-continuous, by 321H.) So π is sequentially order-continuous (313L(c-iii)). 324B Corollary Let (X, Σ, µ) and (Y, T, ν) be measure spaces, and (A, µ ¯), (B, ν¯) their measure algebras. Let φ : X → Y be a function such that φ−1 [F ] ∈ Σ for every F ∈ T and µφ−1 [F ] = 0 whenever νF = 0. Then there is a sequentially order-continuous Boolean homomorphism π : B → A defined by the formula πF • = (φ−1 [F ])• for every F ∈ T. 324C Remarks (a) In §235 and elsewhere in Volume 2 I spent a good deal of time on functions between measure spaces which satisfy the conditions of 324A. Indeed, I take the trouble to spell 324A out in such generality just in order to catch these applications. Some of the results of the present chapter (322D, 322Jb) can also be regarded as special cases of 324A. (b) The question of which homomorphisms between the measure algebras of measure spaces (X, Σ, µ), (Y, T, ν) can be realized by functions between X and Y is important and deep; I will return to it in §§343-344. (c) In the simplified context of 324B, I have actually defined a contravariant functor; the relevant facts are the following. 324D Proposition Let (X, Σ, µ), (Y, T, ν) and (Z, Λ, λ) be measure spaces, with measure algebras ¯ Suppose that φ : X → Y and ψ : Y → Z satisfy the conditions of 324B, that is, (A, µ ¯), (B, ν¯), (C, λ). φ−1 [F ] ∈ Σ if F ∈ T,
µφ−1 [F ] = 0 if νF = 0,
ψ −1 [G] ∈ T if G ∈ Λ,
µψ −1 [G] = 0 if λG = 0.
Let πφ : B → A, πψ : C → B be the corresponding homomorphisms. Then ψφ : X → Z is another map of the same type, and πψφ = πφ πψ : C → A. proof The necessary checks are all elementary. 324E Stone spaces While in the context of general measure spaces the question of realizing homomorphisms is difficult, in the case of the Stone representation it is relatively straightforward. Proposition Let (A, µ ¯) and (B, ν¯) be measure algebras, with Stone spaces Z and W ; let µ, ν be the corresponding measures on Z and W , as described in 321J-321K, and Σ, T their domains. If π : B → A is
90
Measure algebras
324E
any order-continuous Boolean homomorphism, let φ : Z → W be the corresponding continuous function, as described in 312P. Then φ−1 [F ] ∈ Σ for every F ∈ T, µφ−1 [F ] = 0 whenever νF = 0, and (writing E ∗ for the member of A corresponding to E ∈ Σ) πF ∗ = (φ−1 [F ])∗ for every F ∈ T. proof Recall that E ∗ = a iff E4b a is meager, where b a is the open-and-closed subset of Z corresponding to a ∈ A. In particular, µE = 0 iff E is meager. Now the point is that φ−1 [F ] is nowhere dense in Z whenever F is a nowhere dense subset of W , by 313R. Consequently φ−1 [F ] is meager whenever F is meager in W , since F is then just a countable union of nowhere dense sets. Thus we see already that µφ−1 [F ] = 0 whenever νF = 0. If F is any member of T, there is an open-and-closed set F0 such that F 4F0 is meager; now φ−1 [F0 ] is open-and-closed, so φ−1 [F ] = φ−1 [F0 ]4φ−1 [F 4F0 ] belongs to Σ. Moreover, if b ∈ B is such that bb = F0 , and a = πb, then b a = φ−1 [F0 ], so πF ∗ = πb = a = (φ−1 [F0 ])∗ = (φ−1 [F ])∗ , as required. 324F
I turn now to the behaviour of order-continuous homomorphisms between measure algebras.
Theorem Let (A, µ ¯) and B, ν¯) be measure algebras and π : A → B a Boolean homomorphism. (a) π is continuous iff it is continuous at 0 iff it is uniformly continuous. (b) If (B, ν¯) is semi-finite and π is continuous, then it is order-continuous. (c) If (A, µ ¯) is semi-finite and π is order-continuous, then it is continuous. proof I use the notations Af , ρa from 323A. (a) Suppose that π is continuous at 0; I seek to show that it is uniformly continuous. Take b ∈ Bf and ² > 0. Then there are a0 , . . . , an ∈ Af and δ > 0 such that ν¯(b ∩ πc) = ρb (πc, 0) ≤ ² whenever maxi≤n ρai (c, 0) ≤ δ; setting a = supi≤n ai , ν¯(b ∩ πc) ≤ ² whenever µ ¯(a ∩ c) ≤ δ. 0
Now suppose that ρa (c, c ) ≤ δ. Then µ ¯(a ∩ (c 4 c0 )) ≤ δ, so ρb (πc, πc0 ) = ν¯(b ∩ (πc 4 πc0 )) = ν¯(b ∩ π(c 4 c0 )) ≤ ². As b, ² are arbitrary, π is uniformly continuous. The rest of the implications are elementary. (b) Let A be a non-empty downwards-directed set in A with infimum 0. Then 0 ∈ A (323D(b-ii)); because π is continuous, 0 ∈ π[A]. ?? If b is a non-zero lower bound for π[A] in B, then (because (B, ν¯) is semi-finite) there is a c ⊆ b with 0 < ν¯c < ∞; now ρc (πa, 0) = ν¯(c ∩ πa) = ν¯c > 0 for every a ∈ A, so 0 ∈ / π[A]. X X Thus inf π[A] = 0 in B; as A is arbitrary, π is order-continuous (313L(b-ii)). (c) By (a), it will be enough to show that π is continuous at 0. Let b ∈ Bf , ² > 0. ?? Suppose, if possible, that for every a ∈ Af , δ > 0 there is a c ∈ A such that µ ¯(a ∩ c) ≤ δ but ν¯(b ∩ πc) ≥ ². For each a ∈ Af , −n n ∈ N choose can such that µ ¯(a ∩ can ) ≤ 2 but ν¯(b ∩ πcan ) ≥ ². Set ca = inf n∈N supm≥n cam ; then P∞ µ ¯(a ∩ ca ) ≤ inf n∈N m=n µ ¯(a ∩ can ) = 0, so ca ∩ a = 0. On the other hand, because π is order-continuous, πca = inf n∈N supm≥n πcam , so that ν¯(b ∩ πca ) = limn→∞ ν¯(b ∩ supm≥n πcam ) ≥ ². This shows that ρb (1 \ a, 0) = ν¯(b ∩ π(1 \ a)) ≥ ν¯(b ∩ πca ) ≥ ². But now observe that A = {1 \ a : a ∈ Af } is a downwards-directed subset of A with infimum 0, because (A, µ ¯) is semi-finite. So π[A] is downwards-directed and has infimum 0, and 0 must be in the closure of π[A], by 323D(b-ii); while we have just seen that ρb (d, 0) ≥ ² for every d ∈ π[A]. X X
324K
Homomorphisms
91
Thus there must be a ∈ Af , δ > 0 such that ρb (πc, 0) = ν¯(b ∩ πc) ≤ ² whenever ρa (c, 0) = µ ¯(a ∩ c) ≤ δ. As b, ² are arbitrary, π is continuous at 0 and therefore continuous. 324G Corollary If (A, µ ¯) and (B, ν¯) are semi-finite measure algebras, a Boolean homomorphism π : A → B is continuous iff it is order-continuous. 324H Corollary If A is a Boolean algebra and µ ¯, ν¯ are two measures both rendering A a semi-finite measure algebra, then they endow A with the same uniformity (and, of course, the same topology). proof By 324G, the identity map from A to itself is continuous whichever of the topologies we place on A; and by 324F it is therefore uniformly continuous. 324I Definition Let (A, µ ¯) and (B, ν¯) be measure algebras. A Boolean homomorphism π : A → B is measure-preserving if ν¯(πa) = µ ¯a for every a ∈ A. ¯ be measure algebras, and π : A → B, θ : B → C 324J Proposition Let (A, µ ¯), (B, ν¯) and (C, λ) measure-preserving Boolean homomorphisms. Then θπ : A → C is a measure-preserving Boolean homomorphism. proof Elementary. 324K Proposition Let (A, µ ¯) and (B, ν¯) be measure algebras, and π : A → B a measure-preserving Boolean homomorphism. (a) π is injective. (b) (A, µ ¯) is totally finite iff (B, ν¯) is, and in this case π is order-continuous, therefore continuous, and π[A] is a closed subalgebra of B. (c) If (A, µ ¯) is semi-finite and (B, ν¯) is σ-finite, then (A, µ ¯) is σ-finite. (d) If (A, µ ¯) is σ-finite and π is sequentially order-continuous, then (B, ν¯) is σ-finite. (e) If (A, µ ¯) is semi-finite and π is order-continuous, then (B, ν¯) is semi-finite. (f) If (A, µ ¯) is atomless and semi-finite, and π is order-continuous, then B is atomless. (g) If B is purely atomic and (A, µ ¯) is semi-finite, then A is purely atomic. proof (a) If a 6= 0 in A, then ν¯πa = µ ¯a > 0 so πa 6= 0. By 3A2Db, π is injective. (b) Because ν¯1B = ν¯π1A = µ ¯ 1A , (A, µ ¯) is totally finite iff (B, ν¯) is. Now suppose that A ⊆ A is downwards-directed and non-empty and that inf A = 0. Then inf a∈A ν¯πa = inf a∈A µ ¯a = 0 by 321F. So ν¯b = 0 for any lower bound b of π[A], and inf π[A] = 0. As A is arbitrary, π is order-continuous. By 324Fc, π is continuous. By 314Fa, π[A] is order-closed in B, that is, ‘closed’ in the sense of 323I. (c) I appeal to 322G. If C is a disjoint family in A \ {0}, then hπcic∈C is a disjoint family in B \ {0}, so is countable, and C must be countable, because π is injective. Thus A is ccc and (being semi-finite) (A, µ ¯) is σ-finite. (d) Let han in∈N be a sequence in A such that µ ¯an < ∞ for every n and supn∈N an = 1. Then ν¯πan < ∞ for every n and (because π is sequentially order-continuous) supn∈N πan = 1, so (B, ν¯) is σ-finite. (e) Setting Af = {a : µ ¯a < ∞}, sup Af = 1; because π is order-continuous, sup π[Af ] = 1 in B. So if ν¯b = ∞, there is an a ∈ Af such that πa ∩ b 6= 0, and now 0 < ν¯(b ∩ πa) < ∞.
92
Measure algebras
324K
(f ) Take any non-zero b ∈ B. As in (e), there is an a ∈ A such that µ ¯a < ∞ and a ∩ b 6= 0. If a ∩ b 6= b, then surely b is not an atom. Otherwise, set C = {c : c ∈ A, c ⊆ a, b ⊆ πc}. Then C is downwards-directed and contains a, so c0 = inf C is defined in A (321F), and µ ¯c0 = inf c∈C µ ¯c ≥ ν¯b > 0, so c0 6= 0. Because A is atomless, there is a d ⊆ c0 such that neither d nor c0 \ d is zero, so that neither c0 \ d nor d can belong to C. But this means that b ∩ πd and b ∩ π(c0 \ d) are both non-zero, so that again b is not an atom. As b is arbitrary, B is atomless. (g) Take any non-zero a ∈ A. Then there is an a0 ⊆ a such that 0 < µ ¯a0 < ∞. Because B is purely 0 atomic, there is an atom b of B with b ⊆ πa . Set C = {c : c ∈ A, c ⊆ a0 , b ⊆ πc}. Then C is downwards-directed and contains a0 , so c0 = inf C is defined in A, and µ ¯c0 = inf c∈C µ ¯c ≥ ν¯b > 0, so c0 6= 0. If d ⊆ c0 , then b ∩ πd must be either b or 0. If b ∩ πd = b, then d ∈ C and d = c0 . If b ∩ πd = 0, then c0 \ d ∈ C and d = 0. Thus c0 is an atom in A. As a is arbitrary, A is purely atomic. 324L Corollary Let (A, µ ¯) be a totally finite measure algebra, (B, ν¯) a measure algebra, and π : A → B a measure-preserving homomorphism. If C ⊆ A and C is the closed subalgebra of A generated by C, then π[C] is the closed subalgebra of B generated by π[C]. proof This is a special case of 314Gb. 324M Proposition Let (X, Σ, µ) and (Y, T, ν) be measure spaces, with measure algebras (A, µ ¯) and (B, ν¯). Let φ : X → Y be inverse-measure-preserving. Then we have a sequentially order-continuous measure-preserving Boolean homomorphism π : B → A defined by setting πF • = φ−1 [F ]• for every F ∈ T. proof This is immediate from 324B. 324N Proposition Let (A, µ ¯) and (B, ν¯) be measure algebras, with Stone spaces Z and W ; let µ, ν be the corresponding measures on Z and W . If π : B → A is an order-continuous measure-preserving Boolean homomorphism, and φ : Z → W the corresponding continuous function, then φ is inverse-measurepreserving. proof Use 324E. In the notation there, if F ∈ T, then νF = ν¯F ∗ = µ ¯πF ∗ = µ ¯φ−1 [F ]∗ = µφ−1 [F ]. 324O Proposition Let (A, µ ¯) and (B, ν¯) be totally finite measure algebras, A0 a topologically dense subalgebra of A, and π : A0 → B a Boolean homomorphism such that ν¯πa = µ ¯a for every a ∈ A0 . Then π has a unique extension to a measure-preserving homomorphism from A to B. proof Let ρ, σ be the standard metrics on A, B, as in 323Ad. Then for any a, a0 ∈ A0 σ(πa, πa0 ) = ν¯(πa4πa0 ) = ν¯π(a4a0 ) = µ ¯(a4a0 ) = ρ(a, a0 ); that is, π : A0 → B is an isometry. Because A0 is dense in the metric space (A, ρ), while B is complete under σ (323Gc), there is a unique continuous function π ˆ : A → B extending π (3A4G). Now the operations (a, a0 ) 7→ π ˆ (a ∪ a0 ),
(a, a0 ) 7→ π ˆa ∪ π ˆ a0 : A × A → B,
are continuous and agree on the dense subset A0 × A0 of A × A; because the topology of B is Hausdorff, they agree on A × A, that is, π ˆ (a ∪ a0 ) = π ˆa ∪ π ˆ a0 for all a, a0 ∈ A (2A3Uc). Similarly, the operations a 7→ π ˆ (1 \ a),
a 7→ 1 \ π ˆa : A → B
324X
Homomorphisms
93
are continuous and agree on the dense subset A0 of A, so they agree on A, that is, π ˆ (1 \ a) = 1 \ a for every a ∈ A. Thus π ˆ is a Boolean homomorphism. To see that it is measure-preserving, observe that a 7→ µ ¯a = ρ(a, 0),
a 7→ ν¯(ˆ π a) = σ(ˆ π a, 0) : A → R
are continuous and agree on A0 , so agree on A. Finally, π ˆ is the only measure-preserving Boolean homomorphism extending π, because any such map must be continuous (324Kb), and π ˆ is the only continuous extension of π. *324P The following fact will be useful in §386, by which time it will seem perfectly elementary; for the moment, it may be a useful exercise. Proposition Let (A, µ ¯) and (B, ν¯) be totally finite measure algebras such that µ ¯1 = ν¯1. Suppose that A ⊆ A and φ : A → B are such that ν¯(inf i≤n φai ) = µ ¯(inf i≤n ai ) for all a0 , . . . , an ∈ A. Let C be the smallest closed subalgebra of A including A. Then φ has a unique extension to a measure-preserving Boolean homomorphism from C to B. proof (a) Let Ψ be the family of all functions ψ extending φ and having the same properties; that is, ψ is a function from a subset of A to B, and ν¯(inf i≤n ψai ) = µ ¯(inf i≤n ai ) for all a0 , . . . , an ∈ dom ψ. By Zorn’s Lemma, Ψ has a maximal member θ. Write D for the domain of θ. (b)(i) If c, d ∈ D then c ∩ d ∈ D. P P?? Otherwise, set D0 = D ∪ {c ∩ d} and extend θ to θ0 : D0 → B by 0 writing θ (c ∩ d) = θc ∩ θd. It is easy to check that θ0 ∈ Ψ, which is supposed to be impossible. X XQ Q Now ν¯(θc ∩ θd ∩ θ(c ∩ d)) = µ ¯(c ∩ d) = ν¯(θc ∩ θd) = ν¯θ(c ∩ d), so θ(c ∩ d) = θc ∩ θd. (ii) If d ∈ D then 1 \ d ∈ D. P P?? Otherwise, set D0 = D ∪ {1 \ d} and extend θ to D0 by writing θ (1 \ d) = 1 \ θd. Once again, it is easy to check that θ0 ∈ Ψ, which is impossible. X XQ Q Consequently (since D is certainly not empty, even if C is), D is a subalgebra of A (312B(iii)). 0
(iii) Since ν¯θ1 = µ ¯1 = ν¯1, θ1 = 1. If d ∈ D then ν¯θ(1 \ d) = µ ¯(1 \ d) = µ ¯1 − µ ¯d = ν¯1 − ν¯θd = ν¯(1 \ θd), while ν¯(θd ∩ θ(1 \ d)) = µ ¯(d ∩ (1 \ d)) = 0, so θd ∩ θ(1 \ d)) = 0, θ(1 \ d) ⊆ 1 \ θd and θ(1 \ d) must be equal to 1 \ θd. By 312H, θ : D → B is a Boolean homomorphism. (iv) Let D be the topological closure of D in A. Then it is an order-closed subalgebra of A (323J), so, with µ ¯¹ D, is a totally finite measure algebra in which D is a topologically dense subalgebra. By 324O, there is an extension of θ to a measure-preserving Boolean homomorphism from D to B; of course this extension belongs to Ψ, so in fact D = D is a closed subalgebra of A. (c) Since A ⊆ D, C ⊆ D and φ1 = θ¹ C is a suitable extension of φ. To see that φ1 is unique, let φ2 : C → B be any other measure-preserving Boolean homomorphism extending φ. Set C = {a : φ1 a = φ2 a}; then C is a topologically closed subalgebra of A including A, so is the whole of C, and φ2 = φ1 . 324X Basic exercises (a) Let A and B be Boolean algebras, of which A is Dedekind σ-complete, and φ : A → B a sequentially order-continuous Boolean homomorphism. Let I be an ideal of A included in the kernel of φ. Show that we have a sequentially order-continuous Boolean homomorphism π : A/I → B given by setting φ(a• ) = φa for every a ∈ A.
94
Measure algebras
324Xb
(b) Let (A, µ ¯) be a measure algebra, and B a σ-subalgebra of A. Show that provided that (B, µ ¯¹ B) is semi-finite, then the topology of B induced by µ ¯¹ B is just the subspace topology induced by the topology of A. (Hint: apply 324Fc to the embedding B ⊆ A.) ˜ µ (c) Let (X, Σ, µ) be a measure space and (X, Σ, ˜) its c.l.d. version. Let A, A2 be the corresponding measure algebras and π : A → A2 the canonical homomorphism (see 322Db). Show that π is topologically continuous. (d) Let (A, µ ¯) and (B, ν¯) be measure algebras, and π : A → B a bijective measure-preserving Boolean homomorphism. Show that π −1 : B → A is a measure-preserving homomorphism. (e) Let µ ¯ be counting measure on PN. Show that (PN, µ ¯) is a σ-finite measure algebra. Find a measurepreserving Boolean homomorphism from PN to itself which is not sequentially order-continuous. 324Y Further exercises (a) Let A and B be Boolean algebras, of which A is Dedekind complete, and φ : A → B an order-continuous Boolean homomorphism. Let I be an ideal of A included in the kernel of φ. Show that we have an order-continuous Boolean homomorphism π : A/I → B given by setting φ(a• ) = φa for every a ∈ A. (b) Let A be a Dedekind σ-complete Boolean algebra, and Z its Stone space. Write E for the algebra of open-and-closed subsets of Z, and Z for the family of nowhere dense zero sets of Z; let Zσ be the σ-ideal of subsets of Z generated by Z. Show that Σ = {E4U : E ∈ E, U ∈ Zσ } is a σ-algebra of subsets of Z, and describe a canonical isomorphism between Σ/Zσ and A. (c) Let A and B be Dedekind σ-complete Boolean algebras, with Stone spaces Z and W . Construct Zσ ⊆ Σ ⊆ PZ as in 324Yb, and let Wσ ⊆ T ⊆ PW be the corresponding structure defined from B. Let π : B → A be a sequentially order-continuous Boolean homomorphism, and φ : Z → W the corresponding continuous map. Show that if E ∗ ∈ A corresponds to E ∈ Σ, then πF ∗ = φ−1 [F ]∗ for every F ∈ T. (Hint: 313Yb.) (d) Let A be a Boolean algebra, B a ccc Boolean algebra and π : A → B an injective Boolean homomorphism. Show that A is ccc. (e) Let A be a Dedekind complete Boolean algebra, B a Boolean algebra, and π : A → B an ordercontinuous Boolean homomorphism. Show that for every atom b ∈ B there is an atom a ∈ A such that πa ⊇ b. Hence show that if A is atomless so is B, and that if B is purely atomic and π is injective then A is purely atomic. (f ) Let (A, µ ¯) and (B, ν¯) be localizable measure algebras and A0 an order-dense subalgebra of A. Suppose that π : A0 → B is an order-continuous Boolean homomorphism such that ν¯πa = µ ¯a for every a ∈ A0 . Show that π has a unique extension to a measure-preserving Boolean homomorphism from A to B. (g) Let (A, µ ¯) be the measure algebra of Lebesgue measure on [0, 1]. (i) Show that there is an injective order-preserving function f : A → PN. (Hint: take a countable topologically dense subset D of A, and define f : A → P(D × N) by setting f (a) = {(d, q) : µ ¯(a ∩ d) ≥ q}.) (ii) Show that there is an order-preserving function h : PN → A such that h(f (a)) = a for every a ∈ A. (Hint: set h(I) = sup{a : f (a) ⊆ I}.) Compare 316Yo. (h) Let (A, µ ¯) and (B, ν¯) be probability algebras, and f : A → B an isometry for the measure metrics. Show that a 7→ f (a) 4 f (1) is a measure-preserving Boolean homomorphism. 324 Notes and comments If you examine the arguments of this section carefully, you will see that rather little depends on the measures named. Really this material deals with structures (X, Σ, I) where X is a set, Σ is a σ-ideal of subsets of X, and I is a σ-ideal of Σ, corresponding to the family of measurable negligible sets. In this abstract form it is natural to think in terms of sequentially order-continuous homomorphisms, as in 324Yc. I have stated 324E in terms of order-continuous homomorphisms just for a slight gain in
325A
Free products and product measures
95
simplicity. But in fact, when there is a difference, it is likely that order-continuity, rather than sequential order-continuity, will be the more significant condition. Note that when the domain algebra is σ-finite, the two concepts coincide, because it is ccc (316Fd, 322G). Of course I need to refer to measures when looking at such concepts as σ-finite measure algebra or measurepreserving homomorphism, but even here the real ideas involved are such notions as order-continuity and the countable chain condition, as you will see if you work through 324K. It is instructive to look at the translations of these facts into the context of inverse-measure-preserving functions; see 235Xe. 324H shows that we may speak of ‘the’ topology and uniformity of a Dedekind σ-complete Boolean algebra which carries any semi-finite measure; the topology of such an algebra is determined by its algebraic structure. Contrast this with the theory of normed spaces: two Banach spaces (e.g., `1 and `2 ) can be isomorphic as linear spaces, both being of algebraic dimension c, while they are not isomorphic as topological linear spaces. When we come to the theory of ordered linear topological spaces, however, we shall again find ourselves with operators whose algebraic properties guarantee continuity (355C, 367P).
325 Free products and product measures In this section I aim to describe the measure algebras of product measures as defined in Chapter 25. This will involve the concept of ‘free product’ set out in §315. It turns out that we cannot determine the measure algebra of a product measure from the measure algebras of the factors (325B), unless the product measure is localizable; but that there is nevertheless a general construction of ‘localizable measure algebra free product’, applicable to any pair of semi-finite measure algebras (325D), which represents the measure algebra of the product measure in the most important cases (325Eb). In the second part of the section (325I-325M) I deal with measure algebra free products of probability algebras, corresponding to the products of probability spaces treated in §254. 325A Theorem Let (X, Σ, µ) and (Y, T, ν) be measure spaces, with measure algebras (A, µ ¯) and (B, ν¯). ¯ be the corresponding measure Let λ be the c.l.d. product measure on X × Y , and Λ its domain; let (C, λ) algebra. (a)(i) The map E 7→ E × Y : Σ → Λ induces an order-continuous Boolean homomorphism from A to C. (ii) The map F 7→ X × F : T → Λ induces an order-continuous Boolean homomorphism from B to C. (b) The map (E, F ) 7→ E × F : Σ × T → Λ induces a Boolean homomorphism ψ : A ⊗ B → C. (c) ψ[A ⊗ B] is topologically dense in C. (d) For every c ∈ C, ¯ = sup{λ(c ¯ ∩ ψ(a ⊗ b)) : a ∈ A, b ∈ B, µ λc ¯a < ∞, ν¯b < ∞}. ¯ (e) If µ and ν are semi-finite, ψ is injective and λψ(a ⊗ b) = µ ¯a · µ ¯b for every a ∈ A, b ∈ B. proof (a) By 251E, E × Y ∈ Λ for every E ∈ Σ, and λ0 (E × Y ) = 0 whenever µE = 0, where λ0 is the primitive product measure described in 251A-251C; consequently λ(E × Y ) = 0 whenever µE = 0 (251F). Thus E 7→ (E × Y )• : Σ → C is a Boolean homomorphism with kernel including {E : µE = 0}, so descends to a Boolean homomorphism ε1 : A → C. To see that ε1 is order-continuous, let A ⊆ A1 be a non-empty downwards-directed set with infimum 0. ?? If there is a non-zero lower bound c of ε1 [A], express c as W • where W ∈ Λ. We have λ(W ) > 0; by the definition of λ (251F), there are G ∈ Σ, H ∈ T such that µG < ∞, νH < ∞ and λ(W ∩ (G × H)) > 0. Of course inf a∈A a ∩ G• = 0 in A, so inf a∈A µ ¯(a ∩ G• ) = 0, by 321F; let a ∈ A be such that µ ¯(a ∩ G• ) · νH < • λ(W ∩ (G × H)). Express a as E , where E ∈ Σ. Then λ(W \ (E × Y )) = 0. But this means that λ(W ∩ (G × H)) ≤ λ((E ∩ G) × H) = µ(E ∩ G) · νH = µ ¯(a ∩ G• ) · νH, contradicting the choice of a. X X Thus inf ε1 [A] = 0 in C; as A is arbitrary, ε1 is order-continuous. Similarly ε2 : B → C, induced by F 7→ X × F : T → Λ, is order-continuous. (b) Now there must be a corresponding Boolean homomorphism ψ : A ⊗ B → C such that ψ(a ⊗ b) = ε1 a ∩ ε2 b for every a ∈ A, b ∈ B, that is,
96
Measure algebras
325A
ψ(E • ⊗ F • ) = (E × Y )• ∩ (X × F )• = (E × F )• for every E ∈ Σ, F ∈ T (315I). ¯ < ∞ and ² > 0. Express c, e as U • , W • where U , W ∈ Λ. By 251Ie, there (c) Suppose that c, e ∈ C, λe S are E0 , . . . , En ∈ Σ, F0 , . . . , Fn ∈ T, all of finite measure, such that λ((U ∩ W )4 i≤n Ei × Fi ) ≤ ². Set S c1 = ( i≤n Ei × Fi )• ∈ ψ[A ⊗ B]; then
¯ ∩ (c 4 c1 )) = λ(W ∩ (U 4 S λ(e i≤n Ei × Fi )) ≤ ².
As c, e and ² are arbitrary, ψ[A ⊗ B] is topologically dense in C. (d) By the definition of λ, we have λW = sup{λ(W ∩ (E × F )) : E ∈ Σ, F ∈ T, µE < ∞, νF < ∞} for every W ∈ Λ; so all we have to do is express c as W • . (e) Now suppose that µ and ν are semi-finite. Then λ(E × F ) = µE · νF for any E ∈ Σ, F ∈ T (251J), ¯ so λψ(a ⊗ b) = µ ¯a · ν¯b for every a ∈ A, b ∈ B. To see that ψ is injective, take any non-zero c ∈ A ⊗ B; then there must be non-zero a ∈ A, b ∈ B such that a ⊗ b ⊆ c (315Jb), so that ¯ ≥ λψ(a ¯ λψc ⊗ b) = µ ¯a · ν¯b > 0 and ψc 6= 0. 325B Characterizing the measure algebra of a product space A very natural question to ask is, whether it is possible to define a ‘measure algebra free product’ of two abstract measure algebras in a way which will correspond to one of the constructions above. I give an example to show the difficulties involved. Example There are complete locally determined localizable measure spaces (X, µ), (X 0 , µ0 ), with isomorphic measure algebras, and a probability space (Y, ν) such that the measure algebras of the c.l.d. product measures on X × Y , X 0 × Y are not isomorphic. proof Let (X, Σ, µ) be the complete locally determined localizable not-strictly-localizable measure space described in 216E. Recall that, for E ∈ Σ, µE = #({γ : γ ∈ C, fγ ∈ E}) if this is finite, ∞ otherwise (216Eb), where C is a set of cardinal greater than c. The map E 7→ {γ : fγ ∈ E} : Σ → PC is surjective (216Ec), so descends to an isomorphism between A, the measure algebra of µ, and PC. Let (X 0 , Σ0 , µ0 ) be C with counting measure, so that its measure algebra (A0 , µ ¯0 ) is isomorphic to (A, µ ¯), while µ0 is of course strictly localizable. Let (Y, T, ν) be {0, 1}C with its usual measure. Let λ, λ0 be the c.l.d. product measures on X × Y , X 0 × Y ¯ (C0 , λ ¯ 0 ) the corresponding measure algebras. Then λ is not localizable (254U), so respectively, and (C, λ), ¯ (C, λ) is not localizable (322Be). On the other hand, λ0 , being the c.l.d. product of strictly localizable ¯ 0 ) is localizable, and is not isomorphic measures, is strictly localizable (251N), therefore localizable, so (C0 , λ ¯ to (C, λ). 325C Thus there can be no universally applicable method of identifying the measure algebra of a product measure from the measure algebras of the factors. However, you have no doubt observed that the example above involves non-σ-finite spaces, and conjectured that this is not an accident. In contexts in which we know that all the algebras involved are localizable, there are positive results available, such as the following. Theorem Let (X1 , Σ1 , µ1 ) and (X2 , Σ2 , µ2 ) be semi-finite measure spaces, with measure algebras (A1 , µ ¯1 ) ¯ the corresponding measure and (A2 , µ ¯2 ). Let λ be the c.l.d. product measure on X1 × X2 , and (C, λ) algebra. Let (B, ν¯) be a localizable measure algebra, and φ1 : A1 → B, φ2 : A2 → B order-continuous Boolean homomorphisms such that ν¯(φ1 (a1 ) ∩ φ2 (a2 )) = µ ¯1 a1 · µ ¯2 a2 for all a1 ∈ A1 , a2 ∈ A2 . Then there is a unique order-continuous measure-preserving Boolean homomorphism φ : C → B such that φ(ψ(a1 ⊗ a2 )) = φ1 (a1 ) ∩ φ2 (a2 ) for all a1 ∈ A1 , a2 ∈ A2 , writing ψ : A1 ⊗ A2 → C for the canonical map described in 325A.
325C
Free products and product measures
97
proof (a) Because ψ is injective, it is an isomorphism between A1 ⊗ A2 and its image in C. I trust it will cause no confusion if I abuse notation slightly and treat A1 ⊗ A2 as actually a subalgebra of C. Now the Boolean homomorphisms φ1 , φ2 correspond to a Boolean homomorphism θ : A1 ⊗ A2 → B. The point is ¯ for every c ∈ A ⊗ B. P that ν¯θc = λc P By 315Jb, every member of A1 ⊗ A2 is expressible as supi≤n ai ⊗ a0