regular open algebra
A regular open algebra is an algebraic system whose universe is the set of all regular open sets in a topological space , and whose operations are given by
-
1.
a constant such that ,
-
2.
a unary operation such that for any ,β , where is the complement of the closure of in ,
-
3.
a binary operation such that for any , , and
-
4.
a binary operation such that for any , .
From the parent entry, all of the operations above are well-defined (that the result sets are regular open). Also, we have the following:
Theorem 1.
is a Boolean algebra
Proof.
We break down the proof into steps:
-
1.
is a lattice. This amounts to verifying various laws on the operations:
-
β
(idempotency of and ): Clearly, . Also, , since is regular open.
-
β
Commutativity of the binary operations are obvious.
-
β
The associativity of is also obvious. The associativity of goes as follows: , since is open (which implies that is regular open). The last expression is equal to . Interchanging the roles of and , we obtain the equation , which is just , or . The commutativity of completes the proof of the associativity of .
-
β
Finally, we verify the absorption laws. First, . Second, .
-
β
-
2.
is complemented. First, it is easy to see that and are the bottom and top elements of . Furthermore, for any , . Finally, .
-
3.
is distributive. This can be easily proved once we show the following: for any open sets :
To begin, note that since , and is order reversing, by applying twice. Do the same with and take the intersection, we get one of the inclusions: . For the other inclusion, we first observe that
If LHS, then and for any open set with , we have that . In particular, is such an open set (for ), so that , or . Since is arbitrary, RHS. Now, apply the set complement, we have . Applying next we get for the LHS, and for RHS, since is closed. As reverses order, the new inclusion is
From this, a direct calculation shows , noticing that the first and second inclusions use above (and the fact that preserves order), and the last equation uses the fact that for any open set , is regular open. This proves the .
Finally, to finish the proof, we only need to show one of two distributive laws, say, , for the other one follows from the use of the distributive inequalities. This we do be direct computation: .
Since a complemented distributive lattice is Boolean, the proof is complete. β
Theorem 2.
The subset of all clopen sets in forms a Boolean subalgebra of .
Proof.
Clearly, every clopen set is regular open. In addition, . If is clopen, so is the complement of its closure, and hence . If are clopen, so is their intersection . Similarly, is clopen, so that is clopen also. β
Theorem 3.
In fact, is a complete Boolean algebra. For an arbitrary subset of , the meet and join of are and respectively.
Proof.
Let . For any , so that . This shows that is an upper bound of elements of . If is another such upper bound, then , so that , whence . The infimum is proved similarly. β
Theorem 4.
is the smallest complete Boolean subalgebra of extending .
More to comeβ¦
Title | regular open algebra |
---|---|
Canonical name | RegularOpenAlgebra |
Date of creation | 2013-03-22 17:56:21 |
Last modified on | 2013-03-22 17:56:21 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 16 |
Author | CWoo (3771) |
Entry type | Definition |
Classification | msc 06E99 |