Writes explicit predicative formulas for being a topological space, for compactness, and, through membership in the subspace topology, for compactness of a subset; renames them to arbitrary variable positions and applies class comprehension.
Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated, and the given are the first of distinct set variables as in Renaming and Substituting Variables in Predicative Formulas, so that are distinct also when . The parameters , and the order of are three distinct class variables, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i). The letters , , , , and denote further set variables, distinct from one another and from . The defined set symbols , , and below are applied to sets only (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (viii)). Routine set bookkeeping is used without comment: elements of classes are sets (Classes, Membership, Sets and Proper Classes (i)), and so are subsets (Subclasses and Subsets (i)) and subclasses of sets (Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i)), in particular and below and a topology on a set , a subset of (Topological Space); and a one-entry tuple is (The Ordered Pair of Two Sets and Nested Tuples (ii)).
Finiteness. By Induction over Finite Sets, and Predicative Formulas for the Segments [n] and for Finiteness (ii), with as its set variable and the three parameters as its class variables, there is a predicative formula , with free variables among and the parameters, that holds for a set assigned to if and only if that set is finite; its bound variables are chosen other than the letters above.
Topological spaces. Write and for and , and let
It is predicative, no quantifier in it being applied to a class variable (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i)), and its free variables are and . Let sets and be assigned to and . The first conjunct of says that is a subset of the power set , the standing hypothesis of Topological Space, which " is a topological space" includes for arbitrary sets. The quantifier ranges over sets (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (iv)), so the fourth conjunct says that for every subset of . Hence holds if and only if and satisfies Topological Space (ii), Topological Space (iii) and Topological Space (iv), that is, by Topological Space (i) and Topological Space (v), if and only if is a topological space.
The formula for compact spaces. Let
The formula is predicative, being built from abbreviations and the predicative formula by connectives and quantifiers over set variables only (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v)), and its free variables are among , and the parameters. Let sets and be assigned to and . If is not a topological space, then fails, and so do and the condition of (i). Suppose that is a topological space, so that holds. As the quantifiers and range over sets, says that for every subset of with there is a finite subset of with , that is, by Compact Topological Space and Compact Subset (i), that is compact. In both cases holds if and only if is a topological space and is compact. So is a predicative formula in , in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing this condition with and .
The formula for compact subsets. Write for , and let
As for , the formula is predicative, and its free variables are among , , and the parameters. Let sets , and be assigned to , and . If is not a topological space or , then fails, and so does the condition of (ii). Suppose that is a topological space and , and let be the subspace topology on . By Subspace Topology (i) and The Union Set and the Power Set of a Set (ii), a set lies in if and only if
that is, if and only if holds; so, for a set , the formula holds if and only if (Subclasses and Subsets (i)). As is a subclass of the set , it is a set; thus ranges over all subsets of , and, as before, over all subsets of . Hence holds if and only if for every subset of with there is a finite subset of with , that is, by Compact Topological Space and Compact Subset (i) applied to the topological space (The Subspace Topology is a Topology (i)), if and only if is compact, which by Compact Topological Space and Compact Subset (ii) means that is compact in . In all cases holds if and only if is a topological space, and is compact in . So is a predicative formula in expressing this condition with , and .
Compact spaces. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to and and , the formula is a predicative formula in that holds, under every assignment of sets to , exactly when is a topological space and is compact. This proves (i).
Compact subsets. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to and , and , the formula is a predicative formula in that holds, under every assignment of sets to , exactly when is a topological space, and is compact in . This proves (ii).
The class of compact subsets. Let be a topological space; and are sets. Apply The Class Comprehension Theorem for Predicative Formulas (i) to with its abbreviations eliminated, with as its single variable and , and the three parameters as its parameters, and being assigned and . It gives a class whose elements are exactly the sets for which holds with , and assigned , and , that is, as is a topological space, the sets that are compact in . This proves (iii).
The class of compact topologies. Let be a set. Apply The Class Comprehension Theorem for Predicative Formulas (i) to with its abbreviations eliminated, with as its single variable and and the three parameters as its parameters, being assigned . It gives a class whose elements are exactly the sets for which holds with and assigned and , that is, those for which is a topological space and is compact. This proves (iv).
Loadingβ¦