TheoremBase

Separability is written with the metric kit's formula, the countability formula and a formula saying every ball meets the set; for normed spaces the formula quantifies over the norm metric, which a predicative formula singles out. Renaming moves the formulas to any positions, and class comprehension gives the class of separable metrics.

Proof

Throughout, formulas are written with abbreviations and quantify over set variables only, so they are predicative. The parameters N\mathbb{N}, R\mathbb{R}, ++, β‹…\cdot, 00, 11 and ≀\le are variables other than x0,x1,…x_{0},x_{1},\dots and other than the bound variables below; 00 and 11 are sets, being elements of R\mathbb{R}. Elements of classes are sets (Classes, Membership, Sets and Proper Classes (i)), and a one-entry tuple ⟨d⟩\langle d\rangle is dd (The Ordered Pair of Two Sets and Nested Tuples (ii)). For sets rr and ss, r<sr<s abbreviates (r,s)βˆˆβ‰€βˆ§Β¬β€‰r=s(r,s)\in{\le}\wedge\neg\,r=s, the strict order of R\mathbb{R}. We first build formulas in the set variables x0,x1,…,x4x_{0},x_{1},\dots,x_{4} and move them to the given positions at the end; the letters D,w,wβ€²,wβ€²β€²,x,y,z,u,v,r,t,c,pD,w,w',w'',x,y,z,u,v,r,t,c,p denote further set variables.

Separable metric spaces. Write XX and dd for x0x_{0} and x1x_{1}. By Kit for def:metric-space (vi) with n=2n=2, i=0i=0 and j=1j=1, there is a predicative formula ΞΌ0\mu_{0} in x0,x1x_{0},x_{1}, with parameters among R\mathbb{R}, ++, 00 and ≀\le, that expresses Ξ“1\Gamma_{1}; its bound variables are chosen other than the letters above. Let cnt(D)\mathrm{cnt}(D) be the formula of Countability as a Predicative Condition, and Finite Powers of a Set as a Typed Term (i) with DD for its xx, its bound variables chosen other than XX, dd, DD and the letters listed above, and its parameter NN having the value N\mathbb{N}, a set by The Set of Natural Numbers and the Number One (i): for every set DD, cnt(D)\mathrm{cnt}(D) holds exactly when DD is countable. Let

Ξ²(D)=βˆ€xβ€‰βˆ€r ((x∈X∧r∈R∧0<r)β‡’βˆƒyβ€‰βˆƒt (y∈D∧y∈X∧((x,y),t)∈d∧t<r)),\beta(D)=\forall x\,\forall r\,\Bigl(\bigl(x\in X\wedge r\in\mathbb{R}\wedge0<r\bigr)\Rightarrow\exists y\,\exists t\,\bigl(y\in D\wedge y\in X\wedge((x,y),t)\in d\wedge t<r\bigr)\Bigr), Ο†1=ΞΌ0βˆ§βˆƒD (βˆ€w (w∈Dβ‡’w∈X)∧cnt(D)∧β(D)).\varphi_{1}=\mu_{0}\wedge\exists D\,\bigl(\forall w\,(w\in D\Rightarrow w\in X)\wedge\mathrm{cnt}(D)\wedge\beta(D)\bigr).

Assume Ξ“1\Gamma_{1}, and let DβŠ†XD\subseteq X. For x,y∈Xx,y\in X the pair (x,y)(x,y) lies in XΓ—X=dom⁑dX\times X=\operatorname{dom}d (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)), so, dd being a function, ((x,y),t)∈d((x,y),t)\in d holds exactly for t=d(x,y)t=d(x,y), a real number, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x). Hence, for x∈Xx\in X and a real number r>0r>0, the existential part of Ξ²(D)\beta(D), whose premise ((x,y),t)∈d((x,y),t)\in d names this value, says that some yy satisfies y∈Dy\in D, y∈Xy\in X and d(x,y)<rd(x,y)<r (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii)), that is, by Open Ball in a Metric Space (ii) and The Boolean Operations on Classes, Disjointness, and the Universal Class (i), that D∩Bd(x,r)β‰ βˆ…D\cap B_{d}(x,r)\neq\emptyset (this class is a set by 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), being a subclass of XX, and the empty set is the only set with no element). Thus Ξ²(D)\beta(D) holds exactly when DD is dense in (X,d)(X,d). The subsets of XX are exactly the sets DD with βˆ€w (w∈Dβ‡’w∈X)\forall w\,(w\in D\Rightarrow w\in X) (Subclasses and Subsets (i)). So, under Ξ“1\Gamma_{1}, the second conjunct of Ο†1\varphi_{1} holds exactly when XX has a countable subset that is dense in (X,d)(X,d), that is, by Separable Metric Space and Separable Real Normed Space (i), exactly when (X,d)(X,d) is separable. As ΞΌ0\mu_{0} expresses Ξ“1\Gamma_{1}, the formula Ο†1\varphi_{1}, with parameters among N\mathbb{N}, R\mathbb{R}, ++, 00 and ≀\le, expresses the condition of (i) with X=x0X=x_{0} and d=x1d=x_{1}.

