@ Appl. Gen. Topol. 18, no. 1 (2017), 107-115 doi:10.4995/agt.2017.6376 c© AGT, UPV, 2017 On cardinalities and compact closures Mike Krebs Department of Mathematics, California State University - Los Angeles, 5151 State University Drive, Los Angeles, California 90032 (mkrebs@calstatela.edu) Communicated by S. Garćıa-Ferreira Abstract We show that there exists a Hausdorff topology on the set R of real numbers such that a subset A of R has compact closure if and only if A is countable. More generally, given any set X and any infinite set S, we prove that there exists a Hausdorff topology on X such that a subset A of X has compact closure if and only if the cardinality of A is less than or equal to that of S. When we attempt to replace “less than or equal to” in the preceding statement with “strictly less than,” the situation is more delicate; we show that the theorem extends to this case when S has regular cardinality but can fail when it does not. This counterexample shows that not every bornology is a bornology of compact closure. These results lie in the intersection of analysis, general topology, and set theory. 2010 MSC: 54A99. Keywords: topology; Hausdorff; cardinality; compact closure. 1. Introduction A bornology on a set X is a covering B of X such that (i) if A,B ∈B, then A∪B ∈B, and (ii) if B ∈B and A ⊂ B, then B ∈B. Bornologies are objects of much study in analysis—see, for example, [2]. The prototypical example of a bornology is the collection of all bounded sets in a metric space. Another standard example, for a Hausdorff space X, is the collection of all subsets of X with compact closure. The latter construction is rather general, and one may well wonder: Given a bornology on X, does there necessarily exist a topology Received 15 July 2016 – Accepted 18 January 2017 http://dx.doi.org/10.4995/agt.2017.6376 M. Krebs on X with respect to which B is precisely the bornology of sets with compact closure? In this paper, we answer that question in the negative by constructing a set Y for which the bornology of subsets of Y with cardinality strictly less than that of Y cannot be a bornology of compact closure—see Example 3.10. This example leads to the following general question. Given two sets X and S, take the bornology B of subsets of X with cardinality less than or equal to that of S. Is B a bornology of compact closure? One can also ask this question for the bornology of subsets of X with cardinality strictly less than that of S. For the first question, we show that the answer is always yes. For the second question, our counterexample Y mentioned above shows that the answer is not always yes; however, we prove that it is whenever S has regular cardinality. Considerations in general topology may lead one to ask the same questions without reference to bornologies. We now re-introduce this topic from this new point of view. When a set X is endowed with the discrete topology, a subset A of X is compact if and only if A is finite. One may wonder next, does there necessarily exist a topology on X such that a subset A of X is compact if and only if A is countable? One quickly realizes that unless X is finite, no such topology can be Hausdorff. For if so, then let A = {an | n ∈ N} be a countably infinite subset of X with an 6= am whenever n 6= m. (Here N denotes the set of natural numbers.) Note that each set Ak := {an | n ≥ k} is countable, hence compact, hence closed because the topology is Hausdorff. But then {Ak} is a nested collection of nonempty closed subsets of the compact set A, yet it has empty intersection, which is a contradiction. Hausdorff being a typical property to impose a topological space, we there- fore modify the question slightly: Does there exist a Hausdorff topology on X in which a set has compact closure if and only if it is countable? In particular, what about the case X = R, where R is the set of real numbers? If we assume both the continuum hypothesis (CH) and the Axiom of Choice (AC), then the answer to this last question is an immediate yes, for the fol- lowing reason. Recall that CH states that no uncountable set has cardinality strictly less than that of R. Let Ω be the least uncountable ordinal, that is, an uncountable well-ordered set such that every subset of the form {y ∈ Ω | y ≤ x} for x ∈ Ω is countable. It follows from CH that the cardinality of R equals that of Ω. We may then identify R with Ω and give it the topology induced by the order on Ω. A straightforward exercise shows that with this topology, the closure of a set A in R is compact if and only if A is countable. Although this logic no longer holds when we do not assume CH, it suggests an approach. Begin by taking a well-ordering of R. Recursively define a topol- ogy on R by constructing a neighborhood basis at each point, assuming one has been constructed at each previous point. We carefully select this neighbor- hood basis so that the sets with compact closure are precisely the countable sets. Indeed, we may generalize this reasoning considerably. The details are carried out in Section 3, where we prove our two main theorems. The first (Theorem 3.1) states that given any set X and any infinite set S, there exists c© AGT, UPV, 2017 Appl. Gen. Topol. 18, no. 1 108 On cardinalities and compact closures a Hausdorff topology on X such that the sets with compact closure are pre- cisely those whose cardinality is less than or equal to that of S. We obtain the first sentence in the abstract by taking X = R and S = N. In Section 2, we discuss some set-theoretic preliminaries, including the definitions of “regular” and “singular” cardinals. The second main theorem (Theorem 3.9) states that when the cardinality of S is regular, the phrase “less than or equal to” in The- orem 3.1 can be replaced by the phrase “strictly less than.” We conclude with an example to show that the regularity condition in Theorem 3.9 cannot be eliminated. 2. Background from set theory Throughout this paper, we work within the Zermelo-Fraenkel axiom system (ZF). Recall that a linear ordering on a set X is said to be a well-ordering if every nonempty subset of X has a smallest element. Theorem 2.1 (Well-Ordering Principle). Every set admits a well-ordering. It is well-known that the well-ordering principle is equivalent to the Axiom of Choice (AC). The first step in our proofs will be to well-order the set X, so the proofs depend on the well-ordering principle, and hence AC, right from the git-go. It is also well-known that a countable union of countable sets is countable. More generally, a union over a set no bigger than X of sets no bigger than X is no bigger than X. More precisely, we have the following theorem, where the notation |B| ≤ |C| means that the cardinality of B is less than or equal to that of C. (Likewise, we will later use the notation |B| < |C| to indicate that the cardinality of B is strictly less than that of C.) Theorem 2.2. Let X be an infinite set, and let I be a set with |I| ≤ |X|. For each i ∈ I, let Ai be a set with |Ai| ≤ |X|. Then | ⋃ i∈I Ai| ≤ |X|. Theorem 2.2 is proved in [1]. The proof depends on AC. Our third and final use of AC comes as we define the terms regular and singular for cardinalities. Roughly speaking, we say that the cardinality of a set is regular if the set cannot be written as a smaller union of smaller sets, and that it is singular otherwise. We now make this concept more precise. Definition 2.3. Let X be a set. We say that X has singular cardinality if there exists a set I with |I| < |X| such that for each i ∈ I there exists a set Ai with |Ai| < |X|, and that X = ⋃ i∈I Ai. We say that X has regular cardinality if X does not have singular cardinality. We say that this definition relies on AC because although it is not the stan- dard definition, it is equivalent to the standard definition under the assumption of AC. We refer to [1] for details. There is no purpose to Definition 2.3 unless both regular and singular car- dinals exist. As the name suggests, regular cardinals are not hard to find. For c© AGT, UPV, 2017 Appl. Gen. Topol. 18, no. 1 109 M. Krebs instance, ℵ0 := |N| is regular, because N does not equal a finite union of finite sets. Producing a singular cardinal requires a deliberate construction, such as the following. Example 2.4. Let X1 = N. For each n ∈ N, define Xn+1 to be the power set of Xn, i.e., the set of all subsets of Xn. By Cantor’s theorem, |Xn| < |Xn+1|. Hence Y := ⋃ n∈N Xn has singular cardinality. 3. Main theorems Throughout this section, fix a nonempty set X and an infinite set S. If A is a subset of a topological space, then we denote its closure by A. Our first objective in this section is to prove the following theorem. Theorem 3.1. There exists a Hausdorff topology on X so that if A ⊂ X, then A is compact if and only if |A| ≤ |S|. Choose a well-ordering ≤ on X. Assume that with respect to this ordering, X has a maximal element M. (If not, then create a new ordering by reversing all inequalities involving the minimal element.) To prove Theorem 3.1, we begin by defining a topology. The definition is recursive and depends on knowing that what has been defined so far already forms a topology, a fact that in turn requires proof. So we must simultaneously make a recursive definition and an inductive proof. For y ∈ X, we define the closed ray (−∞,y] := {x ∈ X | x ≤ y} and the open ray (−∞,y) := {x ∈ X | x < y}. Observe that X = (−∞,M]. Lemma/Definition 3.2. For any given x ∈ X, define Nx, Bx, Tx, and Wx according to (1)–(6) below with y = x, assuming that (1)–(6) are true for all y < x. (1) We define Ny to be the collection of all sets of the form (−∞,y] \ K such that K is Ty-closed in (−∞,y) and such that if C is a Ty-closed subset of K with |C| ≤ |S|, then C is Ty-compact. Here Ty is defined as in (3). (2) We define By := ⋃ z |S|. Let m be the smallest element of X such that |(−∞,m]∩A| > |S|. Let ` be the least upper bound of A∩(−∞,m). (The fact that X is well-ordered guarantees that m and ` exist.) Let Q = {a ∈ A | a < m}. Let C = ⋃ a∈Q((−∞,a] ∩ A). By Theorem 2.2, |C| ≤ |S|. Observe that (−∞,m] \ (−∞,`] is an open set disjoint from A; therefore it is disjoint from A. So (−∞,m]∩A contains C and at most two other points, namely ` and m. Becasue S is infinite, therefore |(−∞,m] ∩A| ≤ |S|, a contradiction. � Lemma 3.8. If A ⊂ X and |A| > |S|, then A is not compact. Proof. Temporarily assume that A is compact. Observe that |A| > |S|. Let m be the smallest element of X such that |(−∞,m]∩A| > |S|. By Lemma/Definition 3.2, we have that (−∞,m] is a closed subspace of X = (−∞,M], so (−∞,m]∩A is Wm-compact. Let K = (−∞,m) ∩ A. Note that |K| > |S|, by definition of m. Let C be any Tm-closed subset of K such that |C| ≤ |S|. We will show that C is Tm-compact. By definition of Wm, this will show that K is a Wm-closed subset of the Wm-compact set (−∞,m] ∩A and therefore that K is Wm-compact. Let ` be the least upper bound of C in X. We must have that ` < m, for otherwise, by Theorem 2.2, we would have that |K| = ∣∣∣∣∣⋃ c∈C ((−∞,c] ∩A) ∣∣∣∣∣ ≤ |S|. c© AGT, UPV, 2017 Appl. Gen. Topol. 18, no. 1 113 M. Krebs So C ⊂ (−∞,`]. It follows then from Lemma/Definition 3.2 that because C is Tm-closed, therefore C is W`-closed, and therefore C is Wm-closed. But C is a subset of the Wm-compact set A, so C is Wm-compact, therefore Tm-compact. Note that {(−∞,k] : k ∈ K} is a Wm-open cover of K. Hence K ⊂ (−∞,k1] ∪·· ·∪ (−∞,kn] for some k1, . . . ,kn. So K ⊂ n⋃ j=1 ((−∞,kj] ∩A). But each kj < m, so |(−∞,kj] ∩ A| ≤ |S|, by definition of m. But then |K| ≤ |S|, because S is infinite. This contradicts the fact that |K| > |S|. � Theorem 3.1 follows at once from Lemmas 3.5, 3.6, 3.7, and 3.8. Theorem 3.9. Let X be a set, and let S be an infinite set with regular cardi- nality. Then there exists a Hausdorff topology on X so that if A ⊂ X, then A is compact if and only if |A| < |S|. Proof. The proof is identical to that of Theorem 3.1 with two small modifica- tions. One must replace every instance of “≤ |S|” with “< |S|.” Also, one must use Definition 2.3 in place of Theorem 2.2 whenever the latter is invoked. � The following example illustrates how Theorem 3.9 can fail when S has singular cardinality. Example 3.10. Consider the sets defined in Example 2.4. We will show that there does not exist a topology on Y such that A ⊂ Y has compact closure if and only if |A| < |Y |. Suppose otherwise. The fact that Y does not have strictly smaller cardinality than itself implies that Y = Y is not compact. Let {Uα} be an open cover of Y with no finite subcover. We know that |Xn| < |Y | for all n, so Xn is compact. Cover Xn with finitely many sets Uαn,1, . . . ,Uαn,jn from the collection {Uα}, and let Vn = ⋃jn `=1 Uαn,` . By our assumption on {Uα}, there exists a point bn ∈ Y such that bn /∈ Wn, where Wn = ⋃n k=1 Vk. Note that the sets Wn form an increasing chain of open sets. Also note that Xn ⊂ Xn ⊂ Vn ⊂ Wn. Let S = {bn | n ∈ N}. Then |S| < |Y |. We will show that S is not compact, thereby producing the desired contradiction. For each ` ∈ N, let S` = {bn | n ≥ `}. Then {S`} is a collection of closed subsets of S with the finite intersection property. It suffices to show that ⋂∞ `=1 S` = ∅. Let y ∈ Y . Then y ∈ Xm for some m. Hence y is in the open set Wm. Observe that Wm ∩ Sm = ∅, because of how we chose the points bn. Therefore y /∈ Sm. Therefore {S`} has empty intersection, and so S cannot be compact. c© AGT, UPV, 2017 Appl. Gen. Topol. 18, no. 1 114 On cardinalities and compact closures Acknowledgements. The author would like to acknowledge Gerald Beer for discussions of bornologies that prompted the questions answered in this paper, and would like to thank the anonymous referee for several useful suggestions. References [1] A. Dasgupta, Set theory, Birkhäuser/Springer, New York, 2014. [2] H. Hogbe-Nlend, Bornologies and functional analysis, North-Holland Publishing Co., Amsterdam-New York-Oxford, 1977. c© AGT, UPV, 2017 Appl. Gen. Topol. 18, no. 1 115