{'fraction_non_alphanumeric': 0.04046692607003891, 'fraction_numerical': 0.005447470817120622, 'mean_word_length': 4.380753138075314, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 2, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Adding a closed unbounded set

The extreme interest of set theorists in the notion of “closed unbounded set” is epitomized in the following well-known theorem: Theorem A. For any regular cardinal κ > ω, the intersection of any two closed unbounded subsets of κ is closed and unbounded. The proof of this theorem is easy and in fact yields a stronger result, namely that for any uncountable regular cardinal κ the intersection of fewer than κ many closed unbounded sets is closed and unbounded. Thus, if, for κ a regular uncountable cardinal, we let denote {A ⊆ κ ∣ A contains a closed unbounded subset}, then, for any such κ, is a κ-additive nonprincipal filter on κ. Now what about the possibility of being an ultrafilterκ It is routine to see that this is impossible for κ > ℵ1. However, for κ = ℵ1 the situation is different. If were an ultrafilter, ℵ1 would be a measurable cardinal. As is well-known this is impossible if we assume the axiom of choice; however if ZF + “there exists a measurable cardinal” is consistent, then so is ZF + “ℵ1 is a measurable cardinal” [2]. Furthermore, under the assumption of certain set theoretic axioms (such as the axiom of determinateness or various infinite exponent partition relations) can be proven to be an ultrafilter. (See [3] and [5].)