The norm metric. Now write VV, aa, ss, Ξ½\nu and dd for x0x_{0}, x1x_{1}, x2x_{2}, x3x_{3} and x4x_{4}. By Kit for def:normed-space (vi) with n=4n=4 and the positions 0,1,2,30,1,2,3, there is a predicative formula Ο‡\chi in x0,…,x3x_{0},\dots,x_{3}, with parameters among R\mathbb{R}, ++, β‹…\cdot, 00, 11 and ≀\le, that expresses Ξ“2\Gamma_{2}; its bound variables are chosen other than the letters above. Let

ΞΆ(z)=z∈Vβˆ§βˆ€w′′ (wβ€²β€²βˆˆVβ‡’((wβ€²β€²,z),wβ€²β€²)∈a),Ξ΄(u,v,w)=βˆƒwβ€²β€‰βˆƒz (wβ€²βˆˆV∧΢(z)∧((v,wβ€²),z)∈a∧((u,wβ€²),w)∈a).\zeta(z)=z\in V\wedge\forall w''\,\bigl(w''\in V\Rightarrow((w'',z),w'')\in a\bigr),\qquad \delta(u,v,w)=\exists w'\,\exists z\,\bigl(w'\in V\wedge\zeta(z)\wedge((v,w'),z)\in a\wedge((u,w'),w)\in a\bigr).

Assume Ξ“2\Gamma_{2}. Then aa is a binary operation on VV (Vector Space over a Field (ix)), so for sets uu, vv and zz, ((u,v),z)∈a((u,v),z)\in a holds exactly when u,v∈Vu,v\in V and z=u+vz=u+v (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi)). Hence ΞΆ(z)\zeta(z) says that z∈Vz\in V and w+z=ww+z=w for every w∈Vw\in V, which holds exactly for z=0Vz=0_{V}, the zero vector. For u,v∈Vu,v\in V, Ξ΄(u,v,w)\delta(u,v,w) then says that there is wβ€²βˆˆVw'\in V with v+wβ€²=0Vv+w'=0_{V} and w=u+wβ€²w=u+w'; the only such wβ€²w' is the negative βˆ’v-v, so Ξ΄(u,v,w)\delta(u,v,w) holds exactly for w=u+(βˆ’v)w=u+(-v), the difference uβˆ’vu-v. For variables AA and BB let Ο€(c,A,B)\pi(c,A,B) be the formula βˆ€p (p∈cβ‡”βˆƒuβ€‰βˆƒv (u∈A∧v∈B∧p=(u,v)))\forall p\,\bigl(p\in c\Leftrightarrow\exists u\,\exists v\,(u\in A\wedge v\in B\wedge p=(u,v))\bigr), let ΞΌ(F,A,B)\mu(F,A,B) be the formula of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii), which holds exactly when FF is a map F:Aβ†’BF:A\to B, and let

ΞΈ=βˆƒc (Ο€(c,V,V)∧μ(d,c,R))βˆ§βˆ€uβ€‰βˆ€vβ€‰βˆ€tβ€‰βˆ€wβ€‰βˆ€y ((u∈V∧v∈V∧((u,v),t)∈d∧δ(u,v,w)∧(w,y)∈ν)β‡’t=y).\theta=\exists c\,\bigl(\pi(c,V,V)\wedge\mu(d,c,\mathbb{R})\bigr)\wedge\forall u\,\forall v\,\forall t\,\forall w\,\forall y\,\Bigl(\bigl(u\in V\wedge v\in V\wedge((u,v),t)\in d\wedge\delta(u,v,w)\wedge(w,y)\in\nu\bigr)\Rightarrow t=y\Bigr).

The only set cc with Ο€(c,V,V)\pi(c,V,V) is the Cartesian product VΓ—VV\times V, which is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii); so, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii), the first conjunct of ΞΈ\theta holds exactly when dd is a map d:VΓ—Vβ†’Rd:V\times V\to\mathbb{R}. When it does, for u,v∈Vu,v\in V the premises of the second conjunct name t=d(u,v)t=d(u,v), w=uβˆ’v∈Vw=u-v\in V and y=βˆ₯uβˆ’vβˆ₯y=\lVert u-v\rVert, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x), the function βˆ₯β‹…βˆ₯=Ξ½\lVert\cdot\rVert=\nu having domain VV; and a universally quantified implication whose premises name values in this way states the property of the named values given in its conclusion (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii)). So ΞΈ\theta holds exactly when dd is a map VΓ—Vβ†’RV\times V\to\mathbb{R} with

d(u,v)=βˆ₯uβˆ’vβˆ₯forΒ allΒ u,v∈V,d(u,v)=\lVert u-v\rVert\qquad\text{for all }u,v\in V,

that is, by The Norm Metric of a Real Normed Space (i) and Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii), exactly when dd is the norm metric dVd_{V}.

