This paper extends the Stone Duality Theorem to zero-dimensional Hausdorff spaces, establishing two new duality theorems that encompass extremally disconnected spaces and compactifications, unifying several classical dualities.
Contribution
It introduces two novel duality theorems for zero-dimensional Hausdorff spaces, extending Stone Duality and deriving related dualities and classical theorems.
Findings
01
Proves two duality theorems for ZHaus category.
02
Derives Tarski Duality and dualities for extremally disconnected spaces.
03
Describes categories dually equivalent to zero-dimensional compactifications.
Abstract
Extending the Stone Duality Theorem, we prove two duality theorems for the category ZHaus of zero-dimensional Hausdorff spaces and continuous maps. Both of them imply easily the Tarski Duality Theorem, as well as two new duality theorems for the category EDTych of extremally disconnected Tychonoff spaces and continuous maps. Also, we describe two categories which are dually equivalent to the category ZComp of zero-dimensional Hausdorff compactifications of zero-dimensional Hausdorff spaces and obtain as a corollary the Dwinger Theorem about zero-dimensional compactifications of a zero-dimensional Hausdorff space.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Full text
**Two extensions of the Stone Duality
** **to the category of zero-dimensional
** **Hausdorff spaces
**
Georgi Dimov and Elza Ivanova-Dimova††thanks: The authors
were supported by the Bulgarian National Fund of Science, contract no. DN02/15/19.12.2016.
Faculty of Math. and Informatics,
Sofia University, 5 J. Bourchier Blvd., 1164
Sofia, Bulgaria
Abstract
Extending the Stone Duality Theorem, we prove two duality theorems for
the category ZHaus of
zero-dimensional Hausdorff spaces and continuous maps. Both of them imply easily the
Tarski Duality Theorem,
as well as two new duality theorems for the category EDTych of extremally disconnected Tychonoff spaces and continuous maps.
Also, we describe two categories which are dually equivalent to the category
ZComp of zero-dimensional Hausdorff compactifications of
zero-dimensional Hausdorff spaces and obtain as a corollary the Dwinger Theorem about zero-dimensional compactifications of a zero-dimensional
Hausdorff space.
In 1937, M. Stone [16] proved that there exists a bijective
correspondence Tl between the class of all (up to
homeomorphism) zero-dimensional locally compact Hausdorff spaces
(briefly, Boolean spaces) and the class of all (up to
isomorphism) generalized Boolean algebras (briefly, GBAs) (or,
equivalently, Boolean rings with or without unit). In the class of
compact Boolean spaces (briefly, Stone spaces) this
bijection can be extended to a dual equivalence T:Stone⟶Boole between
the category Stone of Stone spaces and continuous maps and the
category Boole of Boolean algebras and Boolean homomorphisms;
this is the classical Stone Duality. In 1964, H. P. Doctor
[9] showed that the Stone bijection Tl can be even
extended to a dual equivalence between the category BooleSpperf of
Boolean spaces and perfect maps between them and the
category GBoole of GBAs and suitable morphisms between them.
Later on, G. Dimov [6, 7] extended the Stone
Duality to the category BooleSp of
Boolean spaces and continuous maps.
In this article, which was inspired by the recent paper [4]
of G. Bezhanishvili, P. J. Morandi and B. Olberding, we describe two extensions of
the Stone Duality to the category ZHaus of zero-dimensional
Hausdorff spaces and continuous maps. Namely, we define two
categories dzBoole and mzMaps, and prove
that they are dually equivalent to the category ZHaus. From the restrictions of our dual equivalences F:ZHaus⟶dzBoole and F:ZHaus⟶mzMaps
to the category Stone and the category D of discrete spaces and continuous maps, we obtain easily the Stone Duality and the Tarski Duality, respectively. The restrictions of F and F to the category EDTych of extremally disconnected Tychonoff spaces and continuous maps give us two duality theorems for the category EDTych. We
introduce as well two other categories, namely, the categories
zBoole and zMaps, and show that they are dually equivalent to
the category ZComp of zero-dimensional Hausdorff
compactifications of zero-dimensional Hausdorff spaces.
As a corollary, we obtain the Dwinger Theorem [10] about zero-dimensional compactifications of a zero-dimensional
Hausdorff space. Let us note that the category ZComp is a full subcategory of the
category Comp of all Hausdorff compactifications of Tychonoff
spaces defined in [4].
The paper is organized as follows. Section 2 contains all
preliminary facts and definitions which are used in this paper.
In
Section 3, we introduce the notions of Boolean z-algebra and
Boolean dz-algebra, define the category dzBoole having as objects all dz-algebras and
prove our first duality theorem for the category ZHaus by showing that there exist contravariant functors
F:ZHaus⟶dzBoole and G:dzBoole⟶ZHaus whose compositions are naturally isomorphic to the corresponding identity functors
(see Theorem 3.15).
In the next Section 4, we introduce the notions of Boolean z-map and maximal
Boolean z-map, and define the category
mzMaps having as objects all
maximal Boolean z-maps. In Theorem 4.7 we show that the categories
dzBoole and mzMaps are equivalent. This implies immediately that
the categories ZHaus and mzMaps are dually equivalent (see
Theorem 4.8 which is our second duality theorem for the category ZHaus). The corresponding dual equivalences are denoted by
F:ZHaus⟶mzMaps and G:mzMaps⟶ZHaus.
In Section 5 we describe the subcategories of the categories dzBoole and mzMaps which are isomorphic to the category Boole (see Propositions 5.1 and 5.3) and show that the corresponding restrictions of F, G, F and G imply the Stone Duality Theorem (see Propositions 5.2 and 5.4). Thus F, G, F and G are extensions of the classical Stone dual equivalences T:Stone⟶Boole and S:Boole⟶Stone.
In Section 6 we describe the subcategories of the categories dzBoole and mzMaps which are isomorphic to the category D (see Proposition 6.1), prove that the corresponding restrictions of F, G, F and G lead to a dual equivalence
[TABLE]
which is slightly different from the classical Tarski dual equivalence At:Caba⟶Set, and show that it implies the Tarski Duality Theorem (see Propositions 6.3).
In Section 7 we regard the restrictions of F, G, F and G to the category EDTych and obtain two duality theorems for the category EDTych (see Theorems 7.2 and 7.4). The categories which a dually equivalent to the category EDTych are simpler than the categories dzBoole and mzMaps; their objects are all complete Boolean z-algebras and all complete Boolean z-maps, respectively, although one could expect that their objects should be all complete Boolean dz-algebras and all complete Boolean mz-maps, respectively.
In the last Section 8, we define the categories zBoole and
zMaps. Their objects are, respectively, all Boolean z-algebras
and all Boolean z-maps. We show that the category zBoole is dually equivalent to the category ZComp
(see Theorem 8.5). Then we prove that the categories ZComp and
zMaps are dually equivalent (see Theorem 8.8).
In 8.9 we show that both of these results imply the Dwinger Theorem [10] which describes the ordered set of all, up to equivalence, zero-dimensional compactifications of a zero-dimensional Hausdorff space X.
We want to add that in the continuation [8] of this paper, we show how the Dimov Duality Theorem for Boolean spaces [6, 7] can be derived from our duality Theorem 3.15 and, moreover, using our Theorems 3.15 and 4.8, we prove two new duality theorems for the category BooleSp.
We now fix the notation.
Throughout, (B,∧,∨,∗,0,1) will denote a Boolean algebra unless indicated otherwise;
we do not assume that 0=1. With some abuse of language, we
shall usually identify algebras with their universe, if no
confusion can arise.
We denote by 2 the simplest Boolean
algebra containing only [math] and 1, where 0=1.
If A is a Boolean algebra, then A+=dfA∖{0} and At(A) is the set of all atoms of A.
If X is a set, we denote by P(X) the power set of X;
clearly, (P(X),∪,∩,∖,∅,X)(=(P(X),⊆)) is a complete atomic Boolean
algebra.
If X is a topological space, we denote by \mboxCO(X) the set of
all clopen (= closed and open) subsets of X. Obviously,
(\mboxCO(X),∪,∩,∖,∅,X)(=(\mboxCO(X),⊆)) is a Boolean algebra.
If (X,T) is a topological space and M is a subset of X, we
denote by \mboxcl(X,T)(M) (or simply by \mboxcl(M) or \mboxclX(M))
the closure of M in (X,T) and by \mboxint(X,T)(M) (or
briefly by \mboxint(M) or \mboxintX(M)) the interior of M in
(X,T).
If C is a category, we denote by ∣C∣ the class of the objects of C and by C(X,Y) the set of all
C-morphisms between two C-objects X and Y.
We denote by:
•
Set the category of sets and functions,
•
Top the category of topological spaces and continuous maps,
•
ZHaus the category of all zero-dimensional Hausdorff spaces and continuous
maps,
•
D the category of all discrete spaces and continuous
maps,
•
Stone the category of all compact Hausdorff zero-dimensional spaces (= Stone spaces) and their continuous maps,
•
EDTych the category of extremally disconnected Tychonoff spaces and continuous maps,
•
Boole the category
of Boolean algebras and Boolean homomorphisms,
•
Caba the category of all complete atomic Boolean algebras and all complete Boolean
homomorphisms between them.
The main reference books for all notions which are not defined here
are [2, 15, 10, 11].
2 Preliminaries
2.1**.**
Let α∈Boole(A,B) and x∈At(B). Then it is easy to see that the map
[TABLE]
defined by
αx(a)=1⇔x≤α(a), for a∈A, is a Boolean homomorphism. We put
[TABLE]
Note that if α is a complete Boolean homomorphism, then, for every x∈At(B), αx is a complete Boolean homomorphism as well.
We put
[TABLE]
It is easy to see that if every atom of B is a meet of some
elements of α(A), then hα is a bijection.
If A=B and α=idB, then we have that
αx(b)=1⇔x≤b, for all b∈B. In this case, for simplicity, we will write xˇ instead of αx, XˇB instead of Xα and hˇB instead of hα. Hence,
[TABLE]
is defined by xˇ(b)=1⇔x≤b, for all b∈B,
[TABLE]
and
[TABLE]
Note that every xˇ is a complete Boolean homomorphism and hˇB is a bijection.
Further, if X is a set, B=P(X), A is a Boolean subalgebra of B and α is the inclusion map, then, obviously, the map αx is defined by αx(U)=1⇔x∈U, for every U∈A. In order to simplify the notation, for such A and B, we will write x^ (and, sometimes, even x^A) instead of αx.
(Note that every x^ is a complete Boolean homomorphism.) Thus, in such a case, by
[TABLE]
we will understand the map defined by x^(U)=1⇔x∈U, for every U∈A; also, we will write X^A instead of Xα, and h^X,A instead of hα, i.e.,
[TABLE]
and
[TABLE]
Note that if the family AT0-separates the points of X (i.e., for every x,y∈X such that x=y, there exists U∈A with ∣U∩{x,y}∣=1), then the map h^X,A is a bijection.
If X is a topological space and A=(\mboxCO(X),⊆), we will simply write X^ instead of X^A, and h^X instead of h^X,A, i.e.,
[TABLE]
Obviously, if X is a zero-dimensional Hausdorff space, then h^X is a bijection.
2.2**.**
We will denote by CO:Top⟶Boole the contravariant functor which assigns to every X∈∣Top∣ the Boolean algebra (\mboxCO(X),⊆) and to every f∈Top(X,Y), the Boolean homomorphism CO(f):CO(Y)⟶CO(X) defined by CO(f)(U)=dff−1(U), for every U∈\mboxCO(Y).
Now we will briefly describe the Stone duality [16]
between the categories Boole and Stone using its presentation
given in [13]. We will define two contravariant functors
[TABLE]
For any Boolean algebra A, we let the
space S(A) to be the set
[TABLE]
endowed with a topology TA having as a
closed base the family {sA(a)∣a∈A}, where
[TABLE]
for every a∈A; then S(A)=(XA,TA) is a
Stone
space. Note that the family {sA(a)∣a∈A} is also an open base of
the space (XA,TA).
If φ∈Boole(A,B), then we define S(φ):S(B)⟶S(A)
by the formula S(φ)(y)=dfy∘φ for every y∈S(B).
It is easy to see that S is a contravariant functor.
The contravariant functor T is defined to be the restriction of the contravariant functor CO to the category Stone.
For every X∈∣Stone∣, the map tX:X⟶S(T(X)),x↦(x^:CO(X)⟶\mbox2) is a homeomorphism and
[TABLE]
is a natural isomorphism.
Also, the Stone map
[TABLE]
is a Boole-isomorphism and
[TABLE]
is natural isomorphism.
Thus ⟨T,S,t,s⟩:Stone⟶Boole is an adjoint dual
equivalence (in the sense of [15]).
Definition 2.3**.**
An extension of a space X is a pair (Y,c), where Y
is a space and c:X⟶Y is a dense embedding of X into Y. Often we will simply write c instead of (Y,c).
Two extensions (Yi,ci),i=1,2, of X are called equivalent if there exists a homeomorphism
f:Y1⟶Y2 such that f∘c1=c2. Clearly, this defines an equivalence
relation in the class of all
extensions of X; the equivalence class of an extension (Y,c)
of X will be denoted by [(Y,c)]. We write
[TABLE]
and say that the extension (Y2,c2) is larger than the extension (Y1,c1) if there
exists a continuous mapping f:Y2⟶Y1 such that f∘c2=c1. This relation is a preorder (i.e., it is
reflexive and transitive).
In the class of all Hausdorff extensions
of X, the equivalence relation associated with this preorder
(i.e., (Y1,c1) is larger than (Y2,c2) and conversely)
coincide with the relation of equivalence defined above.
Setting for every two Hausdorff extensions (Yi,ci),i=1,2, of
a Hausdorff space X,
[TABLE]
we obtain a well-defined relation on the
set of all, up to equivalence, Hausdorff extensions of X; it is
already an order.
Definition 2.4**.**
(Ph. Dwinger [10])*
*Let (X,T) be a zero-dimensional Hausdorff space.
A Boolean algebra A is called admissible for(X,T) (or, a Boolean base for(X,T)) if A is a
Boolean subalgebra of the Boolean algebra CO(X) and A is an
open base for (X,T).
The set of all admissible Boolean algebras for (X,T) will be
denoted by BA(X,T) (or, simply, by BA(X)).
Notation 2.5**.**
The set of all (up to equivalence) zero-dimensional compact
Hausdorff
extensions of a zero-dimensional Hausdorff space (X,T)
will be denoted by K0(X,T) (or, simply, by K0(X)). The order on K0(X,T)
induced by the order ‘‘≤ ” on the set of all Hausdorff
extensions of X (defined in 2.3) will be denoted again by
‘‘≤”.
Theorem 2.6**.**
(Ph. Dwinger [10])*
Let (X,T) be a zero-dimensional Hausdorff space. Then the
ordered sets (BA(X,T),⊆) and (K0(X,T),≤)
are isomorphic. The isomorphism δ between these two ordered
sets is the following one: for every A∈BA(X,T),
δ(A)=df[(S(A),eA)], with eA:X⟶S(A) defined by
eA(x)=df(x^:A⟶\mbox2), for every x∈X
(see 2.1 for the notation x^).
*
For every zero-dimensional Hausdorff space X, the ordered set
(BA(X),⊆) has a greatest element, namely the Boolean
algebra CO(X). Thus, by the Dwinger Theorem 2.6,
the ordered set (K0(X),≤) also has a greatest element. It
is denoted by (β0X,β0). This fact was discovered earlier by
B. Banaschewski [3] and (β0X,β0) is said to be the Banaschewski compactification of X. Clearly,
(β0X,β0)=δ(CO(X)), i.e. β0X=S(CO(X)) and
β0=eCO(X).
Theorem 2.7**.**
(B. Banaschewski [3])*
Let (Xi,Ti), i=1,2, be zero-dimensional Hausdorff spaces
and (cX2,c) be a zero-dimensional Hausdorff compactification of
X2. Then for every continuous function f:X1⟶X2 there
exists a continuous function g:β0X1⟶cX2 such that
g∘β0=c∘f.*
2.8**.**
We will need the Tarski Duality between the categories Set
and Caba. It consists of two contravariant functors
[TABLE]
which are defined as follows. For every set X,
[TABLE]
If f∈Set(X,Y), then P(f):P(Y)⟶P(X) is defined by the formula
[TABLE]
for
every M∈P(Y). Further, for every B∈∣Caba∣,
[TABLE]
if σ∈Caba(B,B′), then
At(σ):At(B′)⟶At(B) is defined by the formula
[TABLE]
for every
x′∈At(B′).
For each set X, we have a bijection
ηX:X⟶At(P(X)), given by ηX(x)=df{x} for every
x∈X, and
[TABLE]
is a natural isomorphism.
For each B∈∣Caba∣ we have a Caba-isomorphism
[TABLE]
given by εB(b)=df{x∈At(B)∣x≤b} for each b∈B, and
[TABLE]
is a natural isomorphism. Note that
εB−1(M)=⋁BM, for all M⊆At(B).
Thus ⟨P,At,η,ε⟩:Set⟶Caba is an adjoint dual equivalence.
The following assertion is well known (because At(σ) is the restriction to At(B′) of the lower (or, left) adjoint for σ (see [14, Theorem 4.2])), but we will present here its short proof.
Lemma 2.9**.**
Let σ∈Caba(B,B′). Then, for every b∈B and each x′∈At(B′), (x′≤σ(b))⇔(At(σ)(x′)≤b).
Proof.
Since At(σ)(x′)=⋀{b∈B∣x′≤σ(b)},
we obtain immediately that (x′≤σ(b))⇒(At(σ)(x′)≤b).
Suppose now that At(σ)(x′)≤b. Then σ(At(σ)(x′))≤σ(b).
Since σ(At(σ)(x′))=σ(⋀{c∈B∣x′≤σ(c)})=⋀{σ(c)∣c∈B,x′≤σ(c)}≥x′, we obtain that x′≤σ(b).
∎
2.10**.**
A set F in a topological space X is regular closed (or a closed domain [11]) if it is the closure of its interior in X: F=cl(int(F)). The collection \mboxRC(X) of all regular closed sets in X becomes a Boolean algebra, with the Boolean operations ∨,∧,∗,0,1 given by
[TABLE]
The Boolean algebra \mboxRC(X) is actually complete, with the infinite joins and meets given by
[TABLE]
We will need as well the following well-known statement (see, e.g., [5],
p.271, and, for a proof, [17]).
Lemma 2.11**.**
Let X be a dense subspace of a topological space Y. Then the
functions
[TABLE]
and
[TABLE]
are Boolean isomorphisms between Boolean
algebras \mboxRC(X) and \mboxRC(Y), and e∘r=idRC(Y), r∘e=idRC(X). (We will sometimes write rX,Y (resp., eX,Y) instead of r (resp., e).)
3 The first duality theorem for the category ZHaus
Definition 3.1**.**
A pair (A,X), where A is a Boolean algebra and X⊆Boole(A,\mbox2), is called a Boolean z-algebra (briefly, z-algebra; abbreviated as ZA) if for each a∈A+ there exists
x∈X such that x(a)=1.
Using the definition of the space S(A) (see 2.2),
where A is a Boolean algebra, we obtain immediately the
following result:
Fact 3.2**.**
A pair (A,X) is a z-algebra if and only if A is a Boolean algebra and X is
a dense subset of S(A).
Notation 3.3**.**
If A is a Boolean algebra and X⊆Boole(A,\mbox2), we set
[TABLE]
for each a∈A (see (1)
for sA), defining in such a way a map
[TABLE]
Fact 3.4**.**
A pair (A,X) is a z-algebra if and only if A is a Boolean algebra, X⊆Boole(A,\mbox2) and
sAX:A⟶P(X) is a Boolean monomorphism.
Proof.
Suppose that (A,X) is a ZA. Then, by Fact 3.2, X is a
dense subset of K=dfS(A) and thus \mboxclK(sAX(a))=sA(a)
for each a∈A. Therefore, using the fact that sA is a
Boolean isomorphism, we obtain that sAX is a Boolean
monomorphism.
Conversely, if sAX is a Boolean monomorphism, then
sAX(a)=∅ for each a∈A+. Thus X is dense in S(A),
which implies that (A,X) is a ZA.
∎
Fact 3.5**.**
Let (A,X) be a z-algebra. Then the subspace topology on X induced by
S(A) coincides with the topology on X generated by the base
sAX(A) and sAX(A)⊆\mboxCO(X).
Proof.
Set K=dfS(A). Then \mboxCO(K)=sA(A) and \mboxCO(K) is a base for
K. Regarding X as a subspace of K and using the fact that
sAX(A)=X∩sA(A), we obtain that sAX(A) is a base for
the subspace topology on X induced by K and sAX(A)⊆\mboxCO(X). Hence, the topology on X generated by the base
sAX(A) coincides with the subspace topology on X induced by
K.
∎
When (A,X) is a z-algebra, having in mind Fact 3.5, we will denote by sˉAX the map sAX regarded as a map from A to CO(X).
Definition 3.6**.**
A z-algebra (A,X) is called a Boolean dz-algebra
(briefly, dz-algebra; abbreviated as DZA) if sAX(A)=\mboxCO(X).
Now, using Fact 3.4, we obtain immediately the following result:
Fact 3.7**.**
A z-algebra (A,X) is a DZA if and only if the map sˉAX:A⟶CO(X) is a Boolean isomorphism
(regarding X as a subspace of S(A)).
Example 3.8**.**
Let A be a Boolean algebra. Then
(A,Boole(A,\mbox2)) is a dz-algebra. (The dz-algebras of this type will be called
compact Boolean dz-algebras (or, simply, compact dz-algebras)
Indeed, setting XA=dfBoole(A,\mbox2), we have that (A,XA) is a z-algebra, sˉAXA=sA and thus
sˉAXA(A)=\mboxCO(XA).
Hence, (A,XA) is a DZA.
Example 3.9**.**
Let X be a zero-dimensional Hausdorff space and A∈BA(X) (see Definition 2.4). Then the pair (A,X^A) is a z-algebra, the pair (CO(X),X^) is a dz-algebra and the map h^X,A:X⟶X^A is a homeomorphism (see 2.1 for the notation).
Indeed, the pair (A,X^A) is a z-algebra since for every U∈A+ there exists x∈U and thus x^(U)=1. Also, we have to show that h^X,A is a homeomorphism. The family AT0-separates the points of X because A is a base of the Hausdorff space X. Hence, by 2.1, h^X,A is a bijection. The family X^A∩CO(S(A))=X^A∩sA(A)=sAX^A(A) is a base of X^A and, for every U∈A, sAX^A(U)={x^∈X^A∣x^(U)=1}={x^∈X^A∣x∈U}=h^X,A(U); thus, h^X,A−1(sAX^A(U))=U. This shows that h^X,A is a continuous and open bijection and, therefore, it is a homeomorphism. Finally, if A=CO(X), then, since h^X=h^X,A is a homeomorphism, h^X(CO(X))=CO(X^). Thus, sAX^(CO(X))=\mboxCO(X^), i.e., (CO(X),X^) is a DZA.
Example 3.10**.**
The pair (B,XˇB), where B∈∣Caba∣, is a dz-algebra (see 2.1 for the notation XˇB).
(The dz-algebras of this type will be called
Boolean T-algebras (or, simply, T-algebras)).
Indeed, for every b∈B+, there exists x∈At(B) such that x≤b. Then xˇ(b)=1. Thus, (B,XˇB) is a z-algebra.
For every x∈At(B), we have that sBXˇB(x)={xˇ}. Hence, XˇB is a discrete subspace of S(B). Therefore, \mboxCO(XˇB)=P(XˇB). By 2.1, the function hˇB:At(B)⟶XˇB, x↦xˇ, is a bijection. Also, if M⊆At(B) and bM=⋁M, then M={x∈At(B)∣x≤bM}. Finally, for every b∈B, sBXˇB(b)={xˇ∈XˇB∣xˇ(b)=1}={xˇ∈XˇB∣x≤b}. Thus, sBXˇB(B)=P(XˇB). This shows that (B,XˇB) is a dz-algebra.
We will present an equivalent definition of the notion of dz-algebra as well.
Definition 3.11**.**
Let C∈∣Caba∣ and A,B be Boolean subalgebras of C. If
for every a∈A and any x∈At(C) such that x≤a there
exists b∈B with
x≤b≤a, then we will say that A* is
t-coarser than B in C* or that B* is t-finer than A*
in C; in this case we will write A⪯CB. We will say
that the Boolean algebras A and B are t-equal in C if
A⪯CB and B⪯CA.
The following assertion is obvious:
Fact 3.12**.**
Let X be a set and A,B be Boolean subalgebras of the Boolean
algebra P(X). Let OA (resp., OB) be the
topology on X generated by the base A (resp., B). Then A
and B are t-equal in P(X) if and only if the topologies OA
and OB coincide.
Fact 3.13**.**
A z-algebra (A,X) is a DZA if and only if it satisfies
the following condition:
(Dw) If B is a Boolean subalgebra of P(X)
and B is t-equal to sAX(A) in P(X), then B⊆sAX(A).
Proof.
Suppose that the ZA (A,X) satisfies condition (Dw). By Fact
3.5, we have that sAX(A) is a base for X and
sAX(A)⊆\mboxCO(X).
Then the Fact 3.12 shows that the Boolean algebras
sAX(A) and CO(X) are t-equal in P(X). Thus, by
condition (Dw), we obtain that \mboxCO(X)⊆sAX(A). Therefore,
sAX(A)=\mboxCO(X), i.e., (A,X) is a DZA.
Conversely, suppose that (A,X) is a DZA. If B is a Boolean
subalgebra of P(X) and B is t-equal to sAX(A) in
P(X), then B⊆CO(X). Therefore, B⊆sAX(A).
This shows that (A,X) satisfies condition (Dw).
∎
Now, we are ready to formulate and prove our first duality theorem for the category ZHaus.
The proof of the next assertion is obvious.
Proposition 3.14**.**
There is a category dzBoole (resp., zBoole) whose objects are all dz-algebras (resp., z-algebras) and
whose morphisms between any two dzBoole-objects (resp., zBoole-objects) (A,X) and
(A′,X′) are all pairs (φ,f) such that
φ∈Boole(A,A′), f∈Set(X′,X) and x′∘φ=f(x′)
for every x′∈X′. The composition (φ′,f′)∘(φ,f) between two dzBoole-morphisms (resp., zBoole-morphisms)
(φ,f):(A,X)⟶(A′,X′) and
(φ′,f′):(A′,X′)⟶(A′′,X′′) is defined to be the dzBoole-morphism (resp., zBoole-morphism)
(φ′∘φ,f∘f′):(A,X)⟶(A′′,X′′); the identity
morphism of a dzBoole′-object (resp., zBoole-object) (A,X) is defined to be (idA,idX).
Theorem 3.15**.**
The categories ZHaus and dzBoole are dually equivalent.
Proof.
We will first define a contravariant functor
[TABLE]
For every X∈∣ZHaus∣, let
[TABLE]
Then Example 3.9 shows that
F(X)∈∣dzBoole∣. Further, for f∈ZHaus(X,Y), set
[TABLE]
where
[TABLE]
is defined by
[TABLE]
for every x∈X. We will show that
F(f)∈dzBoole(F(Y),F(X)).
We need only to prove that x^∘CO(f)=f(x) for every x∈X. So, let
x∈X. Then, for every U∈\mboxCO(Y), we have that
(x^∘CO(f))(U)=1⇔x^(f−1(U))=1⇔x∈f−1(U)⇔f(x)∈U⇔f(x)(U)=1. Therefore,
x^∘CO(f)=f^(x^), for every x∈X. Thus, F(f)∈dzBoole(F(Y),F(X)).
It is easy to see that F is a contravariant functor.
Now we will define a contravariant functor
[TABLE]
and
will prove that the functors F∘G and G∘F are
naturally isomorphic to the corresponding identity functors.
For every (A,X)∈∣dzBoole∣, we set
[TABLE]
where X is regarded as a subspace of
S(A). Then, clearly, G(A,X)∈∣ZHaus∣. If
(φ,f):(A,X)⟶(A′,X′)
is a dzBoole-morphism, we put
[TABLE]
Let us show that
G(φ,f) is a continuous function. We have that X′⊆S(A′)=Boole(A′,\mbox2) and X⊆S(A)=Boole(A,\mbox2).
For every x′∈X′,
S(φ)(x′)=x′∘φ=f(x′). Thus, f is a restriction of the continuous function
S(φ). Hence, f:X′⟶X is a continuous function.
Therefore, G is well-defined. Now it is easy to see that G is
a contravariant functor.
We will show that the functors F∘G and IddzBoole are naturally isomorphic.
Let (A,X)∈∣dzBoole∣. Then F(G(A,X))=F(X)=(CO(X),X^), where X is regarded as a subspace of S(A). By Fact 3.7, the map
sˉAX:A⟶CO(X) is a Boolean isomorphism.
We put ˘X=dfh^X−1 (recall that, by 2.1, h^X is a bijection). Hence,
[TABLE]
for every x∈X.
Also, for every x∈X, x^∘sˉAX=˘X(x^). Indeed, for every a∈A, x^(sˉAX(a))=1⇔x∈sA(a)⇔x(a)=1, and thus x^∘sˉAX=x=˘X(x^). This shows that the map (sˉAX,˘X):(A,X)⟶(CO(X),X^) is a dzBoole-morphism and, moreover, it is a dzBoole-isomorphism. We put s(A,X)′=df(sˉAX,˘X). Then
[TABLE]
is a dzBoole-isomorphism. Let (φ,f):(A,X)⟶(A′,X′) be a dzBoole-morphism. We will show that the diagram
Also, for every x′∈X′, ˘X(f^(x′))=˘X(f(x′))=f(x′)=f(˘X′(x′)).
Hence,
[TABLE]
is a natural isomorphism.
Finally, we will show that the functors G∘F and IdZHaus are naturally isomorphic.
Let X∈∣ZHaus∣. Then G(F(X))=G(CO(X),X^)=X^,
where X^ is regarded as a subspace of S(CO(X)).
By Example 3.9, h^X is a homeomorphism.
Let f:X⟶Y be a ZHaus-morphism. Then G(F(f))=f^, and we have to show that the diagram
is commutative. For every x∈X, we have h^Y(f(x))=f(x)=f^(x^)=f^(h^X(x)).
Therefore,
[TABLE]
is a natural isomorphism. All this shows that the categories ZHaus and dzBoole are dually equivalent.
∎
4 The second duality theorem for the category ZHaus
Now we will define a new category mzMaps and will show, using the
Tarski duality, that it is equivalent to the category dzBoole.
This will imply immediately that the category mzMaps is dually
equivalent to the category ZHaus. The category mzMaps is similar
to the category MDeVe, constructed in [4] as a category
dually equivalent to the category Tych of Tychonoff spaces and
continuous maps.
Definition 4.1**.**
Let A be a Boolean algebra and B∈∣Caba∣. A Boolean
monomorphism α:A⟶B is said to be a Boolean z-map
(briefly, z-map) if every atom of B is a meet of some
elements of α(A). A z-map α:A⟶B is called a maximal
Boolean z-map (briefly, mz-map) if \mboxCO(Xα)=sAXα(A), where Xα is regarded as a subspace of S(A)
(see 2.1 and 3.3 for the notation).
Example 4.2**.**
Let X∈∣ZHaus∣, A∈BA(X) (see Definition 2.4 for this notation) and iA:A↪P(X) be the inclusion monomorphism. Then iA is a z-map.
Indeed, since A is a base for the Hausdorff space X, we have that for every x∈X, {x}=⋂{U∈A∣x∈U}. Hence, iA is a z-map.
Example 4.3**.**
The map idB:B⟶B, b↦b, where B∈∣Caba∣, is a mz-map.
(The mz-maps of this type will be called
Boolean T-maps (or, simply, T-maps)).
Indeed, it is obvious that idB is a z-map. Setting α=dfidB, we obtain, as in 2.1, that Xα=XˇB. In Example 3.10, we proved that XˇB is a discrete subspace of S(B) (and, thus, \mboxCO(XˇB)=P(XˇB)) and sBXˇB(B)=P(XˇB). This shows that idB is a mz-map.
Example 4.4**.**
The map sAXA:A⟶P(XA), where A∈∣Boole∣ and XA=Boole(A,\mbox2), is a mz-map.
(The mz-maps of this type will be called
compact mz-maps.)
Indeed, since sAXA↾A=sA:A⟶CO(XA), XA=S(A) is a Hausdorff space and CO(XA) is a base for XA, we obtain that sAXA is a z-map. Set α=dfsAXA. Then Xα={αx:A⟶\mbox2∣x∈XA} and, for every x∈XA and every a∈A, αx(a)=1⇔x∈α(a)⇔x(a)=1. Thus, αx≡x. Hence, Xα=XA. Then sAXα(A)=sAXA(A)=sA(A)=CO(XA)=CO(Xα). Therefore, sAXA is a mz-map.
We will present an equivalent definition of the notion of mz-map as well.
Its straightforward proof is left to the reader.
Proposition 4.5**.**
Let A be a Boolean algebra and B∈∣Caba∣. A z-map α:A⟶B is an mz-map if and only if for every Boolean
subalgebra C of B which is t-equal to α(A) in B, we
have that C⊆α(A).
The proof of the next assertion is obvious.
Proposition 4.6**.**
There is a category mzMaps (resp., zMaps) whose objects are all mz-maps (resp., z-maps) and
whose morphisms between any two mzMaps-objects (resp., zMaps-objects) α:A⟶B and
α′:A′⟶B′ are all pairs (φ,σ) such that
φ∈Boole(A,A′), σ∈Caba(B,B′) and
α′∘φ=σ∘α. The composition (φ′,σ′)∘(φ,σ) between two mzMaps-morphisms
(resp., zMaps-morphisms)
(φ,σ):α⟶α′ and
(φ′,σ′):α′⟶α′′ is defined to be the mzMaps-morphism (resp., zMaps-morphism)
(φ′∘φ,σ′∘σ):α⟶α′′; the identity map of
an mzMaps-object (resp., zMaps-object) α:A⟶B is defined to be (idA,idB).
Theorem 4.7**.**
The categories mzMaps and dzBoole are equivalent.
Proof.
We start by defining a functor F′:dzBoole⟶mzMaps.
For every (A,X)∈∣dzBoole∣, set
[TABLE]
(see Notation
3.3 for sAX). For showing that F′(A,X)∈∣mzMaps∣,
notice first that P(X)∈∣Caba∣ and,
by Fact 3.4,
sAX is a Boolean monomorphism.
Furthermore, by Fact 3.5, the topology on X generated
by the base sAX(A) is a T2-topology. Thus, for every x∈X, we have that {x}=⋂{sAX(a)∣x(a)=1}. Hence,
F′(A,X) is a z-map. Set α=dfsAX and B=dfP(X). Then α:A⟶B and At(B)=X. Since (A,X)∈∣dzBoole∣, we have that α(A)=\mboxCO(X).
Using the notation from 2.1, we obtain that for every x∈X=At(B) and every a∈A, αx(a)=1⇔x≤α(a)⇔x∈sA(a)⇔x(a)=1. Thus, x=αx for every x∈X. Hence X≡Xα and, therefore, sAXα(A)=sAX(A)=\mboxCO(X)=\mboxCO(Xα).
This shows that F′(A,X)∈∣mzMaps∣.
For every (φ,f)∈dzBoole((A,X),(A′,X′)), set
[TABLE]
We have that x′∘φ=f(x′) for every x′∈X′.
Having this in mind, we obtain that for every a∈A, (P(f)∘sAX)(a)=f−1({x∈X∣x(a)=1})={x′∈X′∣f(x′)(a)=1}={x′∈X′∣(x′∘φ)(a)=1}=(sA′X′∘φ)(a).
Hence, P(f)∘sAX=sA′X′∘φ. Since
P(f)∈Caba(P(X),P(X′)), we obtain that
F′(φ,f)∈mzMaps(F′(A,X),F′(A′,X′)).
Now it is easy to see
that F′ is a functor.
Further, we will define a functor G′:mzMaps⟶dzBoole.
For every (α:A⟶B)∈∣mzMaps∣, we set, in the notation from 2.1,
[TABLE]
where Xα is regarded as a subspace of S(A).
Hence Xα={αx:A⟶\mbox2∣x∈At(B)} and Xα={αx:CO(Xα)⟶\mbox2∣αx∈Xα}.
Obviously, Xα∈∣ZHaus∣. It is now clear that G′(α)=F(Xα) (where F is the contravariant functor defined in the proof of Theorem 3.15) and, therefore, by Theorem 3.15, G′(α)∈∣dzBoole∣.
Let (φ,σ)∈mzMaps(α,α′), where α:A⟶B and α′:A′⟶B′. We set
[TABLE]
where fσ:Xα′⟶Xα is defined by αx′′↦αAt(σ)(x′) and fσ:Xα′⟶Xα is defined by αx′′↦fσ(αx′′).
Clearly, G′(φ,σ)=F(fσ), so that we need only to show that fσ is a continuous map between the sets Xα′ and Xα supplied with the subspace topology from the spaces S(A′) and S(A), respectively. Let a∈A. Then, using Lemma 2.9, we obtain that
[TABLE]
This implies the continuity of fσ. Now, using Theorem 3.15, we conclude that G′(φ,σ)∈dzBoole(G′(α),G′(α′)). Having all this in mind, it is easy to see
that G′ is a functor.
We will now prove that F′∘G′≅IdmzMaps.
Let (α:A⟶B)∈∣mzMaps∣. Then (F′∘G′)(α)=F′(CO(Xα),Xα)=sCO(Xα)Xα and sCO(Xα)Xα:CO(Xα)⟶P(Xα), where Xα is regarded as a subspace of S(A).
By 2.1,
the map hα:At(B)⟶Xα, x↦αx, is a bijection.
Then, clearly, the map hαP:P(At(B))⟶P(Xα), M↦{hα(x)∣x∈M}, is a Boolean isomorphism. Again
by 2.1, the map h^Xα:Xα⟶Xα, αx↦αx, for all x∈At(B), is a bijection.
Then the map h^XαP:P(Xα)⟶P(Xα), M↦{h^Xα(αx)∣αx∈M}, is a Boolean isomorphism. Put εB=dfh^XαP∘hαP∘εB (see 2.8 for the notation εB). Then
[TABLE]
is a Boolean isomorphism. Since α is an mz-map, we have that sAXα(A)=\mboxCO(Xα). Thus the map
[TABLE]
is a Boolean isomorphism. Put
[TABLE]
We will show that εα′∈mzMaps(α,(F′∘G′)(α)). We need only to prove that the diagram
is commutative. Let a∈A. Then sCO(Xα)Xα(sAXα(a))=sCO(Xα)Xα({αy∈Xα∣αy(a)=1})={αx∈Xα∣αx({αy∈Xα∣y≤α(a)})=1}={αx∈Xα∣αx∈{αy∈Xα∣y≤α(a)}}={αx∈Xα∣x≤α(a)}=εB(α(a)).
Obviously, this implies that εα′ is an mzMaps-isomorphism.
Let α:A⟶B and α′:A′⟶B′ be mzMaps-objects and (φ,σ):α⟶α′ be an mzMaps-morphism. We will prove that the diagram
So, sˉA′Xα′∘φ=CO(fσ)∘sˉAXα.
Let now b∈B. Then, using again Lemma 2.9, we obtain that
[TABLE]
Hence, εB′∘σ=P(fσ)∘εB.
This shows that
εα′′∘(φ,σ)=F′(G′(φ,σ))∘εα′. Therefore,
[TABLE]
is a natural isomorphism.
Finally, we will prove that G′∘F′≅IddzBoole.
Let (A,X)∈∣dzBoole∣. Then G′(F′(A,X))=G′(sAX)=(CO(X),X^), where X is regarded as asubspace of S(A). Indeed, putting α=dfsAX, we obtain, as in the beginning of this proof, that αx≡x for every x∈X, and, hence,
[TABLE]
Thus, x^:CO(X)⟶\mbox2 is defined by x^(U)=1⇔x∈U, for U∈\mboxCO(X), and X^={x^∣x∈X}. Obviously, we have that G′(F′(A,X))=F(G(A,X)), where F and G are the contravariant functors defined in the proof of Theorem 3.15. Hence, we can use the dzBoole-isomorphism
[TABLE]
defined there by s(A,X)′=df(sˉAX,˘X), where
˘X:X^⟶X, x^↦x.
Let (φ,f)∈dzBoole((A,X),(A′,X′)). Then G′(F′(φ,f))=G′(φ,P(f))=(CO(fσ),fσ), where σ=dfP(f), fσ:Xα′⟶Xα, α=F′(A,X)=sAX and α′=F′(A′,X′)=sA′X′. Since Xα′≡X′ and Xα≡X (see the beginning of this proof), we obtain that fσ(x′)=At(σ)(x′)=At(P(f))(x′)=f(x′), i.e., fσ≡f. Thus G′(F′(φ,f))=(CO(f),f^)=F(G(φ,f)). Thus the proof of the commutativity of the diagram
proceeds as in the proof of Theorem 3.15. Therefore,
[TABLE]
is a natural isomorphism.
All this shows that the categories mzMaps and dzBoole are equivalent.
∎
Obviously, Theorems 3.15 and 4.7 imply the
following theorem:
Theorem 4.8**.**
The categories ZHaus and mzMaps are dually equivalent.
Proof.
We put F0=dfF′∘F and G0=dfG∘G′. Then
[TABLE]
Clearly, they are dual equivalences.
In the rest of this proof, we will find the explicit descriptions of these contravariant functors, as well as the descriptions of the natural isomorphisms η~0:IdZHaus⟶G0∘F0 and ε~0:IdmzMaps⟶F0∘G0. Moreover, we will define two new contravariant functors
[TABLE]
which are simpler than F0 and G0 but are again dual equivalences.
For every X∈∣ZHaus∣, we have that
[TABLE]
For every f∈ZHaus(X,Y),
[TABLE]
(see the beginning of the proof of Theorem 3.15 for the notation f^).
For every (α:A⟶B)∈∣mzMaps∣,
[TABLE]
where Xα is regarded as a subspace of S(A).
For (φ,σ)∈mzMaps(α,α′),
[TABLE]
(see the definition of G′ in the proof of Theorem 4.7 for the notation fσ and fσ).
Now, for every X∈∣ZHaus∣, we have that
[TABLE]
Hence Xα={αx^:CO(X)⟶\mbox2∣x^∈X^} and, for every U∈\mboxCO(X) and every x∈X, αx^(U)=1⇔x^∈α(U)⇔x^(U)=1. Thus, αx^=x^ for every x∈X. Hence, Xα=X^ and (G0∘F0)(X)=Xα=X^^.
According to the general theorem about compositions of adjoint functors (see, e.g., [15, Theorem IV.8.1]), we have that for every X∈∣ZHaus∣, η~X0:X⟶(G0∘F0)(X) is defined by the formula η~X0=(G(sF(X)′))−1∘h^X
(see Theorem 3.15 for h^ and s′). Since F(X)=(CO(X),X^) and sF(X)′=(sˉCO(X)X^,˘X^), where ˘X^:X^^⟶X^, x^^↦x^, we obtain that G(sF(X)′)=˘X^. Thus,
[TABLE]
for every x∈X.
Finally, note that \mboxCO(X^)=α(\mboxCO(X)) (because α=sCO(X)X^ is an mz-map) and thus x^^:CO(X^)⟶\mbox2 is defined by x^^(α(U))=1⇔x^∈sCO(X)X^(U)⇔x^(U)=1⇔x∈U, for every x∈X and every U∈\mboxCO(X).
We will now describe the natural isomorphism ε~0:IdmzMaps⟶F0∘G0. For (α:A⟶B)∈∣mzMaps∣, we have that
[TABLE]
and sCO(Xα)Xα:CO(Xα)⟶P(Xα),
where
Xα={αx:CO(Xα)⟶\mbox2∣αx∈Xα} and, for U∈\mboxCO(Xα), αx(U)=1⇔αx∈U.
Thus ε~α0:α⟶sCO(Xα)Xα. The cited above theorem about compositions of adjoint functors gives us that ε~α0=F′(sG′(α)′)∘εα′.
We have that G′(α)=(CO(Xα),Xα) and thus sG′(α)′=(sˉCO(Xα)Xα,˘Xα),
where
[TABLE]
Then
F′(sG′(α)′)=(sˉCO(Xα)Xα,P(˘Xα)). Hence,
[TABLE]
where
εB:B⟶P(Xα), b↦{αx∣x∈At(B),x≤b}.
Now we will define the contravariant functors F:ZHaus⟶mzMaps and G:mzMaps⟶ZHaus.
For every X∈∣ZHaus∣, we put
[TABLE]
where iX:CO(X)⟶P(X) is the inclusion map. Set α=dfiX. Obviously, α is a z-map. Further, for every x∈X=At(P(X)), αx:CO(X)⟶\mbox2 and αx(U)=1⇔x∈α(U), for every U∈CO(X). Since α(U)=U, we obtain that αx=x^ and thus Xα=X^. For every U∈CO(X), we have that sCO(X)X^(U)={x^∣x∈X,x^(U)=1}={x^∣x∈U}=U^=h^X(U).
Thus sCO(X)X^(CO(X))=h^X(CO(X))=CO(X^) because h^X:X⟶X^ is a homeomorphism (as it is shown in Example 3.9).
Hence, iX is an mz-map.
For f∈ZHaus(X,Y), we set
[TABLE]
Obviously, F(f) is a mzMaps-morphism.
For (α:A⟶B)∈∣mzMaps∣, we put
[TABLE]
Clearly, the set Xα endowed with the subspace topology from the space S(A) is a ZHaus-object.
For (φ,σ)∈mzMaps(α,α′), we set
[TABLE]
The fact that fσ is a continuous map was proved in Theorem 4.7 after the definition of G′ on the morphisms.
We define a natural isomorphism τ:F0⟶F by
[TABLE]
for every X∈∣ZHaus∣, where ˘X:X^⟶X, x^↦x, and ˘XP:P(X^)⟶P(X), M^↦{˘X(m^)∣m^∈M^}, (i.e., ˘XP(M^)=M, for every M⊆X). Indeed, it is obvious that for every X∈∣ZHaus∣, τX:F0(X)⟶F(X) is a mzMaps-isomorphism and that, for every f∈ZHaus(X,X′), the diagram
for every α∈∣mzMaps∣. Indeed, for every X∈∣ZHaus∣, the map ˘X:X^⟶X is a homeomorphism since ˘X=h^X−1 and the map h^X:X⟶X^ is a homeomorphism;
hence, τα′:G0(α)⟶G(α) is a ZHaus-isomorphism. Also, it is clear that, for every (φ,σ)∈mzMaps(α,α′),
the diagram
Hence, we obtain that τ′∗τ:G0∘F0⟶G∘F, where (τ′∗τ)X=τF(X)′∘G0(τX−1) for every X∈∣ZHaus∣, is a natural isomorphism (see, e.g., [2, Exercise 6A]) and thus
[TABLE]
is a natural isomorphism. Analogously, τ∗τ′:F0∘G0⟶F∘G, where (τ∗τ′)α=τG(α)∘F0((τα′)−1) for every α∈∣mzMaps∣, is a natural isomorphism and thus
[TABLE]
is a natural isomorphism.
Therefore, F and G are dual equivalences. It is now easy to obtain that, for every X∈∣ZHaus∣ and every x∈X,
[TABLE]
and, for every (α:A⟶B)∈∣mzMaps∣,
[TABLE]
where εBα:B⟶P(Xα), b↦{αx∣x∈At(B),x≤b}, for every b∈B.
∎
5 The restrictions of F and F to the category Stone imply the Stone Duality
In this section we will derive the Stone Duality Theorem from Theorems 3.15 and 4.8. Of course, this is almost a formal act because in the proofs of these theorems we have already utilized many facts which are parts of the proof of the Stone Duality Theorem. But doing this, we will show that our duality functors can be regarded as extensions of the Stone duality functors.
Let us denote by kBoole the full subcategory
of the category dzBoole having as objects all compact dz-algebras (see Example 3.8 for this notion).
Proposition 5.1**.**
The categories Boole and kBoole are isomorphic.
Proof.
Define a functor E:Boole⟶kBoole by setting E(A)=df(A,XA),
for every A∈∣Boole∣ (see Example 3.8 (or
2.2) for the notation), and E(φ)=df(φ,S(φ)), for
every Boole-morphism φ. Then, by Example 3.8,
E(A)∈∣kBoole∣ for every A∈∣Boole∣. If φ∈Boole(A,A′),
then (S(φ))(x′)=x′∘φ for every x′∈XA′
(see 2.2). Hence E(φ)∈kBoole(E(A),E(A′)).
Define also a functor E−1:kBoole⟶Boole by setting
E−1(A,XA)=dfA, for every (A,XA)∈∣kBoole∣, and
E−1(φ,f)=dfφ, for every kBoole-morphism (φ,f).
It is easy to see that E∘E−1=IdkBoole and E−1∘E=IdBoole. (Indeed, it is enough to notice that if (φ,f) is
a kBoole-morphism then, by the definition of S(φ) (see
2.2), we have that f=S(φ).) Thus E and E−1 are
isomorphisms.
∎
Proposition 5.2**.**
Let Es:Stone↪ZHaus and Ea:kBoole↪dzBoole be the inclusion
functors.
Then
[TABLE]
Thus the restrictions Fs:Stone⟶kBoole and Gs:kBoole⟶Stone of F and G, respectively, are dual equivalences.
Also, T=E−1∘Fs and S=Gs∘E. Thus, T and S are dual equivalences.
Finally, F∘Es=Ea∘E∘T and Es∘S=G∘Ea∘E.
Therefore, the dual equivalences F and G are extensions of
the dual equivalences T and S, respectively.
(See Theorem 3.15, Proposition 5.1 and 2.2 for the notation.)
Proof.
Let X∈∣Stone∣. Then F(Es(X))=F(X)=(CO(X),X^). Since X is compact, we have, as it is well-known, that X^=Boole(CO(X),\mbox2). (Indeed, for every φ∈Boole(CO(X),\mbox2), ⋂{U∈CO(X)∣φ(U)=1} is a singleton.) Thus F(Es(X))∈∣kBoole∣. Further, for every (A,XA)∈∣kBoole∣, G(Ea(A,XA))=G(A,XA)=XA=S(A) and, as it is proved by M. Stone [16], G(Ea(A,XA))∈∣Stone∣. Thus, Theorem 3.15 implies that Fs and Gs are dual equivalences. The equalities T=E−1∘Fs and S=Gs∘E are obvious and hence, S∘T=Gs∘E∘E−1∘Fs=Gs∘Fs≅IdStone; analogously, T∘S≅IdBoole. Therefore, T and S are dual equivalences.
Finally, we have that Ea∘E∘T=Ea∘E∘E−1∘Fs=Ea∘Fs=F∘Es and Es∘S=Es∘Gs∘E=G∘Ea∘E.
∎
We are now going to derive the Stone Duality Theorem from Theorem 4.8.
Let kMaps be the full subcategory of the category mzMaps having as objects all compact mz-maps (see Example 4.4 for this notion).
Proposition 5.3**.**
The categories Boole and kMaps are isomorphic.
Proof.
Let us define a functor K:Boole⟶kMaps by setting K(A)=dfsAXA for every A∈∣Boole∣ (here XA=Boole(A,\mbox2)), and K(φ)=df(φ,P(S(φ))), for every φ∈Boole(A,A′). Then Example 4.4 shows that K is well-defined on the objects. For proving that K(φ) is a kMaps-morphism, we have to verify the equality sA′XA′∘φ=P(S(φ))∘sAXA. Let a∈A. Then (P(S(φ))∘sAXA)(a)=(S(φ))−1(sAXA(a))={x′∈XA′∣(S(φ))(x′)∈sAXA(a)}={x′∈XA′∣x′(φ(a))=1}=(sA′XA′∘φ)(a). Hence, K is well-defined on morphisms as well. Obviously, K is a functor. (Note that the use of the contravariant functors S and T can be easily avoided; we used them just for a simplification of the notation.)
Let us now define a functor K−1:kMaps⟶Boole by setting K−1(sAXA)=dfA for every A∈∣Boole∣, and K−1(φ,σ)=dfφ for every kMaps-morphism (φ,σ). Then, obviously, K−1 is a well-defined functor. It is clear that K−1∘K=IdBoole and (K∘K−1)(sAXA)=sAXA for every A∈∣Boole∣. For every kMaps-morphism (φ,σ), we have (K∘K−1)(φ,σ)=K(φ)=(φ,P(S(φ)). Since sAXA↾A=sA:A⟶CO(XA) is a Boolean isomorphism, the above calculation shows that σ∣CO(XA)≡P(S(φ))∣CO(XA). Since every atom of P(XA) (i.e., every element of XA) is a meet in P(XA) of some elements of CO(XA) and σ is a complete homomorphisms, we see that σ is uniquely determined by its restriction on CO(XA). Therefore, σ≡P(S(φ)). Thus, K∘K−1=IdkMaps. Hence, the categories Boole and kMaps are isomorphic.
∎
Now, using arguments similar to those used in the proof of Proposition 5.2, we obtain the following assertion:
Proposition 5.4**.**
Let Em:kMaps↪mzMaps be the inclusion
functor.
Then
[TABLE]
Thus the restrictions Fs:Stone⟶kMaps and Gs:kMaps⟶Stone of F and G, respectively, are dual equivalences.
Also, T=K−1∘Fs and S=Gs∘K. Thus, T and S are dual equivalences.
Finally, F∘Es=Em∘K∘T and Es∘S=G∘Em∘K.
Therefore, the dual equivalences F and G are extensions of
the dual equivalences T and S, respectively.
(See Theorem 4.8, Propositions 5.3 and 5.2, and 2.2 for the notation.)
6 The restrictions of F and F to the category D imply the Tarski Duality
We are going to derive the Tarski Duality Theorem from Theorems 3.15 and 4.8. Unlike the previous section, this is not a formal act: it is true that in the proof of Theorem 4.8 we utilized some facts which are parts of the proof of the Tarski Duality Theorem, but the proof of Theorem 3.15 is completely independent of the Tarski Duality Theorem.
It is clear that the category D of discrete spaces and continuous maps is a full subcategory of the category ZHaus. Using the duality theorems proved in Sections 3 and 4, we will find two categories dually equivalent to the category D. Since, obviously, the categories D and Set are isomorphic, we will obtain in this way two
categories dually equivalent to the category Set. Both of them will lead to one and the same dual equivalence A:Caba⟶Set which will be slightly different from the Tarski dual equivalence At:Caba⟶Set (and, maybe, will be new). From it we will easily obtain the Tarski Duality Theorem.
Let us denote by TBoole the full subcategory of the category dzBoole having as objects all T-algebras (see Example 3.10 for this notion), and
let TMaps be the full subcategory of the category mzMaps having as objects all T-maps (see Example 4.3 for this notion).
Proposition 6.1**.**
The categories TBoole and TMaps are dually equivalent to the category D (and, thus, to the category Set).
Proof.
Using the notation from the proofs of Theorems 3.15 and 4.8, it is enough to show that F(∣D∣)⊆∣TBoole∣, G(∣TBoole∣)⊆∣D∣,
F(∣D∣)⊆∣TMaps∣ and G(∣TMaps∣)⊆∣D∣.
We have that for every X∈∣D∣, F(X)=(CO(X),X^)=(P(X),X^)=(B,XˇB), where B=dfP(X), and, obviously, (B,XˇB)∈∣TBoole∣. Also, F(X)=iX=idP(X)∈∣TMaps∣. Further, for every (B,XˇB)∈∣TBoole∣, G(B,XˇB)=XˇB, where XˇB is regarded as a subspace of S(B). Then, as it was shown in Example 3.10, XˇB∈∣D∣. Finally, for every idB∈∣TMaps∣, G(idB)=XidB=XˇB∈∣D∣. Now Theorems 3.15 and 4.8 show that the restrictions Fd:D⟶TBoole, Gd:TBoole⟶D,
Fd:D⟶TMaps, Gd:TMaps⟶D of the contravariant functors F, G, F and G, respectively, are all dual equivalences.
∎
Corollary 6.2**.**
For every TBoole-morphism (σ,f) between any two TBoole-objects (B,XˇB) and (B′,XˇB′), we have that σ∈Caba(B,B′).
Proof.
For every f∈D(X,Y), we have that Fd(f)=F(f)=(CO(f),f^)=(P(f),f^). Since P(f) is a Caba-morphism and Fd is full, faithful and isomorphism-dense, our assertion follows.
∎
We can prove this assertion directly, as well. Suppose that σ is not a complete homomorphism. Then there exists a set {bj∣j∈J}⊆B such that, with b=df⋁j∈Jbj, σ(b)≩⋁j∈Jσ(bj). Thus, there exists y∈At(B′) such that y≤σ(b) but y≰b′, where b′=df⋁j∈Jσ(bj). Then yˇ(b′)=0 and yˇ(σ(b))=1. Since yˇ is a complete homomorphism (see 2.1), we have that
0=yˇ(b′)=yˇ(⋁j∈Jσ(bj))=⋁j∈Jyˇ(σ(bj))=⋁j∈J(yˇ∘σ)(bj)). Hence, ⋁j∈J(yˇ∘σ)(bj))=(yˇ∘σ)(⋁j∈Jbj). Since yˇ∘σ is a complete homomorphism (because yˇ∘σ=f(yˇ)∈XˇB), we obtain a contradiction. Therefore, σ∈Caba(B,B′).
6.3**.**
Using the above Corollary, we can define a functor
[TABLE]
setting H(B,XˇB)=dfB and H(σ,f)=dfσ. Let us also define a functor
[TABLE]
by H−1(B)=df(B,XˇB) and, for any σ∈Caba(B,B′), H−1(σ)=df(σ,fσ), where the function
[TABLE]
is defined by
[TABLE]
for every yˇ∈XˇB′. We need to show that fσ(yˇ) belongs to XˇB. Indeed, setting x=df⋀{a∈B∣y≤σ(a)}, we have that x∈At(B) and, using Lemma 2.9, we obtain that for every b∈B, xˇ(b)=1⇔x≤b⇔⋀{a∈B∣y≤σ(a)}≤b⇔y≤σ(b)⇔yˇ(σ(b))=1. Thus fσ(yˇ)=yˇ∘σ=xˇ∈XˇB. Hence, the functor H−1 is well defined. One sees immediately that the compositions of the functors H and H−1 are equal to the corresponding identity functors. Therefore, H and H−1 are isomorphisms. Denoting by I:D⟶Set the obvious forgetful functor, we obtain that I is an isomorphism and H∘Fd∘I−1=P. Now we set
[TABLE]
Using Proposition 6.1, we obtain that P∘A=(H∘Fd∘I−1)∘(I∘Gd∘H−1)=H∘(Fd∘Gd)∘H−1≅H∘IdTBoole∘H−1=IdCaba and, similarly, A∘P≅IdSet. Thus, the contravariant functors
[TABLE]
are dual equivalences. Note that for every B∈∣Caba∣,
[TABLE]
where XˇB={xˇ:B⟶\mbox2∣x∈At(B)}, xˇ(b)=1⇔x≤b, and, for every σ∈Caba(B,B′),
[TABLE]
(see the definition of fσ here above).
It is easy to see that hˇ:At⟶A, where for every B∈∣Caba∣, hˇB is the bijection defined in 2.1, is a natural isomorphism. Thus, P∘At≅P∘A≅IdCaba and, similarly, At∘P≅IdSet. Therefore, At:Caba⟶Set and P:Set⟶Caba are dual equivalences, obtaining in such a way a new proof of the Tarski Duality Theorem.
Finally, defining a functor H1:TMaps⟶Caba by H1(idB)=dfB and H1(σ,σ)=dfσ, and a functor H1−1:Caba⟶TMaps by H−1(B)=dfidB and H1−1(σ)=df(σ,σ) (note that Example 3.10 shows that H1−1 is well defined), we obtain that the compositions of the functors H1 and H1−1 are equal to the corresponding identity functors. Therefore, H1 and H1−1 are isomorphisms. Obviously, we get that H1∘Fd∘I−1=P and A=I∘Gd∘H1−1. Hence, working with the contravariant functors Fd and Gd, we come to the same dual equivalences P:Set⟶Caba and A:Caba⟶Set.
7 Two duality theorems for the category EDTych of extremally disconnected spaces
Now, using our duality theorems 3.15 and 4.8, we will obtain duality theorems for the category EDTych of extremally disconnected Tychonoff spaces and continuous maps.
Definition 7.1**.**
A dz-algebra (resp., z-algebra) (A,X) is said to be complete dz-algebra (resp., complete z-algebra) if A is a complete Boolean algebra.
Let us denote by dzCBoole the full subcategory of the category dzBoole having as objects all complete dz-algebras.
Let zCBoole be the full subcategory of the category zBoole having as objects of all complete z-algebras, and
let EDTych be the category of extremally disconnected Tychonoff spaces and continuous maps.
Theorem 7.2**.**
The categories EDTych and zCBoole are dually equivalent.
Proof.
Since EDTych is a subcategory of ZHaus, we can regard the restriction Fed of the contravariant functor F:ZHaus⟶dzBoole to EDTych. Analogously, we can regard the restriction Ged of the contravariant functor
G:dzBoole⟶ZHaus to dzCBoole. Recall that F and G were defined in the proof of Theorem 3.15. We will show that Fed(∣EDTych∣)⊆∣dzCBoole∣ and Ged(∣dzCBoole∣)⊆∣EDTych∣. Indeed, for every X∈∣EDTych∣, we have that \mboxCO(X)=\mboxRC(X) and thus Fed(X)=(CO(X),X^)=(\mboxRC(X),X^). Hence, F(X)∈∣dzCBoole∣. If (A,X)∈∣dzCBoole∣, then Ged(A,X)=X. Since, by Fact 3.2, X is a dense subspace of the extremally disconnected space S(A), we obtain that X is an extremally disconnected space (see, e.g., [11, Exercise 6.2.G.(c)]). Thus, Ged(A,X)∈∣EDTych∣.
Now, Theorem 3.15 implies that
[TABLE]
are dual equivalences.
Finally, we will show that the categories dzCBoole and zCBoole coincide. Indeed, if (A,X)∈∣zCBoole∣, then, using Lemma 2.11, we obtain that sAX(A)=X∩sA(A)=X∩CO(S(A))=X∩\mboxRC(S(A))=\mboxRC(X)=CO(X). Therefore, (A,X) is a dz-algebra. Thus, the categories EDTych and zCBoole are dually equivalent.
∎
Definition 7.3**.**
An mz-map (resp., z-map) α:A⟶B is said to be complete mz-map (resp., complete z-map) if A is a complete Boolean algebra.
Let us denote by cmzMaps the full subcategory of the category mzMaps having as objects all complete mz-maps,
and by czMaps the full subcategory of the category zMaps having as objects of all complete z-maps.
Theorem 7.4**.**
The categories EDTych and czMaps are dually equivalent.
Proof.
Let us denote by Fed the restriction of the contravariant functor F:ZHaus⟶mzMaps to EDTych, and by Ged the restriction of the contravariant functor
G:mzMaps⟶ZHaus to cmzMaps. Recall that F and G were defined in the proof of Theorem 4.8. We are going to show that Fed(∣EDTych∣)⊆∣cmzMaps∣ and Ged(∣cmzMaps∣)⊆∣EDTych∣. Indeed, for every X∈∣EDTych∣, we have that Fed(X)=iX, where iX:CO(X)↪P(X) is the inclusion map. Since \mboxCO(X)=\mboxRC(X), we obtain that Fed(X)∈∣cmzMaps∣. Let now (α:A⟶B)∈∣cmzMaps∣. Then Ged(α)=Xα.
We will show that Xα is a dense subspace of S(A). Indeed, if a∈A+ then α(a)=0 and, hence, there exists x∈At(B) such that x≤α(a); this, however, means that αx(a)=1, i.e., αx∈sA(a)∩Xα. So, Xα is a dense subspace of S(A).
Thus, Ged(α)∈∣EDTych∣. Now, Theorem 4.8 implies that
[TABLE]
are dual equivalences.
Finally, we will show that the categories cmzMaps and czMaps coincide. Indeed, let α:A⟶B be a complete z-map. Then A is a complete Boolean algebra and, hence, S(A) is extremally disconnected. As we have already seen, Xα is a dense subspace of S(A), and thus Xα is also extremally disconnected. Now, using Lemma 2.11, we obtain that sAXα(A)=Xα∩sA(A)=Xα∩CO(S(A))=Xα∩\mboxRC(S(A))=\mboxRC(Xα)=CO(Xα). Therefore, α is an mz-map.
This shows that cmzMaps≡czMaps. Hence, the categories EDTych and czMaps are dually equivalent.
∎
8 Two duality theorems for the category of zero-dimensional Hausdorff compactifications
[4]*
There is a category Comp whose objects are Hausdorff
compactifications c:X⟶Y and whose morphisms between any two
Comp -objects c:X⟶Y and c′:X′⟶Y′ are all
pairs (f,g), where f:X⟶X′ and g:Y⟶Y′ are
continuous maps such that g∘c=c′∘f. The composition
of two morphisms (f1,g1) and (f2,g2) is defined to be
(f2∘f1,g2∘g1). The identity map of a
Comp-object c:X⟶Y is defined to be idc=df(idX,idY).*
Definition 8.2**.**
We will denote by ZComp the full subcategory of the
category Comp whose objects are all Hausdorff compactifications
c:X⟶Y for which Y is a zero-dimensional space.
Remark 8.3**.**
Note that Example 3.2 from [4] shows that there exist
ZComp-objects c:X⟶Y and c′:X⟶Y′ which are
isomorphic in ZComp but not equivalent as compactifications. On
the other hand, as it is shown in [4], any two equivalent
compactifications of a space X are isomorphic in Comp.
Proposition 8.4**.**
Let c:X⟶Y be a ZComp-object. If c is isomorphic to the
Banaschewski compactification β0:X⟶β0X in ZComp, then
c is equivalent to β0.
Proof.
The proof is analogous to that of Theorem 3.3 from [4]. The
only difference is that the Banaschewski Theorem 2.7 has
to be used.
∎
Theorem 8.5**.**
The categories ZComp and zBoole are dually equivalent.
Proof.
We start by defining a contravariant functor
[TABLE]
For every (c:X⟶Y)∈∣ZComp∣, set Ac=dfc−1(CO(Y)),
X^c=dfX^Ac
(see 2.1 for the notation),
and
Let now c:X⟶Y and c′:X′⟶Y′ be ZComp-objects
and (f,g) be a ZComp-morphism between c and c′. Set
[TABLE]
where
πf:Ac′⟶Ac is defined by πf(U)=dff−1(U) for
every U∈Ac′, and
[TABLE]
is
defined by f^cc′(x^)=dff(x) for every x∈X.
Arguing as in the
proof of Theorem 3.15, we obtain that
Φ(f,g)∈zBoole(Φ(c′),Φ(c)). Now it is easy to see that
Φ is a contravariant functor.
We define Ψ:zBoole⟶ZComp as follows: for every (A,X)∈∣zBoole∣, set
[TABLE]
where, regarding X as a subspace of S(A), c(A,X):X↪S(A) is the embedding of X in S(A);
for every (φ,f)∈zBoole((A,X),(A′,X′)), we put
[TABLE]
By Fact 3.2, c(A,X) is a dense embedding and thus Ψ(A,X) is a ZComp-object. Since for every x′∈X′, S(φ)(x′)=x′∘φ=f(x′), we obtain that Ψ(φ,f) is a ZComp-morphism. Hence, Ψ is well-defined. Obviously, it is a contravariant functor.
Let (A,X)∈∣zBoole∣. Then Φ(Ψ(A,X))=(Ac(A,X),X^c(A,X)), Ac(A,X)=X∩sA(A)=sAX(A) and X^c(A,X)={x^:sAX(A)⟶\mbox2∣x∈X}. Working like in the proof of Theorem 3.15,
we define a map ˘Xc(A,X):X^c(A,X)⟶X by ˘Xc(A,X)(x^)=dfx, for every x∈X, and set s(A,X)′′=df(sˉAX,˘Xc(A,X)). Then, like in Theorem 3.15, we show that s(A,X)′′:(A,X)⟶(Φ∘Ψ)(A,X) is a zBoole-isomorphism and, moreover,
[TABLE]
is a natural isomorphism.
Let now (c:X⟶Y)∈∣ZComp∣. Then (Ψ∘Φ)(c)=c(Ac,X^c) and c(Ac,X^c):X^c↪S(Ac).
Obviously, the map ρc:Ac⟶CO(Y),c−1(U)↦U, is a Boolean isomorphism. Hence, the map S(ρc):S(T(Y))⟶S(Ac) is a homeomorphism. By Example 3.9, the map h^X,Ac:X⟶X^c is a homeomorphism.
Now it is easy to show that the map ϰc=df(h^X,Ac,S(ρc)∘tY):c⟶c(Ac,X^c) is a ZComp-isomorphism (see 2.2 for the notation tY). Finally, it is not difficult to prove that
[TABLE]
is a natural isomorphism.
Therefore, the categories ZComp and zBoole are dually equivalent.
∎
We will denote by EDComp the full subcategory of the category ZComp having as objects all compactifications c:X⟶Y, for which Y∈∣EDTych∣.
Corollary 8.6**.**
The categories EDComp and zCBoole are dually equivalent.
Proof.
Having in mind Theorem 8.5, it is enough to show that Φ(∣EDComp∣)⊆∣zCBoole∣ and Ψ(∣zCBoole∣)⊆∣EDComp∣.
Let (c:X⟶Y)∈∣EDComp∣. Then, using Lemma 2.11, we obtain (in the notation from the proof of Theorem 8.5) that Ac=c−1(CO(Y))=c−1(\mboxRC(Y))=\mboxRC(X). Thus, Φ(c)∈∣zCBoole∣. Let now (A,X)∈∣zCBoole∣. Then A is a complete Boolean algebra and, hence, S(A)∈∣EDTych∣. This shows that Ψ(A,X)∈∣EDComp∣. So, the proof is completed.
∎
Corollary 8.7**.**
The categories EDComp and EDTych are equivalent.
Proof.
This follows immediately from Theorem 7.2 and Corollary 8.6.
∎
Note that Corollary 8.7 can be also proved with the help of the fact that if (c:X⟶Y)∈∣EDComp∣ then X is extremally disconnected and c is equivalent (as a compactification of X) to the Stone-Čech compactification β:X⟶βX of X (see [12] or [11]).
Now we will show, using the
Tarski duality, that the category zMaps is dually
equivalent to the category ZComp. The category zMaps is
similar to the category DeVe, constructed in [4] as a
category dually equivalent to the category Comp of Hausdorff
compactifications of Tychonoff spaces.
Theorem 8.8**.**
The categories ZComp and zMaps are dually equivalent.
Proof.
We will utilize the notation introduced in the proof of Theorem 8.5.
We start by defining a contravariant functor
[TABLE]
For every (c:X⟶Y)∈∣ZComp∣, we set
[TABLE]
Then it is easy to see that
Φ′(c)∈∣zMaps∣.
For every (f,g)∈ZComp(c,c′), we set
[TABLE]
It is not difficult to obtain that
Φ′(f,g)∈zMaps(Φ′(A′,X′),Φ′(A,X)). Now it is easy
to see that Φ′ is a contravariant functor.
Our next aim is to define a contravariant functor
[TABLE]
Let (α:A⟶B)∈∣zMaps∣. We put
[TABLE]
(see 2.1 for the notation Xα). Obviously, Ψ′(c)∈∣ZComp∣.
Let now (φ,σ)∈zMaps(α,α′). Then it is easy to show that S(φ)(Xα′)⊆Xα.
Let Sφ:Xα′⟶Xα be the restriction of S(φ). We put
[TABLE]
Then it is not difficult to prove that Ψ′(φ,σ)∈ZComp(Ψ′(α′),Ψ′(α)) and that
Ψ′ is a contravariant functor.
Let (α:A⟶B)∈∣zMaps∣. Then Φ′(Ψ′(α))=sAcαX^cα and sAcαX^cα:Acα⟶P(X^cα).
We have that Acα=cα−1(CO(S(A)))=Xα∩T(S(A))=sAXα(A). Thus sˉAXα:A⟶Acα is a Boolean isomorphism.
Since α is a z-map, the map hα:At(B)⟶Xα, x↦αx, is a bijection (see 2.1).
Also, the map h^Xα,Acα:Xα⟶X^cα, αx↦αx, for all x∈At(B), where αx:Acα⟶\mbox2, is a bijection (see 2.1).
Setting kα=dfh^Xα,Acα∘hα and kαP:P(At(B))⟶P(X^cα), M↦{kα(m)∣m∈M}, we obtain that kαP is a bijection.
Then the map εBcα=dfkαP∘εB is a bijection (see 2.8 for the notation εB) and
εBcα:B⟶P(X^cα), b↦{αx∣x∈At(B),x≤b}. Now we put υα=df(sAXα,εBcα). It is easy to see that υα:α⟶Φ′(Ψ′(α)) is a zMaps-isomorphism. One routinely verifies that
[TABLE]
is a natural isomorphism.
Let (c:X⟶Y)∈∣ZComp∣. Then Ψ′(Φ′(c))=cα, where α=dfsAcX^c. Thus cα:Xα↪S(Ac), where Ac=c−1(CO(Y)) and Xα={αx^∣x^∈X^c}. We have that for every U∈Ac, αx^(U)=1⇔x^≤α(U)⇔x^∈sAcX^c(U)⇔x^(U)=1. Thus, αx^≡x^ for every x∈X. Hence, Xα=X^c, i.e., cα:X^c↪S(Ac). As we noted in the proof of Theorem 8.5,
the maps S(ρc):S(T(Y))⟶S(Ac) (where ρc:Ac⟶CO(Y),c−1(U)↦U)
and h^X,Ac:X⟶X^c,x↦x^, are homeomorphisms. Now it is easy to see that the map ξc=df(h^X,Ac,S(ρc)∘tY):c⟶Ψ′(Φ′(c)) is a ZComp-isomorphism (see 2.2 for the notation tY). Finally, a routine verification shows that
[TABLE]
is a natural isomorphism.
All this proves that the categories ZComp and zMaps are dually equivalent.
∎
8.9**.**
We are now going to derive the Dwinger Theorem 2.6 from our Theorems 8.5 and 8.8.
In what follows, we will use the notation from their proofs.
Let us fix a space X∈∣ZHaus∣. Then, obviously, the map λ:BA(X)⟶∣zBoole∣,A↦(A,X^A), is an injection. (Note that, by Example 3.9, λ is a well-defined function.) Thus, the map λ0=dfλ↾BA(X):BA(X)⟶λ(BA(X)) is a bijection. We have that Ψ(λ(A))=c(A,X^A), where
c(A,X^A):X^A↪S(A) is the embedding of X^A in S(A). We set cA=dfc(A,X^A)∘h^X,A and Δ(A)=df[cA]. Then
[TABLE]
For every (c:X⟶Y)∈K0(X), we set Δ′([c])=dfλ0−1(Φ(c)). Thus
[TABLE]
Note that the map Δ′ is well-defined. Indeed, if c1∈[c], where c1:X⟶Y1, then there exists a homeomorphism f:Y⟶Y1 such that c1=f∘c. Hence c1−1(CO(Y1))=c−1(f−1(CO(Y1)))=c−1(CO(Y)).
Now, for every A∈BA(X),
[TABLE]
Indeed, we have that Δ′(Δ(A))=AcA=cA−1(T(S(A)))=h^X,A−1(sˉAX^A(A)) and, for every U∈A, h^X,A−1(sˉAX^A(U))=U (see the proof of Example 3.9).
Further, for every (c:X⟶Y)∈K0(X), Δ(Δ′([c]))=Δ(Ac)=[cAc], where cAc:X⟶S(A).
At the end of the proof of Theorem 8.8 we have shown that the map (h^X,Ac,S(ρc)∘tY):c⟶c(Ac,X^c) is a ZComp-isomorphism. Using the definition of the map cAc, we obtain that the map (h^X,Ac−1,idS(Ac)):c(Ac,X^c)⟶cAc is also a ZComp-isomorphism. Thus the diagram
is commutative. It shows that the compactifications c and cAc of X are equivalent (since cAc=(S(ρc)∘tY)∘c). Thus,
[TABLE]
Therefore, Δ and Δ′ are bijections.
Let now c1:X⟶Y1 and c2:X⟶Y2 be compactifications of X, and c1≤c2. Then there exists a continuous map g:Y2⟶Y1 such that c1=g∘c2. Thus, (idX,g)∈ZComp(c2,c1). Then
Ac1=c1−1(CO(Y1))=c2−1(g−1(CO(Y1)))⊆c2−1(CO(Y2))=Ac2. Therefore,
[TABLE]
Let now A,A′∈BA(X) and A be a subalgebra of A′; denote by i:A⟶A′ the inclusion monomorphism. For every x∈X, set f(x^A′)=x^A (see 2.1 for the notation). Then f:X^A′⟶X^A, f(x^A′)=x^A′∘i and thus (i,f)∈zBoole(λ(A),λ(A′)). Therefore Ψ(i,f):Ψ(λ(A′))⟶Ψ(λ(A)) is a ZComp-morphism. We have that Ψ(i,f)=(f,S(i)). Hence, the diagram
Therefore, Δ and Δ′ are isomorphisms between the ordered sets (BA(X),⊆) and (K0(X),≤). Thus, the Dwinger Theorem is proved.
For deriving the Dwinger Theorem from Theorem 8.8, we use the same maps Δ and Δ′ but find another expressions for them. For every (c:X⟶Y)∈K0(X), we have that Φ′(c)=sAcX^c and thus Δ′([c])=dom(Φ′(c)). Also, for every A∈BA(X), we have, by Example 4.2, that the map iA:A↪P(X) is a z-map. Set α=dfiA. Then Ψ′(α)=cα, where cα:Xα↪S(A), and Xα≡X^A. Thus cα≡c(A,X^A) and Δ(A)=cA=Ψ′(α)∘h^X,A. Then we prove exactly as above that Δ and Δ′ are bijections, and that Δ′ is monotone. Finally, let A,A′∈BA(X) and A⊆A′. Denote by i:A↪A′ the inclusion monomorphism and set α=dfiA, α′=dfiA′. Then (i,idP(X))∈zMaps(α,α′) and thus Ψ′(i,idP(X))∈ZComp(cα′,cα). We have that Ψ′(i,idP(X))=(Si,S(i)), where Si:X^A′⟶X^A is the restriction of S(i):S(A′)⟶S(A). Writing in the last diagram Si instead of f, we obtain a new commutative diagram which shows again that Δ(A)≤Δ(A′). Thus, the second proof of the Dwinger Theorem is completed.
Bibliography17
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1]
2[2] J. Adámek, H. Herrlich and G. E. Strecker, Abstract and Concrete Categories , Online edition, 2004, http://katmat.math.uni-bremen.de/acc.
3[3] B. Banaschewski, Über nulldimensionale Räume, Math. Nachr., 13 (1955), 129–140.
4[4] G. Bezhanishvili, P. J. Morandi and B. Olberding, An extension of de Vries duality to completely regular spaces and compactifications, Topology and its Applications, 257 (2019), 85–105.
5[5] W. Comfort and S. Negrepontis, Chain Conditions in Topology , Cambridge Univ. Press, Cambridge, 1982.
6[6] G. Dimov, A de Vries-type duality theorem for locally compact spaces – II, ar Xiv:0903.2593 v 4, 1–37.
7[7] G. Dimov, Some generalizations of the Stone Duality Theorem, Publicationes Mathematicae Debrecen, 80 (2012), 255–293.
8[8] G. Dimov and E. Ivanova-Dimova, Extensions of the Stone Duality to the category 𝐁𝐨𝐨𝐥𝐞𝐒𝐩 𝐁𝐨𝐨𝐥𝐞𝐒𝐩 {\bf Boole Sp} , ar Xiv:2010.00097 v 1, 1–15.