Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
NOTES ON ALGEBRAS OF TOPOLOGY 1. Three algebras coming from topology 1.1. Interior algebras. Definition 1.1. An S4-algebra (alternatively, a closure algebra or an interior algebra) is a pair (B, ) where B is a Boolean algebra and : B → B a modal operator such that for each a, b ∈ B we have (1) 1 = 1, (2) (a ∧ b) = a ∧ b, (3) a ≤ a, (4) a ≤ a. If we let ♦a = ¬¬a, then the S4-axioms can be rewritten as: (1) ♦0 = 0, (2) ♦(a ∨ b) = ♦a ∨ ♦b, (3) ♦♦a ≤ ♦a, (4) a ≤ ♦a. Given a topological space (X, τ ) the algebra (P(X), Int), where P(X) is the powerset of X and Int the interior operator, is an S4-algebra. Exercise 1.2. Prove the above claim. 1.2. Algebras of open and regular open sets. We also know that (τ, ∩, ∪, →, ∅) is a Heyting algebra, where for U, V ∈ τ we have U → V = Int((X \ U ) ∪ V ). Recall that an open set U ∈ τ is called regular open if Int(Cl(U )) = U , where Cl is the closure ˙ ¬, operator. Let RO(X) denote the set of all regular open subsets of X. Then (RO(X), ∩, ∪, ˙ ∅, X) is a Boolean algebra, where for U, V ∈ RO(X) we have ˙ = Int(Cl((U ∪ V )) U ∪V and ¬U ˙ = Int(X \ U ). Exercise 1.3. Verify the above claim. The above motivates the following definition. Definition 1.4. Let A be a Heyting algebra. An element a ∈ A is called regular if a = ¬¬a. Let Rg(A) be the set of all regular elements of A. ˙ ¬, 0, 1) forms a Boolean algebra, where for each a, b ∈ Rg(A) Exercise 1.5. Show that (Rg(A), ∧, ∨, we have ˙ = ¬¬(a ∨ b). a∨b Exercise 1.6. Show that the map ¬¬ : A → Rg(A) is a Heyting algebra homomorphism. 1 2 NOTES ON ALGEBRAS OF TOPOLOGY 2. Pre-orders and Alexandroff topologies A pre-ordered set or a pre order is a set with a reflexive and transitive binary relation on it. Let (X, ≤) be a pre order. A subset U ⊆ X is called an up-set if x ∈ U and x ≤ y imply y ∈ U . Given a pre order (X, ≤) we can define a topology τ≤ = {U ⊆ X : U is an up-set}. A topological space (X, τ ) is called an Alexandroff space if τ is closed under arbitrary intersections. Exercise 2.1. Show that (X, τ≤ ) is an Alexandorff space. Given a topological space (X, τ ) define a relation ≤τ on X by setting x ≤τ y iff every open set containing x also contains y. Exercise 2.2. Show that (1) x ≤τ y iff x ∈ Cl(y), (2) ≤τ is reflexive and transitive, (3) (X, ≤) is isomorphic to (X, ≤τ≤ ), (4) if (X, τ ) is an Alexandroff space, then (X, τ ) is homeomorphic to (X, τ≤τ ).