Separable real normed spaces. By Renaming and Substituting Variables in Predicative Formulas (i) with Οƒ(0)=0\sigma(0)=0 and Οƒ(1)=4\sigma(1)=4, the formula Ο†1(x0,x4)\varphi_{1}(x_{0},x_{4}) is a predicative formula in x0,…,x4x_{0},\dots,x_{4} that holds exactly when Ο†1\varphi_{1} holds with x0x_{0} assigned VV and x1x_{1} assigned dd, that is, exactly when dd is a map VΓ—Vβ†’RV\times V\to\mathbb{R}, (V,d)(V,d) is a metric space and (V,d)(V,d) is separable. Let

Ο†2=Ο‡βˆ§βˆƒx4 (ΞΈβˆ§Ο†1(x0,x4)).\varphi_{2}=\chi\wedge\exists x_{4}\,\bigl(\theta\wedge\varphi_{1}(x_{0},x_{4})\bigr).

Its free variables are among x0,…,x3x_{0},\dots,x_{3} and the parameters N\mathbb{N}, R\mathbb{R}, ++, β‹…\cdot, 00, 11 and ≀\le. Under an assignment of sets to x0,…,x3x_{0},\dots,x_{3}, the second conjunct holds exactly when some set dd satisfies ΞΈ\theta and Ο†1(x0,x4)\varphi_{1}(x_{0},x_{4}) (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (iv)). Under Ξ“2\Gamma_{2}, the only set satisfying ΞΈ\theta is dVd_{V} (a set, being an element of the class RVΓ—V\mathbb{R}^{V\times V} of functions from VΓ—VV\times V to R\mathbb{R} by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)); so the second conjunct holds exactly when dVd_{V} is a map VΓ—Vβ†’RV\times V\to\mathbb{R}, (V,dV)(V,d_{V}) is a metric space and (V,dV)(V,d_{V}) is separable. The first two of these hold: dVd_{V} is a map VΓ—Vβ†’RV\times V\to\mathbb{R} by The Norm Metric of a Real Normed Space (i) and a metric on VV by The Norm Metric of a Real Normed Space (ii), so (V,dV)(V,d_{V}) is a metric space by Metric Space (vi). Hence, under Ξ“2\Gamma_{2}, the second conjunct holds exactly when (V,dV)(V,d_{V}) is separable, that is, by Separable Metric Space and Separable Real Normed Space (ii), exactly when VV is separable. As Ο‡\chi expresses Ξ“2\Gamma_{2}, the formula Ο†2\varphi_{2} expresses the condition of (ii) with V=x0V=x_{0}, addition x1x_{1}, scalar multiplication x2x_{2} and βˆ₯β‹…βˆ₯=x3\lVert\cdot\rVert=x_{3}.

Any positions. Thus Ο†1\varphi_{1} is a predicative formula in x0,x1x_{0},x_{1} and Ο†2\varphi_{2} one in x0,…,x3x_{0},\dots,x_{3}, in the sense of Renaming and Substituting Variables in Predicative Formulas. By Renaming and Substituting Variables in Predicative Formulas (i) with Οƒ(0)=i\sigma(0)=i and Οƒ(1)=j\sigma(1)=j for Ο†1\varphi_{1}, and with Οƒ(0)=i\sigma(0)=i, Οƒ(1)=j\sigma(1)=j, Οƒ(2)=k\sigma(2)=k and Οƒ(3)=l\sigma(3)=l for Ο†2\varphi_{2} (the given x0,…,xnβˆ’1x_{0},\dots,x_{n-1} being the first of the distinct set variables x0,x1,…x_{0},x_{1},\dots there, so that x1,…,x4x_{1},\dots,x_{4} above are distinct from x0x_{0} whatever nn is), the formulas Ο†1(xi,xj)\varphi_{1}(x_{i},x_{j}) and Ο†2(xi,xj,xk,xl)\varphi_{2}(x_{i},x_{j},x_{k},x_{l}) are predicative formulas in x0,…,xnβˆ’1x_{0},\dots,x_{n-1} that hold, under every assignment of sets to x0,…,xnβˆ’1x_{0},\dots,x_{n-1}, exactly when Ο†1\varphi_{1} and Ο†2\varphi_{2} hold with their variables assigned the sets assigned to xi,xjx_{i},x_{j} and to xi,xj,xk,xlx_{i},x_{j},x_{k},x_{l}. This proves (i) and (ii).

The class of separable metrics. Let XX be a set. Apply The Class Comprehension Theorem for Predicative Formulas (i) to Ο†1\varphi_{1}, with x1x_{1} as its single variable and x0x_{0}, N\mathbb{N}, R\mathbb{R}, ++, 00 and ≀\le as its parameters, x0x_{0} being assigned XX. It gives a class SS such that, for every set dd, d∈Sd\in S if and only if Ο†1\varphi_{1} holds with x0x_{0} assigned XX and x1x_{1} assigned dd, that is, by the above and Metric Space (vi), exactly when dd is a map d:XΓ—Xβ†’Rd:X\times X\to\mathbb{R} that is a metric on XX with (X,d)(X,d) separable. As the elements of SS and these maps are all sets (such a map lies in the class RXΓ—X\mathbb{R}^{X\times X}, as dVd_{V} did above), the same holds for every class dd, which proves (iii).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…